Search

Mobile edge computing (MEC) is receiving more attention than centralized cloud computing due to the massive increase in transmission and compute requirements in 5G vehicle networks. It offers a significant amount of processing and storage resources to the edge of networks, offloading applications from vehicle terminals that are computation-intensive and delay-sensitive. For devices with limited resources, it uses edge resources to provide computationally heavy operations while conserving energy. This paper proposes a novel approach for computing offloading in MEC. To effectively optimize the MEC resources, this paper proposes a novel algorithm. First, the joint optimization and service cache decision subproblems were determined from continuous and discrete variables. Then, the near-optimal solution is determined from the subproblems through convex optimization and Karush–Kuhn–Tucker method. Simulation results show that the proposed algorithm has better computational offloading and resource allocation performance as compared to existing algorithms. [ABSTRACT FROM AUTHOR]

Stimuli from the road surface cause car vibrations. The suspension system ensures the vehicle's stability and smoothness when moving. In this research, the author introduces the use of active suspension with a hydraulic actuator to improve the comfort of cars. Car oscillations are described based on a quarter-dynamics model with five state variables. Besides, the nonlinear system's SM (sliding mode) control algorithm is used to control the system. The SM algorithm's parameters are optimally selected using the multiple loop algorithm. The multiple loop algorithm allows the values to vary within a predefined limit and provides an optimal parameter based on the vehicle's vibration conditions. This is a new point in the paper compared to previous studies. The output of the simulation problem includes displacements and accelerations of both the sprung and unsprung masses. In addition, the change of dynamics force at the wheel is also considered when evaluating the interaction between the wheel and the road surface. According to the paper's results, the vehicle body's acceleration and displacement values are strongly reduced when using the SM algorithm, compared with cars with only traditional suspension. In addition, the change in dynamics force at the wheel is not significant when using this algorithm. As a result, the car's smoothness has been improved while the vehicle's stability has not been lost. The phenomenon of "chattering" still occurs in some cases; however, its effect is negligible. [ABSTRACT FROM AUTHOR]

Sequential recommendation algorithm can predict the next action of a user by modeling the user's interaction sequence with an item. However, most sequential recommendation models only consider the absolute positions of items in the sequence, ignoring the time interval information between items, and cannot effectively mine user preference changes. In addition, existing models perform poorly on sparse data sets, which make a poor prediction effect for short sequences. To address the above problems, an improved sequential recommendation algorithm based on short-sequence enhancement and temporal self-attention mechanism is proposed in this paper. In the proposed algorithm, a backward prediction model is trained first, to predict the prior items in the user sequence. Then, the reverse prediction model is used to generate a batch of pseudo-historical items before the initial items of the short sequence, to achieve the goal of enhancing the short sequence. Finally, the absolute position information and time interval information of the user sequence are modeled, and a time-aware self-attention model is adopted to predict the user's next action and generate a recommendation list. Various experiments are conducted on two public data sets. The experimental results show that the method proposed in this paper has excellent performance on both dense and sparse data sets, and its effect is better than that of the state of the art. [ABSTRACT FROM AUTHOR]

Swarm intelligence algorithms are metaheuristics inspired by the collective behavior of species such as birds, fish, bees, and ants. They are used in many optimization problems due to their simplicity, flexibility, and scalability. These algorithms get the desired convergence during the search by balancing the exploration and exploitation processes. These metaheuristics have applications in various domains such as global optimization, bioinformatics, power engineering, networking, machine learning, image processing, and environmental applications. This paper presents a systematic literature review (SLR) on applications of four swarm intelligence algorithms i.e., grey wolf optimization (GWO), whale optimization algorithms (WOA), Harris hawks optimizer (HHO), and moth-flame optimizer (MFO) in the field of software engineering. It presents an in-depth study of these metaheuristics' adoption in the field of software engineering. This SLR is mainly comprised of three phases such as planning, conducting, and reporting. This study covers all related studies published from 2014 up to 2022. The study shows that applications of the selected metaheuristics have been utilized in various fields of software engineering especially software testing, software defect prediction, and software reliability. The study also points out some of the areas where applications of these swarm intelligence algorithms can be utilized. This study may act as a guideline for researchers in improving the current state-of-the-art on generally adopting these metaheuristics in software engineering. [ABSTRACT FROM AUTHOR]

In the Internet age, information security is threatened anytime and anywhere and the copyright protection of audio and video as well as the need for matching detection is increasingly strong. In view of this need, this paper proposes a zero-watermarking algorithm for audio and video matching based on NSCT. The algorithm uses NSCT, DCT, SVD, and Schur decomposition to extract video features and audio features and generates zero-watermark stream through synthesis, which is stored in a third-party organization for detection and identification. The detection algorithm can obtain zero watermark from the audio and video to be tested and judge and locate tampering by comparing with the zero watermark of the third party. From the experimental results, this algorithm can not only detect whether the audio and video are mismatched due to tampering attacks but also locate the mismatched audio and video segments and protect the copyright. [ABSTRACT FROM AUTHOR]

Evaluating scientific articles has always been a challenging task, made even more difficult by the constantly evolving citation networks. Despite numerous attempts at solving this problem, most existing approaches fail to consider the link relationships within the citation network, which can often result in biased evaluation results. To overcome this limitation, we present an optimization ranking algorithm that leverages the P-Rank algorithm and weighted citation networks to provide a more accurate article ranking. The proposed approach employs two hyperbolic tangent functions to calculate the corresponding age of articles and the number of citations, while also updating the link relationships of each paper node in the citation network. We validate the effectiveness of the proposed approach using three evaluation indicators and conduct experiments on three public datasets. The obtained experimental results demonstrate that the optimization article ranking method can achieve competitive performance when compared to other unweighted ranking algorithms. In addition, we note that the optimal Spearman's rank correlation and robustness can all be achieved by using a combination of the following parameters: α = 10 , β = 5 , and γ = 2. [ABSTRACT FROM AUTHOR]

