The three-dimensional sensor networks are supposed to be deployed for many applications. So it is signifi-cant to do research on the problems of coverage and target detection in three-dimensional sensor networks. In t...The three-dimensional sensor networks are supposed to be deployed for many applications. So it is signifi-cant to do research on the problems of coverage and target detection in three-dimensional sensor networks. In this paper, we introduced Clifford algebra in 3D Euclidean space, developed the coverage model of 3D sensor networks based on Clifford algebra, and proposed a method for detecting target moving. With Clif-ford Spinor, calculating the target moving formulation is easier than traditional methods in sensor node’s coverage area.展开更多
The objective of this research is the presentation of a neural network capable of solving complete nonlinear algebraic systems of n equations with n unknowns. The proposed neural solver uses the classical back propaga...The objective of this research is the presentation of a neural network capable of solving complete nonlinear algebraic systems of n equations with n unknowns. The proposed neural solver uses the classical back propagation algorithm with the identity function as the output function, and supports the feature of the adaptive learning rate for the neurons of the second hidden layer. The paper presents the fundamental theory associated with this approach as well as a set of experimental results that evaluate the performance and accuracy of the proposed method against other methods found in the literature.展开更多
This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employi...This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.展开更多
In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-id...In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.展开更多
Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks...Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.展开更多
Multipe NSSS (Nuclear Steam Supply System) modules use the common feeding-water system to drive the common turbine power generation set. The SSFFN (secondary side fluid flow network) of MHTGR plant has features i.e. s...Multipe NSSS (Nuclear Steam Supply System) modules use the common feeding-water system to drive the common turbine power generation set. The SSFFN (secondary side fluid flow network) of MHTGR plant has features i.e. strong-coupling and nonlinearity. A wide range of power switching operation will cause unsteady flow, which may destroy the working elements and will be a threat for normal operation. To overcome those problems, a differential-algebraic model and PI controllers are designed for the SSFFN. In MATLAB\SIMULINK environment, a simulation platform is established and used to make a simulation of SSFFN of a MHTGR plant with two NSSS modules, which uses feedwater valves to control the mass flow rate in each module instead of feedwater pump. Results reflect good robustness of controllers.展开更多
This project uses knowledge of neural network to analyze if the person under study is analyzed to be Parkinson disease patient or not. Binary classification is constructed based on the multi-feature database. A decisi...This project uses knowledge of neural network to analyze if the person under study is analyzed to be Parkinson disease patient or not. Binary classification is constructed based on the multi-feature database. A decision boundary is clearly plotted to separate patient with and without Parkinson disease. Results show that over 80% accuracy could be obtained with the preliminary results. Future efforts could be performed to construct more complicated neural network to improve the accuracy.展开更多
The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple li...The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities （LMIs）, which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.展开更多
The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is m...The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in a layer 2 network, which has been constrained by the spanning tree protocol that a layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3’s routing approach into a layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. ECMP (equal cost multipath) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called EPMP (Equal Preference Multi-Path) that can generate more paths than ECMP. The EPMP is based on the ordered semi-group algebra. In the EPMP routing, paths that differ in traditionally-defined costs, such as hops, bandwidth, etc., can be made equally preferred and thus become candidate paths. We found that, in comparison with ECMP, EPMP routing not only generates more paths, provides higher bisection bandwidth, but also allows bottleneck links in a hierarchical network to be identified when different traffic patterns are applied. EPMP is also versatile in that it can use various ways of path preference calculations to control the number and the length of paths, making it flexible (like policy-based routing) but also objective (like shortest path first routing) in calculating preferred paths.展开更多
文摘The three-dimensional sensor networks are supposed to be deployed for many applications. So it is signifi-cant to do research on the problems of coverage and target detection in three-dimensional sensor networks. In this paper, we introduced Clifford algebra in 3D Euclidean space, developed the coverage model of 3D sensor networks based on Clifford algebra, and proposed a method for detecting target moving. With Clif-ford Spinor, calculating the target moving formulation is easier than traditional methods in sensor node’s coverage area.
文摘The objective of this research is the presentation of a neural network capable of solving complete nonlinear algebraic systems of n equations with n unknowns. The proposed neural solver uses the classical back propagation algorithm with the identity function as the output function, and supports the feature of the adaptive learning rate for the neurons of the second hidden layer. The paper presents the fundamental theory associated with this approach as well as a set of experimental results that evaluate the performance and accuracy of the proposed method against other methods found in the literature.
基金supported by the National Natural Science Foundation of China (6057408860274014)
文摘This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.
基金Supported by the National Natural Science Foundation of China(6147333861304164)
文摘In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.
基金Supported by the National Natural Science Foundation of China(11371290,61301178)the Science and Technology Innovation Foundation of Xi'an(CXY1352WL28,CXY1352WL27)
文摘Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.
文摘Multipe NSSS (Nuclear Steam Supply System) modules use the common feeding-water system to drive the common turbine power generation set. The SSFFN (secondary side fluid flow network) of MHTGR plant has features i.e. strong-coupling and nonlinearity. A wide range of power switching operation will cause unsteady flow, which may destroy the working elements and will be a threat for normal operation. To overcome those problems, a differential-algebraic model and PI controllers are designed for the SSFFN. In MATLAB\SIMULINK environment, a simulation platform is established and used to make a simulation of SSFFN of a MHTGR plant with two NSSS modules, which uses feedwater valves to control the mass flow rate in each module instead of feedwater pump. Results reflect good robustness of controllers.
文摘This project uses knowledge of neural network to analyze if the person under study is analyzed to be Parkinson disease patient or not. Binary classification is constructed based on the multi-feature database. A decision boundary is clearly plotted to separate patient with and without Parkinson disease. Results show that over 80% accuracy could be obtained with the preliminary results. Future efforts could be performed to construct more complicated neural network to improve the accuracy.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60904046, 60972164, 60974071, and 60804006)the Special Fund for Basic Scientific Research of Central Colleges, Northeastern University, China (Grant No. 090604005)+2 种基金the Science and Technology Program of Shenyang (Grant No. F11-264-1-70)the Program for Liaoning Excellent Talents in University (Grant No. LJQ2011137)the Program for Liaoning Innovative Research Team in University (Grant No. LT2011019)
文摘The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities （LMIs）, which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.
文摘The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in a layer 2 network, which has been constrained by the spanning tree protocol that a layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3’s routing approach into a layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. ECMP (equal cost multipath) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called EPMP (Equal Preference Multi-Path) that can generate more paths than ECMP. The EPMP is based on the ordered semi-group algebra. In the EPMP routing, paths that differ in traditionally-defined costs, such as hops, bandwidth, etc., can be made equally preferred and thus become candidate paths. We found that, in comparison with ECMP, EPMP routing not only generates more paths, provides higher bisection bandwidth, but also allows bottleneck links in a hierarchical network to be identified when different traffic patterns are applied. EPMP is also versatile in that it can use various ways of path preference calculations to control the number and the length of paths, making it flexible (like policy-based routing) but also objective (like shortest path first routing) in calculating preferred paths.
