Browsing by Subject "Topology"
Now showing items 1-20 of 47
-
Article
Computing on a partially eponymous ring
(2006)We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all ...
-
Conference Object
Crest line extraction from point clouds
(2005)We present a simple, automatic method for extracting feature curves, called crest lines, from point clouds. Crest lines are surface shape features having a mathematical background. Given an unstructured point cloud as ...
-
Article
DBGlobe: A service-oriented P2P system for global computing
(2003)The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a super-database. Our goal is to develop a data management system ...
-
Article
Direct routing: Algorithms and complexity
(2006)Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...
-
Article
Directed Information on Abstract Spaces: Properties and Variational Equalities
(2016)Directed information or its variants are utilized extensively in the characterization of the capacity of channels with memory and feedback, nonanticipative lossy data compression, and their generalizations to networks. In ...
-
Conference Object
Distributed balancing of a digraph with integer weights
(Institute of Electrical and Electronics Engineers Inc., 2013)We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
-
Article
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
(2018)We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
-
Conference Object
Distributed balancing under interval flow constraints in directed communication topologies
(Institute of Electrical and Electronics Engineers Inc., 2018)In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider ...
-
Conference Object
Distributed consensus and linear functional calculation in networks: An observability perspective
(2007)We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial sensor values at some or all of the sensors. We utilize a ...
-
Article
Distributed cycle detection and removal
(2018)In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph; the relational graph models a relation among the ...
-
Article
Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
(2015)Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
-
Article
Distributed stopping for average consensus in undirected graphs via event-triggered strategies
(2016)We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed strategies for average consensus in directed graphs
(2011)We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...
-
Conference Object
Distributed strategies for balancing a weighted digraph
(2012)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
-
Conference Object
The Dynamics of Vehicular Networks in Large-Scale Urban Environments
(Institute of Electrical and Electronics Engineers Inc., 2016)Vehicular Ad hoc Networks (VANETs) have emerged as a platform to support Intelligent Transportation Applications. A key to the development of protocols and services for IVC lies in the knowledge of the topological ...
-
Article
Eight-Dimensional Quantum Hall Effect and "Octonions"
(2003)A generalization of the quantum Hall effect (QHE) where particles move in an eight-dimensional space under an SO(8) gauge field was constructed. A nonrelativistic Hamiltonian for particles moving on the S8 in the presence ...
-
Conference Object
Extremum problems with total variation distance
(Institute of Electrical and Electronics Engineers Inc., 2013)The aim of this paper is to investigate extremum problems with pay-off the total variational distance metric subject to linear functional constraints both defined on the space of probability measures, as well as related ...
-
Article
Extremum problems with total variation distance and their applications
(2014)The aim of this paper is to investigate extremum problems with pay-off being the total variation distance metric defined on the space of probability measures, subject to linear functional constraints on the space of ...
-
Conference Object
A general framework for continuous time power control in time varying long term fading wireless networks
(2007)In this paper, a general framework for continuous time power control algorithm under time varying long term fading wireless channels is developed. This contrasts most of the power control algorithms introduced in the ...
-
Article
Inclusive double-Pomeron exchange at the Fermilab Tevatron p̄p collider
(2004)The double-Pomeron exchange (DPE) process p̄ + p → p̄′ + X + Y is investigated, where Y is a proton. The ratio of the number of DPE events in the region to the total number of events in the sample was 0.194±0.001±0.012. ...