Search

In this paper, we proposed a scheme that Injects artificial noise from the tag end (IANT) to enhance the physical layer security of the ambient backscatter communication (ABC) system. The difference between the ABC system and the traditional radio frequency identification system is whether it uses the radio frequency (RF) signals in the environment to supply energy and modulation information for passive tags. In the IANT scheme, we select the best tag to communicate with the reader according to the channel quality between tags and reader, and at the same time select another tag to generate artificial noise that affects the receiving effect of the eavesdropper. This paper uses the method of generating noise copies in the reader to reduce the interference of artificial noise on the signal received by the reader. The simulation results show that with the increase in channel quality between tags and reader and the increase in the number of tags, the proposed IANT scheme is significantly superior to the contrast scheme in terms of system achievable secrecy rate, effectively enhancing the physical layer security of the ABC system.

This paper is devoted to further strengthening, in the current asymmetric information environment, the informed level of operators about network performance. Specifically, in view of the burst and perishability of a packet loss event, to better meet the real-time requirements of current high-speed backbone performance monitoring, a model for Packet Loss Measurement at the access network boundary Based on Sampled Flow (PLMBSF) is presented in this paper under the premise of both cost and real-time. The model overcomes problems such as the inability of previous estimation to distinguish between packet losses before and after the monitoring point, deployment difficulties and cooperative operation consistency. Drawing support from the Mathis equation and regression analysis, the measurement for packet losses before and after the monitoring point can be realized when using only the sampled flows generated by the access network boundary equipment. The comparison results with the trace-based passive packet loss measurement show that although the proposed model is easily affected by factors such as flow length, loss rate, sampling rate, the overall accuracy is still within the acceptable range. In addition, the proposed model PLMBSF, compared with the trace-based loss measurement is only different in the input data granularity. Therefore, PLMBSF and its advantages are also applicable to aggregated traffic.

The paper aims to analyze the vibrations of a summing box, used in heavy vehicles. An experimental setup is proposed and used for the analysis of these vibrations transmitted by the box housing, based on the measurement of the mechanical impedance. It is then shown that a simpler measurement, namely that of the generated noise spectrum, can provide equally useful results, with less effort and in a shorter time. The experimental setup is much simpler, involving a sonometer arranged in the experimental assembly. The symmetry of the box allows us to facilitate the execution of the experimental assembly, and the use of the symmetrical structure to facilitate the calculation of vibrations. The results obtained using this method in the case of a redesigned adder box are presented in the paper.

Most of the papers published so far in literature have focused on the theoretical phenomena underlying the formation of chaos, rather than on the investigation of potential applications of chaos to the real world. This paper aims to bridge the gap between chaos theory and chaos applications by presenting a survey of very recent applications of chaos. In particular, the manuscript covers the last three years by describing different applications of chaos as reported in the literature published during the years 2018 to 2020, including the matter related to the symmetry properties of chaotic systems. The topics covered herein include applications of chaos to communications, to distributed sensing, to robotic motion, to bio-impedance modelling, to hardware implementation of encryption systems, to computing and to random number generation.

Increasingly, cities worldwide are striving for green travel and slow traffic, and vigorously developing people-oriented urban pedestrian traffic with sustainability has become a fixture in recent discourse. This paper comprehensively considers the sidewalk’s facilities environment and the status of pedestrian traffic flow; divides the urban pedestrian road system (UPRS) into five subsystems around the underpass, overpass, crosswalk, sidewalk, and road crosswalk; and introduces the basic structure as well as the function of each system. Then, the indicators are classified into two types of crosswalk facilities and sidewalk facilities, and a comprehensive pedestrian road indicator system with the combination of subjective and objective is established. Consequently, the integration of the fuzzy AHP and DEA-based symmetrical technique for the subjective evaluation indicator combined with pedestrian traffic characteristics is developed. A nine-step semantics scale of relative importance was used so that the symmetry of the response of pedestrian satisfaction was maintained. Fuzzy evaluation based on AHP is further modeled, and the DEA is employed to achieve an overall evaluation of the quality of service (QoS) for UPRS. The applicability of the established evaluation system is finally verified through a real case study in Harbin, China. The serviceability assessment method in this paper provides a new idea for planners to conduct sustainability evaluation for UPRS in future urban renewal development.

The aim of the present tutorial paper is to recall notions from manifold calculus and to illustrate how these tools prove useful in describing system-theoretic properties. Special emphasis is put on embedded manifold calculus (which is coordinate-free and relies on the embedding of a manifold into a larger ambient space). In addition, we also consider the control of non-linear systems whose states belong to curved manifolds. As a case study, synchronization of non-linear systems by feedback control on smooth manifolds (including Lie groups) is surveyed. Special emphasis is also put on numerical methods to simulate non-linear control systems on curved manifolds. The present tutorial is meant to cover a portion of the mentioned topics, such as first-order systems, but it does not cover topics such as covariant derivation and second-order dynamical systems, which will be covered in a subsequent tutorial paper.

This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the road network speed in the distribution area, considering the influence of the road network on the vehicle speed and the relationship between vehicle load and fuel consumption, a multi-depot joint distribution vehicle routing optimization model is established to minimize the sum of vehicle fixed cost, fuel consumption cost and time window penalty cost. Traditional vehicle routing problems are modeled based on symmetric graphs. In this paper, considering the influence of time-dependent networks on routes optimization, modeling is based on asymmetric graphs, which increases the complexity of the problem. A hybrid genetic algorithm with variable neighborhood search (HGAVNS) is designed to solve the model, in which the nearest neighbor insertion method and Logistic mapping equation are used to generate the initial solution firstly, and then five neighborhood structures are designed to improve the algorithm. An adaptive neighborhood search times strategy is used to balance the diversification and depth search of the population. The effectiveness of the designed algorithm is verified through several groups of numerical instances with different scales. The research can enrich the relevant theoretical research of multi-depot vehicle routing problems and provide the theoretical basis for transportation enterprises to formulate reasonable distribution schemes.

