Search

This paper improves the timeliness of satellite mission planning to cope with the rapid response to changes. In this paper, satellite mission planning is investigated. Firstly, the satellite dynamics model and mission planning model are established, and an improved Monte Carlo tree (Improved-MCTS) algorithm is proposed, which utilizes the Monte Carlo tree search in combination with the state uncertainty network (State-UN) to reduce the time of exploring the nodes (At the MCTS selection stage, the exploration of nodes specifically refers to the algorithm needing to decide whether to choose nodes that have already been visited (exploitation) or nodes that have not been visited yet (exploration)). The results show that this algorithm performs better in terms of profit (in this paper, the observation task is given a weight of 0–1, and each planned task will receive a profit; that is, a profit will be assigned at the initial moment) and convergence speed compared to the ant colony algorithm (ACO) and the asynchronous advantage actor critic (A3C). [ABSTRACT FROM AUTHOR]

Recently, a signal sorting algorithm based on the congruence transform has been proposed, which is effective in dealing with the staggered Pulse Repetition Interval (PRI) signals. It can effectively sort the staggered PRI signals and obtain the sub-PRI sequence directly without sub-PRI ranking, and it is less affected by interfered pulses and pulse loss. Nevertheless, we find that the algorithm causes pseudo-peaks in the remainder histogram when sorting signals such as sliding PRI, sinusoidal PRI, etc. (collectively referred to as periodic PRI signal in this paper) and pseudo-peaks will cause errors in signal sorting. To solve the issue of pseudo-peaks when sorting periodic PRI signals, an improved sorting algorithm based on congruence transform is proposed. According to the analysis of the congruence characteristics of the periodic PRI signal, a novel method is proposed to identify pseudo-peaks based on the histogram peak amplitude and symmetric difference set. The signal sorting algorithm based on congruence transform is improved to achieve a good sorting effect on periodic PRI signals. Simulation experiments demonstrate that the novel algorithm can effectively sort periodic PRI signals and improve Precall, Pd, and Pf by 6.9%, 5.1%, and 3.2%, respectively, compared to the typical similar algorithms. [ABSTRACT FROM AUTHOR]

This paper presents an innovative mathematical model of solid fuel gasification, which is not described in the available literature. The calculation of the components of the heterogeneous phase (including both solid and gaseous phases) as well as the calculation of the homogeneous phase (only gaseous components) is based on the balance of the total amounts of carbon, oxygen, hydrogen, and nitrogen entering the reactor space. Additionally, this paper introduces a new method for calculating the composition of the gaseous phase, based on reducing the heterogeneous mixture (composed of solid and gaseous phases) to a homogeneous gaseous phase. This approach to calculating the gaseous phase composition in the solid fuel gasification process has not been found by the authors in the cited literature. This paper also presents a model for calculating the heterogeneous and gaseous phases using the number of moles that participate in the assumed chemical reactions of the solid fuel gasification process. This approach to calculating the composition of the heterogeneous and gaseous phases of the solid fuel gasification process is also not represented in the cited literature. For comparison with the literature data, municipal solid waste (MSW) and cashew nut shell (Cashew Shell Char (CNSC)) were used as fuels in the calculation of gasification composition. The results of the calculation of the gaseous phase composition using the model presented in the paper show good agreement with the data from the literature. The calculation of the composition of the heterogeneous mixture during the steam gasification of MSW (α = 0.4) shows the presence of a solid phase (carbon) up to approximately 735 °C. At that temperature, the synthetic gas contains only gaseous components: CO = 33.10%, H2 = 52.70%, CH4 = 2.54%, CO2 = 4.97, H2O = 5.93% and N2 = 0.76%. Increasing the temperature above 735 °C eliminates the solid phase from the equilibrium mixture. The literature data on solid fuel gasification generally do not consider the proportion of the solid phase (carbon) in the equilibrium mixture. To satisfy the material balance at the input and output of the gasification reactor, it is necessary to determine the proportion of the solid phase (carbon) in the equilibrium mixture. Since the proportion of the solid phase (carbon) in the heterogeneous equilibrium mixture can only be determined through measurement, the development and application of a mathematical model in engineering practice is of great importance, so this developed model can be considered a useful tool for simulating the influence of process parameters on gas characteristics. [ABSTRACT FROM AUTHOR]

Role-based access control (RBAC) is a widely adopted access control model in various domains for defining security management. Role mining is closely related to role-based access control, as the latter employs role assignments to offer a flexible and scalable approach to managing permissions within an organization. The edge role mining problem (Edge RMP), a variant of the role mining problem (RMP), has long been recognized as an effective strategy for role assignment. Role mining, which groups users with similar access permissions into the same role, bears some resemblance to symmetry. Symmetry categorizes objects or graphics with identical characteristics into one group. Both involve a certain form of "classification" or "induction". Edge-RMP reduces the associations between users and permissions, thereby lowering the security risks faced by the system. While an algorithm based on Boolean matrix factorization exists for this problem, it fails to further refine the resulting user–role assignment (UA) and role–permission assignment (PA) relationships. Additionally, this algorithm does not address constraint-related issues, such as cardinality constraints, user exclusion constraints, and user capabilities. Furthermore, it demonstrates significant redundancy of roles when handling large datasets, leaving room for further optimization of Edge-RMP results. To address these concerns, this paper proposes the MFC-RMA algorithm based on Boolean matrix factorization. The method achieves significant optimization of Edge-RMP results by handling relationships between roles possessing various permissions. Furthermore, this paper clusters, compresses, modifies, and optimizes the original data based on the similarity between users, ensuring its usability for role mining. Both theoretical and practical considerations are taken into account for different types of constraints, and algorithms are devised to reallocate roles incorporating these constraints, thereby generating UA and PA matrices. The proposed approach yields optimal numbers of generated roles and the sum of the minimum number of generated edges to address the aforementioned issues. Experimental results demonstrate that the algorithm reduces management overhead, provides efficient execution results, and ensures the accuracy of generated roles. [ABSTRACT FROM AUTHOR]

This paper presents an improved swarming algorithm that enhances low-illumination images. The algorithm combines a hybrid Harris Eagle algorithm with double gamma (IHHO-BIGA) and incomplete beta (IHHO-NBeta) functions. This paper integrates the concept of symmetry into the improvement steps of the image adaptive enhancement algorithm. The enhanced algorithm integrates chaotic mapping for population initialization, a nonlinear formula for prey energy calculation, spiral motion from the black widow algorithm for global search enhancement, a nonlinear inertia weight factor inspired by particle swarm optimization, and a modified Levy flight strategy to prevent premature convergence to local optima. This paper compares the algorithm's performance with other swarm intelligence algorithms using commonly used test functions. The algorithm's performance is compared against several emerging swarm intelligence algorithms using commonly used test functions, with results demonstrating its superior performance. The improved Harris Eagle algorithm is then applied for image adaptive enhancement, and its effectiveness is evaluated on five low-illumination images from the LOL dataset. The proposed method is compared to three common image enhancement techniques and the IHHO-BIGA and IHHO-NBeta methods. The experimental results reveal that the proposed approach achieves optimal visual perception and enhanced image evaluation metrics, outperforming the existing techniques. Notably, the standard deviation data of the first image show that the IHHO-NBeta method enhances the image by 8.26%, 120.91%, 126.85%, and 164.02% compared with IHHO-BIGA, the single-scale Retinex enhancement method, the homomorphic filtering method, and the limited contrast adaptive histogram equalization method, respectively. The processing time of the improved method is also better than the previous heuristic algorithm. [ABSTRACT FROM AUTHOR]

