Search

Traditional recommendations for news and media education resources usually ignore the importance of sequential patterns in user check-in behavior and fail to effectively capture the complex and dynamically changing interests of users. As a result, this study provides a recommendation model for news and media education materials based on a user model. To capture changes in users' interests, the model can represent and fuse short-term and long-term preferences separately. For short-term preferences, a long- and short-term memory network incorporating spatiotemporal contextual information is proposed to learn complex sequential transfer patterns in users' check-in behaviors and further extract short-term preferences accurately through a goal-based attention mechanism. A user attention-based approach is utilized to capture fine-grained links between users and interest points for long-term preferences. Finally, experimental simulations are conducted on two datasets, Foursquare and Gowalla. The results show that the proposed user model-based recommendation model for news media education resources has better performance compared with the mainstream recommendation methods on different evaluation criteria, which validates the effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

Taxi-out time is the main performance index to evaluate the operational efficiency of major airports. Scientifically and accurately predicting the taxi-out time of departure flights is very important to improve the operational efficiency and coordination decision-making ability of airport. Firstly, the quantifiable influence factors of taxi-out time and their correlation is analyzed, including the number of departure flights, the number of arrival flights, the number of flights pushed back in the same period, the taxi-out time by half-hour in average, the taxi distance, and the number of turns, etc. And then a prediction model of departure flights' taxi-out time based on BP is constructed. Because the traditional BP neural network is sensitive to the initial weight and threshold and has poor accuracy and stability, the taxi-out time prediction model of BP neural network optimized by intelligent algorithm is proposed. Genetic algorithm (GA) and sparrow search algorithm (SSA) are used to obtain the optimal weight and threshold of BP neural network, which is verified by the actual operation data of a major airport in central and southern China for two weeks. The results show that ① the taxi-out time is strongly correlated with the airport surface traffic flow, moderately correlated with the average taxi-out time, and weakly correlated with the taxi distance and the number of turns. ② The predicted outcome of the 4-element combination prediction model which considers strong correlation and medium correlation factors is the best. After adding weak correlation factors, the prediction accuracy is reduced. ③ By obtaining the local optimal weight and threshold of neural network, intelligent optimization algorithm can effectively improve the accuracy of departure flights' taxi-out time prediction results. ④ The prediction result of BP neural network optimized based on GA is 1.79% higher than that of MAPE before optimization, MAE is reduced by 7.4 s, and RMSE is reduced by 6.93 s. The prediction result of BP neural network optimized based on SSA is 3.05% higher than that of MAPE before optimization, MAE is reduced by 16.55 s, and RMSE is reduced by 14.31 s. Therefore, Sparrow search algorithm has better optimization effect on the model than genetic algorithm. [ABSTRACT FROM AUTHOR]

With the rapid economic development and urbanization process accelerating, motor vehicle ownership in large cities is increasing year by year; urban traffic congestion, parking difficulties, and other problems are becoming increasingly serious; in ordinary daily life, continuous risk of disturbance, having a flexible transportation system network is more able to alleviate daily congestion in the city, and the main thing about flexible transportation network is its algorithm. It is worth noting that congestion in many cities is generally reflected in the main roads, while many secondary roads and branch roads are underutilized, and the limited road resources in cities are not fully utilized. As an economic and effective road traffic management measure, one-way traffic can balance the spatial and temporal distribution of traffic pressure within the road network, make full use of the existing urban road network capacity, and solve the traffic congestion problem. Therefore, it is of great theoretical and practical significance to develop a reasonable and scientific one-way traffic scheme according to the characteristics of traffic operation in different regions. Based on the fixed demand model, the influence of traffic demand changes is further considered, the lower-level model is designed as an elastic demand traffic distribution model, the excess demand method is used to transform the elastic demand problem into an equivalent fixed demand problem based on the extended network, and the artificial bee colony algorithm based on risk perturbation is designed to solve the two-level planning model. The case study gives a one-way traffic organization optimization scheme that integrates three factors, namely, the average load degree overload limit of arterial roads, the detour coefficient, and the number of on-street parking spaces on feeder roads, and performs sensitivity analysis on the demand scaling factor. [ABSTRACT FROM AUTHOR]

Functions in nonlinear programing optimization are sometimes not easily differentiable. When such kinds of functions are present in the optimization problem, then the process of obtaining the solution can sometimes become quite lengthy. Traditional and classical methods cannot be used to solve such optimization problems because such methods assume the functions to be differentiable. Smoothing of nondifferentiable functions is thus required to tackle such difficulties. In this study, we introduce the concept of constructing a technique to smooth such nondifferentiable functions. We begin with the smoothing of the penalty function. On the basis of it, we come up with an algorithm to find the best way to solve an optimization problem with inequality constraints. We also talk about how to figure out the error for a certain smooth penalty function. We also provide numerical examples to demonstrate that the suggested approach is practical and usable. [ABSTRACT FROM AUTHOR]

An automated flower thinning system, when combined with machine vision, has the potential to reduce the labor force, improve efficiency, and lower costs. This combination represents the future of agricultural machinery development. The primary objective of automatic flower thinning is to determine the flowering density of fruit trees under natural light conditions. In this study, we introduce a flower recognition algorithm that uses pixel values as an independent variable to recognize flower categories by constructing a nonlinear regression model. Initially, the RGB pixel values of elements in the training set are extracted. Similar pixel values are clustered together to reduce the amount of computation, and representative elements are selected to construct a nonlinear classification function, known as the regression function. The coefficients in the classifier are determined by transforming the problem into an unconstrained optimization problem using the least square method. The optimal solution is then found as the coefficient value in the classifier. The classification function calculates the function value of the RGB pixel value for each input entity to determine whether it belongs to the flower entity. Finally, the developed algorithm is used to classify the flower graphic elements of the measured pictures, and the efficiency of the algorithm is verified. [ABSTRACT FROM AUTHOR]

