Search

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]

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]

It is an important part of security inspection to carry out security and safety screening with X-ray scanners. Computer vision plays an important role in detection, recognition, and location analysis in intelligent manufacturing. The object detection algorithm is an important part of the intelligent X-ray machine. Existing threat object detection algorithms in X-ray images have low detection precision and are prone to missed and false detection. In order to increase the precision, a new improved Mask R-CNN algorithm is proposed in this paper. In the feature extraction network, an enhancement path is added to fuse the features of the lower layer into the higher layer, which reduces the loss of feature information. By adding an edge detection module, the training effect of the sample model can be improved without accurate labeling. The distance, overlap rate, and scale difference between objects and region proposals are solved using DIoU to improve the stability of the region proposal's regression, thus improving the accuracy of object detection; SoftNMS algorithm is used to overcome the problem of missed detection when the objects to be detected overlap each other. The experimental results indicate that the mean Average Precision (mAP) of the improved algorithm is 9.32% higher than that of the Mask R-CNN algorithm, especially for knife and portable batteries, which are small in size, simple in shape, and easy to be mistakenly detected, and the Average Precision (AP) is increased by 13.41% and 15.92%, respectively. The results of the study have important implications for the practical application of threat object detection in X-ray images. [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]

Software defined WiFi network (SD-WiFi) is a new paradigm that addresses issues such as mobility management, load management, route policies, link discovery, and access selection in traditional WiFi networks. Due to the rapid growth of wireless devices, uneven load distribution among the network resources still remains a challenging issue in SD-WiFi. In this paper, we design a novel four-tier software defined WiFi edge architecture (FT-SDWE) to manage load imbalance through an improved handover mechanism, enhanced authentication technique, and upgraded migration approach. In the first tier, the handover mechanism is improved by using a simple AND operator and by shifting the association control to WAPs. Unauthorized user load is mitigated in the second tier, with the help of base stations (BSs) which act as edge nodes (ENs), using elliptic ElGamal digital signature algorithm (EEDSA). In the third tier, the load is balanced in the data plane among the OpenFlow enabled switches by using the whale optimization algorithm (WOA). Moreover, the load in the fourth tier is balanced among the multiple controllers. The global controller (GC) predicts the load states of local controllers (LCs) from the Markov chain model (MCM) and allocates packets to LCs for processing through a binary search tree (BST). The performance evaluation of FT-SDWE is demonstrated using extensive OMNeT++ simulations. The proposed framework shows effectiveness in terms of bandwidth, jitter, response time, throughput, and migration time in comparison to SD-WiFi, EASM, GAME-SM, and load information strategy schemes. [ABSTRACT FROM AUTHOR]

For systems of nonlinear equations, a modified efficient Levenberg–Marquardt method with new LM parameters was developed by Amini et al. (2018). The convergence of the method was proved under the local error bound condition. In order to enhance this method, using nonmonotone technique, we propose a new Levenberg–Marquardt parameter in this paper. The convergence of the new Levenberg–Marquardt method is shown to be at least superlinear, and numerical experiments show that the new Levenberg–Marquardt algorithm can solve systems of nonlinear equations effectively. [ABSTRACT FROM AUTHOR]

Ship deck arrangement design is about determining the positions and dimensions of arranged objects. This paper presents the mathematical model for the ship deck arrangement optimization problem statement and how the individual's objective and constraint functions are computed. Moreover, an improved multiobjective hybrid genetic algorithm is redesigned to solve this complex nondeterministic problem and generate a set of diverse and rational deck arrangements in the early stage of ship design. An adaptive crossover operator and a novel topological replace operator invoked in this algorithm are described. Finally, the proposed algorithm is tested on a main deck arrangement optimization of an underwater detection ship. In the validation tests, the proposed algorithm is compared to the standard NSGA-II to determine its ability to produce a set of diverse and rational deck arrangements. Subsequently, the performance tests are used to determine the ability of the algorithm to work with the highly constrained arrangement problems and the efficiency of the adaptive crossover and topological replace operators. [ABSTRACT FROM AUTHOR]

This paper combines system identification, direct data-driven control, and optimization algorithm to design two controllers for one cascade control system, that is, the inner controller and the outer controller. More specifically, when these two controllers in the cascade control system are parameterized by two unknown parameter vectors, respectively, the problem of controller design is changed to parameter identification. To avoid the modeling process for the unknown plants in the cascade control system, a direct data-driven control scheme is proposed to identify those two parameter vectors through minimizing two optimization problems, which do not need any knowledge of the unknown plants. Furthermore, the detailed first-order gradient algorithm is applied to solve our constructed optimization problems, and its convergence property is also analyzed. To extend the above idea to design a nonlinear controller in the cascade control system, a direct data-driven scheme is proposed to get one optimal nonlinear controller, by using some spectral knowledge. Finally, one simulation example of flight simulation is used to prove the efficiency of our proposed direct data-driven control for the cascade control system. [ABSTRACT FROM AUTHOR]