In order to play the important role of electric vehicles to promote the realization of the 3060 double carbon target, electric vehicles have seen explosive growth. However, due to the tight symmetry between the number and distribution of electric vehicles and their corresponding charging facilities, the layout of charging facilities has higher requirements. This paper collects travel data in the form of a traffic travel questionnaire for electric vehicle users. Based on the vehicle parking demand model of the queuing theory and Monte Carlo simulation, the paper gives the number of stopping vehicles and the time of vehicles stopping in different places such as residential areas, workplaces, supermarket parking and roadside. In addition, based on the Bass prediction model, the main parameters are modeled in the model, and the price correction coefficient is introduced. The improved Bass model is used to predict the growth trend of electric vehicles in different regions in different years and in different incentive sites. By predicting the ownership of urban electric vehicles and accurately grasping the distribution and operation of electric vehicles, this paper can provide guidance and suggestions for the planning and construction of charging facilities in different regions, effectively reduce the investment cost of charging facilities and guide local governments to formulate reasonable planning schemes.

For non-linear systems (NLSs), the state estimation problem is an essential and important problem. This paper deals with the nonlinear state estimation problems in nonlinear and non-Gaussian systems. Recently, the Bayesian filter designer based on the Bayesian principle has been widely applied to the state estimation problem in NLSs. However, we assume that the state estimation models are nonlinear and non-Gaussian, applying traditional, typical nonlinear filtering methods, and there is no precise result for the system state estimation problem. Therefore, the larger the estimation error, the lower the estimation accuracy. To perfect the imperfections, a projection filtering method (PFM) based on the Bayesian estimation approach is applied to estimate the state. First, this paper constructs its projection symmetric interval to select the basis function. Second, the prior probability density of NLSs can be projected into the basis function space, and the prior probability density solution can be solved by using the Fokker–Planck Equation (FPE). According to the Bayes formula, the proposed estimator utilizes the basis function in projected space to iteratively calculate the posterior probability density, thus, it avoids calculating the partial differential equation. By taking two illustrative examples, it is also compared with the traditional UKF and PF algorithm, and the numerical experiment results show the feasibility and effectiveness of the novel nonlinear state estimation filter algorithm.

This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics, such as the Constructive Genetic Algorithm (CGA) to construct promising initial solutions, a Tabu Search (TS) to improve the initial solutions on the routing problem, and a Large Neighborhood Search (LNS) for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multithreading programming to improve the performance. Additionally, memory structures such as hash-tables were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest to the community involved in symmetry studies, such as graph algorithms and graph theory.

Class imbalance, as a phenomenon of asymmetry, has an adverse effect on the performance of most machine learning and overlap is another important factor that affects the classification performance of machine learning algorithms. This paper deals with the two factors simultaneously, addressing the class overlap under imbalanced distribution. In this paper, a theoretical analysis is firstly conducted on the existing class overlap metrics. Then, an improved method and the corresponding metrics to evaluate the class overlap under imbalance distributions are proposed based on the theoretical analysis. A well-known collection of the imbalanced datasets is used to compare the performance of different metrics and the performance is evaluated based on the Pearson correlation coefficient and the ξ correlation coefficient. The experimental results demonstrate that the proposed class overlap metrics outperform other compared metrics for the imbalanced datasets and the Pearson correlation coefficient with the AUC metric of eight algorithms can be improved by 34.7488% in average.

The mutual confrontation between image steganography and steganalysis causes both to iterate continuously, and as a result, the dimensionality of the steganalytic features continues to increase, leading to an increasing spatio-temporal overhead. To this end, this paper proposes a fast steganalytic feature selection method based on a similar cross-entropy. Firstly, the properties of cross-entropy are investigated, through the discussion of different models, and the intra-class similarity criterion and inter-class similarity criterion based on cross-entropy are presented for the first time. Then, referring to the design principles of Fisher’s criterion, the criterion of feature contribution degree is further proposed. Secondly, the variation of the cross-entropy function of a univariate variable is analyzed in principle, thus determining the normalized range and simplifying the subsequent analysis. Then, within the normalized range, the variation of the cross-entropy function of a binary variable is investigated and the setting of important parameters is determined. Thirdly, the concept of similar cross-entropy is further presented by analyzing the changes in the value of the feature contribution measure under different circumstances, and based on this, the criterion for the feature contribution measure is updated to decrease the complexity of the calculation. Remarkably, the contribution measure criterion devised in this paper is a symmetrical structure, which equitably measures the contribution of features in different situations. Fourth, the feature component with the highest contribution is selected as the final selected feature based on the result of the feature metric. Finally, based on the Bossbase 1.01 image base that is a unique standard and recognized base in steganalysis, the feature selection on 8 kinds of low and high-dimensional steganalytic features is carried out. Through extensive experiments, comparison with several classic and state-of-the-art methods, the method designed in this paper attains competitive or even better performance in detection accuracy, calculation cost, storage cost and versatility.

In the years 1917–1919 Tullio Levi-Civita published a number of papers presenting new solutions to Einstein’s equations. This work, while partially translated, remains largely inaccessible to English speaking researchers. In this paper we review these solutions, and present them in a modern readable manner. We will also compute both Cartan–Karlhede and Carminati–Mclenaghan invariants such that these solutions are invariantly characterized by two distinct methods. These methods will allow for these solutions to be totally and invariantly characterized. Because of the variety of solutions considered here, this paper will also be a useful reference for those seeking to learn to apply the Cartan–Karlhede algorithm in practice.

Recent years have seen a growing call for use of big data analytics techniques to support the realisation of symmetries and simulations in digital twins and smart factories, in which data quality plays an important role in determining the quality of big data analytics products. Although data quality affecting big data analytics has received attention in the smart factory research field, to date a systematic review of the topic of interest for understanding the present state of the art is not available, which could help reveal the trends and gaps in this area. This paper therefore presents a systematic literature review of research articles about data quality affecting big data analytics in smart factories that have been published up to 2020. We examined 31 empirical studies from our selection of papers to identify the research themes in this field. The analysis of these studies links data quality issues toward big data analytics with data quality dimensions and methods used to address these issues in the smart factory context. The findings of this systematic review also provide implications for practitioners in addressing data quality issues to better use big data analytics products to support digital symmetry in the context of smart factory.