Blind source separation is a widely used technique to analyze multichannel data. In most real-world applications, noise is inevitable and will affect the quality of signal separation and even make signal separation failure. In this paper, a new signal processing framework is proposed to separate noisy mixing sources. It is composed of two different stages. The first step is to process the mixing signal by a certain signal transform method to make the expected signals have energy concentration characteristics in the transform domain. The second stage is formed by a certain BSS algorithm estimating the demixing matrix in the transform domain. In the energy concentration segment, the SNR can reach a high level so that the demixing matrix can be estimated accurately. The analysis process of the proposed algorithm framework is analyzed by taking the wavelet transform as an example. Numerical experiments demonstrate the efficiency of the proposed algorithm to estimate the mixing matrix in comparison with well-known algorithms. [ABSTRACT FROM AUTHOR]

Recently, several heuristics have been interested in scheduling problems, especially those that are difficult to solve via traditional methods, and these are called NP-hard problems. As a result, many methods have been proposed to solve the difficult scheduling problems; among those, effective methods are the tabu search algorithm (TS), which is characterized by its high ability to adapt to problems of the large size scale and ease of implementation and gives solution closest to the optimum, but even though those difficult problems are common in many industries, there are only a few numbers of previous studies interested in the scheduling of jobs on unrelated parallel machines. In this paper, a developed TS algorithm based on lower bound (LB) and exact algorithm (EA) solutions is proposed with the objective of minimizing the total completion time (makespan) of jobs on nonidentical parallel machines. The given solution via EA was suggested to enhance and assess the solution obtained from TS. Moreover, the LB algorithm was developed to evaluate the quality of the solution that is supposed to be obtained by the developed TS algorithm and, in addition, to reduce the period for searching for the optimal solution. Two numerical examples from previous studies from the literature have been solved using the developed TS algorithm. Findings show that the developed TS algorithm proved its superiority and speed in giving it the best solution compared to those solutions previously obtained from the literature. [ABSTRACT FROM AUTHOR]

In this paper, a low-altitude risk collision model based on CUDA is designed to avoid problems that may occur in the process of unmanned aerial power patrol. By collecting and analyzing the data related to the unmanned aerial power patrol task, the collision accident probability is extracted and the probability distribution model and the influence of weather factors on the collision risk are combined. The model validates the collision risk of unmanned aerial vehicles in different locations and verifies the reliability and computational efficiency of the model based on different operating systems. The model algorithm can effectively improve the response time to avoid collision risk during UAV patrol and reduce the risk level of UAV collision accidents. [ABSTRACT FROM AUTHOR]

The main aim of this manuscript is to design and demonstrate the performance of different control algorithms with position estimator and disturbance observer to track the helical trajectory by an underactuated quadrotor craft under the influence of unmodelled dynamic factors and external disturbances. The manuscript consists of the derivations related to the kinematics and dynamics of quadrotor dully derived using the Newton Euler approach. It is one of the strenuous tasks to stabilize and control the quadrotor for helical trajectory tracking since it is an underactuated mechatronic system. In addition to this, with inclusion of unmodelled dynamic factors, it faces some of the serious transient and steady-state issues including Zeno noise. In this research manuscript, dual-loop single-dimension fuzzy sliding mode control (DLSDF-SMC) is proposed to improve the helical trajectory tracking performance, and to tackle the unmodelled dynamic factors, a state feedback controller is proposed consisting of a position estimator and disturbance observer design. The entire system is distributed into two subsystems such that within the angular subsystem, the attitude control is proposed using DLSDF-SMC, and for the translational subsystem, the paper proposes the position control design based on the hyperbolic function to avoid the gimbal lock issue. The overall stability of the proposed closed-loop control scheme is also proved. The simulation work for the proposed algorithm is performed using MATLAB and Simulink software and compared with the conventional sliding mode control (SMC) and fuzzy-based SMC control designs. This work demonstrates that the DLSDF-SMC control technique with position estimator and disturbance observer design in feedback not only improves the aggressive maneuvers while tracking the helical trajectory but also tackles the transient and steady-state issues. [ABSTRACT FROM AUTHOR]

Simulation speed depends on code structures. Hence, it is crucial how to build a fast algorithm. We solve the Allen–Cahn equation by an explicit finite difference method, so it requires grid calculations implemented by many for-loops in the simulation code. In terms of programming, many for-loops make the simulation speed slow. We propose a model architecture containing a pad and a convolution operation on the Allen–Cahn equation for fast computation while maintaining accuracy. Also, the GPU operation is used to boost up the speed more. In this way, the simulation of other differential equations can be improved. In this paper, various numerical simulations are conducted to confirm that the Allen–Cahn equation follows motion by mean curvature and phase separation in two-dimensional and three-dimensional spaces. Finally, we demonstrate that our algorithm is much faster than an unoptimized code and the CPU operation. [ABSTRACT FROM AUTHOR]

Innovation and institutional governance are the key enabling factors of cluster ecosystem development. Its synergistic effects play an important role in enhancing ecosystem competitiveness. In this paper, pseudocode language is applied to cluster ecosystem cooperative model reasoning. The coordination and optimization of the innovation system and institutional governance system were studied in a biomedical cluster. Besides, Pearson algorithm was used to test the correlation degree of elements in three Chinese biomedical clusters. The results show that, in Zhangjiang and Nanchang biomedical clusters, the synergistic correlation coefficient between the innovation system and the institutional governance system fluctuates around 0.8. However, in Tonghua biomedical cluster, the synergy correlation coefficient fluctuated around -0.2. The fluctuation range between the two clusters was large. After adjusting the range of order parameters, the rank of synergy trend was Zhangjiang > Nanchang > Tonghua. Finally, further analysis shows that Zhangjiang and Nanchang biomedical clusters can achieve the optimal synergy state by adjusting innovation and institutional governance, but Tonghua cannot. Therefore, the collaboration between the innovation system and institutional governance system provides some reference for the high-quality development of the cluster ecosystem. [ABSTRACT FROM AUTHOR]