Failure mode and effect analysis (FMEA) is a systematic activity in the stage of product design and process design. However, the traditional FMEA has some shortcomings in practical application, such as too many evaluation languages, uncertain weights of influencing factors, and uncertain weights of evaluation members. This paper presents an FMEA evaluation method in manufacturing system based on similarity measure, nonlinear programming model, and intuitionistic fuzzy number (IFN). Firstly, the IFN is used to evaluate failure mode, which overcomes the defect of traditional FMEA evaluation value. Secondly, the weight of failure evaluation team members is solved according to the concept of similarity measure to make up for the blank of evaluation members' weight aiming at the shortage of unknown weight. Then, the definition of consensus measure is introduced to make the evaluators reach a consensus, and the weights of influencing factors of failure modes (FMs) are calculated. Finally, the weights of evaluators and influencing factors are calculated by IFN algorithm and score function, and the score value of each FM is obtained to rank instead of risk priority number (RPN). The objectivity and practicability of the new method are verified by the example of failure mode for an attractive electromagnet manufacturing system. [ABSTRACT FROM AUTHOR]

In order to optimize the existing control subarea division methods, a new dynamic subarea division method based on node importance evaluating is proposed for regional coordinated control. Firstly, considering the characteristics of road network and traffic flow between adjacent intersections, correlation degree model is established by calculating the correlation coefficients of traffic flow, signal cycle, and traffic state. Then, road traffic network is abstracted into a network topology structure graph. From the global perspective of the road network, intersection position information and the importance contribution between adjacent intersections are taken into account, and the correlation degrees between adjacent intersections are taken as the edge weights to construct intersection importance evaluation matrix. Finally, an actual road network is selected, and an improved Newman algorithm is employed to verify and analyze the method proposed in this paper. Results show that, compared with other methods, the control subarea division result of the new proposed method is more elaborate and more in line with the actual traffic flow characteristics. Moreover, dynamic subarea division can be realized according to the traffic characteristics of different periods, which can provide a good basis for the formulation of the signal control schemes in the next stage. [ABSTRACT FROM AUTHOR]

In this paper, a new type of modified Smith predictor based on the H 2 and predictive PI control strategy is proposed. The modified Smith predictor not only has H 2 robust performance but also has a similar predictive PI control structure. By introducing a time delay term, the modified Smith predictor controller overcomes the shortcoming that the conventional control algorithm can only use the low-order approximation of time delay term to design the control algorithm. The modified Smith predictor controller's output is related to the current system error and related to the output in a period before the controller. Simultaneously, the modified Smith predictor controller is applied to conventional process systems based on dynamic optimization estimation in the case study to show absolute superiority over the nonpredictive control method (such as the classical PID control method). [ABSTRACT FROM AUTHOR]

Cubature Kalman filter phase unwrapping (CKFPU) is an effective algorithm in unwrapping the interferograms. The local phase slope estimation is a key factor that affects the unwrapped accuracy. However, the estimation accuracy of local phase slop is relatively low in high noisy and dense stripes areas, which usually leads to the unsatisfactory unwrapped results. In order to effectively solve this issue, the rewrapped map of the unwrapped phase (obtained by CKFPU algorithm), which is a filtered interferogram with clearer fringes and more detailed information, is proposed in this paper to improve the phase slope estimation. In order to solve the problem of imprecise error variance for the new phase slope estimation, an adaptive factor is introduced into the CKFPU algorithm to increase the stability and reliability of the phase unwrapping algorithm. The proposed method is compared with the standard CKFPU algorithm using both simulated and real data. The experimental results validate the feasibility and superiority of the proposed method for processing those high noise dense fringe interferograms. [ABSTRACT FROM AUTHOR]

With the evolution of smart cities, images are used in a wide range of services such as smart healthcare and surveillance. How to ensure that images are transmitted and shared securely is of paramount importance for smart cities. To this end, a secure and efficient scheme for image transmission is proposed in this paper, which uses sparse signal transformation (SST) and parallel compressive sensing (CS). The primary employed techniques are sparse signal transformation (SST), parallel CS, and diffusion-permutation operation. The compression performance is achieved by parallel CS, whereas the encryption performance is derived from SST, parallel CS, and diffusion-permutation procedure. SST is exploited to change energy information before CS sampling and incorporated into diffusion-permutation framework, which not only balances the security and the efficiency of the algorithm, but also improves the transmission efficiency of the cipher image. We introduce chaotic system to generate the measurement matrix, SST matrix, and diffusion matrix to improve security. Furthermore, numerical simulation results and theoretical analyses confirm the security performances and effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

Direct position determination (DPD) for augmented coprime arrays is investigated in this paper. Augmented coprime array expands degree of freedom and array aperture and improves positioning accuracy. Because of poor stability and noise sensitivity of the subspace data fusion (SDF) method, we propose two weighted subspace data fusion (W-SDF) algorithms for direct position determination. Simulation results show that two W-SDF algorithms have a prominent promotion in positioning accuracy than SDF, Capon, and propagator method (PM) algorithm for augmented coprime arrays. SDF based on optimal weighting (OW-SDF) is slightly better than SDF based on SNR weighting (SW-SDF) in positioning accuracy. The performance for DPD of the W-SDF method with augmented coprime arrays is better than that of the W-SDF method with uniform arrays. [ABSTRACT FROM AUTHOR]

