Results 31 to 40 of about 1,545,213 (249)
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations [PDF]
Logical Methods in Computer Science, 2008 Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata.
Lijun Zhang +3 more
doaj +1 more source
Essential Convexity and Complexity of Semi-Algebraic Constraints [PDF]
Logical Methods in Computer Science, 2012 Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets.
Manuel Bodirsky +2 more
doaj +1 more source
Formalizing Randomized Matching Algorithms [PDF]
Logical Methods in Computer Science, 2012 Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning.
Dai Tri Man Le, Stephen A. Cook
doaj +1 more source
Emergence of XIII.2.2 genotype of Avian Avulavirus-1 with unique FPCS site in India
Indian Journal of Animal Sciences, 2022 In the present study, two isolates namely D162 and D165 obtained from Newcastle disease outbreaks in backyard poultry in Tamil Nadu were subjected to phylogenetic analysis using complete Fusion (F) gene sequence to understand the circulation and ...
N SARIKA +4 more
doaj +1 more source
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis [PDF]
Logical Methods in Computer Science, 2010 The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem.
Silvio Ghilardi, Silvio Ranise
doaj +1 more source
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets [PDF]
Logical Methods in Computer Science, 2008 We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might
Paolo Baldan +4 more
doaj +1 more source
A Reduced Semantics for Deciding Trace Equivalence [PDF]
Logical Methods in Computer Science, 2017 Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without ...
David Baelde +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Cyclophosphamide (CY) is associated with potentially fatal cardiotoxicity, yet no electrocardiographic indices have been established for early detection of CY‐induced cardiomyopathy. This study aimed to determine whether corrected QT interval (QTc) prolongation can predict early onset of CY‐related cardiac dysfunction in pediatric ...
Junpei Kawamura +5 more
wiley +1 more source
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source