This document discusses the importance of optimization in various fields such as statistics, biology, finance, economics, and control. It highlights the advancements made in optimization theory and methods, including first-order methods and augmented Lagrangian methods. The document also introduces a special issue on "Symmetry in Optimization Theory, Algorithms and Applications," which features five papers on topics such as ensemble learning, ant colony system algorithms, subspace algorithms, consensus problems in multi-agent systems, and dynamic conditional correlation models. The authors express their gratitude to the contributors and reviewers of the special issue. [Extracted from the article]

Data mining is an analytical approach that contributes to achieving a solution to many problems by extracting previously unknown, fascinating, nontrivial, and potentially valuable information from massive datasets. Clustering in data mining is used for splitting or segmenting data items/points into meaningful groups and clusters by grouping the items that are near to each other based on certain statistics. This paper covers various elements of clustering, such as algorithmic methodologies, applications, clustering assessment measurement, and researcher-proposed enhancements with their impact on data mining thorough grasp of clustering algorithms, its applications, and the advances achieved in the existing literature. This study includes a literature search for papers published between 1995 and 2023, including conference and journal publications. The study begins by outlining fundamental clustering techniques along with algorithm improvements and emphasizing their advantages and limitations in comparison to other clustering algorithms. It investigates the evolution measures for clustering algorithms with an emphasis on metrics used to gauge clustering quality, such as the F-measure and the Rand Index. This study includes a variety of clustering-related topics, such as algorithmic approaches, practical applications, metrics for clustering evaluation, and researcher-proposed improvements. It addresses numerous methodologies offered to increase the convergence speed, resilience, and accuracy of clustering, such as initialization procedures, distance measures, and optimization strategies. The work concludes by emphasizing clustering as an active research area driven by the need to identify significant patterns and structures in data, enhance knowledge acquisition, and improve decision making across different domains. This study aims to contribute to the broader knowledge base of data mining practitioners and researchers, facilitating informed decision making and fostering advancements in the field through a thorough analysis of algorithmic enhancements, clustering assessment metrics, and optimization strategies. [ABSTRACT FROM AUTHOR]

This paper aims to provide a comprehensive analysis of the advancements made in understanding Iterative Fixed-Point Schemes, which builds upon the concept of digital contraction mappings. Additionally, we introduce the notion of an Iterative Fixed-Point Schemes in digital metric spaces. In this study, we extend the idea of Iteration process Mann, Ishikawa, Agarwal, and Thakur based on the ϝ-Stable Iterative Scheme in digital metric space. We also design some fractal images, which frame the compression of Fixed-Point Iterative Schemes and contractive mappings. Furthermore, we present a concrete example that exemplifies the motivation behind our investigations. Moreover, we provide an application of the proposed Fractal image and Sierpinski triangle that compress the works by storing images as a collection of digital contractions, which addresses the issue of storing images with less storage memory in this paper. [ABSTRACT FROM AUTHOR]

In Intelligent Transport Systems (ITSs), Internet of Vehicles (IoV) communications and computation offloading technology have been introduced to assist with the burdensome sensing task processing, thus prompting a new design paradigm called mobile sensing–communication–computation (MSCC) synergy. Most researchers have focused on offloading strategy design to reduce energy consumption or execution costs, but ignore the intrinsic characteristics of tasks, which may lead to poor performance. This paper studies the offloading strategy of vehicle MSCC tasks represented by a Directed Acyclic Graph (DAG) structure. According to the DAG dependency of the subtasks, this paper proposes a computation offloading strategy to optimize energy consumption under time constraints. An energy consumption model for task execution is established. Then, the Simulated Annealing and Tabu Search hybrid optimization algorithm (ST-HO) is designed to solve the problem of minimizing the energy consumption. Crucially, this research integrates the concept of symmetry into the typical DAG structure of MSCC tasks, ensuring the integrity and efficiency of task execution in ITS. The simulation results show that ST-HO reduces energy consumption by at least 5.58% compared to the conventional algorithm. Particularly, the convergence speed of ST-HO is improved by 52.63% when the replication strategy of symmetric task is considered. [ABSTRACT FROM AUTHOR]

Siamese trackers based on classification and regression have drawn extensive attention due to their appropriate balance between accuracy and efficiency. However, most of them are prone to failure in the face of abrupt motion or appearance changes. This paper proposes a Siamese-based tracker that incorporates spatial-semantic-aware attention and flexible spatiotemporal constraint. First, we develop a spatial-semantic-aware attention model, which identifies the importance of each feature region and channel to target representation through the single convolution attention network with a loss function and increases the corresponding weights in the spatial and channel dimensions to reinforce the target region and semantic information on the target feature map. Secondly, considering that the traditional method unreasonably weights the target response in abrupt motion, we design a flexible spatiotemporal constraint. This constraint adaptively adjusts the constraint weights on the response map by evaluating the tracking result. Finally, we propose a new template updating the strategy. This strategy adaptively adjusts the contribution weights of the tracking result to the new template using depth correlation assessment criteria, thereby enhancing the reliability of the template. The Siamese network used in this paper is a symmetric neural network with dual input branches sharing weights. The experimental results on five challenging datasets show that our method outperformed other advanced algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces a new algorithm that combines the forward–backward splitting algorithms with a double inertial technique, utilizing the previous three iterations. The weak convergence theorem is established under certain mild conditions in a Hilbert space, including a relaxed inertial method in real numbers. An example of infinite dimension space is given with numerical results to support our proposed algorithm. The algorithm is applied to an asymmetrical educational dataset of students from 109 schools, utilizing asymmetric inputs as nine attributes to predict the output as students' mathematical integrated skills. The algorithm's performance is compared with other algorithms in the literature to demonstrate its effectiveness. The proposed algorithm demonstrates comparable precision, recall, accuracy, and F1 score but performs a relatively lower number of iterations. The contributions of each performance aspect to the mathematical integration skill of students are discussed to improve students' mathematical learning. [ABSTRACT FROM AUTHOR]