In order to find the optimal path for emergency evacuation, this paper proposes a dynamic path optimization algorithm based on real-time information to search the optimal path and it takes fire accident as an example to introduce the algorithm principle. Before the accidents, it uses the Dijkstra algorithm to get the prior evacuation network which includes evacuation paths from each node to the exit port. When the accidents occur, the evacuees are unable to pass through the passage where the accident point and the blocking point are located, then the proposed method uses the breadth-first search strategy to solve the path optimization problem based on the prior evacuation network, and it dynamically updates the evacuation path according to the real-time information. Because the prior evacuation network includes global optimal evacuation paths from each node to the exit port, the breadth-first search algorithm only searches local optimal paths to avoid the blockage node or dangerous area. Because the online optimization solves a local pathfinding problem and the entire topology optimization is an offline calculation, the proposed method can find the optimal path in a short time when the accident situation changes. The simulation tests the performances of the proposed algorithm with different situations based on the topology of a building, and the results show that the proposed algorithm is effective to get the optimal path in a short time when it faces changes caused by the factors such as evacuee size, people distribution, blockage location, and accident points. [ABSTRACT FROM AUTHOR]

Localization is one of the essential problems in the Internet of Things (IoT) and other wireless sensor applications. Most traditional range-free localization algorithms ignore the anisotropy factors, which are frequently observed in wireless sensor networks (WSNs) and result in low positioning precision. To mitigate the impact of anisotropy on localization, this paper proposes an extended area multihop node localization method. The proposed method classifies and discusses the boundaries of the concave area within the communication range of the node and then uses the maximum split communication distance of the node to identify and mark the boundary of the concave area. When the shortest communication path between the nodes is affected by the concave area, the boundary of the concave area is expanded to obtain the new shortest communication path, and the node distance is obtained by comparing the changes in the communication path. After a large number of simulation tests, it is shown that the calculation accuracy of this scheme is better than that of similar modern mainstream localization algorithms. [ABSTRACT FROM AUTHOR]

In the compressed sensing (CS) reconstruction algorithms, the problems of overestimation and large redundancy of candidate atoms will affect the reconstruction accuracy and probability of the algorithm when using Sparsity Adaptive Matching Pursuit (SAMP) algorithm. In this paper, we propose an improved SAMP algorithm based on a double threshold, candidate set reduction, and adaptive backtracking methods. The algorithm uses the double threshold variable step-size method to improve the accuracy of sparsity judgment and reduces the undetermined atomic candidate set in the small step stage to enhance the stability. At the same time, the sparsity estimation accuracy can be improved by combining with the backtracking method. We use a Gaussian sparse signal and a measured shock wave signal of the 15psi range sensor to verify the algorithm performance. The experimental results show that, compared with other iterative greedy algorithms, the overall stability of the DBCSAMP algorithm is the strongest. Compared with the SAMP algorithm, the estimated sparsity of the DBCSAMP algorithm is more accurate, and the reconstruction accuracy and operational efficiency of the DBCSAMP algorithm are greatly improved. [ABSTRACT FROM AUTHOR]

In this paper, the ant colony optimization (ACO) method is used to identify the parameters of a 3-DOF nonlinear vessel model. Identifying the parameters is abstracted as a nonlinear optimization problem to solve through the ant colony optimization algorithm. The identification procedure is divided into two parts. The first part of the identification procedure is to identify the parameters related to surge motion. The second part of the identification procedure is to identify the rest parameters of the vessel's kinetics model. In the surge model identification procedure, the transient motor speed is used to generate the training data, and in the sway and yaw motion identification procedure, the zigzag maneuvering with different motor speeds is used to generate the training data. All the parameters are identified by the ACO method and the least-square (LS) method based on the training data and then validated on the validation data. The prediction performance of parameters identified by different methods is compared in the simulation to demonstrate the effectiveness of the ACO algorithm. [ABSTRACT FROM AUTHOR]

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes' selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they select the head nodes without taking the resources of the nodes. Still, there is a need for the candidate node which can be selected as a head node in case of head node failure. Therefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA). In our proposed method, there are three modules, i.e., initial population generation, head node selection, and candidate node selection. In the first module, we generate the initial population by randomly mapping the task on different servers using a scheduling algorithm. After that, we compute the overall cost and the cost of each node based on resources. In the second module, the best optimal nodes are selected as a head node by applying the genetic operations such as crossover, mutation, and fitness function by considering the available resources. In the selected optimal nodes, one node is chosen as a head node and the other is considered as a candidate node. In the third module, the candidate node becomes the head node in the case of head node failure. The proposed method HNSA is compared against the state-of-the-art algorithms such as Bees Life Algorithm (BLA) and Heterogeneous Earliest Finished Time (HEFT). The simulation analysis shows that the proposed HNSA technique performs better in terms of execution time, memory utilization, service level sgreement (SLA) violation, and energy consumption. [ABSTRACT FROM AUTHOR]