To beat competition and obtain valuable information, decision-makers must conduct in-depth machine learning or data mining for data analytics. Traditionally, clustering and classification are two common methods used in machine mining. For clustering, data are divided into various groups according to the similarity or common features. On the other hand, classification refers to building a model by given training data, where the target class or label is predicted for the test data. In recent years, many researchers focus on the hybrid of clustering and classification. These techniques have admirable achievements, but there is still room to ameliorate performances, such as distributed process. Therefore, we propose clustering and classification based on distributed automatic feature engineering (AFE) for customer segmentation in this paper. In the proposed algorithm, AFE uses artificial bee colony (ABC) to select valuable features of input data, and then RFM provides the basic data analytics. In AFE, it first initializes the number of cluster k. Moreover, the clustering methods of k-means, Wald method, and fuzzy c-means (FCM) are processed to cluster the examples in variant groups. Finally, the classification method of an improved fuzzy decision tree classifies the target data and generates decision rules for explaining the detail situations. AFE also determines the value of the split number in the improved fuzzy decision tree to increase classification accuracy. The proposed clustering and classification based on automatic feature engineering is distributed, performed in Apache Spark platform. The topic of this paper is about solving the problem of clustering and classification for machine learning. From the results, the corresponding classification accuracy outperforms other approaches. Moreover, we also provide useful strategies and decision rules from data analytics for decision-makers.

Logistics plays an important role in the field of global economy, and the storage and retrieval of tasks in a warehouse which has symmetry is the most important part of logistics. Generally, the shelves of a warehouse have a certain degree of symmetry and similarity in their structure. The storage and retrieval efficiency directly affects the efficiency of logistics. The efficiency of the traditional storage and retrieval mode has become increasingly inconsistent with the needs of the industry. In order to solve this problem, this paper proposes a greedy algorithm based on cost matrix to solve the path planning problem of the automatic storage and retrieval system (AS/RS). Firstly, aiming at the path planning mathematical model of AS/RS, this paper proposes the concept of cost matrix, which transforms the traditional storage and retrieval problem into the element combination problem of cost matrix. Then, a more efficient backtracking algorithm is proposed based on the exhaustive method. After analyzing the performance of the backtracking algorithm, combined with some rules, a greedy algorithm which can further improve efficiency is proposed; the convergence of the improved greedy algorithm is also proven. Finally, through simulation, the time consumption of the greedy algorithm is only 0.59% of the exhaustive method, and compared with the traditional genetic algorithm, the time consumption of the greedy algorithm is about 50% of the genetic algorithm, and it can still maintain its advantage in time consumption, which proves that the greedy algorithm based on cost matrix has a certain feasibility and practicability in solving the path planning of the automatic storage and retrieval system.

In recent years, crowded stampede incidents have occurred frequently, resulting in more and more serious losses. The common cause of such incidents is that when large-scale populations gather in a limited area, the population is highly unstable. In emergency situations, only when the crowd reaches the safe exit as soon as possible within a limited evacuation time to complete evacuation can the loss and casualties be effectively reduced. Therefore, the safety evacuation management of people in public places in emergencies has become a hot topic in the field of public security. Based on the analysis of the factors affecting the crowd path selection, this paper proposes an improved path-planning algorithm based on BEME (Balanced Evacuation for Multiple Exits). And pedestrian evacuation simulation is carried out in multi-exit symmetrical facilities. First, this paper optimizes the update method of the GSDL list in the BEME algorithm as the basis for evacuating pedestrians to choose an exit. Second, the collision between pedestrians is solved by defining the movement rule and collision avoidance strategy. Finally, the algorithm is compared with BEME and traditional path-planning algorithms. The results show that the algorithm can further shorten the global evacuation distance of the symmetrical evacuation scene, effectively balance the number of pedestrians at each exit and reduce the evacuation time. In addition, this improved algorithm uses a collision avoidance strategy to solve the collision and congestion problems in path planning, which helps to maximize evacuation efficiency. Whether the setting of the scene or the setting of the exit, all studies are based on symmetric implementation. This is more in line with the crowd evacuation in the real scene, making the experimental results more meaningful.

The variant, encryption, and confusion of WebShell results in problems in the detection method based on feature selection, such as poor detection effect and weak generalization ability. In order to solve this problem, a method of WebShell detection based on regularized neighborhood component analysis (RNCA) is proposed. The RNCA algorithm can effectively reduce the dimension of data while ensuring the accuracy of classification. In this paper, it is innovatively applied to a WebShell detection neighborhood, taking opcode behavior sequence features as the main research object, constructing vocabulary by using opcode sequence features with variable length, and effectively reducing the dimension of WebShell features from the perspective of feature selection. The opcode sequence selected by the algorithm is symmetrical with the source code file, which has great reference value for WebShell classification. On the issue of the single feature, this paper uses the fusion of behavior sequence features and text static features to construct a feature combination with stronger representation ability, which effectively improves the recognition rate of WebShell to a certain extent.

The plastic modifications in synaptic connectivity is primarily from changes triggered by neuromodulated dopamine signals. These activities are controlled by neuromodulation, which is itself under the control of the brain. The subjective brain’s self-modifying abilities play an essential role in learning and adaptation. The artificial neural networks with neuromodulated plasticity are used to implement transfer learning in the image classification domain. In particular, this has application in image detection, image segmentation, and transfer of learning parameters with significant results. This paper proposes a novel approach to enhance transfer learning accuracy in a heterogeneous source and target, using the neuromodulation of the Hebbian learning principle, called NDHTL (Neuromodulated Dopamine Hebbian Transfer Learning). Neuromodulation of plasticity offers a powerful new technique with applications in training neural networks implementing asymmetric backpropagation using Hebbian principles in transfer learning motivated CNNs (Convolutional neural networks). Biologically motivated concomitant learning, where connected brain cells activate positively, enhances the synaptic connection strength between the network neurons. Using the NDHTL algorithm, the percentage of change of the plasticity between the neurons of the CNN layer is directly managed by the dopamine signal’s value. The discriminative nature of transfer learning fits well with the technique. The learned model’s connection weights must adapt to unseen target datasets with the least cost and effort in transfer learning. Using distinctive learning principles such as dopamine Hebbian learning in transfer learning for asymmetric gradient weights update is a novel approach. The paper emphasizes the NDHTL algorithmic technique as synaptic plasticity controlled by dopamine signals in transfer learning to classify images using source-target datasets. The standard transfer learning using gradient backpropagation is a symmetric framework. Experimental results using CIFAR-10 and CIFAR-100 datasets show that the proposed NDHTL algorithm can enhance transfer learning efficiency compared to existing methods.

