Design Of Efficient Algorithms Research Articles

Research on a High-Dynamics Acquisition Algorithm for New Binary Offset Carrier Signal in UAV Communication

As unmanned aerial vehicles (UAVs) are widely used in various fields, there is an increasing demand for UAV anti-jamming, multipath mitigation, and covert secrecy. Frequency-hopping binary offset carrier (FH-BOC) signals possess higher anti-jamming and multipath mitigation capabilities than direct-sequence spread spectrum (DSSS) and binary offset carrier (BOC) signals. A prerequisite for constructing communication links between UAVs using FH-BOC signals is the design of efficient acquisition algorithms to capture the signals successfully. In this paper, the modulation and characteristics of the FH-BOC signal are introduced. The maximum relative velocity between UAVs is 5.5 km/s, the maximum acceleration is 50 g, and the maximum plus acceleration is 20 g/s. In this high dynamic environment, the parameters for the parallel code phase and Partial Matched Filter–Fast Fourier Transform (PMF-FFT) acquisition algorithms targeting FH-BOC(10,1) signals are designed, and the acquisition performance of these algorithms is comparatively analyzed. The acquisition time for the first and second algorithms is 4.3317 s and 6.137 s. The number of real additions required by the first and second algorithms is approximately 10.9×109 and 8.9×109, and the number of real multiplications is approximately 7.6×109 and 6.7×109. This helps in selecting the acquisition algorithm when FH-BOC signals are used to build inter-UAV communication links.

Local Differential Privacy for correlated location data release in ITS

The ubiquity of location positioning devices has facilitated the implementation of various Intelligent Transportation System (ITS) applications that generate an enormous volume of location data. Recently, Local Differential Privacy (LDP) has been proposed as a rigorous privacy framework that permits the continuous release of aggregate location statistics without relying on a trusted data curator. However, the conventional LDP was built upon the assumption of independent data, which may not be suitable for inherently correlated location data. This paper investigates the quantification of potential privacy leakage in a correlated location data release scenario under a local setting, which has not been addressed in the literature. Our analysis shows that the privacy guarantee of LDP could be degraded in the presence of spatial–temporal and user correlations, albeit the perturbation is performed locally and independently by the users. This privacy guarantee is bounded by a privacy barrier that is affected by the intensity of correlations. We derive several important closed-form expressions and design efficient algorithms to compute such privacy leakage in a correlated location data. We subsequently propose a Δ-CLDP model that enhances the conventional LDP by incorporating the data correlations, and design a generic LDP data release framework that renders adaptive personalization of privacy preservation. Extensive theoretical analyses and simulations on scalable real datasets validate the security and performance efficiency of our work.

On the Geodetic and Strong Geodetic Parameters of Certain Hypercubic Networks

Networks derived from the hypercube are noted for their efficiency in simulating any bounded-degree communication network and hence they play a significant role in parallel machines. For a graph [Formula: see text], a geodetic cover is a subset [Formula: see text] of [Formula: see text], satisfying the condition that every vertex of [Formula: see text] other than the vertices in [Formula: see text] are covered using geodesics connecting any two vertices in [Formula: see text]. The geodetic number of [Formula: see text] is the least order of such covers in [Formula: see text]. This seminal distance-based parameter is well employed in the areas of location theory, convexity theory and game theory. The strong variant and its edge version are recent variations of the problem that were introduced in due of their applications in social networks. The most established and strong hypercube derivative networks are studied in this paper with respect to certain geodetic parameters. Notably, among the networks that we have considered, the butterfly and the Benes networks belong to the class of bipartite graphs for which the geodetic number problem and its strong version are NP-complete. We have determined the geodetic parameters that include the geodetic number, the strong geodetic number and their corresponding edge variants of the networks taken into consideration. In the process, we have identified a new class of graphs, as semi-extreme edge geodesic graphs and that the enhanced butterfly networks belong to this class. The study of such geodetic parameters in the structural models of parallel computation could be useful for the design of efficient algorithms for the structures considered.

IDHS-RGME: Identification of DNase I hypersensitive sites by integrating information on nucleotide composition and physicochemical properties

