Search

Most image quality assessment (IQA) algorithms based on sparse representation primarily focus on amplitude information, often overlooking the structural composition of images. However, structural composition is closely linked to perceived image quality, a connection that existing methods do not adequately address. To fill this gap, this paper proposes a novel distorted-image quality assessment algorithm based on a sparse structure and subjective perception (IQA-SSSP). This algorithm evaluates the quality of distorted images by measuring the sparse structure similarity between a reference and distorted images. The proposed method has several advantages. First, the sparse structure algorithm operates with reduced computational complexity, leading to faster processing speeds, which makes it suitable for practical applications. Additionally, it efficiently handles large-scale data, further enhancing the assessment process. Experimental results validate the effectiveness of the algorithm, showing that it achieves a high correlation with human visual perception, as reflected in both objective and subjective evaluations. Specifically, the algorithm yielded a Pearson correlation coefficient of 0.929 and a mean squared error of 8.003, demonstrating its robustness and efficiency. By addressing the limitations of existing IQA methods and introducing a more holistic approach, this paper offers new perspectives on IQA. The proposed algorithm not only provides reliable quality assessment results but also closely aligns with human visual experience, thereby enhancing both the objectivity and accuracy of image quality evaluations. This research offers significant theoretical support for the advancement of sparse representation in IQA. [ABSTRACT FROM AUTHOR]

The problem of information security and copyright protection of video is becoming increasingly prominent. The current video watermarking algorithm does not have strong anti-compression, which has a significant impact on the visual effect of video. To solve this problem, this paper proposes a video watermarking algorithm based on H.264/AVC. The algorithm combines the non-zero quantization coefficient and the energy factor to select the appropriate chroma subblock, and then an optimized modulation is designed to embed the watermark into its DCT quantization coefficients in order to minimize the number of modifications of the subblocks. The invisibility and robustness experiments of the algorithm are conducted in the paper, and the Structural Similarity Indexes are above 0.99, and the False Bit Rates are all below 0.03. The results show that the algorithm has good invisibility, anti-compression performance and obvious advantages compared with other similar methods. [ABSTRACT FROM AUTHOR]

The time and spatial complexities are HT ht and HT ht , respectively. Published Papers This is a Special Issue of I Mathematics i belonging to the section "Mathematics and Computer Science", which was closed on 30 June 2022. This Special Issue was mainly concerned with quantum algorithms, the mathematics underlying them, and those complexity issues arising from them. [Extracted from the article]

This paper employs an integral reinforcement learning (IRL) method to investigate the optimal tracking control problem (OTCP) for nonlinear nonzero-sum (NZS) differential game systems with unknown drift dynamics. Unlike existing methods, which can only bound the tracking error, the proposed approach ensures that the tracking error asymptotically converges to zero. This study begins by constructing an augmented system using the tracking error and reference signal, transforming the original OTCP into solving the coupled Hamilton–Jacobi (HJ) equation of the augmented system. Because the HJ equation contains unknown drift dynamics and cannot be directly solved, the IRL method is utilized to convert the HJ equation into an equivalent equation without unknown drift dynamics. To solve this equation, a critic neural network (NN) is employed to approximate the complex value function based on the tracking error and reference information data. For the unknown NN weights, the least squares (LS) method is used to design an estimation law, and the convergence of the weight estimation error is subsequently proven. The approximate solution of optimal control converges to the Nash equilibrium, and the tracking error asymptotically converges to zero in the closed system. Finally, we validate the effectiveness of the proposed method in this paper based on MATLAB using the ode45 method and least squares method to execute Algorithm 2. [ABSTRACT FROM AUTHOR]

In Mobile Crowdsensing (MCS), sensing tasks have different impacts and contributions to the whole system or specific targets, so the importance of the tasks is different. Since resources for performing tasks are usually limited, prioritizing the allocation of resources to more important tasks can ensure that key data or information can be collected promptly and accurately, thus improving overall efficiency and performance. Therefore, it is very important to consider the importance of tasks in the task selection and allocation of MCS. In this paper, a task queue is established, the importance of tasks, the ability of participants to perform tasks, and the stability of the task queue are considered, and a novel task selection and allocation scheme (TSAS) in the MCS system is designed. This scheme introduces the Lyapunov optimization method, which can be used to dynamically keep the task queue stable, balance the execution ability of participants and the system load, and perform more important tasks in different system states, even when the participants are limited. In addition, the Double Deep Q-Network (DDQN) method is introduced to improve on the traditional solution of the Lyapunov optimization problem, so this scheme has a certain predictive ability and foresight on the impact of future system states. This paper also proposes action-masking and iterative training methods for the MCS system, which can accelerate the training process of the neural network in the DDQN and improve the training effect. Experiments show that the TSAS based on the Lyapunov optimization method and DDQN performs better than other algorithms, considering the long-term stability of the queue, the number and importance of tasks to be executed, and the congestion degree of tasks. [ABSTRACT FROM AUTHOR]

This paper proposes a road crack detection algorithm based on an improved SparseInst network, called the SparseInst-CDSM algorithm, aimed at solving the problems of low recognition accuracy and poor real-time detection of existing algorithms. The algorithm introduces the CBAM module, DCNv2 convolution, SPM strip pooling module, MPM mixed pooling module, etc., effectively improving the integrity and accuracy of crack recognition. At the same time, the central axis skeleton of the crack is extracted using the central axis method, and the length and maximum width of the crack are calculated. In the experimental comparison under the self-built crack dataset, SparseInst-CDSM has an accuracy of 93.66%, a precision of 67.35%, a recall of 66.72%, and an IoU of 84.74%, all higher than mainstream segmentation models such as Mask-RCNN and SOLO that were compared, reflecting the superiority of the algorithm proposed in this paper. The comparison results of actual measurements show that the algorithm error is within 10%, indicating that it has high effectiveness and practicality. [ABSTRACT FROM AUTHOR]