Traditional and typical iterative learning control algorithm shows that the convergence rate of error is very low for a class of regular linear systems. A fast iterative learning control algorithm is designed to deal with this problem in this paper. The algorithm is based on the traditional P-type iterative learning control law, which increases the composition of adjacent two overlapping quantities, the tracking error of previous cycle difference signals, and the current error difference. Using convolution to promote Young inequalities proved strictly that, in terms of Lebesgue-p norm, when the number of iterations tends to infinity, the tracking error converges to zero in the system and presents the convergence condition of the algorithm. Compared with the traditional P-type iterative learning control algorithm, the proposed algorithm improves convergence speed and evades the defect using the norm metric's tracking error. Finally, the validation of the effectiveness of the proposed algorithm is further proved by simulation results. [ABSTRACT FROM AUTHOR]

In software engineering, defect prediction is significantly important and challenging. The main task is to predict the defect proneness of the modules. It helps developers find bugs effectively and prioritize their testing efforts. At present, a lot of valuable researches have been done on this topic. However, few studies take into account the impact of time factors on the prediction results. Therefore, in this paper, we propose an improved Elman neural network model to enhance the adaptability of the defect prediction model to the time-varying characteristics. Specifically, we optimized the initial weights and thresholds of the Elman neural network by incorporating adaptive step size in the Cuckoo Search (CS) algorithm. We evaluated the proposed model on 7 projects collected from public PROMISE repositories. The results suggest that the contribution of the improved CS algorithm to Elman neural network model is prominent, and the prediction performance of our method is better than that of 5 baselines in terms of F-measure and Cliff's Delta values. The F-measure values are generally increased with a maximum growth rate of 49.5% for the POI project. [ABSTRACT FROM AUTHOR]

Dark channel prior (DCP) has been widely used in single image defogging because of its simple implementation and satisfactory performance. This paper addresses the shortcomings of the DCP-based defogging algorithm and proposes an optimized method by using an adaptive fusion mechanism. This proposed method makes full use of the smoothing and "squeezing" characteristics of the Logistic Function to obtain more reasonable dark channels avoiding further refining the transmission map. In addition, a maximum filtering on dark channels is taken to improve the accuracy of dark channels around the object boundaries and the overall brightness of the defogged clear images. Meanwhile, the location information and brightness information of fog image are weighed to obtain more accurate atmosphere light. Quantitative and qualitative comparisons show that the proposed method outperforms state-of-the-art image defogging algorithms. [ABSTRACT FROM AUTHOR]

As is well known, the mixed complementarity problem is equivalent to a nonsmooth equation by using a median function. By investigating the generalized Jacobi of a composite vector-valued maximum function, a nonsmooth Levenberg–Marquardt algorithm is proposed in this paper. In the present algorithm, we adopt a new LM parameter form and discuss the local convergence rate under the local error bound condition, which is weaker than nonsingularity. Finally, the numerical experiments and the application for the real-time pricing in smart grid illustrate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

The basic notions in rough set theory are lower and upper approximation operators defined by a fixed binary relation. This paper proposes an intuitionistic fuzzy rough set (IFRS) model which is a combination of intuitionistic fuzzy set (IFS) and rough set. We approximate an IFS by using soft binary relations instead of fixed binary relations. By using this technique, we get two pairs of intuitionistic fuzzy (IF) soft sets, called the upper approximation and lower approximation with respect to foresets and aftersets. Properties of newly defined rough set model (IFRS) are studied. Similarity relations between IFS with respect to this rough set model (IFRS) are also studied. Finally, an algorithm is constructed depending on these approximations of IFSs and score function for decision-making problems, although a method of decision-making algorithm has been introduced for fuzzy sets already. But, this new IFRS model is more accurate to solve the problem because IFS has degree of nonmembership and degree of hesitant. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the resource-constrained order acceptance and scheduling on unrelated parallel machines that arise in make-to-order systems. The objective of this problem is to simultaneously select a subset of orders to be processed and schedule the accepted orders on unrelated machines in such a way that the resources are not overutilized at any time. We first propose two formulations for the problem: mixed integer linear programming formulation and set partitioning. In view of the complexity of the problem, we then develop a column generation approach based on the set partitioning formulation. In the proposed column generation approach, a differential evolution algorithm is designed to solve subproblems efficiently. Extensive numerical experiments on different-sized instances are conducted, and the results demonstrate that the proposed column generation algorithm reports optimal or near-optimal solutions that are evidently better than the solutions obtained by solving the mixed integer linear programming formulation. [ABSTRACT FROM AUTHOR]

The electroencephalogram (EEG) signals are a big data which are frequently corrupted by motion artifacts. As human neural diseases, diagnosis and analysis need a robust neurological signal. Consequently, the EEG artifacts' eradication is a vital step. In this research paper, the primary motion artifact is detected from a single-channel EEG signal using support vector machine (SVM) and preceded with further artifacts' suppression. The signal features' abstraction and further detection are done through ensemble empirical mode decomposition (EEMD) algorithm. Moreover, canonical correlation analysis (CCA) filtering approach is applied for motion artifact removal. Finally, leftover motion artifacts' unpredictability is removed by applying wavelet transform (WT) algorithm. Finally, results are optimized by using Harris hawks optimization (HHO) algorithm. The results of the assessment confirm that the algorithm recommended is superior to the algorithms currently in use. [ABSTRACT FROM AUTHOR]