The number of phase wraps that result from the carrier component can be completely eliminated or reduced by first applying a fast Fourier transform (FFT) to the image and then shifting the spectrum to the origin. However, because the spectrum can only be shifted by an integer number, the phase wraps of the carrier component cannot be completely reduced. In this paper, an improved carrier frequency-shifting algorithm based on 2-FFT for phase wrap reduction is proposed which allows the spectrum to be shifted by a rational number. Firstly, the phase wraps are reduced by the conventional FFT frequency shift method. Secondly, the wrapped phase with residual carrier components is filtered and magnified sequentially; the amplified phase is transformed into the frequency domain using an FFT, and then, the wrapped phase with the residual carrier components can be further reduced by shifting the spectrum by a rational number. Simulations and experiments were conducted to validate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Aiming at the inherent problems of swarm intelligence algorithm, such as falling into local extremum in early stage and low precision in later stage, this paper proposes an improved sparrow search algorithm (ISSA). Firstly, we introduce the idea of flight behavior in the bird swarm algorithm into SSA to keep the diversity of the population and reduce the probability of falling into local optimum; Secondly, we creatively introduce the idea of crossover and mutation in genetic algorithm into SSA to get better next-generation population. These two improvements not only keep the diversity of the population at all times but also make up for the defect that the sparrow search algorithm is easy to fall into local optimum at the end of the iteration. The optimization ability of the improved SSA is greatly improved. [ABSTRACT FROM AUTHOR]

With the continuous development of neural network theory itself and related theories and related technologies, neural network is one of the main branches of intelligent control technology. Artificial neural network is a nonlinear and adaptive information processing composed of a large number of processing units. In this paper, an adaptive fuzzy neural network (FNN) is used to construct an intelligent system architecture for English learning, and activation function is used to apply the knowledge of computer science and linguistics to English learning. The network neural structure diagram is presented. English machine learning model framework is established based on recursive neural network. On this basis, feature vector extraction and normalization algorithm are used to meet the needs of neural network model. After acquiring the feature vectors of users' learning styles, the clustering algorithm is used to effectively form a variety of learning styles. The validity of the English learning model was verified by designing the functional flow based on tests. Accurate mastery can activate the corresponding brain regions not only to improve the efficiency of learning, but also to better facilitate language learning. [ABSTRACT FROM AUTHOR]

In this paper, we study the multiobjective game in a multiconflict situation. First, the feasible strategy set and synthetic strategy space are constructed in the multiconflict situation. Meanwhile, the value of payoff function under multiobjective is determined, and an integrated multiobjective game model is established in a multiconflict situation. Second, the multiobjective game model is transformed into the single-objective game model by the Entropy Weight Method. Then, in order to solve this multiobjective game, an adaptive differential evolution algorithm based on simulated annealing (ADESA) is proposed to solve this game, which is to improve the mutation factor and crossover operator of the differential evolution (DE) algorithm adaptively, and the Metropolis rule with probability mutation ability of the simulated annealing (SA) algorithm is used. Finally, the practicability and effectiveness of the algorithm are illustrated by a military example. [ABSTRACT FROM AUTHOR]

Aiming at the problem that stereo matching accuracy is easily affected by noise and amplitude distortion, a stereo matching algorithm based on HSV color space and improved census transform is proposed. In the cost calculation stage, the color image is first converted from RGB space to HSV space; moreover, the hue channel is used as the matching primitive to establish the hue absolute difference (HAD) cost calculation function, which reduces the amount of calculation and enhances the robustness of matching. Then, to solve the problem of the traditional census transform overrelying on the central pixel and to improve the noise resistance of the algorithm, an improved census method based on neighborhood weighting is also proposed. Finally, the HAD cost and the improved census cost are nonlinearly fused as the initial cost. In the aggregation stage, an outlier elimination method based on confidence interval is proposed. By calculating the confidence interval of the aggregation window, this paper eliminates the cost value that is not in the confidence interval and subsequently filters as well as aggregates the remaining costs to further reduce the noise interference and improve the matching accuracy. Experiments show that the proposed method can not only effectively suppress the influence of noise, but also achieve a more robust matching effect in scenes with changing exposure and lighting conditions. [ABSTRACT FROM AUTHOR]

Direct position determination (DPD) for augmented coprime arrays is investigated in this paper. Augmented coprime array expands degree of freedom and array aperture and improves positioning accuracy. Because of poor stability and noise sensitivity of the subspace data fusion (SDF) method, we propose two weighted subspace data fusion (W-SDF) algorithms for direct position determination. Simulation results show that two W-SDF algorithms have a prominent promotion in positioning accuracy than SDF, Capon, and propagator method (PM) algorithm for augmented coprime arrays. SDF based on optimal weighting (OW-SDF) is slightly better than SDF based on SNR weighting (SW-SDF) in positioning accuracy. The performance for DPD of the W-SDF method with augmented coprime arrays is better than that of the W-SDF method with uniform arrays. [ABSTRACT FROM AUTHOR]

Recent works on the multilinear system A x m − 1 = b with an order- m and dimension- n tensor A and a vector b of dimension- n have been motivated by their applications in data mining, numerical PDEs, tensor complementary problems, and so on. In this paper, we propose an alternating minimization method for the solution of the system mentioned above and present several randomized versions of this algorithm in order to improve its performance. The provided numerical experiments show that our methods are feasible for any tensor A and outperform some existing ones in the same case. [ABSTRACT FROM AUTHOR]