As pivotal markers of chromatin accessibility, DNase I hypersensitive sites (DHSs) intimately link to fundamental biological processes encompassing gene expression regulation and disease pathogenesis. Developing efficient and precise algorithms for DHSs identification holds paramount importance for unraveling genome functionality and elucidating disease mechanisms. This study innovatively presents iDHS-RGME, an Extremely Randomized Trees (Extra-Trees)-based algorithm that integrates unique feature extraction techniques for enhanced DHSs prediction. Specifically, iDHS-RGME utilizes two feature extraction approaches: Reverse Complementary Kmer (RCKmer) and Geary Spatial Autocorrelation (GSA), which comprehensively capture sequence attributes from diverse angles, bolstering information richness and accuracy. To address data imbalance, Borderline-SMOTE is employed, followed by Maximum Information Coefficient (MIC) for meticulous feature selection. Comparative evaluations underscored the superiority of the Extra-Trees classifier, which was subsequently adopted for model prediction. Through rigorous five-fold cross-validation, iDHS-RGME achieved remarkable accuracies of 94.71 % and 95.07 % on two independent datasets, outperforming previous models in terms of both precision and effectiveness.

Mission-oriented capability evaluation for combat network based on operation loops

With continuous growth in scale, topology complexity, mission phases, and mission diversity, challenges have been placed for efficient capability evaluation of modern combat systems. Aiming at the problems of insufficient mission consideration and single evaluation dimension in the existing evaluation approaches, this study proposes a mission-oriented capability evaluation method for combat systems based on operation loop. Firstly, a combat network model is given that takes into account the capability properties of combat nodes. Then, based on the transition matrix between combat nodes, an efficient algorithm for operation loop identification is proposed based on the Breadth-First Search. Given the mission-capability satisfaction of nodes, the effectiveness evaluation indexes for operation loops and combat network are proposed, followed by node importance measure. Through a case study of the combat scenario involving space-based support against surface ships under different strategies, the effectiveness of the proposed method is verified. The results indicated that the ROI-priority attack method has a notable impact on reducing the overall efficiency of the network, whereas the O-L betweenness-priority attack is more effective in obstructing the successful execution of enemy attack missions.

Application of Object Detection Algorithm for Efficient Damages Identification of the Conservation of Heritage Buildings

ABSTRACTHeritage buildings are crucial for any area's cultural and political aspects. Proper maintenance and monitoring are essential for the conservation of these buildings. However, manual inspections are time‐consuming and expensive. We propose a deep learning–based detection framework to identify the damages on the ancient architectural wall. The algorithm applied in this study is YOLOv5. Comparing its five different versions, it was decided to use YOLOv5m as the most accurate detection algorithm with a mAP of 0.801. The damage types identified are physical weathering and visitors' scratches. High‐resolution images were selected for the experiment and effectively identified image. In addition, the applied algorithm allows real‐time detection and the identification of seasonal sources of disruption, which is proved by the video test in this study. The findings contribute to the development of an intelligent tool for health monitoring with the goal of fast and remote damage detection in the routine maintenance of heritage buildings.

Stochastic analysis of drift error of gyroscope in the single-axis attitude determination

Understanding and mitigating the various stochastic errors in gyroscope measurements is crucial for accurate attitude determination. White noise and bias instability can introduce drift errors, reducing the system’s accuracy. Efficient sensor selection and algorithm design necessitate a thorough understanding of these influences and how they propagate throughout the system. This paper addresses the propagation of significant stochastic errors in the attitude determination system, including white noise (angle random walk), bias instability, rate random walk, and correlated noise. The paper discusses the modeling strategy and statistical characteristics of these error contributors. It then evaluates the variance propagation of these errors within the output of a single-axis attitude determination system. The presented analysis calculates and compares the impact of each source of error on the system’s precision over time. Experiments with the MPU6050 and L3G4200D sensors are conducted to validate the analytical results.

Hyperspectral Image Classification Based on Two-Branch Multiscale Spatial Spectral Feature Fusion with Self-Attention Mechanisms

