The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMM...The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMMCN reliabilities evaluation and multi-objective transmission lines assignment optimization. First, a reliability evaluation with a transmission line assignment (RETLA) algorithm is proposed to calculate the MMMCN reliabilities under the cost constraint for a certain transmission lines configuration. Second, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to find the non-dominated set of the transmission lines assignments based on the reliabilities obtained from the RETLA algorithm. By combining the RETLA and the NSGA-II algorithms together, the RETLA-NSGA II algorithm is proposed to solve the OTLAMR problem. The experiments result show that the RETLA-NSGA II algorithm can provide efficient solutions in a reasonable time, from which the decision makers can choose the best solution based on their preferences and experiences.展开更多
A variety of problems in digital circuits, computer networks, automated manufacturing plants, etc., can be modeled as min-max systems. The cycle time is an important performance metric of such systems. In this paper, ...A variety of problems in digital circuits, computer networks, automated manufacturing plants, etc., can be modeled as min-max systems. The cycle time is an important performance metric of such systems. In this paper, we focus on the cycle time assignment of minimax systems which corresponds to the pole assignment problem in traditional linear control systems. For the min- max system with max-plus inputs and outputs, we show that the cycle time can be assigned disjointedly by a state feedback, if and only if the system is reachable. Furthermore, a necessary and sufficient condition for the cycle time to be assigned independently by a state feedback is given. The methods are constructive, and some numerical examples are given to illustrate how the methods work in practice.展开更多
Using state assignment to minimize power dissipation and area for finite state ma-chines is computationally hard. Most of published results show that the reduction of switchingactivity often trades with area penalty. ...Using state assignment to minimize power dissipation and area for finite state ma-chines is computationally hard. Most of published results show that the reduction of switchingactivity often trades with area penalty. In this paper, a new approach is proposed. Experimentalresults show a significant reduction of switching activity without area penalty compared withprevious publications.展开更多
Methods which calculate state feedback matrices explicitly for uncontrollable systems are considered in this paper. They are based on the well-known method of the entire eigenstructure assignment. The use of a particu...Methods which calculate state feedback matrices explicitly for uncontrollable systems are considered in this paper. They are based on the well-known method of the entire eigenstructure assignment. The use of a particular similarity transformation exposes certain intrinsic properties of the closed loop w-eigenvectors together with their companion z-vectors. The methods are extended further to deal with multi-input control systems. Existence of eigenvectors solution is established. A differentiation property of the z-vectors is proved for the repeated eigenvalues assignment case. Two examples are worked out in detail.展开更多
考虑交通网络中实现用户均衡态的过程,引入决策出行费用的概念,提出一个 ATIS 环境下的交通配流动态演化模型,模型中的 OD 需求是可变内生的.利用稳定性定理分析了该动态系统的稳定性,说明在一定条件下,系统的用户均衡态是稳定的.采用...考虑交通网络中实现用户均衡态的过程,引入决策出行费用的概念,提出一个 ATIS 环境下的交通配流动态演化模型,模型中的 OD 需求是可变内生的.利用稳定性定理分析了该动态系统的稳定性,说明在一定条件下,系统的用户均衡态是稳定的.采用改进的欧拉法完成了模型的数值试验,结果表明该动态系统确实可以达到用户均衡态,同时也发现,某些模型参数的变化可能导致路径流量和 OD 费用演化轨迹的无规则摆动.展开更多
基金Projects(61004074,61134001,21076179)supported by the National Natural Science Foundation of ChinaProject(2009BAG12A08)supported by the National Key Technology Support Program of China+1 种基金Project(2010QNA5001)supported by the Fundamental Research Funds for the Central Universities of ChinaProjects(2012AA06A404,2006AA04Z184)supported by the National High Technology Research and Development Program of China
文摘The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMMCN reliabilities evaluation and multi-objective transmission lines assignment optimization. First, a reliability evaluation with a transmission line assignment (RETLA) algorithm is proposed to calculate the MMMCN reliabilities under the cost constraint for a certain transmission lines configuration. Second, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to find the non-dominated set of the transmission lines assignments based on the reliabilities obtained from the RETLA algorithm. By combining the RETLA and the NSGA-II algorithms together, the RETLA-NSGA II algorithm is proposed to solve the OTLAMR problem. The experiments result show that the RETLA-NSGA II algorithm can provide efficient solutions in a reasonable time, from which the decision makers can choose the best solution based on their preferences and experiences.
基金supported by National Natural Science Foundation of China (No.60774007) and the Royal Society of UK
文摘A variety of problems in digital circuits, computer networks, automated manufacturing plants, etc., can be modeled as min-max systems. The cycle time is an important performance metric of such systems. In this paper, we focus on the cycle time assignment of minimax systems which corresponds to the pole assignment problem in traditional linear control systems. For the min- max system with max-plus inputs and outputs, we show that the cycle time can be assigned disjointedly by a state feedback, if and only if the system is reachable. Furthermore, a necessary and sufficient condition for the cycle time to be assigned independently by a state feedback is given. The methods are constructive, and some numerical examples are given to illustrate how the methods work in practice.
基金This work was supported by the National Natural Science Foundation of China （No. 70674108/60703118） and the Natural Science Foundation of Shaanxi （No. 2007A01）.
基金Supported in part by the Chinese Outstanding Youth Science Foundation(69925308)supported by Program for Changjiang Scholars and Innovative Research Team in University
基金Supported by NNSF of China(Key International Cooperative Project No.60010121219)
文摘Using state assignment to minimize power dissipation and area for finite state ma-chines is computationally hard. Most of published results show that the reduction of switchingactivity often trades with area penalty. In this paper, a new approach is proposed. Experimentalresults show a significant reduction of switching activity without area penalty compared withprevious publications.
文摘Methods which calculate state feedback matrices explicitly for uncontrollable systems are considered in this paper. They are based on the well-known method of the entire eigenstructure assignment. The use of a particular similarity transformation exposes certain intrinsic properties of the closed loop w-eigenvectors together with their companion z-vectors. The methods are extended further to deal with multi-input control systems. Existence of eigenvectors solution is established. A differentiation property of the z-vectors is proved for the repeated eigenvalues assignment case. Two examples are worked out in detail.
文摘考虑交通网络中实现用户均衡态的过程,引入决策出行费用的概念,提出一个 ATIS 环境下的交通配流动态演化模型,模型中的 OD 需求是可变内生的.利用稳定性定理分析了该动态系统的稳定性,说明在一定条件下,系统的用户均衡态是稳定的.采用改进的欧拉法完成了模型的数值试验,结果表明该动态系统确实可以达到用户均衡态,同时也发现,某些模型参数的变化可能导致路径流量和 OD 费用演化轨迹的无规则摆动.
