Search

Multimodal biometrics fusion plays an important role in the field of biometrics. Therefore, this paper presents a multimodal biometrics fusion algorithm using deep reinforcement learning. In order to reduce the influence of user behavior, user's personal characteristics, and environmental light on image data quality, data preprocessing is realized through data transformation and single-mode biometric image region segmentation. A two-dimensional Gobar filter was used to analyze the texture of local sub-blocks, qualitatively describe the similarity between the filter and the sub-blocks and extract the phase information and local amplitude information of multimodal biometrics features. Deep reinforcement learning was used to construct the classifier of different modal biometrics, and the weighted sum fusion of different modal biometrics was implemented by fractional information. The multimodal biometrics fusion algorithm was designed. The Casia-iris-interval-v4 and NFBS datasets were used to test the performance of the proposed algorithm. The results show that the fused image quality is better, the feature extraction accuracy is between 84% and 93%, the average accuracy of feature classification is 97%, the multimodal biometric classification time is only 110 ms, the multimodal biometric fusion time is only 550 ms, the effect is good, and the practicability is strong. [ABSTRACT FROM AUTHOR]

In view of the poor effect of current sports dance movement detection, this paper puts forward a sports dance movement detection method based on posture recognition. By using the principle of posture recognition to obtain the characteristic information of sports dance movement, construct the action characteristic evaluation system, optimize the action detection algorithm combined with posture recognition technology, and realize the classified detection of sports dance movements. Finally, experiments show that the sports dance movement detection based on pose recognition has high practicability and effectiveness in the process of practical application and fully meets the research requirements. [ABSTRACT FROM AUTHOR]

With the advancement of economic globalization and the continuous development of "Internet +" economy, cross-border e-commerce has become an important part of participating in international economic exchanges and developing foreign trade. As the direct participation of consumers, cross-border online shopping has gradually become an important way for people to obtain overseas commodities. The phenomenon of fake products and parallel goods is serious in e-commerce online shopping. How to use the existing Internet of Things to achieve product traceability is an important research topic. For different modes of cross-border online shopping, this paper combines the traceability algorithm with the idea of semantic routing, proposes a Semantic Web-based traceability algorithm, and constructs a quality safety traceability system. In order for consumers to accurately know the product quality of sellers, the product traceability model of cross-border e-commerce relying on Semantic Web is constructed to prevent false information from recording product information from the product source. Through the tracing query algorithm, the simulation results show that the hop number of routes between nodes is 1, and the tracing algorithm can quickly determine the identity of online goods. The network delay is mostly distributed between 0 and 0.05 s, which meets the real-time requirements of the Internet of Things. [ABSTRACT FROM AUTHOR]

In the process of wireless communication, the transmission of signals will be subject to various kinds of interference, which will affect the quality of communication. Interference detection is an important part of improving the reliability of communication. When the interfering signal has the same frequency as the original communication signal, with traditional methods, it is difficult to extract feature parameters. Aiming at this special cofrequency interference signal, this paper proposes a time series signal prediction model based on deep learning and uses the difference between the predicted signal and the received signal as the eigenvalue to detect interference. In order to improve the detection rate, the eigenvalues predicted by LSTM and Bi-LSTM networks are subjected to windowing experiments. The Support Vector Machine (SVM) is used to detect the interference of eigenvalues, and the comparison results are visualized by the confusion matrix. The experimental simulation results show that the Bi-LSTM model has better feature extraction ability for time series signals, and the prediction ability of the signal and the accuracy of interference detection are higher than those of the LSTM model. [ABSTRACT FROM AUTHOR]