List intersection plays a pivotal role in various domains such as search engines, database systems, and social networks. Efficient indexes and query strategies can significantly enhance the efficiency of list intersection. Existing inverted index-based algorithms fail to utilize the length information of documents and require excessive list intersections, resulting in lower efficiency. To address this issue, in this paper, we propose the LDRpV (Length-based Document Reordering plus Verification) algorithm. LDRpV filters out documents that are unlikely to satisfy the intersection results by reordering documents based on their length, thereby reducing the number of candidates. Additionally, to minimize the number of list intersection operations, an intersection and verification strategy is designed, where only the first m lists are intersected, and the resulting candidate set is directly verified. This approach effectively improves the efficiency of list intersection. Experimental results on four real datasets demonstrate that LDRpV can achieve a maximum efficiency improvement of 46.69% compared to the most competitive counterparts. [ABSTRACT FROM AUTHOR]

Path-planning research has been the key to mobile-robot-navigation technology. However, traditional path-planning algorithms have some shortcomings. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constrained A* algorithm with the Dynamic Window Approach (DWA) algorithm. The kinematical constrained A* algorithm can plan the global path, and then the DWA algorithm can plan the local path under the global path's guidance. Firstly, combined with robot kinematics, we improve the node-expansion method and heuristic-function model of the A* algorithm, which improves the search efficiency, reduces the number of path bends and lowers the computational cost so that the path generated by the A* algorithm better meets the needs of robot motion. Secondly, we optimize the trajectory-evaluation function of the DWA algorithm so that the local paths planned by the DWA algorithm are smoother and more coherent, which is easier for robot-motion execution. Finally, we extract the key nodes from the global path planned by the A* algorithm to guide the DWA algorithm for local path planning and dynamic-obstacle avoidance and to make the local path closer to the global path. Through simulation and practical experiments, the effectiveness of the fusion algorithm proposed in this paper is verified. [ABSTRACT FROM AUTHOR]

In this study, we extended the applicability of a derivative-free algorithm to encompass the solution of operators that may be either differentiable or non-differentiable. Conditions weaker than the ones in earlier studies are employed for the convergence analysis. The earlier results considered assumptions up to the existence of the ninth order derivative of the main operator, even though there are no derivatives in the algorithm, and the Taylor series on the finite Euclidian space restricts the applicability of the algorithm. Moreover, the previous results could not be used for non-differentiable equations, although the algorithm could converge. The new local result used only conditions on the divided difference in the algorithm to show the convergence. Moreover, the more challenging semi-local convergence that had not previously been studied was considered using majorizing sequences. The paper included results on the upper bounds of the error estimates and domains where there was only one solution for the equation. The methodology of this paper is applicable to other algorithms using inverses and in the setting of a Banach space. Numerical examples further validate our approach. [ABSTRACT FROM AUTHOR]

Product disassembly is an effective means of waste recycling and reutilization that has received much attention recently. In terms of disassembly efficiency, the number of disassembly skills possessed by workers plays a crucial role in improving disassembly efficiency. Therefore, in order to effectively and reasonably disassemble discarded products, this paper proposes a partial parallel disassembly line balancing problem (PP-DLBP) that takes into account the number of worker skills. In this paper, the disassembly tasks and the disassembly relationships between components are described using AND–OR graphs. In this paper, a multi-objective optimization model is established aiming to maximize the net profit of disassembly and minimize the number of skills for the workers. Based on the bat algorithm (BA), we propose an improved discrete bat algorithm (IDBA), which involves designing adaptive composite optimization operators to replace the original continuous formula expressions and applying them to solve the PP-DLBP. To demonstrate the advantages of IDBA, we compares it with NSGA-II, NSGA-III, SPEA-II, ESPEA, and MOEA/D. Experimental results show that IDBA outperforms the other five algorithms in real disassembly cases and exhibits high efficiency. [ABSTRACT FROM AUTHOR]

Fault detection and localization are vital for ensuring the stability of data center networks (DCNs). Specifically, adaptive fault diagnosis is deemed a fundamental technology in achieving the fault tolerance of systems. The highly scalable data center network (HSDC) is a promising structure of server-centric DCNs, as it exhibits the capacity for incremental scalability, coupled with the assurance of low cost and energy consumption, low diameter, and high bisection width. In this paper, we first determine that both the connectivity and diagnosability of the m-dimensional complete HSDC, denoted by H S D C m (m) , are m. Further, we propose an efficient adaptive fault diagnosis algorithm to diagnose an H S D C m (m) within three test rounds, and at most N + 4 m (m − 2) tests with m ≥ 3 (resp. at most nine tests with m = 2 ), where N = m · 2 m is the total number of nodes in H S D C m (m) . Our experimental outcomes demonstrate that this diagnosis scheme of HSDC can achieve complete diagnosis and significantly reduce the number of required tests. [ABSTRACT FROM AUTHOR]

Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). To evaluate FSAs effectively, controlled environments are required, and the use of synthetic datasets offers significant advantages. We introduce a set of ten synthetically generated datasets with known relevance, redundancy, and irrelevance of features, derived from various mathematical, logical, and geometric sources. Additionally, eight FSAs are evaluated on these datasets based on their relevance and novelty. The paper first introduces the datasets and then provides a comprehensive experimental analysis of the performance of the selected FSAs on these datasets including testing the FSAs' resilience on two types of induced data noise. The analysis has guided the grouping of the generated datasets into four groups of data complexity. Lastly, we provide public access to the generated datasets to facilitate bench-marking of new feature selection algorithms in the field via our Github repository. The contributions of this paper aim to foster the development of novel feature selection algorithms and advance their study. [ABSTRACT FROM AUTHOR]