The conventional feature point-based image stitching algorithm exhibits inconsistencies in the quality of feature points across diverse scenes. This may result in the deterioration of the alignment effect or even the inability to align two images. To address this issue, this paper presents an unsupervised multigrid image alignment method that integrates the conventional feature point-based image alignment algorithm with deep learning techniques. The method postulates that the feature points are uniformly distributed in the image and employs a deep learning network to predict their displacements, thereby enhancing the robustness of the feature points. Furthermore, the precision of image alignment is enhanced through the parameterization of APAP (As-projective-as-possible image stitching with moving DLT) multigrid deformation. Ultimately, based on the symmetry exhibited by the homography matrix and its inverse matrix throughout the projection process, image chunking inverse warping is introduced to obtain the stitched images for the multigrid deep learning network. Additionally, the mesh shape-preserving loss is introduced to constrain the shape of the multigrid. The experimental results demonstrate that in the real-world UDIS-D dataset, the method achieves notable improvements in feature point matching and homography estimation tasks, and exhibits superior alignment performance on the traditional image stitching dataset. [ABSTRACT FROM AUTHOR]

In optimization problems, the principle of symmetry provides important guidance. This article introduces an enhanced NSGA-II algorithm, termed NDE-NSGA-II, designed for addressing multi-objective optimization problems. The approach employs Tent mapping for population initialization, thereby augmenting its search capability. During the offspring generation process, a hybrid local search strategy is implemented to augment the population's exploration capabilities. It is crucial to highlight that in elite selection, norm selection and average distance elimination strategies are adopted to strengthen the selection mechanism of the population. This not only enhances diversity but also ensures convergence, thereby improving overall performance. The effectiveness of the proposed NDE-NSGA-II is comprehensively evaluated across various benchmark functions with distinct true Pareto frontier shapes. The results consistently demonstrate that the NDE-NSGA-II method presented in this paper surpasses the performance metrics of the other five methods. Lastly, the algorithm is integrated with the DSSAT model to optimize maize irrigation and fertilization scheduling, confirming the effectiveness of the improved algorithm. [ABSTRACT FROM AUTHOR]

With the exponential growth of devices, particularly Internet of things (IoT) devices, connecting to wireless networks, existing networks face significant challenges. Spectral efficiency is crucial for uplink, which is the dominant form of asymmetrical network in today's communication landscape, in large-scale connectivity scenarios. In this paper, an uplink transmission scenario is considered and user equipment (UE) aggregation is employed, wherein some users act as cooperative nodes (CNs), and help to forward received data from other users requiring coverage extension, reliability improvement, and data–rate enhancement. Non–orthogonal multiple access (NOMA) technology is introduced to improve spectral efficiency. To reduce the interference impact to guarantee the data rate, one UE can be assisted by multiple CNs, and these CNs and corresponding assisted UEs are clustered into joint transmission pairs (JTPs). Interference-free transmission can be achieved within each JTP by utilizing different successive interference cancellation (SIC) decoding orders. To explore SIC gains and maximize data rates in NOMA–based UE aggregation, we propose a primary user CN–based channel–sorting algorithm for JTP construction and apply a whale optimization algorithm for JTP power allocation. Additionally, a conflict graph is established among feasible JTPs, and a greedy strategy is employed to find the maximum weighted independent set (MWIS) of the conflict graph for subchannel allocation. Simulation results demonstrate that our joint collaborative NOMA (JC–NOMA) design with two–hop multi–path UE aggregation significantly improves spectral efficiency and capacity under limited spectral resources. [ABSTRACT FROM AUTHOR]

In this study, an optimization method for the motion trajectory of attitude actuators was investigated in order to improve assembly efficiency in the automatic docking process of large components. The self-developed dual-attitude adjustment mechanism (2-PPPR) is used as the research object, and the structure is symmetrical. Based on the modified Denavit–Hartenberg (MDH) parameter description method, a kinematic model of the attitude mechanism is established, and its end trajectory is parametrically expressed using a five-order B-spline curve. Based on the constraints of the dynamics and kinematics of the dual-posture mechanism, the total posturing time, the degree of urgency of each joint, and the degree of difficulty of the mechanism's posturing are selected as the optimization objectives. The Lévy flight and Cauchy variation algorithms are introduced into the salp swarm algorithm (SSA) to solve the parameters of the multi-objective trajectory optimization model. By combining the evaluation method of the multi-objective average optimal solution, the optimal trajectory of the dual-tuning mechanism and the motion trajectory of each joint are obtained. The simulation and experiment results show that the trajectory planning method proposed in this paper is effective and feasible and can ensure that the large-part dual-posture mechanism can complete the automatic docking task smoothly and efficiently. [ABSTRACT FROM AUTHOR]

Multi-criteria decision-making methods based on reference points and distances from them are essential for evaluating alternatives across multiple criteria. These methods provide structured approaches to comparing and ranking alternatives relative to specified reference points. The main objective of this paper is to present the Multi-Criteria Method Integrating Distances to Ideal and Anti-ideal Points (MIDIA), which, through a weighted system, allows for the consideration of balance and asymmetry in assessing alternatives based on their distances from the ideal and anti-ideal points. As a multi-criteria algorithm, MIDIA is user-friendly and reflects the human mind's natural tendency to assess objects based on fundamental concepts—comparison with the ideal solution and the anti-ideal solution—that are familiar from everyday experiences and provide valuable insights from a behavioral perspective. Moreover, the proposed method can be seen as an extension of Hellwig's approach, designed to facilitate the ranking of alternatives based on two reference points: the ideal point and the anti-ideal point, measuring the distance between the alternative and the ideal point and the distance between the ideal and anti-ideal points. The MIDIA method integrates elements from both TOPSIS and VIKOR, by incorporating the structure of TOPSIS and the compromise perspective of VIKOR, offering a balanced approach to multi-criteria decision-making by focusing on the distances from ideal and anti-ideal points. Illustrative examples are given to demonstrate the usability of the proposed tool in situations where the decision-maker has asymmetrical preferences concerning the importance of ideal and anti-ideal points in ranking alternatives. Moreover, the MIDIA method is applied to one of the Sustainable Development Goals, in the area of education (SDG4), to obtain the rankings of EU member countries in 2022. The results obtained using the MIDIA method were compared with those obtained using the TOPSIS and VIKOR approaches. The study concludes that the ranking of alternatives depends on the coefficients of the importance of the distances to reference points and the data setup. [ABSTRACT FROM AUTHOR]