There are many research studies in the field of breast cancer prediction, but it has been observed that the time taken for prediction needs to be reduced. The problem in the existing research is space consumption by graphical content. The proposed research is supposed to minimize the prediction time and space consumption. In this paper, research has focused on the study of existing breast cancer research and techniques and eliminating their limitation. It has been observed that when the number of datasets increases, every comparison makes a huge gap in size and comparison time. This research proposes a methodology for breast cancer prediction using an edge-based CNN (convolutional neural network) algorithm. The elimination of useless content from the graphical image before applying CNN has reduced the time consumption along with space consumption. The edge detection mechanism would retail only edges from the image sample in order to detect the pattern to predict breast cancer. The proposed work is supposed to implement the proposed methodology. A comparison of the proposed methodology and algorithm with the existing algorithm is made during simulation. The proposed work is found to be more efficient compared to the existing techniques used in breast cancer prediction. The utilization of proposed in the work area of medical science is supposed to enhance the capability in case of CNN at the time of decision-making. The proposed work is supposed to be more accurate compared to the existing works. It has been observed that the proposed work is fourteen to fifteen percent more accurate. It is taking 9/4 times less space and 1.0849004/0.178971 times less time compared to the general CNN model. Accuracy might vary as per size of the image and alteration performed in dataset of the image. [ABSTRACT FROM AUTHOR]

In this paper, by inserting the logarithm cost function of the normalized subband adaptive filter algorithm with the step-size scaler (SSS-NSAF) into the sigmoid function structure, the proposed sigmoid-function-based SSS-NSAF algorithm yields improved robustness against impulsive interferences and lower steady-state error. In order to identify sparse impulse response further, a series of sparsity-aware algorithms, including the sigmoid L0 norm constraint SSS-NSAF (SL0-SSS-NSAF), sigmoid step-size scaler improved proportionate NSAF (S-SSS-IPNSAF), and sigmoid L0 norm constraint step-size scaler improved proportionate NSAF (SL0-SSS-IPNSAF), is derived by inserting the logarithm cost function into the sigmoid function structure as well as the L0 norm of the weight coefficient vector to act as a new cost function. Since the use of the fix step size in the proposed SL0-SSS-IPNSAF algorithm, it needs to make a trade-off between fast convergence rate and low steady-state error. Thus, the convex combination version of the SL0-SSS-IPNSAF (CSL0-SSS-IPNSAF) algorithm is proposed. Simulations in acoustic echo cancellation (AEC) scenario have justified the improved performance of these proposed algorithms in impulsive interference environments and even in the impulsive interference-free condition. [ABSTRACT FROM AUTHOR]

This paper analyzes the transverse vibration laws of 5000 m ladder-shaped mining pipe under different towing velocities and accelerations in the ocean, thinking of the pipe as the beam model, discretized based on the FEM. The algorithm is used to solve the problem to obtain the transverse vibration law. The research shows that the mining pipe overall transverse vibration trend decreases first and then increases, the minimum vibration value occurs at 3000 m, and the maximum occurs at the top. Increasing the towing velocity, acceleration, and ore bin weight will increase the transverse vibration value. The vibration intensity produced by the same acceleration in the constant acceleration and deceleration stages is different, and the damping effect after adding the same damping is also different. In the range of 0.01 m/s2–0.1 m/s2, the vibration reduction effect after adding damping in the constant deceleration stage is more significant, and in the range of 0.1 m/s2-0.2 m/s2, the vibration reduction effect after adding damping in the constant acceleration stage is more significant. In the stage of the constant acceleration or deceleration, when adding the same damping, the vibration intensity generated by the large acceleration is still far greater than the vibration intensity generated by the small acceleration, so the mining ship should keep the small acceleration for towing motion. [ABSTRACT FROM AUTHOR]

This paper focuses on the MANN-based intelligent adaptive fault tolerant control for a class of launch vehicles. Firstly, the attitude dynamic model of the launch vehicles suffering from the actuator faults and disturbances has been formulated. Secondly, the second-order disturbance observer has been designed for the launch vehicle to achieve the exact estimation and compensation of the time-varying disturbances. Meanwhile, the MANN has been introduced as online approximator, suppressing the adverse influence of the unknown nonlinearities. Moreover, several adaptive laws have been proposed to achieve the quick response to the actuator faults and the update of the MANN weights. As a result, the MANN-based intelligent adaptive fault tolerant control structure has been constructed for the launch vehicles. It has been proven that all the signals in the closed-loop system are bounded. Simulation results demonstrate the desired performance and the advantages of the proposed control algorithm. [ABSTRACT FROM AUTHOR]

Research on rice (Oryza sativa) roots demands the automatic analysis of root architecture during image processing. It is challenging for a digital filter to identify the roots from the obscure and cluttered background. The original Frangi algorithm, presented by Alejandro F. Frangi in 1998, is a successful low-pass filter dedicated to blood vessel image enhancement. Considering the similarity between vessels and roots, the Frangi filter algorithm is applied to outline the roots. However, the original Frangi only enhances the tube-like primary roots but erases the lateral roots during filtering. In this paper, an improved Frangi filtering algorithm (IFFA), designed for plant roots, is proposed. Firstly, an automatic root phenotyping system is designed to fulfill the high-throughput root image acquisition. Secondly, multilevel image thresholding, connected components labeling, and width correction are used to optimize the output binary image. Thirdly, to enhance the local structure, the Gaussian filtering operator in the original Frangi is redesigned with a truncated Gaussian kernel, resulting in more discernible lateral roots. Compared to the original Frangi filter and commercially available software, IFFA is faster and more accurate, achieving a pixel accuracy of 97.48%. IFFA is an effective morphological filtering approach to enhance the roots of rice for segmentation and further biological research. It is convincing that IFFA is suitable for different 2-D plant root image processing and morphological analysis. [ABSTRACT FROM AUTHOR]

