In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transform...In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.展开更多
In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear ...In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.展开更多
Variational quantum algorithms are promising methods with the greatest potential to achieve quantum advantage,widely employed in the era of noisy intermediate-scale quantum computing.This study presents an advanced va...Variational quantum algorithms are promising methods with the greatest potential to achieve quantum advantage,widely employed in the era of noisy intermediate-scale quantum computing.This study presents an advanced variational hybrid algorithm(EVQLSE)that leverages both quantum and classical computing paradigms to address the solution of linear equation systems.Initially,an innovative loss function is proposed,drawing inspiration from the similarity measure between two quantum states.This function exhibits a substantial improvement in computational complexity when benchmarked against the variational quantum linear solver.Subsequently,a specialized parameterized quantum circuit structure is presented for small-scale linear systems,which exhibits powerful expressive capabilities.Through rigorous numerical analysis,the expressiveness of this circuit structure is quantitatively assessed using a variational quantum regression algorithm,and it obtained the best score compared to the others.Moreover,the expansion in system size is accompanied by an increase in the number of parameters,placing considerable strain on the training process for the algorithm.To address this challenge,an optimization strategy known as quantum parameter sharing is introduced,which proficiently minimizes parameter volume while adhering to exacting precision standards.Finally,EVQLSE is successfully implemented on a quantum computing platform provided by IBM for the resolution of large-scale problems characterized by a dimensionality of 220.展开更多
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-ve...Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-vector product,matrix-matrix product,the sum of two matrices,and the calculation of determinant and inverse matrix.We encode the matrix entries into the probability amplitudes of the pure initial states of senders.After applying proper unitary transformation to the complete quantum system,the desired result can be found in certain blocks of the receiver’s density matrix.These quantum protocols can be used as subroutines in other quantum schemes.Furthermore,we present an alternative quantum algorithm for solving linear systems of equations.展开更多
In this paper, the reduced-order modeling （ROM） technology and its corresponding linear theory are expanded from the linear dynamic system to the nonlinear one, and H∞ control theory is employed in the frequency do...In this paper, the reduced-order modeling （ROM） technology and its corresponding linear theory are expanded from the linear dynamic system to the nonlinear one, and H∞ control theory is employed in the frequency domain to design some nonlinear system＇ s pre-compensator in some special way. The adaptive model inverse control （AMIC）theory coping with nonlinear system is improved as well. Such is the model reference adaptive inverse control with pre-compensator （PCMRAIC）. The aim of that algorithm is to construct a strategy of control as a whole. As a practical example of the application, the nunlerical simulation has been given on matlab software packages. The numerical result is given. The proposed strategy realizes the linearization control of nonlinear dynamic system. And it carries out a good performance to deal with the nonlinear system.展开更多
In this study,a dynamic model for an inverted pendulum system(IPS)attached to a car is created,and two different control methods are applied to control the system.The designed control algorithms aim to stabilize the p...In this study,a dynamic model for an inverted pendulum system(IPS)attached to a car is created,and two different control methods are applied to control the system.The designed control algorithms aim to stabilize the pendulum arms in the upright position and the car to reach the equilibrium position.Grey Wolf Optimization-based Linear Quadratic Regulator(GWO-LQR)and GWO-based Fuzzy LQR(FLQR)control algorithms are used in the control process.To improve the performance of the LQR and FLQR methods,the optimum values of the coefficients corresponding to the foot points of the membership functions are determined by the GWO algorithm.Both a graphic and a numerical analysis of the outcomes are provided.In the comparative analysis,it is observed that the GWO-based FLQR method reduces the settling time by 22.58% and the maximum peak value by 18.2% when evaluated in terms of the angular response of the pendulum arm.Furthermore,this approach outperformed comparable research in the literature with a settling time of 2.4 s.These findings demonstrate that the suggested GWO-based FLQR controlmethod outperforms existing literature in terms of the time required for the pendulum arm to reach equilibrium.展开更多
This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is establish...This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.展开更多
A novel nonlinear gray transform method is proposed to enhance the contrast of a typhoon cloud image.Generally,the typhoon cloud image obtained by a satellite cannot be directly used to make an accurate prediction of ...A novel nonlinear gray transform method is proposed to enhance the contrast of a typhoon cloud image.Generally,the typhoon cloud image obtained by a satellite cannot be directly used to make an accurate prediction of the typhoon＇s center or intensity because the contrast of the received typhoon cloud image may be bad.Our aim is to extrude the typhoon＇s eye in the typhoon cloud image.A normalized arc-tangent transformation operation is designed to enhance global contrast of the typhoon cloud image.Differential evolution algorithm is used to choose the optimal nonlinear transform parameter.Finally,geodesic activity contour model is used to extract the typhoon＇s eye to verify the performance of the proposed method.Experimental results show that the proposed method can efficiently enhance the global contrast of the typhoon cloud image while greatly extruding the typhoon＇s eye.展开更多
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using ...In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders’ MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.[WT5,5”HZ]展开更多
In order to improve the thrust-power ratio index of the linear induction motor（LIM）, a novel adaptive genetic algorithm （NAGA） is proposed for the design optimization of the LIM. A good-point set theory that helps...In order to improve the thrust-power ratio index of the linear induction motor（LIM）, a novel adaptive genetic algorithm （NAGA） is proposed for the design optimization of the LIM. A good-point set theory that helps to produce a uniform initial population is used to enhance the optimization efficiency of the genetic algorithm. The crossover and mutation probabilities are improved by using the function of sigmoid and they can be adjusted nonlinearly between average fitness and maximal fitness with individual fitness. Based on the analyses of different structures between the LIM and the rotary induction motor （RIM） and referring to the analysis method of the RIM, the steady-state characteristics of the LIM that considers the end effects of the LIM is calculated and the optimal design model of the thrust-power ratio index is also presented. Through the comparison between the optimal scheme and the old scheme, the thrust-power ratio index of the LIM is obviously increased and the validity of the NAGA is proved.展开更多
In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functio...In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size.展开更多
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
By applying genetic algorithms (GA) to on-line identification of linear time-varying systems; a number of modifications are made to the Simple Genetic Algorithm to improve the performance of the algorithm in identific...By applying genetic algorithms (GA) to on-line identification of linear time-varying systems; a number of modifications are made to the Simple Genetic Algorithm to improve the performance of the algorithm in identification applications. The simulation results indicate that the method is not only capable of following the changing parameters of the system, but also has improved the identification accuracy compared with that using the least square method.展开更多
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr...In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.展开更多
In this paper,a two-dimensional(2 D)direction-of-arrival(DOA)estimation algorithm with increased degrees of freedom for two parallel linear arrays is presented.Being different from the conventional two-parallel linear...In this paper,a two-dimensional(2 D)direction-of-arrival(DOA)estimation algorithm with increased degrees of freedom for two parallel linear arrays is presented.Being different from the conventional two-parallel linear array,the proposed two-parallel linear array consists of two uniform linear arrays with non-equal inter-element spacing.Propagator method(PM)is used to obtain a special matrix which can be utilized to increase the virtual elements of one of uniform linear arrays.Then,the PM algorithm is used again to obtain automatically paired elevation and azimuth angles.The simulation results and complexity analysis show that the proposed method can increase the number of distinguishable signals and improve the estimation precision without increasing the computational complexity.展开更多
Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simpl...Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.展开更多
A quasi physical algorithm was proposed for solving the linear separation problem of point set in n dimensional space.The original idea of the quasi physical algorithm is to find an equivalent physical world for the p...A quasi physical algorithm was proposed for solving the linear separation problem of point set in n dimensional space.The original idea of the quasi physical algorithm is to find an equivalent physical world for the primitive mathematical problem and to observe the vivid images of the motion of matter in it so as to be inspired to obtain an algorithm for solving the mathematical problem. In this work, the electrostatics with two kinds of matter is found to be the equivalent physical world. As a result,the proposed algorithm is evidently more efficient and robust than the famous LMS algorithm and ETL algorithm. The efficiency of the quasi physical algorithm is about 10-50 times of the LMS algorithm’s for representative instances. A typical Boolean valued instance shows that it is hard for ETL algorithm but very easy for the quasi physical algorithm.In this instance, point set A and B is {000, 010, 011, 111} and {001,100}, respectively.展开更多
To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm co...To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.展开更多
基金Supported by the Optimisation Theory and Algorithm Research Team(Grant No.23kytdzd004)University Science Research Project of Anhui Province(Grant No.2024AH050631)the General Programs for Young Teacher Cultivation of Educational Commission of Anhui Province(Grant No.YQYB2023090).
文摘In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.
基金Supported by University Science Research Project of Anhui Province(2023AH052921)Outstanding Youth Talent Project of Anhui Province(gxyq2021254)。
文摘In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.
基金supported by the National Natural Science Foundation of China under Grant Nos.62172268 and 62302289the Shanghai Science and Technology Project under Grant Nos.21JC1402800 and 23YF1416200。
文摘Variational quantum algorithms are promising methods with the greatest potential to achieve quantum advantage,widely employed in the era of noisy intermediate-scale quantum computing.This study presents an advanced variational hybrid algorithm(EVQLSE)that leverages both quantum and classical computing paradigms to address the solution of linear equation systems.Initially,an innovative loss function is proposed,drawing inspiration from the similarity measure between two quantum states.This function exhibits a substantial improvement in computational complexity when benchmarked against the variational quantum linear solver.Subsequently,a specialized parameterized quantum circuit structure is presented for small-scale linear systems,which exhibits powerful expressive capabilities.Through rigorous numerical analysis,the expressiveness of this circuit structure is quantitatively assessed using a variational quantum regression algorithm,and it obtained the best score compared to the others.Moreover,the expansion in system size is accompanied by an increase in the number of parameters,placing considerable strain on the training process for the algorithm.To address this challenge,an optimization strategy known as quantum parameter sharing is introduced,which proficiently minimizes parameter volume while adhering to exacting precision standards.Finally,EVQLSE is successfully implemented on a quantum computing platform provided by IBM for the resolution of large-scale problems characterized by a dimensionality of 220.
基金supported by the National Natural Science Foundation of China(Grant No.12031004 and Grant No.12271474,61877054)the Fundamental Research Foundation for the Central Universities(Project No.K20210337)+1 种基金the Zhejiang University Global Partnership Fund,188170+194452119/003partially funded by a state task of Russian Fundamental Investigations(State Registration No.FFSG-2024-0002)。
文摘Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-vector product,matrix-matrix product,the sum of two matrices,and the calculation of determinant and inverse matrix.We encode the matrix entries into the probability amplitudes of the pure initial states of senders.After applying proper unitary transformation to the complete quantum system,the desired result can be found in certain blocks of the receiver’s density matrix.These quantum protocols can be used as subroutines in other quantum schemes.Furthermore,we present an alternative quantum algorithm for solving linear systems of equations.
基金Supported by the National Defense Base Research Foundation (No. 40104030102),and the Postdoctoral Foundation of Heilongjiang Province
文摘In this paper, the reduced-order modeling （ROM） technology and its corresponding linear theory are expanded from the linear dynamic system to the nonlinear one, and H∞ control theory is employed in the frequency domain to design some nonlinear system＇ s pre-compensator in some special way. The adaptive model inverse control （AMIC）theory coping with nonlinear system is improved as well. Such is the model reference adaptive inverse control with pre-compensator （PCMRAIC）. The aim of that algorithm is to construct a strategy of control as a whole. As a practical example of the application, the nunlerical simulation has been given on matlab software packages. The numerical result is given. The proposed strategy realizes the linearization control of nonlinear dynamic system. And it carries out a good performance to deal with the nonlinear system.
文摘In this study,a dynamic model for an inverted pendulum system(IPS)attached to a car is created,and two different control methods are applied to control the system.The designed control algorithms aim to stabilize the pendulum arms in the upright position and the car to reach the equilibrium position.Grey Wolf Optimization-based Linear Quadratic Regulator(GWO-LQR)and GWO-based Fuzzy LQR(FLQR)control algorithms are used in the control process.To improve the performance of the LQR and FLQR methods,the optimum values of the coefficients corresponding to the foot points of the membership functions are determined by the GWO algorithm.Both a graphic and a numerical analysis of the outcomes are provided.In the comparative analysis,it is observed that the GWO-based FLQR method reduces the settling time by 22.58% and the maximum peak value by 18.2% when evaluated in terms of the angular response of the pendulum arm.Furthermore,this approach outperformed comparable research in the literature with a settling time of 2.4 s.These findings demonstrate that the suggested GWO-based FLQR controlmethod outperforms existing literature in terms of the time required for the pendulum arm to reach equilibrium.
基金Supported by the Natural Science Foundation of Zhejiang Province(No.LQ22F030015).
文摘This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.
基金supported by National Natural Science Foundation of China (No. 40805048,No. 11026226)Typhoon Research Foundation of Shanghai Typhoon Institute/China Meteorological Administration (No. 2008ST01)+1 种基金Research Foundation of State Key Laboratory of Remote Sensing Science,Jointly sponsored by the Instituteof Remote Sensing Applications of Chinese Academy of Sciences and Beijing Normal University (No. 2009KFJJ013)Research Foundation of State Key Laboratory of Severe Weather/Chinese Academy of Meteorological Sciences (No. 2008LASW-B03)
文摘A novel nonlinear gray transform method is proposed to enhance the contrast of a typhoon cloud image.Generally,the typhoon cloud image obtained by a satellite cannot be directly used to make an accurate prediction of the typhoon＇s center or intensity because the contrast of the received typhoon cloud image may be bad.Our aim is to extrude the typhoon＇s eye in the typhoon cloud image.A normalized arc-tangent transformation operation is designed to enhance global contrast of the typhoon cloud image.Differential evolution algorithm is used to choose the optimal nonlinear transform parameter.Finally,geodesic activity contour model is used to extract the typhoon＇s eye to verify the performance of the proposed method.Experimental results show that the proposed method can efficiently enhance the global contrast of the typhoon cloud image while greatly extruding the typhoon＇s eye.
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
文摘In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders’ MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.[WT5,5”HZ]
文摘In order to improve the thrust-power ratio index of the linear induction motor（LIM）, a novel adaptive genetic algorithm （NAGA） is proposed for the design optimization of the LIM. A good-point set theory that helps to produce a uniform initial population is used to enhance the optimization efficiency of the genetic algorithm. The crossover and mutation probabilities are improved by using the function of sigmoid and they can be adjusted nonlinearly between average fitness and maximal fitness with individual fitness. Based on the analyses of different structures between the LIM and the rotary induction motor （RIM） and referring to the analysis method of the RIM, the steady-state characteristics of the LIM that considers the end effects of the LIM is calculated and the optimal design model of the thrust-power ratio index is also presented. Through the comparison between the optimal scheme and the old scheme, the thrust-power ratio index of the LIM is obviously increased and the validity of the NAGA is proved.
基金Project supported by Dutch Organization for Scientific Research(Grant No .613 .000 .010)
文摘In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size.
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
文摘By applying genetic algorithms (GA) to on-line identification of linear time-varying systems; a number of modifications are made to the Simple Genetic Algorithm to improve the performance of the algorithm in identification applications. The simulation results indicate that the method is not only capable of following the changing parameters of the system, but also has improved the identification accuracy compared with that using the least square method.
基金Supported by the Natural Science Foundation of Hubei Province (2008CDZD47)
文摘In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.
基金supported by the National Natural Science Foundation of China(51877015,U1831117)the Cooperation Agreement Foundation by the Department of Science and Technology of Guizhou Province of China(LH[2017]7320,LH[2017]7321,[2015]7249)+2 种基金the Innovation Group Major Research Program Funded by Guizhou Provincial Education Department(KY[2016]051)the Foundation of Top-notch Talents by Education Department of Guizhou Province of China(KY[2018]075)PhD Research Startup Foundation of Tongren University(trxy DH1710)。
文摘In this paper,a two-dimensional(2 D)direction-of-arrival(DOA)estimation algorithm with increased degrees of freedom for two parallel linear arrays is presented.Being different from the conventional two-parallel linear array,the proposed two-parallel linear array consists of two uniform linear arrays with non-equal inter-element spacing.Propagator method(PM)is used to obtain a special matrix which can be utilized to increase the virtual elements of one of uniform linear arrays.Then,the PM algorithm is used again to obtain automatically paired elevation and azimuth angles.The simulation results and complexity analysis show that the proposed method can increase the number of distinguishable signals and improve the estimation precision without increasing the computational complexity.
文摘Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.
基金TheNationalKeyBasicResearchProgram (973) (No .G 19980 30 6 0 0 )
文摘A quasi physical algorithm was proposed for solving the linear separation problem of point set in n dimensional space.The original idea of the quasi physical algorithm is to find an equivalent physical world for the primitive mathematical problem and to observe the vivid images of the motion of matter in it so as to be inspired to obtain an algorithm for solving the mathematical problem. In this work, the electrostatics with two kinds of matter is found to be the equivalent physical world. As a result,the proposed algorithm is evidently more efficient and robust than the famous LMS algorithm and ETL algorithm. The efficiency of the quasi physical algorithm is about 10-50 times of the LMS algorithm’s for representative instances. A typical Boolean valued instance shows that it is hard for ETL algorithm but very easy for the quasi physical algorithm.In this instance, point set A and B is {000, 010, 011, 111} and {001,100}, respectively.
基金supported by the National Natural Science Foundation of China (Grant No. 61471138, 50909029 and 61531012)Program of International S\&T Cooperation (Grant No. 2013DFR20050)+1 种基金the Defense Industrial Technology Development Program (Grant No. B2420132004)the Acoustic Science and Technology Laboratory (2014)
文摘To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.