Due to the large fluctuation of import and export volume and many influencing factors, it is difficult for the general prediction algorithm to obtain more accurate prediction results. To solve this problem, a trade forecasting method based on the Particle Swarm Optimization (PSO) optimization hybrid Relevance Vector Machine (RVM) model is proposed. The method firstly finds out the indexes that affect the import and export trade and extracts the principal factors of the indexes as the input data of the model through principal component analysis. Then, based on the single-kernel RVM model training with multiple different kernel functions, the multikernel weighting method was used to construct the hybrid kernel RVM model according to the prediction error of the single-kernel RVM model. Finally, the parameters of the hybrid kernel model were optimized by PSO to improve the prediction accuracy. Close trade will strengthen the dependence between countries, and under this premise, it becomes particularly important to study the frequency of trade between countries. In this paper, the countries along the Belt and Road are classified by the method of high-order directed graph clustering, and the trade transactions between the countries are represented by a small network subgraph. Then, the 65 trading countries are classified by cutting graph and K-means clustering method, and the classification results are obtained by running relevant codes in MATLAB. The results are represented by the lattice graph. [ABSTRACT FROM AUTHOR]

The search range and search position of the particle are closely related to the shrinkage-expansion factor of the particle and the value of the center of the potential well. As the number of iterations increases, its search will gradually fall near the center of the potential well, and the search range will gradually decrease. Therefore, when the center of the potential well and the search range gradually approach the global optimum, the final result of the algorithm can be guaranteed to be the global optimum. Therefore, we need to optimize the shrinkage-expansion factor and the potential well center, improve the individual development ability of the group in the later stage of the algorithm and the expansion ability of the group, so that the potential well center is easier to fall near the global optimal point. Based on the chaotic strategy, a particle swarm initialization method is proposed. Using the unique ergodicity of the chaotic system, the method can make the particles spread well in the solution space of the search problem. Based on the antecedent normal cloud model, an adaptive method for determining control parameters and the center of the potential well is proposed. Based on the consequent normal cloud model, a particle adaptive mutation method is proposed. The comprehensive application of these improvement measures to the improved QPSO effectively improves the performance of the original algorithm. In this paper, the principle and method of multioptical axis parallelism measurement are studied. Based on the hardware equipment of the parallelism measurement system based on the large-diameter off-axis parabolic mirror collimator, the measurement accuracy and automation of the system are improved through image processing technology. The degree and anti-interference ability of the system are analyzed in detail. According to the characteristics of the system, an optimized focus evaluation function and a center positioning algorithm are proposed to improve the measurement speed and accuracy of the system. Through the improvement of the system DCT focus evaluation coefficient method and the optimization of the least squares ellipse fitting process, the measurement accuracy and anti-interference ability of the system are improved, the calculation time is shortened, and the real-time performance and automation of the system are enhanced. [ABSTRACT FROM AUTHOR]

To estimate and analyze the orbit of a spacecraft in the ascent phase, three algorithms are proposed in this paper: a two-satellite point-by-point intersection positioning algorithm, single-satellite positioning algorithm, and multiple-point intersection collaborative positioning algorithm. Meanwhile, two mathematic models of the spacecraft orbit are presented based on the kinematics characteristic and the least square method. Besides, by combining the results of the proposed satellite positioning algorithms with mathematic models of the spacecraft orbit, the particle filtering based on the Monte Carlo algorithm is applied to filtering of the final results of the spacecraft. Finally, the effectiveness of the two-satellite point-by-point intersection positioning algorithm and the single-satellite positioning algorithm is verified through the experiment simulation on the real data. [ABSTRACT FROM AUTHOR]

With the rapid development of China's electrical industry, the safe operation of electrical facilities is very important for social stability and people's property safety. The failure detection method of conventional electrical equipment is hand detection, which has high experience of the detection person, lacks detection and error detection, and the detection efficiency is low. With the development of artificial intelligence technology, computer-assisted substation inspection is now possible, and substation inspection using an intelligent inspection robot equipped with an infrared device is one of the main substation inspection methods. In this paper, experiments are carried out using several neural network models. For example, if a faster region convolutional neural networks (RCNN) infrared detection model is employed, a good vg16 in the feature region of the extracted image takes into account the quality of the infrared image and the presence of multiple devices. Infrared images can be used to determine the basic features of various electronic devices. In order to detect targets in infrared images of electrical equipment, the fast RCNN target detection algorithm is used, and the overall recognition accuracy reaches 83.1%, and a good application effect is obtained. [ABSTRACT FROM AUTHOR]