Graph query languages such as Cypher are widely adopted to match and retrieve data in a graph representation, due to their ability to retrieve and transform information. Even though the most natural way to match and transform information is through rewriting rules, those are scarcely or partially adopted in graph query languages. Their inability to do so has a major impact on the subsequent way the information is structured, as it might then appear more natural to provide major constraints over the data representation to fix the way the information should be represented. On the other hand, recent works are starting to move towards the opposite direction, as the provision of a truly general semistructured model (GSM) allows to both represent all the available data formats (Network-Based, Relational, and Semistructured) as well as support a holistic query language expressing all major queries in such languages. In this paper, we show that the usage of GSM enables the definition of a general rewriting mechanism which can be expressed in current graph query languages only at the cost of adhering the query to the specificity of the underlying data representation. We formalise the proposed query language in terms declarative graph rewriting mechanisms described as a set of production rules L → R while both providing restriction to the characterisation of L, and extending it to support structural graph nesting operations, useful to aggregate similar information around an entry-point of interest. We further achieve our declarative requirements by determining the order in which the data should be rewritten and multiple rules should be applied while ensuring the application of such updates on the GSM database is persisted in subsequent rewriting calls. We discuss how GSM, by fully supporting index-based data representation, allows for a better physical model implementation leveraging the benefits of columnar database storage. Preliminary benchmarks show the scalability of this proposed implementation in comparison with state-of-the-art implementations. [ABSTRACT FROM AUTHOR]

This paper presents convergence analysis of a novel data-driven feedback control algorithm designed for generating online controls based on partial noisy observational data. The algorithm comprises a particle filter-enabled state estimation component, estimating the controlled system's state via indirect observations, alongside an efficient stochastic maximum principle-type optimal control solver. By integrating weak convergence techniques for the particle filter with convergence analysis for the stochastic maximum principle control solver, we derive a weak convergence result for the optimization procedure in search of optimal data-driven feedback control. Numerical experiments are performed to validate the theoretical findings. [ABSTRACT FROM AUTHOR]

When aimed at minimizing both the classification error and the number of selected features, feature selection can be treated as a bi-objective optimization problem suitable for solving with multi-objective evolutionary algorithms (MOEAs). However, traditional MOEAs may encounter difficulties due to discrete optimization environments and the curse of dimensionality in the feature space, especially for high-dimensional datasets. Therefore, in this paper an interpolation-based evolutionary algorithm (termed IPEA) is proposed for tackling bi-objective feature selection in classification, where an interpolation based initialization method is designed for covering a wide range of search space and exploring the adaptively detected regions of interest. In experiments, IPEA is been compared with four state-of-the-art MOEAs in terms of two widely-used performance metrics on a list of 20 public real-world classification datasets with the dimensionality ranging from low to high. The overall empirical results suggest that IPEA generally performs the best of all tested algorithms, with significantly better search abilities and much lower computational time cost. [ABSTRACT FROM AUTHOR]

The problem of optimisation methods is the stagnation of population P, which results in a local solution for the task. This problem can be solved by employing an archive for good historical solutions outperformed by the new better offspring. The archive A was introduced with the variant of adaptive differential evolution (DE), and it was successfully applied in many adaptive DE variants including the efficient jSO algorithm. In the original jSO, the historical good individuals replace the random existing positions in A. It causes that outperformed historical solution from P with lower quality to replace the stored solution in A with better quality. In this paper, a new approach to replace individuals in archive A more progressively is proposed. Outperformed individuals from P replace solutions in the worse part of A based on the function value. The portion of A selected for replacement is controlled by the input parameter, and its setting is studied in this experiment. The proposed progressive archive is employed in the original jSO. Moreover, the Eigenvector transformation of the individuals for crossover is applied to increase the efficiency for the rotated optimisation problems. The efficiency of the proposed progressive archive and the Eigen crossover are evaluated using the set of 29 optimisation problems for CEC 2024 and various dimensionality. All the experiments were performed on a standard PC, and the results were compared using the standard statistical methods. The newly proposed algorithm with the progressive archive approach performs substantially better than the original jSO, especially when 20 or 40 % of the worse individuals of A are set for replacement. The Eigen crossover increases the performance of the proposed jSO algorithm with the progressive archive approach. The estimated time complexity illustrates the low computational demands of the proposed archive approach. [ABSTRACT FROM AUTHOR]

This paper studies the single-machine scheduling problem with truncated learning effect, time-dependent processing time, and past-sequence-dependent delivery time. The delivery time is the time that the job is delivered to the customer after processing is complete. The goal is to determine an optimal job schedule to minimize the total weighted completion time and maximum tardiness. In order to solve the general situation of the problem, we propose a branch-and-bound algorithm and other heuristic algorithms. Computational experiments also prove the effectiveness of the given algorithms. [ABSTRACT FROM AUTHOR]

In the current landscape where quantum algorithms pose a significant threat to conventional digital signature algorithms, code-based digital signature algorithms have emerged as the primary focus of ongoing research in post-quantum cryptography. Digital signatures play a pivotal role in ensuring non-repudiation and authentication, making them an indispensable cryptographic technique. The vulnerability of most digital signature algorithms to quantum attacks have prompted a significant surge in research on code-based digital signature algorithms, which have emerged as a prominent field within post-quantum cryptography. There are generally three distinct approaches to constructing code-based digital signature algorithms: (1) Developing an algorithm that follows the inverse process of the code-based public-key encryption algorithm; (2) Utilizing zero-knowledge identification algorithms in conjunction with the Fiat–Shamir paradigm to formulate a signature algorithm; (3) Constructing a specialized subset of the syndrome space as the foundation for the digital signature algorithm. Chameleon Signature is a non-interactive signature that operates on the hash and signature paradigm, exhibiting comparable efficiency to conventional schemes. Its distinct advantage lies in the fact that the owner of the public key does not necessarily require access to the corresponding secret key within the Chameleon hash algorithm. Notably, Chameleon signatures possess an inherent characteristic of non-transferability, with their validity ascertainable solely by designated recipients. This paper introduces the first Chameleon hash function based on both KKS and HFE schemes, showcasing its superiority over traditional schemes through rank metrics and big fields for enhanced security. The deployment of Chameleon hash functions within hash-and-sign signature schemes introduces a nuanced layer of security and verification flexibility. This study elucidates the implications of integrating Chameleon hash functions into the recipient's public key infrastructure, highlighting the dual capability it affords authorized parties for secure and adaptable verification processes, alongside mechanisms for the detection of unauthorized alterations. [ABSTRACT FROM AUTHOR]

