In this paper, the relation between synchronization and control of chaotic nodes connected through a time–varying network is discussed. In particular, the effects of pinning control on a set of moving chaotic agents are investigated showing that the role of system parameters, like agent density, is critical in order to reach the synchronous behavior and also to control the whole network by pinn...

An available bit rate (ABR) service allows applications to access a time-varying network capacity. In a basic ABR service, the available network capacity is divided \fairly" amongst active connections, without regard to the utility that each application derives from the bandwidth allocation. The goal of this paper is to improve both the global and individual utility obtained by applications usi...

Many exist studies always use Markov decision processes (MDPs) in modeling optimal route choice in stochastic, time-varying networks. However, taking many variable traffic data and transforming them into optimal route decision is a computational challenge by employing MDPs in real transportation networks. In this paper we model finite horizon MDPs using directed hypergraphs. It is shown that th...

the large number of applications manages time varying data. existing databasetechnology seldom supports temporal database, tdb, according to time aspects.these intrinsic temporal database applications rely on such database which storesand retrieves time referenced data. moreover, applications need to be managed oncommon data items access simultaneously and to be precluded from inconsistencyas s...

evolving models have found applications in many real world systems. in this paper, potentials of the evolving linear models (elms) in tracking control design for nonlinear variable structure systems are introduced. at first, an elm is introduced as a dynamic single input, single output (siso) linear model whose parameters as well as dynamic orders of input and output signals can change through ...

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a p...

Time-varying networks describe a wide array of systems whose constituents and interactions evolve over time. They are defined by an ordered stream of interactions between nodes, yet they are often represented in terms of a sequence of static networks, each aggregating all edges and nodes present in a time interval of size Δt. In this work we quantify the impact of an arbitrary Δt on the descrip...

Different graph generalizations have been recently used in an ad-hoc manner to represent multilayer networks, i.e. systems formed by distinct layers where each layer can be seen as a network. Similar constructions have also been used to represent time-varying networks. We introduce the concept of MultiAspect Graph (MAG) as a graph generalization that we prove to be isomorphic to a directed grap...