In this paper, the theory of viscoelastic material relaxation modulus testing, testing method, and material relaxation modulus parameter solution method is studied. Based on the IoT sensor test devices and the Hertzian mathematics theory, the relationship between the compression amount, pressure, and relaxation modulus of a rigid spherical indenter pressed into a flat viscoelastic material is studied. In combination with the Boltzmann superposition principle, the relaxation modulus test method and theory for viscoelastic materials are proposed. A good fitting curve was obtained to solve the relaxation modulus parameters of various materials under the three-element Maxwell model. The experimental setup and the results of the parameter fitting were analyzed to verify the feasibility and accuracy of the results. [ABSTRACT FROM AUTHOR]

Cloud computing provides unprecedented advantages of using computing resources with very less efforts and cost. The energy utilization in cloud data centers has forced the cloud service providers to raise the expense of using its services and has increased the carbon footprints in the environment. Many static bin-packing algorithms exist which can reduce energy by some percentage, but with new era of digitization, advanced and dynamic techniques are required which can serve heterogeneous users and random users' requests. Thus, in this paper, two new dynamic best-fit decreasing-based bin-packing algorithms are proposed wherein the first technique is for service providers and focuses on increasing server utilization and the second approach acts as a switcher to harness best results among all algorithms. Both techniques deliberately achieve high performance in terms of total energy consumption, resource utilization, and makespan along with serving continuous and varying requests from customers. The simulations are performed using Java. The results exhibited that DEE-BFD can escalate resource utilization by 96% and EM switcher can reduce total energy consumption by 49% and reduce makespan by 56%. [ABSTRACT FROM AUTHOR]

Conventional ambiguity resolution (AR) strategy of directly fixing all raw frequency ambiguities for uncombined precise point positioning (PPP) generally requires a long initial time to ensure fixing reliability. The rich signals from multi-frequency GNSS can provide new opportunities for rapid PPP AR. In this paper, based on a unified multi-frequency uncombined PPP model, the raw frequency ambiguities are linearly transformed to the between-satellite-single-differenced extra-wide-lane (EWL), wide-lane (WL), and narrow-lane (NL) ambiguities, and a cascading ambiguity resolution (CAR) method of fixing EWL/WL/NL ambiguities sequentially is proposed. Meanwhile, a partial ambiguity fixing (PAF) strategy with ambiguity subset adaptively selected based on the successively increased elevations is also adopted in each step to improve the fixing rate. Further, experiments with globally distributed stations are carried out to verify the algorithm. With the constraints of EWL/WL AR, the precision of NL ambiguity and its variance-covariance matrix can be effectively optimized, so the time to first fix (TTFF) is significantly shortened, and the ratio value is also improved to varying degrees. As for BDS-only solution, the average TTFF is shortened from 23.7 min to 10.9 min, with an improvement over 50%; for GPS/BDS, GPS/Galileo, and GPS/Galileo/BDS combined solutions, the TTFF is shortened from 14.3 min, 9.4 min, and 6.7 min to 8.1 min, 2.6 min, and 1.8 min, which are, respectively, shortened by 43.4%, 72.3%, and 73.1%. In general, the proposed CAR strategy can shorten the TTFF of multi-GNSS multi-frequency PPP to about 2 min. The performance of EWL/WL/NL ambiguity-fixed solutions is also analyzed. The NL solution is generally at centimeter-level accuracy over the entire period; however, limited by the atmosphere errors during the convergence stage, the EWL/WL solutions can only obtain decimeter-level accuracy, and the difference between them and NL solution gradually decreases with the continuous improvement of atmosphere accuracy. [ABSTRACT FROM AUTHOR]

This research aims to improve the rationality and intelligence of AUTOMATICALLY HIGHER MATHEMATICALLY EXAM SYSTEM (AHMES) through some AI algorithms. AHMES is an intelligent and high-quality higher math examination solution for the Department of Computer Engineering at Pai Chai University. This research redesigned the difficulty system of AHMES and used some AI algorithms for initialization and continuous adjustment. This paper describes the multiple linear regression algorithm involved in this research and the AHMES learning (AL) algorithm improved by the Q-learning algorithm. The simulation test results of the upgraded AHMES show the effectiveness of these algorithms. [ABSTRACT FROM AUTHOR]