This Special Issue covers symmetric and asymmetric data that occur in real-life problems. We invited authors to submit their theoretical or experimental research to present engineering and economic problem solution models that deal with symmetry or asymmetry of different data types. The Special Issue gained interest in the research community and received many submissions. After rigorous scientific evaluation by editors and reviewers, seventeen papers were accepted and published. The authors proposed different solution models, mainly covering uncertain data in multi-criteria decision-making problems as complex tools to balance the symmetry between goals, risks, and constraints to cope with the complicated problems in engineering or management. Therefore, we invite researchers interested in the topics to read the papers provided in the Special Issue.

The aim of this paper is to show analytically and empirically how ant-based algorithms for medical image edge detection can be enhanced by using an admissible perturbation of demicontractive operators. We thus complement the results reported in a recent paper by the second author and her collaborators, where they used admissible perturbations of demicontractive mappings as test functions. To illustrate this fact, we first consider some typical properties of demicontractive mappings and of their admissible perturbations and then present some appropriate numerical tests to illustrate the improvement brought by the admissible perturbations of demicontractive mappings when they are taken as test functions in ant-based algorithms for medical image edge detection. The edge detection process reported in our study considers both symmetric (Head CT and Brain CT) and asymmetric (Hand X-ray) medical images. The performance of the algorithm was tested visually with various images and empirically with evaluation of parameters.

In decision-making process, decision-makers may make different decisions because of their different experiences and knowledge. The abnormal preference value given by the biased decision-maker (the value that is too large or too small in the original data) may affect the decision result. To make the decision fair and objective, this paper combines the advantages of the power average (PA) operator and the Bonferroni mean (BM) operator to define the generalized fuzzy soft power Bonferroni mean (GFSPBM) operator and the generalized fuzzy soft weighted power Bonferroni mean (GFSWPBM) operator. The new operator not only considers the overall balance between data and information but also considers the possible interrelationships between attributes. The excellent properties and special cases of these ensemble operators are studied. On this basis, the idea of the bidirectional projection method based on the GFSWPBM operator is introduced, and a multi-attribute decision-making method, with a correlation between attributes, is proposed. The decision method proposed in this paper is applied to a software selection problem and compared to the existing methods to verify the effectiveness and feasibility of the proposed method.

This paper focuses on preventing forms of social dysfunction such as invasions of privacy and stalking by understanding the diversified situation of the rapidly increasing number of social media users who use social media services, which are various types of social networking services. To prevent these problems, we aim to identify mutual relationships by layering the relationships between social media users. In other words, in social media that has a relationship with the subject, the subject user is yet another object, so the appearance of the object viewed by the subject user and the correlation between the subjects and objects must be visualized. At this time, because the subject is an object that has changed over time, it is necessary to perform symmetrical and mutual correlation analysis based on relationship through objective layering viewed from a computer. In this paper, the mutual relationship between the subject user and the object user was defined and visualized to apply it to the deep learning model through a software program. Among various types of social media that are mainly used, user information data is gathered through the popular social media site called Instagram and our target community platforms. Consequently, it was processed again to represent user interactions among other users. Finally, three stages of mutual relationship visualization were represented through simulation and tests, and 120,000 data sets were processed, classified, and proved through the simulation results.

UAV trajectory planning is one of the research focuses in artificial intelligence and UAV technology. The asymmetric information, however, will lead to the uncertainty of the UAV trajectory planning, the probability theory as the most commonly used method to solve the trajectory planning problem in uncertain environment will lead to unrealistic conclusions under the condition of lacking samples, while the uncertainty theory based on uncertain measures is an efficient method to solve such problems. Firstly, the uncertainties in trajectory planning are sufficiently considered in this paper, the fuel consumption, concealment and threat degree with uncertain variables are taken as the objective functions, the constraints are analyzed according to the maneuverability, and the uncertain multi-objective trajectory planning (UMOTP) model is established. After that, this paper takes both the long-term benefits and its stability into account, and then, the expected-value and standard-deviation efficient trajectory model is established. What is more, this paper solves the Pareto front of the trajectory planning, satisfying various preferences, which avoids the defects of the trajectory obtained by traditional model only applicable to a certain specific situation. In order to obtain a better solution set, this paper proposes an improved backbones particle swarm optimization algorithm based on PSO and NSGA-II, which overcomes the shortcomings of the traditional algorithm such as premature convergence and poor robustness, and the efficiency of the algorithm is tested. Finally, the algorithm is applied to the UMOTP problem, then, the optimal trajectory set is obtained, and the effectiveness and reliability of the model is verified.

With the development of mobile network technology, the continuous increase of mobile traffic has put forward higher requirements for quality of service (QoS) issues such as asymmetric transmission delay. The paper mainly studies the energy distribution problem on the migration data link from the terminal device to the edge node in the mobile edge network. Multiple data service packages are set up at each hop on the migration data link, and these data service packages compete with each other, and ultimately only one terminal provides and stores energy for this hop. The migration strategy of the data service package is affected by the edge node, and the edge node changes the migration strategy according to the migration strategy of the data service package. The paper is based on the formation of nodes between the data service packages of different nodes on the 5G network data link to jointly control the migration strategy, coordinate the migration strategy formulated, and better coordinate the migration strategy. In this competitive game model, the optimal migration strategy of nodes is found out according to the terminal equipment access requirements. Then according to the node stability rules, the composition of nodes when the nodes are stable is obtained, the migration strategy of stable nodes and the migration and spectrum strategies of operators are obtained, and the migration strategy of joint control provides energy for edge nodes.