Wireless Local-Area Networks (WLANs), as a popular internet access solution, are widely used in numerous places, including enterprises, campuses, and public venues. As the number of devices increases, large-scale deployments will cause the problem of dense wireless networks, including a lot of energy consumption. Thus, the optimization of energy-efficient wireless AP devices has become a focal point of attention. To reduce energy consumption, we have proposed the active access-point (AP) configuration algorithm for WLANs using APs with a dual interface. This uses the greedy algorithm combined with the local search optimization method to find the minimum number of activated APs while satisfying the minimum throughput constraint. However, the previous algorithm basically satisfies only the average throughput among the multiple hosts associated with one AP, wherein some hosts may not reach the required one. In this paper, to overcome this limitation, we propose an enhanced active AP configuration algorithm by incorporating the throughput request satisfaction method that controls the actual throughput at the target value (target throughput) for every host by applying traffic shaping. The target throughput is calculated from the single and concurrent communicating throughput of each host based on channel occupancy time. The minimum throughput constraint will be iteratively adjusted to obtain the required target throughput and achieve the fair throughput allocation. For evaluations, we conducted simulations using the WIMNET simulator and experiments using the testbed system with a Raspberry Pi 4B for APs in four topology cases with five APs and ten hosts. The results show that the proposed method always achieved the required minimum throughput in simulations as well as in experiments, while minimizing the number of active APs. Thus, the validity and effectiveness of our proposal were confirmed. [ABSTRACT FROM AUTHOR]

Superpixel segmentation is a popular preprocessing tool in the field of image processing. Nevertheless, conventional planar superpixel generation algorithms are inadequately suited for segmenting symmetrical spherical images due to the distinctive geometric differences. In this paper, we present a novel superpixel algorithm termed context identity and contour intensity (CICI) that is specifically tailored for spherical scene segmentation. By defining a neighborhood range and regional context identity, we propose a symmetrical spherical seed-sampling method to optimize both the quantity and distribution of seeds, achieving evenly distributed seeds across the panoramic surface. Additionally, we integrate the contour prior to superpixel correlation measurements, which could significantly enhance boundary adherence across different scales. By implementing the two-fold optimizations on the non-iterative clustering framework, we achieve synergistic CICI to generate higher-quality superpixels. Extensive experiments on the public dataset confirm that our work outperforms the baselines and achieves comparable results with state-of-the-art superpixel algorithms in terms of several quantitative metrics. [ABSTRACT FROM AUTHOR]

With the increasing complexity of applications, many delay-sensitive and compute-intensive services have posed significant challenges to mobile devices. Addressing how to efficiently allocate heterogeneous network resources to meet the computing and delay requirements of terminal services is a pressing issue. In this paper, a new cooperative twin delayed deep deterministic policy gradient and deep-Q network (TD3-DQN) algorithm is introduced to minimize system latency by optimizing computational offloading and caching placement asynchronously. Specifically, the task-partitioning technique divides computing tasks into multiple subtasks, reducing the response latency. A DQN intelligent algorithm is presented to optimize the offloading path to edge servers by perceiving network resource status. Furthermore, a TD3 approach is designed to optimize the cached content in the edge servers, ensuring dynamic popularity content requirements are met without excessive offload decisions. The simulation results demonstrate that the proposed model achieves lower latency and quicker convergence in asymmetrical cloud–edge collaborative networks compared to other benchmark algorithms. [ABSTRACT FROM AUTHOR]

Suppose each of A 1 , ... , A n is a maximal monotone, and β B is firmly nonexpansive with β > 0 . In this paper, we have two purposes: the first is finding the zeros of ∑ j = 1 n A j + B , and the second is finding the zeros of ∑ j = 1 n A j . To address the first problem, we produce fixed-point equations on the original Hilbert space as well as on the product space and find that these equations associate with crucial operators which are called generalized forward–backward splitting operators. To tackle the second problem, we point out that it can be reduced to a special instance of n = 2 by defining new operators on the product space. Iterative schemes are given, which produce convergent sequences and these sequences ultimately lead to solutions for the last two problems. [ABSTRACT FROM AUTHOR]

This paper introduces an effective blind watermarking algorithm for double-color images utilizing the Walsh–Hadamard Transform (WHT) with symmetric embedding locations to enhance imperceptibility. The proposed algorithm leverages the energy accumulation capability and significant correlations among coefficients of the WHT. First, the color host image undergoes partitioning into its respective red (R), green (G), and blue (B) channels, followed by further subdivision into 4 × 4 blocks. Through research, the algorithm determines which WHT coefficients are least visually sensitive to embedding a color image, and as a result, optimizes the embedding locations to achieve better imperceptibility. The extensive simulation results verify the superior performance of the proposed algorithm compared to other related approaches, showcasing its excellence not only in imperceptibility but also in embedding capacity and robustness. [ABSTRACT FROM AUTHOR]

The input layer, hidden layer, and output layer are three models of neural processors that comprise feedforward neural networks. In this paper, an enhanced tunicate swarm algorithm based on a differential sequencing alteration operator (ETSA) with symmetric cooperative swarms is presented to train feedforward neural networks. The objective is to accomplish minimum classification errors and the most appropriate neural network layout by regulating the layers' connection weights and neurons' deviation thresholds according to the transmission error between the anticipated input and the authentic output. The TSA mimics jet motorization and swarm scavenging to mitigate directional collisions and to maintain the greatest solution that is customized and regional. However, the TSA exhibits the disadvantages of low computational accuracy, a slow convergence speed, and easy search stagnation. The differential sequencing alteration operator has adaptable localized extraction and search screening to broaden the identification scope, enrich population creativity, expedite computation productivity, and avoid search stagnation. The ETSA integrates exploration and exploitation to mitigate search stagnation, which has sufficient stability and flexibility to acquire the finest solution. The ETSA was distinguished from the ETTAO, EPSA, SABO, SAO, EWWPA, YDSE, and TSA by monitoring seventeen alternative datasets. The experimental results confirm that the ETSA maintains profound sustainability and durability to avoid exaggerated convergence, locate the acceptable transmission error, and equalize extraction and prospection to yield a faster convergence speed, superior calculation accuracy, and greater categorization accuracy. [ABSTRACT FROM AUTHOR]

The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA's capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm's ability to explore and exploit solution spaces. Moreover, DTSA's adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm's efficiency and stability in handling complex optimization issues, and DTSA's robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations. [ABSTRACT FROM AUTHOR]

Comparing phylogenetic trees is a prominent problem widely used in applications such as clustering and building the Tree of Life. While there are many well-developed distance measures for phylogenetic trees defined on the same set of taxa, the situation is contrasting for trees defined on different but mutually overlapping sets of taxa. This paper presents a new polynomial-time algorithm for completing phylogenetic trees and computing the distance between trees defined on different but overlapping sets of taxa. This novel approach considers both the branch lengths and the topology of the phylogenetic trees being compared. We demonstrate that the distance measure applied to completed trees is a metric and provide several properties of the new method, including its symmetrical nature in tree completion. [ABSTRACT FROM AUTHOR]