This paper introduces a novel method to control the operation of the active suspension system. In this research, a quarter-dynamic model is used to simulate the vehicle's vibrations. Besides, the sliding mode-PID-integrated algorithm with five state variables is proposed to be used. This is a completely original and novel algorithm. The process of establishing the control algorithm is clearly described. The simulation is performed by the MATLAB software. The results of the paper have shown the advantages of the sliding mode-PID algorithm used in this research. Accordingly, the displacement and acceleration of the sprung mass were significantly reduced when this algorithm was used. The maximum and average values of the displacement of the sprung mass are only 1.31% and 1.29%, respectively, compared with the situation of the vehicle using a passive suspension. Similarly, the value of the acceleration is 6.98% and 2.94%, respectively. In addition, the phenomenon of "chattering" has also been significantly reduced when using this controller. In the future, some more complex algorithms can be proposed. [ABSTRACT FROM AUTHOR]

This paper investigates the control problem of the buoyancy regulation system for autonomous underwater vehicle (AUV). There are some problems to be considered in the oil-water conversion-based buoyancy regulation system, including the external seawater pressure, the pressure fluctuations, and the slow switching speed of the ball valve. The control accuracy of the buoyancy regulation under the traditional PID controller cannot meet the requirements of the project. In this paper, a fuzzy sliding mode control scheme is developed for the buoyancy regulation system to solve the abovementioned problems. At first, a mathematical model of the buoyancy regulation system is established, and the stability of the system is analyzed. Then, the sliding mode control algorithm is combined with the fuzzy system to improve the control accuracy. Finally, the pool-experiment results on a prototype show that the developed control scheme can meet the requirements of the control accuracy for the buoyancy regulation system. [ABSTRACT FROM AUTHOR]

The self-organizing model and expectation-maximization method are two traditional identification methods for switching models. They interactively update the parameters and model identities based on offline algorithms. In this paper, we propose a flexible recursive least squares algorithm which constructs the cost function based on two kinds of errors: the neighboring two-parameter estimation errors and the output estimation errors. Such an algorithm has several advantages over the two traditional identification algorithms: it (1) can estimate the parameters of all the sub-models without prior knowledge of the model identities; (2) has less computational efforts; and (3) can update the parameters with newly arrived data. The convergence properties and simulation examples are provided to illustrate the efficiency of the algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a hyperchaos-based image encryption algorithm, which consists of two scrambling-diffusion operations and one scrambling operation. In the proposed algorithm, the initial conditions of a hyperchaotic Chen system are first generated using the Message Digest 5 (MD5) value of digital images and given initial values, and then the images will be encrypted using the keystream created by the system. Since the initial values of hyperchaotic Chen systems are related to plaintext and the encryption process is related to the images, this algorithm is able to effectively protect images against selective plaintext attacks. Simulation results demonstrate that the present algorithm offers enhanced encryption performance, high security, and strong resistance to known attacks. Therefore, it may find wide application in image encryption transmission. Compared to other image encryption algorithms, the proposed algorithm uses different keystreams when encrypting different images and is capable of effectively resisting various plain image and differential attacks faster. [ABSTRACT FROM AUTHOR]

In order to improve the effect of athlete's injury recognition and rehabilitation evaluation, this paper studies the traditional rehabilitation evaluation method and proposes a new athlete rehabilitation evaluation system combining the Internet of Health Things technology and human gait analysis algorithm. Moreover, this paper combines sports characteristics to improve the algorithm of human gait analysis. In addition, through the study of the athlete's human body modeling and movement process, a human gait analysis algorithm that can be applied to multiple sports is proposed, and the gait parameter analysis and algorithm reliability research are carried out through simulation analysis. After confirming that the algorithm is effective, this paper combines the Internet of Health Things technology to construct a system model, obtains the system function module architecture with the support of the Internet of Health Things technology, and conducts experiments to verify the system performance. From the experimental research, it can be seen that the model constructed in this paper meets the theoretical and practical needs, and the system in this paper can be applied to practice in the future. The human gait recognition algorithm constructed in this article has a good effect and can play an important role in sports rehabilitation of athletes. At the same time, the system constructed in this article has certain advantages over traditional sports rehabilitation systems with the support of algorithms. [ABSTRACT FROM AUTHOR]

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time-consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small-size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group-based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time. [ABSTRACT FROM AUTHOR]