In recent years, the use of deep neural network in effective network feature extraction and the design of efficient and high-precision hyperspectral image classification algorithms has gradually become a research hotspot for scholars. However, due to the difficulty of obtaining hyperspectral images and the high cost of annotation, the training samples are very limited. In order to cope with the small sample problem, researchers often deepen the network model and use the attention mechanism to extract features; however, as the network model continues to deepen, the gradient disappears, the feature extraction ability is insufficient, and the computational cost is high. Therefore, how to make full use of the spectral and spatial information in limited samples has gradually become a difficult problem. In order to cope with such problems, this paper proposes two-branch multiscale spatial–spectral feature aggregation with a self-attention mechanism for a hyperspectral image classification model (FHDANet); the model constructs a dense two-branch pyramid structure, which can achieve the high efficiency extraction of joint spatial–spectral feature information and spectral feature information, reduce feature loss to a large extent, and strengthen the model’s ability to extract contextual information. A channel–space attention module, ECBAM, is proposed, which greatly improves the extraction ability of the model for salient features, and a spatial information extraction module based on the deep feature fusion strategy HLDFF is proposed, which fully strengthens feature reusability and mitigates the feature loss problem brought about by the deepening of the model. Compared with five hyperspectral image classification algorithms, SVM, SSRN, A2S2K-ResNet, HyBridSN, SSDGL, RSSGL and LANet, this method significantly improves the classification performance on four representative datasets. Experiments have demonstrated that FHDANet can better extract and utilise the spatial and spectral information in hyperspectral images with excellent classification performance under small sample conditions.

MEIAT-CMAQ: A modular emission inventory allocation tool for Community Multiscale Air Quality Model

The Modular Emission Inventory Allocation Tool for Community Multiscale Air Quality Model (MEIAT-CMAQ) refines emission inventories by providing detailed spatial (horizontal and vertical), temporal, and species allocations, enhancing the accuracy of CMAQ performance. Its efficient algorithm and modular design offer flexibility for managing both gridded and tabulated inventories, widely used in various sectors. In addition, the shapefiles with specific shapes supported by MEIAT-CMAQ can address the allocation challenges in transportation emissions. The evaluation of MEIAT-CMAQ, using model-ready inventories before (BASE scenario), and after allocation without (EXPR scenario) or with (EXPR-V scenario) vertical allocation, demonstrates significant improvements in the mean bias (MB) of gaseous pollutants (O₃, NO₂, CO). In both the EXPR and EXPR-V scenarios, the MB for O3 exhibits notable enhancements, with respective improvements of 5.7% and 26.9%. For NO₂, corresponding MB improvements are even more pronounced, reaching 27.6% and 61.7% in the EXPR and EXPR-V scenarios, respectively. Likewise, enhancements are observed in the MBs of CO, demonstrating increases of 8.4% and 45.2% in the EXPR and EXPR-V scenarios, respectively. Moreover, with regard to spatial accuracy, the incorporation of the MEIAT-CMAQ model yields significant improvements. Specifically, in the EXPR scenarios, spatial accuracy for O3 and NO2 demonstrates respective enhancements of 13.5% and 9.5%. Furthermore, the inclusion of vertical allocation leads to additional enhancements in CO, NO₂, and PM2.5, resulting in improvements of 17.6%, 16.6%, and 23.2%, respectively. MEIAT-CMAQ provides an efficient method for transforming coarse-resolution emission inventories into high-resolution files directly useable in the model, offering enhanced flexibility for users to select any period for generating model-ready emission files. This capability provides substantial technical support for automating processes within business departments and significantly improves the performance of high-resolution modeling and forecasting.

Energy efficient sorting, selection and searching

In this paper, we introduce a model for studying energy efficient algorithms by extending the well-studied comparison model. In our model, the result of a comparison is determined based on two parameters: (i) the energy used to perform a comparison, and (ii) the absolute difference between the two values being compared – thus introducing an energy-accuracy trade-off. This model also extends the ideas presented by Geissmann and Penna [SOFSEM 2018] and Funke et al. [Comput. Geom. 2005] wherein they use two distinct types of comparisons namely low and full-energy (cheap and expensive) comparisons, by introducing multiple types of comparisons. In this extension, the accuracy of a comparison becomes a function of the energy used. We consider the fundamental problems of (i) sorting (ii) selection (iii) searching, and design efficient algorithms for these problems in the new model. We also present lower bounds on the energy usage for some of these problems, showing that some of our algorithms are asymptotically optimal with respect to the energy usage.

Quantum dueling: an efficient solution for combinatorial optimization