Optimization algorithms have a wide range of applications in symmetry problems, such as graphs, networks, and pattern recognition. In this paper, a dynamic periodic multi-depot multi-trip vehicle routing model for scheduling test samples is constructed, which considers the differences in testing unit price and testing capacity of various agencies and introduces a cross-depot collaborative transport method. Both the cost and the testing time are minimized by determining the optimal sampling routes and testing agencies, subjecting to the constraints of vehicle capacity, number of vehicles, and delivery time. To solve the model, a knowledge-guided multi-objective shuffled frog leaping algorithm (KMOSFLA) is proposed. KMOSFLA adopts a convertible encoding mechanism to realize the diversified search in different search spaces. Three novel strategies are designed: the population initialization with historical information reuse, the leaping rule based on the greedy crossover and genetic recombination, and the objective-driven enhanced search. Systematic experimental studies are implemented. First, feasibility analyses of the model are carried out, where effectiveness of the cross-depot collaborative transport is validated and sensitivity analyses on two parameters (vehicle capacity and proportion of the third-party testing agencies) are performed. Then, the proposed algorithm KMOSFLA is compared with five state-of-the-art algorithms. Experimental results indicate that KMOSFLA can provide a set of non-dominated schedules with lower cost and shorter testing time in each scheduling period, which provides a reference for the dispatcher to make a final decision. [ABSTRACT FROM AUTHOR]

Due to the different generation and propagation mechanisms of P- and S-waves, there may be significant differences in the seismic data collected by the two, which poses a great obstacle to the time domain matching of P- and S-waves in multiwave exploration. Furthermore, the quality and accuracy of the matching effect will directly affect the subsequent multiwave joint inversion and interpretation effect. Therefore, the study of P and S-wave-matching methods plays a crucial role in seismic exploration. In 2013, Hale improved the classical Dynamic Time Warping (DTW) algorithm applied to solve the problem of speech recognition, and obtained the DTW algorithm suitable for solving the matching of P-waves and S-waves. The seismic wave-matching results generated by this algorithm are horizontal discontinuous (different trajectories) and need further processing. This study analyses the algorithm based on simulations of seismic waves using Ricker wavelets. In response to existing problems, this paper proposes strategies to improve the DTW algorithm. The algorithm in this study significantly improved the continuity of the registration results of the actual seismic wave data in the horizontal direction (different traces). [ABSTRACT FROM AUTHOR]

As we know, image colorization is widely used in computer graphics and has become a research hotspot in the field of image processing. Current image colorization technology has the phenomenon of single coloring effect and unreal color, which is too complicated to be implemented and struggled to gain popularity. In this paper, a new method based on a convolution neural network is proposed to study the reasonable coloring of human images and ensures the realism of the coloring effect and the diversity of coloring at the same time. First, this paper selects about 5000 pictures of people and plants from the Imagenet dataset and makes a small dataset containing only people and backgrounds. Secondly, in order to obtain the image segmentation results, this paper improves the U-net network and carries out three times of down sampling and three times of up-sampling. Finally, we add the expanded convolution, and use the sigmoid activation function to replace the ReLU (The Rectified Linear Unit) activation function and put the BN (Batch Normalization) before the activation function. Experimental results show that our proposed image colorization algorithm based on the deep learning scheme can reduce the training time of the network and achieve higher quality segmentation results. [ABSTRACT FROM AUTHOR]

This paper proposed a digital background calibration algorithm with positive and negative symmetry error tolerance to remedy the capacitor mismatch for successive approximation register analog-to-digital converters (SAR ADCs). Compensate for the errors caused by capacitor mismatches and improve the ADC performance. Combination with a tri-level switching scheme based on the common-mode voltage Vcm to achieve capacitor reduction and high switching energy efficiency. The proposed calibration algorithm significantly improves capacitor mismatch without resorting to extensive computation or dedicated circuits. The active area is 0.046 mm2 in 40 nm Complementary Metal-Oxide-Semiconductor (CMOS) technology. The post-simulation results show the effective number of bits (ENOB) improves from 8.23 bits to 11.36 bits, signal-to-noise-and distortion ratio (SNDR) improves from 51.33 dB to 70.15 dB, respectively, before and after calibration. This improves the spurious-free dynamic range (SFDR) by 24.13 dB, from 61.50 dB up to 85.63 dB. The whole ADC's power consumption is only 0.3564 mW at sampling rate fs =2 MS/s and Nyquist input frequency, with a figure-of-merit (FOM) 67.8 fJ/conv.-step. [ABSTRACT FROM AUTHOR]

Due to its very desirable properties, Chebyshev polynomials are often used in the design of public key cryptographic systems. This paper discretizes the Chebyshev mapping, generalizes the properties of Chebyshev polynomials, and proposes an improved public key encryption algorithm based on Chebyshev chaotic mapping and RSA, i.e., C R P K C − K i . This algorithm introduces alternative multiplication coefficients K i , the selection of which is determined by the size of T r T d x m o d   N = T d T r x m o d   N , and the specific value selection rules are shared secrets among participants, overcoming the shortcomings of previous schemes. In the key generation and encryption/decryption stages, more complex intermediate processes are used to achieve higher algorithm complexity, making the algorithm more robust against ordinary attacks. The algorithm is also compared with other RSA-based algorithms to demonstrate its effectiveness in terms of performance and security. [ABSTRACT FROM AUTHOR]

Recommender systems are widely used in e-commerce, movies, music, social media, and other fields because of their personalized recommendation functions. The recommendation algorithm is used to capture user preferences, item characteristics, and the items that users are interested in are recommended to users. Matrix factorization is widely used in collaborative filtering algorithms because of its simplicity and efficiency. However, the simple dot-product method cannot establish a nonlinear relationship between user latent features and item latent features or make full use of their personalized information. The model of a neural network combined with an attention mechanism can effectively establish a nonlinear relationship between the potential features of users and items and improve the recommendation accuracy of the model. However, it is difficult for the general attention mechanism algorithm to solve the problem of attention interaction when the number of features between the users and items is not the same. To solve the above problems, this paper proposes an attention interaction matrix factorization (AIMF) model. The AIMF model adopts a symmetric structure using MLP calculation. This structure can simultaneously extract the nonlinear features of user latent features and item latent features, thus reducing the computation time of the model. In addition, an improved attention algorithm named slide-attention is included in the model. The algorithm uses the sliding query method to obtain the user's attention to the latent features of the item and solves the interaction problem among different dimensions of the user, and the latent features of the item. [ABSTRACT FROM AUTHOR]

Three-dimensional models, reconstructed from real-life objects, are extensively used in virtual and mixed reality technologies. In this paper we propose an approach to 3D model reconstruction via inverse procedural modeling and describe two variants of this approach. The first option is to fit a set of input parameters using a genetic algorithm. The second option allows us to significantly improve precision by using gradients within the memetic algorithm, differentiable rendering, and differentiable procedural generators. We demonstrate the results of our work on different models, including trees, which are complex objects that most existing methods cannot reconstruct. In our work, we see two main contributions. First, we propose a method to join differentiable rendering and inverse procedural modeling. This gives us the ability to reconstruct 3D models more accurately than existing approaches when few input images are available, even for a single image. Second, we combine both differentiable and non-differentiable procedural generators into a single framework that allows us to apply inverse procedural modeling to fairly complex generators. We show that both variants of our approach can be useful: the differentiable one is more precise but puts limitations on the procedural generator, while the one based on genetic algorithms can be used with any existing generator. The proposed approach uses information about the symmetry and structure of the object to achieve high-quality reconstruction from a single image. [ABSTRACT FROM AUTHOR]

