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.展开更多
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.展开更多
针对经典贪婪算法(greedy)迭代次数多、运算量大的缺点,提出一种基于边缘自适应(margin adaptive,MA)准则的改进贪婪算法来进行正交频分复用(orthogonal frequency division multiplexing,OFDM)系统的自适应比特功率分配。与贪婪算法相...针对经典贪婪算法(greedy)迭代次数多、运算量大的缺点,提出一种基于边缘自适应(margin adaptive,MA)准则的改进贪婪算法来进行正交频分复用(orthogonal frequency division multiplexing,OFDM)系统的自适应比特功率分配。与贪婪算法相比,改进算法通过预分配和迭代分配两部分来降低算法的计算量。在预分配中改进算法通过引入功率利用率函数,对信道条件好的子信道预先加载一部分比特。然后,在迭代分配的过程中,引用分类排序的思想,用一张表格存储子信道的功率变化情况,从而降低算法的复杂度。仿真结果表明,在相同的仿真环境下,改进算法和Greedy算法的误比特性能几乎一致,但改进算法的运行时间更短。展开更多
提出利用混合P2P(Mixed Peer to Peer)架构结合MA(Mobile Agent)技术解决移动计算环境下数据可靠收敛问题,在此基础上建立了MAMP(Mobile Agent and Mixed Peer Model)模型。分析了模型的系统结构和核心技术,重点阐述了MAMP模型的同步策...提出利用混合P2P(Mixed Peer to Peer)架构结合MA(Mobile Agent)技术解决移动计算环境下数据可靠收敛问题,在此基础上建立了MAMP(Mobile Agent and Mixed Peer Model)模型。分析了模型的系统结构和核心技术,重点阐述了MAMP模型的同步策略——HVU(Highest Votes to Update)算法,给出了严格的数学证明。实验结果表明,该模型基础下的算法具有较高的可靠性。展开更多
文摘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.
文摘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.
文摘针对经典贪婪算法(greedy)迭代次数多、运算量大的缺点,提出一种基于边缘自适应(margin adaptive,MA)准则的改进贪婪算法来进行正交频分复用(orthogonal frequency division multiplexing,OFDM)系统的自适应比特功率分配。与贪婪算法相比,改进算法通过预分配和迭代分配两部分来降低算法的计算量。在预分配中改进算法通过引入功率利用率函数,对信道条件好的子信道预先加载一部分比特。然后,在迭代分配的过程中,引用分类排序的思想,用一张表格存储子信道的功率变化情况,从而降低算法的复杂度。仿真结果表明,在相同的仿真环境下,改进算法和Greedy算法的误比特性能几乎一致,但改进算法的运行时间更短。
文摘提出利用混合P2P(Mixed Peer to Peer)架构结合MA(Mobile Agent)技术解决移动计算环境下数据可靠收敛问题,在此基础上建立了MAMP(Mobile Agent and Mixed Peer Model)模型。分析了模型的系统结构和核心技术,重点阐述了MAMP模型的同步策略——HVU(Highest Votes to Update)算法,给出了严格的数学证明。实验结果表明,该模型基础下的算法具有较高的可靠性。