In this paper, the fuzzy comprehensive evaluation model based on the bat algorithm quantifies the qualitative evaluation effectively and provides a feasible and convenient English teaching quality evaluation system by combining quantitative evaluation with objective index data. Firstly, the English teaching quality evaluation model is constructed based on the fuzzy comprehensive evaluation analysis method and the weight values of each factor are calculated; secondly, the three types of data in the model are processed separately. This includes standardizing the data of objective indicators such as students' course grades and weakening the influence of course difficulty on this indicator. The fuzzy comprehensive evaluation model based on the bat algorithm quantifies the qualitative evaluation to make the calculated comprehensive evaluation of English teaching quality more comprehensive and objective; then the comprehensive calculation of English teaching quality evaluation is completed, and the English teaching quality evaluation model is constructed by extracting keywords based on the qualitative evaluation; finally, a runnable English teaching quality evaluation system is designed and implemented. A fuzzy comprehensive evaluation algorithm based on improved bat algorithm optimization is proposed. The algorithm uses the improved fuzzy comprehensive evaluation algorithm to optimize the initial clustering centers and adopts a new objective function to guide the clustering process, thus improving the clustering quality of the fuzzy comprehensive evaluation algorithm. Comparative analysis through models shows that the improved algorithm improves the clustering accuracy to a certain extent when compared with the traditional fuzzy comprehensive evaluation clustering algorithm for analysis. The bat algorithm is one of the stochastic global optimization models. It can take advantage of the group, integrate global search and local search, and achieve rapid convergence. Therefore, it plays an important role in optimizing the evaluation of English teaching quality. This study enriches the theoretical study of English teaching quality evaluation to a certain extent and can play a role in strengthening and improving English teaching quality evaluation at the present stage. [ABSTRACT FROM AUTHOR]

Cloud computing platforms have been extensively using scientific workflows to execute large-scale applications. However, multiobjective workflow scheduling with scientific standards to optimize QoS parameters is a challenging task. Various metaheuristic scheduling techniques have been proposed to satisfy the QoS parameters like makespan, cost, and resource utilization. Still, traditional metaheuristic approaches are incompetent to maintain agreeable equilibrium between exploration and exploitation of the search space because of their limitations like getting trapped in local optimum value at later evolution stages and higher-dimensional nonlinear optimization problem. This paper proposes an improved Fruit Fly Optimization (IFFO) algorithm to minimize makespan and cost for scheduling multiple workflows in the cloud computing environment. The proposed algorithm is evaluated using CloudSim for scheduling multiple workflows. The comparative results depict that the proposed algorithm IFFO outperforms FFO, PSO, and GA. [ABSTRACT FROM AUTHOR]

The key nodes play important roles in the processes of information propagation and opinion evolution in social networks. Previous work rarely considered multiple relationships and features into key node discovery algorithms at the same time. Based on the relational networks including the forwarding network, replying network, and mentioning network in a social network, this paper first proposes an algorithm of the overlapping user relational network to extract different relational networks with same nodes. Integrated with these relational networks, a multirelationship network is established. Subsequently, a key node discovery (KND) algorithm is presented on the basis of the shortest path, degree centrality, and random walk features in the multirelationship network. The advantages of the proposed KND algorithm are proved by the SIR propagation model and the normalized discounted cumulative gain on the multirelationship networks and single-relation networks. The experiment's results show that the proposed KND method for finding the key nodes is superior to other baseline methods on different networks. [ABSTRACT FROM AUTHOR]

The concept of fuzzy graph (FG) and its generalized forms has been developed to cope with several real-life problems having some sort of imprecision like networking problems, decision making, shortest path problems, and so on. This paper is based on some developments in generalization of FG theory to deal with situation where imprecision is characterized by four types of membership grades. A novel concept of T-spherical fuzzy graph (TSFG) is proposed as a common generalization of FG, intuitionistic fuzzy graph (IFG), and picture fuzzy graph (PFG) based on the recently introduced concept of T-spherical fuzzy set (TSFS). The significance and novelty of proposed concept is elaborated with the help of some examples, graphical analysis, and results. Some graph theoretic terms are defined and their properties are studied. Specially, the famous Dijkstra algorithm is proposed in the environment of TSFGs and is applied to solve a shortest path problem. The comparative analysis of the proposed concept and existing theory is made. In addition, the advantages of the proposed work are discussed over the existing tools. [ABSTRACT FROM AUTHOR]

In this paper, a BLSTM-based adaptive finite-time control structure has been constructed for a class of aerospace unmanned systems (AUSs). Firstly, a novel neural network structure possessing both the time memory characteristics and high learning speed, broad long short-term memory (BLSTM) network, has been constructed. Secondly, several nonlinear functions are utilized to transform the tracking errors into a novel state vector to guarantee the output constraints of the AUSs. Thirdly, the fractional-order control law and the corresponding adaptive laws are designed, and as a result, the adaptive finite-time control scheme has been formed. Moreover, to handle the uncertainties and the faulty elevator outputs, an inequality of the multivariable systems is utilized. Consequently, by fusing the output of the BLSTM, the transformation of the tracking errors, and the adaptive finite-time control law, a novel BLSTM-based intelligent adaptive finite-time control structure has been established for the AUSs under output constraints. The simulation results show that the proposed BLSTM-based adaptive control algorithm can achieve favorable control results for the AUSs with multiple uncertainties. [ABSTRACT FROM AUTHOR]

This paper proposes a cooperative search algorithm to enable swarms of unmanned aerial vehicles (UAVs) to capture moving targets. It is based on prior information and target probability constrained by inter-UAV distance for safety and communication. First, a rasterized environmental cognitive map is created to characterize the task area. Second, based on Bayesian theory, the posterior probability of a target's existence is updated using UAV detection information. Third, the predicted probability distribution of the dynamic time-sensitive target is obtained by calculating the target transition probability. Fourth, a customized information interaction mechanism switches the interaction strategy and content according to the communication distance to produce cooperative decision-making in the UAV swarm. Finally, rolling-time domain optimization generates interactive information, so interactive behavior and autonomous decision-making among the swarm members are realized. Simulation results showed that the proposed algorithm can effectively complete a cooperative moving-target search when constrained by communication distance yet still cooperate effectively in unexpected situations such as a fire. [ABSTRACT FROM AUTHOR]