Plant diseases pose a severe threat to crop yield. This necessitates the rapid identification of diseases affecting various crops using modern technologies. Many researchers have developed solutions to the problem of identifying plant diseases, but it is still considered a critical issue due to the lack of infrastructure in many parts of the world. This paper focuses on detecting and classifying diseases present in the leaf images by adopting a hybrid learning model. The proposed hybrid model uses k-means clustering for detecting the disease area from the leaf and a Convolutional Neural Network (CNN) for classifying the type of disease based on comparison between sampled and testing images. The images of leaves under consideration may be symmetrical or asymmetrical in shape. In the proposed methodology, the images of various leaves from diseased plants were first pre-processed to filter out the noise present to get an enhanced image. This improved image enabled detection of minute disease-affected regions. The infected areas were then segmented using k-means clustering algorithm that locates only the infected (diseased) areas by masking the leaves’ green (healthy) regions. The grey level co-occurrence matrix (GLCM) methodology was used to fetch the necessary features from the affected portions. Since the number of fetched features was insufficient, more synthesized features were included, which were then given as input to CNN for training. Finally, the proposed hybrid model was trained and tested using the leaf disease dataset available in the UCI machine learning repository to examine the characteristics between trained and tested images. The hybrid model proposed in this paper can detect and classify different types of diseases affecting different plants with a mean classification accuracy of 92.6%. To illustrate the efficiency of the proposed hybrid model, a comparison was made against the following classification approaches viz., support vector machine, extreme learning machine-based classification, and CNN. The proposed hybrid model was found to be more effective than the other three.

This paper proposes a new methodology to solve multiobjective optimization problems by invoking genetic algorithms and the concept of the Shapley values of cooperative games. It is well known that the Pareto-optimal solutions of multiobjective optimization problems can be obtained by solving the corresponding weighting problems that are formulated by assigning some suitable weights to the objective functions. In this paper, we formulated a cooperative game from the original multiobjective optimization problem by regarding the objective functions as the corresponding players. The payoff function of this formulated cooperative game involves the symmetric concept, which means that the payoff function only depends on the number of players in a coalition and is independent of the role of players in this coalition. In this case, we can reasonably set up the weights as the corresponding Shapley values of this formulated cooperative game. Under these settings, we can obtain the so-called Shapley–Pareto-optimal solution. In order to choose the best Shapley–Pareto-optimal solution, we used genetic algorithms by setting a reasonable fitness function.

Service fulfillment for clients increasingly involves cooperation between information technology (IT) systems. Designing such solutions requires an architectural approach that ensures symmetry between the communicating parties. For the design of such systems, the author introduces the 1+5 architectural views model. The model contains three new architectural views. For business process modeling, it ensures the integrated processes view. Integration aspects cover two additional views: integrated services, and contracts. Moreover, new stereotypes and tagged values have been added to the unified modeling language (UML). The author has introduced two profiles: UML profile for integration flows, and UML profile for distributed ledger deployment. Communication between systems requires flows that arrange mediation mechanisms. The paper describes an integration flow diagram that extends a UML activity diagram. In the case of blockchain, the author has proposed the smart contract design pattern. The paper describes three case studies that have employed the model to design various solutions. The 1+5 model has proven to be well suited for designing both centralized integration environments with enterprise service bus (ESB) and distributed blockchain solutions with peer-to-peer (P2P) connections.

Once a train breaks down on a busy railway line, it will affect the whole traffic network. However, when a rescue locomotive is hooked up to the broken train for towing it to the next station, it is common that coupling dislocation occurs, which results in damages to couplers and the driver’s cab. To ensure the safety of the trains during the coupling, it becomes crucial to determine whether they can be linked safely and automatically under different line conditions. In this paper, position and pose of the rescue locomotive and the broken train on the line are calculated by geometric analytical calculation method, which determines the position relation of their couplers. Then a so-called “coupling characteristic triangle” was proposed to determine whether trains can be safely and automatically linked on the railway line. The triangles are constructed by the peak points of the couplers head of the front vehicle and the rear one and border lines of secure coupling area on the couplers. By judging the shape of the triangle, it can directly judge whether their couplers can be connected successfully. The method has been applied to check the safety of the trains during coupling on the Nanchang urban railway Line 4. The results show that the maximum swing angle of the coupler reaches 17.3957° in the straight–curve section with a radius of 325 m. At this time, coupling is most difficult, and trains need to be connected manually through the tractor, all the calculation results are verified in the actual line. By comparing different calculation methods for judging coupling safety, it is shown that the method proposed in this paper is accurate, efficient, and users can judge coupling safety more intuitively.

The scientific community has presented various citation classification models to refute the concept of pure quantitative citation analysis systems wherein all citations are treated equally. However, a small number of benchmark datasets exist, which makes the asymmetric citation data-driven modeling quite complex. These models classify citations for varying reasons, mostly harnessing metadata and content-based features derived from research papers. Presently, researchers are more inclined toward binary citation classification with the belief that exploiting the datasets of incomplete nature in the best possible way is adequate to address the issue. We argue that contemporary ML citation classification models overlook essential aspects while selecting the appropriate features that hinder elutriating the asymmetric citation data. This study presents a novel binary citation classification model exploiting a list of potential natural language processing (NLP) based features. Machine learning classifiers, including SVM, KLR, and RF, are harnessed to classify citations into important and non-important classes. The evaluation is performed using two benchmark data sets containing a corpus of around 953 paper-citation pairs annotated by the citing authors and domain experts. The study outcomes exhibit that the proposed model outperformed the contemporary approaches by attaining a precision of 0.88.