In recent years, side-channel analysis based on deep learning has garnered significant attention from researchers. A pivotal reason for this lies in the fact that deep learning-based side-channel analysis requires minimal preprocessing of side-channel data. The automatic feature extraction property of deep learning methods drastically reduces the workload for researchers, enabling them to focus more on the core issues of side-channel analysis, namely, extracting sensitive information by attacking devices. However, in prior studies, most scholars have concentrated more on the model construction process, with little research focusing on the choice of optimizers.This paper explores a novel deep learning-based optimization algorithm—CPSGD (combined projection stochastic gradient descent). The algorithm comprises two variants, designed, respectively, for unprotected side-channel analysis (CPSGD1) and desynchronized side-channel analysis (CPSGD2), and their convergence has been theoretically proven. Experimental results demonstrate that, while maintaining the neural network structure unchanged, CPSGD1 exhibits the best performance on unprotected datasets compared to other publicly available optimizers, whereas CPSGD2 performs optimally on desynchronized datasets. [ABSTRACT FROM AUTHOR]

Differential evolution algorithm is a very powerful and recently proposed evolutionary algorithm. Generally, only a mutation operator and predefined parameter values of differential evolution algorithm are utilized to solve various optimization problems, which limits the performance of the algorithm. In this paper, six commonly used mutation operators are divided into three categories according to their own features. A mutation pool is established based on the three categories. A parameter pool with three predefined values is designed. During evolution, three mutation operators are randomly chosen from the three categories, and three parameter values are also randomly selected from the parameter pool. The three groups of mutation operators and parameter values are employed to produce trial vectors. The proposed algorithm makes good use of different mutation operators. Three recently proposed differential evolution variants and three non-differential evolution algorithms are used to make comparisons on the 29 testing functions from CEC. The experimental results have demonstrated that the proposed algorithm is very competitive. The proposed algorithm is utilized to solve three real applications, and the results are superior. [ABSTRACT FROM AUTHOR]

The Averaged One-Dependence Estimators (AODE) is a popular and effective method of Bayesian classification. In AODE, selecting the optimal sub-model based on a cross-validated risk minimization strategy can further enhance classification performance. However, existing cross-validation risk minimization strategies do not consider the differences in attributes in classification decisions. Consequently, this paper introduces an algorithm for Model Selection-based Weighted AODE (SWAODE). To express the differences in attributes in classification decisions, the ODE corresponding to attributes are weighted, with mutual information commonly used in the field of machine learning adopted as weights. Then, these weighted sub-models are evaluated and selected using leave-one-out cross-validation (LOOCV) to determine the best model. The new method can improve the accuracy and robustness of the model and better adapt to different data features, thereby enhancing the performance of the classification algorithm. Experimental results indicate that the algorithm merges the benefits of weighting with model selection, markedly enhancing the classification efficiency of the AODE algorithm. [ABSTRACT FROM AUTHOR]

This work explores a well-established eighth-algebraic-order numerical method belonging to the explicit Numerov-type family. To enhance its efficiency, we integrated a cost-effective algorithm for adjusting the step size. After each step, the algorithm either maintains the current step length, halves it, or doubles it. Any off-step points required by this technique are calculated using a local interpolation function. Numerical tests involving diverse problems demonstrate the significant efficiency improvements achieved through this approach. The method is particularly effective for solving differential equations with oscillatory behavior, showcasing its ability to maintain high accuracy with fewer function evaluations. This advancement is crucial for applications requiring precise solutions over long intervals, such as in physics and engineering. Additionally, the paper provides a comprehensive MATLAB-R2018a implementation, facilitating ease of use and further research in the field. By addressing both computational efficiency and accuracy, this study contributes a valuable tool for the numerical analysis community. [ABSTRACT FROM AUTHOR]

Feature selection is a basic and important step in real applications, such as face recognition and image segmentation. In this paper, we propose a new weakly supervised multi-view feature selection method by utilizing pairwise constraints, i.e., the pairwise constraint-guided multi-view feature selection (PCFS for short) method. In this method, linear projections of all views and a consistent similarity graph with pairwise constraints are jointly optimized to learning discriminative projections. Meanwhile, the l 2 , 0 -norm-based row sparsity constraint is imposed on the concatenation of projections for discriminative feature selection. Then, an iterative algorithm with theoretically guaranteed convergence is developed for the optimization of PCFS. The performance of the proposed PCFS method was evaluated by comprehensive experiments on six benchmark datasets and applications on cancer clustering. The experimental results demonstrate that PCFS exhibited competitive performance in feature selection in comparison with related models. [ABSTRACT FROM AUTHOR]

This paper studies the issue of capacity allocation in multi-rank distribution channel management, a topic that has been significantly overlooked in the existing literature. Departing from conventional approaches, hierarchical priority rules are introduced as constraints, and an innovative assignment integer programming model focusing on capacity selection is formulated. This model goes beyond merely optimizing profit or cost, aiming instead to enhance the overall business orientation of the firm. We propose a greedy algorithm and a priority-based binary particle swarm optimization (PB-BPSO) algorithm. Our numerical results indicate that both algorithms exhibit strong optimization capabilities and rapid solution speeds, especially in large-scale scenarios. Moreover, the model is validated through empirical tests using real-world data. The results demonstrate that the proposed approaches can provide actionable strategies to operators, in practice. [ABSTRACT FROM AUTHOR]

This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD), and presents HPClust, an innovative set of hybrid parallel approaches for its effective solution. By utilizing modern high-performance computing techniques, HPClust enhances key clustering metrics: effectiveness, computational efficiency, and scalability. In contrast to vanilla data parallelism, which only accelerates processing time through the MapReduce framework, our approach unlocks superior performance by leveraging the multi-strategy competitive–cooperative parallelism and intricate properties of the objective function landscape. Unlike other available algorithms that struggle to scale, our algorithm is inherently parallel in nature, improving solution quality through increased scalability and parallelism and outperforming even advanced algorithms designed for small- and medium-sized datasets. Our evaluation of HPClust, featuring four parallel strategies, demonstrates its superiority over traditional and cutting-edge methods by offering better performance in the key metrics. These results also show that parallel processing not only enhances the clustering efficiency, but the accuracy as well. Additionally, we explore the balance between computational efficiency and clustering quality, providing insights into optimal parallel strategies based on dataset specifics and resource availability. This research advances our understanding of parallelism in clustering algorithms, demonstrating that a judicious hybridization of advanced parallel approaches yields optimal results for MSSC-ITD. Experiments on the synthetic data further confirm HPClust's exceptional scalability and robustness to noise. [ABSTRACT FROM AUTHOR]