In this paper, we first develop an active set identification technique, and then we suggest a modified nonmonotone line search rule, in which a new parameter formula is introduced to control the degree of the nonmonotonicity of line search. By using the modified line search and the active set identification technique, we propose a global convergent method to solve the NMF based on the alternating nonnegative least squares framework. In addition, the larger step size technique is exploited to accelerate convergence. Finally, a large number of numerical experiments are carried out on synthetic and image datasets, and the results show that our presented method is effective in calculating speed and solution quality. [ABSTRACT FROM AUTHOR]

In application scenarios such as cloud storage, a symmetric algorithm can be used to encrypt massive data. However, using the symmetric operation and keys in encryption and decryption, it is very difficult to realize an efficient access control system. The asymmetric encryption algorithm ciphertext-policy attribute-based encryption (CP-ABE), as a versatile one-to-many encryption algorithm, is considered an ideal access control tool to solve the user's distrust of the service provider of cloud storage. However, in a traditional CP-ABE system, the malicious users may deliberately leak their attribute keys to others or build a decryption black box (DB) to provide illegal decryption services for benefits, while no one can determine their identities. To deal with the problems, especially the problem of tracing the DB builder, CP-ABE schemes with black-box traceability have been proposed in the past few years. But in this paper, we point out that for now, the tracing algorithms in all existing schemes actually work on an impractical assumption. That is, whenever a DB receives a decryption request, it always performs the decryption algorithm honestlycorrectly. We argue that if a DB finds the decryption request comes from the tracing algorithm, it may intentionally output incorrect decryption results to counter the tracing. Thus, we present the structural defect of the tracing algorithm applied to all known traceable CP-ABE schemes. We describe the construction of an alert decryption black box (ADB) that is capable of distinguishing a tracing ciphertext from a normal one. We also show how an ADB frustrates the tracing algorithm, and furthermore, malicious users can even apply an ADB to frame innocent users. [ABSTRACT FROM AUTHOR]

Object detection and tracking has always been one of the important research directions in computer vision. The purpose is to determine whether the object is contained in the input image and enclose the object with a bounding box. However, most object detection and tracking methods are applied to daytime objects, and the processing of nighttime objects is imprecise. In this paper, a spectral-spatial feature enhancement algorithm for nighttime object detection and tracking is proposed, which is inspired by symmetrical neural networks. The proposed method consists of the following steps. First, preprocessing is performed on unlabeled nighttime images, including low-light enhancement, object detection, and dynamic programming. Second, object features for daytime and nighttime times are extracted and modulated with a domain-adaptive structure. Third, the Siamese network can make full use of daytime and nighttime object features, which is trained as a tracker by the above images. Fourth, the test set is subjected to feature enhancement and then input to the tracker to obtain the final detection and tracking results. The feature enhancement step includes low-light enhancement and Gabor filtering. The spatial-spectral features of the target are fully extracted in this step. The NAT2021 dataset is used in the experiments. Six methods are employed as comparisons. Multiple judgment indicators were used to analyze the research results. The experimental results show that the method achieves excellent detection and tracking performance. [ABSTRACT FROM AUTHOR]

This paper describes a smart ray-tracing method based on the ray concept. From the literature review, we observed that there is still a research gap on conventional ray-tracing methods that is worthy of further investigation. The herein proposed smart 3D ray-tracing method offers an efficient and fast way to predict indoor radio propagation for supporting future generation networks. The simulation data was verified by measurements. This method is advantageous for developing new ray-tracing algorithms and simulators to improve propagation prediction accuracy and computational speed. [ABSTRACT FROM AUTHOR]

The Constraint Satisfaction Problem (CSP) is a significant research area in artificial intelligence, and includes a large number of symmetric or asymmetric structures. A backtracking search combined with constraint propagation is considered to be the best CSP-solving algorithm, and the consistency algorithm is the main algorithm used in the process of constraint propagation, which is the key factor in constraint-solving efficiency. Max-restricted path consistency (maxRPC) is a well-known and efficient consistency algorithm, whereas the lmaxRPC3 r m algorithm is a classic lightweight algorithm for maxRPC. In this paper, we leverage the properties of symmetry to devise an improved pruning strategy aimed at efficiently diminishing the problem's search space, thus enhancing the overall solving efficiency. Firstly, we propose the maxRPC3 s i m algorithm, which abandons the two complex data structures used by lmaxRPC3 r m . We can render the algorithm to be more concise and competitive compared to the original algorithm while ensuring that it maintains the same average performance. Secondly, inspired by the RCP3 algorithm, we propose the maxRPC3 s i m R algorithm, which uses the idea of residual support to cut down the redundant operation of the lmaxRPC3 r m algorithm. Finally, combining the domain/weighted degree (dom/wdeg) heuristic with the activity-based search (ABS) heuristic, a new variable ordering heuristic, ADW, is proposed. Our heuristic prioritizes the selection of variables with symmetry for pruning, further enhancing the algorithm's pruning capabilities. Experiments were conducted on both random and structural problems separately. The results indicate that our two algorithms generally outperform other algorithms in terms of performance on both problem classes. Moreover, the new heuristic algorithm demonstrates enhanced robustness across different problem types when compared to various existing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a point cloud coarse–fine registration method based on a new improved version of the whale optimization algorithm (NIWOA) and iterative closest point (ICP) algorithm is proposed; we use three strategies to improve the whale optimization algorithm (WOA). Firstly, circle chaotic mapping is used to initialize the whale population to increase the diversity of the population and make the search space more comprehensively explored. In addition, a Newton inertia weight is proposed to flexibly adjust the proportion of global exploration and local optimization in order to achieve the balance between the exploitation performance and exploration ability of the algorithm. At the same time, we introduce the nonlinear convergence factor that can adjust the size adaptively so that the algorithm can find the global optimal solution faster and more accurately, allowing it to avoid falling into the local optimal solution to a certain extent. The NIWOA algorithm is used to optimize the objective function of point cloud coarse registration to obtain the optimal coordinate transformation, and the rotation and translation operation is carried out on the registered point cloud. The obtained position is used as the initial pose of the ICP fine registration, and the final registration is achieved through ICP iteration. We conduct coarse registration experiments on multiple model point clouds and scene point clouds using the Stanford 3D Scanning Repository dataset and Princeton 3Dmatch dataset, respectively. The experimental results confirm that the NIWOA algorithm can not only find the initial position that is closer to the target point cloud, but also provide reliable initial values for the ICP algorithm. Meanwhile, the NIWOA algorithm combined with ICP experiment results show that the method has a higher registration accuracy and operation efficiency. [ABSTRACT FROM AUTHOR]