An improved equilibrium optimizer (EO) algorithm is proposed in this paper to address premature and slow convergence. Firstly, a highly stochastic chaotic mechanism is adopted to initialize the population for range expansion. Secondly, the capability to conduct global search to jump out of local optima is enhanced by assigning adaptive weights and setting adaptive convergence factors. In addition 25 classical benchmark functions are used to validate the algorithm. As revealed by the analysis of the accuracy, speed, and stability of convergence, the IEO algorithm proposed in this paper significantly outperforms other meta-heuristic algorithms. In practice, the distribution is asymmetric because most logging data are unlabeled. Traditional classification models have difficulty in accurately predicting the location of oil layer. In this paper, the oil layers related to oil exploration are predicted using long short-term memory (LSTM) networks. Due to the large amount of data used, however, it is difficult to adjust the parameters. For this reason, an improved equilibrium optimizer algorithm (IEO) is applied to optimize the parameters of LSTM for improved performance, while the effective IEO-LSTM is applied for oil layer prediction. As indicated by the results, the proposed model outperforms the current popular optimization algorithms including particle swarm algorithm PSO and genetic algorithm GA in terms of accuracy, absolute error, root mean square error and mean absolute error.

Inaccurate electricity load forecasting can lead to the power sector gaining asymmetric information in the supply and demand relationship. This asymmetric information can lead to incorrect production or generation plans for the power sector. In order to improve the accuracy of load forecasting, a combined power load forecasting model based on machine learning algorithms, swarm intelligence optimization algorithms, and data pre-processing is proposed. Firstly, the original signal is pre-processed by the VMD–singular spectrum analysis data pre-processing method. Secondly, the noise-reduced signals are predicted using the Elman prediction model optimized by the sparrow search algorithm, the ELM prediction model optimized by the chaotic adaptive whale algorithm (CAWOA-ELM), and the LSSVM prediction model optimized by the chaotic sparrow search algorithm based on elite opposition-based learning (EOBL-CSSA-LSSVM) for electricity load data, respectively. Finally, the weighting coefficients of the three prediction models are calculated using the simulated annealing algorithm and weighted to obtain the prediction results. Comparative simulation experiments show that the VMD–singular spectrum analysis method and two improved intelligent optimization algorithms proposed in this paper can effectively improve the prediction accuracy. Additionally, the combined forecasting model proposed in this paper has extremely high forecasting accuracy, which can help the power sector to develop a reasonable production plan and power generation plans.

Many high formwork systems are currently equipped with health monitoring systems, and the analysis of the data obtained can determine whether high formwork is a hazard. Therefore, the post-processing of monitoring data has become an issue of widespread concern. In this paper, we discussed the fitting effect of the symmetrical high formwork monitoring data using the autoregressive–moving-average (ARMA) model and the back propagation neural networks (BPNN) combined model to process. In the actual project, the symmetry of the high formwork system allows the analysis of local monitoring results to be well extended to the whole. For the establishment of the ARMA model, the accurate judgment of the model order has a significant impact. In this paper, back propagation neural networks (BPNN) are used to simulate the ARMA process. The order of the ARMA model is estimated by determining the optimal neural network structure, which is suitable for linear or nonlinear sequences. We validated this approach from the ARMA model data simulated in Monte Carlo and compared it with the Akaike information criterion (AIC) and Bayesian information criterion (BIC). The length of the sequence, the coefficients and the order of the ARMA model are considered as factors that influence the judgment effect. Under different conditions, the BPNN always shows an accuracy rate of more than 90%, while the BIC only has a higher accuracy rate when the model order is low and the judgment efficiency of the AIC is below 50%. Finally, the proposed method successfully modeled the stress sequence and obtained the stress change trend. Compared with AIC and BIC, the efficiency of the processing time series is increased by about 50% when an order is obtained by BPNN.

Blockchain networks are based on cryptographic notions that include asymmetric-key encryption, hash functions and consensus protocols. Despite their popularity, mainstream protocols, such as Proof of Work or Proof of Stake still have drawbacks. Efforts to enhance these protocols led to the birth of alternative consensus protocols, catering to specific areas, such as medicine or transportation. These protocols remain relatively unknown despite having unique merits worth investigating. Although past reviews have been published on popular blockchain consensus protocols, they do not include most of these lesser-known protocols. Highlighting these alternative consensus protocols contributes toward the advancement of the state of the art, as they have design features that may be useful to academics, blockchain practitioners and researchers. In this paper, we bridge this gap by providing an overview of alternative consensus protocols proposed within the past 3 years. We evaluate their overall performance based on metrics such as throughput, scalability, security, energy consumption, and finality. In our review, we examine the trade-offs that these consensus protocols have made in their attempts to optimize scalability and performance. To the best of our knowledge, this is the first paper that focuses on these alternative protocols, highlighting their unique features that can be used to develop future consensus protocols.

Deepfake is one of the applications that is deemed harmful. Deepfakes are a sort of image or video manipulation in which a person’s image is changed or swapped with that of another person’s face using artificial neural networks. Deepfake manipulations may be done with a variety of techniques and applications. A quintessential countermeasure against deepfake or face manipulation is deepfake detection method. Most of the existing detection methods perform well under symmetric data distributions, but are still not robust to asymmetric datasets variations and novel deepfake/manipulation types. In this paper, for the identification of fake faces in videos, a new multistream deep learning algorithm is developed, where three streams are merged at the feature level using the fusion layer. After the fusion layer, the fully connected, Softmax, and classification layers are used to classify the data. The pre-trained VGG16 model is adopted for transferred CNN1stream. In transfer learning, the weights of the pre-trained CNN model are further used for training the new classification problem. In the second stream (transferred CNN2), the pre-trained VGG19 model is used. Whereas, in the third stream, the pre-trained ResNet18 model is considered. In this paper, a new large-scale dataset (i.e., World Politicians Deepfake Dataset (WPDD)) is introduced to improve deepfake detection systems. The dataset was created by downloading videos of 20 different politicians from YouTube. Over 320,000 frames were retrieved after dividing the downloaded movie into little sections and extracting the frames. Finally, various manipulations were performed to these frames, resulting in seven separate manipulation classes for men and women. In the experiments, three fake face detection scenarios are investigated. First, fake and real face discrimination is studied. Second, seven face manipulations are performed, including age, beard, face swap, glasses, hair color, hairstyle, smiling, and genuine face discrimination. Third, performance of deepfake detection system under novel type of face manipulation is analyzed. The proposed strategy outperforms the prior existing methods. The calculated performance metrics are over 99%.