In this paper, a modified model of Nondominated Sorting Genetic Algorithm 2 (NSGA-II), which is one of the Multiobjective Evolutionary Algorithms, is proposed. This algorithm is a new model designed to make a trade-off between minimizing the cost of preventive maintenance (PM) and minimizing the time taken to perform this maintenance for a series-parallel system. In this model, the limitations of labor and equipment of the maintenance team and the effects of maintenance issues on manufacturing problems are also considered. In the mathematical model, finding the appropriate objective functions for the maintenance scheduling problem requires all maintenance costs and failure rates to be integrated. Additionally, the effects of production interruption during preventive maintenance are added to objective functions. Furthermore, to make a better performance compared with a regular NSGA-II algorithm, we proposed a modified algorithm with a repository to keep more unacceptable solutions. These solutions can be modified and changed with the proposed mutation algorithm to acceptable solutions. In this algorithm, modified operators, such as simulated binary crossover and polynomial mutation, will improve the algorithm to generate convergence and uniformly distributed solutions with more diverse solutions. Finally, by comparing the experimental solutions with the solutions of two Strength Pareto Evolutionary Algorithm 2 (SPEA2) and regular NSGA-II, MNSGA-II generates more efficient and uniform solutions than the other two algorithms. [ABSTRACT FROM AUTHOR]

Large-scale social graph data poses significant challenges for social analytic tools to monitor and analyze social networks. The information-theoretic distance measure, namely, resistance distance, is a vital parameter for ranking influential nodes or community detection. The superiority of resistance distance and Kirchhoff index is that it can reflect the global properties of the graph fairly, and they are widely used in assessment of graph connectivity and robustness. There are various measures of network criticality which have been investigated for underlying networks, while little is known about the corresponding metrics for mixed networks. In this paper, we propose the positive walk algorithm to construct the Hermitian matrix for the mixed graph and then introduce the Hermitian resistance matrix and the Hermitian Kirchhoff index which are based on the eigenvalues and eigenvectors of the Hermitian Laplacian matrix. Meanwhile, we also propose a modified algorithm, the directed traversal algorithm, to select the edges whose removal will maximize the Hermitian Kirchhoff index in the general mixed graph. Finally, we compare the results with the algebraic connectivity to verify the superiority of the proposed strategy. [ABSTRACT FROM AUTHOR]

In the high-accuracy control of an AC machine, the knowledge of pure system parameters, with no deviation in drive coefficients and no disturbance or other nonlinear components, is a difficult issue for operators, even though it is occasionally nonviable. To overcome these troubles, this paper introduces a robust adaptation strategy based on pseudo fuzzy logic and sliding mode control (PFSMC) for an AC servo drive subject to uncertainties and/or external disturbance. Owing to the robustness of the SMC technique, the reduced sensitivity to uncertainties, and the enhanced resistance to disturbances from the pseudo fuzzy mechanism, this control algorithm can guarantee not only system stability but also the improvement of tracking errors in the steady state. To validate the design efficiency of PFSMC, both simulation and laboratory tests of the proposed scheme and a conventional PID scheme were performed to compare them as follows. In a computer environment, test cases with and without certainties were implemented with two controllers to visualize the comparative responses. Then, the two control methods were integrated into a real-world hardware platform to acquire practical outcomes. From these results, it can be noted that our successful approach showed a feasible, effective, and robust performance in AC drive. [ABSTRACT FROM AUTHOR]

The efficiency of data-intensive applications in distributed environments such as Cloud, Fog, and Grid is directly related to data access delay. Delays caused by queue workload and delays caused by failure can decrease data access efficiency. Data replication is a critical technique in reducing access latency. In this paper, a fuzzy-based replication algorithm is proposed, which avoids the mentioned imposed delays by considering a comprehensive set of significant parameters to improve performance. The proposed algorithm selects the appropriate replica using a hierarchical method, taking into account the transmission cost, queue delay, and failure probability. The algorithm determines the best place for replication using a fuzzy inference system considering the queue workload, number of accesses in the future, last access time, and communication capacity. It uses the Simple Exponential Smoothing method to predict future file popularity. The OptorSim simulator evaluates the proposed algorithm in different access patterns. The results show that the algorithm improves performance in terms of the number of replications, the percentage of storage filled, and the mean job execution time. The proposed algorithm has the highest efficiency in random access patterns, especially random Zipf access patterns. It also has good performance when the number of jobs and file size are increased. [ABSTRACT FROM AUTHOR]