Automatic Generation Control (AGC) in modern power systems is getting complex, due to intermittency in the output power of multiple sources along with considerable digressions in the loads and system parameters. To address this problem, this paper proposes an approach to calculate Power System Restoration Indices (PSRI) of a 2-area thermal-hydro restructured power system. This study also highlights the necessary ancillary service requirements for the system under a deregulated environment to cater to large-scale power failures and entire system outages. An abrupt change in consumer load demands and disturbances in any control region (area) of a multiarea (interrelated) system causes severe fluctuations in frequency and interarea power exchanges. However, simple Proportional and Integral (PI) controllers are most prevalent in the literature to effectively resolve AGC issues, while its integral gain is smaller due to the larger overshoot in transient performance. Therefore, an attempt has been made with a novel control strategy, known as the pseudoderivative feedforward with feedback (PDFF) controller, is developed to keep the interarea power exchanges and the frequency to the specified limits after load changes. A PDFF controller is designed and implemented using the flower pollination algorithm (FPA) to obtain optimal dynamic performance for different types of potential power flows in a restructured power system under investigation. The proposed PDFF controller localizes the zero at an optimal place that reduces the rise time of the step-response to reduce the excessive overshoot and gives much better dynamic performances as compared to the PI control structure. The Integral Square Error (ISE) is considered as a performance criterion to derive the optimized gain of the PDFF control structure using FPA. Different PSRI are computed based on the transient response of the 2-area deregulated multisource system and different restoration measures to be taken are also discussed. The simulation results clearly show that the proposed approach is very powerful in decreasing the frequency and tie-power digressions under different load perturbations. [ABSTRACT FROM AUTHOR]

In this paper, a mathematical model for large deformation of a cantilever beam subjected to tip-concentrated load is presented. The model is governed by nonlinear differential equations. Large deformation of a cantilever beam has number of applications is structural engineering. Since finding an exact solution to such nonlinear models is difficult task, this paper focuses on developing soft computing technique based on artificial neural networks (ANNs), generalized normal distribution optimization (GNDO) algorithm, and sequential quadratic programming (SQP). The strength of ANN modeling for governing the equation of cantilever beam is exploited by the global search ability of GNDO and further explored by the local search mechanism of SQP. Design scheme is evaluated for different cases depending on variations in dimensionless end-point load ρ . Furthermore, to validate the effectiveness and convergence of algorithm proposed technique, the results of the differential transformation method (DTM) and exact solutions are compared. The statistical analysis of performance indicators in terms of mean, median, and standard deviations further establishes the worth of ANN-GNDO-SQP algorithm. [ABSTRACT FROM AUTHOR]

Microexpressions have extremely high due value in national security, public safety, medical, and other fields. However, microexpressions have characteristics that are obviously different from macroexpressions, such as short duration and weak changes, which greatly increase the difficulty of microexpression recognition work. In this paper, we propose a microexpression recognition method based on multimodal fusion through a comparative study of traditional microexpression recognition algorithms such as LBP algorithm and CNN and LSTM deep learning algorithms. The method couples the separate microexpression image information with the corresponding body temperature information to establish a multimodal fusion microexpression database. This paper firstly introduces how to build a multimodal fusion microexpression database in a laboratory environment, secondly compares the recognition accuracy of LBP, LSTM, and CNN + LSTM networks for microexpressions, and finally selects the superior CNN + LSTM network in the comparison results for model training and testing on the test set under separate microexpression database and multimodal fusion database. The experimental results show that a microexpression recognition method based on multimodal fusion designed in this paper is more accurate than unimodal recognition in multimodal recognition after feature fusion, and its recognition rate reaches 75.1%, which proves that the method is feasible and effective in improving microexpression recognition rate and has good practical value. [ABSTRACT FROM AUTHOR]

This paper introduces a job-shop scheduling problem (JSP) with bidirectional circular precedence constraints, called BCJSP. In the problem, each job can be started from any operation and continued by its remaining operations in a circular precedence-relation chain via either a clockwise or counterclockwise direction. To solve BCJSP, this paper proposes a multilevel metaheuristic consisting of top-, middle-, and bottom-level algorithms. The top- and middle-level algorithms are population-based metaheuristics, while the bottom-level algorithm is a local search algorithm. The top-level algorithm basically controls a start operation and an operation-precedence-relation direction of each job, so that BCJSP becomes a JSP instance that is a subproblem of BCJSP. Moreover, the top-level algorithm can also be used to control input parameters of the middle-level algorithm, as an optional extra function. The middle-level algorithm controls input parameters of the bottom-level algorithm, and the bottom-level algorithm then solves the BCJSP's subproblem. The middle-level algorithm evolves the bottom-level algorithm's parameter values by using feedback from the bottom-level algorithm. Likewise, the top-level algorithm evolves the start operations, the operation-precedence-relation directions, and the middle-level algorithm's parameter values by using feedback from the middle-level algorithm. Performance of two variants of the multilevel metaheuristic (i.e., with and without the mentioned extra function) was evaluated on BCJSP instances modified from well-known JSP instances. The variant with the extra function performs significantly better in number than the other. The existing JSP-solving algorithms can also solve BCJSP; however, their results on BCJSP are clearly worse than those of the two variants of the multilevel metaheuristic. [ABSTRACT FROM AUTHOR]

To facilitate the performance of the active suspension system, the optimization of a new reaching law of the active suspension sliding mode controller based on cuckoo algorithm is addressed in this paper. Firstly, a linear model of the active suspension system is built. Then, according to the features of the new exponential reaching law, an active sliding mode control scheme based on the new sliding mode reaching law is designed. Finally, the simulation results are separated into two stages to verify the suitability and superiority of the proposed control scenario. [ABSTRACT FROM AUTHOR]