DNA computers and quantum computers are gaining attention as alternatives to classical digital computers. DNA is a biological material that can be reprogrammed to perform computing functions. Quantum computing performs reversible computations by nature based on the laws of quantum mechanics. In this paper, DNA computing and reversible computing are combined to propose novel theoretical methods to implement reversible gates and circuits in DNA computers based on strand displacement reactions, since the advantages of reversible logic gates can be exploited to improve the capabilities and functionalities of DNA computers. This paper also proposes a novel universal reversible gate library (URGL) for synthesizing n-bit reversible circuits using DNA to reduce the average length and cost of the constructed circuits when compared with previous methods. Each n-bit URGL contains building blocks to generate all possible permutations of a symmetric group of degree n. Our proposed group (URGL) in the paper is a permutation group. The proposed implementation methods will improve the efficiency of DNA computer computations as the results of DNA implementations are better in terms of quantum cost, DNA cost, and circuit length.

Specific emitter identification involves extracting the fingerprint features that represent the individual differences of the emitter through processing the received signals. By identifying the extracted fingerprint features, one can also identify the emitter to which the received signals belong. Due to differences in transmitter hardware, this fingerprint cannot be duplicated. Therefore, SEI plays an important role in the field of information security and can reduce the information leakages caused by key theft. This method can also be used in the military field to support communication countermeasures via emitter individual identification. In this paper, empirical mode decomposition is carried out for each radar pulse signal, and then the bispectral features are extracted. Dimensionality reduction is carried out according to the symmetry of the bispectral features. The features after dimensionality reduction are input into a one-dimensional LeNet neural network as the fingerprint features of the emitter, and the identification of 10 radar emitter sources is completed. Based on the verification of real signals, the SEI identification strategy in this paper achieved a recognition rate of 96.4% for 10 radar signals, 98.9% for 10 data emitter signals, and 88.93% for 5 communication radio signals.

This paper deals with the flow shop scheduling problem. To find the optimal solution is an NP-hard problem. The paper reviews some algorithms from the literature and applies a benchmark dataset to evaluate their efficiency. In this research work, the discrete bacterial memetic evolutionary algorithm (DBMEA) as a global searcher was investigated. The proposed algorithm improves the local search by applying the simulated annealing algorithm (SA). This paper presents the experimental results of solving the no-idle flow shop scheduling problem. To compare the proposed algorithm with other researchers’ work, a benchmark problem set was used. The calculated makespan times were compared against the best-known solutions in the literature. The proposed hybrid algorithm has provided better results than methods using genetic algorithm variants, thus it is a major improvement for the memetic algorithm family solving production scheduling problems.

Forward error correction codes (FEC) are one of the vital sections of modern communication systems, therefore, recognition of the coding type is an important issue in non-cooperative communication. At present, the recognition of FEC codes is mainly concentrated in the field of semi-blind identification with known types of codes. However, based on information asymmetry, the receiver cannot know the types of channel coding previously used in non-cooperative systems such as cognitive radio and remote sensing of communication. Therefore, it is important to recognize the error-correcting encoding type with no prior information. Although the traditional algorithm can also recognize the type of codes, it is only applicable to the case without errors, and its practicability is poor. In the paper, we propose a new method to identify the types of FEC codes based on depth distribution in non-cooperative communication. The proposed algorithm can effectively recognize linear block codes, convolutional codes, and Turbo codes under a low error probability level, and has a higher robustness to noise transmission environment. In addition, an improved matrix estimation algorithm based on Gaussian elimination was adopted in this paper, which effectively improves the parameter identification in a noisy environment. Finally, we used a general framework to unify all the reconstruction algorithms to simplify the complexity of the algorithm. The simulation results show that, compared with the traditional algorithm based on matrix rank, the proposed algorithm has a better anti-interference performance. The method proposed is simple and convenient for engineering and practical applications.

In this paper, we develop two algorithms to solve a nonlinear system of symmetric equations. The first is an algorithm based on modifying two Broyden–Fletcher–Goldfarb–Shanno (BFGS) methods. One of its advantages is that it is more suitable to effectively solve a small-scale system of nonlinear symmetric equations. In contrast, the second algorithm chooses new search directions by incorporating an approximation method of computing the gradients and their difference into the determination of search directions in the first algorithm. In essence, the second one can be viewed as an extension of the conjugate gradient method recently proposed by Lv et al. for solving unconstrained optimization problems. It was proved that these search directions are sufficiently descending for the approximate residual square of the equations, independent of the used line search rules. Global convergence of the two algorithms is established under mild assumptions. To test the algorithms, they are used to solve a number of benchmark test problems. Numerical results indicate that the developed algorithms in this paper outperform the other similar algorithms available in the literature.

Text, voice, images and videos can express some intentions and facts in daily life. By understanding these contents, people can identify and analyze some behaviors. This paper focuses on the commodity trade declaration process and identifies the commodity categories based on text information on customs declarations. Although the technology of text recognition is mature in many application fields, there are few studies on the classification and recognition of customs declaration goods. In this paper, we proposed a classification framework based on machine learning (ML) models for commodity trade declaration that reaches a high rate of accuracy. This paper also proposed a symmetrical decision fusion method for this task based on convolutional neural network (CNN) and transformer. The experimental results show that the fusion model can make up for the shortcomings of the two original models and some improvements have been made. In the two datasets used in this paper, the accuracy can reach 88% and 99%, respectively. To promote the development of study of customs declaration business and Chinese text recognition, we also exposed the proprietary datasets used in this study.