With the development of smart manufacturing, quality has become an indispensable issue in the manufacturing process. Although there is increasing publication about inspection allocation problems, inspection allocation optimization research considering resource capability is scarce. This paper focuses on the inspection allocation problem with resource constraints in the flexible manufacturing system. Combined with the inspection resource capability model, a bi-objective model is developed to minimize the cost and balance loads of the inspection station. A modified NSGA-II algorithm with adaptive mutation operators is suggested to deal with the proposed model. Finally, a simulation experiment is conducted to test the performance of the modified algorithm and the results demonstrate that modified NSGA-II can obtain acceptable inspection solutions. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet and the rapid development of big data analysis technology, data mining has played a positive role in promoting industry and academia. Classification is an important problem in data mining. This paper explores the background and theory of support vector machines (SVM) in data mining classification algorithms and analyzes and summarizes the research status of various improved methods of SVM. According to the scale and characteristics of the data, different solution spaces are selected, and the solution of the dual problem is transformed into the classification surface of the original space to improve the algorithm speed. Research Process. Incorporating fuzzy membership into multicore learning, it is found that the time complexity of the original problem is determined by the dimension, and the time complexity of the dual problem is determined by the quantity, and the dimension and quantity constitute the scale of the data, so it can be based on the scale of the data Features Choose different solution spaces. The algorithm speed can be improved by transforming the solution of the dual problem into the classification surface of the original space. Conclusion. By improving the calculation rate of traditional machine learning algorithms, it is concluded that the accuracy of the fitting prediction between the predicted data and the actual value is as high as 98%, which can make the traditional machine learning algorithm meet the requirements of the big data era. It can be widely used in the context of big data. [ABSTRACT FROM AUTHOR]

The conventional matrix completion (MC) regularizes each singular value equally, and thus the rank cannot be well approximated, which greatly limits the flexibility and accuracy of MC usage. In this paper, a truncated MC algorithm using prior information to determine the threshold while generating the target rank is proposed for the wind turbine clutter suppression of weather radar. During the singular value shrinking process, an appropriate threshold is selected to obtain the optimal approximation of the sampling matrix. Specifically, the mean value of the diagonal element in the recovered weather matrix is calculated to improve the robustness of the recovery result effectively. Simulation results demonstrate that the proposed algorithm reduces the computational complexity as well as further improves the MC accuracy and realizes the effective suppression of the wind turbine clutter. [ABSTRACT FROM AUTHOR]

In this paper, we consider a Robin problem for a viscoelastic wave equation. First, by the high-order iterative method coupled with the Galerkin method, the existence of a recurrent sequence via an N -order iterative scheme is established, and then the N -order convergent rate of the obtained sequence to the unique weak solution of the proposed model is also proved. Next, with N = 2 , a numerical algorithm given by the finite-difference method is constructed to approximate the solution via the 2-order iterative scheme. Moreover, the same algorithm for the single-iterative scheme generated by the 2-order iterative scheme is also considered. Finally, comparison with errors of the numerical solutions obtained by the single-iterative scheme and the 2-order iterative scheme shows that the convergent rate of the 2-order iterative scheme is faster than that of the single-iterative scheme. [ABSTRACT FROM AUTHOR]

Cloud computing is the most prominent established framework; it offers access to resources and services based on large-scale distributed processing. An intensive management system is required for the cloud environment, and it should gather information about all phases of task processing and ensuring fair resource provisioning through the levels of Quality of Service (QoS). Virtual machine allocation is a major issue in the cloud environment that contributes to energy consumption and asset utilization in distributed cloud computing. Subsequently, in this paper, a multiobjective Emperor Penguin Optimization (EPO) algorithm is proposed to allocate the virtual machines with power utilization in a heterogeneous cloud environment. The proposed method is analyzed to make it suitable for virtual machines in the data center through Binary Gravity Search Algorithm (BGSA), Ant Colony Optimization (ACO), and Particle Swarm Optimization (PSO). To compare with other strategies, EPO is energy-efficient and there are significant differences. The results of the proposed system have been evaluated through the JAVA simulation platform. The exploratory outcome presents that the proposed EPO-based system is very effective in limiting energy consumption, SLA violation (SLAV), and enlarging QoS requirements for giving capable cloud service. [ABSTRACT FROM AUTHOR]

First, this paper presents the algorithm of adaptively regularized kernel-based fuzzy C-means based on membership constraint (G-ARKFCM). Under the idea of competitive learning based on penalizing opponents, a new membership constraint function penalty item is introduced for each sample point in the segmented image, so that the ARKFCM algorithm is no longer limited to the fuzzy index m = 2. Secondly, the multiplicative intrinsic component optimization (MICO) is introduced into G-ARKFCM to obtain the GM-ARKFCM algorithm, which can correct the bias field when segmenting neonatal HIE images. Compared with other algorithms, the GM-ARKFCM algorithm has better segmentation quality and robustness. The GM-ARKFCM algorithm can more completely segment the neonatal ventricles and surrounding white matter and can retain more information of the original image. [ABSTRACT FROM AUTHOR]

In this paper, we propose an accelerated proximal point algorithm for the difference of convex (DC) optimization problem by combining the extrapolation technique with the proximal difference of convex algorithm. By making full use of the special structure of DC decomposition and the information of stepsize, we prove that the proposed algorithm converges at rate of O 1 / k 2 under milder conditions. The given numerical experiments show the superiority of the proposed algorithm to some existing algorithms. [ABSTRACT FROM AUTHOR]