In order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O'Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is considered to deal with computational aspects. In this paper, the generalized singular value decomposition (GSVD) technique is used for computational aspects, and then Tikhonov regularized total least squares based on the generalized singular value decomposition (GTRTLS) algorithm is proposed, whose time complexity is better than TRTLS. For medium- and large-scale problems, the randomized GSVD method is adopted to establish the randomized GTRTLS (RGTRTLS) algorithm, which reduced the storage requirement, and accelerated the convergence speed of the GTRTLS algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a communication algorithm in which a grayscale image, shared between two parties, can be used to transmit a secret message, by applying the idea introduced in the B92 quantum protocol. The least significant qubits of the pixels' representation in certain regions of the image are used. With the help of a server, the algorithm generates a random message, which can further act as a secret key for cryptographic algorithms in order to secure the data that two parties might want to exchange later on. The chosen representation of the image is NEQR (novel enhanced quantum representation) and the platform used for testing the described idea is IBM Quantum Experience, along with the open-source Python framework called Qiskit. This solution allows users to design, implement quantum circuits (containing various quantum gates), and simulate them using real devices and local simulators. An implementation using this platform for a sample image and the corresponding results are also presented in this paper. [ABSTRACT FROM AUTHOR]

In order to effectively obtain the winter wheat growing area in a large part of the Guanzhong plain, this paper proposes a random forest Guanzhong plain winter wheat extraction algorithm based on spatial features of neighborhood samples using the 250 m resolution spectral imager (MERSI) of the FY-3 satellite as the data source. In this paper, first, the training and validation samples were obtained by constructing a neighborhood sample space sampling model, then the study area was classified using an integrated learning random forest Classifier, and finally the classification data obtained from different time phases were fused using voting game theory to obtain the final classification result map. The land use change and winter wheat distribution change from 2011 to 2014 were also analyzed. The experimental results showed that the overall accuracy of winter wheat obtained after random forest fusion processing was the highest compared with the traditional algorithm, reaching 98.63%. At the same time, LANDSAT 8 images were used to obtain the distribution of winter wheat, and the distribution areas obtained from MERSI data and LANDSAT 8 images were generally consistent in terms of spatial distribution as shown by the distribution areas at the county scale. [ABSTRACT FROM AUTHOR]

Flow Direction Algorithm (FDA) has better searching performance than some traditional optimization algorithms. To give the basic Flow Direction Algorithm more effective searching ability and avoid multiple local minima under the searching space, and enable it to obtain better search results, an improved FDA based on the Lévy flight strategy and the self-renewable method (LSRFDA) was proposed in this paper. The Lévy flight strategy and the self-renewable approach were added to the basic Flow Direction Algorithm. Random parameters generated by the Lévy flight strategy can increase the algorithm's diversity of feasible solutions in a short calculation time and greatly enhance the operational efficiency of the algorithm. The self-renewable method lets the algorithm quickly obtain a better possible solution and jump to the local solution space. Then, this paper tested different mathematical testing functions, including low-dimensional and high-dimensional functions, and the test results were compared with those of different algorithms. This paper includes iterative figures, box plots, and search paths to show the different performances of the LSRFDA. Finally, this paper calculated different engineering optimization problems. The test results show that the proposed algorithm in this paper has better searching ability and quicker searching speed than the basic Flow Direction Algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we study the solution of a singularly perturbed inhomogeneous mixed problem on the half-axis for the Schrödinger equation in the presence of a "strong" turning point for the limit operator on time interval that do not contain focal points. Based on the ideas of the regularization method for asymptotic integration of problems with an unstable spectrum, it is shown how regularizing functions should be constructed for this type of singularity. The paper describes in detail the formalism of the regularization method, justifies the algorithm, constructs an asymptotic solution of any order in a small parameter, and proves a theorem on the asymptotic convergence of the resulting series. [ABSTRACT FROM AUTHOR]

In the face of problems such as information overload and the information cocoon resulting from big data, it is a key point of current research to solve the problem of semantic fuzziness of online reviews and improve the accuracy of personalized recommendation algorithms by using online reviews. Based on the advantage of the probabilistic language term set to deal with fuzzy information and the historical data of online hotel reviews, this paper proposes a collaborative filtering recommendation algorithm for hotels. Firstly, the text data of hotel online reviews are crawled by a crawler and processed by jieba and TF-IDF tools. Secondly, the hotel evaluation attribute set is constructed, and the sentiment analysis of the review statements is carried out with the help of the HowNet sentiment dictionary and manual annotation method. The probabilistic language term set is used to classify the data and derive statistics, and the maximum deviation method is used to determine the weight of each attribute. Then, the cosine similarity formula is fused with the modified cosine similarity formula to calculate the similarity and construct the decision matrix. Finally, combined with the historical data of the user's hotel selection, the hotel recommendation results are generated. This paper collected review data from 10 hotels in Macau from the official "Ctrip" website. The proposed recommendation algorithm model was then applied to process and analyze the data, resulting in the generation of a ranked list of hotel recommendations. To validate the accuracy and effectiveness of this research, the recommendation results were compared with those produced by other algorithms. [ABSTRACT FROM AUTHOR]

In the era of healthcare and its related research fields, the dimensionality problem of high-dimensional data is a massive challenge as it is crucial to identify significant genes while conducting research on diseases like cancer. As a result, studying new Machine Learning (ML) techniques for raw gene expression biomedical data is an important field of research. Disease detection, sample classification, and early disease prediction are all important analyses of high-dimensional biomedical data in the field of bioinformatics. Recently, machine-learning techniques have dramatically improved the analysis of high-dimension biomedical data sets. Nonetheless, researchers' studies on biomedical data faced the challenge of vast dimensions, i.e., the vast features (genes) with a very low sample space. In this paper, two-dimensionality reduction methods, feature selection, and feature extraction are introduced with a systematic comparison of several dimension reduction techniques for the analysis of high-dimensional gene expression biomedical data. We presented a systematic review of some of the most popular nature-inspired algorithms and analyzed them. The paper is mainly focused on the original principles behind each of the algorithms and their applications for cancer classification and prediction from gene expression data. Lastly, the advantages and disadvantages of nature-inspired algorithms for biomedical data are evaluated. This review paper may guide researchers to choose the most effective algorithm for cancer classification and prediction for the satisfactory analysis of high-dimensional biomedical data. [ABSTRACT FROM AUTHOR]