In the context of cloud computing, one problem that is frequently encountered is task scheduling. This problem has two primary implications, which are the planning of tasks on virtual machines and the attenuation of performance. In order to address the problem of task scheduling in cloud computing, requisite nontraditional optimization attitudes to attain the optima of the problem, the present paper puts forth a hybrid multiple-objective approach called hybrid grey wolf and whale optimization (HGWWO) algorithms, that integrates two algorithms, namely, the grey wolf optimizer (GWO) and the whale optimization algorithm (WOA), with the purpose of conjoining the advantages of each algorithm for minimizing costs, energy consumption, and total execution time needed for task implementation, beside that improving the use of resources. Assessment of the aims of the proposed approach is carried out with the help of the tool known as CloudSim. As pointed out by the results of the experimental work undertaken, the proposed approach has the capability of performing at a superior level by comparison to the original algorithms GWO and WOA on their own with regard to costs, energy consumption, makespan, use of resources, and degree of imbalance. [ABSTRACT FROM AUTHOR]

Fragments generated from the blast-fragmentation warhead after blasting are typically multiple, fast, small, and dense. In light of the epipolar multitarget feature of blasting fragments, this paper utilizes the movement characteristics of blasting fragments for modeling. Then, the modeling results are adopted in probabilistic data association (PDA) algorithm of multitarget tracking. A novel epipolar multitarget velocity PDA (VPDA) algorithm is proposed based on the movement characteristics of blasting fragments. This algorithm forms the movement characteristics with the finite element simulation results of warhead blasting fragments, utilizes the Doppler velocity probability to reassign the association probability, and updates the state and covariance of each target through the probability weighted fusion. Simulation results demonstrate that, the computational complexity of the proposed algorithm is close to that of PDA algorithm, and the association success rate and the state value update error approximates to the association effects of joint probabilistic data association (JPDA) algorithm, which can effectively track the fragments with identical velocity while reducing the complexity of the epipolar multitarget tracking algorithm, and can respond to the group target tracking scenario. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of designing novel switching control for a class of stochastic nonlinear switched fuzzy systems with time delay. Firstly, a stochastic nonlinear switched fuzzy system can precisely describe continuous and discrete dynamics as well as their interactions in the complex real-world systems. Next, novel control algorithm and switching law design of the state-dependent form are developed such that the stability is guaranteed. Since convex combination techniques are used to derive the delay independent criteria, some subsystems are allowed to be unstable. Finally, various comparisons of the elaborated examples are conducted to demonstrate the effectiveness of the proposed control design approach. All results illustrate good control performances as desired. [ABSTRACT FROM AUTHOR]

This article uses Field Programmable Gate Array (FPGA) as a carrier and uses IP core to form a System on Programmable Chip (SOPC) English speech recognition system. The SOPC system uses a modular hardware system design method. Except for the independent development of the hardware acceleration module and its control module, the other modules are implemented by software or IP provided by Xilinx development tools. Hardware acceleration IP adopts a top-down design method, provides parallel operation of multiple operation components, and uses pipeline technology, which speeds up data operation, so that only one operation cycle is required to obtain an operation result. In terms of recognition algorithm, a more effective training algorithm is proposed, Genetic Continuous Hidden Markov Model (GA_CHMM), which uses genetic algorithm to directly train CHMM model. It is to find the optimal model by encoding the parameter values of the CHMM and performing operations such as selection, crossover, and mutation according to the fitness function. The optimal parameter value after decoding corresponds to the CHMM model, and then the English speech recognition is performed through the CHMM algorithm. This algorithm can save a lot of training time, thereby improving the recognition rate and speed. This paper studies the optimization of embedded system software. By studying the fixed-point software algorithm and the optimization of system storage space, the real-time response speed of the system has been reduced from about 10 seconds to an average of 220 milliseconds. Through the optimization of the CHMM algorithm, the real-time performance of the system is improved again, and the average time to complete the recognition is significantly shortened. At the same time, the system can achieve a recognition rate of over 90% when the English speech vocabulary is less than 200. [ABSTRACT FROM AUTHOR]

The concept of a "Smart City" emphasizes the need to employ information and communication technologies to strengthen the quality, connectivity, and efficiency of various municipal services. Cloud computing and the Internet of Things are shaping future tech. Both ideas greatly impact smart city application and solution development. Cloud computing is amazing at managing and storing remote service access. Several companies have switched to cloud leasing to reduce local resource burden. Due to the intricacy and flexibility of cloud-maintained services, selecting jobs that best suit client needs should be optimized. Quality of service criteria for each cloud service are the best tools for choosing and optimizing cloud carriers. Genetic algorithms (GAs) and ant colony optimization (ACO) are combined to make cloud computing. It is discovered that the recommended ACO + GA obtains an accuracy of 82% when compared to existing methods of energy- and reliability-aware multiobjective optimization method and the hybrid cuckoo particles swarm, artificial bee colony optimization (CPS + ABCO) where accuracy is 68% and 75%, respectively. [ABSTRACT FROM AUTHOR]

Counselling students remains a pre-eminence for most tertiary institutions in Ghana to the extent that institutions now have counselling units that extend to the departmental level. This study used the K-prototype machine learning algorithm to cluster students' behaviour based on 28 relevant attributes and further proposed a classification model. The analysis of the experimental outcomes using the elbow method reveals the formation of three distinct clusters with decreasing intra-cluster similarities and increasing inter-cluster distances. The first cluster uniquely consists of active learners with three or more roommates, primarily in the first year. The second cluster with the highest membership consists mainly of second-year students who exhibit passive classroom conduct and reside in a two-occupancy hostel. The third cluster contains a mixture of third and final-year students who are highly passive in class and live in a tenancy occupancy of two. After clustering, the K-nearest neighbours, logistic regression, naïve Bayes (NB), and AdaBoost ensemble algorithms were implemented to create a model for future learner cluster prediction. Simulation results using the tenfold cross-validation technique show that AdaBoost (NB) has the highest accuracy of 99.88% with an F-measure score of 0.999 and receiver operating characteristic–area under the curve value of 1.00. [ABSTRACT FROM AUTHOR]