Human action recognition is an important part for computers to understand the behavior of people in pictures or videos. In a single image, there is no context information for recognition, so its accuracy still needs to be greatly improved. In this paper, a single-image human action recognition method based on improved ResNet and skeletal keypoints is proposed, and the accuracy is improved by several methods. We improved the backbone network ResNet-50 and CPN to a certain extent and constructed a multitask network to suit the human action recognition task, which not only improves the accuracy but also balances the total number of parameters and solves the problem of large network and slow operation. In this paper, the improvement methods of ResNet-50, CPN, and whole network are tested, respectively. The results show that the single-image human action recognition based on improved ResNet and skeletal keypoints can accurately identify human action in the case of different human movements, different background light, and occlusion. Compared with the original network and the main human action recognition algorithms, the accuracy of our method has its certain advantages. [ABSTRACT FROM AUTHOR]

The quantitative evaluation of the importance degree of spare parts is essential as spare parts' maintenance is critical for inventory management. Most of the methods used in previous research are subjective. For this reason, an accurate method for the evaluation of the importance degree combining an improved clustering algorithm with a back-propagation neural network (BPNN) is proposed in the present paper. First, we classified the spare parts by analyzing their historical maintenance and inventory data. Second, we evaluated the effectiveness of classification using the Davies–Bouldin index and the Calinski–Harabasz indicator and verified it using the training data. Finally, we used BPNN to determine the training data necessary for an accurate assessment of the importance degree of spare parts. The previous importance evaluation methods were susceptible to subjective factors during the evaluation process. The model established in this paper used the actual data of the company for machine learning and used the improved clustering algorithm to implement training and classification of spare parts data. The importance value of each spare part was output, which additionally reduced the impact of subjective factors on the importance evaluation. At the same time, the use of less data to evaluate the importance of spare parts was achieved, which improved the evaluation efficiency. [ABSTRACT FROM AUTHOR]

This paper addresses the constrained multiobjective optimization problem of time-modulated sparse arrays. The synthesis objective is to find an optimal element arrangement and associated excitation strategy of sparse arrays, which realize the balance of radiation power and sideband suppression performance with minimum number of elements, and suppress side lobe level simultaneously. A novel hybrid algorithm based on orthogonal perturbation method and convex optimization (OPM-CVX) for the synthesis of time-modulated sparse antenna array is presented in this paper. In order to satisfy the main lobe beamforming and side lobe suppression of sparse arrays, the proposed method optimizes element positions with minimum array numbers by orthogonal perturbation method and optimizes excitations of array element with dynamic range ratio constraint by convex optimization. Furthermore, a trapezoidal pulse time-modulated switching function is proposed to find the balance of radiation power and sideband suppression performance. The numerical results indicate that the proposed algorithm can be an effective approach for synthesis problems of time-modulated sparse arrays. [ABSTRACT FROM AUTHOR]

The objective of this paper is to present novel algorithms for solving the multiple attribute decision-making problems under the possibility intuitionistic fuzzy soft set (PIFSS) information. The prominent characteristics of the PIFSS are that it considers the membership and nonmembership degrees of each object during evaluation and their corresponding possibility degree. Keeping these features, this paper presents some new operation laws, score function, and comparison laws between the pairs of the PIFSSs. Further, we define COmplex PRoportional ASsessment (COPRAS) and weighted averaging and geometric aggregation operators to aggregate the PIFSS information into a single one. Later, we develop two algorithms based on COPRAS and aggregation operators to solve decision-making problems. In these approaches, the experts and the weights of the parameters are determined with the help of entropy and the distance measure to remove the ambiguity in the information. Finally, a numerical example is given to demonstrate the presented approaches. [ABSTRACT FROM AUTHOR]