Set similarity query is a primitive for many applications, such as data integration, data cleaning, and gene sequence alignment. Most of the existing algorithms are inverted index based, they usually filter unqualified sets one by one and do not have sufficient support for duplicated sets, thus leading to low efficiency. To solve this problem, this paper designs T-starTrie, an efficient trie based index for set similarity query, which can naturally group sets with the same prefix into one node, and can filter all sets corresponding to the node at a time, thereby significantly improving the candidates generation efficiency. In this paper, we find that the set similarity query problem can be transformed into matching nodes of the first-layer (FMNodes) detecting problem on T-starTrie. Therefore, an efficient FLMNode detection algorithm is designed. Based on this, an efficient set similarity query algorithm, TT-SSQ, is implemented by developing a variety of filtering techniques. Experimental results show that TT-SSQ can be up to 3.10x faster than existing algorithms. [ABSTRACT FROM AUTHOR]

Ship detection and identification play pivotal roles in ensuring navigation safety and facilitating efficient maritime traffic management. Aiming at ship detection in complex environments, which often faces problems such as the dense occlusion of ship targets, low detection accuracy, and variable environmental conditions, in this paper, we propose a ship detection algorithm CSD-YOLO (Context guided block module, Slim-neck, Deformable large kernel attention-You Only Look Once) based on the deformable large kernel attention (D-LKA) mechanism, which was improved based on YOLOv8 to enhance its performance. This approach integrates several innovations to bolster its performance. Initially, the utilization of the Context Guided Block module (CG block) enhanced the c2f module of the backbone network, thereby augmenting the feature extraction capabilities and enabling a more precise capture of the key image information. Subsequently, the introduction of a novel neck architecture and the incorporation of the slim-neck module facilitated more effective feature fusion, thereby enhancing both the accuracy and efficiency of detection. Furthermore, the algorithm incorporates a D-LKA mechanism to dynamically adjust the convolution kernel shape and size, thereby enhancing the model's adaptability to varying ship target shapes and sizes. To address data scarcity in complex marine environments, the experiments utilized a fused dataset comprising the SeaShips dataset and a proprietary dataset. The experimental results demonstrate that the CSD-YOLO algorithm outperformed the YOLOv8n algorithm across all model evaluation metrics. Specifically, the precision rate (precision) was 91.5%, the recall rate (recall) was 89.5%, and the mean accuracy (mAP) was 91.5%. Compared to the benchmark algorithm, the Recall was improved by 0.7% and the mAP was improved by 0.4%. These results indicate that the CSD-YOLO algorithm can effectively meet the requirements for ship target recognition and tracking in complex marine environments. [ABSTRACT FROM AUTHOR]

Granular computing (GrC) is a methodology for reducing the complexity of problem solving and includes two basic aspects: granulation and granular-based computing. Strongly connected components (SCCs) are a significant subgraph structure in digraphs. In this paper, two new granulation strategies were devised to improve the efficiency of computing SCCs. Firstly, four SCC correlations between the vertices were found, which can be divided into two classes. Secondly, two granulation strategies were designed based on correlations between two classes of SCCs. Thirdly, according to the characteristics of the granulation results, the parallelization of computing SCCs was realized. Finally, a parallel algorithm based on granulation strategy for computing SCCs of simple digraphs named GPSCC was proposed. Experimental results show that GPSCC performs with higher computational efficiency than algorithms. [ABSTRACT FROM AUTHOR]

Many-objective optimization problems are today ever more common. The decomposition-based approach stands out among the evolutionary algorithms used for their solution, with MOEA/D and its variations playing significant roles. MOEA/D variations seek to improve weight vector definition, improve the dynamic adjustment of weight vectors during the evolution process, improve the evolutionary operators, use alternative decomposition methods, and hybridize with other metaheuristics, among others. Although an essential topic for the success of MOEA/D depends on how well the weight vectors are defined when decomposing the problem, not as much research has been performed on this topic as on the others. This paper proposes using a new mathematical object called augmented covering arrays (ACAs) that enable a better sampling of interactions of M objectives using the least number of weight vectors based on an interaction level (strength), defined a priori by the user. The proposed method obtains better results, measured in inverted generational distance, using small to medium populations (up to 850 solutions) of 30 to 100 objectives over DTLZ and WFG problems against the traditional weight vector definition used by MOEA/D-DE and results obtained by NSGA-III. Other MOEA/D variations can include the proposed approach and thus improve their results. [ABSTRACT FROM AUTHOR]

The field of network security is highly concerned with intrusion detection, which safeguards the security of computer networks. The invention and application of intrusion detection technology play indispensable roles in network security, and it is crucial to investigate and comprehend this topic. Recently, with the continuous occurrence of intrusion incidents in virus propagation networks, traditional network detection algorithms for virus propagation have encountered limitations and have struggled to detect these incidents effectively and accurately. Therefore, updating the intrusion detection algorithm of the virus-spreading network is imperative. This paper introduces a novel system for virus propagation, whose core is a graph-based neural network. By organically combining two modules—a standardization module and a computation module—this system forms a powerful GNN model. The standardization module uses two methods, while the calculation module uses three methods. Through permutation and combination, we obtain six GNN models with different characteristics. To verify their performance, we conducted experiments on the selected datasets. The experimental results show that the proposed algorithm has excellent capabilities, high accuracy, reasonable complexity, and excellent stability in the intrusion detection of virus-spreading networks, making the network more secure and reliable. [ABSTRACT FROM AUTHOR]