The purpose of multicriteria clustering is to locate groups of alternatives that have comparable qualities and have been examined across multiple criteria. An ordered profile clustering is a well-known problem, and the fuzzy c-means clustering (FCM) technique is one of the most broadly used in every field of life. At present, FCM is for the partitioning of information into numerous clusters which are still lacking priority relations. To address the problem of finding ranking in clusters based on multicriteria in the fuzzy environment, we propose a multicriteria ordered clustering algorithm based on the partial net outranking flow of the preference organization for enrichment evaluations method (PROMETHEE) and fuzzy c-means. Lastly, we apply the proposed algorithm to solve a real-world targeted clustering problem regarding the human development indexes. To test the efficacy of the proposed algorithm, a comparative analysis of ordered K-means clustering (OKM) and FCM is carried out with it. [ABSTRACT FROM AUTHOR]

High utility itemset mining is an interesting research in the field of data mining, which can find more valuable information than frequent itemset mining. Several high-utility itemset mining approaches have already been proposed; however, they have high computational costs and low efficiency. To solve this problem, a high-utility itemset mining algorithm based on the particle filter is proposed. This approach first initializes a population, which consists of particle sets. Then, to update the particle sets and their weights, a novel state transition model is suggested. Finally, the approach alleviates the particle degradation problem by resampling. Substantial experiments on the UCI datasets show that the proposed algorithm outperforms the other previous algorithms in terms of efficiency, the number of high-utility itemsets, and convergence. [ABSTRACT FROM AUTHOR]

Road surface roughness is the leading cause of vehicle oscillation. The suspension system is used to dampen these oscillations. The active suspension system equipped with a hydraulic actuator is more efficient than the passive one. Therefore, it is used to replace the passive suspension system. The article reviews and analyses models and control algorithms for active suspension systems. In this article, the author mentioned three dynamic models commonly used to simulate vehicle oscillations: a quarter-dynamic model, a half-dynamic model, and a fully dynamic model. Each hydraulic actuator can be considered a state variable in the dynamic model. Besides, the control algorithm for the suspension system is significant. Algorithms like PID (proportional–integral–derivative) and LQR (linear quadratic regulator) will fit the linear model. In contrast, the nonlinear model's algorithms, such as SMC (sliding mode control), fuzzy, and ANN (artificial neural network), will perform better. Overall, vehicle oscillation can be significantly improved once an active suspension system is used. The contents analysed in this article will be the database for selecting control models and algorithms by other researchers in the future. [ABSTRACT FROM AUTHOR]

The flexibility of cloud computing to provide a dynamic and adaptable infrastructure in the context of information technology and service quality has made it one of the most challenging issues in the computer industry. Task scheduling is a major challenge in cloud computing. Scheduling tasks so that they may be processed by the most effective cloud network resources has been identified as a critical challenge for maximizing cloud computing's performance. Due to the complexity of the issue and the size of the search space, random search techniques are often used to find a solution. Several algorithms have been offered as possible solutions to this issue. In this study, we employ a combination of the genetic algorithm (GA) and the gravitational emulation local search (GELS) algorithm to overcome the task scheduling issue in cloud computing. GA and the particle swarm optimization (PSO) algorithms are compared to the suggested algorithm to demonstrate its efficacy. The suggested algorithm outperforms the GA and PSO, as shown by the experiments. [ABSTRACT FROM AUTHOR]

Elderly individuals with similar abilities are likely to have similar care needs. Abilities are the basis for analysing the need patterns of elderly individuals. Abilities of elderly individuals are both numerical and categorical; therefore, an improved K-prototypes cluster algorithm for mixed attributes was proposed to group elderly individuals based on abilities. In this algorithm, the dissimilarity measure of categorical attributes is designed to consider not only the difference between the object to be allocated and the prototype of the cluster but also the differ6ence between the object to be allocated and other objects in the cluster and can measure the difference in sequential values of ordinal categorical attributes. Experimental results show that the improved K-prototypes algorithm performs well for clustering datasets containing mixed attributes. Taking the CHARLS dataset as an example, distinct groups of elderly individuals based on the improved K-prototypes algorithm showed significant ability differences. [ABSTRACT FROM AUTHOR]

Establishing an accurate and robust short-term load forecasting (STLF) model for a power system in safe operation and rational dispatching is both required and beneficial. Although deep long short-term memory (LSTM) networks have been widely used in load forecasting applications, it still has some problems to optimize, such as unstable network performance and long optimization time. This study proposes an adaptive step size self-organizing migration algorithm (AS-SOMA) to improve the predictive performance of LSTM. First, an optimization model for LSTM prediction is developed, which divides the LSTM structure seeking into two stages. One is the optimization of the number of hidden layer layers, and the other optimizes the number of neurons, time step, learning rate, epochs, and batch size. Then, a logistic chaotic mapping and an adaptive step size method were proposed to overcome slow convergence problems and stacking into local optimum of SOMA. Comparison experiments with SOMA, PSO, CPSO, LSOMA, and OSMA on test function sets show the advantages of the improved algorithm. Finally, the AS-SOMA-LSTM network prediction model is used to solve the STLF problem to verify the effectiveness of the proposed algorithm. Simulation experiments show that the AS-SOMA exhibits higher accuracy and convergence speed on the standard test function set and has strong prediction ability in STLF application with LSTM. [ABSTRACT FROM AUTHOR]