In this paper, we present a new algorithm for generic combinatorial optimization, which we term quantum dueling. Traditionally, potential solutions to the given optimization problems were encoded in a ‘register’ of qubits. Various techniques are used to increase the probability of finding the best solution upon measurement. Quantum dueling innovates by integrating an additional qubit register, effectively creating a ‘dueling’ scenario where two sets of solutions compete. This dual-register setup allows for a dynamic amplification process: in each iteration, one register is designated as the ‘opponent,’ against which the other register’s more favorable solutions are enhanced through a controlled quantum search. This iterative process gradually steers the quantum state within both registers toward the optimal solution. With a quantitative contraction for the evolution of the state vector, classical simulation under a broad range of scenarios and hyper-parameter selection schemes shows that a quadratic speedup is achieved, which is further tested in more real-world situations. In addition, quantum dueling can be generalized to incorporate arbitrary quantum search techniques and as a quantum subroutine within a higher-level algorithm. Our work demonstrates that increasing the number of qubits allows the development of previously unthought-of algorithms, paving the way for advancement of efficient quantum algorithm design.

Utilizing Nearest-Neighbor Clustering for Addressing Imbalanced Datasets in Bioengineering.

Imbalance classification is common in scenarios like fault diagnosis, intrusion detection, and medical diagnosis, where obtaining abnormal data is difficult. This article addresses a one-class problem, implementing and refining the One-Class Nearest-Neighbor (OCNN) algorithm. The original inter-quartile range mechanism is replaced with the K-means with outlier removal (KMOR) algorithm for efficient outlier identification in the target class. Parameters are optimized by treating these outliers as non-target-class samples. A new algorithm, the Location-based Nearest-Neighbor (LBNN) algorithm, clusters one-class training data using KMOR and calculates the farthest distance and percentile for each test data point to determine if it belongs to the target class. Experiments cover parameter studies, validation on eight standard imbalanced datasets from KEEL, and three applications on real medical imbalanced datasets. Results show superior performance in precision, recall, and G-means compared to traditional classification models, making it effective for handling imbalanced data challenges.

Research on bronze wine vessel classification using improved SSA-CBAM-GNNs.

This article proposes an advanced classification algorithm for bronze drinking utensils, taking into account the complexity of their cultural characteristics and the challenges of dynasty classification. The SSA-CBAM-GNNs algorithm integrates the Sparrow Search Algorithm (SSA), Spatial and Spectral Attention (CBAM) modules, and Graph Neural Networks (GNNs). The CBAM module is essential for optimizing feature extraction weights in graph neural networks, while SSA enhances the weighted network and expedites the convergence process. Experimental results, validated through various performance evaluation indicators, illustrate the outstanding performance of the improved SSA-CBAM-GNNs algorithm in accurately identifying and classifying cultural features of bronze drinking utensils. Comparative experiments confirm the algorithm's superiority over other methods. Overall, this study proposes a highly efficient identification and classification algorithm, and its effectiveness and excellence in extracting and identifying cultural features of bronze drinking utensils are experimentally demonstrated.

Tradeoffs in alignment and assembly-based methods for structural variant detection with long-read sequencing data

Long-read sequencing offers long contiguous DNA fragments, facilitating diploid genome assembly and structural variant (SV) detection. Efficient and robust algorithms for SV identification are crucial with increasing data availability. Alignment-based methods, favored for their computational efficiency and lower coverage requirements, are prominent. Alternative approaches, relying solely on available reads for de novo genome assembly and employing assembly-based tools for SV detection via comparison to a reference genome, demand significantly more computational resources. However, the lack of comprehensive benchmarking constrains our comprehension and hampers further algorithm development. Here we systematically compare 14 read alignment-based SV calling methods (including 4 deep learning-based methods and 1 hybrid method), and 4 assembly-based SV calling methods, alongside 4 upstream aligners and 7 assemblers. Assembly-based tools excel in detecting large SVs, especially insertions, and exhibit robustness to evaluation parameter changes and coverage fluctuations. Conversely, alignment-based tools demonstrate superior genotyping accuracy at low sequencing coverage (5-10×) and excel in detecting complex SVs, like translocations, inversions, and duplications. Our evaluation provides performance insights, highlighting the absence of a universally superior tool. We furnish guidelines across 31 criteria combinations, aiding users in selecting the most suitable tools for diverse scenarios and offering directions for further method development.

Automated Waste Sorting System