Community structure is a very interesting attribute and feature in complex networks, which has attracted scholars' attention and research on community detection. Many single-objective optimization algorithms have been migrated and modified to serve community detection problems. Due to the limitation of resolution, the final algorithm implementation effect is not ideal. In this paper, a multi-objective community detection method based on a pigeon-inspired optimization algorithm, MOPIO-Net, is proposed. Firstly, the PIO algorithm is discretized in terms of the solution space representation, position, and velocity-updating strategies to adapt to discrete community detection scenarios. Secondly, by minimizing the two objective functions of community score and community fitness at the same time, the community structure with a tight interior and sparse exterior is obtained. Finally, for the misclassification caused by boundary nodes, a mutation strategy is added to improve the accuracy of the final community recognition. Experiments on synthetic and real networks verify that the proposed algorithm is more accurate in community recognition compared to 11 benchmark algorithms, confirming the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In the dynamic landscape of cyberspace, organizations face a myriad of coordinated advanced threats that challenge the traditional defense paradigm. Cyber Threat Intelligence (CTI) plays a crucial role, providing in-depth insights into adversary groups and enhancing the detection and neutralization of complex cyber attacks. However, attributing attacks poses significant challenges due to over-reliance on malware samples or network detection data alone, which falls short of comprehensively profiling attackers. This paper proposes an IPv4-based threat attribution model, IPAttributor, that improves attack characterization by merging a real-world network behavior dataset comprising 39,707 intrusion entries with commercial threat intelligence from three distinct sources, offering a more nuanced context. A total of 30 features were utilized from the enriched dataset for each IP to create a feature matrix to assess the similarities and linkage of associated IPs, and a dynamic weighted threat segmentation algorithm was employed to discern attacker communities. The experiments affirm the efficacy of our method in pinpointing attackers sharing a common origin, achieving the highest accuracy of 88.89%. Our study advances the relatively underexplored line of work of cyber attacker attribution, with a specific interest in IP-based attribution strategies, thereby enhancing the overall understanding of the attacker's group regarding their capabilities and intentions. [ABSTRACT FROM AUTHOR]

As a classical combinatorial optimization problem, the traveling salesman problem (TSP) has been extensively investigated in the fields of Artificial Intelligence and Operations Research. Due to being NP-complete, it is still rather challenging to solve both effectively and efficiently. Because of its high theoretical significance and wide practical applications, great effort has been undertaken to solve it from the point of view of intelligent search. In this paper, we propose a two-stage probe-based search optimization algorithm for solving both symmetric and asymmetric TSPs through the stages of route development and a self-escape mechanism. Specifically, in the first stage, a reasonable proportion threshold filter of potential basis probes or partial routes is set up at each step during the complete route development process. In this way, the poor basis probes with longer routes are filtered out automatically. Moreover, four local augmentation operators are further employed to improve these potential basis probes at each step. In the second stage, a self-escape mechanism or operation is further implemented on the obtained complete routes to prevent the probe-based search from being trapped in a locally optimal solution. The experimental results on a collection of benchmark TSP datasets demonstrate that our proposed algorithm is more effective than other state-of-the-art optimization algorithms. In fact, it achieves the best-known TSP benchmark solutions in many datasets, while, in certain cases, it even generates solutions that are better than the best-known TSP benchmark solutions. [ABSTRACT FROM AUTHOR]

With the rapid increase in smart grid users and the increasing cost of user data transmission, proposing an encryption method that does not increase the construction cost while increasing the user ceiling has become the focus of many scholars. At the same time, the increase in users will also lead to more security problems, and it is also necessary to solve the privacy protection for users during information transmission. In order to solve the above problems, this paper proposes an aggregated ring encryption scheme based on the SM2 algorithm with special features, referred to as SM2-CLARSC, based on the certificateless ring signcryption mechanism and combining with the aggregate signcryption. SM2-CLARSC is designed to satisfy the basic needs of the smart grid, and it can be resistant to replay attacks, forward security and backward security, etc. It has better security and higher efficiency than existing solutions. Comparing SM2-CLARSC with existing typical solutions through simulation, the result proves that this solution has more comprehensive functions, higher security, and significant computational efficiency improvement. [ABSTRACT FROM AUTHOR]

The reentry trajectory planning problem of hypersonic vehicles is generally a continuous and nonconvex optimization problem, and it constitutes a critical challenge within the field of aerospace engineering. In this paper, an improved sequential convexification algorithm is proposed to solve it and achieve online trajectory planning. In the proposed algorithm, the Chebyshev pseudo-spectral method with high-accuracy approximation performance is first employed to discretize the continuous dynamic equations. Subsequently, based on the multipliers and linearization methods, the original nonconvex trajectory planning problem is transformed into a series of relaxed convex subproblems in the form of an augmented Lagrange function. Then, the interior point method is utilized to iteratively solve the relaxed convex subproblem until the expected convergence precision is achieved. The convex-optimization-based and multipliers methods guarantee the promotion of fast convergence precision, making it suitable for online trajectory planning applications. Finally, numerical simulations are conducted to verify the performance of the proposed algorithm. The simulation results show that the algorithm possesses better convergence performance, and the solution time can reach the level of seconds, which is more than 97% less than nonlinear programming algorithms, such as the sequential quadratic programming algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a new full-Newton step feasible interior-point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative weight vector and use the algebraic equivalent transformation for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is obtained. Finally, some numerical results are presented to demonstrate the practical performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The Identification State (IS) of Radio Frequency Identification (RFID) robot systems changes continuously with the environment, so improving the identification efficiency of RFID robot systems requires adaptive control of system parameters through real-time evaluation of the IS. This paper first expounds on the important roles of the real-time evaluation of the IS and adaptive control of parameters in the RFID robot systems. Secondly, a method for real-time evaluation of the IS of UHF passive RFID robot systems in dynamic scenarios based on principal component analysis (PCA)-K-Nearest Neighbor (KNN) is proposed and establishes an experimental scene to complete algorithm verification. The results show that the accuracy of the real-time evaluation method of IS based on PCA-KNN is 92.4%, and the running time of a single data is 0.258 ms, compared with other algorithms. The proposed evaluation method has higher accuracy and shorter running time. Finally, this paper proposes a Q-learning-based adaptive control algorithm for RFID robot systems. This method dynamically controls the reader's transmission power and the robot's moving speed according to the IS fed back by the system; compared with the default parameters, the adaptive control algorithm effectively improves the identification rate of the system, the power consumption under the adaptive parameters is reduced by 36.4%, and the time spent decreases by 29.7%. [ABSTRACT FROM AUTHOR]

