This paper addresses the problem of adaptive,consistent parameter estimation for a MA model from the 3rd order cumulant of the system output. The proposed adaptive algorithm is derived by using the new linear equation...This paper addresses the problem of adaptive,consistent parameter estimation for a MA model from the 3rd order cumulant of the system output. The proposed adaptive algorithm is derived by using the new linear equation system (J. K. Tugnait, 1990), which is proved to have unique solution,and hence guarantees the consistence of the MA parameters. Simulation results are provided to show the performance of the new algorithm.展开更多
Structural analysis problems can be formulized as either root finding problems,or optimization problems.The general practice is to choose the first option directly or to convert the second option again to a root findi...Structural analysis problems can be formulized as either root finding problems,or optimization problems.The general practice is to choose the first option directly or to convert the second option again to a root finding problem by taking relevant derivatives and equating them to zero.The second alternative is used very randomly as it is and only for some simple demonstrative problems,most probably due to difficulty in solving optimization problems by classical methods.The method called TPO/MA(Total Potential Optimization using Metaheuristic Algorithms)described in this study successfully enables to handle structural problems with optimization formulation.Using metaheuristic algorithms provides additional advantages in dealing with all kinds of constraints.展开更多
Aiming at the deficiency of conventional traffic control method, this paper proposes a new method based on multi-agent technology for traffic control. Different from many existing methods, this paper distinguishes tra...Aiming at the deficiency of conventional traffic control method, this paper proposes a new method based on multi-agent technology for traffic control. Different from many existing methods, this paper distinguishes traffic control on the basis of the agent technology from conventional traffic control method. The composition and structure of a multi-agent system (MAS) is first discussed. Then, the step-coordination strategies of intersection-agent, segment-agent, and area-agent are put forward. The advantages of the algorithm are demonstrated by a simulation study.展开更多
A memetic algorithm (MA) for a multi-mode resourceconstrained project scheduling problem (MRCPSP) is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The f...A memetic algorithm (MA) for a multi-mode resourceconstrained project scheduling problem (MRCPSP) is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called "strategic oscillation" to make the search process have a higher probability to visit solutions around a "feasible boundary". One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.展开更多
The eigenface method that uses principal component analysis(PCA) has been the standard and popular method used in face recognition.This paper presents a PCA-memetic algorithm(PCA-MA) approach for feature selection.PCA...The eigenface method that uses principal component analysis(PCA) has been the standard and popular method used in face recognition.This paper presents a PCA-memetic algorithm(PCA-MA) approach for feature selection.PCA has been extended by MAs where the former was used for feature extraction/dimensionality reduction and the latter exploited for feature selection.Simulations were performed over ORL and YaleB face databases using Euclidean norm as the classifier.It was found that as far as the recognition rate is concerned,PCA-MA completely outperforms the eigenface method.We compared the performance of PCA extended with genetic algorithm(PCA-GA) with our proposed PCA-MA method.The results also clearly established the supremacy of the PCA-MA method over the PCA-GA method.We further extended linear discriminant analysis(LDA) and kernel principal component analysis(KPCA) approaches with the MA and observed significant improvement in recognition rate with fewer features.This paper also compares the performance of PCA-MA,LDA-MA and KPCA-MA approaches.展开更多
针对经典贪婪算法(greedy)迭代次数多、运算量大的缺点,提出一种基于边缘自适应(margin adaptive,MA)准则的改进贪婪算法来进行正交频分复用(orthogonal frequency division multiplexing,OFDM)系统的自适应比特功率分配。与贪婪算法相...针对经典贪婪算法(greedy)迭代次数多、运算量大的缺点,提出一种基于边缘自适应(margin adaptive,MA)准则的改进贪婪算法来进行正交频分复用(orthogonal frequency division multiplexing,OFDM)系统的自适应比特功率分配。与贪婪算法相比,改进算法通过预分配和迭代分配两部分来降低算法的计算量。在预分配中改进算法通过引入功率利用率函数,对信道条件好的子信道预先加载一部分比特。然后,在迭代分配的过程中,引用分类排序的思想,用一张表格存储子信道的功率变化情况,从而降低算法的复杂度。仿真结果表明,在相同的仿真环境下,改进算法和Greedy算法的误比特性能几乎一致,但改进算法的运行时间更短。展开更多
摘要This paper addresses the problem of adaptive,consistent parameter estimation for a MA model from the 3rd order cumulant of the system output. The proposed adaptive algorithm is derived by using the new linear equation system (J. K. Tugnait, 1990), which is proved to have unique solution,and hence guarantees the consistence of the MA parameters. Simulation results are provided to show the performance of the new algorithm.
摘要Structural analysis problems can be formulized as either root finding problems,or optimization problems.The general practice is to choose the first option directly or to convert the second option again to a root finding problem by taking relevant derivatives and equating them to zero.The second alternative is used very randomly as it is and only for some simple demonstrative problems,most probably due to difficulty in solving optimization problems by classical methods.The method called TPO/MA(Total Potential Optimization using Metaheuristic Algorithms)described in this study successfully enables to handle structural problems with optimization formulation.Using metaheuristic algorithms provides additional advantages in dealing with all kinds of constraints.
摘要针对微电网中电压偏差和电流分配精度问题,提出一种基于多智能体一致性算法的能量储存系统(Energy Storage System,ESS)协调控制策略。对微电网的分层控制结构进行分析,将集中式和分布式控制相结合,实现各个储能单元的独立运行。在此基础上,通过通信、下垂控制和直接控制三个部分实现储能单元间的荷电状态(State of Charge,SoC)均衡、输出电流比例分配和减小母线电压偏差。结果表明,调节因子m和n的增大可以加速SoC和电流的均衡。相较于固定调节因子,变调节因子可以将SoC均衡速度提升11.6%,有助于应对ESS的突发情况,在较短的时间内使系统稳定。为微电网运行稳定性,提高储能设备利用效率提供了参考。
摘要Aiming at the deficiency of conventional traffic control method, this paper proposes a new method based on multi-agent technology for traffic control. Different from many existing methods, this paper distinguishes traffic control on the basis of the agent technology from conventional traffic control method. The composition and structure of a multi-agent system (MAS) is first discussed. Then, the step-coordination strategies of intersection-agent, segment-agent, and area-agent are put forward. The advantages of the algorithm are demonstrated by a simulation study.
基金supported by the National Natural Science Foundation of China(71171038)
摘要A memetic algorithm (MA) for a multi-mode resourceconstrained project scheduling problem (MRCPSP) is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called "strategic oscillation" to make the search process have a higher probability to visit solutions around a "feasible boundary". One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.
摘要The eigenface method that uses principal component analysis(PCA) has been the standard and popular method used in face recognition.This paper presents a PCA-memetic algorithm(PCA-MA) approach for feature selection.PCA has been extended by MAs where the former was used for feature extraction/dimensionality reduction and the latter exploited for feature selection.Simulations were performed over ORL and YaleB face databases using Euclidean norm as the classifier.It was found that as far as the recognition rate is concerned,PCA-MA completely outperforms the eigenface method.We compared the performance of PCA extended with genetic algorithm(PCA-GA) with our proposed PCA-MA method.The results also clearly established the supremacy of the PCA-MA method over the PCA-GA method.We further extended linear discriminant analysis(LDA) and kernel principal component analysis(KPCA) approaches with the MA and observed significant improvement in recognition rate with fewer features.This paper also compares the performance of PCA-MA,LDA-MA and KPCA-MA approaches.
摘要针对经典贪婪算法(greedy)迭代次数多、运算量大的缺点,提出一种基于边缘自适应(margin adaptive,MA)准则的改进贪婪算法来进行正交频分复用(orthogonal frequency division multiplexing,OFDM)系统的自适应比特功率分配。与贪婪算法相比,改进算法通过预分配和迭代分配两部分来降低算法的计算量。在预分配中改进算法通过引入功率利用率函数,对信道条件好的子信道预先加载一部分比特。然后,在迭代分配的过程中,引用分类排序的思想,用一张表格存储子信道的功率变化情况,从而降低算法的复杂度。仿真结果表明,在相同的仿真环境下,改进算法和Greedy算法的误比特性能几乎一致,但改进算法的运行时间更短。