Synthetic aperture imaging (SAI) technology gets the light field information of the scene through the camera array. With the large virtual aperture, it can effectively acquire the information of the partially occluded object in the scene, and then we can focus on the arbitrary target plane corresponding to the reference perspective through the refocus algorithm. Meanwhile, objects that deviate from the plane will be blurred to varying degrees. However, when the object to be reconstructed in the scene is occluded by the complex foreground, the optical field information of the target cannot be effectively detected due to the limitation of the linear array. In order to deal with these problems, this paper proposes a nonlinear SAI method. This method can obtain the occluded object's light field information reliably by using the nonlinear array. Experiments are designed for the nonlinear SAI, and refocusing is performed for the occluded objects with different camera arrays, different depths, and different distribution intervals. The results demonstrate that the method proposed in this paper is advanced than the traditional SAI method based on linear array. [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]

This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, by introducing auxiliary variables, we first equivalently transform the problem (MLFP) into the problem (EP). By using a new linear relaxation technique, the problem (EP) is reduced to a sequence of linear relaxation problems over the outer space rectangle, which provides the valid lower bound for the optimal value of the problem (EP). Based on the outer space branch-and-bound search and the linear relaxation problem, an outer space branch-and-bound algorithm is constructed for globally solving the problem (MLFP). In addition, the convergence and complexity of the presented algorithm are given. Finally, numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

As we all know, the model mismatch, primarily when the desired signal exists in the training data, or when the sample data is used for training, will seriously affect algorithm performance. This paper combines the subspace algorithm based on direction of arrival (DOA) estimation with the adaptive beamforming. It proposes a reconstruction algorithm based on the interference plus noise covariance matrix (INCM). Firstly, the eigenvector of the desired signal is obtained according to the eigenvalue decomposition of the subspace algorithm, and the eigenvector is used as the estimated value of the desired signal steering vector (SV). Then the INCM is reconstructed according to the estimated parameters to remove the adverse effect of the desired signal component on the beamformer. Finally, the estimated desired signal SV and the reconstructed INCM are used to calculate the weight. Compared with the previous work, the proposed algorithm not only improves the performance of the adaptive beamformer but also dramatically reduces the complexity. Simulation experiment results show the effectiveness and robustness of the proposed beamforming algorithm. [ABSTRACT FROM AUTHOR]

This paper provides an in-depth analysis and study of the interactive flipped classroom model for a digital micro-video for a big data English course. To improve the learning efficiency of English courses and reduce the learning pressure of students, the thesis also uses certain techniques to apply audiovisual language to the production of specific micro-class videos, broadcast the successfully recorded micro-class courses to students, and then use the questionnaire to randomly distribute the designed audiovisual language use questionnaire. Micro-classes earnestly perform data statistics for students and finally conduct data analysis to summarize and verify the effects of micro-class audiovisual language use. The improved algorithm can effectively reduce the fluctuation of the consumption of various resources in the cluster and make the services in the cluster more stable. The new distributed interprocess communication based on protocol and serialization technology is more efficient than traditional communication based on protocol standards, reduces bandwidth consumption in the cluster, and improves the throughput of each node in the cluster. The content design and scripting of micro-video teaching resources are based on this. Then, the production process of micro-video teaching resources is explained, according to the selection of tools, the preparation, recording, editing, and generation of materials. [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]

During the development of deep neural networks (DNNs), it is difficult to trade off the performance of fitting ability and generalization ability in training set and unknown data (such as test set). The current solution is to reduce the complexity of the objective function, using regularization methods. In this paper, we propose a method called VOVU (Variance Of Variance of Units in the last hidden layer) to maximize the optimization of the balance between fitting power and generalization during monitoring the training process. The main idea is to give full play to the predictability of the variance of the hidden layer units in the complexity of the neural network model and use it as a generalization evaluation index. In particular, we take full advantage of the last layer of hidden layers since it has the greatest impact. The algorithm was tested on Fashion-MNIST and CIFAR-10. The experimental results demonstrate that VOVU and test loss are highly positively correlated. This implies that a smaller VOVU indicates that the network has better generalization. VOVU can serve as an alternative method for early stopping and a good predictor of the generalization performance in DNNs. Specially, when the sample size is limited, VOVU will be a better choice because it does not require dividing training data as validation set. [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]