Practical applications of microaerial vehicle face significant challenges including imprecise localization, limited on-board energy, and motion uncertainty. This paper focuses on the latter two issues. The core of proposed energy-optimal path planning algorithm is an energy consumption model deriving from real measurements of a specific quadrotor and utilizing a 2D Gaussian distribution function to simulate the uncertainty of random drift. Based on these two models, we formulate the optimal path traversing the 3D map with minimum energy consumption using a heuristic ant colony optimization. Multiple sets of contrast experiments demonstrate the effectiveness and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we study the path based continuous spatial keyword queries, which find the answer set continuously when the query point moves on a given path. Under this setting, we explore two primitive spatial keyword queries, namely k nearest neighbor query and range query. The technical challenges lie in that: (1) retrieving qualified vertices in large road networks efficiently, and (2) issuing the query continuously for points on the path, which turns out to be inapplicable. To overcome the above challenges, we first propose a backbone road network index structure (BNI), which supports the distance computation efficiently and offers a global insights of the whole road network. Motivated by the safe zone technique, we then transform our queries to the issue of finding event points, which capture the changes of answer set. By this transformation, our queries are to be simple and feasible. To answer the queries, we propose a Two-Phase Progressive (TPP) computing framework, which first computes the answer sets for some crucial vertices on the path, and then identifies the event points by the retrieved answer sets. Extensive experiments on both real and synthetic data sets are conducted to evaluate the performance of our proposed algorithms, and the results show that our algorithms outperform competitors by several orders of magnitude. [ABSTRACT FROM AUTHOR]

This study introduces the enhanced dynamic network DEA, an innovative algorithmic extension of the foundational data envelopment analysis (DEA), to assess the sustainable development efficiency of Jiangxi Province's "Internet Plus Logistics" sector from 2002 to 2016. This methodology leverages a comprehensive evaluation indicator system, emphasizing waterway, highway, and railway logistics outputs. The integration of custom algorithms into the CCR and BCC models has provided a deeper insight into efficiency trends and highlighted the need for a shift to an intensive economic model. Key findings pinpoint specific inefficiencies and their causes, emphasizing the value of our method in offering precise insights. Ultimately, this research not only advances the DEA methodological landscape but also offers strategic directions for sustainable development in "Internet Plus Logistics." [ABSTRACT FROM AUTHOR]

In practical application studies of glider formations, ocean currents are a major influencing factor in their path planning. The purpose of this paper is to solve the path planning problem of glider formations in time-varying ocean currents and establish gliders, glider formation, and ocean current models based on existing data. The Doc-CNN architecture is tailored to conform to the operation and environment characteristics of gliders in practical application. After experiments, the algorithm of the improved architecture can be used in the path planning task of glider formation. The algorithm architecture is compared and tested on two datasets, grid maps and ocean maps. Doc-CNN has an advantage over architecture without being tailored to glider characteristics and makes full use of known global information and local information collected by gliders themselves. The results show that the path planning problem of glider formation in ocean currents can be solved by using Doc-CNN. [ABSTRACT FROM AUTHOR]

This paper considers two kinds of stochastic reentrant job shop scheduling problems (SRJSSP), i.e., the SRJSSP with the maximum tardiness criterion and the SRJSSP with the makespan criterion. Owing to the NP-complete complexity of the considered RJSSPs, an effective differential evolutionary algorithm (DEA) combined with two uncertainty handling techniques, namely, DEA_UHT, is proposed to address these problems. Firstly, to reasonably control the computation cost, the optimal computing budget allocation technique (OCBAT) is applied for allocating limited computation budgets to assure reliable evaluation and identification for excellent solutions or individuals, and the hypothesis test technique (HTT) is added to execute a statistical comparison to reduce some unnecessary repeated evaluation. Secondly, a reentrant-largest-order-value rule is designed to convert the DEA's individual (i.e., a continuous vector) to the SRJSSP's solution (i.e., an operation permutation). Thirdly, a conventional active decoding scheme for the job shop scheduling problem is extended to decode the solution for obtaining the criterion value. Fourthly, an Insert-based exploitation strategy and an Interchange-based exploration strategy are devised to enhance DEA's exploitation ability and exploration ability, respectively. Finally, the test results and comparisons manifest the effectiveness and robustness of the proposed DEA_UHT. [ABSTRACT FROM AUTHOR]

With the development of the Internet, the amount of information present on the network has grown rapidly, leading to increased difficulty in obtaining effective information. Especially for individuals, enterprises, and institutions with a large amount of information, it is an almost impossible task to integrate and analyze Internet information with great difficulty just by human resources. Internet hot events mining and analysis technology can effectively solve the above problems by alleviating information overload, integrating redundant information, and refining core information. In this paper, we address the above problems and research hot event topic sentence generation techniques in the field of hot event mining and design a hybrid event candidate set construction algorithm based on topic core word mapping and event triad selection. The algorithm uses the PAT-Tree technique to extract high-frequency core words in topic hotspots and maps the high-frequency words into sentences to generate a part of event core sentences. The other part of event core sentences is extracted from the topic hotspots by making event triples as candidate elements, and sentences containing event elements are extracted from the topic hotspots. The sets of event core sentences generated by the two methods are mixed and filtered and sorted to obtain the candidate set, which can be used to build a word graph-based main service channel (MSC) model. In this paper, we also propose an improved word graph-based MSC model and use it for the extraction of event topic sentences. Based on the above research, a hot event analysis system is implemented. The system analyzes the existing topic data and uses the event topic sentence generation algorithm studied in this paper to generate the titles of hot spots, that is, hot events. At the same time, the topics are displayed from different dimensions, and data visualization is completed. The visualization includes the trend change of event hotness, trend change of event sentiment polarity, and distribution of event article sources. [ABSTRACT FROM AUTHOR]

