In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...

As digital loop carrier (DLC) architectures carry fiber deeper and deeper into the local loop to satisfy everincreasing bandwidth demands, techniques and costs for powering these architectures are sometimes ignored. Here, we examine the costs associated with delivering power to nodes where optical-to-electric conversions (O/Es) occur, sometimes referred to as optical network units (ONUs), as di...

The rise in multicast implementations has seen with it an increased support for fast failure recovery from link and node failures. Most recovery mechanisms augment additional services to existing protocols causing excessive overhead, and these modifications are predominantly protocol-specific. In this paper, we develop a multicast failure recovery mechanism that constructs protocol independent ...

We consider the relation of symmetries and subspace controllability for spin1 2 networks with XXZ couplings, subject to perturbation of a single node by a local potential (Z-control). The Hamiltonians for such networks decompose into excitation subspaces. Focusing on the single excitation subspace, it is shown for single-node Z-controls that external symmetries are characterized by eigenstates ...

This paper presents a conjectural variation equilibrium model of a single-node electricity market. The distinctive modeling feature introduced in this paper is the effect of congestion between areas on generators’ behavior. The results show that if there is a congestion between two areas, generators valued differently the production of each area, and give more importance to the importing area.

In this paper, we focus on a particular version of the Dynamic Service Network Design (DSND) problem, namely the case of a single-terminal that dispatches services to a number of customers and other terminals. We present a time-dependent, stochastic formulation that aims to optimize the problem over a given planning horizon, and propose a solution approach based on dynamic programming principle...

Delays are ubiquitous in biological systems, ranging from genetic regulatory networks and synaptic conductances, to predator/pray population interactions. The evidence is mounting, not only to the presence of delays as physical constraints in signal propagation speed, but also to their functional role in providing dynamical diversity to the systems that comprise them. The latter observation in ...

Novel methods for information processing are highly desired in our information-driven society. Inspired by the brain's ability to process information, the recently introduced paradigm known as 'reservoir computing' shows that complex networks can efficiently perform computation. Here we introduce a novel architecture that reduces the usually required large number of elements to a single nonline...

The issue of providing deterministic delay guarantee using the Dynamic Priority Queueing (DPQ) scheme to support multiple connections at a single server queue is investigated. The novelty of our approach lies in that the delay bound is derived without making any assumptions about the traac characteristics of the connections. We rst show that the DPQ server provides a delay bound comparable to t...

Localization of nodes in a sensor network is essential for the following two reasons: (i) to know the location of a node reporting the occurrence of an event, and (ii) to initiate a prompt action whenever necessary. Different localization techniques have been proposed in the literature. Most of these techniques use three location aware nodes for localization of an unknown node. Moreover, the lo...