We propose a class of inexact secant methods in association with the line search filter technique for solving nonlinear equality constrained optimization. Compared with other filter methods that combine the line search method applied in most large-scale optimization problems, the inexact line search filter algorithm is more flexible and realizable. In this paper, we focus on the analysis of the local superlinear convergence rate of the algorithms, while their global convergence properties can be obtained by making an analogy with our previous work. These methods have been implemented in a Matlab code, and detailed numerical results indicate that the proposed algorithms are efficient for 43 problems from the CUTEr test set. [ABSTRACT FROM AUTHOR]

Structural reliability analysis is usually realized based on a multivariate performance function that depicts failure mechanisms of a structural system. The intensively computational cost of the brutal-force Monte-Carlo simulation motivates proposing a Gegenbauer polynomial-based surrogate model for effective structural reliability analysis in this paper. By utilizing the orthogonal matching pursuit algorithm to detect significant explanatory variables at first, a small number of samples are used to determine a reliable approximation result of the structural performance function. Several numerical examples in the literature are presented to demonstrate potential applications of the Gegenbauer polynomial-based sparse surrogate model. Accurate results have justified the effectiveness of the proposed approach in dealing with various structural reliability problems. [ABSTRACT FROM AUTHOR]

In this paper, two different 3D hydrofoils with profiles NACA0012 are simulated in the potential flow. Boundary element method (BEM) and nonuniform rational B-spline (NURBS) are coupled to reduce error and increase accuracy. The computer code is developed in different submergence depths (d), flow velocities (U), and various angles of attack (AoA), and the pressure is obtained by NURBS formulation. The pressure on a 3D hydrofoil with NACA412 profile iscompared with other existing methods. The validity of result is revealed. The accuracy of the results is acceptable. The competition of the two models' results indicates that the increasing chord length leads to increase in C p min , and the decrease in depth and angle of attack leads to the growing value of C p min . Moreover, when the flow velocity is changed, the changes of potential and pressure coefficient distribution do not follow the specific trend. NURBS is a basic equation in different CAD packages because it is able to mesh surfaces. This study demonstrates that this algorithm does mesh surface of high quality, so it can be developed to generate mesh on the submerged three-dimensional bodies. [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]

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, 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 purpose of this paper is to develop a fixed-wing aircraft that has the abilities of both vertical take-off (VTOL) and a fixed-wing aircraft. To achieve this goal, a prototype of a fixed-wing gyroplane with two propellers is developed and a rotor can maneuver like a drone and also has the ability of vertical take-off and landing similar to a helicopter. This study provides guidance, navigation, and control algorithm for the gyrocopter. Firstly, this study describes the dynamics of the fixed-wing aircraft and its control inputs, i.e., throttle, blade pitch, and thrust vectors. Secondly, the inflow velocity, the forces acting on the rotor blade, and the factors affecting the rotor speed are analyzed. Afterward, the mathematical models of the rotor, dual engines, wings, and vertical and horizontal tails are presented. Later, the flight control strategy using a global processing system (GPS) module is designed. The parameters that are examined are attitude, speed, altitude, turn, and take-off control. Lastly, hardware in the loop (HWIL) based simulations proves the effectiveness and robustness of the navigation guidance and control mechanism. The simulations confirm that the proposed novel mechanism is robust and satisfies mission requirements. The gyrocopter remains stable during the whole flight and maneuvers the designated path efficiently. [ABSTRACT FROM AUTHOR]

Multisensor data generalized fusion algorithm is a kind of symbolic computing model with multiple application objects based on sensor generalized integration. It is the theoretical basis of numerical fusion. This paper aims to comprehensively review the generalized fusion algorithms of multisensor data. Firstly, the development and definition of multisensor data fusion are analyzed and the definition of multisensor data generalized fusion is given. Secondly, the classification of multisensor data fusion is discussed, and the generalized integration structure of multisensor and its data acquisition and representation are given, abandoning the research characteristics of object oriented. Then, the principle and architecture of multisensor data fusion are analyzed, and a generalized multisensor data fusion model is presented based on the JDL model. Finally, according to the multisensor data generalized fusion architecture, some related theories and methods are reviewed, and the tensor-based multisensor heterogeneous data generalized fusion algorithm is proposed, and the future work is prospected. [ABSTRACT FROM AUTHOR]