With the rapid development of science and technology, UAVs (Unmanned Aerial Vehicles) have become a new type of weapon in the informatization battlefield by their advantages of low loss and zero casualty rate. In recent years, UAV navigation electromagnetic decoy and electromagnetic interference crashes have activated widespread international attention. The UAV LiDAR detection system is susceptible to electromagnetic interference in a complex electromagnetic environment, which results in inaccurate detection and causes the mission to fail. Therefore, it is very necessary to predict the effects of the electromagnetic environment. Traditional electromagnetic environment effect prediction methods mostly use a single model of mathematical model and machine learning, but the traditional prediction method has poor processing nonlinear ability and weak generalization ability. Therefore, this paper uses the Stacking fusion model algorithm in machine learning to study the electromagnetic environment effect prediction. This paper proposes a Stacking fusion model based on machine learning to predict electromagnetic environment effects. The method consists of Extreme Gradient Boosting algorithm (XGB), Gradient Boosting Decision Tree algorithm (GBDT), K Nearest Neighbor algorithm (KNN), and Decision Tree algorithm (DT). Experimental results show that, comprising with the other seven machine learning algorithms, the Stacking fusion model has a better classification prediction accuracy of 0.9762, a lower Hamming code distance of 0.0336, and a higher Kappa coefficient of 0.955. The fusion model proposed in this paper has a better predictive effect on electromagnetic environment effects and is of great significance for improving the accuracy and safety of UAV LiDAR detection systems under the complex electromagnetic environment on the battlefield. [ABSTRACT FROM AUTHOR]

As the Internet of Things (IoT) smart mobile devices explode in complex opportunistic social networks, the amount of data in complex networks is increasing. Large amounts of data cause high latency, high energy consumption, and low-reliability issues when dealing with computationally intensive and latency-sensitive emerging mobile applications. Therefore, we propose a task-sharing strategy that comprehensively considers delay, energy consumption, and terminal reputation value (DERV) for this context. The model consists of a task-sharing decision model that integrates latency and energy consumption, and a reputation value-based model for the allocation of the computational resource game. The two submodels apply an improved particle swarm algorithm and a Lagrange multiplier, respectively. Mobile nodes in the complex social network are given the opportunity to make decisions so that they can choose to share computationally intensive, latency-sensitive computing tasks to base stations with greater computing power in the same network. At the same time, to prevent malicious competition from end nodes, the base station decides the allocation of computing resources based on a database of reputation values provided by a trusted authority. The simulation results show that the proposed strategy can meet the service requirements of low delay, low power consumption, and high reliability for emerging intelligent applications. It effectively realizes the overall optimized allocation of computation sharing resources and promotes the stable transmission of massive data in complex networks. [ABSTRACT FROM AUTHOR]

In this paper, we adapt the fractional derivative approach to formulate the flow-conservation transportation networks, which consider the propagation dynamics and the users' behaviors in terms of route choices. We then investigate the controllability of the fractional-order transportation networks by employing the Popov-Belevitch-Hautus rank condition and the QR decomposition algorithm. Furthermore, we provide the exact solutions for the full controllability pricing controller location problem, which includes where to locate the controllers and how many controllers are required at the location positions. Finally, we illustrate two numerical examples to validate the theoretical analysis. [ABSTRACT FROM AUTHOR]

Distinguishing target object under occlusions has become the forefront of research to cope with grasping study in general. In this paper, a novel framework which is able to be utilized for a parallel robotic gripper is proposed. There are two key steps for the proposed method in the process of grasping occluded object: generating template information and grasp detection using the matching algorithm. A neural network, trained by the RGB-D data from the Cornell Grasp Dataset, predicts multiple grasp rectangles on template images. A proposed matching algorithm is utilized to eliminate the influence caused by occluded parts on scene images and generates multiple grasp rectangles for objects under occlusions using the grasp information of matched template images. In order to improve the quality of matching result, the proposed matching algorithm improves the SIFT algorithm and combines it with the improved RANSAC algorithm. In this way, this paper obtains suitable grasp rectangles on scene images and offers a new thought about grasping detection under occlusions. The validation results show the effectiveness and efficiency of this approach. [ABSTRACT FROM AUTHOR]

In this paper, a new method of reactive power compensation is proposed for reducing power loss of distribution power networks. The new method is the combination of local compensation at each load and distribution line compensation. In the method, local capacitors at each load are determined to increase power factor of load to an expected value first and then a number of capacitors are placed in distribution lines with two factors, location and capacity by using the three applied methods. Particle swarm optimization (PSO), parasitism predation algorithm (PPA), and tunicate swarm algorithm (TSA) are applied for the proposed method on four distribution systems with 15, 33, 69, and 85 buses. The comparisons of results with previous methods indicate that the three applied methods can reach higher loss reduction for all study cases. TSA can reach loss reduction more effectively than others by 19.4%, 0.5%, 7.9%, and 10.76% for the four distribution systems, respectively. The most important emphasis is that PSO, which was considered to be of low effectiveness in previous studies, can reach much better loss than approximately all previous methods thank to the proposed compensation method. PSO also reached better loss reduction than others by 18.97%, 0.4%, 7.73%, and 10.21%, respectively. Consequently, it is recommended that the proposed compensation method is useful for distribution systems in minimizing total power loss and TSA can be selected a new and powerful method for the problem. [ABSTRACT FROM AUTHOR]

