Results 21 to 30 of about 663,881 (275)
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1962-1973, December 2022., 2022 Abstract Objectives Early‐ and late‐onset Alzheimer's disease (EOAD and LOAD) share the same neuropathological traits but show distinct cognitive features. We aimed to explore baseline and longitudinal outcomes of global and domain‐specific cognitive function in a well characterized cohort of patients with a biomarker‐based diagnosis.
Adrià Tort‐Merino +16 more
wiley +1 more source
Weak Alternating Timed Automata [PDF]
Logical Methods in Computer Science, 2012 Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Pawel Parys, Igor Walukiewicz
doaj +1 more source
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2009 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic.
Johan van Benthem +2 more
doaj +1 more source
Untyping Typed Algebras and Colouring Cyclic Linear Logic [PDF]
Logical Methods in Computer Science, 2012 We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations.
Damien Pous
doaj +1 more source
Constraining the Galaxy's dark halo with RAVE stars [PDF]
, 2014 We use the kinematics of ∼200000 giant stars that lie within ∼1.5kpc of the plane to measure the vertical profile of mass density near the Sun. We find that the dark mass contained within the isodensity surface of the dark halo that passes through the ...
T. Piffl +19 more
semanticscholar +1 more source
Sampled Semantics of Timed Automata [PDF]
Logical Methods in Computer Science, 2010 Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing ...
Pavel Krcal +2 more
doaj +1 more source
Reachability and liveness in parametric timed automata [PDF]
Logical Methods in Computer Science, 2022 We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable.
Étienne André +2 more
doaj +1 more source
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness [PDF]
Logical Methods in Computer Science, 2007 We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions).
Parosh Abdulla +2 more
doaj +1 more source
Massively parallel pattern recognition with link failures [PDF]
, 2000 The capabilities of reliable computations in linear cellular arrays with communication failures are investigated in terms of pattern recognition. The defective processing elements (cells) that cause the misoperations are assumed to behave as follows ...
Kutrib, Martin, Löwe, Jan-Thomas
core +1 more source
Piecewise testable tree languages [PDF]
Logical Methods in Computer Science, 2012 This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination
Mikołaj Bojańczyk +2 more
doaj +1 more source