Browsing by Subject "Graph theory"
Now showing items 4160 of 78

Conference Object
Improved performance bounds on maxproduct algorithms for multiple fault diagnosis in graphs with loops
(2008)In this paper, we analyze the performance of belief propagation maxproduct algorithms when used to solve the multiple fault diagnosis (MFD) problem. The MFD problem is described by a bipartite diagnosis graph (BDG) which ...

Article
Incorporating input/output operations into dynamic dataflow graphs
(1995)Driven by the 'sideeffect' environment of sequential von Neumann computing, Input/Output operations have evolved as state operations on shared files. In parallel programs, if multiple instances of an I/Operforming process ...

Article
The increase of the instability of networks due to QuasiStatic link capacities
(2007)In this work, we study the impact of the dynamic changing of the network link capacities on the stability properties of packetswitched networks. Especially, we consider the Adversarial, QuasiStatic Queuing Theory model, ...

Conference Object
Integer weight balancing in directed graphs in the presence of communication delays
(Institute of Electrical and Electronics Engineers Inc., 2015)A digraph with positive weights on its edges is weightbalanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weightbalanced digraphs play an important ...

Conference Object
Leastcost firing sequence estimation in labeled Petri nets with unobservable transitions
(2007)This paper develops a recursive algorithm for estimating the leastcost transition firing sequences that match the observation of a sequence of labels produced by transition activity in a given labeled Petri net. The Petri ...

Article
Leastcost transition firing sequence estimation in labeled Petri nets with unobservable transitions
(2011)This paper proposes an approach for estimating the leastcost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each ...

Conference Object
Linear behaviour of term graph rewriting programs
(ACM, 1995)The generalized term graph rewriting computational model is exploited to implement concurrent languages based on Girard's Linear Logic (LL). In particular a fragment of LL is identified which is able to serve as a `process ...

Article
Linearisation and potential symmetries of certain systems of diffusion equations
(2006)We consider systems of two pure onedimensional diffusion equations that have considerable interest in Soil Science and Mathematical Biology. We construct nonlocal symmetries for these systems. These are determined by ...

Conference Object
Lowcomplexity maxproduct algorithms for problems of multiple fault diagnosis
(2008)In this paper, we propose lowcomplexity maxproduct algorithms for the problem of multiple fault diagnosis (MFD). The MFD problem is described by a bipartite diagnosis graph (BDG) which consists of a set of components, a ...

Article
Mapping fortran programs to single assignment semantics for efficient parallelization
(1998)This paper presents Mustang, a system that automatically parallellizes Fortran programs by mapping them to single assignment semantics. Specifically, sequential Fortran source programs are translated into IF1, a ...

Article
Maxproduct algorithms for the generalized multiplefault diagnosis problem
(2007)In this paper, we study the application of the maxproduct algorithm (MPA) to the generalized multiplefault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be ...

Conference Object
Minimum initial marking estimation in labeled petri nets
(2009)This paper develops an algorithm for estimating the minimum initial marking based on the observation of a sequence of labels that is produced by underlying transition activity in a given labeled Petri net. We assume that ...

Article
Modal analysis reduction of multibody systems with generic damping
(2014)Modal analysis of multibody systems is broadly used to study the behavior and controller design of dynamic systems. In both cases, model reduction that does not degrade accuracy is necessary for the efficient use of these ...

Conference Object
Modal analysis reduction of multibody systems with generic damping
(Caltek s.r.l., 2012)Modal analysis of multibody systems is broadly used to study the behavior and controller design of dynamic systems. In both cases, model reduction that does not degrade accuracy is necessary for the efficient use of these ...

Conference Object
Modeling program predictability
(IEEE Comp Soc, 1998)Basic properties of program predictability  for both values and control  are defined and studied. We take the view that program predictability originates at certain points during a program's execution, flows through ...

Article
Modelling and reduction techniques for studies of integrated hybrid vehicle systems
(2006)Models of integrated vehicle systems are essential for designing hybrid vehicles by means of simulationbased optimization. Given the complexity of hybrid vehicle systems, designing is a time consuming process that requires ...

Conference Object
A modular modeling approach for the design of reconfigurable machine tools
(Affiliation: Department of Mechanical Engineering, University of Michigan, Ann Arbor, United StatesAffiliation: Department of Mechanical and Manufacturing Engineering, University of Cyprus, CyprusCorrespondence Address: Ersal, T.Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI, United Statesemail: tersal@umich.edu, 2004)A new generation of machine tools called Reconfigurable Machine Tools (RMTs) is emerging as a means for industry to be more competitive in a market that experiences frequent changes in demand. New methodologies and tools ...

Article
Nature inspired node density estimation for molecular nanonetworks
(2017)The problem of estimating the node density in ad hoc networks is a significant one for protocol design. In molecular nanonetworks, the node density estimation problem poses additional challenges due to the limited processing ...

Article
Network game with attacker and protector entities
(2005)Consider an information network with harmful procedures called attackers (e.g., viruses)

Article
A network game with attackers and a defender
(2008)Consider an information network with threats called attackers