circRNA is a novel class of noncoding RNA with closed-loop structure. Increasing biological experiments have shown that circRNAs play an important role in many diseases by acting as a miRNA sponge to indirectly regulate the expression of miRNA target genes. Therefore, predicting associations between circRNAs and miRNAs can promote the understanding of pathogenesis of disease. In this paper, we propose a new computational method, NECMA, based on network embedding to predict potential associations between circRNAs and miRNAs. In our method, the Gaussian interaction profile (GIP) kernel similarities of circRNA and miRNA are calculated based on the known circRNA-miRNA associations, respectively. Then, the circRNA-miRNA association network, circRNA GIP kernel similarity network, and miRNA GIP kernel similarity network are utilized to construct the heterogeneous network. Furthermore, the network embedding algorithm is used to extract potential features of circRNA and miRNA from the heterogeneous network, respectively. Finally, the associations between circRNAs and miRNAs are predicted by using neighborhood regularization logic matrix decomposition and inner product. The performance of NECMA is evaluated by using ten-fold cross-validation. The results show that this method has better prediction accuracy than other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Precise inventory prediction is the key to goods inventory and safety management. Accurate inventory prediction improves enterprises' production efficiency. It is also essential to control costs and optimize the supply chain's performance. Nevertheless, the complex inventory data are often chaotic and nonlinear; high data complexity raises the accuracy prediction difficulty. This study simulated inventory records by using the dynamics inventory management system. Four deep neural network models trained the data: short-term memory neural network (LSTM), convolutional neural network-long short-term memory (CNN-LSTM), bidirectional long short-term memory neural network (Bi-LSTM), and deep long-short-term memory neural network (DLSTM). Evaluating the models' performance based on RMSE, MSE, and MAE, bi-LSTM achieved the highest prediction accuracy with the least square error of 0.14%. The results concluded that the complexity of the model was not directly related to the prediction performance. By contrasting several methods of chaotic nonlinear inventory data and neural network dynamics prediction, this study contributed to the academia. The research results provided useful advice for companies' planned production and inventory officers when they plan for product inventory and minimize the risk of mishaps brought on by excess inventories in warehouses. [ABSTRACT FROM AUTHOR]

This paper investigates the antidisturbance formation control problem for a class of cluster aerospace unmanned systems (CAUSs) suffering from multisource high-dynamic uncertainties. Firstly, to estimate and compensate the uncertainties existing in CAUS coordinate dynamics, an adaptive antidisturbance formation control law, which is combined by a robust adaptive control law and the second order disturbance observer, has been designed. Secondly, aiming at the adverse influences caused by the nonlinear time-varying nonlinearities existing in the formation flight dynamics, the radial basis function neural network (RBFNN) is introduced. Furthermore, considering the rapidly varying characteristics of the aforementioned formation flight nonlinearities, a novel board RBFNN (B-RBFNN) has been constructed and utilized to improve the approximation and compensation performance. In virtue of the fusing of the B-RBFNN and the second-order disturbance observer-based adaptive formation control law, the rapid response rate and the higher control accuracy of the formation control system can be achieved. As a result, a novel B-RBFNN-based intelligence adaptive antidisturbance formation control algorithm has been established for CAUS trajectory coordination and formation flight. Numerical simulation results are proposed to illustrate the effectiveness and advantages of the proposed B-RBFNN-based intelligent adaptive formation control method for the CAUS. [ABSTRACT FROM AUTHOR]

Community detection is one of the key research directions in complex network studies. We propose a community detection algorithm based on a density peak clustering model and multiple attribute decision-making strategy, TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution). First, the two-dimensional dataset, which is transformed from the network by taking the density and distance as the attributes of nodes, is clustered by using the DBSCAN algorithm, and outliers are determined and taken as the key nodes. Then, the initial community frameworks are formed and expanded by adding the most similar node of the community as its new member. In this process, we use TOPSIS to cohesively integrate four kinds of similarities to calculate an index, and use it as a criterion to select the most similar node. Then, we allocate the nonkey nodes that are not covered in the expanded communities. Finally, some communities are merged to obtain a stable partition in two ways. This paper designs some experiments for the algorithm on some real networks and some synthetic networks, and the proposed method is compared with some popular algorithms. The experimental results testify for the effectiveness and show the accuracy of our algorithm. [ABSTRACT FROM AUTHOR]

K-nearest neighbours (kNN) is a very popular instance-based classifier due to its simplicity and good empirical performance. However, large-scale datasets are a big problem for building fast and compact neighbourhood-based classifiers. This work presents the design and implementation of a classification algorithm with index data structures, which would allow us to build fast and scalable solutions for large multidimensional datasets. We propose a novel approach that uses navigable small-world (NSW) proximity graph representation of large-scale datasets. Our approach shows 2–4 times classification speedup for both average and 99th percentile time with asymptotically close classification accuracy compared to the 1-NN method. We observe two orders of magnitude better classification time in cases when method uses swap memory. We show that NSW graph used in our method outperforms other proximity graphs in classification accuracy. Our results suggest that the algorithm can be used in large-scale applications for fast and robust classification, especially when the search index is already constructed for the data. [ABSTRACT FROM AUTHOR]

Decomposition-based evolutionary multiobjective algorithms (MOEAs) divide a multiobjective problem into several subproblems by using a set of predefined uniformly distributed reference vectors and can achieve good overall performance especially in maintaining population diversity. However, they encounter huge difficulties in addressing problems with irregular Pareto fronts (PFs) since many reference vectors do not work during the searching process. To cope with this problem, this paper aims to improve an existing decomposition-based algorithm called reference vector-guided evolutionary algorithm (RVEA) by designing an adaptive reference vector adjustment strategy. By adding the strategy, the predefined reference vectors will be adjusted according to the distribution of promising solutions with good overall performance and the subspaces in which the PF lies may be further divided to contribute more to the searching process. Besides, the selection pressure with respect to convergence performance posed by RVEA is mainly from the length of normalized objective vectors and the metric is poor in evaluating the convergence performance of a solution with the increase of objective size. Motivated by that, an improved angle-penalized distance (APD) method is developed to better distinguish solutions with sound convergence performance in each subspace. To investigate the performance of the proposed algorithm, extensive experiments are conducted to compare it with 5 state-of-the-art decomposition-based algorithms on 3-, 5-, 8-, and 10-objective MaF1–MaF9. The results demonstrate that the proposed algorithm obtains the best overall performance. [ABSTRACT FROM AUTHOR]