As a further extension of the fuzzy set and the intuitive fuzzy set, the interval-valued intuitive fuzzy set (IIFS) is a more effective tool to deal with uncertain problems. However, the classical rough set is based on the equivalence relation, which do not apply to the IIFS. In this paper, we combine the IIFS with the ordered information system to obtain the interval-valued intuitive fuzzy ordered information system (IIFOIS). On this basis, three types of multiple granulation rough set models based on the dominance relation are established to effectively overcome the limitation mentioned above, which belongs to the interdisciplinary subject of information theory in mathematics and pattern recognition. First, for an IIFOIS, we put forward a multiple granulation rough set (MGRS) model from two completely symmetry positions, which are optimistic and pessimistic, respectively. Furthermore, we discuss the approximation representation and a few essential characteristics for the target concept, besides several significant rough measures about two kinds of MGRS symmetry models are discussed. Furthermore, a more general MGRS model named the generalized MGRS (GMGRS) model is proposed in an IIFOIS, and some important properties and rough measures are also investigated. Finally, the relationships and differences between the single granulation rough set and the three types of MGRS are discussed carefully by comparing the rough measures between them in an IIFOIS. In order to better utilize the theory to realistic problems, an actual case shows the methods of MGRS models in an IIFOIS is given in this paper.

Cross-efficiency evaluation effectively distinguishes a set of decision-making units (DMUs) via self- and peer-evaluations. In constant returns to scale, this evaluation technique is usually applied for data envelopment analysis (DEA) models because negative efficiencies will not occur in this case. For situations of variable returns to scale, the negative cross-efficiencies may occur in this evaluation method. In the real world, the observations could be uncertain and difficult to measure precisely. The existing fuzzy cross-evaluation methods are restricted to production technologies with constant returns to scale. Generally, symmetry is a fundamental characteristic of binary relations used when modeling optimization problems. Additionally, the notion of symmetry appeared in many studies about uncertain theories employed in DEA problems, and this approach can be considered an engineering tool for supporting decision-making. This paper proposes a fuzzy cross-efficiency evaluation model with fuzzy observations under variable returns to scale. Since all possible weights of all DMUs are considered, a choice of weights is not required. Most importantly, negative cross-efficiencies are not produced. An example shows that this paper’s fuzzy cross-efficiency evaluation method has discriminative power in ranking the DMUs when observations are fuzzy numbers.

Automatic segmentation of the lungs in Chest X-ray images (CXRs) is a key step in the screening and diagnosis of related diseases. There are many opacities in the lungs in the CXRs of patients, which makes the lungs difficult to segment. In order to solve this problem, this paper proposes a segmentation algorithm based on U-Net. This article introduces variational auto-encoder (VAE) in each layer of the decoder-encoder. VAE can extract high-level semantic information, such as the symmetrical relationship between the left and right thoraxes in most cases. The fusion of the features of VAE and the features of convolution can improve the ability of the network to extract features. This paper proposes a three-terminal attention mechanism. The attention mechanism uses the channel and spatial attention module to automatically highlight the target area and improve the performance of lung segmentation. At the same time, the three-terminal attention mechanism uses the advanced semantics of high-scale features to improve the positioning and recognition capabilities of the attention mechanism, suppress background noise, and highlight target features. Experimental results on two different datasets show that the accuracy (ACC), recall (R), F1-Score and Jaccard values of the algorithm proposed in this paper are the highest on the two datasets, indicating that the algorithm in this paper is better than other state-of-the-art algorithms.

The real world can be characterized as a complex network sto in symmetric matrix. Community discovery (or community detection) can effectively reveal the common features of network groups. The communities are overlapping since, in fact, one thing often belongs to multiple categories. Hence, overlapping community discovery has become a new research hotspot. Since the results of the existing community discovery algorithms are not robust enough, this paper proposes an effective algorithm, named Two Expansions of Seeds (TES). TES adopts the topological feature of network nodes to find the local maximum nodes as the seeds which are based on the gravitational degree, which makes the community discovery robust. Then, the seeds are expanded by the greedy strategy based on the fitness function, and the community cleaning strategy is employed to avoid the nodes with negative fitness so as to improve the accuracy of community discovery. After that, the gravitational degree is used to expand the communities for the second time. Thus, all nodes in the network belong to at least one community. Finally, we calculate the distance between the communities and merge similar communities to obtain a less- undant community structure. Experimental results demonstrate that our algorithm outperforms other state-of-the-art algorithms.

Smart Home Architecture is suitable for progressive and symmetric urbanization. Data being generated in smart home appliances using internet of things should be stored in cloud where computing resources can analyze the data and generate the decisive pattern within no time. This additional requirement of storage, majorly, comprising of unfiltered data escalates requirement of host machines which carries with itself extra overhead of energy consumption; thus, extra cost has to be beard by service providers. Various static algorithms are already proposed to improve energy management of cloud data centers by reducing number of active bins. These algorithms are not able to cater to the needs of present heterogeneous requests generated in cloud machines by people of diversified work environment with adhering to the requirements of quality parameters. Therefore, the paper has proposed and implemented dynamic bin-packing approaches for smart architecture that can significantly reduce energy consumption without compromising upon makespan, resource utilization and Quality of Service (QoS) parameters. The novelty of the proposed dynamic approaches in comparison to the existing static approaches is that the proposed approach dynamically creates and dissolves virtual machines as per incoming and completed requests which is a dire need of present computing paradigms via attachment of time-frame with each virtual machine. The simulations have been performed on JAVA platform and dynamic energy utilized-best fit decreasing bin packing technique has produced better results in maximum runs.

This article introduces a wall-climbing robot that uses the reverse thrust of the propeller as the adsorption force. The robot is symmetrically distributed in structure and the adsorption force is symmetrically distributed before and after so that it can adapt to the surface of a variety of different media materials and achieve stable adsorption and movement of a variety of wall surfaces. The robot mainly uses the reverse thrust of the aircraft propeller as the adsorption force to achieve wall adsorption. The robot relies on four wheels to move forward. The forward power mainly comes from the combined action of the propeller reverse thrust component and the front wheel driving force. During the movement of the robot, the steering is realized by the front wheel differential control. In this paper, we design the structure of a dual-propeller dynamic adsorption wall mobile robot, plan the movement process of the robot from the ground to the wall, analyze the stable adsorption conditions of the robot wall, and carry out the robot’s motion performance and adaptability test under different ground/wall environments to verify that the robot is stable and feasible.