In order to reduce the impact of highway passenger transportation hubs on urban internal traffic operations and improve the efficiency of external travel, a method to determine the location of such hubs based on POI data and the Dijkstra algorithm is proposed. Firstly, the process of connecting the starting point of travel in the city to the urban road node and the highway exit is analyzed. Taking the minimum total time cost as the objective function, the mathematical model of the location method of a highway passenger transportation hub is established. Then, an algorithm for solving the mathematical model is proposed. In the solution method, the concept of "equivalent distance" is introduced into the Dijkstra algorithm to calculate the shortest path for passengers traveling on the urban road network. Weighted random numbers are generated to simulate the choice of highway exits when intercity coaches carrying passengers leave the city. Finally, Zhengzhou City is taken as an example for application analysis. The calculation is carried out using a script written in Python. The calculation results of the proposed method are compared with the results of the P -median model and the current locations of hubs. The results show that the proposed method consumes less time than the P -median method. The total time cost is also lower, which can reduce the time for passengers to leave the city. The location of the highway passenger transportation hub is closer to the periphery of the city and highway nodes, which conforms to the engineering practice and development trend of hub location so as to reduce its impact on urban internal traffic. [ABSTRACT FROM AUTHOR]

With the continuous progress of the chemical industry, warehouse design needs to be diversified on account of the increasing complex and multitudinous perilous chemicals. In this situation, this study projects the conception of the interconnected warehouse. By taking the storage points as the quantity and the path as the variable, this study establishes a quadratic allocation model on the operations of this novel kind of warehouse. Then, an improved neural network algorithm is proposed to ascertain the optimal solution. The innovation of this study is that it releases the space resources of the classic dangerous goods warehouse and improves the operational efficiency of the dangerous goods warehouse under the premise of ensuring safety. Finally, the proposed model and algorithm is tested and verified with a data of Shanghai Lingang dangerous Material Warehouse. The empirical research demonstrates that the interconnected warehouse has ideal performance for lifting the handling efficiency on the basis of ensuring safety. [ABSTRACT FROM AUTHOR]

The appeal for safe navigation of autonomous surface vessels (ASVs) has deemed the path planning problem as an attractive research interest. However, most of the previous works to solve the path planning problem focus on finding the shortest and collision-free path, but the solutions are scarcely satisfied by the safety requirements and constraints related to the USVs' mechanical systems. To address this challenge, we present a novel path planning method based on a modified artificial fish swarm algorithm in combination with a path optimizer. The modifications are made from two perspectives: (1) Four customized operators and an adaptive factor are applied to improve the convergence performance of the algorithm. (2) A local path optimizer is proposed to enhance its feasibility of cooperating with the USV control system. Path safety, path smoothness, and nonholonomic constraints are considered. The path planning benchmark experiments have demonstrated its superior performance in terms of efficiency and path quality compared to other state-of-the-art algorithms. Moreover, the proposed method is also integrated into the USV's control system in a practical environment with satisfactory feasibility. The simulation results provide strong evidence that the proposed method can be regarded as a practical approach for USV path planning problems. [ABSTRACT FROM AUTHOR]

Efficient emergency material dispatch, amid the aftermath of an emergency event, can help control the spread of the disaster and reduce disaster losses. Herewith, we propose a model with the urgency of material demand as the target coefficient, and the minimum load time and the minimum transportation cost as the total cost. For this model, an improved particle swarm optimization (PSO) algorithm is proposed as the means to optimize the initial positions of particles with good point sets and improve the convergence speed with adaptive dynamic weights to improve the optimization of the emergency material dispatch model. In order to verify the effectiveness of the proposed model and algorithm improvement strategy, the experimental results are verified by means of simulation experiments and algorithm comparison experiments, which show that the proposed emergency material dispatch model and the improved PSO algorithm cannot only solve the post-disaster relief material distribution and dispatching problem but also effectively reduce the total cost of emergency material dispatching. [ABSTRACT FROM AUTHOR]

To address the features of strong noise, blurred boundaries, and poor imaging quality in breast ultrasound images, we propose a method for segmenting breast ultrasound images using adaptive region growing and variation level sets. First, this method builds a template layer from the difference between the marked image and the original image. Second, the Otsu algorithm is used to measure the target and background using the maximum class variance method to set the threshold. Finally, through the level set of the pixel neighborhood, the boundary points of the adaptive region growth are specified by the level set of the pixel neighborhood, and it is therefore possible to accurately determine the contour perimeter and area of the lesion region. The results demonstrate that the value of Jaccard and Dice for benign tumors is greater than 0.99. Therefore, the segmentation effect of breast images can be achieved by utilizing a breast ultrasound image segmentation approach that uses adaptive region growth and variation level sets. [ABSTRACT FROM AUTHOR]

For the multiple automated guided vehicle (multi-AGV) routing problems in the warehousing link of logistics, where the optimization objective is to minimize both the number of AGVs used and the maximum pickup time simultaneously, a nondominant sorting differential evolution (NSDE) algorithm is proposed. In the encoding and decoding stages, the pickup point area is divided. AGVs are allocated to each region according to the proposed rule based on avoiding duplicate paths. Meanwhile, the pickup points within the region can be adjusted to optimize the pickup paths and improve the pickup efficiency. The fast nondominated sorting method and elitist selection strategy in the nondominated sorting genetic algorithm II (NSGA-II) are introduced into the differential evolution algorithm, which sorts all the regions to obtain the best Pareto solution set. Lastly, the domination of the proposed NSDE algorithm in Pareto frontier evaluation indicators is verified by some numerical experiments. [ABSTRACT FROM AUTHOR]

In order to achieve more accurate estimates of the existing direction-finding approaches under impulsive noise, a robust direction-finding algorithm using a coprime array is proposed in this work. In order to suppress the strong impulsive noise, we introduce an infinite norm normalization approach, and on this basis, a weighted signal subspace fitting equation using a coprime array is derived. Furthermore, we propose a quantum-inspired moth-flame algorithm to minimize the derived weighted signal subspace fitting function. Simulation results represent that our direction-finding method has the most excellent performance compared to other conventional methods. Besides, our method can address coherent sources without any additional approach. [ABSTRACT FROM AUTHOR]