The vehicle detection algorithm is an important part of the intelligent transportation system. The accuracy of the algorithm will determine whether accurate vehicle information can be obtained. The system contains several functional modules, including signal amplification, wireless communication, A/D converter, and sensor set/reset functions. To detect all the intersection vehicles, a number of magnetoresistive sensors are connected to the computer system through the wireless communication module, and then, the detected vehicle information will be transferred back to the master host computer. In this paper, two common vehicle detection algorithms, fixed threshold algorithm and adaptive threshold algorithm, were analyzed in the vehicle detection system with magnetoresistive sensors, simultaneously. Finally, an improved multi-intermediate state machine algorithm for vehicle detection was proposed. Using the intermediate state, this algorithm cannot only detect when the vehicle enters the detection area but also decide whether the vehicle leaves the sensor node or not. In this way, it improves the detection accuracy. [ABSTRACT FROM AUTHOR]

Electrical load forecasting plays a key role in power system planning and operation procedures. So far, a variety of techniques have been employed for electrical load forecasting. Meanwhile, neural-network-based methods led to fewer prediction errors due to their ability to adapt properly to the consuming load's hidden characteristic. Therefore, these methods were widely accepted by the researchers. As the parameters of the neural network have a significant impact on its performance, in this paper, a short-term electrical load forecasting method using neural network and particle swarm optimization (PSO) algorithm is proposed, in which some neural network parameters including learning rate and number of hidden layers are determined in order to forecast electrical load using the PSO algorithm precisely. Then, the neural network with these optimized parameters is used to predict the short-term electrical load. In this method, a three-layer feedforward neural network trained by backpropagation algorithm is used beside an improved gbest PSO algorithm. Also, the neural network prediction error is defined as the PSO algorithm cost function. The proposed approach has been tested on the Iranian power grid using MATLAB software. The average of three indices beside graphical results has been considered to evaluate the performance of the proposed method. The simulation results reflect the capabilities of the proposed method in accurately predicting the electrical load. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the model-based State of Charge (SOC) estimation method is too dependent on the model parameters in the SOC estimation of electric vehicles, an improved genetic algorithm is proposed in this paper. The method has the advantages of being able to quickly determine the search range, reducing the probability of falling into local optimum, and having high recognition accuracy. Then we can realize online dynamic identification of power battery model parameters and improve the accuracy of model parameter identification. In addition, considering the complex application environment and operating conditions of electric vehicles, an SOC estimation method based on improved genetic algorithm and unscented particle filter (improved GA-UPF) is proposed. And we compare the improved GA-UPF algorithm with the least square unscented particle filter (LS-UPF) and improved GA unscented Kalman filter (improved GA-UKF) algorithm. The comparison results show that the improved GA-UPF algorithm proposed in this paper has higher estimation accuracy and better stability. It also reflects the practicability and accuracy of the improved GA parameter identification algorithm proposed in this paper. [ABSTRACT FROM AUTHOR]

A variety of open relation extraction systems have been developed in the last decade. And deep learning, especially with attention model, has gained much success in the task of relation classification. Nevertheless, there is, yet, no research reported on classifying open relation tuples to our knowledge. In this paper, we propose a novel semieager learning algorithm (SemiE) to tackle the problem of open relation classification. Different from the eager learning approaches (e.g., ANNs) and the lazy learning approaches (e.g., kNN), the SemiE offers the benefits of both categories of learning scheme, with its significantly lower computational cost (O(n)). This algorithm can also be employed in other classification tasks. Additionally, this paper presents an adapted attention model to transform relation phrases into vectors by using word embedding. The experimental results on two benchmark datasets show that our method outperforms the state-of-the-art methods in the task of open relation classification. [ABSTRACT FROM AUTHOR]

Management of electric equipment has a direct impact on companies’ performance and profitability. Considering the critical role that electric power materials play in supporting maintenance operations and preventing equipment failure, it is essential to maintain an inventory to a reasonable level. However, a majority of these electric power materials exhibit an intermittent demand pattern characterized by random arrivals interspersed with time periods with no demand at all. These characteristics cause additional difficulty for companies in managing these electric power material inventories. In response to the above problem, this paper, based on the electric power material demand data of Shanghai Electric Power Company, develops a new method to determine the optimal order quantity Q⁎ in a cost-oriented periodic review (T,Q) system, whereby unsatisfied demands are backordered and demand follows a compound Erlang distribution. Q⁎corresponds to the value of Q that gives the minimum expected total inventory holding and backordering cost. Subsequently, an empirical investigation is conducted to compare this method with the Newsvendor model. Results verify its superiority in cost savings. Ultimately, considering the complicated calculation and low efficiency of that algorithm, this paper proposes an approximation and a heuristic algorithm which have a higher level of utility in a real industrial context. The approximation algorithm simplifies the calculation process by reducing iterative times while the heuristic algorithm achieves it by generalizing the relationship between the optimal order quantity Q⁎ and mean demand interarrival rate λ. [ABSTRACT FROM AUTHOR]