Delay Tolerant Networking over the Metropolitan Public Transportation
Directory of Open Access Journals (Sweden)
A. Bujari
2016-01-01
Full Text Available We discuss MDTN: a delay tolerant application platform built on top of the Public Transportation System (PTS and able to provide service access while exploiting opportunistic connectivity. Our solution adopts a carrier-based approach where buses act as data collectors for user requests requiring Internet access. Simulations based on real maps and PTS routes with state-of-the-art routing protocols demonstrate that MDTN represents a viable solution for elastic nonreal-time service delivery. Nevertheless, performance indexes of the considered routing policies show that there is no golden rule for optimal performance and a tailored routing strategy is required for each specific case.
Manitz, J. (Juliane); Harbering, J. (Jonas); M.E. Schmidt (Marie); T. Kneib (Thomas); A. Schöbel (Anita)
2017-01-01
textabstractThe correct identification of the source of a propagation process is crucial in many research fields. As a specific application, we consider source estimation of delays in public transportation networks. We propose two approaches: an effective distance median and a backtracking method.
Gao, Longxiang; Luan, Tom H
2015-01-01
This brief presents emerging and promising communication methods for network reliability via delay tolerant networks (DTNs). Different from traditional networks, DTNs possess unique features, such as long latency and unstable network topology. As a result, DTNs can be widely applied to critical applications, such as space communications, disaster rescue, and battlefield communications. The brief provides a complete investigation of DTNs and their current applications, from an overview to the latest development in the area. The core issue of data forward in DTNs is tackled, including the importance of social characteristics, which is an essential feature if the mobile devices are used for human communication. Security and privacy issues in DTNs are discussed, and future work is also discussed.
Delays and networked control systems
Hetel, Laurentiu; Daafouz, Jamal; Johansson, Karl
2016-01-01
This edited monograph includes state-of-the-art contributions on continuous time dynamical networks with delays. The book is divided into four parts. The first part presents tools and methods for the analysis of time-delay systems with a particular attention on control problems of large scale or infinite-dimensional systems with delays. The second part of the book is dedicated to the use of time-delay models for the analysis and design of Networked Control Systems. The third part of the book focuses on the analysis and design of systems with asynchronous sampling intervals which occur in Networked Control Systems. The last part of the book exposes several contributions dealing with the design of cooperative control and observation laws for networked control systems. The target audience primarily comprises researchers and experts in the field of control theory, but the book may also be beneficial for graduate students. .
Estimation of network path segment delays
Nichols, Kathleen Marie
2018-05-01
A method for estimation of a network path segment delay includes determining a scaled time stamp for each packet of a plurality of packets by scaling a time stamp for each respective packet to minimize a difference of at least one of a frequency and a frequency drift between a transport protocol clock of a host and a monitoring point. The time stamp for each packet is provided by the transport protocol clock of the host. A corrected time stamp for each packet is determined by removing from the scaled time stamp for each respective packet, a temporal offset between the transport protocol clock and the monitoring clock by minimizing a temporal delay variation of the plurality of packets traversing a segment between the host and the monitoring point.
Optimal Joint Expected Delay Forwarding in Delay Tolerant Networks
Jia Xu; Xin Feng; Wen Jun Yang; Ru Chuan Wang; Bing Qing Han
2013-01-01
Multicopy forwarding schemes have been employed in delay tolerant network (DTN) to improve the delivery delay and delivery rate. Much effort has been focused on reducing the routing cost while retaining high performance. This paper aims to provide an optimal joint expected delay forwarding (OJEDF) protocol which minimizes the expected delay while satisfying a certain constant on the number of forwardings per message. We propose a comprehensive forwarding metric called joint expected delay (JE...
Synchronization analysis of coloured delayed networks under ...
Indian Academy of Sciences (India)
This paper investigates synchronization of coloured delayed networks under decentralized pinning intermittent control. To begin with, the time delays are taken into account in the coloured networks. In addition, we propose a decentralized pinning intermittent control for coloured delayed networks, which is different from that ...
Towards Optimal Transport Networks
Directory of Open Access Journals (Sweden)
Erik P. Vargo
2010-08-01
Full Text Available Our ultimate goal is to design transportation net- works whose dynamic performance metrics (e.g. pas- senger throughput, passenger delay, and insensitivity to weather disturbances are optimized. Here the fo- cus is on optimizing static features of the network that are known to directly aﬀect the network dynamics. First, we present simulation results which support a connection between maximizing the ﬁrst non-trivial eigenvalue of a network's Laplacian and superior air- port network performance. Then, we explore the ef- fectiveness of a tabu search heuristic for optimizing this metric by comparing experimental results to the- oretical upper bounds. We also consider generating upper bounds on a network's algebraic connectivity via the solution of semideﬁnite programming (SDP relaxations. A modiﬁcation of an existing subgraph extraction algorithm is implemented to explore the underlying regional structures in the U.S. airport net- work, with the hope that the resulting localized struc- tures can be optimized independently and reconnected via a "backbone" network to achieve superior network performance.
Synchronization in networks with heterogeneous coupling delays
Otto, Andreas; Radons, Günter; Bachrathy, Dániel; Orosz, Gábor
2018-01-01
Synchronization in networks of identical oscillators with heterogeneous coupling delays is studied. A decomposition of the network dynamics is obtained by block diagonalizing a newly introduced adjacency lag operator which contains the topology of the network as well as the corresponding coupling delays. This generalizes the master stability function approach, which was developed for homogenous delays. As a result the network dynamics can be analyzed by delay differential equations with distributed delay, where different delay distributions emerge for different network modes. Frequency domain methods are used for the stability analysis of synchronized equilibria and synchronized periodic orbits. As an example, the synchronization behavior in a system of delay-coupled Hodgkin-Huxley neurons is investigated. It is shown that the parameter regions where synchronized periodic spiking is unstable expand when increasing the delay heterogeneity.
On Delay and Security in Network Coding
Dikaliotis, Theodoros K.
2013-01-01
In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are routing with hop-by-hop retransmissions, where every node in the network simply stores and…
Neutron stochastic transport theory with delayed neutrons
International Nuclear Information System (INIS)
Munoz-Cobo, J.L.; Verdu, G.
1987-01-01
From the stochastic transport theory with delayed neutrons, the Boltzmann transport equation with delayed neutrons for the average flux emerges in a natural way without recourse to any approximation. From this theory a general expression is obtained for the Feynman Y-function when delayed neutrons are included. The single mode approximation for the particular case of a subcritical assembly is developed, and it is shown that Y-function reduces to the familiar expression quoted in many books, when delayed neutrons are not considered, and spatial and source effects are not included. (author)
Animal transportation networks
Perna, Andrea; Latty, Tanya
2014-01-01
Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research. PMID:25165598
M.J. van der Leij (Marco)
2003-01-01
textabstractIn a circular city model, I consider network design and pricing decisions for a single fast transport connection that faces competition from a slower but better accessible transport mode. To access the fast transport network individuals have to make complementary trips by slow mode. This
Delayed feedback control in quantum transport.
Emary, Clive
2013-09-28
Feedback control in quantum transport has been predicted to give rise to several interesting effects, among them quantum state stabilization and the realization of a mesoscopic Maxwell's daemon. These results were derived under the assumption that control operations on the system are affected instantaneously after the measurement of electronic jumps through it. In this contribution, I describe how to include a delay between detection and control operation in the master equation theory of feedback-controlled quantum transport. I investigate the consequences of delay for the state stabilization and Maxwell's daemon schemes. Furthermore, I describe how delay can be used as a tool to probe coherent oscillations of electrons within a transport system and how this formalism can be used to model finite detector bandwidth.
Transcriptional delay stabilizes bistable gene networks.
Gupta, Chinmaya; López, José Manuel; Ott, William; Josić, Krešimir; Bennett, Matthew R
2013-08-02
Transcriptional delay can significantly impact the dynamics of gene networks. Here we examine how such delay affects bistable systems. We investigate several stochastic models of bistable gene networks and find that increasing delay dramatically increases the mean residence times near stable states. To explain this, we introduce a non-Markovian, analytically tractable reduced model. The model shows that stabilization is the consequence of an increased number of failed transitions between stable states. Each of the bistable systems that we simulate behaves in this manner.
Delay tolerant networks protocols and applications
Vasilakos, Athanasios V; Spyropoulos, Thrasyvoulos
2011-01-01
Delay Tolerant Networks (DTN) - which include terrestrial mobile networks, exotic media networks, ad-hoc networks, and sensor networks - are becoming more important and may not be well served by the current end-to-end TCP/IP model. This book provides a self-contained, one-stop reference for researchers and practitioners who are looking toward the future of networking. The text presents a systematic exploration of DTN concepts, architectures, protocols, enabling technologies, and applications. It also discusses various challenges associated with DTN. The author includes a wealth of illustrative
Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Bennett, Matthew R; Josić, Krešimir; Ott, William
2014-05-28
Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.
Energy Technology Data Exchange (ETDEWEB)
Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Ott, William [Department of Mathematics, University of Houston, Houston, Texas 77004 (United States); Bennett, Matthew R. [Department of Biochemistry and Cell Biology, Rice University, Houston, Texas 77204, USA and Institute of Biosciences and Bioengineering, Rice University, Houston, Texas 77005 (United States); Josić, Krešimir [Department of Mathematics, University of Houston, Houston, Texas 77004 (United States); Department of Biology and Biochemistry, University of Houston, Houston, Texas 77204 (United States)
2014-05-28
Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.
International Nuclear Information System (INIS)
Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Ott, William; Bennett, Matthew R.; Josić, Krešimir
2014-01-01
Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay
Convergent dynamics for multistable delayed neural networks
International Nuclear Information System (INIS)
Shih, Chih-Wen; Tseng, Jui-Pin
2008-01-01
This investigation aims at developing a methodology to establish convergence of dynamics for delayed neural network systems with multiple stable equilibria. The present approach is general and can be applied to several network models. We take the Hopfield-type neural networks with both instantaneous and delayed feedbacks to illustrate the idea. We shall construct the complete dynamical scenario which comprises exactly 2 n stable equilibria and exactly (3 n − 2 n ) unstable equilibria for the n-neuron network. In addition, it is shown that every solution of the system converges to one of the equilibria as time tends to infinity. The approach is based on employing the geometrical structure of the network system. Positively invariant sets and componentwise dynamical properties are derived under the geometrical configuration. An iteration scheme is subsequently designed to confirm the convergence of dynamics for the system. Two examples with numerical simulations are arranged to illustrate the present theory
Transportation Network Topologies
Holmes, Bruce J.; Scott, John
2004-01-01
A discomforting reality has materialized on the transportation scene: our existing air and ground infrastructures will not scale to meet our nation's 21st century demands and expectations for mobility, commerce, safety, and security. The consequence of inaction is diminished quality of life and economic opportunity in the 21st century. Clearly, new thinking is required for transportation that can scale to meet to the realities of a networked, knowledge-based economy in which the value of time is a new coin of the realm. This paper proposes a framework, or topology, for thinking about the problem of scalability of the system of networks that comprise the aviation system. This framework highlights the role of integrated communication-navigation-surveillance systems in enabling scalability of future air transportation networks. Scalability, in this vein, is a goal of the recently formed Joint Planning and Development Office for the Next Generation Air Transportation System. New foundations for 21st thinking about air transportation are underpinned by several technological developments in the traditional aircraft disciplines as well as in communication, navigation, surveillance and information systems. Complexity science and modern network theory give rise to one of the technological developments of importance. Scale-free (i.e., scalable) networks represent a promising concept space for modeling airspace system architectures, and for assessing network performance in terms of scalability, efficiency, robustness, resilience, and other metrics. The paper offers an air transportation system topology as framework for transportation system innovation. Successful outcomes of innovation in air transportation could lay the foundations for new paradigms for aircraft and their operating capabilities, air transportation system architectures, and airspace architectures and procedural concepts. The topology proposed considers air transportation as a system of networks, within which
Toward Optimal Transport Networks
Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.
2008-01-01
Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.
Delay and Disruption Tolerant Networking MACHETE Model
Segui, John S.; Jennings, Esther H.; Gao, Jay L.
2011-01-01
To verify satisfaction of communication requirements imposed by unique missions, as early as 2000, the Communications Networking Group at the Jet Propulsion Laboratory (JPL) saw the need for an environment to support interplanetary communication protocol design, validation, and characterization. JPL's Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in Simulator of Space Communication Networks (NPO-41373) NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various commercial, non-commercial, and in-house custom tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. As NASA is expanding its Space Communications and Navigation (SCaN) capabilities to support planned and future missions, building infrastructure to maintain services and developing enabling technologies, an important and broader role is seen for MACHETE in design-phase evaluation of future SCaN architectures. To support evaluation of the developing Delay Tolerant Networking (DTN) field and its applicability for space networks, JPL developed MACHETE models for DTN Bundle Protocol (BP) and Licklider/Long-haul Transmission Protocol (LTP). DTN is an Internet Research Task Force (IRTF) architecture providing communication in and/or through highly stressed networking environments such as space exploration and battlefield networks. Stressed networking environments include those with intermittent (predictable and unknown) connectivity, large and/or variable delays, and high bit error rates. To provide its services over existing domain specific protocols, the DTN protocols reside at the application layer of the TCP/IP stack, forming a store-and-forward overlay network. The key capabilities of the Bundle Protocol include custody-based reliability, the ability to cope with intermittent connectivity
Delay functions in trip assignment for transport planning process
Leong, Lee Vien
2017-10-01
In transportation planning process, volume-delay and turn-penalty functions are the functions needed in traffic assignment to determine travel time on road network links. Volume-delay function is the delay function describing speed-flow relationship while turn-penalty function is the delay function associated to making a turn at intersection. The volume-delay function used in this study is the revised Bureau of Public Roads (BPR) function with the constant parameters, α and β values of 0.8298 and 3.361 while the turn-penalty functions for signalized intersection were developed based on uniform, random and overflow delay models. Parameters such as green time, cycle time and saturation flow were used in the development of turn-penalty functions. In order to assess the accuracy of the delay functions, road network in areas of Nibong Tebal, Penang and Parit Buntar, Perak was developed and modelled using transportation demand forecasting software. In order to calibrate the models, phase times and traffic volumes at fourteen signalised intersections within the study area were collected during morning and evening peak hours. The prediction of assigned volumes using the revised BPR function and the developed turn-penalty functions show close agreement to actual recorded traffic volume with the lowest percentage of accuracy, 80.08% and the highest, 93.04% for the morning peak model. As for the evening peak model, they were 75.59% and 95.33% respectively for lowest and highest percentage of accuracy. As for the yield left-turn lanes, the lowest percentage of accuracy obtained for the morning and evening peak models were 60.94% and 69.74% respectively while the highest percentage of accuracy obtained for both models were 100%. Therefore, can be concluded that the development and utilisation of delay functions based on local road conditions are important as localised delay functions can produce better estimate of link travel times and hence better planning for future
Delayed switching applied to memristor neural networks
Energy Technology Data Exchange (ETDEWEB)
Wang, Frank Z.; Yang Xiao; Lim Guan [Future Computing Group, School of Computing, University of Kent, Canterbury (United Kingdom); Helian Na [School of Computer Science, University of Hertfordshire, Hatfield (United Kingdom); Wu Sining [Xyratex, Havant (United Kingdom); Guo Yike [Department of Computing, Imperial College, London (United Kingdom); Rashid, Md Mamunur [CERN, Geneva (Switzerland)
2012-04-01
Magnetic flux and electric charge are linked in a memristor. We reported recently that a memristor has a peculiar effect in which the switching takes place with a time delay because a memristor possesses a certain inertia. This effect was named the ''delayed switching effect.'' In this work, we elaborate on the importance of delayed switching in a brain-like computer using memristor neural networks. The effect is used to control the switching of a memristor synapse between two neurons that fire together (the Hebbian rule). A theoretical formula is found, and the design is verified by a simulation. We have also built an experimental setup consisting of electronic memristive synapses and electronic neurons.
Delayed switching applied to memristor neural networks
International Nuclear Information System (INIS)
Wang, Frank Z.; Yang Xiao; Lim Guan; Helian Na; Wu Sining; Guo Yike; Rashid, Md Mamunur
2012-01-01
Magnetic flux and electric charge are linked in a memristor. We reported recently that a memristor has a peculiar effect in which the switching takes place with a time delay because a memristor possesses a certain inertia. This effect was named the ''delayed switching effect.'' In this work, we elaborate on the importance of delayed switching in a brain-like computer using memristor neural networks. The effect is used to control the switching of a memristor synapse between two neurons that fire together (the Hebbian rule). A theoretical formula is found, and the design is verified by a simulation. We have also built an experimental setup consisting of electronic memristive synapses and electronic neurons.
Transportation Network Topologies
Alexandrov, Natalia (Editor)
2004-01-01
The existing U.S. hub-and-spoke air transportation system is reaching saturation. Major aspects of the current system, such as capacity, safety, mobility, customer satisfaction, security, communications, and ecological effects, require improvements. The changing dynamics - increased presence of general aviation, unmanned autonomous vehicles, military aircraft in civil airspace as part of homeland defense - contributes to growing complexity of airspace. The system has proven remarkably resistant to change. NASA Langley Research Center and the National Institute of Aerospace conducted a workshop on Transportation Network Topologies on 9-10 December 2003 in Williamsburg, Virginia. The workshop aimed to examine the feasibility of traditional methods for complex system analysis and design as well as potential novel alternatives in application to transportation systems, identify state-of-the-art models and methods, conduct gap analysis, and thus to lay a foundation for establishing a focused research program in complex systems applied to air transportation.
Stability of Neutral Fractional Neural Networks with Delay
Institute of Scientific and Technical Information of China (English)
LI Yan; JIANG Wei; HU Bei-bei
2016-01-01
This paper studies stability of neutral fractional neural networks with delay. By introducing the definition of norm and using the uniform stability, the suﬃcient condition for uniform stability of neutral fractional neural networks with delay is obtained.
Dynamics in a delayed-neural network
International Nuclear Information System (INIS)
Yuan Yuan
2007-01-01
In this paper, we consider a neural network of four identical neurons with time-delayed connections. Some parameter regions are given for global, local stability and synchronization using the theory of functional differential equations. The root distributions in the corresponding characteristic transcendental equation are analyzed, Pitchfork bifurcation, Hopf and equivariant Hopf bifurcations are investigated by revealing the center manifolds and normal forms. Numerical simulations are shown the agreements with the theoretical results
Analysis of Time Delay Simulation in Networked Control System
Nyan Phyo Aung; Zaw Min Naing; Hla Myo Tun
2016-01-01
The paper presents a PD controller for the Networked Control Systems (NCS) with delay. The major challenges in this networked control system (NCS) are the delay of the data transmission throughout the communication network. The comparative performance analysis is carried out for different delays network medium. In this paper, simulation is carried out on Ac servo motor control system using CAN Bus as communication network medium. The True Time toolbox of MATLAB is used for simulation to analy...
Modelling biochemical networks with intrinsic time delays: a hybrid semi-parametric approach
Directory of Open Access Journals (Sweden)
Oliveira Rui
2010-09-01
Full Text Available Abstract Background This paper presents a method for modelling dynamical biochemical networks with intrinsic time delays. Since the fundamental mechanisms leading to such delays are many times unknown, non conventional modelling approaches become necessary. Herein, a hybrid semi-parametric identification methodology is proposed in which discrete time series are incorporated into fundamental material balance models. This integration results in hybrid delay differential equations which can be applied to identify unknown cellular dynamics. Results The proposed hybrid modelling methodology was evaluated using two case studies. The first of these deals with dynamic modelling of transcriptional factor A in mammalian cells. The protein transport from the cytosol to the nucleus introduced a delay that was accounted for by discrete time series formulation. The second case study focused on a simple network with distributed time delays that demonstrated that the discrete time delay formalism has broad applicability to both discrete and distributed delay problems. Conclusions Significantly better prediction qualities of the novel hybrid model were obtained when compared to dynamical structures without time delays, being the more distinctive the more significant the underlying system delay is. The identification of the system delays by studies of different discrete modelling delays was enabled by the proposed structure. Further, it was shown that the hybrid discrete delay methodology is not limited to discrete delay systems. The proposed method is a powerful tool to identify time delays in ill-defined biochemical networks.
Investigation of the network delay on Profibus-DP based network
Yılmaz, C.; Gürdal, O.; Sayan, H.H.
2008-01-01
The mathematical model of the network-induced delay control systems (NDCS) is given. Also the role of the NDCS’s components such as controller, sensor and network environment on the network-induced delay are included in the mathematical model of the system. The network delay is investigated on Profibus-DP based network application and experimental results obtained are presented graphically. The experimental results obtained show that the network induced delay is randomly changed according to ...
Consensus in the network with uniform constant communication delay
Wang, Xu; Saberi, Ali; Stoorvogel, Antonie Arij; Grip, H°avard Fjær; Yang, Tao
2013-01-01
This paper studies consensus among identical agents that are at most critically unstable and coupled through networks with uniform constant communication delay. An upper bound for delay tolerance is obtained which explicitly depends on agent dynamics and network topology. The dependence on network
Capacity, delay and mobility in wireless ad-hoc networks
Bansal, N.; Liu, Z.
2003-01-01
Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been shown to increase the capacity of a network, it is not clear whether the delay can be kept low without trading off the throughput. We
Discrete-time BAM neural networks with variable delays
Liu, Xin-Ge; Tang, Mei-Lan; Martin, Ralph; Liu, Xin-Bi
2007-07-01
This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development.
Discrete-time BAM neural networks with variable delays
International Nuclear Information System (INIS)
Liu Xinge; Tang Meilan; Martin, Ralph; Liu Xinbi
2007-01-01
This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development
Exponential Synchronization of Uncertain Complex Dynamical Networks with Delay Coupling
International Nuclear Information System (INIS)
Wang Lifu; Kong Zhi; Jing Yuanwei
2010-01-01
This paper studies the global exponential synchronization of uncertain complex delayed dynamical networks. The network model considered is general dynamical delay networks with unknown network structure and unknown coupling functions but bounded. Novel delay-dependent linear controllers are designed via the Lyapunov stability theory. Especially, it is shown that the controlled networks are globally exponentially synchronized with a given convergence rate. An example of typical dynamical network of this class, having the Lorenz system at each node, has been used to demonstrate and verify the novel design proposed. And, the numerical simulation results show the effectiveness of proposed synchronization approaches. (general)
Delay-dependent exponential stability of cellular neural networks with time-varying delays
International Nuclear Information System (INIS)
Zhang Qiang; Wei Xiaopeng; Xu Jin
2005-01-01
The global exponential stability of cellular neural networks (CNNs) with time-varying delays is analyzed. Two new sufficient conditions ensuring global exponential stability for delayed CNNs are obtained. The conditions presented here are related to the size of delay. The stability results improve the earlier publications. Two examples are given to demonstrate the effectiveness of the obtained results
Asymptotic Delay Analysis for Cross-Layer Delay-Based Routing in Ad Hoc Networks
Directory of Open Access Journals (Sweden)
Philippe Jacquet
2007-01-01
Full Text Available This paper addresses the problem of the evaluation of the delay distribution via analytical means in IEEE 802.11 wireless ad hoc networks. We show that the asymptotic delay distribution can be expressed as a power law. Based on the latter result, we present a cross-layer delay estimation protocol and we derive new delay-distribution-based routing algorithms, which are well adapted to the QoS requirements of real-time multimedia applications. In fact, multimedia services are not sensitive to average delays, but rather to the asymptotic delay distributions. Indeed, video streaming applications drop frames when they are received beyond a delay threshold, determined by the buffer size. Although delay-distribution-based routing is an NP-hard problem, we show that it can be solved in polynomial time when the delay threshold is large, because of the asymptotic power law distribution of the link delays.
Congestion control for vehicular delay tolerant network routing protocols
Oham, Chuka Finbars
2014-01-01
The Vehicular Delay Tolerant Network (VDTN) is a special and challenging type of the Delay Tolerant Network because of its high mobility, frequent disconnections and nodal congestion features. These challenging features make it prone to congestion which leads to a considerable amount of message drops in the network. To minimize the impact of congestion in the network, we designed and implemented the Congestion Aware Spray and Wait (CASaW) routing protocol. We varied the buffer sizes of the no...
Global synchronization of a class of delayed complex networks
International Nuclear Information System (INIS)
Li Ping; Yi Zhang; Zhang Lei
2006-01-01
Global synchronization of a class of complex networks with time-varying delays is investigated in this paper. Some sufficient conditions are derived. These conditions show that the synchronization of delayed complex networks can be determined by their topologies. In addition, these conditions are simply represented in terms of the networks coupling matrix and are easy to be checked. A typical example of complex networks with chaotic nodes is employed to illustrate the obtained global synchronization results
Epidemic Network Failures in Optical Transport Networks
DEFF Research Database (Denmark)
Ruepp, Sarah Renée; Katsikas, Dimitrios; Fagertun, Anna Manolova
2013-01-01
This paper presents a failure propagation model for transport networks which are affected by epidemic failures. The network is controlled using the GMPLS protocol suite. The Susceptible Infected Disabled (SID) epidemic model is investigated and new signaling functionality of GMPLS to support...
Synchronization of complex delayed dynamical networks with nonlinearly coupled nodes
International Nuclear Information System (INIS)
Liu Tao; Zhao Jun; Hill, David J.
2009-01-01
In this paper, we study the global synchronization of nonlinearly coupled complex delayed dynamical networks with both directed and undirected graphs. Via Lyapunov-Krasovskii stability theory and the network topology, we investigate the global synchronization of such networks. Under the assumption that coupling coefficients are known, a family of delay-independent decentralized nonlinear feedback controllers are designed to globally synchronize the networks. When coupling coefficients are unavailable, an adaptive mechanism is introduced to synthesize a family of delay-independent decentralized adaptive controllers which guarantee the global synchronization of the uncertain networks. Two numerical examples of directed and undirected delayed dynamical network are given, respectively, using the Lorenz system as the nodes of the networks, which demonstrate the effectiveness of proposed results.
Stability analysis for cellular neural networks with variable delays
International Nuclear Information System (INIS)
Zhang Qiang; Wei Xiaopeng; Xu Jin
2006-01-01
Some sufficient conditions for the global exponential stability of cellular neural networks with variable delay are obtained by means of a method based on delay differential inequality. The method, which does not make use of Lyapunov functionals, is simple and effective for the stability analysis of neural networks with delay. Some previously established results in the literature are shown to be special cases of the presented result
Topology identification of the complex networks with non-delayed and delayed coupling
International Nuclear Information System (INIS)
Guo Wanli; Chen Shihua; Sun Wen
2009-01-01
In practical situation, there exists many uncertain information in complex networks, such as the topological structures. So the topology identification is an important issue in the research of the complex networks. Based on LaSalle's invariance principle, in this Letter, an adaptive controlling method is proposed to identify the topology of a weighted general complex network model with non-delayed and delayed coupling. Finally, simulation results show that the method is effective.
Delay-independent stability of genetic regulatory networks.
Wu, Fang-Xiang
2011-11-01
Genetic regulatory networks can be described by nonlinear differential equations with time delays. In this paper, we study both locally and globally delay-independent stability of genetic regulatory networks, taking messenger ribonucleic acid alternative splicing into consideration. Based on nonnegative matrix theory, we first develop necessary and sufficient conditions for locally delay-independent stability of genetic regulatory networks with multiple time delays. Compared to the previous results, these conditions are easy to verify. Then we develop sufficient conditions for global delay-independent stability for genetic regulatory networks. Compared to the previous results, this sufficient condition is less conservative. To illustrate theorems developed in this paper, we analyze delay-independent stability of two genetic regulatory networks: a real-life repressilatory network with three genes and three proteins, and a synthetic gene regulatory network with five genes and seven proteins. The simulation results show that the theorems developed in this paper can effectively determine the delay-independent stability of genetic regulatory networks.
Experiments with arbitrary networks in time-multiplexed delay systems
Hart, Joseph D.; Schmadel, Don C.; Murphy, Thomas E.; Roy, Rajarshi
2017-12-01
We report a new experimental approach using an optoelectronic feedback loop to investigate the dynamics of oscillators coupled on large complex networks with arbitrary topology. Our implementation is based on a single optoelectronic feedback loop with time delays. We use the space-time interpretation of systems with time delay to create large networks of coupled maps. Others have performed similar experiments using high-pass filters to implement the coupling; this restricts the network topology to the coupling of only a few nearest neighbors. In our experiment, the time delays and coupling are implemented on a field-programmable gate array, allowing the creation of networks with arbitrary coupling topology. This system has many advantages: the network nodes are truly identical, the network is easily reconfigurable, and the network dynamics occur at high speeds. We use this system to study cluster synchronization and chimera states in both small and large networks of different topologies.
Traffic Scheduling in WDM Passive Optical Network with Delay Guarantee
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
WDM passive optical network becomes more favorable as the required bandwidth increases, but currently few media access control algorithms adapted to WDM access network. This paper presented a new scheduling algorithm for bandwidth sharing in WDM passive optical networks, which provides per-flow delay guarantee and supports variable-length packets scheduling. Through theoretical analysis and simulation, the end-to-end delay bound and throughput fairness of the algorithm was demonstrated.
Scaling in public transport networks
Directory of Open Access Journals (Sweden)
C. von Ferber
2005-01-01
Full Text Available We analyse the statistical properties of public transport networks. These networks are defined by a set of public transport routes (bus lines and the stations serviced by these. For larger networks these appear to possess a scale-free structure, as it is demonstrated e.g. by the Zipf law distribution of the number of routes servicing a given station or for the distribution of the number of stations which can be visited from a chosen one without changing the means of transport. Moreover, a rather particular feature of the public transport network is that many routes service common subsets of stations. We discuss the possibility of new scaling laws that govern intrinsic properties of such subsets.
Partial synchronization in diffusively time-delay coupled oscillator networks
Steur, E.; Oguchi, T.; Leeuwen, van C.; Nijmeijer, H.
2012-01-01
We study networks of diffusively time-delay coupled oscillatory units and we show that networks with certain symmetries can exhibit a form of incomplete synchronization called partial synchronization. We present conditions for the existence and stability of partial synchronization modes in networks
Event-based simulation of networks with pulse delayed coupling
Klinshov, Vladimir; Nekorkin, Vladimir
2017-10-01
Pulse-mediated interactions are common in networks of different nature. Here we develop a general framework for simulation of networks with pulse delayed coupling. We introduce the discrete map governing the dynamics of such networks and describe the computation algorithm for its numerical simulation.
Spatial analysis of bus transport networks using network theory
Shanmukhappa, Tanuja; Ho, Ivan Wang-Hei; Tse, Chi Kong
2018-07-01
In this paper, we analyze the bus transport network (BTN) structure considering the spatial embedding of the network for three cities, namely, Hong Kong (HK), London (LD), and Bengaluru (BL). We propose a novel approach called supernode graph structuring for modeling the bus transport network. A static demand estimation procedure is proposed to assign the node weights by considering the points of interests (POIs) and the population distribution in the city over various localized zones. In addition, the end-to-end delay is proposed as a parameter to measure the topological efficiency of the bus networks instead of the shortest distance measure used in previous works. With the aid of supernode graph representation, important network parameters are analyzed for the directed, weighted and geo-referenced bus transport networks. It is observed that the supernode concept has significant advantage in analyzing the inherent topological behavior. For instance, the scale-free and small-world behavior becomes evident with supernode representation as compared to conventional or regular graph representation for the Hong Kong network. Significant improvement in clustering, reduction in path length, and increase in centrality values are observed in all the three networks with supernode representation. The correlation between topologically central nodes and the geographically central nodes reveals the interesting fact that the proposed static demand estimation method for assigning node weights aids in better identifying the geographically significant nodes in the network. The impact of these geographically significant nodes on the local traffic behavior is demonstrated by simulation using the SUMO (Simulation of Urban Mobility) tool which is also supported by real-world empirical data, and our results indicate that the traffic speed around a particular bus stop can reach a jammed state from a free flow state due to the presence of these geographically important nodes. A comparison
A novel delay-dependent criterion for delayed neural networks of neutral type
International Nuclear Information System (INIS)
Lee, S.M.; Kwon, O.M.; Park, Ju H.
2010-01-01
This Letter considers a robust stability analysis method for delayed neural networks of neutral type. By constructing a new Lyapunov functional, a novel delay-dependent criterion for the stability is derived in terms of LMIs (linear matrix inequalities). A less conservative stability criterion is derived by using nonlinear properties of the activation function of the neural networks. Two numerical examples are illustrated to show the effectiveness of the proposed method.
Novel global robust stability criterion for neural networks with delay
International Nuclear Information System (INIS)
Singh, Vimal
2009-01-01
A novel criterion for the global robust stability of Hopfield-type interval neural networks with delay is presented. An example illustrating the improvement of the present criterion over several recently reported criteria is given.
An adaptive robust controller for time delay maglev transportation systems
Milani, Reza Hamidi; Zarabadipour, Hassan; Shahnazi, Reza
2012-12-01
For engineering systems, uncertainties and time delays are two important issues that must be considered in control design. Uncertainties are often encountered in various dynamical systems due to modeling errors, measurement noises, linearization and approximations. Time delays have always been among the most difficult problems encountered in process control. In practical applications of feedback control, time delay arises frequently and can severely degrade closed-loop system performance and in some cases, drives the system to instability. Therefore, stability analysis and controller synthesis for uncertain nonlinear time-delay systems are important both in theory and in practice and many analytical techniques have been developed using delay-dependent Lyapunov function. In the past decade the magnetic and levitation (maglev) transportation system as a new system with high functionality has been the focus of numerous studies. However, maglev transportation systems are highly nonlinear and thus designing controller for those are challenging. The main topic of this paper is to design an adaptive robust controller for maglev transportation systems with time-delay, parametric uncertainties and external disturbances. In this paper, an adaptive robust control (ARC) is designed for this purpose. It should be noted that the adaptive gain is derived from Lyapunov-Krasovskii synthesis method, therefore asymptotic stability is guaranteed.
Successive lag synchronization on dynamical networks with communication delay
International Nuclear Information System (INIS)
Zhang Xin-Jian; Wei Ai-Ju; Li Ke-Zan
2016-01-01
In this paper, successive lag synchronization (SLS) on a dynamical network with communication delay is investigated. In order to achieve SLS on the dynamical network with communication delay, we design linear feedback control and adaptive control, respectively. By using the Lyapunov function method, we obtain some sufficient conditions for global stability of SLS. To verify these results, some numerical examples are further presented. This work may find potential applications in consensus of multi-agent systems. (paper)
Exponential stability of delayed fuzzy cellular neural networks with diffusion
International Nuclear Information System (INIS)
Huang Tingwen
2007-01-01
The exponential stability of delayed fuzzy cellular neural networks (FCNN) with diffusion is investigated. Exponential stability, significant for applications of neural networks, is obtained under conditions that are easily verified by a new approach. Earlier results on the exponential stability of FCNN with time-dependent delay, a special case of the model studied in this paper, are improved without using the time-varying term condition: dτ(t)/dt < μ
ABOUT HYBRID BIDIRECTIONAL ASSOCIATIVE MEMORY NEURAL NETWORKS WITH DISCRETE DELAYS
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In this paper, hybrid bidirectional associative memory neural networks with discrete delays is considered. By ingeniously importing real parameters di > 0(i = 1,2,···,n) which can be adjusted, we establish some new sufficient conditions for the dynamical characteristics of hybrid bidirectional associative memory neural networks with discrete delays by the method of variation of parameters and some analysis techniques. Our results generalize and improve the related results in [10,11]. Our work is significant...
International Nuclear Information System (INIS)
Wang Yao; Wang Zidong; Liang Jinling
2008-01-01
In this Letter, the synchronization problem is investigated for a class of stochastic complex networks with time delays. By utilizing a new Lyapunov functional form based on the idea of 'delay fractioning', we employ the stochastic analysis techniques and the properties of Kronecker product to establish delay-dependent synchronization criteria that guarantee the globally asymptotically mean-square synchronization of the addressed delayed networks with stochastic disturbances. These sufficient conditions, which are formulated in terms of linear matrix inequalities (LMIs), can be solved efficiently by the LMI toolbox in Matlab. The main results are proved to be much less conservative and the conservatism could be reduced further as the number of delay fractioning gets bigger. A simulation example is exploited to demonstrate the advantage and applicability of the proposed result
Logistic control in automated transportation networks
Ebben, Mark
2001-01-01
Increasing congestion problems lead to a search for alternative transportation systems. Automated transportation networks, possibly underground, are an option. Logistic control systems are essential for future implementations of such automated transportation networks. This book contributes to the
Complex network synchronization of chaotic systems with delay coupling
International Nuclear Information System (INIS)
Theesar, S. Jeeva Sathya; Ratnavelu, K.
2014-01-01
The study of complex networks enables us to understand the collective behavior of the interconnected elements and provides vast real time applications from biology to laser dynamics. In this paper, synchronization of complex network of chaotic systems has been studied. Every identical node in the complex network is assumed to be in Lur’e system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology
Quantitative Efficiency Evaluation Method for Transportation Networks
Directory of Open Access Journals (Sweden)
Jin Qin
2014-11-01
Full Text Available An effective evaluation of transportation network efficiency/performance is essential to the establishment of sustainable development in any transportation system. Based on a redefinition of transportation network efficiency, a quantitative efficiency evaluation method for transportation network is proposed, which could reflect the effects of network structure, traffic demands, travel choice, and travel costs on network efficiency. Furthermore, the efficiency-oriented importance measure for network components is presented, which can be used to help engineers identify the critical nodes and links in the network. The numerical examples show that, compared with existing efficiency evaluation methods, the network efficiency value calculated by the method proposed in this paper can portray the real operation situation of the transportation network as well as the effects of main factors on network efficiency. We also find that the network efficiency and the importance values of the network components both are functions of demands and network structure in the transportation network.
Global synchronization of general delayed complex networks with stochastic disturbances
International Nuclear Information System (INIS)
Tu Li-Lan
2011-01-01
In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous-time networks with time-varying delay. Based on the stochastic Lyapunov stability theory, Ito's differential rule and the linear matrix inequality (LMI) optimization technique, several delay-dependent synchronous criteria are established, which guarantee the asymptotical mean-square synchronization of drive networks and response networks with stochastic disturbances. The criteria are expressed in terms of LMI, which can be easily solved using the Matlab LMI Control Toolbox. Finally, two examples show the effectiveness and feasibility of the proposed synchronous conditions. (general)
Representative Delay Measurements (RDM: Facing the Challenge of Modern Networks
Directory of Open Access Journals (Sweden)
Joachim Fabini
2015-02-01
Full Text Available Network access technologies have evolved significantly in the last years. They deploy novel mechanisms like reactive capacity allocation and time-slotted operation to optimize overall network capacity. From a single node's perspective, such optimizations decrease network determinism and measurement repeatability. Evolving application fields like machine to machine (M2M communications or real-time gaming often have strict real-time requirements to operate correctly. Highly accurate delay measurements are necessary to monitor network compliance with application demands or to detect deviations of normal network behavior, which may be caused by network failures, misconfigurations or attacks. This paper analyzes factors that challenge active delay measurements in modern networks. It introduces the Representative Delay Measurement tool (RDM that addresses these factors and proposes solutions that conform to requirements of the recently published RFC7312. Delay measurement results acquired using RDM in live networks confirm that advanced measurement methods can significantly improve the quality of measurement samples by isolating systematic network behavior. The resulting high-quality samples are one prerequisite for accurate statistics that support proper operation of subsequent algorithms and applications.
Graphs, Ideal Flow, and the Transportation Network
Teknomo, Kardi
2016-01-01
This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.
Delay-induced cluster patterns in coupled Cayley tree networks
Singh, A.; Jalan, S.
2013-07-01
We study effects of delay in diffusively coupled logistic maps on the Cayley tree networks. We find that smaller coupling values exhibit sensitiveness to value of delay, and lead to different cluster patterns of self-organized and driven types. Whereas larger coupling strengths exhibit robustness against change in delay values, and lead to stable driven clusters comprising nodes from last generation of the Cayley tree. Furthermore, introduction of delay exhibits suppression as well as enhancement of synchronization depending upon coupling strength values. To the end we discuss the importance of results to understand conflicts and cooperations observed in family business.
Delay Bound: Fractal Traffic Passes through Network Servers
Directory of Open Access Journals (Sweden)
Ming Li
2013-01-01
Full Text Available Delay analysis plays a role in real-time systems in computer communication networks. This paper gives our results in the aspect of delay analysis of fractal traffic passing through servers. There are three contributions presented in this paper. First, we will explain the reasons why conventional theory of queuing systems ceases in the general sense when arrival traffic is fractal. Then, we will propose a concise method of delay computation for hard real-time systems as shown in this paper. Finally, the delay computation of fractal traffic passing through severs is presented.
Global exponential stability for nonautonomous cellular neural networks with delays
International Nuclear Information System (INIS)
Zhang Qiang; Wei Xiaopeng; Xu Jin
2006-01-01
In this Letter, by utilizing Lyapunov functional method and Halanay inequalities, we analyze global exponential stability of nonautonomous cellular neural networks with delay. Several new sufficient conditions ensuring global exponential stability of the network are obtained. The results given here extend and improve the earlier publications. An example is given to demonstrate the effectiveness of the obtained results
Complex Dynamics of Delay-Coupled Neural Networks
Mao, Xiaochen
2016-09-01
This paper reveals the complicated dynamics of a delay-coupled system that consists of a pair of sub-networks and multiple bidirectional couplings. Time delays are introduced into the internal connections and network-couplings, respectively. The stability and instability of the coupled network are discussed. The sufficient conditions for the existence of oscillations are given. Case studies of numerical simulations are given to validate the analytical results. Interesting and complicated neuronal activities are observed numerically, such as rest states, periodic oscillations, multiple switches of rest states and oscillations, and the coexistence of different types of oscillations.
Autonomous Congestion Control in Delay-Tolerant Networks
Burleigh, Scott; Jennings, Esther; Schoolcraft, Joshua
2006-01-01
This presentation highlights communication congestion control in delay-tolerant networks (DTNs). Large-scale future space exploration will offer complex communication challenges that may be best addressed by establishing a network infrastructure. However, current internet techniques for congestion control are not well suited for operation of a network over interplanetary distances. An alternative, delay-tolerant technique for congestion control in a delay-tolerant network is presented. A simple DTN was constructed and an experimental congestion control mechanism was applied. The mechanism appeared to be effective and each router was able to make its bundle acceptance decisions autonomously. Future research will examine more complex topologies and alternative bundle acceptance rules that might enhance performance.
Delay-range-dependent exponential H∞ synchronization of a class of delayed neural networks
International Nuclear Information System (INIS)
Karimi, Hamid Reza; Maass, Peter
2009-01-01
This article aims to present a multiple delayed state-feedback control design for exponential H ∞ synchronization problem of a class of delayed neural networks with multiple time-varying discrete delays. On the basis of the drive-response concept and by introducing a descriptor technique and using Lyapunov-Krasovskii functional, new delay-range-dependent sufficient conditions for exponential H ∞ synchronization of the drive-response structure of neural networks are driven in terms of linear matrix inequalities (LMIs). The explicit expression of the controller gain matrices are parameterized based on the solvability conditions such that the drive system and the response system can be exponentially synchronized. A numerical example is included to illustrate the applicability of the proposed design method.
Directory of Open Access Journals (Sweden)
Cao Jinde
2011-01-01
Full Text Available Abstract In this paper, an integral sliding mode control approach is presented to investigate synchronization of nonidentical chaotic neural networks with discrete and distributed time-varying delays as well as leakage delay. By considering a proper sliding surface and constructing Lyapunov-Krasovskii functional, as well as employing a combination of the free-weighting matrix method, Newton-Leibniz formulation and inequality technique, a sliding mode controller is designed to achieve the asymptotical synchronization of the addressed nonidentical neural networks. Moreover, a sliding mode control law is also synthesized to guarantee the reachability of the specified sliding surface. The provided conditions are expressed in terms of linear matrix inequalities, and are dependent on the discrete and distributed time delays as well as leakage delay. A simulation example is given to verify the theoretical results.
Pinning synchronization of the complex networks with non-delayed and delayed coupling
International Nuclear Information System (INIS)
Guo Wanli; Austin, Francis; Chen Shihua; Sun Wen
2009-01-01
In this Letter, without assuming the symmetry of the coupling matrix, we investigate the global synchronization of the complex networks with non-delayed and delayed coupling based on the pinning controllers. Some sufficient conditions for the global synchronization by adding linear and adaptive feedback controllers to a part of nodes are obtained. Numerical examples are also provided to demonstrate the effectiveness of the theory.
Mean Square Synchronization of Stochastic Nonlinear Delayed Coupled Complex Networks
Directory of Open Access Journals (Sweden)
Chengrong Xie
2013-01-01
Full Text Available We investigate the problem of adaptive mean square synchronization for nonlinear delayed coupled complex networks with stochastic perturbation. Based on the LaSalle invariance principle and the properties of the Weiner process, the controller and adaptive laws are designed to ensure achieving stochastic synchronization and topology identification of complex networks. Sufficient conditions are given to ensure the complex networks to be mean square synchronization. Furthermore, numerical simulations are also given to demonstrate the effectiveness of the proposed scheme.
Singular Perturbation Analysis and Gene Regulatory Networks with Delay
Shlykova, Irina; Ponosov, Arcady
2009-09-01
There are different ways of how to model gene regulatory networks. Differential equations allow for a detailed description of the network's dynamics and provide an explicit model of the gene concentration changes over time. Production and relative degradation rate functions used in such models depend on the vector of steeply sloped threshold functions which characterize the activity of genes. The most popular example of the threshold functions comes from the Boolean network approach, where the threshold functions are given by step functions. The system of differential equations becomes then piecewise linear. The dynamics of this system can be described very easily between the thresholds, but not in the switching domains. For instance this approach fails to analyze stationary points of the system and to define continuous solutions in the switching domains. These problems were studied in [2], [3], but the proposed model did not take into account a time delay in cellular systems. However, analysis of real gene expression data shows a considerable number of time-delayed interactions suggesting that time delay is essential in gene regulation. Therefore, delays may have a great effect on the dynamics of the system presenting one of the critical factors that should be considered in reconstruction of gene regulatory networks. The goal of this work is to apply the singular perturbation analysis to certain systems with delay and to obtain an analog of Tikhonov's theorem, which provides sufficient conditions for constracting the limit system in the delay case.
Topology Identification of General Dynamical Network with Distributed Time Delays
International Nuclear Information System (INIS)
Zhao-Yan, Wu; Xin-Chu, Fu
2009-01-01
General dynamical networks with distributed time delays are studied. The topology of the networks are viewed as unknown parameters, which need to be identified. Some auxiliary systems (also called the network estimators) are designed to achieve this goal. Both linear feedback control and adaptive strategy are applied in designing these network estimators. Based on linear matrix inequalities and the Lyapunov function method, the sufficient condition for the achievement of topology identification is obtained. This method can also better monitor the switching topology of dynamical networks. Illustrative examples are provided to show the effectiveness of this method. (general)
International Nuclear Information System (INIS)
Zheng Song
2012-01-01
In this paper, the exponential synchronization between two nonlinearly coupled complex networks with non-delayed and delayed coupling is investigated with Lyapunov-Krasovskii-type functionals. Based on the stability analysis of the impulsive differential equation and the linear matrix inequality, sufficient delay-dependent conditions for exponential synchronization are derived, and a linear impulsive controller and simple updated laws are also designed. Furthermore, the coupling matrices need not be symmetric or irreducible. Numerical examples are presented to verify the effectiveness and correctness of the synchronization criteria obtained.
Chen, Guiling; Li, Dingshi; Shi, Lin; van Gaans, Onno; Verduyn Lunel, Sjoerd
2018-03-01
We present new conditions for asymptotic stability and exponential stability of a class of stochastic recurrent neural networks with discrete and distributed time varying delays. Our approach is based on the method using fixed point theory, which do not resort to any Liapunov function or Liapunov functional. Our results neither require the boundedness, monotonicity and differentiability of the activation functions nor differentiability of the time varying delays. In particular, a class of neural networks without stochastic perturbations is also considered. Examples are given to illustrate our main results.
Sliding Intermittent Control for BAM Neural Networks with Delays
Directory of Open Access Journals (Sweden)
Jianqiang Hu
2013-01-01
Full Text Available This paper addresses the exponential stability problem for a class of delayed bidirectional associative memory (BAM neural networks with delays. A sliding intermittent controller which takes the advantages of the periodically intermittent control idea and the impulsive control scheme is proposed and employed to the delayed BAM system. With the adjustable parameter taking different particular values, such a sliding intermittent control method can comprise several kinds of control schemes as special cases, such as the continuous feedback control, the impulsive control, the periodically intermittent control, and the semi-impulsive control. By using analysis techniques and the Lyapunov function methods, some sufficient criteria are derived for the closed-loop delayed BAM neural networks to be globally exponentially stable. Finally, two illustrative examples are given to show the effectiveness of the proposed control scheme and the obtained theoretical results.
Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks
Dudukovich, Rachel; Raible, Daniel E.
2016-01-01
The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.
Modular networks with delayed coupling: Synchronization and frequency control
Maslennikov, Oleg V.; Nekorkin, Vladimir I.
2014-07-01
We study the collective dynamics of modular networks consisting of map-based neurons which generate irregular spike sequences. Three types of intramodule topology are considered: a random Erdös-Rényi network, a small-world Watts-Strogatz network, and a scale-free Barabási-Albert network. The interaction between the neurons of different modules is organized by relatively sparse connections with time delay. For all the types of the network topology considered, we found that with increasing delay two regimes of module synchronization alternate with each other: inphase and antiphase. At the same time, the average rate of collective oscillations decreases within each of the time-delay intervals corresponding to a particular synchronization regime. A dual role of the time delay is thus established: controlling a synchronization mode and degree and controlling an average network frequency. Furthermore, we investigate the influence on the modular synchronization by other parameters: the strength of intermodule coupling and the individual firing rate.
Global robust exponential stability for interval neural networks with delay
International Nuclear Information System (INIS)
Cui Shihua; Zhao Tao; Guo Jie
2009-01-01
In this paper, new sufficient conditions for globally robust exponential stability of neural networks with either constant delays or time-varying delays are given. We show the sufficient conditions for the existence, uniqueness and global robust exponential stability of the equilibrium point by employing Lyapunov stability theory and linear matrix inequality (LMI) technique. Numerical examples are given to show the approval of our results.
A ternary logic model for recurrent neuromime networks with delay.
Hangartner, R D; Cull, P
1995-07-01
In contrast to popular recurrent artificial neural network (RANN) models, biological neural networks have unsymmetric structures and incorporate significant delays as a result of axonal propagation. Consequently, biologically inspired neural network models are more accurately described by nonlinear differential-delay equations rather than nonlinear ordinary differential equations (ODEs), and the standard techniques for studying the dynamics of RANNs are wholly inadequate for these models. This paper develops a ternary-logic based method for analyzing these networks. Key to the technique is the realization that a nonzero delay produces a bounded stability region. This result significantly simplifies the construction of sufficient conditions for characterizing the network equilibria. If the network gain is large enough, each equilibrium can be classified as either asymptotically stable or unstable. To illustrate the analysis technique, the swim central pattern generator (CPG) of the sea slug Tritonia diomedea is examined. For wide range of reasonable parameter values, the ternary analysis shows that none of the network equilibria are stable, and thus the network must oscillate. The results show that complex synaptic dynamics are not necessary for pattern generation.
Robust stability bounds for multi-delay networked control systems
Seitz, Timothy; Yedavalli, Rama K.; Behbahani, Alireza
2018-04-01
In this paper, the robust stability of a perturbed linear continuous-time system is examined when controlled using a sampled-data networked control system (NCS) framework. Three new robust stability bounds on the time-invariant perturbations to the original continuous-time plant matrix are presented guaranteeing stability for the corresponding discrete closed-loop augmented delay-free system (ADFS) with multiple time-varying sensor and actuator delays. The bounds are differentiated from previous work by accounting for the sampled-data nature of the NCS and for separate communication delays for each sensor and actuator, not a single delay. Therefore, this paper expands the knowledge base in multiple inputs multiple outputs (MIMO) sampled-data time delay systems. Bounds are presented for unstructured, semi-structured, and structured perturbations.
A new delay-independent condition for global robust stability of neural networks with time delays.
Samli, Ruya
2015-06-01
This paper studies the problem of robust stability of dynamical neural networks with discrete time delays under the assumptions that the network parameters of the neural system are uncertain and norm-bounded, and the activation functions are slope-bounded. By employing the results of Lyapunov stability theory and matrix theory, new sufficient conditions for the existence, uniqueness and global asymptotic stability of the equilibrium point for delayed neural networks are presented. The results reported in this paper can be easily tested by checking some special properties of symmetric matrices associated with the parameter uncertainties of neural networks. We also present a numerical example to show the effectiveness of the proposed theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.
Exponentially convergent state estimation for delayed switched recurrent neural networks.
Ahn, Choon Ki
2011-11-01
This paper deals with the delay-dependent exponentially convergent state estimation problem for delayed switched neural networks. A set of delay-dependent criteria is derived under which the resulting estimation error system is exponentially stable. It is shown that the gain matrix of the proposed state estimator is characterised in terms of the solution to a set of linear matrix inequalities (LMIs), which can be checked readily by using some standard numerical packages. An illustrative example is given to demonstrate the effectiveness of the proposed state estimator.
Delay-slope-dependent stability results of recurrent neural networks.
Li, Tao; Zheng, Wei Xing; Lin, Chong
2011-12-01
By using the fact that the neuron activation functions are sector bounded and nondecreasing, this brief presents a new method, named the delay-slope-dependent method, for stability analysis of a class of recurrent neural networks with time-varying delays. This method includes more information on the slope of neuron activation functions and fewer matrix variables in the constructed Lyapunov-Krasovskii functional. Then some improved delay-dependent stability criteria with less computational burden and conservatism are obtained. Numerical examples are given to illustrate the effectiveness and the benefits of the proposed method.
Biological transportation networks: Modeling and simulation
Albi, Giacomo; Artina, Marco; Foransier, Massimo; Markowich, Peter A.
2015-01-01
We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation
Global robust stability of delayed recurrent neural networks
International Nuclear Information System (INIS)
Cao Jinde; Huang Deshuang; Qu Yuzhong
2005-01-01
This paper is concerned with the global robust stability of a class of delayed interval recurrent neural networks which contain time-invariant uncertain parameters whose values are unknown but bounded in given compact sets. A new sufficient condition is presented for the existence, uniqueness, and global robust stability of equilibria for interval neural networks with time delays by constructing Lyapunov functional and using matrix-norm inequality. An error is corrected in an earlier publication, and an example is given to show the effectiveness of the obtained results
Inhibition delay increases neural network capacity through Stirling transform
Nogaret, Alain; King, Alastair
2018-03-01
Inhibitory neural networks are found to encode high volumes of information through delayed inhibition. We show that inhibition delay increases storage capacity through a Stirling transform of the minimum capacity which stabilizes locally coherent oscillations. We obtain both the exact and asymptotic formulas for the total number of dynamic attractors. Our results predict a (ln2) -N-fold increase in capacity for an N -neuron network and demonstrate high-density associative memories which host a maximum number of oscillations in analog neural devices.
Biological transportation networks: Modeling and simulation
Albi, Giacomo
2015-09-15
We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.
A Data-Driven Air Transportation Delay Propagation Model Using Epidemic Process Models
Directory of Open Access Journals (Sweden)
B. Baspinar
2016-01-01
Full Text Available In air transport network management, in addition to defining the performance behavior of the system’s components, identification of their interaction dynamics is a delicate issue in both strategic and tactical decision-making process so as to decide which elements of the system are “controlled” and how. This paper introduces a novel delay propagation model utilizing epidemic spreading process, which enables the definition of novel performance indicators and interaction rates of the elements of the air transportation network. In order to understand the behavior of the delay propagation over the network at different levels, we have constructed two different data-driven epidemic models approximating the dynamics of the system: (a flight-based epidemic model and (b airport-based epidemic model. The flight-based epidemic model utilizing SIS epidemic model focuses on the individual flights where each flight can be in susceptible or infected states. The airport-centric epidemic model, in addition to the flight-to-flight interactions, allows us to define the collective behavior of the airports, which are modeled as metapopulations. In network model construction, we have utilized historical flight-track data of Europe and performed analysis for certain days involving certain disturbances. Through this effort, we have validated the proposed delay propagation models under disruptive events.
International Nuclear Information System (INIS)
Xu, Changjin; Li, Peiluan
2017-01-01
This paper is concerned with a class of neutral-type Hopfield neural networks with multi-proportional delays and leakage delays. Using the differential inequality theory, a set of sufficient conditions which guarantee that all solutions of neutral-type Hopfield neural networks with multi-proportional delays and leakage delays converge exponentially to zero vector are derived. Computer simulations are carried out to verify our theoretical findings. The obtained results of this paper are new and complement some previous studies.
Novel results for global robust stability of delayed neural networks
International Nuclear Information System (INIS)
Yucel, Eylem; Arik, Sabri
2009-01-01
This paper investigates the global robust convergence properties of continuous-time neural networks with discrete time delays. By employing suitable Lyapunov functionals, some sufficient conditions for the existence, uniqueness and global robust asymptotic stability of the equilibrium point are derived. The conditions can be easily verified as they can be expressed in terms of the network parameters only. Some numerical examples are also given to compare our results with previous robust stability results derived in the literature.
Global asymptotic stability of delayed Cohen-Grossberg neural networks
International Nuclear Information System (INIS)
Wu Wei; Cui Baotong; Huang Min
2007-01-01
In this letter, the global asymptotic stability of a class of Cohen-Grossberg neural networks with time-varying delays is discussed. A new set of sufficient conditions for the neural networks are proposed to guarantee the global asymptotic convergence. Our criteria represent an extension of the existing results in literatures. An example is also presented to compare our results with the previous results
Power and delay optimisation in multi-hop wireless networks
Xia, Li; Shihada, Basem
2014-01-01
in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi
Mean square exponential stability of stochastic delayed Hopfield neural networks
International Nuclear Information System (INIS)
Wan Li; Sun Jianhua
2005-01-01
Stochastic effects to the stability property of Hopfield neural networks (HNN) with discrete and continuously distributed delay are considered. By using the method of variation parameter, inequality technique and stochastic analysis, the sufficient conditions to guarantee the mean square exponential stability of an equilibrium solution are given. Two examples are also given to demonstrate our results
Stability analysis of delayed genetic regulatory networks with stochastic disturbances
Energy Technology Data Exchange (ETDEWEB)
Zhou Qi, E-mail: zhouqilhy@yahoo.com.c [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China); Xu Shengyuan [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China); Chen Bing [Institute of Complexity Science, Qingdao University, Qingdao 266071, Shandong (China); Li Hongyi [Space Control and Inertial Technology Research Center, Harbin Institute of Technology, Harbin 150001 (China); Chu Yuming [Department of Mathematics, Huzhou Teacher' s College, Huzhou 313000, Zhejiang (China)
2009-10-05
This Letter considers the problem of stability analysis of a class of delayed genetic regulatory networks with stochastic disturbances. The delays are assumed to be time-varying and bounded. By utilizing Ito's differential formula and Lyapunov-Krasovskii functionals, delay-range-dependent and rate-dependent (rate-independent) stability criteria are proposed in terms of linear matrices inequalities. An important feature of the proposed results is that all the stability conditions are dependent on the upper and lower bounds of the delays. Another important feature is that the obtained stability conditions are less conservative than certain existing ones in the literature due to introducing some appropriate free-weighting matrices. A simulation example is employed to illustrate the applicability and effectiveness of the proposed methods.
Global synchronization in arrays of delayed neural networks with constant and delayed coupling
International Nuclear Information System (INIS)
Cao Jinde; Li Ping; Wang Weiwei
2006-01-01
This Letter investigates the global exponential synchronization in arrays of coupled identical delayed neural networks (DNNs) with constant and delayed coupling. By referring to Lyapunov functional method and Kronecker product technique, some sufficient conditions are derived for global synchronization of such systems. These new synchronization criteria offer some adjustable matrix parameters, which is of important significance in the design and applications of such coupled DNNs, and the results improve and extend the earlier works. Finally, an example is given to illustrate the theoretical results
International Nuclear Information System (INIS)
Zhu Xunlin; Wang Youyi
2009-01-01
This Letter studies the exponential stability for a class of neural networks (NNs) with both discrete and distributed time-varying delays. Under weaker assumptions on the activation functions, by defining a more general type of Lyapunov functionals and developing a new convex combination technique, new less conservative and less complex stability criteria are established to guarantee the global exponential stability of the discussed NNs. The obtained conditions are dependent on both discrete and distributed delays, are expressed in terms of linear matrix inequalities (LMIs), and contain fewer decision variables. Numerical examples are given to illustrate the effectiveness and the less conservatism of the proposed conditions.
Pinning impulsive synchronization of stochastic delayed coupled networks
International Nuclear Information System (INIS)
Tang Yang; Fang Jian-An; Wong W K; Miao Qing-Ying
2011-01-01
In this paper, the pinning synchronization problem of stochastic delayed complex network (SDCN) is investigated by using a novel hybrid pinning controller. The proposed hybrid pinning controller is composed of adaptive controller and impulsive controller, where the two controllers are both added to a fraction of nodes in the network. Using the Lyapunov stability theory and the novel hybrid pinning controller, some sufficient conditions are derived for the exponential synchronization of such dynamical networks in mean square. Two numerical simulation examples are provided to verify the effectiveness of the proposed approach. The simulation results show that the proposed control scheme has a fast convergence rate compared with the conventional adaptive pinning method. (general)
Fei, Zhongyang; Guan, Chaoxu; Gao, Huijun; Zhongyang Fei; Chaoxu Guan; Huijun Gao; Fei, Zhongyang; Guan, Chaoxu; Gao, Huijun
2018-06-01
This paper is concerned with the exponential synchronization for master-slave chaotic delayed neural network with event trigger control scheme. The model is established on a network control framework, where both external disturbance and network-induced delay are taken into consideration. The desired aim is to synchronize the master and slave systems with limited communication capacity and network bandwidth. In order to save the network resource, we adopt a hybrid event trigger approach, which not only reduces the data package sending out, but also gets rid of the Zeno phenomenon. By using an appropriate Lyapunov functional, a sufficient criterion for the stability is proposed for the error system with extended ( , , )-dissipativity performance index. Moreover, hybrid event trigger scheme and controller are codesigned for network-based delayed neural network to guarantee the exponential synchronization between the master and slave systems. The effectiveness and potential of the proposed results are demonstrated through a numerical example.
A feedback control model for network flow with multiple pure time delays
Press, J.
1972-01-01
A control model describing a network flow hindered by multiple pure time (or transport) delays is formulated. Feedbacks connect each desired output with a single control sector situated at the origin. The dynamic formulation invokes the use of differential difference equations. This causes the characteristic equation of the model to consist of transcendental functions instead of a common algebraic polynomial. A general graphical criterion is developed to evaluate the stability of such a problem. A digital computer simulation confirms the validity of such criterion. An optimal decision making process with multiple delays is presented.
A Novel Message Scheduling Framework for Delay Tolerant Networks Routing
Elwhishi, Ahmed
2013-05-01
Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.
Next Generation Reliable Transport Networks
DEFF Research Database (Denmark)
Zhang, Jiang
the wavelength and fiber assignment problem is proposed and implemented for avionic optical transport networks. Simulation results give out resource consumptions and prove the efficiency of the proposed mechanisms. Finally, a Home Environment Service Knowledge Management system is proposed. Through ontology...... technologies, a knowledge base is constructed to represent the whole information of a home environment. By applying the reasoner tool, the proposed system manages to keep the consistency in a home environment and helps all software configure and update procedures across multiple vendors....... of criticality and security, there are certain physical or logical segregation requirements between the avionic systems. Such segregations can be implemented on the proposed avionic networks with different hierarchies. In order to fulfill the segregation requirements, a tailored heuristic approach for solving...
Zhang, Chuan; Wang, Xingyuan; Wang, Chunpeng; Xia, Zhiqiu
This paper concerns the outer synchronization problem between two complex delayed networks via the method of aperiodically intermittent pinning control. Apart from previous works, internal delay and coupling delay are both involved in this model, and the designed intermittent controllers can be aperiodic. The main work in this paper can be summarized as follows: First, two cases of aperiodically intermittent control with constant gain and adaptive gain are implemented, respectively. The intermittent control and pinning control are combined to reduce consumptions further. Then, based on the Lyapunov stability theory, synchronization protocols are given by strict derivation. Especially, the designed controllers are indeed simple and valid in application of theory to practice. Finally, numerical examples put the proposed control methods to the test.
Delay-Dependent Control for Networked Control Systems with Large Delays
Directory of Open Access Journals (Sweden)
Yilin Wang
2013-01-01
Full Text Available We consider the problems of robust stability and control for a class of networked control systems with long-time delays. Firstly, a nonlinear discrete time model with mode-dependent time delays is proposed by converting the uncertainty of time delay into the uncertainty of parameter matrices. We consider a probabilistic case where the system is switched among different subsystems, and the probability of each subsystem being active is defined as its occurrence probability. For a switched system with a known subsystem occurrence probabilities, we give a stochastic stability criterion in terms of linear matrix inequalities (LMIs. Then, we extend the results to a more practical case where the subsystem occurrence probabilities are uncertain. Finally, a simulation example is presented to show the efficacy of the proposed method.
Transport on river networks: A dynamical approach
Zaliapin, I; Foufoula-Georgiou, E; Ghil, M
2017-01-01
This study is motivated by problems related to environmental transport on river networks. We establish statistical properties of a flow along a directed branching network and suggest its compact parameterization. The downstream network transport is treated as a particular case of nearest-neighbor hierarchical aggregation with respect to the metric induced by the branching structure of the river network. We describe the static geometric structure of a drainage network by a tree, referred to as...
Structural and functional networks in complex systems with delay.
Eguíluz, Víctor M; Pérez, Toni; Borge-Holthoefer, Javier; Arenas, Alex
2011-05-01
Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in a system of diffusively delay-coupled elements in complex networks. We solve exactly the resulting equations in motifs (directed structures of three nodes) and in directed networks. The mean-field solution for directed uncorrelated networks shows that the clusterization of the activity is dominated by the in-degree of the nodes, and that the locking frequency decreases with increasing average degree. We find that the exponent of a power law degree distribution of the structural topology γ is related to the exponent of the associated functional network as α=(2-γ)(-1) for γ<2. © 2011 American Physical Society
Studying Electromechanical Wave Propagation and Transport Delays in Power Systems
Dasgupta, Kalyan; Kulkarni, A. M.; Soman, Shreevardhan
2013-05-01
Abstract: In this paper, we make an attempt to describe the phenomenon of wave propagation when a disturbance is introduced in an electromechanical system. The focus is mainly on generator trips in a power system. Ordering of the generators is first done using a sensitivity matrix. Thereafter, orthogonal decomposition of the ordered generators is done to group them based on their participation in different modes. Finally, we find the velocity of propagation of the wave and the transport delay associated with it using the ESPRIT method. The analysis done on generators from the eastern and western regions of India.1
On minimizing the maximum broadcast decoding delay for instantly decodable network coding
Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.
2014-01-01
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a
Periodic bidirectional associative memory neural networks with distributed delays
Chen, Anping; Huang, Lihong; Liu, Zhigang; Cao, Jinde
2006-05-01
Some sufficient conditions are obtained for the existence and global exponential stability of a periodic solution to the general bidirectional associative memory (BAM) neural networks with distributed delays by using the continuation theorem of Mawhin's coincidence degree theory and the Lyapunov functional method and the Young's inequality technique. These results are helpful for designing a globally exponentially stable and periodic oscillatory BAM neural network, and the conditions can be easily verified and be applied in practice. An example is also given to illustrate our results.
Further results on passivity analysis of delayed cellular neural networks
International Nuclear Information System (INIS)
Park, Ju H.
2007-01-01
The passivity condition for delayed neural networks with uncertainties is considered in this article. From simple extension of a recent work for stability analysis of the system, a new criterion for the passivity of the system is derived in terms of linear matrix inequalities (LMIs), which can be easily solved by using various convex optimization algorithms. A numerical example is given to show the usefulness of our result
Toeless pulse shaping with a single delay-line network
International Nuclear Information System (INIS)
Tauhata, L.; Binns, D.C.
1976-04-01
New unipolar delay-line clippers producing negligible cancellation remnant have been developed. Near perfect clipping is achieved using a combination of several types of coaxial cable tranformers working as a phase inverter, a new pulse adder, or an impedance transformer. Only passive elements are used in the bridge network. The construction is simple and the performance is extremely stable and wide in dynamic range and frequency band width. Completely symmetrical bipolar pulses are also easily obtained using this technique
Destabilizing Effects of Impulse in Delayed Bam Neural Networks
Li, Chuandong; Li, Chaojie; Liu, Chao
This paper further studies the global exponential stability of the equilibrium point of the delayed bidirectional associative memory (DBAM) neural networks with impulse effects. Several results characterizing the aggregated effects of impulse and dynamical property of the impulse-free DBAM on the exponential stability of the considered DBAM have been established. It is shown that the impulsive DBAM will preserve the global exponential stability of the impulse-free DBAM even if the impulses have enlarging effects on the states of neurons.
Analysis Of Packets Delay In Wireless Data Networks
Directory of Open Access Journals (Sweden)
Krivchenkov Aleksandr
2015-12-01
Full Text Available The networks with wireless links for automation control applications traffic transmission when packets have small size and application payload is predictable are under consideration. Analytical model for packets delay on their propagation path through the network is proposed. Estimations for network architectures based on WiFi and Bluetooth wireless technologies are made. The specifications for physical layer 802.11 a/b/g/n and 802.15.1 are under consideration. Analytical and experimental results for delivered network bandwidth for different network architecture, traffic structure and wireless technologies were compared to validate that basic mechanisms are correctly taken into account in the model. It is shown that basic effects are taken into account and further accuracy “improvement” of the model will give not more than 5%. As a result that is important for automation control applications we have reliably received the lowest possible level for packets delay in one wireless link. For 802.11 it is of order of 0.2 ms, for 802.15.1 it is 1.25 ms and is true when application packet can be transferred by one data frame.
Trapped modes in linear quantum stochastic networks with delays
Energy Technology Data Exchange (ETDEWEB)
Tabak, Gil [Stanford University, Department of Applied Physics, Stanford, CA (United States); Mabuchi, Hideo
2016-12-15
Networks of open quantum systems with feedback have become an active area of research for applications such as quantum control, quantum communication and coherent information processing. A canonical formalism for the interconnection of open quantum systems using quantum stochastic differential equations (QSDEs) has been developed by Gough, James and co-workers and has been used to develop practical modeling approaches for complex quantum optical, microwave and optomechanical circuits/networks. In this paper we fill a significant gap in existing methodology by showing how trapped modes resulting from feedback via coupled channels with finite propagation delays can be identified systematically in a given passive linear network. Our method is based on the Blaschke-Potapov multiplicative factorization theorem for inner matrix-valued functions, which has been applied in the past to analog electronic networks. Our results provide a basis for extending the Quantum Hardware Description Language (QHDL) framework for automated quantum network model construction (Tezak et al. in Philos. Trans. R. Soc. A, Math. Phys. Eng. Sci. 370(1979):5270-5290, 2012) to efficiently treat scenarios in which each interconnection of components has an associated signal propagation time delay. (orig.)
Acquisition management of the Global Transportation Network
2001-08-02
This report discusses the acquisition management of the Global transportation Network by the U.S. Transportation Command. This report is one in a series of audit reports addressing DoD acquisition management of information technology systems. The Glo...
Global exponential stability of octonion-valued neural networks with leakage delay and mixed delays.
Popa, Călin-Adrian
2018-06-08
This paper discusses octonion-valued neural networks (OVNNs) with leakage delay, time-varying delays, and distributed delays, for which the states, weights, and activation functions belong to the normed division algebra of octonions. The octonion algebra is a nonassociative and noncommutative generalization of the complex and quaternion algebras, but does not belong to the category of Clifford algebras, which are associative. In order to avoid the nonassociativity of the octonion algebra and also the noncommutativity of the quaternion algebra, the Cayley-Dickson construction is used to decompose the OVNNs into 4 complex-valued systems. By using appropriate Lyapunov-Krasovskii functionals, with double and triple integral terms, the free weighting matrix method, and simple and double integral Jensen inequalities, delay-dependent criteria are established for the exponential stability of the considered OVNNs. The criteria are given in terms of complex-valued linear matrix inequalities, for two types of Lipschitz conditions which are assumed to be satisfied by the octonion-valued activation functions. Finally, two numerical examples illustrate the feasibility, effectiveness, and correctness of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Xing Yin
2011-01-01
uncertain periodic switched recurrent neural networks with time-varying delays. When uncertain discrete-time recurrent neural network is a periodic system, it is expressed as switched neural network for the finite switching state. Based on the switched quadratic Lyapunov functional approach (SQLF and free-weighting matrix approach (FWM, some linear matrix inequality criteria are found to guarantee the delay-dependent asymptotical stability of these systems. Two examples illustrate the exactness of the proposed criteria.
Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks.
Yu, Haiyang; Wu, Zhihai; Wang, Shuqin; Wang, Yunpeng; Ma, Xiaolei
2017-06-26
Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.
End-to-End Delay Model for Train Messaging over Public Land Mobile Networks
Directory of Open Access Journals (Sweden)
Franco Mazzenga
2017-11-01
Full Text Available Modern train control systems rely on a dedicated radio network for train to ground communications. A number of possible alternatives have been analysed to adopt the European Rail Traffic Management System/European Train Control System (ERTMS/ETCS control system on local/regional lines to improve transport capacity. Among them, a communication system based on public networks (cellular&satellite provides an interesting, effective and alternative solution to proprietary and expensive radio networks. To analyse performance of this solution, it is necessary to model the end-to-end delay and message loss to fully characterize the message transfer process from train to ground and vice versa. Starting from the results of a railway test campaign over a 300 km railway line for a cumulative 12,000 traveled km in 21 days, in this paper, we derive a statistical model for the end-to-end delay required for delivering messages. In particular, we propose a two states model allowing for reproducing the main behavioral characteristics of the end-to-end delay as observed experimentally. Model formulation has been derived after deep analysis of the recorded experimental data. When it is applied to model a realistic scenario, it allows for explicitly accounting for radio coverage characteristics, the received power level, the handover points along the line and for the serving radio technology. As an example, the proposed model is used to generate the end-to-end delay profile in a realistic scenario.
Global robust stability of neural networks with multiple discrete delays and distributed delays
International Nuclear Information System (INIS)
Gao Ming; Cui Baotong
2009-01-01
The problem of global robust stability is investigated for a class of uncertain neural networks with both multiple discrete time-varying delays and distributed time-varying delays. The uncertainties are assumed to be of norm-bounded form and the activation functions are supposed to be bounded and globally Lipschitz continuous. Based on the Lyapunov stability theory and linear matrix inequality technique, some robust stability conditions guaranteeing the global robust convergence of the equilibrium point are derived. The proposed LMI-based criteria are computationally efficient as they can be easily checked by using recently developed algorithms in solving LMIs. Two examples are given to show the effectiveness of the proposed results.
Offset Trace-Based Video Quality Evaluation Network Transport
DEFF Research Database (Denmark)
Seeling, P.; Reisslein, M.; Fitzek, Frank
2006-01-01
Video traces contain information about encoded video frames, such as frame sizes and qualities, and provide a convenient method to conduct multimedia networking research. Although wiedely used in networking research, these traces do not allow to determine the video qaulityin an accurate manner...... after networking transport that includes losses and delays. In this work, we provide (i) an overview of frame dependencies that have to be taken into consideration when working with video traces, (ii) an algorithmic approach to combine traditional video traces and offset distortion traces to determine...... the video quality or distortion after lossy network transport, (iii) offset distortion and quality characteristics and (iv) the offset distortion trace format and tools to create offset distortion traces....
Wang, Weiping; Yuan, Manman; Luo, Xiong; Liu, Linlin; Zhang, Yao
2018-01-01
Proportional delay is a class of unbounded time-varying delay. A class of bidirectional associative memory (BAM) memristive neural networks with multiple proportional delays is concerned in this paper. First, we propose the model of BAM memristive neural networks with multiple proportional delays and stochastic perturbations. Furthermore, by choosing suitable nonlinear variable transformations, the BAM memristive neural networks with multiple proportional delays can be transformed into the BAM memristive neural networks with constant delays. Based on the drive-response system concept, differential inclusions theory and Lyapunov stability theory, some anti-synchronization criteria are obtained. Finally, the effectiveness of proposed criteria are demonstrated through numerical examples.
Stability analysis for stochastic BAM nonlinear neural network with delays
Lv, Z. W.; Shu, H. S.; Wei, G. L.
2008-02-01
In this paper, stochastic bidirectional associative memory neural networks with constant or time-varying delays is considered. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, we derive several sufficient conditions in order to guarantee the global asymptotically stable in the mean square. Our investigation shows that the stochastic bidirectional associative memory neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities(LMIs). Hence, the global asymptotic stability of the stochastic bidirectional associative memory neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global asymptotic stability criteria.
Stability analysis for stochastic BAM nonlinear neural network with delays
International Nuclear Information System (INIS)
Lv, Z W; Shu, H S; Wei, G L
2008-01-01
In this paper, stochastic bidirectional associative memory neural networks with constant or time-varying delays is considered. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, we derive several sufficient conditions in order to guarantee the global asymptotically stable in the mean square. Our investigation shows that the stochastic bidirectional associative memory neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities(LMIs). Hence, the global asymptotic stability of the stochastic bidirectional associative memory neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global asymptotic stability criteria
International Nuclear Information System (INIS)
Wang Shen-Quan; Feng Jian; Zhao Qing
2012-01-01
In this paper, the problem of delay-distribution-dependent stability is investigated for continuous-time recurrent neural networks (CRNNs) with stochastic delay. Different from the common assumptions on time delays, it is assumed that the probability distribution of the delay taking values in some intervals is known a priori. By making full use of the information concerning the probability distribution of the delay and by using a tighter bounding technique (the reciprocally convex combination method), less conservative asymptotic mean-square stable sufficient conditions are derived in terms of linear matrix inequalities (LMIs). Two numerical examples show that our results are better than the existing ones. (general)
A discrete event simulation model for evaluating time delays in a pipeline network
Energy Technology Data Exchange (ETDEWEB)
Spricigo, Deisi; Muggiati, Filipe V.; Lueders, Ricardo; Neves Junior, Flavio [Federal University of Technology of Parana (UTFPR), Curitiba, PR (Brazil)
2009-07-01
Currently in the oil industry the logistic chain stands out as a strong candidate to obtain highest profit, since recent studies have pointed out to a cost reduction by adoption of better policies for distribution of oil derivatives, particularly those where pipelines are used to transport products. Although there are models to represent transfers of oil derivatives in pipelines, they are quite complex and computationally burden. In this paper, we are interested on models that are less detailed in terms of fluid dynamics but provide more information about operational decisions in a pipeline network. We propose a discrete event simulation model in ARENA that allows simulating a pipeline network based on average historical data. Time delays for transferring different products can be evaluated through different routes. It is considered that transport operations follow a historical behavior and average time delays can thus be estimated within certain bounds. Due to its stochastic nature, time quantities are characterized by average and dispersion measures. This allows comparing different operational scenarios for product transportation. Simulation results are compared to data obtained from a real world pipeline network and different scenarios of production and demand are analyzed. (author)
Complex Dynamical Network Control for Trajectory Tracking Using Delayed Recurrent Neural Networks
Directory of Open Access Journals (Sweden)
Jose P. Perez
2014-01-01
Full Text Available In this paper, the problem of trajectory tracking is studied. Based on the V-stability and Lyapunov theory, a control law that achieves the global asymptotic stability of the tracking error between a delayed recurrent neural network and a complex dynamical network is obtained. To illustrate the analytic results, we present a tracking simulation of a dynamical network with each node being just one Lorenz’s dynamical system and three identical Chen’s dynamical systems.
Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding
Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank
2014-01-01
This work proposes a new protocol applying on–the–fly random linear network coding in wireless mesh net-works. The protocol provides increased reliability, low delay,and high throughput to the upper layers, while being obliviousto their specific requirements. This seemingly conflicting goalsare achieved by design, using an on–the–fly network codingstrategy. Our protocol also exploits relay nodes to increasethe overall performance of individual links. Since our protocolnaturally masks random p...
Analysis of deterministic cyclic gene regulatory network models with delays
Ahsen, Mehmet Eren; Niculescu, Silviu-Iulian
2015-01-01
This brief examines a deterministic, ODE-based model for gene regulatory networks (GRN) that incorporates nonlinearities and time-delayed feedback. An introductory chapter provides some insights into molecular biology and GRNs. The mathematical tools necessary for studying the GRN model are then reviewed, in particular Hill functions and Schwarzian derivatives. One chapter is devoted to the analysis of GRNs under negative feedback with time delays and a special case of a homogenous GRN is considered. Asymptotic stability analysis of GRNs under positive feedback is then considered in a separate chapter, in which conditions leading to bi-stability are derived. Graduate and advanced undergraduate students and researchers in control engineering, applied mathematics, systems biology and synthetic biology will find this brief to be a clear and concise introduction to the modeling and analysis of GRNs.
Power and delay optimisation in multi-hop wireless networks
Xia, Li
2014-02-05
In this paper, we study the optimisation problem of transmission power and delay in a multi-hop wireless network consisting of multiple nodes. The goal is to determine the optimal policy of transmission rates at various buffer and channel states in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi-open Jackson network model for data transmission and a Markov model for channel states transition. We derive a difference equation of the system performance under any two different policies. The necessary and sufficient condition of optimal policy is obtained. We also prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate and the optimal transmission rate can be either maximal or minimal. That is, the ‘bang-bang’ control is an optimal control. This optimality structure greatly reduces the problem complexity. Furthermore, we develop an iterative algorithm to find the optimal solution. Finally, we conduct the simulation experiments to demonstrate the effectiveness of our approach. We hope our work can shed some insights on solving this complicated optimisation problem.
Composite mechanisms for improving Bubble Rap in delay tolerant networks
Directory of Open Access Journals (Sweden)
Sweta Jain
2014-01-01
Full Text Available Delay tolerant networks (DTNs are a subset of mobile ad hoc networks where connections are sparse and intermittent. This often results in a network graph which is rarely connected which introduces a challenge in message forwarding because of a lack of end-to-end connectivity towards the destination. Recently, social-based forwarding algorithms are gaining popularity because of the social nature displayed by the node movements in a DTN, especially in application areas like the pocket switched networks. The social-based metrics like community, similarity, centrality etc. are used to determine the carrier to which a node has to forward its message. Composite methods are used to improve the performance of Bubble Rap social-based forwarding algorithm. In the proposed mechanism, a new social metric termed ‘friendship’ has been introduced along with a time-to-live (TTL-based ‘threshold’ and acknowledgement (ACK IDs. Real trace data and working day movement models are used for simulations in the opportunistic network environment simulator to demonstrate that the proposed algorithm gives better delivery ratio than the original Bubble Rap algorithm.
Event-Based Stabilization over Networks with Transmission Delays
Directory of Open Access Journals (Sweden)
Xiangyu Meng
2012-01-01
Full Text Available This paper investigates asymptotic stabilization for linear systems over networks based on event-driven communication. A new communication logic is proposed to reduce the feedback effort, which has some advantages over traditional ones with continuous feedback. Considering the effect of time-varying transmission delays, the criteria for the design of both the feedback gain and the event-triggering mechanism are derived to guarantee the stability and performance requirements. Finally, the proposed techniques are illustrated by an inverted pendulum system and a numerical example.
Global Asymptotic Stability of Switched Neural Networks with Delays
Directory of Open Access Journals (Sweden)
Zhenyu Lu
2015-01-01
Full Text Available This paper investigates the global asymptotic stability of a class of switched neural networks with delays. Several new criteria ensuring global asymptotic stability in terms of linear matrix inequalities (LMIs are obtained via Lyapunov-Krasovskii functional. And here, we adopt the quadratic convex approach, which is different from the linear and reciprocal convex combinations that are extensively used in recent literature. In addition, the proposed results here are very easy to be verified and complemented. Finally, a numerical example is provided to illustrate the effectiveness of the results.
Network Performance Improvement under Epidemic Failures in Optical Transport Networks
DEFF Research Database (Denmark)
Fagertun, Anna Manolova; Ruepp, Sarah Renée
2013-01-01
In this paper we investigate epidemic failure spreading in large- scale GMPLS-controlled transport networks. By evaluating the effect of the epidemic failure spreading on the network, we design several strategies for cost-effective network performance improvement via differentiated repair times....... First we identify the most vulnerable and the most strategic nodes in the network. Then, via extensive simulations we show that strategic placement of resources for improved failure recovery has better performance than randomly assigning lower repair times among the network nodes. Our OPNET simulation...... model can be used during the network planning process for facilitating cost- effective network survivability design....
Delay-Dependent Exponential Stability for Discrete-Time BAM Neural Networks with Time-Varying Delays
Directory of Open Access Journals (Sweden)
Yonggang Chen
2008-01-01
Full Text Available This paper considers the delay-dependent exponential stability for discrete-time BAM neural networks with time-varying delays. By constructing the new Lyapunov functional, the improved delay-dependent exponential stability criterion is derived in terms of linear matrix inequality (LMI. Moreover, in order to reduce the conservativeness, some slack matrices are introduced in this paper. Two numerical examples are presented to show the effectiveness and less conservativeness of the proposed method.
Heterogeneous delay-induced asynchrony and resonance in a small-world neuronal network system
Yu, Wen-Ting; Tang, Jun; Ma, Jun; Yang, Xianqing
2016-06-01
A neuronal network often involves time delay caused by the finite signal propagation time in a given biological network. This time delay is not a homogenous fluctuation in a biological system. The heterogeneous delay-induced asynchrony and resonance in a noisy small-world neuronal network system are numerically studied in this work by calculating synchronization measure and spike interval distribution. We focus on three different delay conditions: double-values delay, triple-values delay, and Gaussian-distributed delay. Our results show the following: 1) the heterogeneity in delay results in asynchronous firing in the neuronal network, and 2) maximum synchronization could be achieved through resonance given that the delay values are integer or half-integer times of each other.
Benefits of Delay Tolerant Networking for Earth Science Missions
Davis, Faith; Marquart, Jane; Menke, Greg
2012-01-01
To date there has been much discussion about the value of Delay Tolerant Networking (DTN) for space missions. Claims of various benefits, based on paper analysis, are good; however a benefits statement with empirical evidence to support is even better. This paper presents potential and actual advantages of using DTN for Earth science missions based on results from multiple demonstrations, conducted by the Communications, Standards, and Technology Laboratory (CSTL) at NASA Goddard Space Flight Center (GSFC). Demonstrations included two flight demonstrations using the Earth Observing Mission 1 (EO-1) and the Near Earth Network (NEN), a ground based demonstration over satellite links to the Internet Router in Space (IRIS) payload on Intelsat-14, and others using the NASA Tracking Data Relay Satellite System (TDRSS). Real and potential findings include increased flexibility and efficiency in science campaigns, reduced latency in a collaborative science scenario, and improved scientist-instrument communication and control.
Induction of Hopf bifurcation and oscillation death by delays in coupled networks
International Nuclear Information System (INIS)
Cheng, C.-Y.
2009-01-01
This work explores a system of two coupled networks that each has four nodes. Delayed effects of short-cuts in each network and the coupling between the two groups are considered. When the short-cut delay is fixed, the arising and death of oscillations are caused by the variational coupling delay.
Directory of Open Access Journals (Sweden)
O. M. Kwon
2012-01-01
Full Text Available The purpose of this paper is to investigate the delay-dependent stability analysis for discrete-time neural networks with interval time-varying delays. Based on Lyapunov method, improved delay-dependent criteria for the stability of the networks are derived in terms of linear matrix inequalities (LMIs by constructing a suitable Lyapunov-Krasovskii functional and utilizing reciprocally convex approach. Also, a new activation condition which has not been considered in the literature is proposed and utilized for derivation of stability criteria. Two numerical examples are given to illustrate the effectiveness of the proposed method.
Optimal transport on supply-demand networks.
Chen, Yu-Han; Wang, Bing-Hong; Zhao, Li-Chao; Zhou, Changsong; Zhou, Tao
2010-06-01
In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.
International Nuclear Information System (INIS)
Li Hongjie; Yue Dong
2010-01-01
The paper investigates the synchronization stability problem for a class of complex dynamical networks with Markovian jumping parameters and mixed time delays. The complex networks consist of m modes and the networks switch from one mode to another according to a Markovian chain with known transition probability. The mixed time delays are composed of discrete and distributed delays, the discrete time delay is assumed to be random and its probability distribution is known a priori. In terms of the probability distribution of the delays, the new type of system model with probability-distribution-dependent parameter matrices is proposed. Based on the stochastic analysis techniques and the properties of the Kronecker product, delay-dependent synchronization stability criteria in the mean square are derived in the form of linear matrix inequalities which can be readily solved by using the LMI toolbox in MATLAB, the solvability of derived conditions depends on not only the size of the delay, but also the probability of the delay-taking values in some intervals. Finally, a numerical example is given to illustrate the feasibility and effectiveness of the proposed method.
Kordmahalleh, Mina Moradi; Sefidmazgi, Mohammad Gorji; Harrison, Scott H; Homaifar, Abdollah
2017-01-01
The modeling of genetic interactions within a cell is crucial for a basic understanding of physiology and for applied areas such as drug design. Interactions in gene regulatory networks (GRNs) include effects of transcription factors, repressors, small metabolites, and microRNA species. In addition, the effects of regulatory interactions are not always simultaneous, but can occur after a finite time delay, or as a combined outcome of simultaneous and time delayed interactions. Powerful biotechnologies have been rapidly and successfully measuring levels of genetic expression to illuminate different states of biological systems. This has led to an ensuing challenge to improve the identification of specific regulatory mechanisms through regulatory network reconstructions. Solutions to this challenge will ultimately help to spur forward efforts based on the usage of regulatory network reconstructions in systems biology applications. We have developed a hierarchical recurrent neural network (HRNN) that identifies time-delayed gene interactions using time-course data. A customized genetic algorithm (GA) was used to optimize hierarchical connectivity of regulatory genes and a target gene. The proposed design provides a non-fully connected network with the flexibility of using recurrent connections inside the network. These features and the non-linearity of the HRNN facilitate the process of identifying temporal patterns of a GRN. Our HRNN method was implemented with the Python language. It was first evaluated on simulated data representing linear and nonlinear time-delayed gene-gene interaction models across a range of network sizes and variances of noise. We then further demonstrated the capability of our method in reconstructing GRNs of the Saccharomyces cerevisiae synthetic network for in vivo benchmarking of reverse-engineering and modeling approaches (IRMA). We compared the performance of our method to TD-ARACNE, HCC-CLINDE, TSNI and ebdbNet across different network
Alvarez Aguirre, A.; Velasco-Villa, M.; Del Muro Cuellar, B.
2008-01-01
This paper consider the remote control of an unicycle mobile robot subject to transport delay. The communication delay effects are considered by means of a discrete time approach that allows to solve the path tracking problem in terms of the delayed input. The causality problem involved in the
Delay-dependent stability of neural networks of neutral type with time delay in the leakage term
International Nuclear Information System (INIS)
Li, Xiaodi; Cao, Jinde
2010-01-01
This paper studies the global asymptotic stability of neural networks of neutral type with mixed delays. The mixed delays include constant delay in the leakage term (i.e. 'leakage delay'), time-varying delays and continuously distributed delays. Based on the topological degree theory, Lyapunov method and linear matrix inequality (LMI) approach, some sufficient conditions are derived ensuring the existence, uniqueness and global asymptotic stability of the equilibrium point, which are dependent on both the discrete and distributed time delays. These conditions are expressed in terms of LMI and can be easily checked by the MATLAB LMI toolbox. Even if there is no leakage delay, the obtained results are less restrictive than some recent works. It can be applied to neural networks of neutral type with activation functions without assuming their boundedness, monotonicity or differentiability. Moreover, the differentiability of the time-varying delay in the non-neutral term is removed. Finally, two numerical examples are given to show the effectiveness of the proposed method
Finite time synchronization of memristor-based Cohen-Grossberg neural networks with mixed delays
Chen, Chuan; Li, Lixiang; Peng, Haipeng; Yang, Yixian
2017-01-01
Finite time synchronization, which means synchronization can be achieved in a settling time, is desirable in some practical applications. However, most of the published results on finite time synchronization don't include delays or only include discrete delays. In view of the fact that distributed delays inevitably exist in neural networks, this paper aims to investigate the finite time synchronization of memristor-based Cohen-Grossberg neural networks (MCGNNs) with both discrete delay and di...
Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding
DEFF Research Database (Denmark)
Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani
2014-01-01
This work proposes a new protocol applying on– the–fly random linear network coding in wireless mesh net- works. The protocol provides increased reliability, low delay, and high throughput to the upper layers, while being oblivious to their specific requirements. This seemingly conflicting goals ...
Directory of Open Access Journals (Sweden)
YaJun Li
2015-01-01
Full Text Available The passivity problem for a class of stochastic neural networks systems (SNNs with varying delay and leakage delay has been further studied in this paper. By constructing a more effective Lyapunov functional, employing the free-weighting matrix approach, and combining with integral inequality technic and stochastic analysis theory, the delay-dependent conditions have been proposed such that SNNs are asymptotically stable with guaranteed performance. The time-varying delay is divided into several subintervals and two adjustable parameters are introduced; more information about time delay is utilised and less conservative results have been obtained. Examples are provided to illustrate the less conservatism of the proposed method and simulations are given to show the impact of leakage delay on stability of SNNs.
Optimal transportation networks models and theory
Bernot, Marc; Morel, Jean-Michel
2009-01-01
The transportation problem can be formalized as the problem of finding the optimal way to transport a given measure into another with the same mass. In contrast to the Monge-Kantorovitch problem, recent approaches model the branched structure of such supply networks as minima of an energy functional whose essential feature is to favour wide roads. Such a branched structure is observable in ground transportation networks, in draining and irrigation systems, in electrical power supply systems and in natural counterparts such as blood vessels or the branches of trees. These lectures provide mathematical proof of several existence, structure and regularity properties empirically observed in transportation networks. The link with previous discrete physical models of irrigation and erosion models in geomorphology and with discrete telecommunication and transportation models is discussed. It will be mathematically proven that the majority fit in the simple model sketched in this volume.
Optimising Transport in a Homogeneous Network
WEAIRE, DENIS LAWRENCE
2004-01-01
PUBLISHED Many situations in physics, biology, and engineering consist of the transport of some physical quantity through a network of narrow channels. The ability of a network to transport such a quantity in every direction can be described by the average conductivity associated with it. When the flow through each channel is conserved and derives from a potential function, we show that there exists an upper bound of the average conductivity and explicitly give the expression f...
Optimizing transport in a homogeneous network
WEAIRE, DENIS LAWRENCE
2004-01-01
PUBLISHED Many situations in physics, biology, and engineering consist of the transport of some physical quantity through a network of narrow channels. The ability of a network to transport such a quantity in every direction can be described by the average conductivity associated with it. When the flow through each channel is conserved and derives from a potential function, we show that there exists an upper bound of the average conductivity and explicitly give the expression f...
Firing patterns transition and desynchronization induced by time delay in neural networks
Huang, Shoufang; Zhang, Jiqian; Wang, Maosheng; Hu, Chin-Kun
2018-06-01
We used the Hindmarsh-Rose (HR) model (Hindmarsh and Rose, 1984) to study the effect of time delay on the transition of firing behaviors and desynchronization in neural networks. As time delay is increased, neural networks exhibit diversity of firing behaviors, including regular spiking or bursting and firing patterns transitions (FPTs). Meanwhile, the desynchronization of firing and unstable bursting with decreasing amplitude in neural system, are also increasingly enhanced with the increase of time delay. Furthermore, we also studied the effect of coupling strength and network randomness on these phenomena. Our results imply that time delays can induce transition and desynchronization of firing behaviors in neural networks. These findings provide new insight into the role of time delay in the firing activities of neural networks, and can help to better understand the firing phenomena in complex systems of neural networks. A possible mechanism in brain that can cause the increase of time delay is discussed.
Bayesian Network Assessment Method for Civil Aviation Safety Based on Flight Delays
Huawei Wang; Jun Gao
2013-01-01
Flight delays and safety are the principal contradictions in the sound development of civil aviation. Flight delays often come up and induce civil aviation safety risk simultaneously. Based on flight delays, the random characteristics of civil aviation safety risk are analyzed. Flight delays have been deemed to a potential safety hazard. The change rules and characteristics of civil aviation safety risk based on flight delays have been analyzed. Bayesian networks (BN) have been used to build ...
Strategy development management of Multimodal Transport Network
Directory of Open Access Journals (Sweden)
Nesterova Natalia S.
2016-01-01
Full Text Available The article gives a brief overview of works on the development of transport infrastructure for multimodal transportation and integration of Russian transport system into the international transport corridors. The technology for control of the strategy, that changes shape and capacity of Multi-modal Transport Network (MTN, is considered as part of the methodology for designing and development of MTN. This technology allows to carry out strategic and operational management of the strategy implementation based on the use of the balanced scorecard.
Cryptographic Key Management in Delay Tolerant Networks: A Survey
Directory of Open Access Journals (Sweden)
Sofia Anna Menesidou
2017-06-01
Full Text Available Since their appearance at the dawn of the second millennium, Delay or Disruption Tolerant Networks (DTNs have gradually evolved, spurring the development of a variety of methods and protocols for making them more secure and resilient. In this context, perhaps, the most challenging problem to deal with is that of cryptographic key management. To the best of our knowledge, the work at hand is the first to survey the relevant literature and classify the various so far proposed key management approaches in such a restricted and harsh environment. Towards this goal, we have grouped the surveyed key management methods into three major categories depending on whether the particular method copes with (a security initialization, (b key establishment, and (c key revocation. We have attempted to provide a concise but fairly complete evaluation of the proposed up-to-date methods in a generalized way with the aim of offering a central reference point for future research.
Transmission Delay Based Control over Networks with Wireless Links
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
To achieve the mobility of computers during communication, the TCP connections between fixed host and mobile host may often traverse wired and wireless networks, and the recovery of losses due to wireless transmission error is much different from congestion control. The paper analyzes the side effect of RTT estimation while making the TCP source to handle congestion and wireless error losses properly. Then present a strategy using information feedback by the last hop acknowledgement and monitoring the queuing level of the wired bottleneck link by calculating the changes in transmission delay along the path. With the identification of the early stage of congestion, it can respond to wired congestion quickly while keeping wireless link more reliable, and make TCP react to the different packets losses more appropriately.
Improved asymptotic stability analysis for uncertain delayed state neural networks
International Nuclear Information System (INIS)
Souza, Fernando O.; Palhares, Reinaldo M.; Ekel, Petr Ya.
2009-01-01
This paper presents a new linear matrix inequality (LMI) based approach to the stability analysis of artificial neural networks (ANN) subject to time-delay and polytope-bounded uncertainties in the parameters. The main objective is to propose a less conservative condition to the stability analysis using the Gu's discretized Lyapunov-Krasovskii functional theory and an alternative strategy to introduce slack matrices. Two computer simulations examples are performed to support the theoretical predictions. Particularly, in the first example, the Hopf bifurcation theory is used to verify the stability of the system when the origin falls into instability. The second example is presented to illustrate how the proposed approach can provide better stability performance when compared to other ones in the literature
Bifurcation behaviors of synchronized regions in logistic map networks with coupling delay
International Nuclear Information System (INIS)
Tang, Longkun; Wu, Xiaoqun; Lu, Jun-an; Lü, Jinhu
2015-01-01
Network synchronized regions play an extremely important role in network synchronization according to the master stability function framework. This paper focuses on network synchronous state stability via studying the effects of nodal dynamics, coupling delay, and coupling way on synchronized regions in Logistic map networks. Theoretical and numerical investigations show that (1) network synchronization is closely associated with its nodal dynamics. Particularly, the synchronized region bifurcation points through which the synchronized region switches from one type to another are in good agreement with those of the uncoupled node system, and chaotic nodal dynamics can greatly impede network synchronization. (2) The coupling delay generally impairs the synchronizability of Logistic map networks, which is also dominated by the parity of delay for some nodal parameters. (3) A simple nonlinear coupling facilitates network synchronization more than the linear one does. The results found in this paper will help to intensify our understanding for the synchronous state stability in discrete-time networks with coupling delay
Stability analysis of fractional-order Hopfield neural networks with time delays.
Wang, Hu; Yu, Yongguang; Wen, Guoguang
2014-07-01
This paper investigates the stability for fractional-order Hopfield neural networks with time delays. Firstly, the fractional-order Hopfield neural networks with hub structure and time delays are studied. Some sufficient conditions for stability of the systems are obtained. Next, two fractional-order Hopfield neural networks with different ring structures and time delays are developed. By studying the developed neural networks, the corresponding sufficient conditions for stability of the systems are also derived. It is shown that the stability conditions are independent of time delays. Finally, numerical simulations are given to illustrate the effectiveness of the theoretical results obtained in this paper. Copyright © 2014 Elsevier Ltd. All rights reserved.
A note on exponential convergence of neural networks with unbounded distributed delays
Energy Technology Data Exchange (ETDEWEB)
Chu Tianguang [Intelligent Control Laboratory, Center for Systems and Control, Department of Mechanics and Engineering Science, Peking University, Beijing 100871 (China)]. E-mail: chutg@pku.edu.cn; Yang Haifeng [Intelligent Control Laboratory, Center for Systems and Control, Department of Mechanics and Engineering Science, Peking University, Beijing 100871 (China)
2007-12-15
This note examines issues concerning global exponential convergence of neural networks with unbounded distributed delays. Sufficient conditions are derived by exploiting exponentially fading memory property of delay kernel functions. The method is based on comparison principle of delay differential equations and does not need the construction of any Lyapunov functionals. It is simple yet effective in deriving less conservative exponential convergence conditions and more detailed componentwise decay estimates. The results of this note and [Chu T. An exponential convergence estimate for analog neural networks with delay. Phys Lett A 2001;283:113-8] suggest a class of neural networks whose globally exponentially convergent dynamics is completely insensitive to a wide range of time delays from arbitrary bounded discrete type to certain unbounded distributed type. This is of practical interest in designing fast and reliable neural circuits. Finally, an open question is raised on the nature of delay kernels for attaining exponential convergence in an unbounded distributed delayed neural network.
A note on exponential convergence of neural networks with unbounded distributed delays
International Nuclear Information System (INIS)
Chu Tianguang; Yang Haifeng
2007-01-01
This note examines issues concerning global exponential convergence of neural networks with unbounded distributed delays. Sufficient conditions are derived by exploiting exponentially fading memory property of delay kernel functions. The method is based on comparison principle of delay differential equations and does not need the construction of any Lyapunov functionals. It is simple yet effective in deriving less conservative exponential convergence conditions and more detailed componentwise decay estimates. The results of this note and [Chu T. An exponential convergence estimate for analog neural networks with delay. Phys Lett A 2001;283:113-8] suggest a class of neural networks whose globally exponentially convergent dynamics is completely insensitive to a wide range of time delays from arbitrary bounded discrete type to certain unbounded distributed type. This is of practical interest in designing fast and reliable neural circuits. Finally, an open question is raised on the nature of delay kernels for attaining exponential convergence in an unbounded distributed delayed neural network
Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks
Directory of Open Access Journals (Sweden)
Haiyang Yu
2017-06-01
Full Text Available Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs, for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs and long short-term memory (LSTM neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.
Information spreading in Delay Tolerant Networks based on nodes' behaviors
Wu, Yahui; Deng, Su; Huang, Hongbin
2014-07-01
Information spreading in DTNs (Delay Tolerant Networks) adopts a store-carry-forward method, and nodes receive the message from others directly. However, it is hard to judge whether the information is safe in this communication mode. In this case, a node may observe other nodes' behaviors. At present, there is no theoretical model to describe the varying rule of the nodes' trusting level. In addition, due to the uncertainty of the connectivity in DTN, a node is hard to get the global state of the network. Therefore, a rational model about the node's trusting level should be a function of the node's own observing result. For example, if a node finds k nodes carrying a message, it may trust the information with probability p(k). This paper does not explore the real distribution of p(k), but instead presents a unifying theoretical framework to evaluate the performance of the information spreading in above case. This framework is an extension of the traditional SI (susceptible-infected) model, and is useful when p(k) conforms to any distribution. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Finally, we explore the impact of the nodes' behaviors based on certain special distributions through numerical results.
Strategies for optical transport network recovery under epidemic network failures
DEFF Research Database (Denmark)
Ruepp, Sarah Renée; Fagertun, Anna Manolova; Kosteas, Vasileios
2015-01-01
The current trend in deploying automatic control plane solutions for increased flexibility in the optical transport layer leads to numerous advantages for both the operators and the customers, but also pose challenges related to the stability of the network and its ability to operate in a robust...... manner under different failure scenarios. This work evaluates two rerouting strategies and proposes four policies for failure handling in a connection-oriented optical transport network, under generalized multiprotocol label switching control plane. The performance of the strategies and the policies......, and that there exist a clear trade-off between policy performance and network resource consumption, which must be addressed by network operators for improved robustness of their transport infrastructures. Applying proactive methods for avoiding areas where epidemic failures spread results in 50% less connections...
International Nuclear Information System (INIS)
Yan, Ji; Bao-Tong, Cui
2010-01-01
In this paper, we have improved delay-dependent stability criteria for recurrent neural networks with a delay varying over a range and Markovian jumping parameters. The criteria improve over some previous ones in that they have fewer matrix variables yet less conservatism. In addition, a numerical example is provided to illustrate the applicability of the result using the linear matrix inequality toolbox in MATLAB. (general)
Park, Ju H.; Kwon, O. M.
In the letter, the global asymptotic stability of bidirectional associative memory (BAM) neural networks with delays is investigated. The delay is assumed to be time-varying and belongs to a given interval. A novel stability criterion for the stability is presented based on the Lyapunov method. The criterion is represented in terms of linear matrix inequality (LMI), which can be solved easily by various optimization algorithms. Two numerical examples are illustrated to show the effectiveness of our new result.
International Nuclear Information System (INIS)
Fonda, James W; Zawodniok, Maciej; Jagannathan, S; Watkins, Steve E
2008-01-01
The development and the implementation issues of a reactive optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) are introduced and its performance is contrasted with the popular ad hoc on-demand distance vector (AODV) routing protocol. Analytical results illustrate the performance of the proposed OEDSR protocol, while experimental results utilizing a hardware testbed under various scenarios demonstrate improvements in energy efficiency of the OEDSR protocol. A hardware platform constructed at the University of Missouri-Rolla (UMR), now the Missouri University of Science and Technology (MST), based on the Generation 4 Smart Sensor Node (G4-SSN) prototyping platform is also described. Performance improvements are shown in terms of end-to-end (E2E) delay, throughput, route-set-up time and drop rates and energy usage is given for three topologies, including a mobile topology. Additionally, results from the hardware testbed provide valuable lessons for network deployments. Under testing OEDSR provides a factor of ten improvement in the energy used in the routing session and extends network lifetime compared to AODV. Depletion experiments show that the time until the first node failure is extended by a factor of three with the network depleting and network lifetime is extended by 6.7%
Tian, Li-Ping; Wang, Jianxin; Wu, Fang-Xiang
2012-09-01
The study of stability is essential for designing or controlling genetic regulatory networks, which can be described by nonlinear differential equations with time delays. Much attention has been paid to the study of delay-independent stability of genetic regulatory networks and as a result, many sufficient conditions have been derived for delay-independent stability. Although it might be more interesting in practice, delay-dependent stability of genetic regulatory networks has been studied insufficiently. Based on the linear matrix inequality (LMI) approach, in this study we will present some delay-dependent stability conditions for genetic regulatory networks. Then we extend these results to genetic regulatory networks with parameter uncertainties. To illustrate the effectiveness of our theoretical results, gene repressilatory networks are analyzed .
Oil Transport Networks in Europe
Directory of Open Access Journals (Sweden)
Igbal Guliyev
2014-01-01
Full Text Available The author examines the problems and prospects of crude oil and petroleum products transportation market on the European continent. Particular attention is paid to the possibilities of the planned pipeline routes and new supplies of oil and petroleum products. European Union countries have large reserves of hydrocarbons, but it is not enough to fully satisfy domestic consumption. Improved pipeline infrastructure both within the EU and oil pipelines from other countries is an important economic and social factor. Recent developments of this year especially emphasize the importance of strengthening the energy security in the foreign policy of the state. For transporting fuel energy in Europe used the following types of transport: marine (sea and river, truck, railway, and pipeline. It seems necessary to mention the fact that the role of pipeline transport is particularly high in the oil and gas industry. Pipeline transport has an important impact on the formation and developmen t of the fuel and energy complex of the state, as well as regions, as its integral part. An effective system of crude oil and petroleum products pipelines is an important tool for the implementation of public policies, policies at the EU level, allowing the country to regulate the supply of crude oil and petroleum products to the overseas and domestic markets.
Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui
2017-10-06
Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli , and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.
Directory of Open Access Journals (Sweden)
Minghui Yu
2017-01-01
Full Text Available The global exponential antisynchronization in mean square of memristive neural networks with stochastic perturbation and mixed time-varying delays is studied in this paper. Then, two kinds of novel delay-dependent and delay-independent adaptive controllers are designed. With the ability of adapting to environment changes, the proposed controllers can modify their behaviors to achieve the best performance. In particular, on the basis of the differential inclusions theory, inequality theory, and stochastic analysis techniques, several sufficient conditions are obtained to guarantee the exponential antisynchronization between the drive system and response system. Furthermore, two numerical simulation examples are provided to the validity of the derived criteria.
European intermodal freight transport network
Saeedi, Hamid; Wiegmans, Bart; Behdani, Behzad; Zuidwijk, Rob
2017-01-01
The analysis of market structure and concentration measures for the Intermodal Freight Transport (IFT) market is important to avoid market failure and to find the areas for policy making to promote IFT market share. This analysis can be performed for separate segments, for example, the market for
Global Optimization for Transport Network Expansion and Signal Setting
Liu, Haoxiang; Wang, David Z. W.; Yue, Hao
2015-01-01
This paper proposes a model to address an urban transport planning problem involving combined network design and signal setting in a saturated network. Conventional transport planning models usually deal with the network design problem and signal setting problem separately. However, the fact that network capacity design and capacity allocation determined by network signal setting combine to govern the transport network performance requires the optimal transport planning to consider the two pr...
Heterogeneous Cellular Networks with Spatio-Temporal Traffic: Delay Analysis and Scheduling
Zhong, Yi; Quek, Tony Q. S.; Ge, Xiaohu
2016-01-01
Emergence of new types of services has led to various traffic and diverse delay requirements in fifth generation (5G) wireless networks. Meeting diverse delay requirements is one of the most critical goals for the design of 5G wireless networks. Though the delay of point-to-point communications has been well investigated, the delay of multi-point to multi-point communications has not been thoroughly studied since it is a complicated function of all links in the network. In this work, we propo...
Global exponential stability of BAM neural networks with time-varying delays and diffusion terms
International Nuclear Information System (INIS)
Wan Li; Zhou Qinghua
2007-01-01
The stability property of bidirectional associate memory (BAM) neural networks with time-varying delays and diffusion terms are considered. By using the method of variation parameter and inequality technique, the delay-independent sufficient conditions to guarantee the uniqueness and global exponential stability of the equilibrium solution of such networks are established
Global exponential stability of BAM neural networks with time-varying delays and diffusion terms
Wan, Li; Zhou, Qinghua
2007-11-01
The stability property of bidirectional associate memory (BAM) neural networks with time-varying delays and diffusion terms are considered. By using the method of variation parameter and inequality technique, the delay-independent sufficient conditions to guarantee the uniqueness and global exponential stability of the equilibrium solution of such networks are established.
International Nuclear Information System (INIS)
Wan Li; Zhou Qinghua
2007-01-01
The stability property of stochastic hybrid bidirectional associate memory (BAM) neural networks with discrete delays is considered. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the delay-independent sufficient conditions to guarantee the exponential stability of the equilibrium solution for such networks are given by using the nonnegative semimartingale convergence theorem
Wan, Li; Zhou, Qinghua
2007-10-01
The stability property of stochastic hybrid bidirectional associate memory (BAM) neural networks with discrete delays is considered. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the delay-independent sufficient conditions to guarantee the exponential stability of the equilibrium solution for such networks are given by using the nonnegative semimartingale convergence theorem.
Optimal urban networks via mass transportation
Buttazzo, Giuseppe; Stepanov, Eugene; Solimini, Sergio
2009-01-01
Recently much attention has been devoted to the optimization of transportation networks in a given geographic area. One assumes the distributions of population and of services/workplaces (i.e. the network's sources and sinks) are known, as well as the costs of movement with/without the network, and the cost of constructing/maintaining it. Both the long-term optimization and the short-term, "who goes where" optimization are considered. These models can also be adapted for the optimization of other types of networks, such as telecommunications, pipeline or drainage networks. In the monograph we study the most general problem settings, namely, when neither the shape nor even the topology of the network to be constructed is known a priori.
Traffic Management for Next Generation Transport Networks
DEFF Research Database (Denmark)
Yu, Hao
required by the next generation transport network to provide Quality-of-Service (QoS) guaranteed video services. Augmenting network capacity and upgrading network nodes indicate long deployment period, replacement of equipment and thus significant cost to the network service providers. This challenge may...... slacken the steps of some network operators towards providing IPTV services. In this dissertation, the topology-based hierarchical scheduling scheme is proposed to tackle the problem addressed. The scheme simplifies the deployment process by placing an intelligent switch with centralized traffic...... management functions at the edge of the network, scheduling traffic on behalf of the other nodes. The topology-based hierarchical scheduling scheme is able to provide outstanding flow isolation due to its centralized scheduling ability, which is essential for providing IPTV services. In order to reduce...
Social networks, big data and transport planning
Energy Technology Data Exchange (ETDEWEB)
Ruiz Sanchez, T.; Lidon Mars Aicart, M. del; Arroyo Lopez, M.R.; Serna Nocedal, A.
2016-07-01
The characteristics of people who are related or tied to each individual affects her activitytravel behavior. That influence is especially associated to social and recreational activities, which are increasingly important. Collecting high quality data from those social networks is very difficult, because respondents are asked about their general social life, which is most demanding to remember that specific facts. On the other hand, currently there are different potential sources of transport data, which is characterized by the huge amount of information available, the velocity with it is obtained and the variety of format in which is presented. This sort of information is commonly known as Big Data. In this paper we identify potential sources of social network related big data that can be used in Transport Planning. Then, a review of current applications in Transport Planning is presented. Finally, some future prospects of using social network related big data are highlighted. (Author)
Locating inefficient links in a large-scale transportation network
Sun, Li; Liu, Like; Xu, Zhongzhi; Jie, Yang; Wei, Dong; Wang, Pu
2015-02-01
Based on data from geographical information system (GIS) and daily commuting origin destination (OD) matrices, we estimated the distribution of traffic flow in the San Francisco road network and studied Braess's paradox in a large-scale transportation network with realistic travel demand. We measured the variation of total travel time Δ T when a road segment is closed, and found that | Δ T | follows a power-law distribution if Δ T 0. This implies that most roads have a negligible effect on the efficiency of the road network, while the failure of a few crucial links would result in severe travel delays, and closure of a few inefficient links would counter-intuitively reduce travel costs considerably. Generating three theoretical networks, we discovered that the heterogeneously distributed travel demand may be the origin of the observed power-law distributions of | Δ T | . Finally, a genetic algorithm was used to pinpoint inefficient link clusters in the road network. We found that closing specific road clusters would further improve the transportation efficiency.
Evaluation and Investigation of the Delay in VoIP Networks
Directory of Open Access Journals (Sweden)
V. Janata
2011-06-01
Full Text Available The paper is focused mainly on the delay problems, which considerably influence the final quality of connections in VoIP (Voice over IP networks. The paper provides a detailed exploration of the nature and mechanisms of the delay. The main purpose of the investigation was an attempt to formulate a mathematical model of delay in the VoIP network and its subsequent analysis by laboratory data.
Zúñiga-Aguilar, C. J.; Coronel-Escamilla, A.; Gómez-Aguilar, J. F.; Alvarado-Martínez, V. M.; Romero-Ugalde, H. M.
2018-02-01
In this paper, we approximate the solution of fractional differential equations with delay using a new approach based on artificial neural networks. We consider fractional differential equations of variable order with the Mittag-Leffler kernel in the Liouville-Caputo sense. With this new neural network approach, an approximate solution of the fractional delay differential equation is obtained. Synaptic weights are optimized using the Levenberg-Marquardt algorithm. The neural network effectiveness and applicability were validated by solving different types of fractional delay differential equations, linear systems with delay, nonlinear systems with delay and a system of differential equations, for instance, the Newton-Leipnik oscillator. The solution of the neural network was compared with the analytical solutions and the numerical simulations obtained through the Adams-Bashforth-Moulton method. To show the effectiveness of the proposed neural network, different performance indices were calculated.
International Nuclear Information System (INIS)
Balasubramaniam, P.; Kalpana, M.; Rakkiyappan, R.
2012-01-01
Fuzzy cellular neural networks (FCNNs) are special kinds of cellular neural networks (CNNs). Each cell in an FCNN contains fuzzy operating abilities. The entire network is governed by cellular computing laws. The design of FCNNs is based on fuzzy local rules. In this paper, a linear matrix inequality (LMI) approach for synchronization control of FCNNs with mixed delays is investigated. Mixed delays include discrete time-varying delays and unbounded distributed delays. A dynamic control scheme is proposed to achieve the synchronization between a drive network and a response network. By constructing the Lyapunov—Krasovskii functional which contains a triple-integral term and the free-weighting matrices method an improved delay-dependent stability criterion is derived in terms of LMIs. The controller can be easily obtained by solving the derived LMIs. A numerical example and its simulations are presented to illustrate the effectiveness of the proposed method. (interdisciplinary physics and related areas of science and technology)
Wen, Shiping; Zeng, Zhigang; Chen, Michael Z Q; Huang, Tingwen
2017-10-01
This paper addresses the issue of synchronization of switched delayed neural networks with communication delays via event-triggered control. For synchronizing coupled switched neural networks, we propose a novel event-triggered control law which could greatly reduce the number of control updates for synchronization tasks of coupled switched neural networks involving embedded microprocessors with limited on-board resources. The control signals are driven by properly defined events, which depend on the measurement errors and current-sampled states. By using a delay system method, a novel model of synchronization error system with delays is proposed with the communication delays and event-triggered control in the unified framework for coupled switched neural networks. The criteria are derived for the event-triggered synchronization analysis and control synthesis of switched neural networks via the Lyapunov-Krasovskii functional method and free weighting matrix approach. A numerical example is elaborated on to illustrate the effectiveness of the derived results.
Exponential convergence rate estimation for uncertain delayed neural networks of neutral type
International Nuclear Information System (INIS)
Lien, C.-H.; Yu, K.-W.; Lin, Y.-F.; Chung, Y.-J.; Chung, L.-Y.
2009-01-01
The global exponential stability for a class of uncertain delayed neural networks (DNNs) of neutral type is investigated in this paper. Delay-dependent and delay-independent criteria are proposed to guarantee the robust stability of DNNs via LMI and Razumikhin-like approaches. For a given delay, the maximal allowable exponential convergence rate will be estimated. Some numerical examples are given to illustrate the effectiveness of our results. The simulation results reveal significant improvement over the recent results.
Passivity of memristive BAM neural networks with leakage and additive time-varying delays
Wang, Weiping; Wang, Meiqi; Luo, Xiong; Li, Lixiang; Zhao, Wenbing; Liu, Linlin; Ping, Yuan
2018-02-01
This paper investigates the passivity of memristive bidirectional associate memory neural networks (MBAMNNs) with leakage and additive time-varying delays. Based on some useful inequalities and appropriate Lyapunov-Krasovskii functionals (LKFs), several delay-dependent conditions for passivity performance are obtained in linear matrix inequalities (LMIs). Moreover, the leakage delays as well as additive delays are considered separately. Finally, numerical simulations are provided to demonstrate the feasibility of the theoretical results.
Towards 100 gigabit carrier ethernet transport networks
DEFF Research Database (Denmark)
Rasmussen, Anders; Zhang, Jiang; Yu, Hao
2010-01-01
technology, making the use of Ethernet as a convergence layer for Next Generation Networks a distinct possibility. Triple Play services, in particular IPTV, are expected to be a main drivers for carrier Ethernet, however, a number of challenges must be addressed including QoS enabled control plane, enhanced......Ethernet as a transport technology has, up to now, lacked the features such as network layer architecture, customer separation and manageability that carriers require for wide-scale deployment. However, with the advent of PBB-TE and TMPLS, it is now possible to use Ethernet as a transport...
Robustness Analysis of Hybrid Stochastic Neural Networks with Neutral Terms and Time-Varying Delays
Directory of Open Access Journals (Sweden)
Chunmei Wu
2015-01-01
Full Text Available We analyze the robustness of global exponential stability of hybrid stochastic neural networks subject to neutral terms and time-varying delays simultaneously. Given globally exponentially stable hybrid stochastic neural networks, we characterize the upper bounds of contraction coefficients of neutral terms and time-varying delays by using the transcendental equation. Moreover, we prove theoretically that, for any globally exponentially stable hybrid stochastic neural networks, if additive neutral terms and time-varying delays are smaller than the upper bounds arrived, then the perturbed neural networks are guaranteed to also be globally exponentially stable. Finally, a numerical simulation example is given to illustrate the presented criteria.
Impact of leakage delay on bifurcation in high-order fractional BAM neural networks.
Huang, Chengdai; Cao, Jinde
2018-02-01
The effects of leakage delay on the dynamics of neural networks with integer-order have lately been received considerable attention. It has been confirmed that fractional neural networks more appropriately uncover the dynamical properties of neural networks, but the results of fractional neural networks with leakage delay are relatively few. This paper primarily concentrates on the issue of bifurcation for high-order fractional bidirectional associative memory(BAM) neural networks involving leakage delay. The first attempt is made to tackle the stability and bifurcation of high-order fractional BAM neural networks with time delay in leakage terms in this paper. The conditions for the appearance of bifurcation for the proposed systems with leakage delay are firstly established by adopting time delay as a bifurcation parameter. Then, the bifurcation criteria of such system without leakage delay are successfully acquired. Comparative analysis wondrously detects that the stability performance of the proposed high-order fractional neural networks is critically weakened by leakage delay, they cannot be overlooked. Numerical examples are ultimately exhibited to attest the efficiency of the theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Li Chuandong; Liao Xiaofeng; Zhang Rong
2005-01-01
For bi-directional associative memory (BAM) neural networks (NNs) with different constant or time-varying delays, the problems of determining the exponential stability and estimating the exponential convergence rate are investigated in this paper. An approach combining the Lyapunov-Krasovskii functional with the linear matrix inequality (LMI) is taken to study the problems, which provide bounds on the interconnection matrix and the activation functions, so as to guarantee the system's exponential stability. Some criteria for the exponential stability, which give information on the delay-dependent property, are derived. The results obtained in this paper provide one more set of easily verified guidelines for determining the exponential stability of delayed BAM (DBAM) neural networks, which are less conservative and less restrictive than the ones reported so far in the literature. Some typical examples are presented to show the application of the criteria obtained in this paper
On minimizing the maximum broadcast decoding delay for instantly decodable network coding
Douik, Ahmed S.
2014-09-01
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.
International Nuclear Information System (INIS)
Yang Xiaofan; Liao Xiaofeng; Evans, David J.; Tang Yuanyan
2005-01-01
In this Letter, we introduce a class of Hopfield neural networks with periodic impulses and finite distributed delays. We then derive a sufficient condition for the existence and global exponential stability of a unique periodic solution of the networks, which assumes neither the differentiability nor the monotonicity of the activation functions. Our condition extends and generalizes a known condition for the global exponential periodicity of continuous Hopfield neural networks with finite distributed delays
Hub location problems in transportation networks
DEFF Research Database (Denmark)
Gelareh, Shahin; Nickel, Stefan
2011-01-01
In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node....... also introduce fixed cost values for Australian Post (AP) dataset....
Transport Network Technologies – Study and Testing
DEFF Research Database (Denmark)
Bozorgebrahimi, K.; Channegowda, M.; Colmenero, A.
Following on from the theoretical research into Carrier Class Transport Network Technologies (CCTNTs) documented in DJ1.1.1, this report describes the extensive testing performed by JRA1 Task 1. The tests covered EoMPLS, Ethernet OAM, Synchronous Ethernet, PBB-TE, MPLS-TP, OTN and GMPLS...
Finite time synchronization of memristor-based Cohen-Grossberg neural networks with mixed delays
2017-01-01
Finite time synchronization, which means synchronization can be achieved in a settling time, is desirable in some practical applications. However, most of the published results on finite time synchronization don’t include delays or only include discrete delays. In view of the fact that distributed delays inevitably exist in neural networks, this paper aims to investigate the finite time synchronization of memristor-based Cohen-Grossberg neural networks (MCGNNs) with both discrete delay and distributed delay (mixed delays). By means of a simple feedback controller and novel finite time synchronization analysis methods, several new criteria are derived to ensure the finite time synchronization of MCGNNs with mixed delays. The obtained criteria are very concise and easy to verify. Numerical simulations are presented to demonstrate the effectiveness of our theoretical results. PMID:28931066
Finite time synchronization of memristor-based Cohen-Grossberg neural networks with mixed delays.
Chen, Chuan; Li, Lixiang; Peng, Haipeng; Yang, Yixian
2017-01-01
Finite time synchronization, which means synchronization can be achieved in a settling time, is desirable in some practical applications. However, most of the published results on finite time synchronization don't include delays or only include discrete delays. In view of the fact that distributed delays inevitably exist in neural networks, this paper aims to investigate the finite time synchronization of memristor-based Cohen-Grossberg neural networks (MCGNNs) with both discrete delay and distributed delay (mixed delays). By means of a simple feedback controller and novel finite time synchronization analysis methods, several new criteria are derived to ensure the finite time synchronization of MCGNNs with mixed delays. The obtained criteria are very concise and easy to verify. Numerical simulations are presented to demonstrate the effectiveness of our theoretical results.
Finite time synchronization of memristor-based Cohen-Grossberg neural networks with mixed delays.
Directory of Open Access Journals (Sweden)
Chuan Chen
Full Text Available Finite time synchronization, which means synchronization can be achieved in a settling time, is desirable in some practical applications. However, most of the published results on finite time synchronization don't include delays or only include discrete delays. In view of the fact that distributed delays inevitably exist in neural networks, this paper aims to investigate the finite time synchronization of memristor-based Cohen-Grossberg neural networks (MCGNNs with both discrete delay and distributed delay (mixed delays. By means of a simple feedback controller and novel finite time synchronization analysis methods, several new criteria are derived to ensure the finite time synchronization of MCGNNs with mixed delays. The obtained criteria are very concise and easy to verify. Numerical simulations are presented to demonstrate the effectiveness of our theoretical results.
Super-transient scaling in time-delay autonomous Boolean network motifs
Energy Technology Data Exchange (ETDEWEB)
D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)
2016-09-15
Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.
Delay-induced diversity of firing behavior and ordered chaotic firing in adaptive neuronal networks
International Nuclear Information System (INIS)
Gong Yubing; Wang Li; Xu Bo
2012-01-01
In this paper, we study the effect of time delay on the firing behavior and temporal coherence and synchronization in Newman–Watts thermosensitive neuron networks with adaptive coupling. At beginning, the firing exhibit disordered spiking in absence of time delay. As time delay is increased, the neurons exhibit diversity of firing behaviors including bursting with multiple spikes in a burst, spiking, bursting with four, three and two spikes, firing death, and bursting with increasing amplitude. The spiking is the most ordered, exhibiting coherence resonance (CR)-like behavior, and the firing synchronization becomes enhanced with the increase of time delay. As growth rate of coupling strength or network randomness increases, CR-like behavior shifts to smaller time delay and the synchronization of firing increases. These results show that time delay can induce diversity of firing behaviors in adaptive neuronal networks, and can order the chaotic firing by enhancing and optimizing the temporal coherence and enhancing the synchronization of firing. However, the phenomenon of firing death shows that time delay may inhibit the firing of adaptive neuronal networks. These findings provide new insight into the role of time delay in the firing activity of adaptive neuronal networks, and can help to better understand the complex firing phenomena in neural networks.
International Nuclear Information System (INIS)
Lu, Chien-Yu
2011-01-01
This paper considers the problem of delay-dependent global robust stabilization for discrete, distributed and neutral interval time-varying delayed neural networks described by nonlinear delay differential equations of the neutral type. The parameter uncertainties are norm bounded. The activation functions are assumed to be bounded and globally Lipschitz continuous. Using a Lyapunov functional approach and linear matrix inequality (LMI) techniques, the stability criteria for the uncertain neutral neural networks with interval time-varying delays are established in the form of LMIs, which can be readily verified using the standard numerical software. An important feature of the result reported is that all the stability conditions are dependent on the upper and lower bounds of the delays. Another feature of the results lies in that it involves fewer free weighting matrix strategy, and upper bounds of the inner product between two vectors are not introduced to reduce the conservatism of the criteria. Two illustrative examples are provided to demonstrate the effectiveness and the reduced conservatism of the proposed method
Directory of Open Access Journals (Sweden)
Wenju Du
2016-01-01
Full Text Available In order to study the dynamic characteristics of urban public traffic network, this paper establishes the conventional bus traffic network and the urban rail traffic network based on the space R modeling method. Then regarding these two networks as the subnetwork, the paper presents a new bilayer coupled public traffic network through the transfer relationship between subway and bus, and this model well reflects the connection between the passengers and bus operating vehicles. Based on the synchronization theory of coupling network with time-varying delay and taking “Lorenz system” as the network node, the paper studies the synchronization of bilayer coupled public traffic network. Finally, numerical results are given to show the impact of public traffic dispatching, delayed departure, the number of public bus stops between bus lines, and the number of transfer stations between two traffic modes on the bilayer coupled public traffic network balance through Matlab simulation.
International Nuclear Information System (INIS)
Singh, Vimal
2007-01-01
The question of estimating the upper limit of -parallel B -parallel 2 , which is a key step in some recently reported global robust stability criteria for delayed neural networks, is revisited ( B denotes the delayed connection weight matrix). Recently, Cao, Huang, and Qu have given an estimate of the upper limit of -parallel B -parallel 2 . In the present paper, an alternative estimate of the upper limit of -parallel B -parallel 2 is highlighted. It is shown that the alternative estimate may yield some new global robust stability results
DEFF Research Database (Denmark)
Barforooshan, Mohsen; Østergaard, Jan; Stavrou, Fotios
2017-01-01
This paper presents an upper bound on the minimum data rate required to achieve a prescribed closed-loop performance level in networked control systems (NCSs). The considered feedback loop includes a linear time-invariant (LTI) plant with single measurement output and single control input. Moreover......, in this NCS, a causal but otherwise unconstrained feedback system carries out zero-delay variable-rate coding, and control. Between the encoder and decoder, data is exchanged over a rate-limited noiseless digital channel with a known constant time delay. Here we propose a linear source-coding scheme...
Exponential stability of fuzzy cellular neural networks with constant and time-varying delays
International Nuclear Information System (INIS)
Liu Yanqing; Tang Wansheng
2004-01-01
In this Letter, the global stability of delayed fuzzy cellular neural networks (FCNN) with either constant delays or time varying delays is proposed. Firstly, we give the existence and uniqueness of the equilibrium point by using the theory of topological degree and the properties of nonsingular M-matrix and the sufficient conditions for ascertaining the global exponential stability by constructing a suitable Lyapunov functional. Secondly, the criteria for guaranteeing the global exponential stability of FCNN with time varying delays are given and the estimation of exponential convergence rate with regard to speed of vary of delays is presented by constructing a suitable Lyapunov functional
International Nuclear Information System (INIS)
Wang Jian; Lu Junguo
2008-01-01
In this paper, we study the global exponential stability of fuzzy cellular neural networks with delays and reaction-diffusion terms. By constructing a suitable Lyapunov functional and utilizing some inequality techniques, we obtain a sufficient condition for the uniqueness and global exponential stability of the equilibrium solution for a class of fuzzy cellular neural networks with delays and reaction-diffusion terms. The result imposes constraint conditions on the network parameters independently of the delay parameter. The result is also easy to check and plays an important role in the design and application of globally exponentially stable fuzzy neural circuits
Directory of Open Access Journals (Sweden)
Xinwei Wang
2017-01-01
Full Text Available Topology detection for output-coupling weighted complex dynamical networks with two types of time delays is investigated in this paper. Different from existing literatures, coupling delay and transmission delay are simultaneously taken into account in the output-coupling network. Based on the idea of the state observer, we build the drive-response system and apply LaSalle’s invariance principle to the error dynamical system of the drive-response system. Several convergent criteria are deduced in the form of algebraic inequalities. Some numerical simulations for the complex dynamical network, with node dynamics being chaotic, are given to verify the effectiveness of the proposed scheme.
Directory of Open Access Journals (Sweden)
Xiong Gang
2009-01-01
Full Text Available This paper presents theoretical results on the convergence of the distributed consensus timing synchronization (DCTS algorithm for wireless sensor networks assuming general Gaussian delay between nodes. The asymptotic expectation and mean square of the global synchronization error are computed. The results lead to the definition of a time delay balanced network in which average timing consensus between nodes can be achieved despite random delays. Several structured network architectures are studied as examples, and their associated simulation results are used to validate analytical findings.
International Nuclear Information System (INIS)
Zhou Jin; Chen Tianping; Xiang Lan
2006-01-01
This paper investigates synchronization dynamics of delayed neural networks with all the parameters unknown. By combining the adaptive control and linear feedback with the updated law, some simple yet generic criteria for determining the robust synchronization based on the parameters identification of uncertain chaotic delayed neural networks are derived by using the invariance principle of functional differential equations. It is shown that the approaches developed here further extend the ideas and techniques presented in recent literature, and they are also simple to implement in practice. Furthermore, the theoretical results are applied to a typical chaotic delayed Hopfied neural networks, and numerical simulation also demonstrate the effectiveness and feasibility of the proposed technique
Impact of Network Coding on Delay and Throughput in Practical Wireless Chain Topologies
DEFF Research Database (Denmark)
Hundebøll, Martin; Rein, Stephan Alexander; Fitzek, Frank
2013-01-01
In this paper, we present results from a practical evaluation of network coding in a setup consisting of eight nodes deployed in a chain topology. With the tradition pure relaying, delay increases dramatically as the network gets congested, and here network coding helps to moderate this increase ...
Delay reduction in multi-hop device-to-device communication using network coding
Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Yang, Hong-Chuan; Alouini, Mohamed-Slim
2015-01-01
This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost
The climatogenetic factors and the transport network
Directory of Open Access Journals (Sweden)
Vasile MAXIM
2010-03-01
Full Text Available The article analyses the climatogenic factors and how they influence the transport system (network of the Republic of Moldova. The following climatogenetic factors were analysed: dynamic, physical-geographic, etc. as well as some specific climatic elements as the temperature of the air, cloud amount, humidity, direction and speed of the wind. As a conclusion it can be mentioned that when tracing the terrestrial transport system it is necessary to take into consideration the climatic factors which directly influence this field of human activity.
Liu, Hongjian; Wang, Zidong; Shen, Bo; Huang, Tingwen; Alsaadi, Fuad E
2018-06-01
This paper is concerned with the globally exponential stability problem for a class of discrete-time stochastic memristive neural networks (DSMNNs) with both leakage delays as well as probabilistic time-varying delays. For the probabilistic delays, a sequence of Bernoulli distributed random variables is utilized to determine within which intervals the time-varying delays fall at certain time instant. The sector-bounded activation function is considered in the addressed DSMNN. By taking into account the state-dependent characteristics of the network parameters and choosing an appropriate Lyapunov-Krasovskii functional, some sufficient conditions are established under which the underlying DSMNN is globally exponentially stable in the mean square. The derived conditions are made dependent on both the leakage and the probabilistic delays, and are therefore less conservative than the traditional delay-independent criteria. A simulation example is given to show the effectiveness of the proposed stability criterion. Copyright © 2018 Elsevier Ltd. All rights reserved.
Delay-enhanced coherence of spiral waves in noisy Hodgkin-Huxley neuronal networks
International Nuclear Information System (INIS)
Wang Qingyun; Perc, Matjaz; Duan Zhisheng; Chen Guanrong
2008-01-01
We study the spatial dynamics of spiral waves in noisy Hodgkin-Huxley neuronal ensembles evoked by different information transmission delays and network topologies. In classical settings of coherence resonance the intensity of noise is fine-tuned so as to optimize the system's response. Here, we keep the noise intensity constant, and instead, vary the length of information transmission delay amongst coupled neurons. We show that there exists an intermediate transmission delay by which the spiral waves are optimally ordered, hence indicating the existence of delay-enhanced coherence of spatial dynamics in the examined system. Additionally, we examine the robustness of this phenomenon as the diffusive interaction topology changes towards the small-world type, and discover that shortcut links amongst distant neurons hinder the emergence of coherent spiral waves irrespective of transmission delay length. Presented results thus provide insights that could facilitate the understanding of information transmission delay on realistic neuronal networks
Delay-tolerant mobile network protocol for rice field monitoring using wireless sensor networks
Guitton, Alexandre; Andres, Frédéric; Cardoso, Jarbas Lopes; Kawtrakul, Asanee; Barbin, Silvio E.
2015-10-01
The monitoring of rice fields can improve productivity by helping farmers throughout the rice cultivation cycle, on various issues: when to harvest, when to treat the crops against disease, when to increase the water level, how to share observations and decisions made in a collaborative way, etc. In this paper, we propose an architecture to monitor a rice field by a wireless sensor network. Our architecture is based on static sensor nodes forming a disconnected network, and mobile nodes communicating with the sensor nodes in a delay-tolerant manner. The data collected by the static sensor nodes are transmitted to mobile nodes, which in turn transmit them to a gateway, connected to a database, for further analysis. We focus on the related architecture, as well as on the energy-efficient protocols intended to perform the data collection.
National Research Council Canada - National Science Library
Mitchell, Jason
2003-01-01
.... This model is used to study the effect of communication delays on the performance of an iteractive network flow optimization model that results in a sequence of linear programs for the optimal...
Cai, Shuiming; Zhou, Peipei; Liu, Zengrong
2014-09-01
This paper concerns the problem of exponential synchronization for a class of general delayed dynamical networks with hybrid coupling via pinning periodically intermittent control. Both the internal delay and coupling delay are taken into account in the network model. Meanwhile, the transmission delay and self-feedback delay are involved in the delayed coupling term. By establishing a new differential inequality, several simple and useful exponential synchronization criteria are derived analytically. It is shown that the controlled synchronization state can vary in comparison with the conventional synchronized solution, and the degree of the node and the inner delayed coupling matrix play important roles in the controlled synchronization state. By choosing different inner delayed coupling matrices and the degrees of the node, different controlled synchronization states can be obtained. Furthermore, the detail pinning schemes deciding what nodes should be chosen as pinned candidates and how many nodes are needed to be pinned for a fixed coupling strength are provided. The simple procedures illuminating how to design suitable intermittent controllers in real application are also given. Numerical simulations, including an undirected scale-free network and a directed small-world network, are finally presented to demonstrate the effectiveness of the theoretical results.
Absolute stability of nonlinear systems with time delays and applications to neural networks
Directory of Open Access Journals (Sweden)
Xinzhi Liu
2001-01-01
Full Text Available In this paper, absolute stability of nonlinear systems with time delays is investigated. Sufficient conditions on absolute stability are derived by using the comparison principle and differential inequalities. These conditions are simple and easy to check. In addition, exponential stability conditions for some special cases of nonlinear delay systems are discussed. Applications of those results to cellular neural networks are presented.
Pinning Synchronization of Delayed Neural Networks with Nonlinear Inner-Coupling
Directory of Open Access Journals (Sweden)
Yangling Wang
2011-01-01
Full Text Available Without assuming the symmetry and irreducibility of the outer-coupling weight configuration matrices, we investigate the pinning synchronization of delayed neural networks with nonlinear inner-coupling. Some delay-dependent controlled stability criteria in terms of linear matrix inequality (LMI are obtained. An example is presented to show the application of the criteria obtained in this paper.
Impulsive effects on global asymptotic stability of delay BAM neural networks
International Nuclear Information System (INIS)
Chen Jun; Cui Baotong
2008-01-01
Based on the proper Lyapunov functions and the Jacobsthal liner inequality, some sufficient conditions are presented in this paper for global asymptotic stability of delay bidirectional associative memory neural networks with impulses. The obtained results are independently of the delay parameters and can be easily verified. Also, some remarks and an illustrative example are given to demonstrate the effectiveness of the obtained results
Global Hopf bifurcation analysis on a BAM neural network with delays
Sun, Chengjun; Han, Maoan; Pang, Xiaoming
2007-01-01
A delayed differential equation that models a bidirectional associative memory (BAM) neural network with four neurons is considered. By using a global Hopf bifurcation theorem for FDE and a Bendixon's criterion for high-dimensional ODE, a group of sufficient conditions for the system to have multiple periodic solutions are obtained when the sum of delays is sufficiently large.
Robust stability of bidirectional associative memory neural networks with time delays
Park, Ju H.
2006-01-01
Based on the Lyapunov Krasovskii functionals combined with linear matrix inequality approach, a novel stability criterion is proposed for asymptotic stability of bidirectional associative memory neural networks with time delays. A novel delay-dependent stability criterion is given in terms of linear matrix inequalities, which can be solved easily by various optimization algorithms.
Global Hopf bifurcation analysis on a BAM neural network with delays
International Nuclear Information System (INIS)
Sun Chengjun; Han Maoan; Pang Xiaoming
2007-01-01
A delayed differential equation that models a bidirectional associative memory (BAM) neural network with four neurons is considered. By using a global Hopf bifurcation theorem for FDE and a Bendixon's criterion for high-dimensional ODE, a group of sufficient conditions for the system to have multiple periodic solutions are obtained when the sum of delays is sufficiently large
Robust stability of bidirectional associative memory neural networks with time delays
International Nuclear Information System (INIS)
Park, Ju H.
2006-01-01
Based on the Lyapunov-Krasovskii functionals combined with linear matrix inequality approach, a novel stability criterion is proposed for asymptotic stability of bidirectional associative memory neural networks with time delays. A novel delay-dependent stability criterion is given in terms of linear matrix inequalities, which can be solved easily by various optimization algorithms
Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.
Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush
2016-08-01
This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.
International Nuclear Information System (INIS)
Zhang Qun-Jiao; Zhao Jun-Chan
2012-01-01
This paper mainly investigates the exponential synchronization of an inner time-varying complex network with coupling delay. Firstly, the synchronization of complex networks is decoupled into the stability of the corresponding dynamical systems. Based on the Lyapunov function theory, some sufficient conditions to guarantee its stability with any given convergence rate are derived, thus the synchronization of the networks is achieved. Finally, the results are illustrated by a simple time-varying network model with a coupling delay. All involved numerical simulations verify the correctness of the theoretical analysis. (general)
Directory of Open Access Journals (Sweden)
Hongli Liu
2009-01-01
Full Text Available We derive a new criterion for checking the global stability of periodic oscillation of bidirectional associative memory (BAM neural networks with periodic coefficients and distributed delay, and find that the criterion relies on the Lipschitz constants of the signal transmission functions, weights of the neural network, and delay kernels. The proposed model transforms the original interacting network into matrix analysis problem which is easy to check, thereby significantly reducing the computational complexity and making analysis of periodic oscillation for even large-scale networks.
Defining Tolerance: Impacts of Delay and Disruption when Managing Challenged Networks
Birrane, Edward J. III; Burleigh, Scott C.; Cerf, Vint
2011-01-01
Challenged networks exhibit irregularities in their communication performance stemming from node mobility, power constraints, and impacts from the operating environment. These irregularities manifest as high signal propagation delay and frequent link disruption. Understanding those limits of link disruption and propagation delay beyond which core networking features fail is an ongoing area of research. Various wireless networking communities propose tools and techniques that address these phenomena. Emerging standardization activities within the Internet Research Task Force (IRTF) and the Consultative Committee for Space Data Systems (CCSDS) look to build upon both this experience and scalability analysis. Successful research in this area is predicated upon identifying enablers for common communication functions (notably node discovery, duplex communication, state caching, and link negotiation) and how increased disruptions and delays affect their feasibility within the network. Networks that make fewer assumptions relating to these enablers provide more universal service. Specifically, reliance on node discovery and link negotiation results in network-specific operational concepts rather than scalable technical solutions. Fundamental to this debate are the definitions, assumptions, operational concepts, and anticipated scaling of these networks. This paper presents the commonalities and differences between delay and disruption tolerance, including support protocols and critical enablers. We present where and how these tolerances differ. We propose a set of use cases that must be accommodated by any standardized delay-tolerant network and discuss the implication of these on existing tool development.
On global exponential stability of high-order neural networks with time-varying delays
International Nuclear Information System (INIS)
Zhang Baoyong; Xu Shengyuan; Li Yongmin; Chu Yuming
2007-01-01
This Letter investigates the problem of stability analysis for a class of high-order neural networks with time-varying delays. The delays are bounded but not necessarily differentiable. Based on the Lyapunov stability theory together with the linear matrix inequality (LMI) approach and the use of Halanay inequality, sufficient conditions guaranteeing the global exponential stability of the equilibrium point of the considered neural networks are presented. Two numerical examples are provided to demonstrate the effectiveness of the proposed stability criteria
On global exponential stability of high-order neural networks with time-varying delays
Energy Technology Data Exchange (ETDEWEB)
Zhang Baoyong [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China)]. E-mail: baoyongzhang@yahoo.com.cn; Xu Shengyuan [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China)]. E-mail: syxu02@yahoo.com.cn; Li Yongmin [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China) and Department of Mathematics, Huzhou Teacher' s College, Huzhou 313000, Zhejiang (China)]. E-mail: ymlwww@163.com; Chu Yuming [Department of Mathematics, Huzhou Teacher' s College, Huzhou 313000, Zhejiang (China)
2007-06-18
This Letter investigates the problem of stability analysis for a class of high-order neural networks with time-varying delays. The delays are bounded but not necessarily differentiable. Based on the Lyapunov stability theory together with the linear matrix inequality (LMI) approach and the use of Halanay inequality, sufficient conditions guaranteeing the global exponential stability of the equilibrium point of the considered neural networks are presented. Two numerical examples are provided to demonstrate the effectiveness of the proposed stability criteria.
International Nuclear Information System (INIS)
Liang Jinling; Cao Jinde
2003-01-01
Employing general Halanay inequality, we analyze the global exponential stability of a class of reaction-diffusion recurrent neural networks with time-varying delays. Several new sufficient conditions are obtained to ensure existence, uniqueness and global exponential stability of the equilibrium point of delayed reaction-diffusion recurrent neural networks. The results extend and improve the earlier publications. In addition, an example is given to show the effectiveness of the obtained result
Global exponential stability of mixed discrete and distributively delayed cellular neural network
International Nuclear Information System (INIS)
Yao Hong-Xing; Zhou Jia-Yan
2011-01-01
This paper concernes analysis for the global exponential stability of a class of recurrent neural networks with mixed discrete and distributed delays. It first proves the existence and uniqueness of the balance point, then by employing the Lyapunov—Krasovskii functional and Young inequality, it gives the sufficient condition of global exponential stability of cellular neural network with mixed discrete and distributed delays, in addition, the example is provided to illustrate the applicability of the result. (general)
Global exponential stability of uncertain fuzzy BAM neural networks with time-varying delays
International Nuclear Information System (INIS)
Syed Ali, M.; Balasubramaniam, P.
2009-01-01
In this paper, the Takagi-Sugeno (TS) fuzzy model representation is extended to the stability analysis for uncertain Bidirectional Associative Memory (BAM) neural networks with time-varying delays using linear matrix inequality (LMI) theory. A novel LMI-based stability criterion is obtained by LMI optimization algorithms to guarantee the exponential stability of uncertain BAM neural networks with time-varying delays which are represented by TS fuzzy models. Finally, the proposed stability conditions are demonstrated with numerical examples.
International Nuclear Information System (INIS)
Wen Zhen; Sun Jitao
2009-01-01
In this paper, we investigate the existence and uniqueness of equilibrium point for delayed Cohen-Grossberg bidirectional associative memory (BAM) neural networks with impulses, based on nonsmooth analysis method. And we give the criteria of global exponential stability of the unique equilibrium point for the delayed BAM neural networks with impulses using Lyapunov method. The new sufficient condition generalizes and improves the previously known results. Finally, we present examples to illustrate that our results are effective.
International Nuclear Information System (INIS)
Xu Chang-Jin; Li Pei-Luan; Pang Yi-Cheng
2017-01-01
This paper is concerned with fractional-order bidirectional associative memory (BAM) neural networks with time delays. Applying Laplace transform, the generalized Gronwall inequality and estimates of Mittag–Leffler functions, some sufficient conditions which ensure the finite-time stability of fractional-order bidirectional associative memory neural networks with time delays are obtained. Two examples with their simulations are given to illustrate the theoretical findings. Our results are new and complement previously known results. (paper)
International Nuclear Information System (INIS)
Arik, Sabri
2006-01-01
This Letter presents a sufficient condition for the existence, uniqueness and global asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with distributed time delays. The results impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all bounded continuous non-monotonic neuron activation functions. The results are also compared with the previous results derived in the literature
Senan, Sibel; Arik, Sabri
2007-10-01
This correspondence presents a sufficient condition for the existence, uniqueness, and global robust asymptotic stability of the equilibrium point for bidirectional associative memory neural networks with discrete time delays. The results impose constraint conditions on the network parameters of the neural system independently of the delay parameter, and they are applicable to all bounded continuous nonmonotonic neuron activation functions. Some numerical examples are given to compare our results with the previous robust stability results derived in the literature.
Arik, Sabri
2006-02-01
This Letter presents a sufficient condition for the existence, uniqueness and global asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with distributed time delays. The results impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all bounded continuous non-monotonic neuron activation functions. The results are also compared with the previous results derived in the literature.
International Nuclear Information System (INIS)
Lou, X.; Cui, B.
2008-01-01
In this paper we consider the problem of exponential stability for recurrent neural networks with multiple time varying delays and reaction-diffusion terms. The activation functions are supposed to be bounded and globally Lipschitz continuous. By means of Lyapunov functional, sufficient conditions are derived, which guarantee global exponential stability of the delayed neural network. Finally, a numerical example is given to show the correctness of our analysis. (author)
On the delay effects of different channels in Internet-based networked control systems
Zhao, Yun-Bo; Kim, Jongrae; Sun, Xi-Ming; Liu, Guo-Ping
2013-11-01
The sensor-to-controller and the controller-to-actuator delays in networked control systems (NCSs) are investigated for the first time with respect to their different effects on the system performance. This study starts with identifying the delay-independent and delay-dependent control laws in NCSs, and confirms that only two delay-dependent control laws can cause different delay effects in different channels. The conditions under which the different delays in different channels can cause different effects are then given for both delay-dependent control laws. The results are verified by numerical examples. Potentially, these results can be regarded as important design principles in the practical implementation of NCSs.
Global dissipativity of continuous-time recurrent neural networks with time delay
International Nuclear Information System (INIS)
Liao Xiaoxin; Wang Jun
2003-01-01
This paper addresses the global dissipativity of a general class of continuous-time recurrent neural networks. First, the concepts of global dissipation and global exponential dissipation are defined and elaborated. Next, the sets of global dissipativity and global exponentially dissipativity are characterized using the parameters of recurrent neural network models. In particular, it is shown that the Hopfield network and cellular neural networks with or without time delays are dissipative systems
Structural Properties of the Brazilian Air Transportation Network
Directory of Open Access Journals (Sweden)
GUILHERME S. COUTO
2015-09-01
Full Text Available The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.
Structural Properties of the Brazilian Air Transportation Network.
Couto, Guilherme S; da Silva, Ana Paula Couto; Ruiz, Linnyer B; Benevenuto, Fabrício
2015-09-01
The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City) is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.
A decomposition approach to analysis of competitive-cooperative neural networks with delay
International Nuclear Information System (INIS)
Chu Tianguang; Zhang Zongda; Wang Zhaolin
2003-01-01
Competitive-cooperative or inhibitory-excitatory configurations abound in neural networks. It is demonstrated here how such a configuration may be exploited to give a detailed characterization of the fixed point dynamics in general neural networks with time delay. The idea is to divide the connection weights into inhibitory and excitatory types and thereby to embed a competitive-cooperative delay neural network into an augmented cooperative delay system through a symmetric transformation. This allows for the use of the powerful monotone properties of cooperative systems. By the method, we derive several simple necessary and sufficient conditions on guaranteed trapping regions and guaranteed componentwise (exponential) convergence of the neural networks. The results relate specific decay rate and trajectory bounds to system parameters and are therefore of practical significance in designing a network with desired performance
Passivity analysis of memristor-based impulsive inertial neural networks with time-varying delays.
Wan, Peng; Jian, Jigui
2018-03-01
This paper focuses on delay-dependent passivity analysis for a class of memristive impulsive inertial neural networks with time-varying delays. By choosing proper variable transformation, the memristive inertial neural networks can be rewritten as first-order differential equations. The memristive model presented here is regarded as a switching system rather than employing the theory of differential inclusion and set-value map. Based on matrix inequality and Lyapunov-Krasovskii functional method, several delay-dependent passivity conditions are obtained to ascertain the passivity of the addressed networks. In addition, the results obtained here contain those on the passivity for the addressed networks without impulse effects as special cases and can also be generalized to other neural networks with more complex pulse interference. Finally, one numerical example is presented to show the validity of the obtained results. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.
Cross-layer restoration with software defined networking based on IP over optical transport networks
Yang, Hui; Cheng, Lei; Deng, Junni; Zhao, Yongli; Zhang, Jie; Lee, Young
2015-10-01
The IP over optical transport network is a very promising networking architecture applied to the interconnection of geographically distributed data centers due to the performance guarantee of low delay, huge bandwidth and high reliability at a low cost. It can enable efficient resource utilization and support heterogeneous bandwidth demands in highly-available, cost-effective and energy-effective manner. In case of cross-layer link failure, to ensure a high-level quality of service (QoS) for user request after the failure becomes a research focus. In this paper, we propose a novel cross-layer restoration scheme for data center services with software defined networking based on IP over optical network. The cross-layer restoration scheme can enable joint optimization of IP network and optical network resources, and enhance the data center service restoration responsiveness to the dynamic end-to-end service demands. We quantitatively evaluate the feasibility and performances through the simulation under heavy traffic load scenario in terms of path blocking probability and path restoration latency. Numeric results show that the cross-layer restoration scheme improves the recovery success rate and minimizes the overall recovery time.
International Nuclear Information System (INIS)
Li Zuoan; Li Kelin
2009-01-01
In this paper, we investigate a class of impulsive fuzzy cellular neural networks with distributed delays and reaction-diffusion terms. By employing the delay differential inequality with impulsive initial conditions and M-matrix theory, we find some sufficient conditions ensuring the existence, uniqueness and global exponential stability of equilibrium point for impulsive fuzzy cellular neural networks with distributed delays and reaction-diffusion terms. In particular, the estimate of the exponential converging index is also provided, which depends on the system parameters. An example is given to show the effectiveness of the results obtained here.
Global exponential stability for discrete-time neural networks with variable delays
International Nuclear Information System (INIS)
Chen Wuhua; Lu Xiaomei; Liang Dongying
2006-01-01
This Letter provides new exponential stability criteria for discrete-time neural networks with variable delays. The main technique is to reduce exponential convergence estimation of the neural network solution to that of one component of the corresponding solution by constructing Lyapunov function based on M-matrix. By introducing the tuning parameter diagonal matrix, the delay-independent and delay-dependent exponential stability conditions have been unified in the same mathematical formula. The effectiveness of the new results are illustrated by three examples
Chimera states in complex networks: interplay of fractal topology and delay
Sawicki, Jakub; Omelchenko, Iryna; Zakharova, Anna; Schöll, Eckehard
2017-06-01
Chimera states are an example of intriguing partial synchronization patterns emerging in networks of identical oscillators. They consist of spatially coexisting domains of coherent (synchronized) and incoherent (desynchronized) dynamics. We analyze chimera states in networks of Van der Pol oscillators with hierarchical connectivities, and elaborate the role of time delay introduced in the coupling term. In the parameter plane of coupling strength and delay time we find tongue-like regions of existence of chimera states alternating with regions of existence of coherent travelling waves. We demonstrate that by varying the time delay one can deliberately stabilize desired spatio-temporal patterns in the system.
Discrete-time bidirectional associative memory neural networks with variable delays
International Nuclear Information System (INIS)
Liang Jinling; Cao Jinde; Ho, Daniel W.C.
2005-01-01
Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks
Local and global synchronization in general complex dynamical networks with delay coupling
International Nuclear Information System (INIS)
Lu Jianquan; Ho, Daniel W.C.
2008-01-01
Local and global synchronization of complex dynamical networks are studied in this paper. Some simple yet generic criteria ensuring delay-independent and delay-dependent synchronization are derived in terms of linear matrix inequalities (LMIs), which can be verified easily via interior-point algorithm. The assumption that the coupling configuration matrix is symmetric and irreducible, which is frequently used in other literatures, is removed. A network with a fixed delay and a special coupling scheme is given as an example to illustrate the theoretical results and the effectiveness of the proposed synchronization scheme
Discrete-time bidirectional associative memory neural networks with variable delays
Liang, variable delays [rapid communication] J.; Cao, J.; Ho, D. W. C.
2005-02-01
Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks.
On the synchronization of neural networks containing time-varying delays and sector nonlinearity
International Nuclear Information System (INIS)
Yan, J.-J.; Lin, J.-S.; Hung, M.-L.; Liao, T.-L.
2007-01-01
We present a systematic design procedure for synchronization of neural networks subject to time-varying delays and sector nonlinearity in the control input. Based on the drive-response concept and the Lyapunov stability theorem, a memoryless decentralized control law is proposed which guarantees exponential synchronization even when input nonlinearity is present. The supplementary requirement that the time-derivative of time-varying delays must be smaller than one is released for the proposed control scheme. A four-dimensional Hopfield neural network with time-varying delays is presented as the illustrative example to demonstrate the effectiveness of the proposed synchronization scheme
Xiao, Min; Zheng, Wei Xing; Cao, Jinde
2013-01-01
Recent studies on Hopf bifurcations of neural networks with delays are confined to simplified neural network models consisting of only two, three, four, five, or six neurons. It is well known that neural networks are complex and large-scale nonlinear dynamical systems, so the dynamics of the delayed neural networks are very rich and complicated. Although discussing the dynamics of networks with a few neurons may help us to understand large-scale networks, there are inevitably some complicated problems that may be overlooked if simplified networks are carried over to large-scale networks. In this paper, a general delayed bidirectional associative memory neural network model with n + 1 neurons is considered. By analyzing the associated characteristic equation, the local stability of the trivial steady state is examined, and then the existence of the Hopf bifurcation at the trivial steady state is established. By applying the normal form theory and the center manifold reduction, explicit formulae are derived to determine the direction and stability of the bifurcating periodic solution. Furthermore, the paper highlights situations where the Hopf bifurcations are particularly critical, in the sense that the amplitude and the period of oscillations are very sensitive to errors due to tolerances in the implementation of neuron interconnections. It is shown that the sensitivity is crucially dependent on the delay and also significantly influenced by the feature of the number of neurons. Numerical simulations are carried out to illustrate the main results.
Synchronization of stochastic delayed neural networks with markovian switching and its application.
Tang, Yang; Fang, Jian-An; Miao, Qing-Ying
2009-02-01
In this paper, the problem of adaptive synchronization for a class of stochastic neural networks (SNNs) which involve both mixed delays and Markovian jumping parameters is investigated. The mixed delays comprise the time-varying delays and distributed delays, both of which are mode-dependent. The stochastic perturbations are described in terms of Browian motion. By the adaptive feedback technique, several sufficient criteria have been proposed to ensure the synchronization of SNNs in mean square. Moreover, the proposed adaptive feedback scheme is applied to the secure communication. Finally, the corresponding simulation results are given to demonstrate the usefulness of the main results obtained.
Delay-aware adaptive sleep mechanism for green wireless-optical broadband access networks
Wang, Ruyan; Liang, Alei; Wu, Dapeng; Wu, Dalei
2017-07-01
Wireless-Optical Broadband Access Network (WOBAN) is capacity-high, reliable, flexible, and ubiquitous, as it takes full advantage of the merits from both optical communication and wireless communication technologies. Similar to other access networks, the high energy consumption poses a great challenge for building up WOBANs. To shot this problem, we can make some load-light Optical Network Units (ONUs) sleep to reduce the energy consumption. Such operation, however, causes the increased packet delay. Jointly considering the energy consumption and transmission delay, we propose a delay-aware adaptive sleep mechanism. Specifically, we develop a new analytical method to evaluate the transmission delay and queuing delay over the optical part, instead of adopting M/M/1 queuing model. Meanwhile, we also analyze the access delay and queuing delay of the wireless part. Based on such developed delay models, we mathematically derive ONU's optimal sleep time. In addition, we provide numerous simulation results to show the effectiveness of the proposed mechanism.
Distributed Interplanetary Delay/Disruption Tolerant Network (DTN) Monitor and Control System
Wang, Shin-Ywan
2012-01-01
The main purpose of Distributed interplanetary Delay Tolerant Network Monitor and Control System as a DTN system network management implementation in JPL is defined to provide methods and tools that can monitor the DTN operation status, detect and resolve DTN operation failures in some automated style while either space network or some heterogeneous network is infused with DTN capability. In this paper, "DTN Monitor and Control system in Deep Space Network (DSN)" exemplifies a case how DTN Monitor and Control system can be adapted into a space network as it is DTN enabled.
Phase models and clustering in networks of oscillators with delayed coupling
Campbell, Sue Ann; Wang, Zhen
2018-01-01
We consider a general model for a network of oscillators with time delayed coupling where the coupling matrix is circulant. We use the theory of weakly coupled oscillators to reduce the system of delay differential equations to a phase model where the time delay enters as a phase shift. We use the phase model to determine model independent existence and stability results for symmetric cluster solutions. Our results extend previous work to systems with time delay and a more general coupling matrix. We show that the presence of the time delay can lead to the coexistence of multiple stable clustering solutions. We apply our analytical results to a network of Morris Lecar neurons and compare these results with numerical continuation and simulation studies.
Capacity of Heterogeneous Mobile Wireless Networks with D-Delay Transmission Strategy.
Wu, Feng; Zhu, Jiang; Xi, Zhipeng; Gao, Kai
2016-03-25
This paper investigates the capacity problem of heterogeneous wireless networks in mobility scenarios. A heterogeneous network model which consists of n normal nodes and m helping nodes is proposed. Moreover, we propose a D-delay transmission strategy to ensure that every packet can be delivered to its destination nodes with limited delay. Different from most existing network schemes, our network model has a novel two-tier architecture. The existence of helping nodes greatly improves the network capacity. Four types of mobile networks are studied in this paper: i.i.d. fast mobility model and slow mobility model in two-dimensional space, i.i.d. fast mobility model and slow mobility model in three-dimensional space. Using the virtual channel model, we present an intuitive analysis of the capacity of two-dimensional mobile networks and three-dimensional mobile networks, respectively. Given a delay constraint D, we derive the asymptotic expressions for the capacity of the four types of mobile networks. Furthermore, the impact of D and m to the capacity of the whole network is analyzed. Our findings provide great guidance for the future design of the next generation of networks.
A Novel Message Scheduling Framework for Delay Tolerant Networks Routing
Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem
2013-01-01
new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive
Research on centrality of urban transport network nodes
Wang, Kui; Fu, Xiufen
2017-05-01
Based on the actual data of urban transport in Guangzhou, 19,150 bus stations in Guangzhou (as of 2014) are selected as nodes. Based on the theory of complex network, the network model of Guangzhou urban transport is constructed. By analyzing the degree centrality index, betweenness centrality index and closeness centrality index of nodes in the network, the level of centrality of each node in the network is studied. From a different point of view to determine the hub node of Guangzhou urban transport network, corresponding to the city's key sites and major transfer sites. The reliability of the network is determined by the stability of some key nodes (transport hub station). The research of network node centralization can provide a theoretical basis for the rational allocation of urban transport network sites and public transport system planning.
Exponential stability of uncertain stochastic neural networks with mixed time-delays
International Nuclear Information System (INIS)
Wang Zidong; Lauria, Stanislao; Fang Jian'an; Liu Xiaohui
2007-01-01
This paper is concerned with the global exponential stability analysis problem for a class of stochastic neural networks with mixed time-delays and parameter uncertainties. The mixed delays comprise discrete and distributed time-delays, the parameter uncertainties are norm-bounded, and the neural networks are subjected to stochastic disturbances described in terms of a Brownian motion. The purpose of the stability analysis problem is to derive easy-to-test criteria under which the delayed stochastic neural network is globally, robustly, exponentially stable in the mean square for all admissible parameter uncertainties. By resorting to the Lyapunov-Krasovskii stability theory and the stochastic analysis tools, sufficient stability conditions are established by using an efficient linear matrix inequality (LMI) approach. The proposed criteria can be checked readily by using recently developed numerical packages, where no tuning of parameters is required. An example is provided to demonstrate the usefulness of the proposed criteria
Stability analysis and synchronization in discrete-time complex networks with delayed coupling
Cheng, Ranran; Peng, Mingshu; Yu, Weibin; Sun, Bo; Yu, Jinchen
2013-12-01
A new network of coupled maps is proposed in which the connections between units involve no delays but the intra-neural communication does, whereas in the work of Atay et al. [Phys. Rev. Lett. 92, 144101 (2004)], the focus is on information processing delayed by the inter-neural communication. We show that the synchronization of the network depends on not only the intrinsic dynamical features and inter-connection topology (characterized by the spectrum of the graph Laplacian) but also the delays and the coupling strength. There are two main findings: (i) the more neighbours, the easier to be synchronized; (ii) odd delays are easier to be synchronized than even ones. In addition, compared with those discussed by Atay et al. [Phys. Rev. Lett. 92, 144101 (2004)], our model has a better synchronizability for regular networks and small-world variants.
A normalized PID controller in networked control systems with varying time delays.
Tran, Hoang-Dung; Guan, Zhi-Hong; Dang, Xuan-Kien; Cheng, Xin-Ming; Yuan, Fu-Shun
2013-09-01
It requires not only simplicity and flexibility but also high specified stability and robustness of system to design a PI/PID controller in such complicated networked control systems (NCSs) with delays. By gain and phase margins approach, this paper proposes a novel normalized PI/PID controller for NCSs based on analyzing the stability and robustness of system under the effect of network-induced delays. Specifically, We take into account the total measured network delays to formulate the gain and phase margins of the closed-loop system in the form of a set of equations. With pre-specified values of gain and phase margins, this set of equations is then solved for calculating the closed forms of control parameters which enable us to propose the normalized PI/PID controller simultaneously satisfying the following two requirements: (1) simplicity without re-solving the optimization problem for a new process, (2) high flexibility to cope with large scale of random delays and deal with many different processes in different conditions of network. Furthermore, in our method, the upper bound of random delay can be estimated to indicate the operating domain of proposed PI/PID controller. Finally, simulation results are shown to demonstrate the advantages of our proposed controller in many situations of network-induced delays. Copyright © 2013 ISA. Published by Elsevier Ltd. All rights reserved.
Incorporating time-delays in S-System model for reverse engineering genetic networks.
Chowdhury, Ahsan Raja; Chetty, Madhu; Vinh, Nguyen Xuan
2013-06-18
In any gene regulatory network (GRN), the complex interactions occurring amongst transcription factors and target genes can be either instantaneous or time-delayed. However, many existing modeling approaches currently applied for inferring GRNs are unable to represent both these interactions simultaneously. As a result, all these approaches cannot detect important interactions of the other type. S-System model, a differential equation based approach which has been increasingly applied for modeling GRNs, also suffers from this limitation. In fact, all S-System based existing modeling approaches have been designed to capture only instantaneous interactions, and are unable to infer time-delayed interactions. In this paper, we propose a novel Time-Delayed S-System (TDSS) model which uses a set of delay differential equations to represent the system dynamics. The ability to incorporate time-delay parameters in the proposed S-System model enables simultaneous modeling of both instantaneous and time-delayed interactions. Furthermore, the delay parameters are not limited to just positive integer values (corresponding to time stamps in the data), but can also take fractional values. Moreover, we also propose a new criterion for model evaluation exploiting the sparse and scale-free nature of GRNs to effectively narrow down the search space, which not only reduces the computation time significantly but also improves model accuracy. The evaluation criterion systematically adapts the max-min in-degrees and also systematically balances the effect of network accuracy and complexity during optimization. The four well-known performance measures applied to the experimental studies on synthetic networks with various time-delayed regulations clearly demonstrate that the proposed method can capture both instantaneous and delayed interactions correctly with high precision. The experiments carried out on two well-known real-life networks, namely IRMA and SOS DNA repair network in
Sheng, Li; Wang, Zidong; Tian, Engang; Alsaadi, Fuad E
2016-12-01
This paper deals with the H ∞ state estimation problem for a class of discrete-time neural networks with stochastic delays subject to state- and disturbance-dependent noises (also called (x,v)-dependent noises) and fading channels. The time-varying stochastic delay takes values on certain intervals with known probability distributions. The system measurement is transmitted through fading channels described by the Rice fading model. The aim of the addressed problem is to design a state estimator such that the estimation performance is guaranteed in the mean-square sense against admissible stochastic time-delays, stochastic noises as well as stochastic fading signals. By employing the stochastic analysis approach combined with the Kronecker product, several delay-distribution-dependent conditions are derived to ensure that the error dynamics of the neuron states is stochastically stable with prescribed H ∞ performance. Finally, a numerical example is provided to illustrate the effectiveness of the obtained results. Copyright © 2016 Elsevier Ltd. All rights reserved.
Minimal-delay traffic grooming for WDM star networks
Choi, Hongsik; Garg, Nikhil; Choi, Hyeong-Ah
2003-10-01
All-optical networks face the challenge of reducing slower opto-electronic conversions by managing assignment of traffic streams to wavelengths in an intelligent manner, while at the same time utilizing bandwidth resources to the maximum. This challenge becomes harder in networks closer to the end users that have insufficient data to saturate single wavelengths as well as traffic streams outnumbering the usable wavelengths, resulting in traffic grooming which requires costly traffic analysis at access nodes. We study the problem of traffic grooming that reduces the need to analyze traffic, for a class of network architecture most used by Metropolitan Area Networks; the star network. The problem being NP-complete, we provide an efficient twice-optimal-bound greedy heuristic for the same, that can be used to intelligently groom traffic at the LANs to reduce latency at the access nodes. Simulation results show that our greedy heuristic achieves a near-optimal solution.
Finite-Time Stabilization and Adaptive Control of Memristor-Based Delayed Neural Networks.
Wang, Leimin; Shen, Yi; Zhang, Guodong
Finite-time stability problem has been a hot topic in control and system engineering. This paper deals with the finite-time stabilization issue of memristor-based delayed neural networks (MDNNs) via two control approaches. First, in order to realize the stabilization of MDNNs in finite time, a delayed state feedback controller is proposed. Then, a novel adaptive strategy is applied to the delayed controller, and finite-time stabilization of MDNNs can also be achieved by using the adaptive control law. Some easily verified algebraic criteria are derived to ensure the stabilization of MDNNs in finite time, and the estimation of the settling time functional is given. Moreover, several finite-time stability results as our special cases for both memristor-based neural networks (MNNs) without delays and neural networks are given. Finally, three examples are provided for the illustration of the theoretical results.Finite-time stability problem has been a hot topic in control and system engineering. This paper deals with the finite-time stabilization issue of memristor-based delayed neural networks (MDNNs) via two control approaches. First, in order to realize the stabilization of MDNNs in finite time, a delayed state feedback controller is proposed. Then, a novel adaptive strategy is applied to the delayed controller, and finite-time stabilization of MDNNs can also be achieved by using the adaptive control law. Some easily verified algebraic criteria are derived to ensure the stabilization of MDNNs in finite time, and the estimation of the settling time functional is given. Moreover, several finite-time stability results as our special cases for both memristor-based neural networks (MNNs) without delays and neural networks are given. Finally, three examples are provided for the illustration of the theoretical results.
International Nuclear Information System (INIS)
Liu Bingwen
2008-01-01
In this Letter, we consider a class of delayed cellular neural networks with time-varying coefficients. By applying Lyapunov functional method and differential inequality techniques, we establish new results to ensure that all solutions of the networks converge exponentially to zero point
Chaos Control and Synchronization of Cellular Neural Network with Delays Based on OPNCL Control
International Nuclear Information System (INIS)
Qian, Tang; Xing-Yuan, Wang
2010-01-01
The problem of chaos control and complete synchronization of cellular neural network with delays is studied. Based on the open plus nonlinear closed loop (OPNCL) method, the control scheme and synchronization scheme are designed. Both the schemes can achieve the chaos control and complete synchronization of chaotic neural network respectively, and their validity is further verified by numerical simulation experiments. (general)
Delay performance of a broadcast spectrum sharing network in Nakagami-m fading
Khan, Fahd Ahmed; Tourki, Kamel; Alouini, Mohamed-Slim; Qaraqe, Khalid A.
2014-01-01
In this paper, we analyze the delay performance of a point-to-multipoint secondary network (P2M-SN), which is concurrently sharing the spectrum with a point-to-multipoint primary network (P2M-PN). The channel is assumed to be independent
Stability of Delayed Hopfield Neural Networks with Variable-Time Impulses
Directory of Open Access Journals (Sweden)
Yangjun Pei
2014-01-01
Full Text Available In this paper the globally exponential stability criteria of delayed Hopfield neural networks with variable-time impulses are established. The proposed criteria can also be applied in Hopfield neural networks with fixed-time impulses. A numerical example is presented to illustrate the effectiveness of our theoretical results.
Almost sure exponential stability of stochastic fuzzy cellular neural networks with delays
International Nuclear Information System (INIS)
Zhao Hongyong; Ding Nan; Chen Ling
2009-01-01
This paper is concerned with the problem of exponential stability analysis for fuzzy cellular neural network with delays. By constructing suitable Lyapunov functional and using stochastic analysis we present some sufficient conditions ensuring almost sure exponential stability for the network. Moreover, an example is given to demonstrate the advantages of our method.
On design and evaluation of tapped-delay neural network architectures
DEFF Research Database (Denmark)
Svarer, Claus; Hansen, Lars Kai; Larsen, Jan
1993-01-01
Pruning and evaluation of tapped-delay neural networks for the sunspot benchmark series are addressed. It is shown that the generalization ability of the networks can be improved by pruning using the optimal brain damage method of Le Cun, Denker and Solla. A stop criterion for the pruning algorithm...
Network harness: bundles of routes in public transport networks
Berche, B.; von Ferber, C.; Holovatch, T.
2009-12-01
Public transport routes sharing the same grid of streets and tracks are often found to proceed in parallel along shorter or longer sequences of stations. Similar phenomena are observed in other networks built with space consuming links such as cables, vessels, pipes, neurons, etc. In the case of public transport networks (PTNs) this behavior may be easily worked out on the basis of sequences of stations serviced by each route. To quantify this behavior we use the recently introduced notion of network harness. It is described by the harness distribution P(r, s): the number of sequences of s consecutive stations that are serviced by r parallel routes. For certain PTNs that we have analyzed we observe that the harness distribution may be described by power laws. These power laws indicate a certain level of organization and planning which may be driven by the need to minimize the costs of infrastructure and secondly by the fact that points of interest tend to be clustered in certain locations of a city. This effect may be seen as a result of the strong interdependence of the evolutions of both the city and its PTN. To further investigate the significance of the empirical results we have studied one- and two-dimensional models of randomly placed routes modeled by different types of walks. While in one dimension an analytic treatment was successful, the two dimensional case was studied by simulations showing that the empirical results for real PTNs deviate significantly from those expected for randomly placed routes.
An Empirical Study of Synchrophasor Communication Delay in a Utility TCP/IP Network
Zhu, Kun; Chenine, Moustafa; Nordström, Lars; Holmström, Sture; Ericsson, Göran
2013-07-01
Although there is a plethora of literature dealing with Phasor Measurement Unit (PMU) communication delay, there has not been any effort made to generalize empirical delay results by identifying the distribution with the best fit. The existing studies typically assume a distribution or simply build on analogies to communication network routing delay. Specifically, this study provides insight into the characterization of the communication delay of both unprocessed PMU data and synchrophasors sorted by a Phasor Data Concentrator (PDC). The results suggest that a bi-modal distribution containing two normal distributions offers the best fit of the delay of the unprocessed data, whereas the delay profile of the sorted synchrophasors resembles a normal distribution based on these results, the possibility of evaluating the reliability of a synchrophasor application with respect to a particular choice of PDC timeout is discussed.
Generalized Projective Synchronization between Two Complex Networks with Time-Varying Coupling Delay
International Nuclear Information System (INIS)
Mei, Sun; Chang-Yan, Zeng; Li-Xin, Tian
2009-01-01
Generalized projective synchronization (GPS) between two complex networks with time-varying coupling delay is investigated. Based on the Lyapunov stability theory, a nonlinear controller and adaptive updated laws are designed. Feasibility of the proposed scheme is proven in theory. Moreover, two numerical examples are presented, using the energy resource system and Lü's system [Physica A 382 (2007) 672] as the nodes of the networks. GPS between two energy resource complex networks with time-varying coupling delay is achieved. This study can widen the application range of the generalized synchronization methods and will be instructive for the demand–supply of energy resource in some regions of China
Global asymptotic stability of Cohen-Grossberg neural networks with constant and variable delays
International Nuclear Information System (INIS)
Wu Wei; Cui Baotong; Huang Min
2007-01-01
Global asymptotic stability of Cohen-Grossberg neural networks with constant and variable delays is studied. Some sufficient conditions for the neural networks are proposed to guarantee the global asymptotic convergence by using different Lyapunov functionals. Our criteria represent an extension of the existing results in literatures. A comparison between our results and the previous results admits that our results establish a new set of stability criteria for delayed Cohen-Grossberg neural networks. Those conditions are less restrictive than those given in the earlier reference
Generalized Projective Synchronization between Two Complex Networks with Time-Varying Coupling Delay
Sun, Mei; Zeng, Chang-Yan; Tian, Li-Xin
2009-01-01
Generalized projective synchronization (GPS) between two complex networks with time-varying coupling delay is investigated. Based on the Lyapunov stability theory, a nonlinear controller and adaptive updated laws are designed. Feasibility of the proposed scheme is proven in theory. Moreover, two numerical examples are presented, using the energy resource system and Lü's system [Physica A 382 (2007) 672] as the nodes of the networks. GPS between two energy resource complex networks with time-varying coupling delay is achieved. This study can widen the application range of the generalized synchronization methods and will be instructive for the demand-supply of energy resource in some regions of China.
Ponomarenko, V I; Kulminskiy, D D; Prokhorov, M D
2017-08-01
We study the collective dynamics of oscillators in a network of identical bistable time-delayed feedback systems globally coupled via the mean field. The influence of delay and inertial properties of the mean field on the collective behavior of globally coupled oscillators is investigated. A variety of oscillation regimes in the network results from the presence of bistable states with substantially different frequencies in coupled oscillators. In the physical experiment and numerical simulation we demonstrate the existence of chimeralike states, in which some of the oscillators in the network exhibit synchronous oscillations, while all other oscillators remain asynchronous.
Sheng, Yin; Zhang, Hao; Zeng, Zhigang
2017-10-01
This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established. The proposed criteria herein enhance and generalize some published ones. Three numerical examples are presented to substantiate the validity and merits of the obtained theoretical results.
International Nuclear Information System (INIS)
Huang Zaitang; Luo Xiaoshu; Yang Qigui
2007-01-01
Many systems existing in physics, chemistry, biology, engineering and information science can be characterized by impulsive dynamics caused by abrupt jumps at certain instants during the process. These complex dynamical behaviors can be model by impulsive differential system or impulsive neural networks. This paper formulates and studies a new model of impulsive bidirectional associative memory (BAM) networks with finite distributed delays. Several fundamental issues, such as global asymptotic stability and existence and uniqueness of such BAM neural networks with impulse and distributed delays, are established
Adaptive exponential synchronization of delayed neural networks with reaction-diffusion terms
International Nuclear Information System (INIS)
Sheng Li; Yang Huizhong; Lou Xuyang
2009-01-01
This paper presents an exponential synchronization scheme for a class of neural networks with time-varying and distributed delays and reaction-diffusion terms. An adaptive synchronization controller is derived to achieve the exponential synchronization of the drive-response structure of neural networks by using the Lyapunov stability theory. At the same time, the update laws of parameters are proposed to guarantee the synchronization of delayed neural networks with all parameters unknown. It is shown that the approaches developed here extend and improve the ideas presented in recent literatures.
Globally exponential stability condition of a class of neural networks with time-varying delays
International Nuclear Information System (INIS)
Liao, T.-L.; Yan, J.-J.; Cheng, C.-J.; Hwang, C.-C.
2005-01-01
In this Letter, the globally exponential stability for a class of neural networks including Hopfield neural networks and cellular neural networks with time-varying delays is investigated. Based on the Lyapunov stability method, a novel and less conservative exponential stability condition is derived. The condition is delay-dependent and easily applied only by checking the Hamiltonian matrix with no eigenvalues on the imaginary axis instead of directly solving an algebraic Riccati equation. Furthermore, the exponential stability degree is more easily assigned than those reported in the literature. Some examples are given to demonstrate validity and excellence of the presented stability condition herein
International Nuclear Information System (INIS)
Lou Xuyang; Cui Baotong
2009-01-01
In this paper, the problem of stochastic stability for a class of delayed neural networks of neutral type with Markovian jump parameters is investigated. The jumping parameters are modelled as a continuous-time, discrete-state Markov process. A sufficient condition guaranteeing the stochastic stability of the equilibrium point is derived for the Markovian jumping delayed neural networks (MJDNNs) with neutral type. The stability criterion not only eliminates the differences between excitatory and inhibitory effects on the neural networks, but also can be conveniently checked. The sufficient condition obtained can be essentially solved in terms of linear matrix inequality. A numerical example is given to show the effectiveness of the obtained results.
DEFF Research Database (Denmark)
Moad, Sofiane; Hansen, Morten Tranberg; Jurdak, RajA
2012-01-01
The expected number of transmissions (ETX) metric represents the link quality in wireless sensor networks, which is highly variable for a specific radio and it can influence dramatically both of the delay and the energy. To adapt to these fluctuations, radio diversity has been recently introduced...... to improve the delivery rate but at the cost of increases in energy for wireless sensor networks. In this paper, we propose a scheme for radio diversity that can balance, depending on the traffic nature in the network, between minimizing the energy consumption or minimizing the end-to-end delay. The proposed...... scheme combines the benefit of two metrics, which aim separately to minimize the energy consumption, and to minimize delay when delivering packets to the end-user. We show by both analysis and simulation that our proposed scheme can adapt to the type of traffic that can occur in a network so...
Adaptive logical stochastic resonance in time-delayed synthetic genetic networks
Zhang, Lei; Zheng, Wenbin; Song, Aiguo
2018-04-01
In the paper, the concept of logical stochastic resonance is applied to implement logic operation and latch operation in time-delayed synthetic genetic networks derived from a bacteriophage λ. Clear logic operation and latch operation can be obtained when the network is tuned by modulated periodic force and time-delay. In contrast with the previous synthetic genetic networks based on logical stochastic resonance, the proposed system has two advantages. On one hand, adding modulated periodic force to the background noise can increase the length of the optimal noise plateau of obtaining desired logic response and make the system adapt to varying noise intensity. On the other hand, tuning time-delay can extend the optimal noise plateau to larger range. The result provides possible help for designing new genetic regulatory networks paradigm based on logical stochastic resonance.
Local stability and Hopf bifurcation in small-world delayed networks
International Nuclear Information System (INIS)
Li Chunguang; Chen Guanrong
2004-01-01
The notion of small-world networks, recently introduced by Watts and Strogatz, has attracted increasing interest in studying the interesting properties of complex networks. Notice that, a signal or influence travelling on a small-world network often is associated with time-delay features, which are very common in biological and physical networks. Also, the interactions within nodes in a small-world network are often nonlinear. In this paper, we consider a small-world networks model with nonlinear interactions and time delays, which was recently considered by Yang. By choosing the nonlinear interaction strength as a bifurcation parameter, we prove that Hopf bifurcation occurs. We determine the stability of the bifurcating periodic solutions and the direction of the Hopf bifurcation by applying the normal form theory and the center manifold theorem. Finally, we show a numerical example to verify the theoretical analysis
Local stability and Hopf bifurcation in small-world delayed networks
Energy Technology Data Exchange (ETDEWEB)
Li Chunguang E-mail: cgli@uestc.edu.cn; Chen Guanrong E-mail: gchen@ee.cityu.edu.hk
2004-04-01
The notion of small-world networks, recently introduced by Watts and Strogatz, has attracted increasing interest in studying the interesting properties of complex networks. Notice that, a signal or influence travelling on a small-world network often is associated with time-delay features, which are very common in biological and physical networks. Also, the interactions within nodes in a small-world network are often nonlinear. In this paper, we consider a small-world networks model with nonlinear interactions and time delays, which was recently considered by Yang. By choosing the nonlinear interaction strength as a bifurcation parameter, we prove that Hopf bifurcation occurs. We determine the stability of the bifurcating periodic solutions and the direction of the Hopf bifurcation by applying the normal form theory and the center manifold theorem. Finally, we show a numerical example to verify the theoretical analysis.
Adaptive Synchronization between Two Different Complex Networks with Time-Varying Delay Coupling
International Nuclear Information System (INIS)
Jian-Rui, Chen; Li-Cheng, Jiao; Jian-She, Wu; Xiao-Hua, Wang
2009-01-01
A new general network model for two complex networks with time-varying delay coupling is presented. Then we investigate its synchronization phenomena. The two complex networks of the model differ in dynamic nodes, the number of nodes and the coupling connections. By using adaptive controllers, a synchronization criterion is derived. Numerical examples are given to demonstrate the effectiveness of the obtained synchronization criterion. This study may widen the application range of synchronization, such as in chaotic secure communication. (general)
Robust Controller for Delays and Packet Dropout Avoidance in Solar-Power Wireless Network
Al-Azzawi, Waleed
2013-01-01
Solar Wireless Networked Control Systems (SWNCS) are a style of distributed control systems where sensors, actuators, and controllers are interconnected via a wireless communication network. This system setup has the benefit of low cost, flexibility, low weight, no wiring and simplicity of system diagnoses and maintenance. However, it also unavoidably calls some wireless network time delays and packet dropout into the design procedure. Solar lighting system offers a clean environment, therefo...
Nonlinear Dynamics and Chaos in Fractional-Order Hopfield Neural Networks with Delay
Directory of Open Access Journals (Sweden)
Xia Huang
2013-01-01
Full Text Available A fractional-order two-neuron Hopfield neural network with delay is proposed based on the classic well-known Hopfield neural networks, and further, the complex dynamical behaviors of such a network are investigated. A great variety of interesting dynamical phenomena, including single-periodic, multiple-periodic, and chaotic motions, are found to exist. The existence of chaotic attractors is verified by the bifurcation diagram and phase portraits as well.
Directory of Open Access Journals (Sweden)
Xueling Jiang
2014-01-01
Full Text Available The problem of adaptive asymptotical synchronization is discussed for the stochastic complex dynamical networks with time-delay and Markovian switching. By applying the stochastic analysis approach and the M-matrix method for stochastic complex networks, several sufficient conditions to ensure adaptive asymptotical synchronization for stochastic complex networks are derived. Through the adaptive feedback control techniques, some suitable parameters update laws are obtained. Simulation result is provided to substantiate the effectiveness and characteristics of the proposed approach.
Bach, Cathrine Carlsen; Henriksen, Tine Brink; Bossi, Rossana; Bech, Bodil Hammer; Fuglsang, Jens; Olsen, Jørn; Nohr, Ellen Aagaard
2015-01-01
In studies of perfluoroalkyl acids, the validity and comparability of measured concentrations may be affected by differences in the handling of biospecimens. We aimed to investigate whether measured plasma levels of perfluoroalkyl acids differed between blood samples subjected to delay and transportation prior to processing and samples with immediate processing and freezing. Pregnant women recruited at Aarhus University Hospital, Denmark, (n = 88) provided paired blood samples. For each pair of samples, one was immediately processed and plasma was frozen, and the other was delayed and transported as whole blood before processing and freezing of plasma (similar to the Danish National Birth Cohort). We measured 12 perfluoroalkyl acids and present results for compounds with more than 50% of samples above the lower limit of quantification. For samples taken in the winter, relative differences between the paired samples ranged between -77 and +38% for individual perfluoroalkyl acids. In most cases concentrations were lower in the delayed and transported samples, e.g. the relative difference was -29% (95% confidence interval -30; -27) for perfluorooctane sulfonate. For perfluorooctanoate there was no difference between the two setups [corresponding estimate 1% (0, 3)]. Differences were negligible in the summer for all compounds. Transport of blood samples and processing delay, similar to conditions applied in some large, population-based studies, may affect measured perfluoroalkyl acid concentrations, mainly when outdoor temperatures are low. Attention to processing conditions is needed in studies of perfluoroalkyl acid exposure in humans.
Inventory theory, mode choice and network structure in freight transport
Combes, F.; Tavasszy, L.A.
2016-01-01
In passenger transport, hub-and-spoke networks allow the transportation of small passenger flows with competitive frequencies, in a way that direct line networks cannot. Equivalently, in freight transport, it can be expected that small shipper-receiver flows of high added value commodities transit
International Nuclear Information System (INIS)
Wang, Baoying; Gong, Yubing; Xie, Huijuan; Wang, Qi
2016-01-01
Highlights: • Optimal autaptic delay enhanced synchronization transitions induced by synaptic delay in neuronal networks. • Optimal synaptic delay enhanced synchronization transitions induced by autaptic delay. • Optimal coupling strength enhanced synchronization transitions induced by autaptic or synaptic delay. - Abstract: In this paper, we numerically study the effect of electrical autaptic and synaptic delays on synchronization transitions induced by each other in Newman–Watts Hodgkin–Huxley neuronal networks. It is found that the synchronization transitions induced by synaptic delay vary with varying autaptic delay and become strongest when autaptic delay is optimal. Similarly, the synchronization transitions induced by autaptic delay vary with varying synaptic delay and become strongest at optimal synaptic delay. Also, there is optimal coupling strength by which the synchronization transitions induced by either synaptic or autaptic delay become strongest. These results show that electrical autaptic and synaptic delays can enhance synchronization transitions induced by each other in the neuronal networks. This implies that electrical autaptic and synaptic delays can cooperate with each other and more efficiently regulate the synchrony state of the neuronal networks. These findings could find potential implications for the information transmission in neural systems.
Networking for large-scale science: infrastructure, provisioning, transport and application mapping
International Nuclear Information System (INIS)
Rao, Nageswara S; Carter, Steven M; Wu Qishi; Wing, William R; Zhu Mengxia; Mezzacappa, Anthony; Veeraraghavan, Malathi; Blondin, John M
2005-01-01
Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts
Networking for large-scale science: infrastructure, provisioning, transport and application mapping
Energy Technology Data Exchange (ETDEWEB)
Rao, Nageswara S [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Carter, Steven M [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Wu Qishi [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Wing, William R [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Zhu Mengxia [Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803 (United States); Mezzacappa, Anthony [Physics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Veeraraghavan, Malathi [Department of Computer Science, University of Virginia, Charlottesville, VA 22904 (United States); Blondin, John M [Department of Physics, North Carolina State University, Raleigh, NC 27695 (United States)
2005-01-01
Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts.
[Establishment of regional active neonatal transport network].
Kong, Xiang-yong; Gao, Xin; Yin, Xiao-juan; Hong, Xiao-yang; Fang, Huan-sheng; Wang, Zi-zhen; Li, Ai-hua; Luo, Fen-ping; Feng, Zhi-chun
2010-01-01
To evaluate the clinical function and significance of establishing a regional active neonatal transport network (ANTN) in Beijing. The authors retrospectively studied intensive care and the role of ANTN system in management of critically ill neonates and compared the outcome of newborn infants transported to our NICU before and after we established standardized NICU and ANTN system (phase 1: July 2004 to June 2006 vs phase 2: July 2006 to May 2008). The number of neonatal transport significantly increased from 587 during phase 1 to 2797 during phase 2. Success rate of transport and the total cure rate in phase 2 were 97.85% and 91.99% respectively, which were significantly higher than those in phase 1 (94.36% and 88.69%, respectively, P capacity of our NICU was enlarged following the development of ANTN. There are 200 beds for level 3 infants in phase 2, but there were only 20 beds in phase 1. Significantly less patients in the phase 2 had hypothermia, acidosis and the blood glucose instability than those in phase 1 (P transported to our NICU were higher in phase 2 compared with that in phase 1, especially infants whose gestational age was below 32 weeks. The proportions of asphyxia and respiratory distress syndrome were lower in phase 2 than that in phase 1, but the total cure rates of these two diseases had no significant changes between the two phases. The most important finding was that the improvement of outcome of premature infants and those with asphyxia and aspiration syndrome was noted following the development of ANTN. Establishing regional ANTN for a tertiary hospital is very important to elevate the total level in management of critically ill newborn infants. It plays a very important role in reducing mortality and improving total outcomes of newborn infants. There are still some problems remained to solve after four years practice in order to optimize the ANTN to meet needs of the development of neonatology.
Symbolic dynamics and synchronization of coupled map networks with multiple delays
International Nuclear Information System (INIS)
Atay, Fatihcan M.; Jalan, Sarika; Jost, Juergen
2010-01-01
We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of certain symbol sequences related to the characteristics of the dynamics. In particular, we show that the resulting forbidden sequences are closely related to the time delays in the system. We present two applications to coupled map lattices, namely (1) detecting synchronization and (2) determining unknown values of the transmission delays in networks with possibly directed and weighted connections and measurement noise. The method is applicable to multi-dimensional as well as set-valued maps, and to networks with time-varying delays and connection structure.
Toward heterogeneity in feedforward network with synaptic delays based on FitzHugh-Nagumo model
Qin, Ying-Mei; Men, Cong; Zhao, Jia; Han, Chun-Xiao; Che, Yan-Qiu
2018-01-01
We focus on the role of heterogeneity on the propagation of firing patterns in feedforward network (FFN). Effects of heterogeneities both in parameters of neuronal excitability and synaptic delays are investigated systematically. Neuronal heterogeneity is found to modulate firing rates and spiking regularity by changing the excitability of the network. Synaptic delays are strongly related with desynchronized and synchronized firing patterns of the FFN, which indicate that synaptic delays may play a significant role in bridging rate coding and temporal coding. Furthermore, quasi-coherence resonance (quasi-CR) phenomenon is observed in the parameter domain of connection probability and delay-heterogeneity. All these phenomena above enable a detailed characterization of neuronal heterogeneity in FFN, which may play an indispensable role in reproducing the important properties of in vivo experiments.
STATISTIC MODEL OF DYNAMIC DELAY AND DROPOUT ON CELLULAR DATA NETWORKED CONTROL SYSTEM
Directory of Open Access Journals (Sweden)
MUHAMMAD A. MURTI
2017-07-01
Full Text Available Delay and dropout are important parameters influence overall control performance in Networked Control System (NCS. The goal of this research is to find a model of delay and dropout of data communication link in the NCS. Experiments have been done in this research to a water level control of boiler tank as part of the NCS based on internet communication network using High Speed Packet Access (HSPA cellular technology. By this experiments have been obtained closed-loop system response as well as data delay and dropout of data packets. This research contributes on modeling of the NCS which is combination of controlled plant and data communication link. Another contribution is statistical model of delay and dropout on the NCS.
Exponential synchronization of complex networks with nonidentical time-delayed dynamical nodes
International Nuclear Information System (INIS)
Cai Shuiming; He Qinbin; Hao Junjun; Liu Zengrong
2010-01-01
In this Letter, exponential synchronization of a complex network with nonidentical time-delayed dynamical nodes is considered. Two effective control schemes are proposed to drive the network to synchronize globally exponentially onto any smooth goal dynamics. By applying open-loop control to all nodes and adding some intermittent controllers to partial nodes, some simple criteria for exponential synchronization of such network are established. Meanwhile, a pinning scheme deciding which nodes need to be pinned and a simply approximate formula for estimating the least number of pinned nodes are also provided. By introducing impulsive effects to the open-loop controlled network, another synchronization scheme is developed for the network with nonidentical time-delayed dynamical nodes, and an estimate of the upper bound of impulsive intervals ensuring global exponential stability of the synchronization process is also given. Numerical simulations are presented finally to demonstrate the effectiveness of the theoretical results.
Perfluoroalkyl Acid Concentrations in Blood Samples Subjected to Transportation and Processing Delay
DEFF Research Database (Denmark)
Bach, Cathrine Carlsen; Henriksen, Tine Brink; Bossi, Rossana
2015-01-01
and transportation prior to processing and samples with immediate processing and freezing. METHODS: Pregnant women recruited at Aarhus University Hospital, Denmark, (n = 88) provided paired blood samples. For each pair of samples, one was immediately processed and plasma was frozen, and the other was delayed...... and transported as whole blood before processing and freezing of plasma (similar to the Danish National Birth Cohort). We measured 12 perfluoroalkyl acids and present results for compounds with more than 50% of samples above the lower limit of quantification. RESULTS: For samples taken in the winter, relative...... differences between the paired samples ranged between -77 and +38% for individual perfluoroalkyl acids. In most cases concentrations were lower in the delayed and transported samples, e.g. the relative difference was -29% (95% confidence interval -30; -27) for perfluorooctane sulfonate. For perfluorooctanoate...
Robust convergence of Cohen-Grossberg neural networks with time-varying delays
International Nuclear Information System (INIS)
Xiong Wenjun; Ma Deyi; Liang Jinling
2009-01-01
In this paper, robust convergence is studied for the Cohen-Grossberg neural networks (CGNNs) with time-varying delays. By applying the differential inequality and the Lyapunov method, some delay-independent conditions are derived ensuring the robust CGNNs to converge, globally, uniformly and exponentially, to a ball in the state space with a pre-specified convergence rate. Finally, the effectiveness of our results are verified by an illustrative example.
On global stability criterion for neural networks with discrete and distributed delays
International Nuclear Information System (INIS)
Park, Ju H.
2006-01-01
Based on the Lyapunov functional stability analysis for differential equations and the linear matrix inequality (LMI) optimization approach, a new delay-dependent criterion for neural networks with discrete and distributed delays is derived to guarantee global asymptotic stability. The criterion is expressed in terms of LMIs, which can be solved easily by various convex optimization algorithms. Some numerical examples are given to show the effectiveness of proposed method
Improved result on stability analysis of discrete stochastic neural networks with time delay
International Nuclear Information System (INIS)
Wu Zhengguang; Su Hongye; Chu Jian; Zhou Wuneng
2009-01-01
This Letter investigates the problem of exponential stability for discrete stochastic time-delay neural networks. By defining a novel Lyapunov functional, an improved delay-dependent exponential stability criterion is established in terms of linear matrix inequality (LMI) approach. Meanwhile, the computational complexity of the newly established stability condition is reduced because less variables are involved. Numerical example is given to illustrate the effectiveness and the benefits of the proposed method.
Global robust asymptotical stability of multi-delayed interval neural networks: an LMI approach
International Nuclear Information System (INIS)
Li Chuandong; Liao Xiaofeng; Zhang Rong
2004-01-01
Based on the Lyapunov-Krasovskii stability theory for functional differential equations and the linear matrix inequality (LMI) technique, some delay-dependent criteria for interval neural networks (IDNN) with multiple time-varying delays are derived to guarantee global robust asymptotic stability. The main results are generalizations of some recent results reported in the literature. Numerical example is also given to show the effectiveness of our results
Stability and bifurcation of a discrete BAM neural network model with delays
International Nuclear Information System (INIS)
Zheng Baodong; Zhang Yang; Zhang Chunrui
2008-01-01
A map modelling a discrete bidirectional associative memory neural network with delays is investigated. Its dynamics is studied in terms of local analysis and Hopf bifurcation analysis. By analyzing the associated characteristic equation, its linear stability is investigated and Hopf bifurcations are demonstrated. It is found that there exist Hopf bifurcations when the delay passes a sequence of critical values. Numerical simulation is performed to verify the analytical results
International Nuclear Information System (INIS)
Park, Ju H.; Lee, S.M.; Kwon, O.M.
2009-01-01
For bidirectional associate memory neural networks with time-varying delays, the problems of determining the exponential stability and estimating the exponential convergence rate are investigated by employing the Lyapunov functional method and linear matrix inequality (LMI) technique. A novel criterion for the stability, which give information on the delay-dependent property, is derived. A numerical example is given to demonstrate the effectiveness of the obtained results.
Iannicca, Dennis; Hylton, Alan; Ishac, Joseph
2012-01-01
Delay-Tolerant Networking (DTN) is an active area of research in the space communications community. DTN uses a standard layered approach with the Bundle Protocol operating on top of transport layer protocols known as convergence layers that actually transmit the data between nodes. Several different common transport layer protocols have been implemented as convergence layers in DTN implementations including User Datagram Protocol (UDP), Transmission Control Protocol (TCP), and Licklider Transmission Protocol (LTP). The purpose of this paper is to evaluate several stand-alone implementations of negative-acknowledgment based transport layer protocols to determine how they perform in a variety of different link conditions. The transport protocols chosen for this evaluation include Consultative Committee for Space Data Systems (CCSDS) File Delivery Protocol (CFDP), Licklider Transmission Protocol (LTP), NACK-Oriented Reliable Multicast (NORM), and Saratoga. The test parameters that the protocols were subjected to are characteristic of common communications links ranging from terrestrial to cis-lunar and apply different levels of delay, line rate, and error.
Noise transmission and delay-induced stochasticoscillations in biochemical network motifs
Institute of Scientific and Technical Information of China (English)
Liu Sheng-Jun; Wang Qi; Liu Bo; Yan Shi-Wei; Fumihiko Sakata
2011-01-01
With the aid of stochastic delayed-feedback differential equations,we derive an analytic expression for the power spectra of reacting molecules included in a generic biological network motif that is incorporated with a feedback mechanism and time delays in gene regulation.We systematically analyse the effects of time delays,the feedback mechanism,and biological stochasticity on the power spectra.It has been clarified that the time delays together with the feedback mechanism can induce stochastic oscillations at the molecular level and invalidate the noise addition rule for a modular description of the noise propagator.Delay-induced stochastic resonance can be expected,which is related to the stability loss of the reaction systems and Hopf bifurcation occurring for solutions of the corresponding deterministic reaction equations.Through the analysis of the power spectrum,a new approach is proposed to estimate the oscillation period.
Noise transmission and delay-induced stochastic oscillations in biochemical network motifs
International Nuclear Information System (INIS)
Liu Sheng-Jun; Wang Qi; Liu Bo; Yan Shi-Wei; Sakata Fumihiko
2011-01-01
With the aid of stochastic delayed-feedback differential equations, we derive an analytic expression for the power spectra of reacting molecules included in a generic biological network motif that is incorporated with a feedback mechanism and time delays in gene regulation. We systematically analyse the effects of time delays, the feedback mechanism, and biological stochasticity on the power spectra. It has been clarified that the time delays together with the feedback mechanism can induce stochastic oscillations at the molecular level and invalidate the noise addition rule for a modular description of the noise propagator. Delay-induced stochastic resonance can be expected, which is related to the stability loss of the reaction systems and Hopf bifurcation occurring for solutions of the corresponding deterministic reaction equations. Through the analysis of the power spectrum, a new approach is proposed to estimate the oscillation period. (interdisciplinary physics and related areas of science and technology)
Energy Technology Data Exchange (ETDEWEB)
Cai Shuiming, E-mail: caishuiming2008@yahoo.com.c [Department of Mathematics, Shanghai University, Shanghai 200444 (China); Institute of System Biology, Shanghai University, Shanghai 200444 (China); Hao Junjun [Institute of System Biology, Shanghai University, Shanghai 200444 (China); He, Qinbin [Department of Mathematics, Taizhou University, Linhai 317000 (China); Institute of System Biology, Shanghai University, Shanghai 200444 (China); Liu Zengrong, E-mail: zrongliu@126.co [Department of Mathematics, Shanghai University, Shanghai 200444 (China) and Institute of System Biology, Shanghai University, Shanghai 200444 (China)
2011-05-09
The problem of synchronization for a class of complex delayed dynamical networks via pinning periodically intermittent control is considered in this Letter. Some novel and useful exponential synchronization criteria are obtained by utilizing the methods which are different from the techniques employed in the existing works, and the derived results are less conservative. Especially, the traditional assumptions on control width and time delays are released in our results. Moreover, a pinning scheme deciding what nodes should be chosen as pinned candidates and how many nodes are needed to be pinned for a fixed coupling strength is provided. A Barabasi-Albert network example is finally given to illustrate the effectiveness of the theoretical results. - Highlights: Pinning control problem of complex networks via intermittent control is investigated. The traditional assumptions on control width and time delays are removed. A scheme deciding what nodes should be chosen as pinned candidates is proposed. A scheme deciding how many nodes are needed to be pinned is provided.
A Novel Buffer Management Architecture for Epidemic Routing in Delay Tolerant Networks (DTNs)
Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem
2010-01-01
Delay tolerant networks (DTNs) are wireless networks in which an end-to-end path for a given node pair can never exist for an extended period. It has been reported as a viable approach in launching multiple message replicas in order to increase message delivery ratio and reduce message delivery delay. This advantage, nonetheless, is at the expense of taking more buffer space at each node. The combination of custody and replication entails high buffer and bandwidth overhead. This paper investigates a new buffer management architecture for epidemic routing in DTNs, which helps each node to make a decision on which message should be forwarded or dropped. The proposed buffer management architecture is characterized by a suite of novel functional modules, including Summary Vector Exchange Module (SVEM), Networks State Estimation Module (NSEM), and Utility Calculation Module (UCM). Extensive simulation results show that the proposed buffer management architecture can achieve superb performance against its counterparts in terms of delivery ratio and delivery delay.
Robust stability of interval bidirectional associative memory neural network with time delays.
Liao, Xiaofeng; Wong, Kwok-wo
2004-04-01
In this paper, the conventional bidirectional associative memory (BAM) neural network with signal transmission delay is intervalized in order to study the bounded effect of deviations in network parameters and external perturbations. The resultant model is referred to as a novel interval dynamic BAM (IDBAM) model. By combining a number of different Lyapunov functionals with the Razumikhin technique, some sufficient conditions for the existence of unique equilibrium and robust stability are derived. These results are fairly general and can be verified easily. To go further, we extend our investigation to the time-varying delay case. Some robust stability criteria for BAM with perturbations of time-varying delays are derived. Besides, our approach for the analysis allows us to consider several different types of activation functions, including piecewise linear sigmoids with bounded activations as well as the usual C1-smooth sigmoids. We believe that the results obtained have leading significance in the design and application of BAM neural networks.
Robust stability for stochastic bidirectional associative memory neural networks with time delays
Shu, H. S.; Lv, Z. W.; Wei, G. L.
2008-02-01
In this paper, the asymptotic stability is considered for a class of uncertain stochastic bidirectional associative memory neural networks with time delays and parameter uncertainties. The delays are time-invariant and the uncertainties are norm-bounded that enter into all network parameters. The aim of this paper is to establish easily verifiable conditions under which the delayed neural network is robustly asymptotically stable in the mean square for all admissible parameter uncertainties. By employing a Lyapunov-Krasovskii functional and conducting the stochastic analysis, a linear matrix inequality matrix inequality (LMI) approach is developed to derive the stability criteria. The proposed criteria can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed criteria.
A Novel Buffer Management Architecture for Epidemic Routing in Delay Tolerant Networks (DTNs)
Elwhishi, Ahmed
2010-11-17
Delay tolerant networks (DTNs) are wireless networks in which an end-to-end path for a given node pair can never exist for an extended period. It has been reported as a viable approach in launching multiple message replicas in order to increase message delivery ratio and reduce message delivery delay. This advantage, nonetheless, is at the expense of taking more buffer space at each node. The combination of custody and replication entails high buffer and bandwidth overhead. This paper investigates a new buffer management architecture for epidemic routing in DTNs, which helps each node to make a decision on which message should be forwarded or dropped. The proposed buffer management architecture is characterized by a suite of novel functional modules, including Summary Vector Exchange Module (SVEM), Networks State Estimation Module (NSEM), and Utility Calculation Module (UCM). Extensive simulation results show that the proposed buffer management architecture can achieve superb performance against its counterparts in terms of delivery ratio and delivery delay.
FUNDAMENTAL MATRIX OF LINEAR CONTINUOUS SYSTEM IN THE PROBLEM OF ESTIMATING ITS TRANSPORT DELAY
Directory of Open Access Journals (Sweden)
N. A. Dudarenko
2014-09-01
Full Text Available The paper deals with the problem of quantitative estimation for transport delay of linear continuous systems. The main result is received by means of fundamental matrix of linear differential equations solutions specified in the normal Cauchy form for the cases of SISO and MIMO systems. Fundamental matrix has the dual property. It means that the weight function of the system can be formed as a free motion of systems. Last one is generated by the vector of initial system conditions, which coincides with the matrix input of the system being researched. Thus, using the properties of the system- solving for fundamental matrix has given the possibility to solve the problem of estimating transport linear continuous system delay without the use of derivation procedure in hardware environment and without formation of exogenous Dirac delta function. The paper is illustrated by examples. The obtained results make it possible to solve the problem of modeling the pure delay links using consecutive chain of aperiodic links of the first order with the equal time constants. Modeling results have proved the correctness of obtained computations. Knowledge of transport delay can be used when configuring multi- component technological complexes and in the diagnosis of their possible functional degeneration.
International Nuclear Information System (INIS)
Gong Yubing; Xie Yanhang; Lin Xiu; Hao Yinghang; Ma Xiaoguang
2010-01-01
Research highlights: → Chemical delay and chemical coupling can tame chaotic bursting. → Chemical delay-induced transitions from bursting synchronization to intermittent multiple spiking synchronizations. → Chemical coupling-induced different types of delay-dependent firing transitions. - Abstract: Chemical synaptic connections are more common than electric ones in neurons, and information transmission delay is especially significant for the synapses of chemical type. In this paper, we report a phenomenon of ordering spatiotemporal chaos and synchronization transitions by the delays and coupling through chemical synapses of modified Hodgkin-Huxley (MHH) neurons on scale-free networks. As the delay τ is increased, the neurons exhibit transitions from bursting synchronization (BS) to intermittent multiple spiking synchronizations (SS). As the coupling g syn is increased, the neurons exhibit different types of firing transitions, depending on the values of τ. For a smaller τ, there are transitions from spatiotemporal chaotic bursting (SCB) to BS or SS; while for a larger τ, there are transitions from SCB to intermittent multiple SS. These findings show that the delays and coupling through chemical synapses can tame the chaotic firings and repeatedly enhance the firing synchronization of neurons, and hence could play important roles in the firing activity of the neurons on scale-free networks.
Advances in dynamic network modeling in complex transportation systems
Ukkusuri, Satish V
2013-01-01
This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.
An Artificial Neural Network Controller for Intelligent Transportation Systems Applications
1996-01-01
An Autonomous Intelligent Cruise Control (AICC) has been designed using a feedforward artificial neural network, as an example for utilizing artificial neural networks for nonlinear control problems arising in intelligent transportation systems appli...
Modelling Compensation Policy for Quality and Delay Deterioration in Rail Transport
Directory of Open Access Journals (Sweden)
Tatiana Molkova
2013-06-01
Full Text Available The contribution deals with the customers’ claims on provided services during train delay in personal railway transport. There is comparison between the situation in the Czech Republic (Brno main station and Austria (Wien Westbahnhof in the contribution. Development of the compensation policy cannot be based only on customer requirements. If the railway company focuses on providing compensation for delays, it must follow its economic balance. However, as the passengers' opinion survey showed, the negative impact of delays can be reduced by providing adequate information to passengers. Based on the passengers' opinion survey, it is necessary to consider the Regulation 1371/2007/ES as the minimum of the possible and on the basis of this reasoning to compile a compensation policy. The costs associated with compensation for the delay should be divided according to the causes of the delay among the individual culprits, so that railway undertakings bear the responsibility even for delays arising from reasons that are beyond the control of the railway undertaking itself.
Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions
Bick, Christian; Sebek, Michael; Kiss, István Z.
2017-10-01
We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.
Role of Delays in Shaping Spatiotemporal Dynamics of Neuronal Activity in Large Networks
International Nuclear Information System (INIS)
Roxin, Alex; Brunel, Nicolas; Hansel, David
2005-01-01
We study the effect of delays on the dynamics of large networks of neurons. We show that delays give rise to a wealth of bifurcations and to a rich phase diagram, which includes oscillatory bumps, traveling waves, lurching waves, standing waves arising via a period-doubling bifurcation, aperiodic regimes, and regimes of multistability. We study the existence and the stability of the various dynamical patterns analytically and numerically in a simplified rate model as a function of the interaction parameters. The results derived in that framework allow us to understand the origin of the diversity of dynamical states observed in large networks of spiking neurons
Analysis on Passivity for Uncertain Neural Networks with Time-Varying Delays
Directory of Open Access Journals (Sweden)
O. M. Kwon
2014-01-01
Full Text Available The problem of passivity analysis for neural networks with time-varying delays and parameter uncertainties is considered. By the consideration of newly constructed Lyapunov-Krasovskii functionals, improved sufficient conditions to guarantee the passivity of the concerned networks are proposed with the framework of linear matrix inequalities (LMIs, which can be solved easily by various efficient convex optimization algorithms. The enhancement of the feasible region of the proposed criteria is shown via two numerical examples by the comparison of maximum allowable delay bounds.
Stability and attractive basins of multiple equilibria in delayed two-neuron networks
International Nuclear Information System (INIS)
Huang Yu-Jiao; Zhang Hua-Guang; Wang Zhan-Shan
2012-01-01
Multiple stability for two-dimensional delayed recurrent neural networks with piecewise linear activation functions of 2r (r ≥ 1) corner points is studied. Sufficient conditions are established for checking the existence of (2r + 1) 2 equilibria in delayed recurrent neural networks. Under these conditions, (r + 1) 2 equilibria are locally exponentially stable, and (2r + 1) 2 — (r + 1) 2 — r 2 equilibria are unstable. Attractive basins of stable equilibria are estimated, which are larger than invariant sets derived by decomposing state space. One example is provided to illustrate the effectiveness of our results. (general)
Globally exponential stability of neural network with constant and variable delays
International Nuclear Information System (INIS)
Zhao Weirui; Zhang Huanshui
2006-01-01
This Letter presents new sufficient conditions of globally exponential stability of neural networks with delays. We show that these results generalize recently published globally exponential stability results. In particular, several different globally exponential stability conditions in the literatures which were proved using different Lyapunov functionals are generalized and unified by using the same Lyapunov functional and the technique of inequality of integral. A comparison between our results and the previous results admits that our results establish a new set of stability criteria for delayed neural networks. Those conditions are less restrictive than those given in the earlier references
Global existence of periodic solutions on a simplified BAM neural network model with delays
International Nuclear Information System (INIS)
Zheng Baodong; Zhang Yazhuo; Zhang Chunrui
2008-01-01
A simplified n-dimensional BAM neural network model with delays is considered. Some results of Hopf bifurcations occurring at the zero equilibrium as the delay increases are exhibited. Global existence of periodic solutions are established using a global Hopf bifurcation result of Wu [Wu J. Symmetric functional-differential equations and neural networks with memory. Trans Am Math Soc 1998;350:4799-838], and a Bendixson criterion for higher dimensional ordinary differential equations due to Li and Muldowney [Li MY, Muldowney J. On Bendixson's criterion. J Differ Equations 1994;106:27-39]. Finally, computer simulations are performed to illustrate the analytical results found
Arik, Sabri
2005-05-01
This paper presents a sufficient condition for the existence, uniqueness and global asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with distributed time delays. The results impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all continuous nonmonotonic neuron activation functions. It is shown that in some special cases of the results, the stability criteria can be easily checked. Some examples are also given to compare the results with the previous results derived in the literature.
International Nuclear Information System (INIS)
Liao Xiaofeng; Wong, K.-W.; Yang Shizhong
2003-01-01
In this Letter, the characteristics of the convergence dynamics of hybrid bidirectional associative memory neural networks with distributed transmission delays are studied. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the Lyapunov functionals are constructed and the generalized Halanay-type inequalities are employed to derive the delay-independent sufficient conditions under which the networks converge exponentially to the equilibria associated with temporally uniform external inputs. Some examples are given to illustrate the correctness of our results
Robust stability for uncertain stochastic fuzzy BAM neural networks with time-varying delays
Syed Ali, M.; Balasubramaniam, P.
2008-07-01
In this Letter, by utilizing the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, we analyze the global asymptotic stability of uncertain stochastic fuzzy Bidirectional Associative Memory (BAM) neural networks with time-varying delays which are represented by the Takagi-Sugeno (TS) fuzzy models. A new class of uncertain stochastic fuzzy BAM neural networks with time varying delays has been studied and sufficient conditions have been derived to obtain conservative result in stochastic settings. The developed results are more general than those reported in the earlier literatures. In addition, the numerical examples are provided to illustrate the applicability of the result using LMI toolbox in MATLAB.
Robust stability for uncertain stochastic fuzzy BAM neural networks with time-varying delays
International Nuclear Information System (INIS)
Syed Ali, M.; Balasubramaniam, P.
2008-01-01
In this Letter, by utilizing the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, we analyze the global asymptotic stability of uncertain stochastic fuzzy Bidirectional Associative Memory (BAM) neural networks with time-varying delays which are represented by the Takagi-Sugeno (TS) fuzzy models. A new class of uncertain stochastic fuzzy BAM neural networks with time varying delays has been studied and sufficient conditions have been derived to obtain conservative result in stochastic settings. The developed results are more general than those reported in the earlier literatures. In addition, the numerical examples are provided to illustrate the applicability of the result using LMI toolbox in MATLAB
International Nuclear Information System (INIS)
Senan, Sibel; Arik, Sabri
2009-01-01
This paper presents some new sufficient conditions for the global robust asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with multiple time delays. The results we obtain impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all bounded continuous non-monotonic neuron activation functions. We also give some numerical examples to demonstrate the applicability and effectiveness of our results, and compare the results with the previous robust stability results derived in the literature.
Some criteria for robust stability of Cohen-Grossberg neural networks with delays
International Nuclear Information System (INIS)
Xiong Weili; Xu Baoguo
2008-01-01
This paper considers the problem of robust stability of Cohen-Grossberg neural networks with time-varying delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, some sufficient conditions are derived to ensure the global robust convergence of the equilibrium point. The proposed LMI conditions can be checked easily by recently developed algorithms solving LMIs. Comparisons between our results and previous results admits our results establish a new set of stability criteria for delayed Cohen-Grossberg neural networks. Numerical examples are given to illustrate the effectiveness of our results
Energy Technology Data Exchange (ETDEWEB)
Xavier, Clarice; Sobreira, Ana Celia [REM Industria e Comercio Ltda., Sao Paulo, SP (Brazil)
2011-10-26
Some Class 7 materials can only be transported by ship, making that load and unload activities can be done in a port. In the Brazil, the port of Santos posses the most volume of cargo manipulation, and cargoes which contain radioactive material are always present with all manipulation requisites according to applicable regulations. The transport and manipulation operations of radioactive material are performed in accordance with national and international requisites but, some individuals posses yet a high risk perception according to our experience, involving members of Brazilian port authorities, the Navy and cargoes handlers at the ports. So, exist yet a high quantity of refuses and delays during the transport by ship. Therefore, a communication strategy was developed and applied, to inform the risk perception, supplying information on the very principles of ionizing radiation, legislation and uses of radiation, and so, diminishing the quantity of refuses and delays. From that initial communication strategy on, it becomes evident the necessity of training and conscience making a movement for the problem of refuses and delays be diminished
Delay Bounded Multi-Source Multicast in Software-Defined Networking
Directory of Open Access Journals (Sweden)
Thabo Semong
2018-01-01
Full Text Available Software-Defined Networking (SDN is the next generation network architecture with exciting application prospects. The control function in SDN is decoupled from the data forwarding plane, hence it provides a new centralized architecture with flexible network resource management. Although SDN is attracting much attention from both industry and research, its advantage over the traditional networks has not been fully utilized. Multicast is designed to deliver content to multiple destinations. The current traffic engineering in SDN focuses mainly on unicast, however, multicast can effectively reduce network resource consumption by serving multiple clients. This paper studies a novel delay-bounded multi-source multicast SDN problem, in which among the set of potential sources, we select a source to build the multicast-tree, under the constraint that the transmission delay for every destination is bounded. This problem is more difficult than the traditional Steiner minimum tree (SMT problem, since it needs to find a source from the set of all potential sources. We model the problem as a mixed-integer linear programming (MILP and prove its NP-Hardness. To solve the problem, a delay bounded multi-source (DBMS scheme is proposed, which includes a DBMS algorithm to build a minimum delay cost DBMS-Forest. Through a MATLAB experiment, we demonstrate that DBMS is significantly more efficient and outperforms other existing algorithms in the literature.
Emergence of amplitude death scenario in a network of oscillators under repulsive delay interaction
International Nuclear Information System (INIS)
Bera, Bidesh K.; Hens, Chittaranjan; Ghosh, Dibakar
2016-01-01
Highlights: • Amplitude death is observed using repulsive mean coupling. • Analytical conditions for amplitude death are derived. • Effect of asymmetry time delay coupling for death is discussed. - Abstract: We report the existence of amplitude death in a network of identical oscillators under repulsive mean coupling. Amplitude death appears in a globally coupled network of identical oscillators with instantaneous repulsive mean coupling only when the number of oscillators is more than two. We further investigate that, amplitude death may emerge even in two coupled oscillators as well as network of oscillators if we introduce delay time in the repulsive mean coupling. We have analytically derived the region of amplitude death island and find out how strength of delay controls the death regime in two coupled or a large network of coupled oscillators. We have verified our results on network of delayed Mackey–Glass systems where parameters are set in hyperchaotic regime. We have also tested our coupling approach in two paradigmatic limit cycle oscillators: Stuart–Landau and Van der Pol oscillators.
Emergence of amplitude death scenario in a network of oscillators under repulsive delay interaction
Energy Technology Data Exchange (ETDEWEB)
Bera, Bidesh K., E-mail: bideshbera18@gmail.com [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India); Hens, Chittaranjan, E-mail: chittaranjanhens@gmail.com [Department of Mathematics, Bar-Ilan University, Ramat Gan 52900 (Israel); Ghosh, Dibakar, E-mail: dibakar@isical.ac.in [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India)
2016-07-15
Highlights: • Amplitude death is observed using repulsive mean coupling. • Analytical conditions for amplitude death are derived. • Effect of asymmetry time delay coupling for death is discussed. - Abstract: We report the existence of amplitude death in a network of identical oscillators under repulsive mean coupling. Amplitude death appears in a globally coupled network of identical oscillators with instantaneous repulsive mean coupling only when the number of oscillators is more than two. We further investigate that, amplitude death may emerge even in two coupled oscillators as well as network of oscillators if we introduce delay time in the repulsive mean coupling. We have analytically derived the region of amplitude death island and find out how strength of delay controls the death regime in two coupled or a large network of coupled oscillators. We have verified our results on network of delayed Mackey–Glass systems where parameters are set in hyperchaotic regime. We have also tested our coupling approach in two paradigmatic limit cycle oscillators: Stuart–Landau and Van der Pol oscillators.
Sun, Xiaojuan; Perc, Matjaž; Kurths, Jürgen
2017-05-01
In this paper, we study effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks. Our focus is on the impact of two parameters, namely the time delay τ and the probability of partial time delay pdelay, whereby the latter determines the probability with which a connection between two neurons is delayed. Our research reveals that partial time delays significantly affect phase synchronization in this system. In particular, partial time delays can either enhance or decrease phase synchronization and induce synchronization transitions with changes in the mean firing rate of neurons, as well as induce switching between synchronized neurons with period-1 firing to synchronized neurons with period-2 firing. Moreover, in comparison to a neuronal network where all connections are delayed, we show that small partial time delay probabilities have especially different influences on phase synchronization of neuronal networks.
Pinning synchronization of delayed complex dynamical networks with nonlinear coupling
Cheng, Ranran; Peng, Mingshu; Yu, Weibin
2014-11-01
In this paper, we find that complex networks with the Watts-Strogatz or scale-free BA random topological architecture can be synchronized more easily by pin-controlling fewer nodes than regular systems. Theoretical analysis is included by means of Lyapunov functions and linear matrix inequalities (LMI) to make all nodes reach complete synchronization. Numerical examples are also provided to illustrate the importance of our theoretical analysis, which implies that there exists a gap between the theoretical prediction and numerical results about the minimum number of pinning controlled nodes.
Qualitative analysis and control of complex neural networks with delays
Wang, Zhanshan; Zheng, Chengde
2016-01-01
This book focuses on the stability of the dynamical neural system, synchronization of the coupling neural system and their applications in automation control and electrical engineering. The redefined concept of stability, synchronization and consensus are adopted to provide a better explanation of the complex neural network. Researchers in the fields of dynamical systems, computer science, electrical engineering and mathematics will benefit from the discussions on complex systems. The book will also help readers to better understand the theory behind the control technique and its design.
International Nuclear Information System (INIS)
Destexhe, A.
1994-01-01
Various types of spatiotemporal behavior are described for two-dimensional networks of excitatory and inhibitory neurons with time delayed interactions. It is described how the network behaves as several structural parameters are varied, such as the number of neurons, the connectivity, and the values of synaptic weights. A transition from spatially uniform oscillations to spatiotemporal chaos via intermittentlike behavior is observed. The properties of spatiotemporally chaotic solutions are investigated by evaluating the largest positive Lyapunov exponent and the loss of correlation with distance. Finally, properties of information transport are evaluated during uniform oscillations and spatiotemporal chaos. It is shown that the diffusion coefficient increases significantly in the spatiotemporal phase similar to the increase of transport coefficients at the onset of fluid turbulence. It is proposed that such a property should be seen in other media, such as chemical turbulence or networks of oscillators. The possibility of measuring information transport from appropriate experiments is also discussed
Counterpart synchronization of duplex networks with delayed nodes and noise perturbation
International Nuclear Information System (INIS)
Wei, Xiang; Wu, Xiaoqun; Lu, Jun-an; Zhao, Junchan
2015-01-01
In the real world, many complex systems are represented not by single networks but rather by sets of interdependent ones. In these specific networks, nodes in one network mutually interact with nodes in other networks. This paper focuses on a simple representative case of two-layer networks (the so-called duplex networks) with unidirectional inter-layer couplings. That is, each node in one network depends on a counterpart in the other network. Accordingly, the former network is called the response layer and the latter network is the drive layer. Specifically, synchronization between each node in the drive layer and its counterpart in the response layer (counterpart synchronization (CS)) in these kinds of duplex networks with delayed nodes and noise perturbation is investigated. Based on the LaSalle-type invariance principle, a control technique is proposed and a sufficient condition is developed for realizing CS of duplex networks. Furthermore, two corollaries are derived as special cases. In addition, node dynamics within each layer can be varied and topologies of the two layers are not necessarily identical. Therefore, the proposed synchronization method can be applied to a wide range of multiplex networks. Numerical examples are provided to illustrate the feasibility and effectiveness of the results. (paper)
Directory of Open Access Journals (Sweden)
Jing Wang
2012-01-01
Full Text Available The stabilization problem of a wireless networked control system is considered in this paper. Both time delay and packet loss exist simultaneously in the wireless network. The system is modeled as an asynchronous dynamic system (ADS with unstable subsystems. A sufficient condition for the system to be stable is presented. A numerical example is given to demonstrate the effectiveness of the proposed approach.
International Nuclear Information System (INIS)
Huang Zaitang; Yang Qigui
2009-01-01
The paper considers the problems of existence of quadratic mean almost periodic and global exponential stability for stochastic cellular neural networks with delays. By employing the Holder's inequality and fixed points principle, we present some new criteria ensuring existence and uniqueness of a quadratic mean almost periodic and global exponential stability. These criteria are important in signal processing and the design of networks. Moreover, these criteria are also applied in others stochastic biological neural systems.
Dynamic analysis of stochastic bidirectional associative memory neural networks with delays
International Nuclear Information System (INIS)
Zhao Hongyong; Ding Nan
2007-01-01
In this paper, stochastic bidirectional associative memory neural networks model with delays is considered. By constructing Lyapunov functionals, and using stochastic analysis method and inequality technique, we give some sufficient criteria ensuring almost sure exponential stability, pth exponential stability and mean value exponential stability. The obtained criteria can be used as theoretic guidance to stabilize neural networks in practical applications when stochastic noise is taken into consideration
Passivity analysis for uncertain BAM neural networks with time delays and reaction-diffusions
Zhou, Jianping; Xu, Shengyuan; Shen, Hao; Zhang, Baoyong
2013-08-01
This article deals with the problem of passivity analysis for delayed reaction-diffusion bidirectional associative memory (BAM) neural networks with weight uncertainties. By using a new integral inequality, we first present a passivity condition for the nominal networks, and then extend the result to the case with linear fractional weight uncertainties. The proposed conditions are expressed in terms of linear matrix inequalities, and thus can be checked easily. Examples are provided to demonstrate the effectiveness of the proposed results.
International Nuclear Information System (INIS)
Cui Baotong; Lou Xuyang
2009-01-01
In this paper, a new method to synchronize two identical chaotic recurrent neural networks is proposed. Using the drive-response concept, a nonlinear feedback control law is derived to achieve the state synchronization of the two identical chaotic neural networks. Furthermore, based on the Lyapunov method, a delay independent sufficient synchronization condition in terms of linear matrix inequality (LMI) is obtained. A numerical example with graphical illustrations is given to illuminate the presented synchronization scheme
Symmetry, Hopf bifurcation, and the emergence of cluster solutions in time delayed neural networks.
Wang, Zhen; Campbell, Sue Ann
2017-11-01
We consider the networks of N identical oscillators with time delayed, global circulant coupling, modeled by a system of delay differential equations with Z N symmetry. We first study the existence of Hopf bifurcations induced by the coupling time delay and then use symmetric Hopf bifurcation theory to determine how these bifurcations lead to different patterns of symmetric cluster oscillations. We apply our results to a case study: a network of FitzHugh-Nagumo neurons with diffusive coupling. For this model, we derive the asymptotic stability, global asymptotic stability, absolute instability, and stability switches of the equilibrium point in the plane of coupling time delay (τ) and excitability parameter (a). We investigate the patterns of cluster oscillations induced by the time delay and determine the direction and stability of the bifurcating periodic orbits by employing the multiple timescales method and normal form theory. We find that in the region where stability switching occurs, the dynamics of the system can be switched from the equilibrium point to any symmetric cluster oscillation, and back to equilibrium point as the time delay is increased.
Symmetry, Hopf bifurcation, and the emergence of cluster solutions in time delayed neural networks
Wang, Zhen; Campbell, Sue Ann
2017-11-01
We consider the networks of N identical oscillators with time delayed, global circulant coupling, modeled by a system of delay differential equations with ZN symmetry. We first study the existence of Hopf bifurcations induced by the coupling time delay and then use symmetric Hopf bifurcation theory to determine how these bifurcations lead to different patterns of symmetric cluster oscillations. We apply our results to a case study: a network of FitzHugh-Nagumo neurons with diffusive coupling. For this model, we derive the asymptotic stability, global asymptotic stability, absolute instability, and stability switches of the equilibrium point in the plane of coupling time delay (τ) and excitability parameter (a). We investigate the patterns of cluster oscillations induced by the time delay and determine the direction and stability of the bifurcating periodic orbits by employing the multiple timescales method and normal form theory. We find that in the region where stability switching occurs, the dynamics of the system can be switched from the equilibrium point to any symmetric cluster oscillation, and back to equilibrium point as the time delay is increased.
International Nuclear Information System (INIS)
Karthik Raja, U; Leelamani, A; Raja, R; Samidurai, R
2013-01-01
In this paper, the exponential stability for a class of stochastic neural networks with time-varying delays and impulsive effects is considered. By constructing suitable Lyapunov functionals and by using the linear matrix inequality optimization approach, we obtain sufficient delay-dependent criteria to ensure the exponential stability of stochastic neural networks with time-varying delays and impulses. Two numerical examples with simulation results are provided to illustrate the effectiveness of the obtained results over those already existing in the literature. (paper)
Zhang, Chuan; Wang, Xingyuan; Luo, Chao; Li, Junqiu; Wang, Chunpeng
2018-03-01
In this paper, we focus on the robust outer synchronization problem between two nonlinear complex networks with parametric disturbances and mixed time-varying delays. Firstly, a general complex network model is proposed. Besides the nonlinear couplings, the network model in this paper can possess parametric disturbances, internal time-varying delay, discrete time-varying delay and distributed time-varying delay. Then, according to the robust control strategy, linear matrix inequality and Lyapunov stability theory, several outer synchronization protocols are strictly derived. Simple linear matrix controllers are designed to driver the response network synchronize to the drive network. Additionally, our results can be applied on the complex networks without parametric disturbances. Finally, by utilizing the delayed Lorenz chaotic system as the dynamics of all nodes, simulation examples are given to demonstrate the effectiveness of our theoretical results.
Prediction of biodiesel ignition delay in a diesel engine using artificial neural networks
International Nuclear Information System (INIS)
Piloto-Rodríguez, Ramón; Sánchez-Borroto, Yisel
2017-01-01
Ignition delay is one of the most important parameters of the combustion process and have a strong influence in exhaust emissions and engines performance. In the present work, the results of the mathematical modeling of ignition delay through artificial neural networks are shown. The modeling starts from input values that cover thermodynamic variables, engines parameters and biodiesel properties. The model obtained is only useful for biodiesel samples and several neural network algorithms were applied in order to predict the ignition delay. From its correlation coefficient, prediction capability and lowest absolute error, the best model was selected. Among other network’s input parameters, the cetane number was taken into account, also previously predicted by the use of ANN. (author)
Dynamics of the congestion control model in underwater wireless sensor networks with time delay
International Nuclear Information System (INIS)
Dong, Tao; Hu, Wenjie; Liao, Xiaofeng
2016-01-01
In this paper, a congestion control model in underwater wireless sensor network with time delay is considered. First, the boundedness of the positive equilibrium, where the samples density is positive for each node and the different event flows coexist, is investigated, which implies that the samples density of sensor node cannot exceed the Environmental carrying capacity. Then, by considering the time delay can be regarded as a bifurcating parameter, the dynamical behaviors, which include local stability and Hopf bifurcation, are investigated. It is found that when the communication time delay passes a critical value, the system loses its stability and a Hopf bifurcation occurs, which means the underwater wireless sensor network will be congested, even collapsed. Furthermore, the direction and stability of the bifurcating periodic solutions are derived by applying the normal form theory and the center manifold theorem. Finally, some numerical examples are finally performed to verify the theoretical results.
End-to-end delay analysis in wireless sensor networks with service vacation
Alabdulmohsin, Ibrahim; Hyadi, Amal; Afify, Laila H.; Shihada, Basem
2014-01-01
In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vacations framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping scheme is adopted throughout the network nodes. The objective of our proposed framework is to present an expression for maximum hop-count as well as an approximate expression of the probability of blocking at the sink node upon violating certain end-to-end delay threshold. Using numerical simulations, we validate the proposed analytical model and demonstrate that the blocking probability of the system for various vacation time distributions matches the simulation results.
End-to-end delay analysis in wireless sensor networks with service vacation
Alabdulmohsin, Ibrahim
2014-04-01
In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vacations framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping scheme is adopted throughout the network nodes. The objective of our proposed framework is to present an expression for maximum hop-count as well as an approximate expression of the probability of blocking at the sink node upon violating certain end-to-end delay threshold. Using numerical simulations, we validate the proposed analytical model and demonstrate that the blocking probability of the system for various vacation time distributions matches the simulation results.
Directory of Open Access Journals (Sweden)
Shenping Xiao
2014-01-01
Full Text Available The problem of stability analysis for a class of networked control systems (NCSs with network-induced delay and packet dropout is investigated in this paper. Based on the working mechanism of zero-order holder, the closed-loop NCS is modeled as a continuous-time linear system with input delay. By introducing a novel Lyapunov-Krasovskii functional which splits both the lower and upper bounds of the delay into two subintervals, respectively, and utilizes reciprocally convex combination technique, a new stability criterion is derived in terms of linear matrix inequalities. Compared with previous results in the literature, the obtained stability criterion is less conservative. Numerical examples demonstrate the validity and feasibility of the proposed method.
A Sociability-Based Routing Scheme for Delay-Tolerant Networks
Directory of Open Access Journals (Sweden)
Fabbri Flavio
2011-01-01
Full Text Available The problem of choosing the best forwarders in Delay-Tolerant Networks (DTNs is crucial for minimizing the delay in packet delivery and for keeping the amount of generated traffic under control. In this paper, we introduce sociable routing, a novel routing strategy that selects a subset of optimal forwarders among all the nodes and relies on them for an efficient delivery. The key idea is that of assigning to each network node a time-varying scalar parameter which captures its social behavior in terms of frequency and types of encounters. This sociability concept is widely discussed and mathematically formalized. Simulation results of a DTN of vehicles in urban environment, driven by real mobility traces, and employing sociable routing, is presented. Encouraging results show that sociable routing, compared to other known protocols, achieves a good compromise in terms of delay performance and amount of generated traffic.
Finite-time stability of neutral-type neural networks with random time-varying delays
Ali, M. Syed; Saravanan, S.; Zhu, Quanxin
2017-11-01
This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.
Directory of Open Access Journals (Sweden)
Jianxin Feng
2014-01-01
Full Text Available The recursive estimation problem is studied for a class of uncertain dynamical systems with different delay rates sensor network and autocorrelated process noises. The process noises are assumed to be autocorrelated across time and the autocorrelation property is described by the covariances between different time instants. The system model under consideration is subject to multiplicative noises or stochastic uncertainties. The sensor delay phenomenon occurs in a random way and each sensor in the sensor network has an individual delay rate which is characterized by a binary switching sequence obeying a conditional probability distribution. By using the orthogonal projection theorem and an innovation analysis approach, the desired recursive robust estimators including recursive robust filter, predictor, and smoother are obtained. Simulation results are provided to demonstrate the effectiveness of the proposed approaches.
Robust stability analysis of uncertain stochastic neural networks with interval time-varying delay
International Nuclear Information System (INIS)
Feng Wei; Yang, Simon X.; Fu Wei; Wu Haixia
2009-01-01
This paper addresses the stability analysis problem for uncertain stochastic neural networks with interval time-varying delays. The parameter uncertainties are assumed to be norm bounded, and the delay factor is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. A sufficient condition is derived such that for all admissible uncertainties, the considered neural network is robustly, globally, asymptotically stable in the mean square. Some stability criteria are formulated by means of the feasibility of a linear matrix inequality (LMI), which can be effectively solved by some standard numerical packages. Finally, numerical examples are provided to demonstrate the usefulness of the proposed criteria.
Synchronization criterion for Lur'e type complex dynamical networks with time-varying delay
International Nuclear Information System (INIS)
Ji, D.H.; Park, Ju H.; Yoo, W.J.; Won, S.C.; Lee, S.M.
2010-01-01
In this Letter, the synchronization problem for a class of complex dynamical networks in which every identical node is a Lur'e system with time-varying delay is considered. A delay-dependent synchronization criterion is derived for the synchronization of complex dynamical network that represented by Lur'e system with sector restricted nonlinearities. The derived criterion is a sufficient condition for absolute stability of error dynamics between the each nodes and the isolated node. Using a convex representation of the nonlinearity for error dynamics, the stability condition based on the discretized Lyapunov-Krasovskii functional is obtained via LMI formulation. The proposed delay-dependent synchronization criterion is less conservative than the existing ones. The effectiveness of our work is verified through numerical examples.
A new criterion for global robust stability of interval neural networks with discrete time delays
International Nuclear Information System (INIS)
Li Chuandong; Chen Jinyu; Huang Tingwen
2007-01-01
This paper further studies global robust stability of a class of interval neural networks with discrete time delays. By introducing an equivalent transformation of interval matrices, a new criterion on global robust stability is established. In comparison with the results reported in the literature, the proposed approach leads to results with less restrictive conditions. Numerical examples are also worked through to illustrate our results
Heemels, W.P.M.H.; Teel, A.R.; Wouw, van de N.; Nesic, D.
2010-01-01
There are many communication imperfections in networked control systems (NCS) such as varying transmission delays, varying sampling/transmission intervals, packet loss, communication constraints and quantization effects. Most of the available literature on NCS focuses on only some of these aspects,
Robustness of unstable attractors in arbitrarily sized pulse-coupled networks with delay
Broer, Hendrik; Efstathiou, Konstantinos; Subramanian, Easwar
We consider arbitrarily large networks of pulse-coupled oscillators with non-zero delay where the coupling is given by the Mirollo-Strogatz function. We prove that such systems have unstable attractors (saddle periodic orbits whose stable set has non-empty interior) in an open parameter region for
New results of almost periodic solutions for cellular neural networks with mixed delays
International Nuclear Information System (INIS)
Zhao Weirui; Zhang Huanshui
2009-01-01
In this paper, for cellular neural networks with mixed delays, we prove some new results on the existence of almost periodic solutions by contraction principle. The global exponential stability of almost periodic solutions is discussed further, and conditions for exponential convergence are given. The conditions we obtained are weaker than the previously known ones and can be easily reduced to several special cases.
Dynamic analysis of high-order Cohen-Grossberg neural networks with time delay
International Nuclear Information System (INIS)
Chen Zhang; Zhao Donghua; Ruan Jiong
2007-01-01
In this paper, a class of high-order Cohen-Grossberg neural networks with time delay is studied. Several sufficient conditions are obtained for global asymptotic stability and global exponential stability using Lyapunov and LMI method. Finally, two examples are given to illustrate the effectiveness of our method
Global Stability of Complex-Valued Genetic Regulatory Networks with Delays on Time Scales
Directory of Open Access Journals (Sweden)
Wang Yajing
2016-01-01
Full Text Available In this paper, the global exponential stability of complex-valued genetic regulatory networks with delays is investigated. Besides presenting conditions guaranteeing the existence of a unique equilibrium pattern, its global exponential stability is discussed. Some numerical examples for different time scales.
Dynamical Behaviors of Stochastic Reaction-Diffusion Cohen-Grossberg Neural Networks with Delays
Directory of Open Access Journals (Sweden)
Li Wan
2012-01-01
Full Text Available This paper investigates dynamical behaviors of stochastic Cohen-Grossberg neural network with delays and reaction diffusion. By employing Lyapunov method, Poincaré inequality and matrix technique, some sufficient criteria on ultimate boundedness, weak attractor, and asymptotic stability are obtained. Finally, a numerical example is given to illustrate the correctness and effectiveness of our theoretical results.
Global asymptotic stability of Cohen-Grossberg neural network with continuously distributed delays
International Nuclear Information System (INIS)
Wan Li; Sun Jianhua
2005-01-01
The convergence dynamical behaviors of Cohen-Grossberg neural network with continuously distributed delays are discussed. By using Brouwer's fixed point theorem, matrix theory and analysis techniques such as Gronwall inequality, some new sufficient conditions guaranteeing the existence, uniqueness of an equilibrium point and its global asymptotic stability are obtained. An example is given to illustrate the theoretical results
Global exponential stability of cellular neural networks with mixed delays and impulses
International Nuclear Information System (INIS)
Xiong Wanmin; Zhou Qiyuan; Xiao Bing; Yu Yuehua
2007-01-01
In this paper cellular neural networks with mixed delays and impulses are considered. Sufficient conditions for the existence and global exponential stability of a unique equilibrium point are established by using the fixed point theorem and differential inequality technique. The results of this paper are new and they complement previously known results
International Nuclear Information System (INIS)
Wang Yixuan; Xiong Wanmin; Zhou Qiyuan; Xiao Bing; Yu Yuehua
2006-01-01
In this Letter cellular neural networks with continuously distributed delays and impulses are considered. Sufficient conditions for the existence and global exponential stability of a unique equilibrium point are established by using the fixed point theorem and differential inequality techniques. The results of this Letter are new and they complement previously known results
Limitations in the design of ancillary service markets imposed by communication network delays
Hermans, R.M.; Jokic, A.; Bosch, van den P.P.J.; Frunt, J.; Kamphuis, I.G.; Warmer, C.J.
2010-01-01
Real-time balancing of the European electricity grid will become increasingly dependent on market-based control mechanisms that are enabled by connecting millions of prosumers to an open communication network. The use of communication systems inevitably introduces delays in the energy balancing
Santos, Carlos; Espinosa, Felipe; Santiso, Enrique; Mazo, Manuel
2015-05-27
One of the main challenges in wireless cyber-physical systems is to reduce the load of the communication channel while preserving the control performance. In this way, communication resources are liberated for other applications sharing the channel bandwidth. The main contribution of this work is the design of a remote control solution based on an aperiodic and adaptive triggering mechanism considering the current network delay of multiple robotics units. Working with the actual network delay instead of the maximum one leads to abandoning this conservative assumption, since the triggering condition is fixed depending on the current state of the network. This way, the controller manages the usage of the wireless channel in order to reduce the channel delay and to improve the availability of the communication resources. The communication standard under study is the widespread IEEE 802.11g, whose channel delay is clearly uncertain. First, the adaptive self-triggered control is validated through the TrueTime simulation tool configured for the mentioned WiFi standard. Implementation results applying the aperiodic linear control laws on four P3-DX robots are also included. Both of them demonstrate the advantage of this solution in terms of network accessing and control performance with respect to periodic and non-adaptive self-triggered alternatives.
Directory of Open Access Journals (Sweden)
Carlos Santos
2015-05-01
Full Text Available One of the main challenges in wireless cyber-physical systems is to reduce the load of the communication channel while preserving the control performance. In this way, communication resources are liberated for other applications sharing the channel bandwidth. The main contribution of this work is the design of a remote control solution based on an aperiodic and adaptive triggering mechanism considering the current network delay of multiple robotics units. Working with the actual network delay instead of the maximum one leads to abandoning this conservative assumption, since the triggering condition is fixed depending on the current state of the network. This way, the controller manages the usage of the wireless channel in order to reduce the channel delay and to improve the availability of the communication resources. The communication standard under study is the widespread IEEE 802.11g, whose channel delay is clearly uncertain. First, the adaptive self-triggered control is validated through the TrueTime simulation tool configured for the mentioned WiFi standard. Implementation results applying the aperiodic linear control laws on four P3-DX robots are also included. Both of them demonstrate the advantage of this solution in terms of network accessing and control performance with respect to periodic and non-adaptive self-triggered alternatives.
Stability and bifurcation in a simplified four-neuron BAM neural network with multiple delays
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available We first study the distribution of the zeros of a fourth-degree exponential polynomial. Then we apply the obtained results to a simplified bidirectional associated memory (BAM neural network with four neurons and multiple time delays. By taking the sum of the delays as the bifurcation parameter, it is shown that under certain assumptions the steady state is absolutely stable. Under another set of conditions, there are some critical values of the delay, when the delay crosses these critical values, the Hopf bifurcation occurs. Furthermore, some explicit formulae determining the stability and the direction of periodic solutions bifurcating from Hopf bifurcations are obtained by applying the normal form theory and center manifold reduction. Numerical simulations supporting the theoretical analysis are also included.
Two time-delay dynamic model on the transmission of malicious signals in wireless sensor network
International Nuclear Information System (INIS)
Keshri, Neha; Mishra, Bimal Kumar
2014-01-01
Highlights: • Role of time delay to reduce the adversary effect in WSN is explored. • Model with two time delays is proposed to analyse spread of malicious signal in WSN. • Dynamical behaviour of worm-free equilibrium and endemic equilibrium is shown. • Threshold condition for switch of stability are obtained analytically. • Relation between stability and the two time delays is also explored. - Abstract: Deployed in a hostile environment, motes of a Wireless sensor network (WSN) could be easily compromised by the attackers because of several constraints such as limited processing capabilities, memory space, and limited battery life time etc. While transmitting the data to their neighbour motes within the network, motes are easily compromised due to resource constraints. Here time delay can play an efficient role to reduce the adversary effect on motes. In this paper, we propose an epidemic model SEIR (Susceptible–Exposed–Infectious–Recovered) with two time delays to describe the transmission dynamics of malicious signals in wireless sensor network. The first delay accounts for an exposed (latent) period while the second delay is for the temporary immunity period due to multiple worm outbreaks. The dynamical behaviour of worm-free equilibrium and endemic equilibrium is shown from the point of stability which switches under some threshold condition specified by the basic reproduction number. Our results show that the global properties of equilibria also depends on the threshold condition and that latent and temporary immunity period in a mote does not affect the stability, but they play a positive role to control malicious attack. Moreover, numerical simulations are given to support the theoretical analysis
Refuses and delays in the transportation by ship of radioactive material
International Nuclear Information System (INIS)
Xavier, Clarice; Sobreira, Ana Celia
2011-01-01
Some Class 7 materials can only be transported by ship, making that load and unload activities can be done in a port. In the Brazil, the port of Santos posses the most volume of cargo manipulation, and cargoes which contain radioactive material are always present with all manipulation requisites according to applicable regulations. The transport and manipulation operations of radioactive material are performed in accordance with national and international requisites but, some individuals posses yet a high risk perception according to our experience, involving members of Brazilian port authorities, the Navy and cargoes handlers at the ports. So, exist yet a high quantity of refuses and delays during the transport by ship. Therefore, a communication strategy was developed and applied, to inform the risk perception, supplying information on the very principles of ionizing radiation, legislation and uses of radiation, and so, diminishing the quantity of refuses and delays. From that initial communication strategy on, it becomes evident the necessity of training and conscience making a movement for the problem of refuses and delays be diminished
International Nuclear Information System (INIS)
Huang He; Qu Yuzhong; Li Hanxiong
2005-01-01
With the development of intelligent control, switched systems have been widely studied. Here we try to introduce some ideas of the switched systems into the field of neural networks. In this Letter, a class of switched Hopfield neural networks with time-varying delay is investigated. The parametric uncertainty is considered and assumed to be norm bounded. Firstly, the mathematical model of the switched Hopfield neural networks is established in which a set of Hopfield neural networks are used as the individual subsystems and an arbitrary switching rule is assumed; Secondly, robust stability analysis for such switched Hopfield neural networks is addressed based on the Lyapunov-Krasovskii approach. Some criteria are given to guarantee the switched Hopfield neural networks to be globally exponentially stable for all admissible parametric uncertainties. These conditions are expressed in terms of some strict linear matrix inequalities (LMIs). Finally, a numerical example is provided to illustrate our results
Generalized Projective Synchronization between Two Different Neural Networks with Mixed Time Delays
Directory of Open Access Journals (Sweden)
Xuefei Wu
2012-01-01
Full Text Available The generalized projective synchronization (GPS between two different neural networks with nonlinear coupling and mixed time delays is considered. Several kinds of nonlinear feedback controllers are designed to achieve GPS between two different such neural networks. Some results for GPS of these neural networks are proved theoretically by using the Lyapunov stability theory and the LaSalle invariance principle. Moreover, by comparison, we determine an optimal nonlinear controller from several ones and provide an adaptive update law for it. Computer simulations are provided to show the effectiveness and feasibility of the proposed methods.
Gong, Shuqing; Yang, Shaofu; Guo, Zhenyuan; Huang, Tingwen
2018-06-01
The paper is concerned with the synchronization problem of inertial memristive neural networks with time-varying delay. First, by choosing a proper variable substitution, inertial memristive neural networks described by second-order differential equations can be transformed into first-order differential equations. Then, a novel controller with a linear diffusive term and discontinuous sign term is designed. By using the controller, the sufficient conditions for assuring the global exponential synchronization of the derive and response neural networks are derived based on Lyapunov stability theory and some inequality techniques. Finally, several numerical simulations are provided to substantiate the effectiveness of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.
Cluster synchronization of community network with distributed time delays via impulsive control
International Nuclear Information System (INIS)
Leng Hui; Wu Zhao-Yan
2016-01-01
Cluster synchronization is an important dynamical behavior in community networks and deserves further investigations. A community network with distributed time delays is investigated in this paper. For achieving cluster synchronization, an impulsive control scheme is introduced to design proper controllers and an adaptive strategy is adopted to make the impulsive controllers unified for different networks. Through taking advantage of the linear matrix inequality technique and constructing Lyapunov functions, some synchronization criteria with respect to the impulsive gains, instants, and system parameters without adaptive strategy are obtained and generalized to the adaptive case. Finally, numerical examples are presented to demonstrate the effectiveness of the theoretical results. (paper)
Exponential p-stability of delayed Cohen-Grossberg-type BAM neural networks with impulses
International Nuclear Information System (INIS)
Xia Yonghui; Huang Zhenkun; Han Maoan
2008-01-01
An impulsive Cohen-Grossberg-type bidirectional associative memory (BAM) neural networks with distributed delays is studied. Some new sufficient conditions are established for the existence and global exponential stability of a unique equilibrium without strict conditions imposed on self regulation functions. The approaches are based on Laypunov-Kravsovskii functional and homeomorphism theory. When our results are applied to the BAM neural networks, our results generalize some previously known results. It is believed that these results are significant and useful for the design and applications of Cohen-Grossberg-type bidirectional associative memory networks
Ren, Fengli; Cao, Jinde
2007-03-01
In this paper, several sufficient conditions are obtained ensuring existence, global attractivity and global asymptotic stability of the periodic solution for the higher-order bidirectional associative memory neural networks with periodic coefficients and delays by using the continuation theorem of Mawhin's coincidence degree theory, the Lyapunov functional and the non-singular M-matrix. Two examples are exploited to illustrate the effectiveness of the proposed criteria. These results are more effective than the ones in the literature for some neural networks, and can be applied to the design of globally attractive or globally asymptotically stable networks and thus have important significance in both theory and applications.
International Nuclear Information System (INIS)
Liang Jinling; Cao Jinde
2004-01-01
First, convergence of continuous-time Bidirectional Associative Memory (BAM) neural networks are studied. By using Lyapunov functionals and some analysis technique, the delay-independent sufficient conditions are obtained for the networks to converge exponentially toward the equilibrium associated with the constant input sources. Second, discrete-time analogues of the continuous-time BAM networks are formulated and studied. It is shown that the convergence characteristics of the continuous-time systems are preserved by the discrete-time analogues without any restriction imposed on the uniform discretionary step size. An illustrative example is given to demonstrate the effectiveness of the obtained results
Delay reduction in multi-hop device-to-device communication using network coding
Douik, Ahmed S.
2015-08-12
This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.
Lyapunov Functions to Caputo Fractional Neural Networks with Time-Varying Delays
Directory of Open Access Journals (Sweden)
Ravi Agarwal
2018-05-01
Full Text Available One of the main properties of solutions of nonlinear Caputo fractional neural networks is stability and often the direct Lyapunov method is used to study stability properties (usually these Lyapunov functions do not depend on the time variable. In connection with the Lyapunov fractional method we present a brief overview of the most popular fractional order derivatives of Lyapunov functions among Caputo fractional delay differential equations. These derivatives are applied to various types of neural networks with variable coefficients and time-varying delays. We show that quadratic Lyapunov functions and their Caputo fractional derivatives are not applicable in some cases when one studies stability properties. Some sufficient conditions for stability of equilibrium of nonlinear Caputo fractional neural networks with time dependent transmission delays, time varying self-regulating parameters of all units and time varying functions of the connection between two neurons in the network are obtained. The cases of time varying Lipschitz coefficients as well as nonLipschitz activation functions are studied. We illustrate our theory on particular nonlinear Caputo fractional neural networks.
Liu, Chen; Wang, Jiang; Yu, Haitao; Deng, Bin; Wei, Xile; Tsang, Kaiming; Chan, Wailok
2013-09-01
The combined effects of the information transmission delay and the ratio of the electrical and chemical synapses on the synchronization transitions in the hybrid modular neuronal network are investigated in this paper. Numerical results show that the synchronization of neuron activities can be either promoted or destroyed as the information transmission delay increases, irrespective of the probability of electrical synapses in the hybrid-synaptic network. Interestingly, when the number of the electrical synapses exceeds a certain level, further increasing its proportion can obviously enhance the spatiotemporal synchronization transitions. Moreover, the coupling strength has a significant effect on the synchronization transition. The dominated type of the synapse always has a more profound effect on the emergency of the synchronous behaviors. Furthermore, the results of the modular neuronal network structures demonstrate that excessive partitioning of the modular network may result in the dramatic detriment of neuronal synchronization. Considering that information transmission delays are inevitable in intra- and inter-neuronal networks communication, the obtained results may have important implications for the exploration of the synchronization mechanism underlying several neural system diseases such as Parkinson's Disease.
International Nuclear Information System (INIS)
Yuan Kun; Cao Jinde
2006-01-01
In this paper, the problems of exponential convergence and the exponential stability of the periodic solution for a general class of non-autonomous competitive-cooperative neural networks are analyzed via the decomposition approach. The idea is to divide the connection weights into inhibitory or excitatory types and thereby to embed a competitive-cooperative delayed neural network into an augmented cooperative delay system through a symmetric transformation. Some simple necessary and sufficient conditions are derived to ensure the componentwise exponential convergence and the exponential stability of the periodic solution of the considered neural networks. These results generalize and improve the previous works, and they are easy to check and apply in practice
Robustness analysis of uncertain dynamical neural networks with multiple time delays.
Senan, Sibel
2015-10-01
This paper studies the problem of global robust asymptotic stability of the equilibrium point for the class of dynamical neural networks with multiple time delays with respect to the class of slope-bounded activation functions and in the presence of the uncertainties of system parameters of the considered neural network model. By using an appropriate Lyapunov functional and exploiting the properties of the homeomorphism mapping theorem, we derive a new sufficient condition for the existence, uniqueness and global robust asymptotic stability of the equilibrium point for the class of neural networks with multiple time delays. The obtained stability condition basically relies on testing some relationships imposed on the interconnection matrices of the neural system, which can be easily verified by using some certain properties of matrices. An instructive numerical example is also given to illustrate the applicability of our result and show the advantages of this new condition over the previously reported corresponding results. Copyright © 2015 Elsevier Ltd. All rights reserved.
Topological Effects and Performance Optimization in Transportation Continuous Network Design
Directory of Open Access Journals (Sweden)
Jianjun Wu
2014-01-01
Full Text Available Because of the limitation of budget, in the planning of road works, increased efforts should be made on links that are more critical to the whole traffic system. Therefore, it would be helpful to model and evaluate the vulnerability and reliability of the transportation network when the network design is processing. This paper proposes a bilevel transportation network design model, in which the upper level is to minimize the performance of the network under the given budgets, while the lower level is a typical user equilibrium assignment problem. A new solution approach based on particle swarm optimization (PSO method is presented. The topological effects on the performance of transportation networks are studied with the consideration of three typical networks, regular lattice, random graph, and small-world network. Numerical examples and simulations are presented to demonstrate the proposed model.
Road Transport Network Analysis In Port-Harcourt Metropolics ...
African Journals Online (AJOL)
Road transport network contributes to the economy of an area as it connects points of origin to destinations. The thrust of this article therefore, is on the analysis of the road networks in Port – Harcourt metropolis with the aim of determining the connectivity of the road networks and the most accessible node. Consequently ...
Improving Spiking Dynamical Networks: Accurate Delays, Higher-Order Synapses, and Time Cells.
Voelker, Aaron R; Eliasmith, Chris
2018-03-01
Researchers building spiking neural networks face the challenge of improving the biological plausibility of their model networks while maintaining the ability to quantitatively characterize network behavior. In this work, we extend the theory behind the neural engineering framework (NEF), a method of building spiking dynamical networks, to permit the use of a broad class of synapse models while maintaining prescribed dynamics up to a given order. This theory improves our understanding of how low-level synaptic properties alter the accuracy of high-level computations in spiking dynamical networks. For completeness, we provide characterizations for both continuous-time (i.e., analog) and discrete-time (i.e., digital) simulations. We demonstrate the utility of these extensions by mapping an optimal delay line onto various spiking dynamical networks using higher-order models of the synapse. We show that these networks nonlinearly encode rolling windows of input history, using a scale invariant representation, with accuracy depending on the frequency content of the input signal. Finally, we reveal that these methods provide a novel explanation of time cell responses during a delay task, which have been observed throughout hippocampus, striatum, and cortex.
The Carrier's Liability for Damage Caused by Delay in International Air Transport
Lee, Kang Bin
2003-01-01
Delay in the air transport occurs when passengers, baggage or cargo do not arrive at their destination at the time indicated in the contract of carriage. The causes of delay in the carriage of passengers are booking errors or double booking, delayed departure of aircraft, incorrect information regarding the time of departure, failure to land at the scheduled destination and changes in flight schedule or addition of extra landing stops. Delay in the carriage of baggage or cargo may have different causes: no reservation, lack of space, failure to load the baggage or cargo at the right place, or to deliver the covering documents at the right place. The Montreal Convention of 1999 Article 19 provides that 'The carrier is liable for damage occasioned by delay in the carriage by air of passengers, baggage or cargo. Nevertheless, the carder shall not be liable for damage occasioned by delay if it proves that it and its servants and agents took all measures that could reasonably be required to avoid the damage or that it was impossible for it or them to take such measures'. The Montreal Convention Article 22 provides liability limits of the carrier in case of delay for passengers and their baggage and for cargo. In the carriage of persons, the liability of the carrier for each passenger is limited to 4,150 SDR. In the carriage of baggage, the liability of the carrier is limited to 1,000 SDR for each passenger unless a special declaration as to the value of the baggage has been made. In the carriage of cargo, the liability of the carrier is limited to 17 SDR per kilogram unless a special declaration as to the value of the cargo has been made. The Montreal Convention Article 19 has shortcomings: it is silent on the duration of the liability for carriage,andit does not make any distinction between persons and good. It does not give any indication concerning the circumstances to be taken into account in cases of delay, and about the length of delay. In conclusion, it is
Huang, Chengdai; Cao, Jinde; Xiao, Min; Alsaedi, Ahmed; Hayat, Tasawar
2018-04-01
This paper is comprehensively concerned with the dynamics of a class of high-dimension fractional ring-structured neural networks with multiple time delays. Based on the associated characteristic equation, the sum of time delays is regarded as the bifurcation parameter, and some explicit conditions for describing delay-dependent stability and emergence of Hopf bifurcation of such networks are derived. It reveals that the stability and bifurcation heavily relies on the sum of time delays for the proposed networks, and the stability performance of such networks can be markedly improved by selecting carefully the sum of time delays. Moreover, it is further displayed that both the order and the number of neurons can extremely influence the stability and bifurcation of such networks. The obtained criteria enormously generalize and improve the existing work. Finally, numerical examples are presented to verify the efficiency of the theoretical results.
A New Delay Connection for Long Short-Term Memory Networks.
Wang, Jianyong; Zhang, Lei; Chen, Yuanyuan; Yi, Zhang
2017-12-17
Connections play a crucial role in neural network (NN) learning because they determine how information flows in NNs. Suitable connection mechanisms may extensively enlarge the learning capability and reduce the negative effect of gradient problems. In this paper, a new delay connection is proposed for Long Short-Term Memory (LSTM) unit to develop a more sophisticated recurrent unit, called Delay Connected LSTM (DCLSTM). The proposed delay connection brings two main merits to DCLSTM with introducing no extra parameters. First, it allows the output of the DCLSTM unit to maintain LSTM, which is absent in the LSTM unit. Second, the proposed delay connection helps to bridge the error signals to previous time steps and allows it to be back-propagated across several layers without vanishing too quickly. To evaluate the performance of the proposed delay connections, the DCLSTM model with and without peephole connections was compared with four state-of-the-art recurrent model on two sequence classification tasks. DCLSTM model outperformed the other models with higher accuracy and F1[Formula: see text]score. Furthermore, the networks with multiple stacked DCLSTM layers and the standard LSTM layer were evaluated on Penn Treebank (PTB) language modeling. The DCLSTM model achieved lower perplexity (PPL)/bit-per-character (BPC) than the standard LSTM model. The experiments demonstrate that the learning of the DCLSTM models is more stable and efficient.
International Nuclear Information System (INIS)
Liu Yurong; Wang Zidong; Liu Xiaohui
2008-01-01
In this Letter, we investigate the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters as well as mode-dependent mixed time-delays. The parameters of the discrete-time neural networks are subject to the switching from one mode to another at different times according to a Markov chain, and the mixed time-delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. New techniques are developed to deal with the mixed time-delays in the discrete-time setting, and a novel Lyapunov-Krasovskii functional is put forward to reflect the mode-dependent time-delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the existence of the state estimators. We show that both the existence conditions and the explicit expression of the desired estimator can be characterized in terms of the solution to an LMI. A numerical example is exploited to show the usefulness of the derived LMI-based conditions
Impacts of hybrid synapses on the noise-delayed decay in scale-free neural networks
International Nuclear Information System (INIS)
Yilmaz, Ergin
2014-01-01
Highlights: • We investigate the NDD phenomenon in a hybrid scale-free network. • Electrical synapses are more impressive on the emergence of NDD. • Electrical synapses are more efficient in suppressing of the NDD. • Average degree has two opposite effects on the appearance time of the first spike. - Abstract: We study the phenomenon of noise-delayed decay in a scale-free neural network consisting of excitable FitzHugh–Nagumo neurons. In contrast to earlier works, where only electrical synapses are considered among neurons, we primarily examine the effects of hybrid synapses on the noise-delayed decay in this study. We show that the electrical synaptic coupling is more impressive than the chemical coupling in determining the appearance time of the first-spike and more efficient on the mitigation of the delay time in the detection of a suprathreshold input signal. We obtain that hybrid networks including inhibitory chemical synapses have higher signal detection capabilities than those of including excitatory ones. We also find that average degree exhibits two different effects, which are strengthening and weakening the noise-delayed decay effect depending on the noise intensity
Impact of Partial Time Delay on Temporal Dynamics of Watts-Strogatz Small-World Neuronal Networks
Yan, Hao; Sun, Xiaojuan
2017-06-01
In this paper, we mainly discuss effects of partial time delay on temporal dynamics of Watts-Strogatz (WS) small-world neuronal networks by controlling two parameters. One is the time delay τ and the other is the probability of partial time delay pdelay. Temporal dynamics of WS small-world neuronal networks are discussed with the aid of temporal coherence and mean firing rate. With the obtained simulation results, it is revealed that for small time delay τ, the probability pdelay could weaken temporal coherence and increase mean firing rate of neuronal networks, which indicates that it could improve neuronal firings of the neuronal networks while destroying firing regularity. For large time delay τ, temporal coherence and mean firing rate do not have great changes with respect to pdelay. Time delay τ always has great influence on both temporal coherence and mean firing rate no matter what is the value of pdelay. Moreover, with the analysis of spike trains and histograms of interspike intervals of neurons inside neuronal networks, it is found that the effects of partial time delays on temporal coherence and mean firing rate could be the result of locking between the period of neuronal firing activities and the value of time delay τ. In brief, partial time delay could have great influence on temporal dynamics of the neuronal networks.
Wu, Wei; Cui, Bao-Tong
2007-07-01
In this paper, a synchronization scheme for a class of chaotic neural networks with time-varying delays is presented. This class of chaotic neural networks covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks, and bidirectional associative memory networks. The obtained criteria are expressed in terms of linear matrix inequalities, thus they can be efficiently verified. A comparison between our results and the previous results shows that our results are less restrictive.
Exponentially asymptotical synchronization in uncertain complex dynamical networks with time delay
Energy Technology Data Exchange (ETDEWEB)
Luo Qun; Yang Han; Li Lixiang; Yang Yixian [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Han Jiangxue, E-mail: luoqun@bupt.edu.c [National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China)
2010-12-10
Over the past decade, complex dynamical network synchronization has attracted more and more attention and important developments have been made. In this paper, we explore the scheme of globally exponentially asymptotical synchronization in complex dynamical networks with time delay. Based on Lyapunov stability theory and through defining the error function between adjacent nodes, four novel adaptive controllers are designed under four situations where the Lipschitz constants of the state function in nodes are known or unknown and the network structure is certain or uncertain, respectively. These controllers could not only globally asymptotically synchronize all nodes in networks, but also ensure that the error functions do not exceed the pre-scheduled exponential function. Finally, simulations of the synchronization among the chaotic system in the small-world and scale-free network structures are presented, which prove the effectiveness and feasibility of our controllers.
New results on global exponential stability of recurrent neural networks with time-varying delays
International Nuclear Information System (INIS)
Xu Shengyuan; Chu Yuming; Lu Junwei
2006-01-01
This Letter provides new sufficient conditions for the existence, uniqueness and global exponential stability of the equilibrium point of recurrent neural networks with time-varying delays by employing Lyapunov functions and using the Halanay inequality. The time-varying delays are not necessarily differentiable. Both Lipschitz continuous activation functions and monotone nondecreasing activation functions are considered. The derived stability criteria are expressed in terms of linear matrix inequalities (LMIs), which can be checked easily by resorting to recently developed algorithms solving LMIs. Furthermore, the proposed stability results are less conservative than some previous ones in the literature, which is demonstrated via some numerical examples
New results on global exponential stability of recurrent neural networks with time-varying delays
Energy Technology Data Exchange (ETDEWEB)
Xu Shengyuan [Department of Automation, Nanjing University of Science and Technology, Nanjing 210094 (China)]. E-mail: syxu02@yahoo.com.cn; Chu Yuming [Department of Mathematics, Huzhou Teacher' s College, Huzhou, Zhejiang 313000 (China); Lu Junwei [School of Electrical and Automation Engineering, Nanjing Normal University, 78 Bancang Street, Nanjing, 210042 (China)
2006-04-03
This Letter provides new sufficient conditions for the existence, uniqueness and global exponential stability of the equilibrium point of recurrent neural networks with time-varying delays by employing Lyapunov functions and using the Halanay inequality. The time-varying delays are not necessarily differentiable. Both Lipschitz continuous activation functions and monotone nondecreasing activation functions are considered. The derived stability criteria are expressed in terms of linear matrix inequalities (LMIs), which can be checked easily by resorting to recently developed algorithms solving LMIs. Furthermore, the proposed stability results are less conservative than some previous ones in the literature, which is demonstrated via some numerical examples.
On control of Hopf bifurcation in time-delayed neural network system
International Nuclear Information System (INIS)
Zhou Shangbo; Liao Xiaofeng; Yu Juebang; Wong Kwokwo
2005-01-01
The control of Hopf bifurcations in neural network systems is studied in this Letter. The asymptotic stability theorem and the relevant corollary for linearized nonlinear dynamical systems are proven. In particular, a novel method for analyzing the local stability of a dynamical system with time-delay is suggested. For the time-delayed system consisting of one or two neurons, a washout filter based control model is proposed and analyzed. By employing the stability theorems derived, we investigate the stability of a control system and state the relevant theorems for choosing the parameters of the stabilized control system
Directory of Open Access Journals (Sweden)
Shuiqing Yu
2013-01-01
Full Text Available This paper investigates the dynamic output feedback control for nonlinear networked control systems with both random packet dropout and random delay. Random packet dropout and random delay are modeled as two independent random variables. An observer-based dynamic output feedback controller is designed based upon the Lyapunov theory. The quantitative relationship of the dropout rate, transition probability matrix, and nonlinear level is derived by solving a set of linear matrix inequalities. Finally, an example is presented to illustrate the effectiveness of the proposed method.
H∞ state estimation of generalised neural networks with interval time-varying delays
Saravanakumar, R.; Syed Ali, M.; Cao, Jinde; Huang, He
2016-12-01
This paper focuses on studying the H∞ state estimation of generalised neural networks with interval time-varying delays. The integral terms in the time derivative of the Lyapunov-Krasovskii functional are handled by the Jensen's inequality, reciprocally convex combination approach and a new Wirtinger-based double integral inequality. A delay-dependent criterion is derived under which the estimation error system is globally asymptotically stable with H∞ performance. The proposed conditions are represented by linear matrix inequalities. Optimal H∞ norm bounds are obtained easily by solving convex problems in terms of linear matrix inequalities. The advantage of employing the proposed inequalities is illustrated by numerical examples.
Completion time reduction in instantly decodable network coding through decoding delay control
Douik, Ahmed S.
2014-12-01
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users\\' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.
Completion time reduction in instantly decodable network coding through decoding delay control
Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Al-Naffouri, Tareq Y.
2014-01-01
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.
Structural and robustness properties of smart-city transportation networks
Zhang, Zhen-Gang; Ding, Zhuo; Fan, Jing-Fang; Meng, Jun; Ding, Yi-Min; Ye, Fang-Fu; Chen, Xiao-Song
2015-09-01
The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. Project supported by the Major Projects of the China National Social Science Fund (Grant No. 11 & ZD154).
Structural and robustness properties of smart-city transportation networks
International Nuclear Information System (INIS)
Zhang Zhen-Gang; Ding Zhuo; Fan Jing-Fang; Chen Xiao-Song; Meng Jun; Ye Fang-Fu; Ding Yi-Min
2015-01-01
The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. (rapid communication)
Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher
2005-01-01
This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.
A review on transport layer protocol performance for delivering video on an adhoc network
Suherman; Suwendri; Al-Akaidi, Marwan
2017-09-01
The transport layer protocol is responsible for the end to end data transmission. Transmission control protocol (TCP) provides a reliable connection and user datagram protocol (UDP) offers fast but unguaranteed data transfer. Meanwhile, the 802.11 (wireless fidelity/WiFi) networks have been widely used as internet hotspots. This paper evaluates TCP, TCP variants and UDP performances for video transmission on an adhoc network. The transport protocol - medium access cross-layer is proposed by prioritizing TCP acknowledgement to reduce delay. The NS-2 evaluations show that the average delays increase linearly for all the evaluated protocols and the average packet losses grow logarithmically. UDP produces the lowest transmission delay; 5.4% and 5.8% lower than TCP and TCP variant, but experiences the highest packet loss. Both TCP and TCP Vegas maintain packet loss as low as possible. The proposed cross-layer successfully decreases TCP and TCP Vegas delay about 0.12 % and 0.15%, although losses remain similar.
Quantifying travel time variability in transportation networks.
2010-03-01
Nonrecurring congestion creates significant delay on freeways in urban areas, lending importance : to the study of facility reliability. In locations where traffic detectors record and archive data, : approximate probability distributions for travel ...
Self-Adaptive Context Aware Routing Protocol for Unicast Communication in Delay and Tolerant Network
Directory of Open Access Journals (Sweden)
Yunbo Chen
2014-05-01
Full Text Available At present, most of research works in mobile network focus on the network overhead of the known path which exists between the sender and the receiver. However, the trend of the current practical application demands is becoming increasingly distributed and decentralized. The Delay and Tolerant Network (DTN just comes out of such background of the conflicts between them. The DTN could effectively eliminate the gap between the mobile network and the practical application demands. In this paper, a Self-Adaptive Context Aware Routing Protocol (SACARP for the unicast communication in delay and tolerant networks is presented. Meanwhile, according to the real-time context information of DTN, the Kalman filter theory is introduced to predict the information state of mobility for the optional message ferrying node, and then gives the optimal selection strategy of the message ferrying nodes. The simulation experiments have shown that, compared to the familiar single- copy and multi-copy protocols, the SACARP proposed in this paper has better transmission performance and stability, especially when the network is free, the protocol would keep a good performance with fewer connections and less buffer space.
Wei Feng; Simon X. Yang; Haixia Wu
2014-01-01
The global asymptotic robust stability of equilibrium is considered for neutral-type hybrid bidirectional associative memory neural networks with time-varying delays and parameters uncertainties. The results we obtained in this paper are delay-derivative-dependent and establish various relationships between the network parameters only. Therefore, the results of this paper are applicable to a larger class of neural networks and can be easily verified when compared with the previously reported ...
Simulation of noise-assisted transport via optical cavity networks
International Nuclear Information System (INIS)
Caruso, Filippo; Plenio, Martin B.; Spagnolo, Nicolo; Vitelli, Chiara; Sciarrino, Fabio
2011-01-01
Recently, the presence of noise has been found to play a key role in assisting the transport of energy and information in complex quantum networks and even in biomolecular systems. Here we propose an experimentally realizable optical network scheme for the demonstration of the basic mechanisms underlying noise-assisted transport. The proposed system consists of a network of coupled quantum-optical cavities, injected with a single photon, whose transmission efficiency can be measured. Introducing dephasing in the photon path, this system exhibits a characteristic enhancement of the transport efficiency that can be observed with presently available technology.
International Nuclear Information System (INIS)
Ozer, Mahmut; Uzuntarla, Muhammet
2008-01-01
The Hodgkin-Huxley (H-H) neuron model driven by stimuli just above threshold shows a noise-induced response delay with respect to time to the first spike for a certain range of noise strengths, an effect called 'noise delayed decay' (NDD). We study the response time of a network of coupled H-H neurons, and investigate how the NDD can be affected by the connection topology of the network and the coupling strength. We show that the NDD effect exists for weak and intermediate coupling strengths, whereas it disappears for strong coupling strength regardless of the connection topology. We also show that although the network structure has very little effect on the NDD for a weak coupling strength, the network structure plays a key role for an intermediate coupling strength by decreasing the NDD effect with the increasing number of random shortcuts, and thus provides an additional operating regime, that is absent in the regular network, in which the neurons may also exploit a spike time code
Xia, Li
2014-11-20
This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.
Xia, Li; Shihada, Basem
2014-01-01
This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.
H∞ Filtering for Networked Markovian Jump Systems with Multiple Stochastic Communication Delays
Directory of Open Access Journals (Sweden)
Hui Dong
2015-01-01
Full Text Available This paper is concerned with the H∞ filtering for a class of networked Markovian jump systems with multiple communication delays. Due to the existence of communication constraints, the measurement signal cannot arrive at the filter completely on time, and the stochastic communication delays are considered in the filter design. Firstly, a set of stochastic variables is introduced to model the occurrence probabilities of the delays. Then based on the stochastic system approach, a sufficient condition is obtained such that the filtering error system is stable in the mean-square sense and with a prescribed H∞ disturbance attenuation level. The optimal filter gain parameters can be determined by solving a convex optimization problem. Finally, a simulation example is given to show the effectiveness of the proposed filter design method.
Stabilization of Networked Control Systems with Variable Delays and Saturating Inputs
Directory of Open Access Journals (Sweden)
M. Mahmodi Kaleybar
2014-06-01
Full Text Available In this paper, improved conditions for the synthesis of static state-feedback controller are derived to stabilize networked control systems (NCSs subject to actuator saturation. Both of the data packet latency and dropout which deteriorate the performance of the closed-loop system are considered in the NCS model via variable delays. Two different techniques are employed to incorporate actuator saturation in the system description. Utilizing Lyapunov-Krasovskii Theorem, delay-dependent conditions are obtained in terms of linear matrix inequalities (LMIs to determine the static feedback gain. Moreover, an optimization problem is formulated in order to find the less conservative estimate for the region of attraction corresponding to different maximum allowable delays. Numerical examples are introduced to demonstrate the effectiveness and advantages of the proposed schemes.
H∞ Control for a Networked Control Model of Systems with Two Additive Time-Varying Delays
Directory of Open Access Journals (Sweden)
Hanyong Shao
2014-01-01
Full Text Available This paper is concerned with H∞ control for a networked control model of systems with two additive time-varying delays. A new Lyapunov functional is constructed to make full use of the information of the delays, and for the derivative of the Lyapunov functional a novel technique is employed to compute a tighter upper bound, which is dependent on the two time-varying delays instead of the upper bounds of them. Then the convex polyhedron method is proposed to check the upper bound of the derivative of the Lyapunov functional. The resulting stability criteria have fewer matrix variables but less conservatism than some existing ones. The stability criteria are applied to designing a state feedback controller, which guarantees that the closed-loop system is asymptotically stable with a prescribed H∞ disturbance attenuation level. Finally examples are given to show the advantages of the stability criteria and the effectiveness of the proposed control method.
A robust control strategy for a class of distributed network with transmission delays
DEFF Research Database (Denmark)
Vahid Naghavi, S.; A. Safavi, A.; Khooban, Mohammad Hassan
2016-01-01
Purpose The purpose of this paper is to concern the design of a robust model predictive controller for distributed networked systems with transmission delays. Design/methodology/approach The overall system is composed of a number of interconnected nonlinear subsystems with time-varying transmission...... as an optimization problem of a “worst-case” objective function over an infinite moving horizon. Findings The aim is to propose control synthesis approach that depends on nonlinearity and time varying delay characteristics. The MPC problem is represented in a time varying delayed state feedback structure....... Then the synthesis sufficient condition is provided in the form of a linear matrix inequality (LMI) optimization and is solved online at each time instant. In the rest, an LMI-based decentralized observer-based robust model predictive control strategy is proposed. Originality/value The authors develop RMPC...
Discrete-time recurrent neural networks with time-varying delays: Exponential stability analysis
International Nuclear Information System (INIS)
Liu, Yurong; Wang, Zidong; Serrano, Alan; Liu, Xiaohui
2007-01-01
This Letter is concerned with the analysis problem of exponential stability for a class of discrete-time recurrent neural networks (DRNNs) with time delays. The delay is of the time-varying nature, and the activation functions are assumed to be neither differentiable nor strict monotonic. Furthermore, the description of the activation functions is more general than the recently commonly used Lipschitz conditions. Under such mild conditions, we first prove the existence of the equilibrium point. Then, by employing a Lyapunov-Krasovskii functional, a unified linear matrix inequality (LMI) approach is developed to establish sufficient conditions for the DRNNs to be globally exponentially stable. It is shown that the delayed DRNNs are globally exponentially stable if a certain LMI is solvable, where the feasibility of such an LMI can be easily checked by using the numerically efficient Matlab LMI Toolbox. A simulation example is presented to show the usefulness of the derived LMI-based stability condition
Computer-Supported Modelling of Multi modal Transportation Networks Rationalization
Directory of Open Access Journals (Sweden)
Ratko Zelenika
2007-09-01
Full Text Available This paper deals with issues of shaping and functioning ofcomputer programs in the modelling and solving of multimoda Itransportation network problems. A methodology of an integrateduse of a programming language for mathematical modellingis defined, as well as spreadsheets for the solving of complexmultimodal transportation network problems. The papercontains a comparison of the partial and integral methods ofsolving multimodal transportation networks. The basic hypothesisset forth in this paper is that the integral method results inbetter multimodal transportation network rationalization effects,whereas a multimodal transportation network modelbased on the integral method, once built, can be used as the basisfor all kinds of transportation problems within multimodaltransport. As opposed to linear transport problems, multimodaltransport network can assume very complex shapes. This papercontains a comparison of the partial and integral approach totransp01tation network solving. In the partial approach, astraightforward model of a transp01tation network, which canbe solved through the use of the Solver computer tool within theExcel spreadsheet inteiface, is quite sufficient. In the solving ofa multimodal transportation problem through the integralmethod, it is necessmy to apply sophisticated mathematicalmodelling programming languages which supp01t the use ofcomplex matrix functions and the processing of a vast amountof variables and limitations. The LINGO programming languageis more abstract than the Excel spreadsheet, and it requiresa certain programming knowledge. The definition andpresentation of a problem logic within Excel, in a manner whichis acceptable to computer software, is an ideal basis for modellingin the LINGO programming language, as well as a fasterand more effective implementation of the mathematical model.This paper provides proof for the fact that it is more rational tosolve the problem of multimodal transportation networks by
Cooperative Content Distribution over Wireless Networks for Energy and Delay Minimization
Atat, Rachad
2012-06-01
Content distribution with mobile-to-mobile cooperation is studied. Data is sent to mobile terminals on a long range link then the terminals exchange the content using an appropriate short range wireless technology. Unicasting and multicasting are investigated, both on the long range and short range links. Energy minimization is formulated as an optimization problem for each scenario, and the optimal solutions are determined in closed form. Moreover, the schemes are applied in public safety vehicular networks, where Long Term Evolution (LTE) network is used for the long range link, while IEEE 802.11 p is considered for inter-vehicle collaboration on the short range links. Finally, relay-based multicasting is applied in high speed trains for energy and delay minimization. Results show that cooperative schemes outperform non-cooperative ones and other previous related work in terms of energy and delay savings. Furthermore, practical implementation aspects of the proposed methods are also discussed.
Synchronization stability of memristor-based complex-valued neural networks with time delays.
Liu, Dan; Zhu, Song; Ye, Er
2017-12-01
This paper focuses on the dynamical property of a class of memristor-based complex-valued neural networks (MCVNNs) with time delays. By constructing the appropriate Lyapunov functional and utilizing the inequality technique, sufficient conditions are proposed to guarantee exponential synchronization of the coupled systems based on drive-response concept. The proposed results are very easy to verify, and they also extend some previous related works on memristor-based real-valued neural networks. Meanwhile, the obtained sufficient conditions of this paper may be conducive to qualitative analysis of some complex-valued nonlinear delayed systems. A numerical example is given to demonstrate the effectiveness of our theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Yang Fang
2014-01-01
Full Text Available This paper investigates the robust adaptive exponential synchronization in mean square of stochastic perturbed chaotic delayed neural networks with nonidentical parametric uncertainties. A robust adaptive feedback controller is proposed based on Gronwally’s inequality, drive-response concept, and adaptive feedback control technique with the update laws of nonidentical parametric uncertainties as well as linear matrix inequality (LMI approach. The sufficient conditions for robust adaptive exponential synchronization in mean square of uncoupled uncertain stochastic chaotic delayed neural networks are derived in terms of linear matrix inequalities (LMIs. The effect of nonidentical uncertain parameter uncertainties is suppressed by the designed robust adaptive feedback controller rapidly. A numerical example is provided to validate the effectiveness of the proposed method.
Directory of Open Access Journals (Sweden)
Xueliang Liu
2012-01-01
Full Text Available This paper is concerned with a containment problem of networked fractional-order system with multiple leaders under a fixed directed interaction graph. Based on the neighbor rule, a distributed protocol is proposed in delayed communication channels. By employing the algebraic graph theory, matrix theory, Nyquist stability theorem, and frequency domain method, it is analytically proved that the whole follower agents will flock to the convex hull which is formed by the leaders. Furthermore, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is obtained. As a special case, the interconnection topology under the undirected case is also discussed. Finally, some numerical examples with simulations are presented to demonstrate the effectiveness and correctness of the theoretical results.
International Nuclear Information System (INIS)
Liang Jinling; Lam, James; Wang Zidong
2009-01-01
This Letter is concerned with the robust state estimation problem for uncertain time-delay Markovian jumping genetic regulatory networks (GRNs) with SUM logic, where the uncertainties enter into both the network parameters and the mode transition rate. The nonlinear functions describing the feedback regulation are assumed to satisfy the sector-like conditions. The main purpose of the problem addressed is to design a linear estimator to approximate the true concentrations of the mRNA and protein through available measurement outputs. By resorting to the Lyapunov functional method and some stochastic analysis tools, it is shown that if a set of linear matrix inequalities (LMIs) is feasible, the desired state estimator, that can ensure the estimation error dynamics to be globally robustly asymptotically stable in the mean square, exists. The obtained LMI conditions are dependent on both the lower and the upper bounds of the delays. An illustrative example is presented to demonstrate the feasibility of the proposed estimation schemes.
Vadivel, P.; Sakthivel, R.; Mathiyalagan, K.; Arunkumar, A.
2013-09-01
This paper addresses the issue of robust state estimation for a class of fuzzy bidirectional associative memory (BAM) neural networks with time-varying delays and parameter uncertainties. By constructing the Lyapunov-Krasovskii functional, which contains the triple-integral term and using the free-weighting matrix technique, a set of sufficient conditions are derived in terms of linear matrix inequalities (LMIs) to estimate the neuron states through available output measurements such that the dynamics of the estimation error system is robustly asymptotically stable. In particular, we consider a generalized activation function in which the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. More precisely, the design of the state estimator for such BAM neural networks can be obtained by solving some LMIs, which are dependent on the size of the time derivative of the time-varying delays. Finally, a numerical example with simulation result is given to illustrate the obtained theoretical results.
Xu, Chang-Jin; Li, Pei-Luan; Pang, Yi-Cheng
2017-02-01
This paper is concerned with fractional-order bidirectional associative memory (BAM) neural networks with time delays. Applying Laplace transform, the generalized Gronwall inequality and estimates of Mittag-Leffler functions, some sufficient conditions which ensure the finite-time stability of fractional-order bidirectional associative memory neural networks with time delays are obtained. Two examples with their simulations are given to illustrate the theoretical findings. Our results are new and complement previously known results. Supported by National Natural Science Foundation of China under Grant Nos.~61673008, 11261010, 11101126, Project of High-Level Innovative Talents of Guizhou Province ([2016]5651), Natural Science and Technology Foundation of Guizhou Province (J[2015]2025 and J[2015]2026), 125 Special Major Science and Technology of Department of Education of Guizhou Province ([2012]011) and Natural Science Foundation of the Education Department of Guizhou Province (KY[2015]482)
International Nuclear Information System (INIS)
Vadivel, P; Sakthivel, R; Mathiyalagan, K; Arunkumar, A
2013-01-01
This paper addresses the issue of robust state estimation for a class of fuzzy bidirectional associative memory (BAM) neural networks with time-varying delays and parameter uncertainties. By constructing the Lyapunov–Krasovskii functional, which contains the triple-integral term and using the free-weighting matrix technique, a set of sufficient conditions are derived in terms of linear matrix inequalities (LMIs) to estimate the neuron states through available output measurements such that the dynamics of the estimation error system is robustly asymptotically stable. In particular, we consider a generalized activation function in which the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. More precisely, the design of the state estimator for such BAM neural networks can be obtained by solving some LMIs, which are dependent on the size of the time derivative of the time-varying delays. Finally, a numerical example with simulation result is given to illustrate the obtained theoretical results. (paper)
Delay-Tolerant, Low-Power Protocols for Large Security-Critical Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Claudio S. Malavenda
2012-01-01
Full Text Available This paper reports the analysis, implementation, and experimental testing of a delay-tolerant and energy-aware protocol for a wireless sensor node, oriented to security applications. The solution proposed takes advantages from different domains considering as a guideline the low power consumption and facing the problems of seamless and lossy connectivity offered by the wireless medium along with very limited resources offered by a wireless network node. The paper is organized as follows: first we give an overview on delay-tolerant wireless sensor networking (DTN; then we perform a simulation-based comparative analysis of state-of-the-art DTN approaches and illustrate the improvement offered by the proposed protocol; finally we present experimental data gathered from the implementation of the proposed protocol on a proprietary hardware node.
International Nuclear Information System (INIS)
Cao Jinde; Ho, Daniel W.C.
2005-01-01
In this paper, global asymptotic stability is discussed for neural networks with time-varying delay. Several new criteria in matrix inequality form are given to ascertain the uniqueness and global asymptotic stability of equilibrium point for neural networks with time-varying delay based on Lyapunov method and Linear Matrix Inequality (LMI) technique. The proposed LMI approach has the advantage of considering the difference of neuronal excitatory and inhibitory efforts, which is also computationally efficient as it can be solved numerically using recently developed interior-point algorithm. In addition, the proposed results generalize and improve previous works. The obtained criteria also combine two existing conditions into one generalized condition in matrix form. An illustrative example is also given to demonstrate the effectiveness of the proposed results
International Nuclear Information System (INIS)
Xu Shengyuan; Lam, James; Ho, Daniel W.C.
2005-01-01
This Letter is concerned with the problem of robust stability analysis for interval neural networks with multiple time-varying delays and parameter uncertainties. The parameter uncertainties are assumed to be bounded in given compact sets and the activation functions are supposed to be bounded and globally Lipschitz continuous. A sufficient condition is obtained by means of Lyapunov functionals, which guarantees the existence, uniqueness and global asymptotic stability of the delayed neural network for all admissible uncertainties. This condition is in terms of a linear matrix inequality (LMI), which can be easily checked by using recently developed algorithms in solving LMIs. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed method
Impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks.
Chen, Wu-Hua; Lu, Xiaomei; Zheng, Wei Xing
2015-04-01
This paper investigates the problems of impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks (DDNNs). Two types of DDNNs with stabilizing impulses are studied. By introducing the time-varying Lyapunov functional to capture the dynamical characteristics of discrete-time impulsive delayed neural networks (DIDNNs) and by using a convex combination technique, new exponential stability criteria are derived in terms of linear matrix inequalities. The stability criteria for DIDNNs are independent of the size of time delay but rely on the lengths of impulsive intervals. With the newly obtained stability results, sufficient conditions on the existence of linear-state feedback impulsive controllers are derived. Moreover, a novel impulsive synchronization scheme for two identical DDNNs is proposed. The novel impulsive synchronization scheme allows synchronizing two identical DDNNs with unknown delays. Simulation results are given to validate the effectiveness of the proposed criteria of impulsive stabilization and impulsive synchronization of DDNNs. Finally, an application of the obtained impulsive synchronization result for two identical chaotic DDNNs to a secure communication scheme is presented.
Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks
Directory of Open Access Journals (Sweden)
A-Ra Cho
2018-06-01
Full Text Available The propagation delay in mobile underwater acoustic sensor network (MUASN is asymmetric because of its low sound propagation speed, and this asymmetry grows with the increase in packet travel time, which damages the collision avoidance mechanism of the spatial reuse medium access control (MAC protocols for MUASN. We propose an asymmetric propagation delay-aware time division multiple access (APD-TDMA for a MUASN in which periodic data packet transmission is required for a sink node (SN. Collisions at the SN are avoided by deferring data packet transmission after reception of a beacon packet from the SN, and data packets are arrived at the SN in a packet-train manner. The time-offset, which is the time for a node to wait before the transmission of a data packet after reception of a beacon packet, is determined by estimating the propagation delay over two consecutive cycles such that the idle interval at the SN is minimized, and this time-offset is announced by the beacon packet. Simulation results demonstrate that the APD-TDMA improves the channel access delay and the channel utilization by approximately 20% and 30%, respectively, compared with those of the block time bounded TDMA under the given network conditions.
Zhang, Zhengqiu; Liu, Wenbin; Zhou, Dongming
2012-01-01
In this paper, we first discuss the existence of a unique equilibrium point of a generalized Cohen-Grossberg BAM neural networks of neutral type delays by means of the Homeomorphism theory and inequality technique. Then, by applying the existence result of an equilibrium point and constructing a Lyapunov functional, we study the global asymptotic stability of the equilibrium solution to the above Cohen-Grossberg BAM neural networks of neutral type. In our results, the hypothesis for boundedness in the existing paper, which discussed Cohen-Grossberg neural networks of neutral type on the activation functions, are removed. Finally, we give an example to demonstrate the validity of our global asymptotic stability result for the above neural networks. Copyright © 2011 Elsevier Ltd. All rights reserved.
Vibrant Energy Aware Spray and Wait Routing in Delay Tolerant Network
Directory of Open Access Journals (Sweden)
Viren G. Patel
2013-01-01
Full Text Available Delay tolerant networks (DTN are wireless networks where disconnections arise often due to the mobility of nodes, failures of energy, the low density of nodes, or when the network extends over long distances. In these situations, traditional routing protocols that have been developed for mobile ad hoc networks prove to be unsuccessful to the scope of transmitting messages between nodes. The Spray and Wait routing may achieve low routing and energy efficiency due to the blindness in the spray phase. To deal with this situation, we propose an opportunistic routing with enclosed message copies, called the Vibrant Energy aware Spray and Wait (VESW, which utilizes the information about vibrancy of node and remaining energy to allocate the number of copies between the corresponding pair nodes in the spray phase.
Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations
Burleigh, Scott C.
2008-01-01
Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.
Denials and delays of shipments in the transport of radioactive materials in Brazil
International Nuclear Information System (INIS)
Sobreira, Ana Celia F.; Bemelmans, Denise
2007-01-01
REM Industria e Comercio is a Brazilian private company which has been performing transport of radioactive material in Brazil for more than 15 years and is also experiencing this situation. In Brazil, over 50,000 shipments of radioactive materials are carried out every year, mostly for medical purposes. There are 4 airlines companies operating the domestic routes and only is currently accepting material of Class 7 (radioactive) for transport. When transporting by road, REM uses its own vehicles or hires associated cargo companies. For the sea transport, there is not a certified vessel for this kind of material in Brazil which increases the prices and makes the transport by this mode very expensive and more difficult. Reasons for denials have been identified as misinterpretation of the regulations, lack of harmonization between regulations, fear of indemnity costs for accidents, restrictive rules at ports not allowing storage of radioactive material in transit, frequent changes in modal regulations, lack of education and training of cargo handlers and the misconception of public perception concerning radiation risks. Seeking for local solutions, REM has organized meetings involving medical societies, competent authorities and carriers and has taken part on commissions for revising standards and regulations and trained cargo handling personnel as well. This paper addresses causes for delays and denials and reports identified domestic solutions. (author)
Stability Analysis and Application for Delayed Neural Networks Driven by Fractional Brownian Noise.
Zhou, Wuneng; Zhou, Xianghui; Yang, Jun; Zhou, Jun; Tong, Dongbing
2018-05-01
This paper deals with two types of the stability problem for the delayed neural networks driven by fractional Brownian noise (FBN). The existence and the uniqueness of the solution to the main system with respect to FBN are proved via fixed point theory. Based on Hilbert-Schmidt operator theory and analytic semigroup principle, the mild solution of the stochastic neural networks is obtained. By applying the stochastic analytic technique and some well-known inequalities, the asymptotic stability criteria and the exponential stability condition are established. Both numerical example and practical application for synchronization control of multiagent system are provided to illustrate the effectiveness and potential of the proposed techniques.
International Nuclear Information System (INIS)
Wang Linshan; Zhang Zhe; Wang Yangfan
2008-01-01
Some criteria for the global stochastic exponential stability of the delayed reaction-diffusion recurrent neural networks with Markovian jumping parameters are presented. The jumping parameters considered here are generated from a continuous-time discrete-state homogeneous Markov process, which are governed by a Markov process with discrete and finite state space. By employing a new Lyapunov-Krasovskii functional, a linear matrix inequality (LMI) approach is developed to establish some easy-to-test criteria of global exponential stability in the mean square for the stochastic neural networks. The criteria are computationally efficient, since they are in the forms of some linear matrix inequalities
International Nuclear Information System (INIS)
Liang Jinling; Cao Jinde
2003-01-01
In this Letter, the problems of boundedness and stability for a general class of non-autonomous recurrent neural networks with variable coefficients and time-varying delays are analyzed via employing Young inequality technique and Lyapunov method. Some simple sufficient conditions are given for boundedness and stability of the solutions for the recurrent neural networks. These results generalize and improve the previous works, and they are easy to check and apply in practice. Two illustrative examples and their numerical simulations are also given to demonstrate the effectiveness of the proposed results
Directory of Open Access Journals (Sweden)
Yongkun Li
2009-01-01
Full Text Available Based on the theory of calculus on time scales, the homeomorphism theory, Lyapunov functional method, and some analysis techniques, sufficient conditions are obtained for the existence, uniqueness, and global exponential stability of the equilibrium point of Cohen-Grossberg bidirectional associative memory (BAM neural networks with distributed delays and impulses on time scales. This is the first time applying the time-scale calculus theory to unify the discrete-time and continuous-time Cohen-Grossberg BAM neural network with impulses under the same framework.
Global stability and existence of periodic solutions of discrete delayed cellular neural networks
International Nuclear Information System (INIS)
Li Yongkun
2004-01-01
We use the continuation theorem of coincidence degree theory and Lyapunov functions to study the existence and stability of periodic solutions for the discrete cellular neural networks (CNNs) with delays xi(n+1)=xi(n)e-bi(n)h+θi(h)-bar j=1maij(n)fj(xj(n))+θi(h)-bar j=1mbij(n)fj(xj(n- τij(n)))+θi(h)Ii(n),i=1,2,...,m. We obtain some sufficient conditions to ensure that for the networks there exists a unique periodic solution, and all its solutions converge to such a periodic solution
Dynamics in a Delayed Neural Network Model of Two Neurons with Inertial Coupling
Directory of Open Access Journals (Sweden)
Changjin Xu
2012-01-01
Full Text Available A delayed neural network model of two neurons with inertial coupling is dealt with in this paper. The stability is investigated and Hopf bifurcation is demonstrated. Applying the normal form theory and the center manifold argument, we derive the explicit formulas for determining the properties of the bifurcating periodic solutions. An illustrative example is given to demonstrate the effectiveness of the obtained results.
A Realistic Framework for Delay-Tolerant Network Routing in Open Terrains with Continuous Churn
Mahendran, Veeramani; Anirudh, Sivaraman K.; Murthy, C. Siva Ram
The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary.
International Nuclear Information System (INIS)
Park, Ju H.
2007-01-01
This paper considers the robust stability analysis of cellular neural networks with discrete and distributed delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, a novel stability criterion guaranteeing the global robust convergence of the equilibrium point is derived. The criterion can be solved easily by various convex optimization algorithms. An example is given to illustrate the usefulness of our results
International Nuclear Information System (INIS)
Tu Fenghua; Liao Xiaofeng
2005-01-01
We study the problem of estimating the exponential convergence rate and exponential stability for neural networks with time-varying delay. Some criteria for exponential stability are derived by using the linear matrix inequality (LMI) approach. They are less conservative than the existing ones. Some analytical methods are employed to investigate the bounds on the interconnection matrix and activation functions so that the systems are exponentially stable
Robustness of unstable attractors in arbitrarily sized pulse-coupled networks with delay
International Nuclear Information System (INIS)
Broer, Henk; Efstathiou, Konstantinos; Subramanian, Easwar
2008-01-01
We consider arbitrarily large networks of pulse-coupled oscillators with non-zero delay where the coupling is given by the Mirollo–Strogatz function. We prove that such systems have unstable attractors (saddle periodic orbits whose stable set has non-empty interior) in an open parameter region for three or more oscillators. The evolution operator of the system can be discontinuous and we propose an improved model with continuous evolution operator
Stability and Hopf Bifurcation in a Delayed SEIRS Worm Model in Computer Network
Directory of Open Access Journals (Sweden)
Zizhen Zhang
2013-01-01
Full Text Available A delayed SEIRS epidemic model with vertical transmission in computer network is considered. Sufficient conditions for local stability of the positive equilibrium and existence of local Hopf bifurcation are obtained by analyzing distribution of the roots of the associated characteristic equation. Furthermore, the direction of the local Hopf bifurcation and the stability of the bifurcating periodic solutions are determined by using the normal form theory and center manifold theorem. Finally, a numerical example is presented to verify the theoretical analysis.
Some new results for recurrent neural networks with varying-time coefficients and delays
International Nuclear Information System (INIS)
Jiang Haijun; Teng Zhidong
2005-01-01
In this Letter, we consider the recurrent neural networks with varying-time coefficients and delays. By constructing new Lyapunov functional, introducing ingeniously many real parameters and applying the technique of Young inequality, we establish a series of criteria on the boundedness, global exponential stability and the existence of periodic solutions. In these criteria, we do not require that the response functions are differentiable, bounded and monotone nondecreasing. Some previous works are improved and extended
Almost periodic cellular neural networks with neutral-type proportional delays
Xiao, Songlin
2018-03-01
This paper presents a new result on the existence, uniqueness and generalised exponential stability of almost periodic solutions for cellular neural networks with neutral-type proportional delays and D operator. Based on some novel differential inequality techniques, a testable condition is derived to ensure that all the state trajectories of the system converge to an almost periodic solution with a positive exponential convergence rate. The effectiveness of the obtained result is illustrated by a numerical example.
Dynamics of a class of cellular neural networks with time-varying delays
International Nuclear Information System (INIS)
Huang Lihong; Huang Chuangxia; Liu Bingwen
2005-01-01
Employing Brouwer's fixed point theorem, matrix theory, a continuation theorem of the coincidence degree and inequality analysis, the authors make a further investigation of a class of cellular neural networks with delays (DCNNs) in this Letter. A family of sufficient conditions are given for checking global exponential stability and the existence of periodic solutions of DCNNs. These results have important leading significance in the design and applications of globally stable DCNNs and periodic oscillatory DCNNs. Our results extend and improve some earlier publications
Global exponential stability of fuzzy BAM neural networks with time-varying delays
International Nuclear Information System (INIS)
Zhang Qianhong; Luo Wei
2009-01-01
In this paper, a class of fuzzy bidirectional associated memory (BAM) neural networks with time-varying delays are studied. Employing fixed point theorem, matrix theory and inequality analysis, some sufficient conditions are established for the existence, uniqueness and global exponential stability of equilibrium point. The sufficient conditions are easy to verify at pattern recognition and automatic control. Finally, an example is given to show feasibility and effectiveness of our results.
Global stability of stochastic high-order neural networks with discrete and distributed delays
International Nuclear Information System (INIS)
Wang Zidong; Fang Jianan; Liu Xiaohui
2008-01-01
High-order neural networks can be considered as an expansion of Hopfield neural networks, and have stronger approximation property, faster convergence rate, greater storage capacity, and higher fault tolerance than lower-order neural networks. In this paper, the global asymptotic stability analysis problem is considered for a class of stochastic high-order neural networks with discrete and distributed time-delays. Based on an Lyapunov-Krasovskii functional and the stochastic stability analysis theory, several sufficient conditions are derived, which guarantee the global asymptotic convergence of the equilibrium point in the mean square. It is shown that the stochastic high-order delayed neural networks under consideration are globally asymptotically stable in the mean square if two linear matrix inequalities (LMIs) are feasible, where the feasibility of LMIs can be readily checked by the Matlab LMI toolbox. It is also shown that the main results in this paper cover some recently published works. A numerical example is given to demonstrate the usefulness of the proposed global stability criteria
Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks
Directory of Open Access Journals (Sweden)
Zhenjie Ma
2018-01-01
Full Text Available Effective data access is one of the major challenges in Delay Tolerant Networks (DTNs that are characterized by intermittent network connectivity and unpredictable node mobility. Currently, different data caching schemes have been proposed to improve the performance of data access in DTNs. However, most existing data caching schemes perform poorly due to the lack of global network state information and the changing network topology in DTNs. In this paper, we propose a novel data caching scheme based on cooperative caching in DTNs, aiming at improving the successful rate of data access and reducing the data access delay. In the proposed scheme, learning automata are utilized to select a set of caching nodes as Caching Node Set (CNS in DTNs. Unlike the existing caching schemes failing to address the challenging characteristics of DTNs, our scheme is designed to automatically self-adjust to the changing network topology through the well-designed voting and updating processes. The proposed scheme improves the overall performance of data access in DTNs compared with the former caching schemes. The simulations verify the feasibility of our scheme and the improvements in performance.
Stochastic Wilson–Cowan models of neuronal network dynamics with memory and delay
International Nuclear Information System (INIS)
Goychuk, Igor; Goychuk, Andriy
2015-01-01
We consider a simple Markovian class of the stochastic Wilson–Cowan type models of neuronal network dynamics, which incorporates stochastic delay caused by the existence of a refractory period of neurons. From the point of view of the dynamics of the individual elements, we are dealing with a network of non-Markovian stochastic two-state oscillators with memory, which are coupled globally in a mean-field fashion. This interrelation of a higher-dimensional Markovian and lower-dimensional non-Markovian dynamics is discussed in its relevance to the general problem of the network dynamics of complex elements possessing memory. The simplest model of this class is provided by a three-state Markovian neuron with one refractory state, which causes firing delay with an exponentially decaying memory within the two-state reduced model. This basic model is used to study critical avalanche dynamics (the noise sustained criticality) in a balanced feedforward network consisting of the excitatory and inhibitory neurons. Such avalanches emerge due to the network size dependent noise (mesoscopic noise). Numerical simulations reveal an intermediate power law in the distribution of avalanche sizes with the critical exponent around −1.16. We show that this power law is robust upon a variation of the refractory time over several orders of magnitude. However, the avalanche time distribution is biexponential. It does not reflect any genuine power law dependence. (paper)
Stomach-brain synchrony reveals a novel, delayed-connectivity resting-state network in humans.
Rebollo, Ignacio; Devauchelle, Anne-Dominique; Béranger, Benoît; Tallon-Baudry, Catherine
2018-03-21
Resting-state networks offer a unique window into the brain's functional architecture, but their characterization remains limited to instantaneous connectivity thus far. Here, we describe a novel resting-state network based on the delayed connectivity between the brain and the slow electrical rhythm (0.05 Hz) generated in the stomach. The gastric network cuts across classical resting-state networks with partial overlap with autonomic regulation areas. This network is composed of regions with convergent functional properties involved in mapping bodily space through touch, action or vision, as well as mapping external space in bodily coordinates. The network is characterized by a precise temporal sequence of activations within a gastric cycle, beginning with somato-motor cortices and ending with the extrastriate body area and dorsal precuneus. Our results demonstrate that canonical resting-state networks based on instantaneous connectivity represent only one of the possible partitions of the brain into coherent networks based on temporal dynamics. © 2018, Rebollo et al.
A lossy graph model for delay reduction in generalized instantly decodable network coding
Douik, Ahmed S.
2014-06-01
The problem of minimizing the decoding delay in Generalized instantly decodable network coding (G-IDNC) for both perfect and lossy feedback scenarios is formulated as a maximum weight clique problem over the G-IDNC graph in. In this letter, we introduce a new lossy G-IDNC graph (LG-IDNC) model to further minimize the decoding delay in lossy feedback scenarios. Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations, arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G-IDNC graphs through extensive simulations. Numerical results show that our new LG-IDNC graph formulation outperforms the G-IDNC graph formulation in all lossy feedback situations and achieves significant improvement in the decoding delay especially when the feedback erasure probability is higher than the packet erasure probability. © 2012 IEEE.
Delay-dependent asymptotic stability of mobile ad-hoc networks: A descriptor system approach
International Nuclear Information System (INIS)
Yang Juan; Yang Dan; Zhang Xiao-Hong; Huang Bin; Luo Jian-Lu
2014-01-01
In order to analyze the capacity stability of the time-varying-propagation and delay-dependent of mobile ad-hoc networks (MANETs), in this paper, a novel approach is proposed to explore the capacity asymptotic stability for the delay-dependent of MANETs based on non-cooperative game theory, where the delay-dependent conditions are explicitly taken into consideration. This approach is based on the Lyapunov—Krasovskii stability theory for functional differential equations and the linear matrix inequality (LMI) technique. A corresponding Lyapunov—Krasovskii functional is introduced for the stability analysis of this system with use of the descriptor and “neutral-type” model transformation without producing any additional dynamics. The delay-dependent stability criteria are derived for this system. Conditions are given in terms of linear matrix inequalities, and for the first time referred to neutral systems with the time-varying propagation and delay-dependent stability for capacity analysis of MANETs. The proposed criteria are less conservative since they are based on an equivalent model transformation. Furthermore, we also provide an effective and efficient iterative algorithm to solve the constrained stability control model. Simulation experiments have verified the effectiveness and efficiency of our algorithm. (general)
Directory of Open Access Journals (Sweden)
Huaiqin Wu
2012-01-01
Full Text Available By combing the theories of the switched systems and the interval neural networks, the mathematics model of the switched interval neural networks with discrete and distributed time-varying delays of neural type is presented. A set of the interval parameter uncertainty neural networks with discrete and distributed time-varying delays of neural type are used as the individual subsystem, and an arbitrary switching rule is assumed to coordinate the switching between these networks. By applying the augmented Lyapunov-Krasovskii functional approach and linear matrix inequality (LMI techniques, a delay-dependent criterion is achieved to ensure to such switched interval neural networks to be globally asymptotically robustly stable in terms of LMIs. The unknown gain matrix is determined by solving this delay-dependent LMIs. Finally, an illustrative example is given to demonstrate the validity of the theoretical results.
Zhang, Wei; Huang, Tingwen; He, Xing; Li, Chuandong
2017-11-01
In this study, we investigate the global exponential stability of inertial memristor-based neural networks with impulses and time-varying delays. We construct inertial memristor-based neural networks based on the characteristics of the inertial neural networks and memristor. Impulses with and without delays are considered when modeling the inertial neural networks simultaneously, which are of great practical significance in the current study. Some sufficient conditions are derived under the framework of the Lyapunov stability method, as well as an extended Halanay differential inequality and a new delay impulsive differential inequality, which depend on impulses with and without delays, in order to guarantee the global exponential stability of the inertial memristor-based neural networks. Finally, two numerical examples are provided to illustrate the efficiency of the proposed methods. Copyright © 2017 Elsevier Ltd. All rights reserved.
Information services in social networked transportation : governance and ITS.
2014-06-01
The purpose of this research seeks to understand the functions and the benefits of social : networked transportation (SNT), the processes that make SNT possible, and the institutional : innovations needed to facilitate those processes. First, this re...
Optimal traffic control in highway transportation networks using linear programming
Li, Yanning
2014-06-01
This article presents a framework for the optimal control of boundary flows on transportation networks. The state of the system is modeled by a first order scalar conservation law (Lighthill-Whitham-Richards PDE). Based on an equivalent formulation of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can be extended to an arbitrary transportation network, preserving linear constraints. Unlike previously investigated transportation network control schemes, this framework leverages the intrinsic properties of the Halmilton-Jacobi equation, and does not require any discretization or boolean variables on the link. Hence this framework is very computational efficient and provides the globally optimal solution. The feasibility of this framework is illustrated by an on-ramp metering control example.
On the topology of optical transport networks
International Nuclear Information System (INIS)
Cardenas, J P; Santiago, A; Losada, J C; Benito, R M; Mouronte, M L
2010-01-01
Synchronous Digital Hierarchy (SDH) is the standard technology for information transmission in broadband optical networks. Unlike systems with unplanned growth, such as those of natural origin or the Internet network, the SDH systems are strictly planned as rings, meshes, stars or tree-branches structures designed to connect different equipments. In spite of that, we have found that the SDH network operated by Telefonica in Spain shares remarkable topological properties with other real complex networks as a product of its evolution since 1992. In fact, we have found power-law scaling in the degree distribution (N·P(k) = k -γ ) and small-world networks properties. The complexity found in SDH systems was reproduced by two models of complex networks, one of them considers real planning directives that take into account geographical and technological variables and the other one is based in the compatibility among SDH equipments.
Nolan, Brodie; Tien, Homer; Sawadsky, Bruce; Rizoli, Sandro; McFarlan, Amanda; Phillips, Andrea; Ackery, Alun
2017-01-01
Helicopter emergency medical services (HEMS) have become an engrained component of trauma systems. In Ontario, transportation for trauma patients is through one of three ways: scene call, modified scene call, or interfacility transfer. We hypothesize that differences exist between these types of transports in both patient demographics and patient outcomes. This study compares the characteristics of patients transported by each of these methods to two level 1 trauma centers and assesses for any impact on morbidity or mortality. As a secondary outcome reasons for delay were identified. A local trauma registry was used to identify and abstract data for all patients transported to two trauma centers by HEMS over a 36-month period. Further chart abstraction using the HEMS patient care reports was done to identify causes of delay during HEMS transport. During the study period HEMS transferred a total of 911 patients of which 139 were scene calls, 333 were modified scene calls and 439 were interfacility transfers. Scene calls had more patients with an ISS of less than 15 and had more patients discharged home from the ED. Modified scene calls had more patients with an ISS greater than 25. The most common delays that were considered modifiable included the sending physician doing a procedure, waiting to meet a land EMS crew, delays for diagnostic imaging and confirming disposition or destination. Differences exist between the types of transports done by HEMS for trauma patients. Many identified reasons for delay to HEMS transport are modifiable and have practical solutions. Future research should focus on solutions to identified delays to HEMS transport. Key words: helicopter emergency medical services; trauma; prehospital care; delays.
Use of artificial neural networks for transport energy demand modeling
International Nuclear Information System (INIS)
Murat, Yetis Sazi; Ceylan, Halim
2006-01-01
The paper illustrates an artificial neural network (ANN) approach based on supervised neural networks for the transport energy demand forecasting using socio-economic and transport related indicators. The ANN transport energy demand model is developed. The actual forecast is obtained using a feed forward neural network, trained with back propagation algorithm. In order to investigate the influence of socio-economic indicators on the transport energy demand, the ANN is analyzed based on gross national product (GNP), population and the total annual average veh-km along with historical energy data available from 1970 to 2001. Comparing model predictions with energy data in testing period performs the model validation. The projections are made with two scenarios. It is obtained that the ANN reflects the fluctuation in historical data for both dependent and independent variables. The results obtained bear out the suitability of the adopted methodology for the transport energy-forecasting problem
Receding horizon control of hybrid linear delayed systems: Application to sewer networks
Joseph-Duran, Bernat; Ocampo-Martinez, Carlos; Cembrano, Gabriela
2013-01-01
A control-oriented hybrid linear model for water transport in sewer networks is proposed as a suitable framework for the computation of real-time controllers for the minimization of flooding in presence of heavy-rain events. The model is based on individual network elements (sewers, gates, weirs and tanks) and does not rely on topological simplifications, thus providing a better description of the hydrological and hydraulic phenomena than in similar works. Using a generic form of a hybrid lin...
Robust Synchronization in an E/I Network with Medium Synaptic Delay and High Level of Heterogeneity
International Nuclear Information System (INIS)
Han Fang; Wang Zhi-Jie; Gong Tao; Fan Hong
2015-01-01
It is known that both excitatory and inhibitory neuronal networks can achieve robust synchronization only under certain conditions, such as long synaptic delay or low level of heterogeneity. In this work, robust synchronization can be found in an excitatory/inhibitory (E/I) neuronal network with medium synaptic delay and high level of heterogeneity, which often occurs in real neuronal networks. Two effects of post-synaptic potentials (PSP) to network synchronization are presented, and the synaptic contribution of excitatory and inhibitory neurons to robust synchronization in this E/I network is investigated. It is found that both excitatory and inhibitory neurons may contribute to robust synchronization in E/I networks, especially the excitatory PSP has a more positive effect on synchronization in E/I networks than that in excitatory networks. This may explain the strong robustness of synchronization in E/I neuronal networks. (paper)
Lxr-driven enterocyte lipid droplet formation delays transport of ingested lipids.
Cruz-Garcia, Lourdes; Schlegel, Amnon
2014-09-01
Liver X receptors (Lxrs) are master regulators of cholesterol catabolism, driving the elimination of cholesterol from the periphery to the lumen of the intestine. Development of pharmacological agents to activate Lxrs has been hindered by synthetic Lxr agonists' induction of hepatic lipogenesis and hypertriglyceridemia. Elucidating the function of Lxrs in regulating enterocyte lipid handling might identify novel aspects of lipid metabolism that are pharmacologically amenable. We took a genetic approach centered on the single Lxr gene nr1h3 in zebrafish to study the role of Lxr in enterocyte lipid metabolism. Loss of nr1h3 function causes anticipated gene regulatory changes and cholesterol intolerance, collectively reflecting high evolutionary conservation of zebrafish Lxra function. Intestinal nr1h3 activation delays transport of absorbed neutral lipids, with accumulation of neutral lipids in enterocyte cytoplasmic droplets. This delay in transport of ingested neutral lipids protects animals from hypercholesterolemia and hepatic steatosis induced by a high-fat diet. On a gene regulatory level, Lxra induces expression of acsl3a, which encodes acyl-CoA synthetase long-chain family member 3a, a lipid droplet-anchored protein that directs fatty acyl chains into lipids. Forced overexpression of acls3a in enterocytes delays, in part, the appearance of neutral lipids in the vasculature of zebrafish larvae. Activation of Lxr in the intestine cell-autonomously regulates the rate of delivery of absorbed lipids by inducting a temporary lipid intestinal droplet storage depot. Copyright © 2014 by the American Society for Biochemistry and Molecular Biology, Inc.
International Nuclear Information System (INIS)
Apperson, C.E. Jr.
1981-01-01
A method is presented for studying the influence of fission product transpot on delayed neutron precursors and decay heat sources during Liquid Metal Fast Breeder Reactor (LMFBR) unprotected accidents. The model represents the LMFBR core as a closed homogeneous cell. Thermodynamic phase equilibrium theory is used to predict fission product mobility. Reactor kinetics behavior is analyzed by an extension of point kinetics theory. Group dependent delayed neutron precursor and decay heat source retention factors, which represent the fraction of each group retained in the fuel, are developed to link the kinetics and thermodynamics analysis. Application of the method to a highly simplified model of an unprotected loss-of-flow accident shows a time delay on the order of 10 ms is introduced in the predisassembly power history if fission product motion is considered when compared to the traditional transient solution. The post-transient influence of fission product transport calculated by the present model is a 24 percent reduction in the decay heat level in the fuel material which is similar to traditional approximations. Isotopes of the noble gases, Kr and Xe, and the elements I and Br are shown to be very mobile and are responsible for a major part of the observed effects. Isotopes of the elements Cs, Se, Rb, and Te were found to be moderately mobile and contribute to a lesser extent to the observed phenomena. These results obtained from the application of the described model confirm the initial hypothesis that sufficient fission product transport can occur to influence a transient. For these reasons, it is concluded that extension of this model into a multi-cell transient analysis code is warranted
Flexible Transport Network Expansion via Open WDM Interfaces
DEFF Research Database (Denmark)
Fagertun, Anna Manolova; Skjoldstrup, Bjarke
2013-01-01
This paper presents a successful test-bed implementation of a multi-vendor transport network interconnection via open WDM interfaces. The concept of applying Alien Wavelengths (AWs) for network expansion was successfully illustrated via deployment of multi-domain/multi-vendor end-to-end OTN servi...
Cai, Zuowei; Huang, Lihong; Guo, Zhenyuan; Zhang, Lingling; Wan, Xuting
2015-08-01
This paper is concerned with the periodic synchronization problem for a general class of delayed neural networks (DNNs) with discontinuous neuron activation. One of the purposes is to analyze the problem of periodic orbits. To do so, we introduce new tools including inequality techniques and Kakutani's fixed point theorem of set-valued maps to derive the existence of periodic solution. Another purpose is to design a switching state-feedback control for realizing global exponential synchronization of the drive-response network system with periodic coefficients. Unlike the previous works on periodic synchronization of neural network, both the neuron activations and controllers in this paper are allowed to be discontinuous. Moreover, owing to the occurrence of delays in neuron signal, the neural network model is described by the functional differential equation. So we introduce extended Filippov-framework to deal with the basic issues of solutions for discontinuous DNNs. Finally, two examples and simulation experiments are given to illustrate the proposed method and main results which have an important instructional significance in the design of periodic synchronized DNNs circuits involving discontinuous or switching factors. Copyright © 2015 Elsevier Ltd. All rights reserved.
Predicting geomagnetic storms from solar-wind data using time-delay neural networks
Directory of Open Access Journals (Sweden)
H. Gleisner
1996-07-01
Full Text Available We have used time-delay feed-forward neural networks to compute the geomagnetic-activity index Dst one hour ahead from a temporal sequence of solar-wind data. The input data include solar-wind density n, velocity V and the southward component Bz of the interplanetary magnetic field. Dst is not included in the input data. The networks implement an explicit functional relationship between the solar wind and the geomagnetic disturbance, including both direct and time-delayed non-linear relations. In this study we especially consider the influence of varying the temporal size of the input-data sequence. The networks are trained on data covering 6600 h, and tested on data covering 2100 h. It is found that the initial and main phases of geomagnetic storms are well predicted, almost independent of the length of the input-data sequence. However, to predict the recovery phase, we have to use up to 20 h of solar-wind input data. The recovery phase is mainly governed by the ring-current loss processes, and is very much dependent on the ring-current history, and thus also the solar-wind history. With due consideration of the time history when optimizing the networks, we can reproduce 84% of the Dst variance.
Network simulation of nonstationary ionic transport through liquid junctions
International Nuclear Information System (INIS)
Castilla, J.; Horno, J.
1993-01-01
Nonstationary ionic transport across the liquid junctions has been studied using Network Thermodynamics. A network model for the time-dependent Nernst-Plack-Poisson system of equation is proposed. With this network model and the electrical circuit simulation program PSPICE, the concentrations, charge density, and electrical potentials, at short times, have been simulated for the binary system NaCl/NaCl. (Author) 13 refs
Directory of Open Access Journals (Sweden)
Ahmed Alkhayyat
2015-01-01
Full Text Available We proposed a multiple relay selection protocol for decentralized wireless networks. The proposed relays selection protocol aims to address three issues: (1 selecting relays within the coverage area of the source and destination to ensure that the relays are positioned one hop away from the destination, (2 ensuring that the best node (best relays with less distance and attenuation from the destination access the channel first, and (3 ensuring that the proposed relays selection is collision-free. Our analysis also considers three important characteristics of decentralized wireless networks that are directly affected by cooperation: delay, connectivity, and throughput. The main goal of this paper is to demonstrate that improving connectivity and increasing number of relays reduce the throughput of cooperative decentralized wireless networks; consequently, a trade-off equation has been derived.
An Incremental Time-delay Neural Network for Dynamical Recurrent Associative Memory
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
An incremental time-delay neural network based on synapse growth, which is suitable for dynamic control and learning of autonomous robots, is proposed to improve the learning and retrieving performance of dynamical recurrent associative memory architecture. The model allows steady and continuous establishment of associative memory for spatio-temporal regularities and time series in discrete sequence of inputs. The inserted hidden units can be taken as the long-term memories that expand the capacity of network and sometimes may fade away under certain condition. Preliminary experiment has shown that this incremental network may be a promising approach to endow autonomous robots with the ability of adapting to new data without destroying the learned patterns. The system also benefits from its potential chaos character for emergence.
Delay/Disruption Tolerant Networks (DTN): Testing and Demonstration for Lunar Surface Applications
2009-01-01
This slide presentation reviews the testing of the Delay/Disruption Tolerant Network (DTN) designed for use with Lunar Surface applications. This is being done through the DTN experimental Network (DEN), that permit access and testing by other NASA centers, DTN team members and protocol developers. The objective of this work is to demonstrate DTN for high return applications in lunar scenarios, provide DEN connectivity with analogs of Constellation elements, emulators, and other resources from DTN Team Members, serve as a wireless communications staging ground for remote analog excursions and enable testing of detailed communication scenarios and evaluation of network performance. Three scenarios for DTN on the Lunar surface are reviewed: Motion imagery, Voice and sensor telemetry, and Navigation telemetry.
H∞ state estimation of stochastic memristor-based neural networks with time-varying delays.
Bao, Haibo; Cao, Jinde; Kurths, Jürgen; Alsaedi, Ahmed; Ahmad, Bashir
2018-03-01
This paper addresses the problem of H ∞ state estimation for a class of stochastic memristor-based neural networks with time-varying delays. Under the framework of Filippov solution, the stochastic memristor-based neural networks are transformed into systems with interval parameters. The present paper is the first to investigate the H ∞ state estimation problem for continuous-time Itô-type stochastic memristor-based neural networks. By means of Lyapunov functionals and some stochastic technique, sufficient conditions are derived to ensure that the estimation error system is asymptotically stable in the mean square with a prescribed H ∞ performance. An explicit expression of the state estimator gain is given in terms of linear matrix inequalities (LMIs). Compared with other results, our results reduce control gain and control cost effectively. Finally, numerical simulations are provided to demonstrate the efficiency of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.
Multistability and instability analysis of recurrent neural networks with time-varying delays.
Zhang, Fanghai; Zeng, Zhigang
2018-01-01
This paper provides new theoretical results on the multistability and instability analysis of recurrent neural networks with time-varying delays. It is shown that such n-neuronal recurrent neural networks have exactly [Formula: see text] equilibria, [Formula: see text] of which are locally exponentially stable and the others are unstable, where k 0 is a nonnegative integer such that k 0 ≤n. By using the combination method of two different divisions, recurrent neural networks can possess more dynamic properties. This method improves and extends the existing results in the literature. Finally, one numerical example is provided to show the superiority and effectiveness of the presented results. Copyright © 2017 Elsevier Ltd. All rights reserved.
Pinning synchronization of memristor-based neural networks with time-varying delays.
Yang, Zhanyu; Luo, Biao; Liu, Derong; Li, Yueheng
2017-09-01
In this paper, the synchronization of memristor-based neural networks with time-varying delays via pinning control is investigated. A novel pinning method is introduced to synchronize two memristor-based neural networks which denote drive system and response system, respectively. The dynamics are studied by theories of differential inclusions and nonsmooth analysis. In addition, some sufficient conditions are derived to guarantee asymptotic synchronization and exponential synchronization of memristor-based neural networks via the presented pinning control. Furthermore, some improvements about the proposed control method are also discussed in this paper. Finally, the effectiveness of the obtained results is demonstrated by numerical simulations. Copyright © 2017 Elsevier Ltd. All rights reserved.
Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks.
Li, Xujing; Liu, Anfeng; Xie, Mande; Xiong, Neal N; Zeng, Zhiwen; Cai, Zhiping
2018-04-16
The quality of service (QoS) regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs). Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold ( N t ) or the waiting time is equal to the aggregation timer ( T t ), data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR) scheme are the following: (a) the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b) An improved AAR scheme is proposed to improve the QoS. The aggregation deadline ( T t ) and the aggregation threshold ( N t ) are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of T t and N t to reduce delay, and the nodes near the sink are set to a large value of T t and N t to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases energy
Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Xujing Li
2018-04-01
Full Text Available The quality of service (QoS regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs. Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold ( N t or the waiting time is equal to the aggregation timer ( T t , data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR scheme are the following: (a the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b An improved AAR scheme is proposed to improve the QoS. The aggregation deadline ( T t and the aggregation threshold ( N t are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of T t and N t to reduce delay, and the nodes near the sink are set to a large value of T t and N t to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases
LOCATING HUBS IN TRANSPORT NETWORKS: AN ARTIFICIAL INTELLIGENCE APPROACH
Dušan Teodorović; Milica Šelmić; Ivana Vukićević
2014-01-01
Hub facilities serve as switching and transshipment points in transportation and communication networks as well as in logistic systems. Hub networks have an influence on flows on the hub-to-hub links and ensure benefit from economies of scale in inter-hub transportation. The key factors for designing a successful hub-and-spoke network are to determine the optimal number of hubs, to properly locate hubs, and to allocate the non-hubs to the hubs. This paper presents the model to determine the l...
Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua
2011-01-01
Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.
Holbrook, Mark; Pitts, Robert Lee; Gifford, Kevin K.; Jenkins, Andrew; Kuzminsky, Sebastian
2010-01-01
The International Space Station (ISS) is in an operational configuration and nearing final assembly. With its maturity and diverse payloads onboard, the opportunity exists to extend the orbital lab into a facility to exercise and demonstrate Delay/Disruption Tolerant Networking (DTN). DTN is an end-to-end network service providing communications through environments characterized by intermittent connectivity, variable delays, high bit error rates, asymmetric links and simplex links. The DTN protocols, also known as bundle protocols, provide a store-and-forward capability to accommodate end-to-end network services. Key capabilities of the bundling protocols include: the Ability to cope with intermittent connectivity, the Ability to take advantage of scheduled and opportunistic connectivity (in addition to always up connectivity), Custody Transfer, and end-to-end security. Colorado University at Boulder and the Huntsville Operational Support Center (HOSC) have been developing a DTN capability utilizing the Commercial Generic Bioprocessing Apparatus (CGBA) payload resources onboard the ISS, at the Boulder Payload Operations Center (POC) and at the HOSC. The DTN capability is in parallel with and is designed to augment current capabilities. The architecture consists of DTN endpoint nodes on the ISS and at the Boulder POC, and a DTN node at the HOSC. The DTN network is composed of two implementations; the Interplanetary Overlay Network (ION) and the open source DTN2 implementation. This paper presents the architecture, implementation, and lessons learned. By being able to handle the types of environments described above, the DTN technology will be instrumental in extending networks into deep space to support future missions to other planets and other solar system points of interest. Thus, this paper also discusses how this technology will be applicable to these types of deep space exploration missions.
A Case Study of IPv6 Network Performance: Packet Delay, Loss, and Reordering
Directory of Open Access Journals (Sweden)
Fuliang Li
2017-01-01
Full Text Available Internet Protocol (IP is used to identify and locate computers on the Internet. Currently, IPv4 still routes most Internet traffic. However, with the exhausting of IPv4 addresses, the transition to IPv6 is imminent, because, as the successor of IPv4, IPv6 can provide a larger available address space. Existing studies have addressed the notion that IPv6-centric next generation networks are widely deployed and applied. In order to gain a deep understanding of IPv6, this paper revisits several critical IPv6 performance metrics. Our extensive measurement shows that packet delay and loss rate of IPv6 are similar to IPv4 when the AS-level paths are roughly the same. Specifically, when the link utilization exceeds a threshold, for example, 0.83 in our study, variation of packet delay presents a similar pattern with the variation of link utilization. If packet delay of a path is large, packet-loss rate of that path is more likely to fluctuate. In addition, we conduct a first-ever analysis of packet reordering in IPv6 world. Few IPv6 probe packets are out-of-order and the reordering rate is 2.3⁎10-6, which is much lower than that of 0.79% in IPv4 world. Our analysis consolidates an experimental basis for operators and researchers of IPv6 networks.
Exponential stability of delayed recurrent neural networks with Markovian jumping parameters
International Nuclear Information System (INIS)
Wang Zidong; Liu Yurong; Yu Li; Liu Xiaohui
2006-01-01
In this Letter, the global exponential stability analysis problem is considered for a class of recurrent neural networks (RNNs) with time delays and Markovian jumping parameters. The jumping parameters considered here are generated from a continuous-time discrete-state homogeneous Markov process, which are governed by a Markov process with discrete and finite state space. The purpose of the problem addressed is to derive some easy-to-test conditions such that the dynamics of the neural network is stochastically exponentially stable in the mean square, independent of the time delay. By employing a new Lyapunov-Krasovskii functional, a linear matrix inequality (LMI) approach is developed to establish the desired sufficient conditions, and therefore the global exponential stability in the mean square for the delayed RNNs can be easily checked by utilizing the numerically efficient Matlab LMI toolbox, and no tuning of parameters is required. A numerical example is exploited to show the usefulness of the derived LMI-based stability conditions
Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding
Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.
2013-01-01
In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.
Xue, Xiaoxiao; Xuan, Yi; Bao, Chengying; Li, Shangyuan; Zheng, Xiaoping; Zhou, Bingkun; Qi, Minghao; Weiner, Andrew M.
2018-06-01
Microwave phased array antennas (PAAs) are very attractive to defense applications and high-speed wireless communications for their abilities of fast beam scanning and complex beam pattern control. However, traditional PAAs based on phase shifters suffer from the beam-squint problem and have limited bandwidths. True-time-delay (TTD) beamforming based on low-loss photonic delay lines can solve this problem. But it is still quite challenging to build large-scale photonic TTD beamformers due to their high hardware complexity. In this paper, we demonstrate a photonic TTD beamforming network based on a miniature microresonator frequency comb (microcomb) source and dispersive time delay. A method incorporating optical phase modulation and programmable spectral shaping is proposed for positive and negative apodization weighting to achieve arbitrary microwave beam pattern control. The experimentally demonstrated TTD beamforming network can support a PAA with 21 elements. The microwave frequency range is $\\mathbf{8\\sim20\\ {GHz}}$, and the beam scanning range is $\\mathbf{\\pm 60.2^\\circ}$. Detailed measurements of the microwave amplitudes and phases are performed. The beamforming performances of Gaussian, rectangular beams and beam notch steering are evaluated through simulations by assuming a uniform radiating antenna array. The scheme can potentially support larger PAAs with hundreds of elements by increasing the number of comb lines with broadband microcomb generation.
Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding
Douik, Ahmed S.
2013-10-01
In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.
Social network analysis of sustainable transportation organizations.
2012-07-15
Studying how organizations communicate with each other can provide important insights into the influence, and policy success of different types of organizations. This study examines the communication networks of 121 organizations promoting sustainabl...
Douik, Ahmed S.
2015-11-05
This paper considers the multicast decoding delay reduction problem for generalized instantly decodable network coding (G-IDNC) over persistent erasure channels with feedback imperfections. The feedback scenario discussed is the most general situation in which the sender does not always receive acknowledgments from the receivers after each transmission and the feedback communications are subject to loss. The decoding delay increment expressions are derived and employed to express the decoding delay reduction problem as a maximum weight clique problem in the G-IDNC graph. This paper provides a theoretical analysis of the expected decoding delay increase at each time instant. Problem formulations in simpler channel and feedback models are shown to be special cases of the proposed generalized formulation. Since finding the optimal solution to the problem is known to be NP-hard, a suboptimal greedy algorithm is designed and compared with blind approaches proposed in the literature. Through extensive simulations, the proposed algorithm is shown to outperform the blind methods in all situations and to achieve significant improvement, particularly for high time-correlated channels.