A panoramic image texture detail enhancement method based on the Retinex algorithm is proposed to work on the nature of panoramic images. Firstly, the panoramic image is collected, then the panoramic image is preprocessed through brightness enhancement, the brightness of the preprocessed panoramic image is normalized, and the panoramic image is optimized and increased by the improved Retinex algorithm. Finally, the simulation test of the panoramic image was carried out. The results show that the improved Retinex algorithm works on the sign to-commotion proportion of the panoramic image. Furthermore, the time required to enhance the panoramic texture detail is short, which can meet the practical requirements of panoramic image subsequent processing. [ABSTRACT FROM AUTHOR]

We study the distributed resource allocation problem for heterogeneous multiagent systems over an undirected graph, an essential issue in multiagent system coordinated control and complex network system control. The decision variable is subject to global equality and local convex set constraints, and the objective is smooth and convex. It aims to minimize the global objective function by exchanging neighboring information between agents. An adaptive distributed algorithm is designed using the distance function-based exact penalty function method. A state- and time-based triggering condition is designed to avoid continuous communication and reduce the communication burden. From a random initial state, the proposed algorithm asymptotically converges to the optimal value by means of LaSalle's invariance principle. Finally, examples are provided to demonstrate the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

In order to improve the level of personalized news recommendation efficiently and accurately, an event network-oriented personalized news recommendation algorithm is proposed. First, the event network is used to analyze, predict users' interests and preferences, and actively push information content to meet users' personalized needs, so as to build a personalized news recommendation model. Under the mobile Internet technology, combined with the characteristics of the Internet, through the position and title similarity of sentences in the document and other features, the combined features are formed to calculate the sentence weight. Finally, the sentences are extracted according to the weight ranking to generate the news summary, so as to realize the research on personalized news recommendation algorithm for event network. The experimental results show that the proposed algorithm has high recall and coverage, short time, good recommendation effect, and strong recommendation performance. [ABSTRACT FROM AUTHOR]

Aiming at the problems that the initial cluster centers are randomly selected and the number of clusters is manually determined in traditional clustering algorithm, which results in unstable clustering results, we propose an improved clustering algorithm based on density peak and nearest neighbors. Firstly, an improved density peak clustering method is proposed to optimize the cutoff distance and local density of data points. It avoids that random selection of initial cluster centers is easy to fall into the local optimal solution. Furthermore, a K-value selection method is presented to choose the optimal number of clusters, which is determined by the sum of the squared errors within the clusters. Finally, we employ the idea of the K-nearest neighbors to carry out the assignment for outliers. Experiments on the UCI real data sets indicate that our proposed algorithm can achieve better clustering results compared with several known algorithms. [ABSTRACT FROM AUTHOR]

The efficiency of a photovoltaic (PV) system under partial shading conditions (PSCs) is primarily determined by how the PV panels are connected to the load. Various PV system architectures have been developed to improve power processing capability and thus power conversion efficiency. In this article, a central and string architecture are considered, and the performance characteristics are obtained using optimization techniques such as gray wolf optimization (GWO) and flower pollination algorithm (FPA) in MATLAB/Simulink. The simulation results show that the performance characteristics of string architecture obtained using the GWO algorithm outperform central architecture with both GWO and FPA. [ABSTRACT FROM AUTHOR]

At present, unmanned driving technology has made great progress, while those research on its related ethical issues, laws, and traffic regulations are relatively lagging. In particular, it is still a problem how unmanned vehicles make a decision when they encounter ethical dilemmas where traffic collision is inevitable. So it must hinder the application and development of unmanned driving technology. Firstly, 1048575 survey data collected by Moral Machine online experiment platform is analyzed to calculate the prior probability that the straight being protector or sacrificer in ethical dilemmas with single feature. Then, 116 multifeature ethical dilemmas are designed and surveyed. The collected survey data are analyzed to determine decision-making for these ethical dilemmas by adopting the majority principle and to calculate correlation coefficient between attributes, then an improved Naive Bayes algorithm based on attribute correlation (ACNB) is established to solve the problem of unmanned driving decision in multifeature ethical dilemmas. Furthermore, these ethical dilemmas are used to test and verify traditional NB, ADOE, WADOE, CFWNB, and ACNB, respectively. According to the posterior probability that the straight being protector or sacrificer in those ethical dilemmas, classification and decision are made in these ethical dilemmas. Then, the decisions based on these algorithms are compared with human decisions to judge whether these decisions are right. The test results show that ACNB and CFWNB are more consistent with human decisions than other algorithms, and ACNB is more conductive to improve unmanned vehicle's decision robustness than NB. Therefore, applying ACNB to unmanned vehicles has a good role, which will provide a new research point for unmanned driving ethical decision and a few references for formulating and updating traffic laws and regulations related to unmanned driving technology for traffic regulation authorities. [ABSTRACT FROM AUTHOR]

Age of Information (AoI) is a metric to describe the timeliness of a system proposed in recent years. It measures the freshness of the latest received data from the perspective of the target node in the system. This work studies a kind of dynamic data acquisition system for urban security that can update and control the situation of urban environmental security by collecting environmental data. The collected data packets need to be uploaded to the cloud center in time for data update, which has high requirements on the timeliness of the system and freshness of data. However, due to the limited computing capacity of mobile terminals and the pressure of bandwidth for data transmission, problems such as high data execution delay and transmission interruption are caused. Emerging mobile edge computing (MEC), a new model of computing that extends cloud computing capabilities to the edge network, promises to solve these problems. This work focuses on the timeliness of the system, as measured by the average AoI across all mobile terminals. First, a timeliness optimization model is defined, and a multi-agent deep reinforcement learning (DRL) algorithm combined with an attention mechanism is proposed to carry out computing offloading and resource allocation through the continuous interaction between agent and environment; then, in order to improve algorithm performance and data security, the federated learning mode is proposed to train agents; finally, the proposed algorithm is compared with other main baseline algorithms based on deep reinforcement learning. The simulation results show that the proposed algorithm not only outperforms other algorithms in optimizing system timeliness, but also improves the stability of training. [ABSTRACT FROM AUTHOR]