In this paper, we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations. Under suitable conditions, we get the global c...In this paper, we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations. Under 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-scan lithography and improve the productivity in a wafer production process, an investigation of the motion trajectory pla...In order to optimize the transitional time during the successive exposure scans for a step-and-scan lithography and improve the productivity in a wafer production process, an investigation of the motion trajectory planning along the scanning direction for wafer stage was carried out. The motions of wafer stage were divided into two respective logical moves （i. e. step-move and scan-move） and the multi-motionoverlap algorithms （MMOA） were presented for optimizing the transitional time between the successive exposure scans. The conventional motion planning method, the Hazelton method and the MMOA were analyzed theoretically and simulated using MATLAB under four different exposure field sizes. The results show 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 reduced by 2.58%, 0.76%, 1.63% and 2.92%, compared with those of the Hazehon method respectively. The theoretical analyses and simulation results illuminate that the MMOA can effectively minimize the transitional step time between successive exposure scans and therefore increase the wafer fabricating productivity.展开更多
In order to obtain the optimized aircraft design concept which meets the increasingly complex operation environment at the conceptual design stage,System-of-systems(So S)engineering must be considered.This paper propo...In order to obtain the optimized aircraft design concept which meets the increasingly complex operation environment at the conceptual design stage,System-of-systems(So S)engineering must be considered.This paper proposes a novel optimization method for the design of aircraft Mission Success Space(MSS)based on Gaussian fitting and Genetic Algorithm(GA)in the So S area.First,the concepts in the design and evaluation of MSS are summarized to introduce the Contribution to System-of-Systems(CSS)by using a conventional effectiveness index,Mission Success Rate(MSR).Then,the mathematic modelling of Gaussian fitting technique is noted as the basis of the optimization work.After that,the proposed optimal MSS design is illustrated by the multiobjective optimization process where GA acts as the search tool to find the best solution(via Pareto front).In the case study,a simulation system of penetration mission was built.The simulation results are collected and then processed by two MSS design schemes(contour and neural network)giving the initial variable space to GA optimization.Based on that,the proposed optimization method is implemented under both schemes whose optimal solutions are compared to obtain the final best design in the case study.展开更多
We introduce a concept for the majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm （KSDS...We introduce a concept for the majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm （KSDS） for an input form f.展开更多
BACKGROUND Successful aging(SA)refers to the ability to maintain high levels of physical,cognitive,psychological,and social engagement in old age,with high cognitive function being the key to achieving SA.AIM To explo...BACKGROUND Successful aging(SA)refers to the ability to maintain high levels of physical,cognitive,psychological,and social engagement in old age,with high cognitive function being the key to achieving SA.AIM To explore the potential characteristics of the brain network and functional connectivity(FC)of SA.METHODS Twenty-six SA individuals and 47 usual aging individuals were recruited from community-dwelling elderly,which were taken the magnetic resonance imaging scan and the global cognitive function assessment by Mini Mental State Examination(MMSE).The resting state-functional magnetic resonance imaging data were preprocessed by DPABISurf,and the brain functional network was conducted by DPABINet.The support vector machine model was constructed with altered functional connectivities to evaluate the identification value of SA.RESULTS The results found that the 6 inter-network FCs of 5 brain networks were significantly altered and related to MMSE performance.The FC of the right orbital part of the middle frontal gyrus and right angular gyrus was mostly increased and positively related to MMSE score,and the FC of the right supramarginal gyrus and right temporal pole:Middle temporal gyrus was the only one decreased and negatively related to MMSE score.All 17 significantly altered FCs of SA were taken into the support vector machine model,and the area under the curve was 0.895.CONCLUSION The identification of key brain networks and FC of SA could help us better understand the brain mechanism and further explore neuroimaging biomarkers of SA.展开更多
To solve the problems of noise,detail loss and poor contrast in the successive mean quantization transform（SMQT）,a new SMQT algorithm based on Otsu algorithm is proposed.In this algorithm,we integrate the optimal th...To solve the problems of noise,detail loss and poor contrast in the successive mean quantization transform（SMQT）,a new SMQT algorithm based on Otsu algorithm is proposed.In this algorithm,we integrate the optimal threshold selected by the Otsu algorithm into the SMQT algorithm,then obtain the successive mean quantization of the binary tree.By this algorithm,an enhanced image is output with a higher quality.From both subjective visual effect and objective quality evaluation,the experimental results show that the improved algorithm reduces noise,improves contrast and makes the image details more clear.展开更多
An improved successive cancellation list bit-flip based on assigned set(AS-SCLF) decoding algorithm is proposed to solve the problems that the successive decoding of the successive cancellation(SC) decoder has error p...An improved successive cancellation list bit-flip based on assigned set(AS-SCLF) decoding algorithm is proposed to solve the problems that the successive decoding of the successive cancellation(SC) decoder has error propagation and the path extension of the successive cancellation list(SCL) decoder has the decision errors in the traditional cyclic redundancy check aided successive cancellation list(CA-SCL) decoding algorithm. The proposed algorithm constructs the AS firstly. The construction criterion is to use the Gaussian approximation principle to estimate the reliabilities of the polar subchannel and the error probabilities of the bits under SC decoding, and the normalized beliefs of the bits in actual decoding are obtained through the path metric under CA-SCL decoding, thus the error bits containing the SC state are identified and sorted in ascending order of the reliability. Then the SCLF decoding is performed. When the CA-SCL decoding fails for the first time, the decision results on the path of the SC state in the AS are exchanged. The simulation results show that compared with the CA-SCL decoding algorithm, the SCLF decoding algorithm based on the critical set and the decision post-processing decoding algorithm, the improved AS-SCLF decoding algorithm can improve the gain of about 0.29 dB, 0.22 dB and 0.1 dB respectively at the block error rate(BLER) of 10-4 and reduce the number of decoding at the low signal-to-noise ratio(SNR), thus the computational complexity is also reduced.展开更多
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 describe a successive approximation and smooth sequential quadratic programming （SQP） method for mathematical programs with nonlinear complementarity constraints （MPCC）. We introduce a class of s...In this paper, we describe a successive approximation and smooth sequential quadratic programming （SQP） method for mathematical programs with nonlinear complementarity constraints （MPCC）. We introduce a class of smooth programs to approximate the MPCC. Using an 11 penalty function, the line search assures global convergence, while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover, we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints （MPEC） when the algorithm terminates finitely.展开更多
In order to improve the problems that the minimum hamming weight(MHW) of the polar codes of the traditional Gaussian approximation(GA) construction is small and its performance is not good enough, an improved channel ...In order to improve the problems that the minimum hamming weight(MHW) of the polar codes of the traditional Gaussian approximation(GA) construction is small and its performance is not good enough, an improved channel construction algorithm of polar codes based on frozen bits is proposed by combining the construction of the Reed-Muller(RM) code to effectively increase the MHW and analyzing the correcting and checking functions of the frozen bits in the successive cancellation list(SCL) decoding.展开更多
The box-constrained weighted maximin dispersion problem is to find a point in an n-dimensional box such that the minimum of the weighted Euclidean distance from given m points is maximized. In this paper, we first ref...The box-constrained weighted maximin dispersion problem is to find a point in an n-dimensional box such that the minimum of the weighted Euclidean distance from given m points is maximized. In this paper, we first reformulate the maximin dispersion problem as a non-convex quadratically constrained quadratic programming (QCQP) problem. We adopt the successive convex approximation (SCA) algorithm to solve the problem. Numerical results show that the proposed algorithm is efficient.展开更多
文摘In this paper, we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations. Under 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-scan lithography and improve the productivity in a wafer production process, an investigation of the motion trajectory planning along the scanning direction for wafer stage was carried out. The motions of wafer stage were divided into two respective logical moves （i. e. step-move and scan-move） and the multi-motionoverlap algorithms （MMOA） were presented for optimizing the transitional time between the successive exposure scans. The conventional motion planning method, the Hazelton method and the MMOA were analyzed theoretically and simulated using MATLAB under four different exposure field sizes. The results show 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 reduced by 2.58%, 0.76%, 1.63% and 2.92%, compared with those of the Hazehon method respectively. The theoretical analyses and simulation results illuminate that the MMOA can effectively minimize the transitional step time between successive exposure scans and therefore increase the wafer fabricating productivity.
文摘In order to obtain the optimized aircraft design concept which meets the increasingly complex operation environment at the conceptual design stage,System-of-systems(So S)engineering must be considered.This paper proposes a novel optimization method for the design of aircraft Mission Success Space(MSS)based on Gaussian fitting and Genetic Algorithm(GA)in the So S area.First,the concepts in the design and evaluation of MSS are summarized to introduce the Contribution to System-of-Systems(CSS)by using a conventional effectiveness index,Mission Success Rate(MSR).Then,the mathematic modelling of Gaussian fitting technique is noted as the basis of the optimization work.After that,the proposed optimal MSS design is illustrated by the multiobjective optimization process where GA acts as the search tool to find the best solution(via Pareto front).In the case study,a simulation system of penetration mission was built.The simulation results are collected and then processed by two MSS design schemes(contour and neural network)giving the initial variable space to GA optimization.Based on that,the proposed optimization method is implemented under both schemes whose optimal solutions are compared to obtain the final best design in the case study.
基金Supported by the National Key Basic Research Project of China(Grant No.2011CB302402)the Fundamental Research Funds for the Central Universities,Southwest University for Nationalities(Grant No.12NZYTH04)
文摘We introduce a concept for the majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm （KSDS） for an input form f.
基金Supported by the Wuxi Municipal Health Commission Major Project,No.Z202107。
文摘BACKGROUND Successful aging(SA)refers to the ability to maintain high levels of physical,cognitive,psychological,and social engagement in old age,with high cognitive function being the key to achieving SA.AIM To explore the potential characteristics of the brain network and functional connectivity(FC)of SA.METHODS Twenty-six SA individuals and 47 usual aging individuals were recruited from community-dwelling elderly,which were taken the magnetic resonance imaging scan and the global cognitive function assessment by Mini Mental State Examination(MMSE).The resting state-functional magnetic resonance imaging data were preprocessed by DPABISurf,and the brain functional network was conducted by DPABINet.The support vector machine model was constructed with altered functional connectivities to evaluate the identification value of SA.RESULTS The results found that the 6 inter-network FCs of 5 brain networks were significantly altered and related to MMSE performance.The FC of the right orbital part of the middle frontal gyrus and right angular gyrus was mostly increased and positively related to MMSE score,and the FC of the right supramarginal gyrus and right temporal pole:Middle temporal gyrus was the only one decreased and negatively related to MMSE score.All 17 significantly altered FCs of SA were taken into the support vector machine model,and the area under the curve was 0.895.CONCLUSION The identification of key brain networks and FC of SA could help us better understand the brain mechanism and further explore neuroimaging biomarkers of SA.
基金Supported by the National Natural Science Foundation of China(61503289)Hubei Province Science and Technology Support Program(2015BAA120,2015BCE068)
文摘To solve the problems of noise,detail loss and poor contrast in the successive mean quantization transform（SMQT）,a new SMQT algorithm based on Otsu algorithm is proposed.In this algorithm,we integrate the optimal threshold selected by the Otsu algorithm into the SMQT algorithm,then obtain the successive mean quantization of the binary tree.By this algorithm,an enhanced image is output with a higher quality.From both subjective visual effect and objective quality evaluation,the experimental results show that the improved algorithm reduces noise,improves contrast and makes the image details more clear.
基金supported by the National High Technology and Development Program of China (No.61971079)the Postgraduate Science Research Innovation Project of Chongqing Municipal Education Commission (No.CYS21319)。
文摘An improved successive cancellation list bit-flip based on assigned set(AS-SCLF) decoding algorithm is proposed to solve the problems that the successive decoding of the successive cancellation(SC) decoder has error propagation and the path extension of the successive cancellation list(SCL) decoder has the decision errors in the traditional cyclic redundancy check aided successive cancellation list(CA-SCL) decoding algorithm. The proposed algorithm constructs the AS firstly. The construction criterion is to use the Gaussian approximation principle to estimate the reliabilities of the polar subchannel and the error probabilities of the bits under SC decoding, and the normalized beliefs of the bits in actual decoding are obtained through the path metric under CA-SCL decoding, thus the error bits containing the SC state are identified and sorted in ascending order of the reliability. Then the SCLF decoding is performed. When the CA-SCL decoding fails for the first time, the decision results on the path of the SC state in the AS are exchanged. The simulation results show that compared with the CA-SCL decoding algorithm, the SCLF decoding algorithm based on the critical set and the decision post-processing decoding algorithm, the improved AS-SCLF decoding algorithm can improve the gain of about 0.29 dB, 0.22 dB and 0.1 dB respectively at the block error rate(BLER) of 10-4 and reduce the number of decoding at the low signal-to-noise ratio(SNR), thus the computational complexity is also reduced.
基金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.
基金supported by the National Natural Science Foundation of China (Nos.10501009,10771040)the Natural Science Foundation of Guangxi Province of China (Nos.0728206,0640001)the China Postdoctoral Science Foundation (No.20070410228)
文摘In this paper, we describe a successive approximation and smooth sequential quadratic programming （SQP） method for mathematical programs with nonlinear complementarity constraints （MPCC）. We introduce a class of smooth programs to approximate the MPCC. Using an 11 penalty function, the line search assures global convergence, while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover, we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints （MPEC） when the algorithm terminates finitely.
基金supported by the National Natural Science Foundation of China(Nos.U21A20447 and 61971079)。
文摘In order to improve the problems that the minimum hamming weight(MHW) of the polar codes of the traditional Gaussian approximation(GA) construction is small and its performance is not good enough, an improved channel construction algorithm of polar codes based on frozen bits is proposed by combining the construction of the Reed-Muller(RM) code to effectively increase the MHW and analyzing the correcting and checking functions of the frozen bits in the successive cancellation list(SCL) decoding.
文摘The box-constrained weighted maximin dispersion problem is to find a point in an n-dimensional box such that the minimum of the weighted Euclidean distance from given m points is maximized. In this paper, we first reformulate the maximin dispersion problem as a non-convex quadratically constrained quadratic programming (QCQP) problem. We adopt the successive convex approximation (SCA) algorithm to solve the problem. Numerical results show that the proposed algorithm is efficient.
