A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with ...A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with their states available for measurement. When the communication topology of the system is connected, an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent＇s positions and ve-locities asymptotically converges to zero. Moreover, the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity. Finally, simulation results show the effectiveness of the proposed control algorithm.展开更多
为提高网络入侵检测系统中检测算法的分类精度,降低训练样本及学习时间,在基于支持向量回归机的基础上,提出一种新的利用Lagrange支持向量回归机设计IDS的检测算法。使用KDD CUP 1999数据集进行仿真实验,结果表明该算法较基于支持向量...为提高网络入侵检测系统中检测算法的分类精度,降低训练样本及学习时间,在基于支持向量回归机的基础上,提出一种新的利用Lagrange支持向量回归机设计IDS的检测算法。使用KDD CUP 1999数据集进行仿真实验,结果表明该算法较基于支持向量回归机的检测算法具有更良好的泛化性能、更快的迭代速度、更高的检测精度和更低的误报率。展开更多
Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qu...Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qualities. Firstly, we take into account the relation among tasks and build the single task nonlinear optimal model with a set of platform constraints. The Lagrange relaxation method and the pruning strategy are used to solve the model. Secondly, this paper presents optimization-based planning algorithms for efficiently allocating platforms to multiple tasks. To achieve the balance of the resource assignments among tasks, the m-best assignment algorithm and the pair-wise exchange(PWE)method are used to maximize multiple tasks completion qualities.Finally, a series of experiments are designed to verify the superiority and effectiveness of the proposed model and algorithms.展开更多
基金supported by the National Natural Sciences Foundation of China (60974146)
文摘A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with their states available for measurement. When the communication topology of the system is connected, an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent＇s positions and ve-locities asymptotically converges to zero. Moreover, the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity. Finally, simulation results show the effectiveness of the proposed control algorithm.
文摘为提高网络入侵检测系统中检测算法的分类精度,降低训练样本及学习时间,在基于支持向量回归机的基础上,提出一种新的利用Lagrange支持向量回归机设计IDS的检测算法。使用KDD CUP 1999数据集进行仿真实验,结果表明该算法较基于支持向量回归机的检测算法具有更良好的泛化性能、更快的迭代速度、更高的检测精度和更低的误报率。
基金supported by the National Natural Science Foundation of China(61573017 61703425)+2 种基金the Aeronautical Science Fund(20175796014)the Shaanxi Province Natural Science Foundation Research Project(2016JQ6062 2017JM6062)
文摘Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qualities. Firstly, we take into account the relation among tasks and build the single task nonlinear optimal model with a set of platform constraints. The Lagrange relaxation method and the pruning strategy are used to solve the model. Secondly, this paper presents optimization-based planning algorithms for efficiently allocating platforms to multiple tasks. To achieve the balance of the resource assignments among tasks, the m-best assignment algorithm and the pair-wise exchange(PWE)method are used to maximize multiple tasks completion qualities.Finally, a series of experiments are designed to verify the superiority and effectiveness of the proposed model and algorithms.