Some might say that the eigenproblem is one of the examples people discovered by looking at the sky and wondering. Even though it was formulated to explain the movement of the planets, today it has become the ansatz of solving many linear and nonlinear problems. Formulation in the terms of the eigenproblem is one of the key tools to solve complex problems, especially in the area of molecular geometry. However, the basic concept is difficult without proper preparation. A review paper covering basic concepts and algorithms is very useful. This review covers the basics of the topic. Definitions are provided for defective, Hermitian, Hessenberg, modal, singular, spectral, symmetric, skew-symmetric, skew-Hermitian, triangular, and Wishart matrices. Then, concepts of characteristic polynomial, eigendecomposition, eigenpair, eigenproblem, eigenspace, eigenvalue, and eigenvector are subsequently introduced. Faddeev–LeVerrier, von Mises, Gauss–Jordan, Pohlhausen, Lanczos–Arnoldi, Rayleigh–Ritz, Jacobi–Davidson, and Gauss–Seidel fundamental algorithms are given, while others (Francis–Kublanovskaya, Gram–Schmidt, Householder, Givens, Broyden–Fletcher–Goldfarb–Shanno, Davidon–Fletcher–Powell, and Saad–Schultz) are merely discussed. The eigenproblem has thus found its use in many topics. The applications discussed include solving Bessel's, Helmholtz's, Laplace's, Legendre's, Poisson's, and Schrödinger's equations. The algorithm extracting the first principal component is also provided. [ABSTRACT FROM AUTHOR]

Structural breaks are often encountered in empirical studies with large panels. This paper considers the estimation of multiple breaks in the mean of panel data model based on a modified screening and ranking algorithm. This algorithm satisfies symmetry and is suitable for both cases where the jump size of break points is positive and negative. The break points are first initially screened based on the adaptive Fisher's statistic, followed by further screening of the break points using the threshold criterion, and finally the final break points are screened using the information criterion. Furthermore, the consistency of the break point estimators is proved. The Monte Carlo simulation results show that the proposed method performs well even if the error terms are serially correlated or cross-sectionally correlated. Finally, two empirical examples illustrate the use of this method. [ABSTRACT FROM AUTHOR]

This paper introduces an evolutionary algorithm for n-dimensional single objective optimization problems: One-Dimensional Subspaces Optimization Algorithm (1D-SOA). The algorithm starts with an initial population in randomly selected positions. For each individual, a percentage of the total number of dimensions is selected, each dimension corresponding to a one-dimensional subspace. Later, it performs a symmetric search for the nearest local optima in all the selected one-dimensional subspaces (1D-S), for each individual at a time. The search stops if the new position does not improve the value of the objective function over all the selected 1D-S. The performance of the algorithm was compared against 11 algorithms and tested with 30 benchmark functions in 2 dimensions (D) and 30D. The proposed algorithm showed a better performance than all other studied algorithms for large dimensions. [ABSTRACT FROM AUTHOR]

This paper introduces a novel collocation scheme based on an extended cubic B-spline for approximating the solution of a second-order partial integro-differential equation. The proposed scheme employs new extended cubic B-splines to discretize the second-order derivatives in the spatial domain, while discretization of spatial derivatives of lower orders is achieved using extended cubic B-spline functions. Temporal derivatives are discretized using the forward difference formula. The stability of the algorithm is assessed using the von Neumann stability method to ensure that error magnification is avoided. Furthermore, convergence analysis of the scheme is provided. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed scheme. The free parameter is optimized using L 2 and L ∞ norms. The computed results are compared with those obtained from various standard numerical schemes found in the literature. Mathematical 12 is used to obtain numerical results. [ABSTRACT FROM AUTHOR]

In our recent paper we obtained an extension of a theorem of Tam (2018), which was established for iterates of a set-valued paracontracting operators in a finite-dimensional Euclidean space. This extension was obtained for exact iterates of maps in a metric space. In the present paper we prove two analogs of this result for inexact iterates under the presence of computational errors. In the first result, the errors are summable, while for the second one they converge to zero. In a particular case of a Banach space, if all the operators are symmetric, then the set of all limit points of iterates is symmetric too. [ABSTRACT FROM AUTHOR]

With the gradual popularization of autonomous driving technology, how to obtain traffic sign information efficiently and accurately is very important for subsequent decision-making and planning tasks. Traffic sign detection and recognition (TSDR) algorithms include color-based, shape-based, and machine learning based. However, the algorithms mentioned above are insufficient for traffic sign detection tasks in complex environments. In this paper, we propose a traffic sign detection and recognition paradigm based on deep learning algorithms. First, to solve the problem of insufficient spatial information in high-level features of small traffic signs, the parallel deformable convolution module (PDCM) is proposed in this paper. PDCM adaptively acquires the corresponding receptive field preserving the integrity of the abstract information through symmetrical branches thereby improving the feature extraction capability. Simultaneously, we propose sub-pixel convolution attention module (SCAM) based on the attention mechanism to alleviate the influence of scale distribution. Distinguishing itself from other feature fusion, our proposed method can better focus on the information of scale distribution through the attention module. Eventually, we introduce GSConv to further reduce the computational complexity of our proposed algorithm, better satisfying industrial application. Experimental results demonstrate that our proposed methods can effectively improve performance, both in detection accuracy and mAP@0.5. Specifically, when the proposed PDCM, SCAM, and GSConv are applied to the Yolov5, it achieves 89.2% mAP@0.5 in TT100K, which exceeds the benchmark network by 4.9%. [ABSTRACT FROM AUTHOR]

This paper discusses and compares several computed tomography (CT) algorithms capable of dealing with incomplete data. This type of problem has been proposed for a symmetrical grid and symmetrically distributed transmitters and receivers. The use of symmetry significantly speeds up the process of constructing a system of equations that is the foundation of all CT algebraic algorithms. Classic algebraic approaches are effective in incomplete data scenarios, but suffer from low convergence speed. For this reason, we propose the use of nature-inspired algorithms which are proven to be effective in many practical optimization problems from various domains. The efficacy of nature-inspired algorithms strongly depends on the number of parameters they maintain and reproduce, and this number is usually substantial in the case of CT applications. However, taking into account the specificity of the reconstructed object allows to reduce the number of parameters and effectively use heuristic algorithms in the field of CT. This paper compares the efficacy and suitability of three nature-inspired heuristic algorithms: Artificial BeeColony (ABC), Ant Colony Optimization (ACO), and Clonal Selection Algorithm (CSA) in the CT context, showing their advantages and weaknesses. The best algorithm is identified and some ideas of how the remaining methods could be improved so as to better solve CT tasks are presented. [ABSTRACT FROM AUTHOR]

