In this paper,we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations.Unver suitable conditions,we get the global conv...In this paper,we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations.Unver suitable conditions,we get the global convergence on the algorithms.Some numerical results are also reported.展开更多
In order to optimize the transitional time during the successive exposure scans for a step-and-scanlithography and improve the productivity in a wafer production process,an investigation of the motion tra-jectory plan...In order to optimize the transitional time during the successive exposure scans for a step-and-scanlithography and improve the productivity in a wafer production process,an investigation of the motion tra-jectory planning along the scanning direction for wafer stage was carried out.The motions of wafer stagewere divided into two respective logical moves(i.e.step-move and scan-move)and the multi-motion-overlap algorithms(MMOA)were presented for optimizing the transitional time between the successive ex-posure scans.The conventional motion planning method,the Hazehon method and the MMOA were ana-lyzed theoretically and simulated using MATLAB under four different exposure field sizes.The resultsshow that the total time between two successive scans consumed by MMOA is reduced by 4.82%,2.62%,3.06% and 3.96%,compared with those of the conventional motion planning method;and re-duced by 2.58%,0.76%,1.63% and 2.92%,compared with those of the Hazelton method respec-tively.The theoretical analyses and simulation results illuminate that the MMOA can effectively minimizethe transitional step time between successive exposure scans and therefore increase the wafer fabricatingproductivity.展开更多
In this paper, a new class of over-relaxed proximal point algorithms for solving nonlinear operator equations with (A,η,m)-monotonicity framework in Hilbert spaces is introduced and studied. Further, by using the gen...In this paper, a new class of over-relaxed proximal point algorithms for solving nonlinear operator equations with (A,η,m)-monotonicity framework in Hilbert spaces is introduced and studied. Further, by using the generalized resolvent operator technique associated with the (A,η,m)-monotone operators, the approximation solvability of the operator equation problems and the convergence of iterative sequences generated by the algorithm are discussed. Our results improve and generalize the corresponding results in the literature.展开更多
Path planning algorithm is the key point to UAV path planning scenario.Many traditional path planning methods still suffer from low convergence rate and insufficient robustness.In this paper,three main methods are con...Path planning algorithm is the key point to UAV path planning scenario.Many traditional path planning methods still suffer from low convergence rate and insufficient robustness.In this paper,three main methods are contributed to solving these problems.First,the improved artificial potential field(APF)method is adopted to accelerate the convergence process of the bat’s position update.Second,the optimal success rate strategy is proposed to improve the adaptive inertia weight of bat algorithm.Third chaos strategy is proposed to avoid falling into a local optimum.Compared with standard APF and chaos strategy in UAV path planning scenarios,the improved algorithm CPFIBA(The improved artificial potential field method combined with chaotic bat algorithm,CPFIBA)significantly increases the success rate of finding suitable planning path and decrease the convergence time.Simulation results show that the proposed algorithm also has great robustness for processing with path planning problems.Meanwhile,it overcomes the shortcomings of the traditional meta-heuristic algorithms,as their convergence process is the potential to fall into a local optimum.From the simulation,we can see also obverse that the proposed CPFIBA provides better performance than BA and DEBA in problems of UAV path planning.展开更多
Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set shoul...Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set should have high sensitivity to target parameters but low information redundancy among features.However, feature-selection methods that satisfy both requirements are lacking. To address this issue,in this study, a novel method, the continuous wavelet projections algorithm(CWPA), was developed,which has advantages of both continuous wavelet analysis(CWA) and the successive projections algorithm(SPA) for generating optimal spectral feature set for crop detection. Three datasets collected for crop stress detection and retrieval of biochemical properties were used to validate the CWPA under both classification and regression scenarios. The CWPA generated a feature set with fewer features yet achieving accuracy comparable to or even higher than those of CWA and SPA. With only two to three features identified by CWPA, an overall accuracy of 98% in classifying tea plant stresses was achieved, and high coefficients of determination were obtained in retrieving corn leaf chlorophyll content(R^(2)= 0.8521)and equivalent water thickness(R^(2)= 0.9508). The mechanism of the CWPA ensures that the novel algorithm discovers the most sensitive features while retaining complementarity among features. Its ability to reduce the data dimension suggests its potential for crop monitoring and phenotyping with hyperspectral data.展开更多
We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give th...We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations.For different initial states,we obtain the concurrence and quantum discord compared with the success probability in the algorithm.The results show that the initial states affect the correlations and the limit point of the correlations in the searching process.However,the initial states do not influence the whole cyclical trend.展开更多
Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail tran...Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit(URT) under network operation. In order to describe the congestion's impact to passengers' route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today's China.展开更多
文摘In this paper,we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations.Unver suitable conditions,we get the global convergence on the algorithms.Some numerical results are also reported.
基金the National Basic Research Program of China(No.2003CB716206)the National Natural Science Foundation of China(No.50605025)
文摘In order to optimize the transitional time during the successive exposure scans for a step-and-scanlithography and improve the productivity in a wafer production process,an investigation of the motion tra-jectory planning along the scanning direction for wafer stage was carried out.The motions of wafer stagewere divided into two respective logical moves(i.e.step-move and scan-move)and the multi-motion-overlap algorithms(MMOA)were presented for optimizing the transitional time between the successive ex-posure scans.The conventional motion planning method,the Hazehon method and the MMOA were ana-lyzed theoretically and simulated using MATLAB under four different exposure field sizes.The resultsshow that the total time between two successive scans consumed by MMOA is reduced by 4.82%,2.62%,3.06% and 3.96%,compared with those of the conventional motion planning method;and re-duced by 2.58%,0.76%,1.63% and 2.92%,compared with those of the Hazelton method respec-tively.The theoretical analyses and simulation results illuminate that the MMOA can effectively minimizethe transitional step time between successive exposure scans and therefore increase the wafer fabricatingproductivity.
文摘In this paper, a new class of over-relaxed proximal point algorithms for solving nonlinear operator equations with (A,η,m)-monotonicity framework in Hilbert spaces is introduced and studied. Further, by using the generalized resolvent operator technique associated with the (A,η,m)-monotone operators, the approximation solvability of the operator equation problems and the convergence of iterative sequences generated by the algorithm are discussed. Our results improve and generalize the corresponding results in the literature.
文摘采用自主水下航行器(Autonomous Underwater Vehicle,AUV)磁测平台可开展海洋地磁场测量、水下磁性目标探测和识别等工作,AUV磁测平台具有广阔的应用前景,但目前AUV载体磁干扰补偿技术研究尚不成熟,制约着水下航行器测磁精度。基于磁测平台抗磁干扰基本原理,提出一种基于线性种群规模缩减和成功历史的参数自适应差分进化(Success History-based Adaptive Differential Evolution with Linear Population Size Reduction,L-SHADE)算法的AUV载体磁干扰参数辨识的数值模拟方法。用磁偶极子和旋转椭球壳混合模型来等效模拟AUV载体磁干扰,通过模拟航行获得多组磁测数据,据此建立磁干扰参数辨识模型,并采用L-SHADE算法求解。通过数值模拟实验定量分析研究磁测平台测磁精度随磁传感器、平台姿态及航向等误差的传播规律。研究结果表明:当磁传感器测量精度为10 nT、姿态测量精度为0.01°、航向测量精度为0.1°时,测磁误差可小于100 nT。设计的AUV磁测平台抗干扰试验表明,地磁场总量最大相对误差为1.07%。
基金This project is supported by National Science Foundation for Young Scientists of China(61701322)the Key Projects of Liaoning Natural Science Foundation(20170540700)+3 种基金the Key Projects of Liaoning Provincial Department of Education Science Foundation(L201702)Liaoning Natural Science Foundation(201502008,20102175)the Program for Liaoning Excellent Talents in University(LJQ2012011)the Liaoning Provincial Department of Education Science Foundation(L201630).
文摘Path planning algorithm is the key point to UAV path planning scenario.Many traditional path planning methods still suffer from low convergence rate and insufficient robustness.In this paper,three main methods are contributed to solving these problems.First,the improved artificial potential field(APF)method is adopted to accelerate the convergence process of the bat’s position update.Second,the optimal success rate strategy is proposed to improve the adaptive inertia weight of bat algorithm.Third chaos strategy is proposed to avoid falling into a local optimum.Compared with standard APF and chaos strategy in UAV path planning scenarios,the improved algorithm CPFIBA(The improved artificial potential field method combined with chaotic bat algorithm,CPFIBA)significantly increases the success rate of finding suitable planning path and decrease the convergence time.Simulation results show that the proposed algorithm also has great robustness for processing with path planning problems.Meanwhile,it overcomes the shortcomings of the traditional meta-heuristic algorithms,as their convergence process is the potential to fall into a local optimum.From the simulation,we can see also obverse that the proposed CPFIBA provides better performance than BA and DEBA in problems of UAV path planning.
基金supported by the National Natural Science Foundation of China (42071420)the Major Special Project for 2025 Scientific,Technological Innovation (Major Scientific and Technological Task Project in Ningbo City)(2021Z048)the National Key Research and Development Program of China(2019YFE0125300)。
文摘Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set should have high sensitivity to target parameters but low information redundancy among features.However, feature-selection methods that satisfy both requirements are lacking. To address this issue,in this study, a novel method, the continuous wavelet projections algorithm(CWPA), was developed,which has advantages of both continuous wavelet analysis(CWA) and the successive projections algorithm(SPA) for generating optimal spectral feature set for crop detection. Three datasets collected for crop stress detection and retrieval of biochemical properties were used to validate the CWPA under both classification and regression scenarios. The CWPA generated a feature set with fewer features yet achieving accuracy comparable to or even higher than those of CWA and SPA. With only two to three features identified by CWPA, an overall accuracy of 98% in classifying tea plant stresses was achieved, and high coefficients of determination were obtained in retrieving corn leaf chlorophyll content(R^(2)= 0.8521)and equivalent water thickness(R^(2)= 0.9508). The mechanism of the CWPA ensures that the novel algorithm discovers the most sensitive features while retaining complementarity among features. Its ability to reduce the data dimension suggests its potential for crop monitoring and phenotyping with hyperspectral data.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11975132 and 61772295)the Natural Science Foundation of Shandong Province,China(Grant No.ZR2019YQ01)Shandong Province Higher Educational Science and Technology Program,China(Grant No.J18KZ012).
文摘We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations.For different initial states,we obtain the concurrence and quantum discord compared with the success probability in the algorithm.The results show that the initial states affect the correlations and the limit point of the correlations in the searching process.However,the initial states do not influence the whole cyclical trend.
基金Project(2007AA11Z236) supported by the National High Technology Research and Development Program of ChinaProject(2012M5209O1) supported by China Postdoctoral Science Foundation
文摘Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit(URT) under network operation. In order to describe the congestion's impact to passengers' route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today's China.