Abstract: Managing solid waste through recycling is a crucial measure to mitigate adverse effects like sanitation and health issues arising from excessive landfill usage. However, the intricacies and costs associated with sorting solid waste pose challenges to recycling efforts. To streamline this process, our study proposes a Deep Learning approach employing computer vision to automatically recognize and categorize waste into five primary types: plastic, metal, paper, cardboard, and glass. Our conceptual system entails an automated recycling bin that opens its lid corresponding to the identified waste type. The primary focus of our work lies in the development and optimization of Machine Learning algorithms for efficient waste identification. We utilized pre-existing images to train a minimum of 12 variants of the Convolutional Neural Network (CNN) algorithm across three classifiers: Support Vector Machine (SVM), Sigmoid, and SoftMax. Our findings reveal that the VGG19 model with a SoftMax classifier achieves an accuracy of approximately 88%.

Semi-definite programming and quantum information

Abstract This paper presents a comprehensive exploration of semi-definite programming (SDP) techniques within the context of quantum information. It examines the mathematical foundations of convex optimization, duality, and SDP formulations, providing a solid theoretical framework for addressing optimization challenges in quantum systems. By leveraging these tools, researchers and practitioners can characterize classical and quantum correlations, optimize quantum states, and design efficient quantum algorithms and protocols. The paper also discusses implementational aspects, such as solvers for SDP and modeling tools, enabling the effective employment of optimization techniques in quantum information processing. The insights and methodologies presented in this paper have proven instrumental in advancing the field of quantum information, facilitating the development of novel communication protocols, self-testing methods, and a deeper understanding of quantum entanglement.

Blockchain-enabled electric vehicle orderly charging optimization

The increasing prevalence of electric vehicles (EVs) urges charging station operators (CSOs) to expand their networks. However, currently CSOs operate independent EV charging service platforms separately, which poses inconvenience for EV users and hinders the efficient utilization of charging infrastructure. This paper introduces a consortium blockchain-enabled EV charging service platform (CB-EVCSP), which leverages novel orderly charging guidance models (OCGMs) encoded as smart contracts to integrate and coordinate the efforts of CSOs. The CB-EVCSP not only mitigates trust and security concerns but also enhances the utilization of charging facilities. Both multinomial logit (MNL) and mixed MNL models are developed to characterize the interaction between charging station recommendations and EV users’ choice behaviors, where a coefficient of variation based fairness criterion is used to ensure distribution fairness. We provide equivalent reformulations and design efficient constraint generation algorithms. Numerical experiments are conducted to validate the effectiveness of the proposed models and algorithms.

May the privacy be with us: Correlated differential privacy in location data for ITS

With the development of Intelligent Transportation Systems (ITS), a vast amount of location data is being generated from various IoT devices equipped with location positioning sensors. Preserving the privacy of location data release is a critical concern, as the publication of aggregated data often reveals private information about the users. Differential Privacy (DP) has recently emerged as a robust framework to guarantee privacy in this context. However, conventional DP mechanisms commonly make no assumption about the distribution of the input data, which could lead to unexpected privacy leakage if the data are correlated. In this paper, we investigate the complex simultaneous impact of user correlation, spatial–temporal correlation and prior knowledge of an adversary on the privacy leakage of a DP mechanism, which has not been addressed in prior work. We derive several closed-form expressions that demonstrate and quantify the privacy leakage under correlated location data, followed by the design of efficient algorithms to compute such privacy leakage. Then, we propose a Δ-CDP (Correlated Differential Privacy) to provide a formal privacy guarantee against the additional privacy leakage incurred by these factors. Extensive comparisons, theoretical analysis, and experimental simulations are presented to validate the correctness and efficiency of the proposed work.

A novel efficient S-box design algorithm based on a new chaotic map and permutation

A novel efficient S-box design algorithm based on a new chaotic map and permutation

Development of an efficient machine learning algorithm for reliable credit card fraud identification and protection systems

Recent developments in e-commerce and e-payment systems have led to a rise in financial fraud incidents, particularly credit card fraud. Software tools to identify credit card theft are essential. Critical characteristics of credit card fraud are crucial in utilizing Machine Learning (ML) for credit card fraud identification and must be selected carefully. This study suggests a An Efficient Machine Learning Algorithm for Reliable Credit Card Fraud Identification (EMLA-RCCFI) was constructed using ML, which utilizes the Genetic Algorithm (GA) to select features. Once the optimum characteristics are determined, the suggested detecting module utilizes the subsequent ML-based classifications. The proposed EMLA-RCCFI system is assessed using a dataset produced by European cardholders to confirm its efficacy. Based on the results, the suggested EMLA-RCCFI method surpassed existing systems regarding accuracy, precision, and F score.