Driven by the development of the Internet industry, mobile robots (MRs) technology has become increasingly mature and widely used in all walks of life. Since MRs are densely distributed in the network system, how to establish a reliable communication architecture to achieve good cooperation and resource sharing between MRs has become a research hotspot. In this respect, mobile edge computing (MEC) technology and millimeter wave (mmW) technology can provide powerful support. This paper proposes a mmW communication network architecture for distributed MRs in MEC environment. The mmW base station provides reliable communication services for MRs under the coverage of information cloud (IC). We design a joint resource and power allocation strategy aimed at minimizing network energy consumption. First, we use the Lyapunov optimization technique to transform the original infinite horizon Markov decision process (MDP) problem. Then, a semidistributed algorithm is introduced to solve the distributed optimization problem in the mmW network. By improving the autonomous decision-making ability of the mmW base station, the signaling overheads caused by information interaction are reduced, and information leakage is effectively avoided. Finally, the global optimal solution is obtained. Simulation results demonstrate the superiority of the proposed strategy. [ABSTRACT FROM AUTHOR]

This study proposes a fractional gradient descent (FGD) algorithm for FIR models with missing data. By using the auxiliary model method, the missing data can be obtained. Then, the FGD algorithm is applied to update the parameters of the FIR models. Because of the fractional term in the conventional GD algorithm, the convergence rates of the GD algorithm can be increased. In addition, to avoid the step-size calculation, an Aitken FGD-based auxiliary model algorithm is also introduced. The convergence analysis and simulation examples are provided to show the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

To improve the speed control performance of a diesel engine, the active disturbance rejection controller (ADRC) is designed by adding an arranging transition process to the traditional PID controller, extracting differential signals reasonably, and adopting nonlinear combination process to error signals. The ADRC is composed of a tracking differentiator (TD), an extended state observer (ESO), and a nonlinear state error feedback (NLSEF). Such constructed ADRC can adapt to the strong nonlinear and complicate working conditions of diesel engine for power generation. A simulation model of the diesel engine is built to verify the proposed ADRC, and simulation results are in good accordance with the experimental results. To further validate the advantages of the designed ADRC, the traditional PID is improved by TD. Meanwhile, performance comparisons are carried out between traditional PID controller, improved PID controller, and ADRC. Results present that the improved PID controller can achieve a better control performance than that of the traditional PID controller both in steady state and transient state. However, the ADRC can further improve the speed control performance evidently on the basis of the improved PID controller. [ABSTRACT FROM AUTHOR]

The hunter-and-gatherer approach copes with the problem of dynamic multirobot task allocation, where tasks are unknowingly distributed over an environment. This approach employs two complementary teams of agents: one agile in exploring (hunters) and another dexterous in completing (gatherers) the tasks. Although this approach has been studied from the task planning point of view in our previous works, the multirobot exploration and coordination aspects of the problem remain uninvestigated. This paper proposes a multirobot exploration algorithm for hunters based on innovative notions of "expected information gain" to minimize the collective cost of task accomplishments in a distributed manner. Besides, we present a coordination solution between hunters and gatherers by integrating the novel notion of profit margins into the concept of expected information gain. Statistical analysis of extensive simulation results confirms the efficacy of the proposed algorithms compared in different environments with varying levels of obstacle complexities. We also demonstrate that the lack of effective coordination between hunters and gatherers significantly distorts the total effectiveness of the planning, especially in environments containing dense obstacles and confined corridors. Finally, it is statistically proven that the overall workload is distributed equally for each type of agent which ensures that the proposed solution is not biased to a particular agent and all agents behave analogously under similar characteristics. [ABSTRACT FROM AUTHOR]

In this research, the He-Laplace algorithm is extended to generalized third order, time-fractional, Korteweg-de Vries (KdV) models. In this algorithm, the Laplace transform is hybrid with homotopy perturbation and extended to highly nonlinear fractional KdVs, including potential and Burgers KdV models. Time-fractional derivatives are taken in Caputo sense throughout the manuscript. Convergence and error estimation are confirmed theoretically as well as numerically for the current model. Numerical convergence and error analysis is also performed by computing residual errors in the entire fractional domain. Graphical illustrations show the effect of fractional parameter on the solution as 2D and 3D plots. Analysis reveals that the He-Laplace algorithm is an efficient approach for time-fractional models and can be used for other families of equations. [ABSTRACT FROM AUTHOR]

In the present work, we introduce two novel root-finding algorithms for nonlinear scalar equations. Among these algorithms, the second one is optimal according to Kung-Traub's conjecture. It is established that the newly proposed algorithms bear the fourth- and sixth-order of convergence. To show the effectiveness of the suggested methods, we provide several real-life problems associated with engineering sciences. These problems have been solved through the suggested methods, and their numerical results proved the superiority of these methods over the other ones. Finally, we study the dynamics of the proposed methods using polynomiographs created with the help of a computer program using six cubic-degree polynomials and then give a detailed graphical comparison with similar existing methods which shows the supremacy of the presented iteration schemes with respect to convergence speed and other dynamical aspects. [ABSTRACT FROM AUTHOR]