Automatic parking path optimization is a key point for automatic parking. However, it is difficult to obtain the smooth, accurate and optimal parking path by using traditional automatic parking optimization algorithms. So, based on the automatic parking path optimization model for cubic spline interpolation, an improved automatic parking path optimization based on the immune moth flame algorithm is proposed for intelligent vehicles. Firstly, to enhance the global optimization performance, an automatic parking path optimization model for cubic spline interpolation is designed by using shortest parking path as optimization target. Secondly, an improved immune moth flame algorithm (IIMFO) based on the immune mechanism, Gaussian mutation mechanism and opposition-based learning strategy is proposed, and an adaptive decreasing inertia weight coefficient is integrated into the moth flame algorithm so that these strategies can improve the balance quality between global search and local development effectively. Finally, the optimization results on the several common test functions show that the IIMFO algorithm proposed in this paper has higher optimization precision. Furthermore, the simulation and semi-automatic experiment results of automatic parking path optimization practical cases show that the improved automatic parking path optimization based on the immune moth flame algorithm for intelligent vehicles has a better optimization effect than that of the traditional automatic parking optimization algorithms. [ABSTRACT FROM AUTHOR]

Mapping optimization of network-on-chips (NoCs) for specific applications has become one of the most important keys of the SoC top-level design. However, the topology of NoC applied is usually regular topology, such as mesh, torus, etc., which may generate a large number of isomorphic solutions during the process of NoC mapping, which may reduce the convergence speed of mapping algorithms. In this paper, we proposed a generic-based hyper-heuristic algorithm named IRC-GHH for NoC mapping. To reduce the influence of isomorphic solutions, we analyzed the symmetry of NoC topology and proposed crossover operators based on the isomorphic solution to optimize the algorithm. We studied the situation of invalid crossovers and eliminated invalid iterations by adopting an isomorphic replacement crossover (IRC) strategy. To prevent the algorithm from falling into evolutionary stagnation in the late iteration, we introduce an adaptive mechanism to increase the usage frequency of the IRC operator automatically. Compared with GHH without IRC, the GHH with IRC can achieve, on average 15.25% communication energy reduction and 7.84% communication delay reduction. [ABSTRACT FROM AUTHOR]

This paper proposes a novel image encryption algorithm based on an integer form of chaotic mapping and 2-order bit compass diffusion technique. Chaotic mapping has been widely used in image encryption. If the floating-point number generated by chaotic mapping is applied to image encryption algorithm, it will slow encryption and increase the difficulty of hardware implementation. An innovative pseudo-random integer sequence generator is proposed. In chaotic system, the result of one-iteration is used as the shift value of two binary sequences, the original symmetry relationship is changed, and then XOR operation is performed to generate a new binary sequence. Multiple iterations can generate pseudo-random integer sequences. Here integer sequences have been used in scrambling of pixel positions. Meanwhile, this paper demonstrates that there is an inverse operation in the XOR operation of two binary sequences. A new pixel diffusion technique based on bit compass coding is proposed. The key vector of the algorithm comes from the original image and is hidden by image encryption. The efficiency of our proposed method in encrypting a large number of images is evaluated using security analysis and time complexity. The performance evaluation of algorithm includes key space, histogram differential attacks, gray value distribution(GDV),correlation coefficient, PSNR, entropy, and sensitivity. The comparison between the results of coefficient, entropy, PSNR, GDV, and time complexity further proves the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Over the years, research on fuzzy clustering algorithms has attracted the attention of many researchers, and they have been applied to various areas, such as image segmentation and data clustering. Various fuzzy clustering algorithms have been put forward based on the initial Fuzzy C-Means clustering (FCM) with Euclidean distance. However, the existing fuzzy clustering approaches ignore two problems. Firstly, clustering algorithms based on Euclidean distance have a high error rate, and are more sensitive to noise and outliers. Secondly, the parameters of the fuzzy clustering algorithms are hard to determine. In practice, they are often determined by the user's experience, which results in poor performance of the clustering algorithm. Therefore, considering the above deficiencies, this paper proposes a novel fuzzy clustering algorithm by combining the Gaussian kernel function and Grey Wolf Optimizer (GWO), called Kernel-based Picture Fuzzy C-Means clustering with Grey Wolf Optimizer (KPFCM-GWO). In KPFCM-GWO, the Gaussian kernel function is used as a symmetrical measure of distance between data points and cluster centers, and the GWO is utilized to determine the parameter values of PFCM. To verify the validity of KPFCM-GWO, a comparative study was conducted. The experimental results indicate that KPFCM-GWO outperforms other clustering methods, and the improvement of KPFCM-GWO is mainly attributed to the combination of the Gaussian kernel function and the parameter optimization capability of the GWO. What is more, the paper applies KPFCM-GWO to analyzes the value of an airline's customers, and five levels of customer categories are defined. [ABSTRACT FROM AUTHOR]

In recent years, some general cryptographic technologies have been widely used in network platforms related to the national economy and people's livelihood, effectively curbing network security risks and maintaining the orderly operation and normal order of society. However, due to the fast development and considerable benefits of quantum computing, the classical cryptosystem faces serious security threats, so it is crucial to analyze and assess the anti-quantum computing ability of cryptographic algorithms under the quantum security model, to enhance or perfect the design defects of related algorithms. However, the current design and research of anti-quantum cryptography primarily focus on the cryptographic structure or working mode under the quantum security model, and there is a lack of quantum security analysis on instantiated cryptographic algorithms. This paper investigates the security of AES-OTR, one of the third-round algorithms in the CAESAR competition, under the Q2 model. The periodic functions of the associated data were constructed by forging the associated data according to the parallel and serial structure characteristics of the AES-OTR algorithm in processing the associated data, and the periodic functions of the associated data were constructed multiple times based on the Simon quantum algorithm. By using the collision pair, two collision forgery attacks on the AES-OTR algorithm can be successfully implemented, and the period s is obtained by solving with a probability close to 1. The attacks in this paper caused a significant threat to the security of the AES-OTR algorithm. [ABSTRACT FROM AUTHOR]

With the real restriction of packet size and transmission power, a joint UL-AoA (Uplink Angle of Arrival) and UL-TDOA (Uplink Time Difference of Arrival) positioning method is discussed for the Industrial Internet of Things (IIoT), which demands high accuracy of position information. One motivation of the UL positioning method of IIoT is an asymmetric network and uplink traffic is dominant in most identified scenarios. Further, IIoT sensors are power limited for low cost, compared to the transmission power of base stations and other normal user equipment. This paper considers an environment of a 5G-enabled IIoT network with massive Multiple input multiple output (MIMO) antennas, beamforming and millimeter operating bands. After reviewing downlink positioning reference signal (PRS) and uplink sounding reference signal for positioning (SRS-Pos), a general system model and a theoretical localization problem is derived under the joint positioning method. The provided simulation results help to investigate the impact of system configurations on positioning measurements. Further, through the test in this paper, it is proved that joint positioning outperforms that of the time only or angle only method. [ABSTRACT FROM AUTHOR]