Browsing by Subject "Graph theory"

Now showing items 41-60 of 78

    • Conference Object  

      Improved performance bounds on max-product algorithms for multiple fault diagnosis in graphs with loops 

      Le, T.; Hadjicostis, Christoforos N. (2008)
      In this paper, we analyze the performance of belief propagation max-product 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 data-flow graphs 

      Evripidou, Paraskevas; Gaudiot, J. -L (1995)
      Driven by the 'side-effect' 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/O-performing process ...
    • Article  

      The increase of the instability of networks due to Quasi-Static link capacities 

      Koukopoulos, D.; Mavronicolas, Marios; Spirakis, Paul G. (2007)
      In this work, we study the impact of the dynamic changing of the network link capacities on the stability properties of packet-switched networks. Especially, we consider the Adversarial, Quasi-Static Queuing Theory model, ...
    • Conference Object  

      Integer weight balancing in directed graphs in the presence of communication delays 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2015)
      A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...
    • Conference Object  

      Least-cost firing sequence estimation in labeled Petri nets with unobservable transitions 

      Li, N.; Hadjicostis, Christoforos N. (2007)
      This paper develops a recursive algorithm for estimating the least-cost 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  

      Least-cost transition firing sequence estimation in labeled Petri nets with unobservable transitions 

      Li, L.; Hadjicostis, Christoforos N. (2011)
      This paper proposes an approach for estimating the least-cost 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 

      Banach, Richard; Papadopoulos, George Angelos (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 

      Sophocleous, Christodoulos; Wiltshire, R. J. (2006)
      We consider systems of two pure one-dimensional diffusion equations that have considerable interest in Soil Science and Mathematical Biology. We construct non-local symmetries for these systems. These are determined by ...
    • Conference Object  

      Low-complexity max-product algorithms for problems of multiple fault diagnosis 

      Le, T.; Hadjicostis, Christoforos N. (2008)
      In this paper, we propose low-complexity max-product 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 

      Evripidou, Paraskevas (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  

      Max-product algorithms for the generalized multiple-fault diagnosis problem 

      Le, T.; Hadjicostis, Christoforos N. (2007)
      In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault 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 

      Li, L.; Hadjicostis, Christoforos N. (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 multi-body systems with generic damping 

      Louca, Loucas S. (2014)
      Modal analysis of multi-body 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 multi-body systems with generic damping 

      Louca, Loucas S. (Caltek s.r.l., 2012)
      Modal analysis of multi-body 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 

      Sazeides, Yiannakis; Smith, James E. (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 

      Louca, Loucas S.; Yildir, B. U. (2006)
      Models of integrated vehicle systems are essential for designing hybrid vehicles by means of simulation-based 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 

      Ersal, T.; Stein, J. L.; Louca, Loucas S. (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 

      Saeed, T.; Lestas, Marios; Pitsillides, Andreas (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 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2005)
      Consider an information network with harmful procedures called attackers (e.g., viruses)
    • Article  

      A network game with attackers and a defender 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2008)
      Consider an information network with threats called attackers