In this study, two modified gradient descent (GD) algorithms are proposed for time-delayed models. To estimate the parameters and time-delay simultaneously, a redundant rule method is introduced, which turns the time-delayed model into an augmented model. Then, two GD algorithms can be used to identify the time-delayed model. Compared with the traditional GD algorithms, these two modified GD algorithms have the following advantages: (1) avoid a high-order matrix eigenvalue calculation, thus, are more efficient for large-scale systems; (2) have faster convergence rates, therefore, are more practical in engineering practices. The convergence properties and simulation examples are presented to illustrate the efficiency of the two algorithms. [ABSTRACT FROM AUTHOR]

Aimed at that ubiquitous three-phase unbalance problem in low-voltage distribution networks, the spotted hyena optimizer (SHO) algorithm is used to optimize the commutation strategy of the three-phase load unbalance. A multitarget swapping mathematical model was designed, and the objective was quickly resolved by relying on the excellent commutation strategy of the SHO. Finally, a case analysis was carried out on the data of a station area in Enshi, Hubei Province, and the results verify this swapping strategy can effectively reduce the unbalance rate. [ABSTRACT FROM AUTHOR]

The aim of this article is to present a chaotic fruit fly algorithm (CFFA) as an optimization approach for solving engineering design problems (EDPs). In CFFA, the fruit fly algorithm (FFA), which is recognized for its durability and efficiency in addressing optimization problems, was paired with the chaotic local search (CLS) method, which allows for local exploitation. CFFA will be set up to work in two phases: in the first, FFA will be used to discover an approximate solution, and in the second, chaotic local search (CLS) will be used to locate the optimal solution. As a result, CFFA can address difficulties associated with the basic FFA such as falling into local optima, an imbalance between exploitation and exploration, and a lack of optimum solution acquisition (i.e., overcoming the drawback of premature convergence and increasing the local exploitation capability). The chaotic logistic map is employed in the CLS because it has been demonstrated to be effective in improving the quality of solutions and giving the best performance by many studies. The proposed algorithm is tested by the set of CEC'2005 special sessions on real parameter optimization and many EDPs from the most recent test suite CEC'2020. The results have demonstrated the superiority of the proposed approach to finding the global optimal solution. Finally, CFFA′s results were compared to those of earlier research, and statistical analysis using Friedman and Wilcoxon's tests revealed its superiority and capacity to tackle this type of problem. [ABSTRACT FROM AUTHOR]

Establishing a rapid-response mechanism to manage customer orders is very important in managing demand surges. In this study, combined with predicting order requests, we established a multiobjective optimization model to solve the warehouse space allocation problem. First, we developed a model based on the NAR neural network to predict order requests. Subsequently, we used the improved NSGA-III based on good point set theory to construct a multiobjective optimization model to minimize resource loss, maximize efficiency in goods selection, and maximize goods accumulation. The following three modes were tested to allocate warehouse storage space: random, ABC, and prediction-oriented. Finally, using actual order data, we conducted a comparative analysis of the three modes regarding their efficiency in goods selection. The method proposed by this study improved goods selection efficiency by a sizable margin (23.8%). [ABSTRACT FROM AUTHOR]

For obtaining optimal cross-sectional dimensions of rods for a 3-RRR planar parallel manipulator (PPM) to minimize energy consumption, the inverse dynamics of the manipulator is modeled based on the Newton–Euler method, after which the coefficient matrix of the inverse dynamics equation is decomposed based on matrix theory. Hence, the objective function, that is, the logical relationship between the energy consumption of the manipulator and the cross-sectional dimension of each rod, is established. However, in solving the multidimensional constrained single-object optimization problem, there are difficulties such as the penalty function's sensitivity to the penalty factors if the problem is transformed into the one of unconstrained multiobjective optimization. Therefore, to properly handle the constraints, an improved butterfly optimization algorithm (IBOA) is presented to ensure that the new iterated point always falls into the feasible region according to the butterfly optimization algorithm (BOA). Finally, the comparisons among the IBOA, particle swarm optimization (PSO), and BOA and further experiments of the physical prototype are implemented to validate the effectiveness of the proposed theoretical model and numerical algorithm. Results indicate that the proposed IBOA is more suitable for solving the constrained single-object optimization problem with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

In recent years, deep neural networks have achieved great success in many fields, such as computer vision and natural language processing. Traditional image recommendation algorithms use text-based recommendation methods. The process of displaying images requires a lot of time and labor, and the time-consuming labor is inefficient. Therefore, this article mainly studies image recommendation algorithms based on deep neural networks in social networks. First, according to the time stamp information of the dataset, the interaction records of each user are sorted by the closest time. Then, some feature vectors are created via traditional feature algorithms like LBP, BGC3, RTU, or CNN extraction. For image recommendation, two LSTM neural networks are established, which accept these feature vectors as input, respectively. The compressed output of the two sub-ESTM neural networks is used as the input of another LSTM neural network. The multilayer regression algorithm is adopted to randomly sample some network nodes to obtain the cognitive information of the nodes sampled in the entire network, predict the relationship between all nodes in the network based on the cognitive information, and perform low sampling to achieve relationship prediction. The experiments show that proposed LSTM model together with CNN feature vectors can outperform other algorithms. [ABSTRACT FROM AUTHOR]