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.展开更多
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 adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding ker...To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.展开更多
A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forc...A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.展开更多
Based on a uniform linear array, a new widely linear unscented Kalman filter-based constant modulus algorithm (WL-UKF-CMA) for blind adaptive beamforming is proposed. The new algorithm is designed according to the con...Based on a uniform linear array, a new widely linear unscented Kalman filter-based constant modulus algorithm (WL-UKF-CMA) for blind adaptive beamforming is proposed. The new algorithm is designed according to the constant modulus criterion and takes full advantage of the noncircular property of the signal of interest (SOI), significantly increasing the output signal-to interference-plus-noise ratio (SINR), enhancing the convergence speed and decreasing the steady-state misadjustment. Since it requires no known training data, the proposed algorithm saves a large amount of the available spectrum. Theoretical analysis and simulation results are presented to demonstrate its superiority over the conventional linear least mean square-based CMA (L-LMS-CMA), the conventional linear recursive least square-based CMA (L-RLS-CMA), WL-LMS-CMA, WL-RLS-CMA and L-UKF-CMA.展开更多
It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity problems.This paper presents an extension of t...It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity problems.This paper presents an extension of the recent variant of Mehrotra＇s second order algorithm for linear optimijation.It is shown that the iteration-complexity bound of the algorithm is O（4κ ＋ 3）√14κ ＋ 5 nlog（x0）Ts0/ε,which is similar to that of the corresponding algorithm for linear optimization.展开更多
A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood d...A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.展开更多
Cloud data centers consume a multitude of power leading to the problem of high energy consumption. In order to solve this problem, an energy-efficient virtual machine(VM) consolidation algorithm named PVDE(prediction-...Cloud data centers consume a multitude of power leading to the problem of high energy consumption. In order to solve this problem, an energy-efficient virtual machine(VM) consolidation algorithm named PVDE(prediction-based VM deployment algorithm for energy efficiency) is presented. The proposed algorithm uses linear weighted method to predict the load of a host and classifies the hosts in the data center, based on the predicted host load, into four classes for the purpose of VMs migration. We also propose four types of VM selection algorithms for the purpose of determining potential VMs to be migrated. We performed extensive performance analysis of the proposed algorithms. Experimental results show that, in contrast to other energy-saving algorithms, the algorithm proposed in this work significantly reduces the energy consumption and maintains low service level agreement(SLA) violations.展开更多
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block co...This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.展开更多
The conventional linear quadratic regulator(LQR) control algorithm is one of the most popular active control algorithms.One important issue for LQR control algorithm is the reduction of structure's degrees of free...The conventional linear quadratic regulator(LQR) control algorithm is one of the most popular active control algorithms.One important issue for LQR control algorithm is the reduction of structure's degrees of freedom(DOF). In this work, an LQR control algorithm with superelement model is intended to solve this issue leading to the fact that LQR control algorithm can be used in large finite element(FE) model for structure. In proposed model, the Craig-Bampton(C-B) method, which is one of the component mode syntheses(CMS), is used to establish superelement modeling to reduce structure's DOF and applied to LQR control algorithm to calculate Kalman gain matrix and obtain control forces. And then, the control forces are applied to original structure to simulate the responses of structure by vibration control. And some examples are given. The results show the computational efficiency of proposed model using synthesized models is higher than that of the classical method of LQR control when the DOF of structure is large. And the accuracy of proposed model is well. Meanwhile, the results show that the proposed control has more effects of vibration absorption on the ground structures than underground structures.展开更多
Variable stiffness composite laminates(VSCLs)are promising in aerospace engineering due to their designable material properties through changing fiber angles and stacking sequences.Aiming to control the thermal postbu...Variable stiffness composite laminates(VSCLs)are promising in aerospace engineering due to their designable material properties through changing fiber angles and stacking sequences.Aiming to control the thermal postbuckling and nonlinear panel flutter motions of VSCLs,a full-order numerical model is developed based on the linear quadratic regulator(LQR)algorithm in control theory,the classical laminate plate theory(CLPT)considering von Kármán geometrical nonlinearity,and the first-order Piston theory.The critical buckling temperature and the critical aerodynamic pressure of VSCLs are parametrically investigated.The location and shape of piezoelectric actuators for optimal control of the dynamic responses of VSCLs are determined through comparing the norms of feedback control gain(NFCG).Numerical simulations show that the temperature field has a great effect on aeroelastic tailoring of VSCLs;the curvilinear fiber path of VSCLs can significantly affect the optimal location and shape of piezoelectric actuator for flutter suppression;the unstable panel flutter and the thermal postbuckling deflection can be suppressed effectively through optimal design of piezoelectric patches.展开更多
High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this prob...High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this problem.The basic idea was to search the line manifold clusters hidden in datasets,and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters.The orthogonal distance and the tangent distance were considered together as the linear manifold distance metrics. Spatial neighbor information was fully utilized to construct the original line manifold and optimize line manifolds during the line manifold cluster searching procedure.The results obtained from experiments over real and synthetic data sets demonstrate the superiority of the proposed method over some competing clustering methods in terms of accuracy and computation time.The proposed method is able to obtain high clustering accuracy for various data sets with different sizes,manifold dimensions and noise ratios,which confirms the anti-noise capability and high clustering accuracy of the proposed method for high dimensional data.展开更多
The problem of potential field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regula...The problem of potential field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regularized method is one of the best algorithms. But there is a shortcoming in application with the regularized method, viz. the optimum regularized parameter must be determined by experience, so it is difficulty to obtain an optimum solution. In this paper, an iterative algorithm for solving any system of linear equations is discussed, and a sufficient and necessary condition of the algorithm convergence is presented and proved. The algorithm is convergent for any starting point, and the optimum solution can be obtained, in particular, there is no need to calculate the inverse matrix in the algorithm. The typical practical example shows the iterative algorithm is simple and practicable, and the inversion effect is better than that of regularized method.展开更多
针对电动垂直起降飞行器(electric Vertical Take-off and Landing,eVTOL)合乘运营场景下的动态请求匹配问题,对合乘匹配及路径规划进行研究.首先,考虑eVTOL垂直起降机场容量、eVTOL载重、电池能耗等限制,以乘客和eVTOL运营商利益最大...针对电动垂直起降飞行器(electric Vertical Take-off and Landing,eVTOL)合乘运营场景下的动态请求匹配问题,对合乘匹配及路径规划进行研究.首先,考虑eVTOL垂直起降机场容量、eVTOL载重、电池能耗等限制,以乘客和eVTOL运营商利益最大化为目标建立基于合乘公平性的动态eVTOL路径规划模型;其次,使用基本插入算法和线性插入算法对问题模型进行求解,并对比分析按照先到先服务和请求优先级将新请求与eVTOL进行匹配的两种处理方式;最后,以T市5个火车站和1个机场作为垂直机场,用其实际地理位置信息进行算例研究.研究结果表明:与基本插入算法相比,线性插入算法的计算时间缩短了60%以上,证明该算法可以有效求解模型;与按照先到先服务处理方式相比,请求优先级处理新请求时乘客的平均支付费用减少了0.87%,运营商合乘收益提升了5.86%,实现了在保障乘客和运营商利益下新请求与eVTOL的较优匹配.所构建的动态路径规划模型为eVTOL共享运营模式提供参考.展开更多
基金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.
基金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.
基金Project(60872005) supported by National Natural Science Foundation of China
文摘To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.
基金supported by the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)the Fundamental Research Funds for the Central Universities(K50511700004)
文摘A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.
基金supported by the National Natural Science Foundation of China(61573113)the Harbin Science and Technology Innovation Talents(Excellent Discipline Leader)Research Fund(2014RFXXJ074)the National Scholarship([2016]3100)
文摘Based on a uniform linear array, a new widely linear unscented Kalman filter-based constant modulus algorithm (WL-UKF-CMA) for blind adaptive beamforming is proposed. The new algorithm is designed according to the constant modulus criterion and takes full advantage of the noncircular property of the signal of interest (SOI), significantly increasing the output signal-to interference-plus-noise ratio (SINR), enhancing the convergence speed and decreasing the steady-state misadjustment. Since it requires no known training data, the proposed algorithm saves a large amount of the available spectrum. Theoretical analysis and simulation results are presented to demonstrate its superiority over the conventional linear least mean square-based CMA (L-LMS-CMA), the conventional linear recursive least square-based CMA (L-RLS-CMA), WL-LMS-CMA, WL-RLS-CMA and L-UKF-CMA.
基金supported by the Natural Science Foundation of Hubei Province of China(2008CDZ047)
文摘It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity problems.This paper presents an extension of the recent variant of Mehrotra＇s second order algorithm for linear optimijation.It is shown that the iteration-complexity bound of the algorithm is O（4κ ＋ 3）√14κ ＋ 5 nlog（x0）Ts0/ε,which is similar to that of the corresponding algorithm for linear optimization.
基金This project was supported by the National Natural Science Foundation of China (60272024).
文摘A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.
基金Projects(61572525,61272148)supported by the National Natural Science Foundation of ChinaProject(20120162110061)supported by the PhD Programs Foundation of Ministry of Education of China+1 种基金Project(CX2014B066)supported by the Hunan Provincial Innovation Foundation for Postgraduate,ChinaProject(2014zzts044)supported by the Fundamental Research Funds for the Central Universities,China
文摘Cloud data centers consume a multitude of power leading to the problem of high energy consumption. In order to solve this problem, an energy-efficient virtual machine(VM) consolidation algorithm named PVDE(prediction-based VM deployment algorithm for energy efficiency) is presented. The proposed algorithm uses linear weighted method to predict the load of a host and classifies the hosts in the data center, based on the predicted host load, into four classes for the purpose of VMs migration. We also propose four types of VM selection algorithms for the purpose of determining potential VMs to be migrated. We performed extensive performance analysis of the proposed algorithms. Experimental results show that, in contrast to other energy-saving algorithms, the algorithm proposed in this work significantly reduces the energy consumption and maintains low service level agreement(SLA) violations.
基金supported by the National Natural Science Foundation of China(61171170) the Natural Science Foundation of Anhui Province(1408085QF115)
文摘This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
基金Project(LZ2015022)supported by Educational Commission of Liaoning Province of ChinaProjects(51138001,51178081)supported by the National Natural Science Foundation of China+1 种基金Project(2013CB035905)supported by the Basic Research Program of ChinaProjects(DUT15LK34,DUT14QY10)supported by Fundamental Research Funds for the Central Universities,China
文摘The conventional linear quadratic regulator(LQR) control algorithm is one of the most popular active control algorithms.One important issue for LQR control algorithm is the reduction of structure's degrees of freedom(DOF). In this work, an LQR control algorithm with superelement model is intended to solve this issue leading to the fact that LQR control algorithm can be used in large finite element(FE) model for structure. In proposed model, the Craig-Bampton(C-B) method, which is one of the component mode syntheses(CMS), is used to establish superelement modeling to reduce structure's DOF and applied to LQR control algorithm to calculate Kalman gain matrix and obtain control forces. And then, the control forces are applied to original structure to simulate the responses of structure by vibration control. And some examples are given. The results show the computational efficiency of proposed model using synthesized models is higher than that of the classical method of LQR control when the DOF of structure is large. And the accuracy of proposed model is well. Meanwhile, the results show that the proposed control has more effects of vibration absorption on the ground structures than underground structures.
基金Project(JCYJ20190808175801656)supported by the Science and Technology Innovation Commission of Shenzhen,ChinaProject(2021M691427)supported by Postdoctoral Science Foundation of ChinaProject(9680086)supported by the City University of Hong Kong,China。
文摘Variable stiffness composite laminates(VSCLs)are promising in aerospace engineering due to their designable material properties through changing fiber angles and stacking sequences.Aiming to control the thermal postbuckling and nonlinear panel flutter motions of VSCLs,a full-order numerical model is developed based on the linear quadratic regulator(LQR)algorithm in control theory,the classical laminate plate theory(CLPT)considering von Kármán geometrical nonlinearity,and the first-order Piston theory.The critical buckling temperature and the critical aerodynamic pressure of VSCLs are parametrically investigated.The location and shape of piezoelectric actuators for optimal control of the dynamic responses of VSCLs are determined through comparing the norms of feedback control gain(NFCG).Numerical simulations show that the temperature field has a great effect on aeroelastic tailoring of VSCLs;the curvilinear fiber path of VSCLs can significantly affect the optimal location and shape of piezoelectric actuator for flutter suppression;the unstable panel flutter and the thermal postbuckling deflection can be suppressed effectively through optimal design of piezoelectric patches.
基金Project(60835005) supported by the National Nature Science Foundation of China
文摘High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this problem.The basic idea was to search the line manifold clusters hidden in datasets,and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters.The orthogonal distance and the tangent distance were considered together as the linear manifold distance metrics. Spatial neighbor information was fully utilized to construct the original line manifold and optimize line manifolds during the line manifold cluster searching procedure.The results obtained from experiments over real and synthetic data sets demonstrate the superiority of the proposed method over some competing clustering methods in terms of accuracy and computation time.The proposed method is able to obtain high clustering accuracy for various data sets with different sizes,manifold dimensions and noise ratios,which confirms the anti-noise capability and high clustering accuracy of the proposed method for high dimensional data.
基金the work is supported by scientific and technological fund of CNPC
文摘The problem of potential field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regularized method is one of the best algorithms. But there is a shortcoming in application with the regularized method, viz. the optimum regularized parameter must be determined by experience, so it is difficulty to obtain an optimum solution. In this paper, an iterative algorithm for solving any system of linear equations is discussed, and a sufficient and necessary condition of the algorithm convergence is presented and proved. The algorithm is convergent for any starting point, and the optimum solution can be obtained, in particular, there is no need to calculate the inverse matrix in the algorithm. The typical practical example shows the iterative algorithm is simple and practicable, and the inversion effect is better than that of regularized method.
文摘针对电动垂直起降飞行器(electric Vertical Take-off and Landing,eVTOL)合乘运营场景下的动态请求匹配问题,对合乘匹配及路径规划进行研究.首先,考虑eVTOL垂直起降机场容量、eVTOL载重、电池能耗等限制,以乘客和eVTOL运营商利益最大化为目标建立基于合乘公平性的动态eVTOL路径规划模型;其次,使用基本插入算法和线性插入算法对问题模型进行求解,并对比分析按照先到先服务和请求优先级将新请求与eVTOL进行匹配的两种处理方式;最后,以T市5个火车站和1个机场作为垂直机场,用其实际地理位置信息进行算例研究.研究结果表明:与基本插入算法相比,线性插入算法的计算时间缩短了60%以上,证明该算法可以有效求解模型;与按照先到先服务处理方式相比,请求优先级处理新请求时乘客的平均支付费用减少了0.87%,运营商合乘收益提升了5.86%,实现了在保障乘客和运营商利益下新请求与eVTOL的较优匹配.所构建的动态路径规划模型为eVTOL共享运营模式提供参考.