In modern converter-dominated power systems, total inertia is very variable and depends on the share of power generated by renewable-based converter-interfaced generation (CIG) at each specific moment. As a result, the limits required by the grid codes on the rate of change of frequency and its nadir or zenith during disturbances become challenging to achieve with conventional control approaches. Therefore, the transition to a novel control strategy of CIG with a grid-forming power converter is relevant. For this purpose, a control algorithm based on a virtual synchronous generator (VSG) is used, which simulates the properties and capabilities of a conventional synchronous generation. However, due to continuously changing operating conditions in converter-dominated power systems, the virtual inertia formed by VSG must be adaptive. At the same time, the efficiency of adaptive algorithms strongly depends on the used VSG structure. In this connection, this paper proposes an enhanced VSG structure for which the transfer function of the active power control loop was formed. With the help of it, the advantages over the conventional VSG structure were proven, which are necessary for the effective adaptive control of the VSG parameters. Then, the analysis of the impact of the VSG parameters on the dynamic response using the transient characteristics in the time domain was performed. Based on the results obtained, adaptive algorithms for independent control of the virtual inertia and the parameters of the VSG damper winding were developed. The performed mathematical modeling confirmed the reliable and effective operation of the developed adaptive control algorithms and the enhanced VSG structure. The theoretical and experimental results obtained in this paper indicate the need for simultaneous development and improvement of both adaptive control algorithms and VSG structures used for this purpose. [ABSTRACT FROM AUTHOR]

In this paper, we propose an outlier-detection algorithm for detecting network traffic anomalies based on a clustering algorithm and an autoencoder model. The BIRCH clustering algorithm is employed as the pre-algorithm of the autoencoder to pre-classify datasets with complex data distribution characteristics, while the autoencoder model is used to detect outliers based on a threshold. The proposed BIRCH-Autoencoder (BAE) algorithm has been tested on four network security datasets, KDDCUP99, UNSW-NB15, CICIDS2017, and NSL-KDD, and compared with representative algorithms. The BAE algorithm achieved average F-scores of 96.160, 81.132, and 91.424 on the KDDCUP99, UNSW-NB15, and CICIDS2017 datasets, respectively. These experimental results demonstrate that the proposed approach can effectively and accurately detect anomalous data. [ABSTRACT FROM AUTHOR]

The cryptographic system is the foundation of blockchain security mechanisms. This paper constructs a blockchain security mechanism based on the Chinese national cryptographic SM2 algorithm, involving the generation of public–private key pairs and the signing of block information using key pairs. However, the original SM2 algorithm has a high computational complexity, which cannot meet the requirements of low on-chain delay in blockchain applications. To solve this problem, this paper optimizes the SM2 digital signature algorithm. The scalar multiplication operation in the digital signature algorithm has a large computational complexity, which affects the efficiency of a digital signature. To reduce its computational complexity, this paper improves the traditional window non-adjacent form (w-NAF) algorithm for the scalar multiplication operation and proposes a low computational complexity Fw-NAF algorithm based on the prime number precomputation window, which greatly reduces its computational complexity. [ABSTRACT FROM AUTHOR]

Developing efficient path-planning algorithms is an essential topic in modern robotics and control theory. Autonomous rovers and wheeled and tracked robots require path generators that can efficiently cover the explorable space with minimal redundancy. In this paper, we present a new path-planning algorithm based on the chaotic behavior of the Courbage–Nekorkin neuron model with a coverage control parameter. Our study aims to reduce the number of iterations required to cover the chosen investigated area, which is a typical efficiency criterion for this class of algorithms. To achieve this goal, we implemented a pseudorandom bit generator (PRBG) based on a Courbage–Nekorkin chaotic map, which demonstrates chaotic behavior and successfully passes all statistical tests for randomness. The proposed PRBG generates a bit sequence that can be used to move the tracked robot in four or eight directions in an operation area of arbitrary size. Several statistical metrics were applied to evaluate the algorithm's performance, including the percentage of coverage of the study area and the uniformity of coverage. The performance of several competing path-planning algorithms was analyzed using the chosen metrics when exploring two test areas of the sizes 50 × 50 cells and 100 × 100 cells, respectively, in four and eight directions. The experimental results indicate that the proposed algorithm is superior compared to known chaotic path-planning methods, providing more rapid and uniform coverage with the possibility of controlling the covered area using tunable parameters. In addition, this study revealed the high dependence of the coverage rate on the starting point. To investigate how the coverage rate depends on the choice of chaotic map, we implemented six different PRBGs using various chaotic maps. The obtained results can be efficiently used for solving path-planning tasks in both real-life and virtual (e.g., video games) applications. [ABSTRACT FROM AUTHOR]

This paper deals with p-maxian problem on cycles with an upper bound on the distances of all facilities. We consider the case of p = 2 and show that, in the worst case, the optimal solution contains at least one vertex of the underlying cycle, which helps to develop an efficient algorithm to solve the constrained 2-maxian problem. Based on this property, we develop a linear time algorithm for the constrained 2-maxian problem on a cycle. We also discuss the relations between the constrained and unconstrained 2-maxian problems on which the underlying graphs are cycles. [ABSTRACT FROM AUTHOR]

In this paper, we present an effective method for analyzing patterns in the Russia–Ukraine war based on the Lanchester model. Due to the limited availability of information on combat powers of engaging forces, we utilize the loss of armored equipment as the primary data source. To capture the intricate dynamics of modern warfare, we partition the combat loss data into disjoint subsets by examining their geometric properties. Separate systems of ordinary differential equations for these subsets are then identified using the Sparse Identification of Nonlinear Dynamics (SINDy) algorithm under a generalized formulation of the historical Lanchester model. We provide simulations of our method to demonstrate its effectiveness and performance in analyzing contemporary warfare dynamics. [ABSTRACT FROM AUTHOR]