Ubiquitous sensors cover many areas of modern society. As the sensor network matures, various applications based on the Internet of Things are setting off a new revolution in all aspects of social life. In order to in-depth study whether the Internet of Things technology can be used in the automatic evaluation of piano performance, this article uses artificial system comparison method, database establishment method, and model construction method to collect samples, analyze the automatic evaluation model, and streamline the algorithm, and based on these foundations, a practical automatic evaluation system for piano performance was created. However, the role of this article does not stop there. There are also a variety of algorithm-like models and the construction of technical models. First, the practicality of the created model is studied, and it is found that the traditional manual recognition rate is about 52%, while the recognition rate of the system in this paper is more than 90%, and the average recognition time of the system is 1.1 s. The start-up process and recognition process time of other systems are all no more than 6 s, indicating the superior performance of the system. On this basis, select the classic piano textbook: Thompson's Simple Piano Tutorial. From it, select representative pieces as test samples. We can find that the overall F-measure value is above 90%, and the average F-measure value is 96.8%; the system performance test is good and can provide accurate evaluation results for piano learners. The results show that the number of identifications and missing numbers of the system are not much different from those of manual identification, which further proves its superiority. It is basically realized that starting from the Internet of Things technology, a system model that can automatically evaluate most piano repertoires has been designed. [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]

The increase in computational power in recent years has opened a new door for image processing techniques. Three-dimensional object recognition, identification, pose estimation, and mapping are becoming popular. The need for real-world objects to be mapped into three-dimensional spatial representation is greatly increasing, especially considering the heap jump we obtained in the past decade in virtual reality and augmented reality. This paper discusses an algorithm to convert an array of captured images into estimated 3D coordinates of their external mappings. Elementary methods for generating three-dimensional models are also discussed. This framework will help the community in estimating three-dimensional coordinates of a convex-shaped object from a series of two-dimension images. The built model could be further processed for increasing the resemblance of the input object in terms of its shapes, contour, and texture. [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 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]

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 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]

To evaluate objects under uncertainty, many fuzzy frameworks have been designed and investigated so far. Among them, the frame of picture fuzzy set (PFS) is of considerable significance which can describe the four possible aspects of expert's opinion using a degree of membership (DM), degree of nonmembership (DNM), degree of abstinence (DA), and degree of refusal (DR) in a certain range. Aggregation of information is always challenging especially when the input arguments are interrelated. To deal with such cases, the goal of this study is to develop the notion of the Maclaurin symmetric mean (MSM) operator as it aggregates information under uncertain environments and considers the relationship of the input arguments, which make it unique. In this paper, we studied the theory of MSM operators in the layout of PFSs and discussed their applications in the selection of the most suitable enterprise resource management (ERP) scheme for engineering purposes. We developed picture fuzzy MSM (PFMSM) operators and investigated their validity. We developed the multiattribute decision-making (MADM) algorithm based on the PFMSM operators to examine the performance of the ERP systems using picture fuzzy information. A numerical example to evaluate the performance of ERP systems is studied, and the effects of the associated parameters are discussed. The proposed aggregated results using PFMSM operators are found to be reliable as it takes into account the interrelationship of the input information, unlike traditional aggregation operators. A comparative study of the proposed PFMSM operators is also studied. [ABSTRACT FROM AUTHOR]

Torque ripple is a defect of switched reluctant motors. DITC (direct instantaneous torque control) is harnessed to solve the problem as a traditional method, which is superior to TSF (torque sharing function). In this paper, a new controller is proposed with modified hysteresis and PWM in DITC. With the modified algorithm, the torque error will be reduced with PWM in DITC. The proposed algorithm is effective to improve sample and 0 status in a period. The modified algorithm is based on application of zero in the asymmetric half bridge, which is implemented as the buffer zone. In case of big torque error, hysteresis will mitigate error under the characteristic of fast responding. In case of small errors, the modified PWM will solve torque error in the equivalent strategy, which has adopted the essence of the impulse equivalent method. The modified controller is designed to reduce responding time and minimize the torque ripple under the proposed algorithm, which has been designed to harness different functions in different torque errors. Based on final simulation and experimental results, responding speed and reduction of output torque ripple are enhanced effectively. [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]