Results 21 to 30 of about 10,839,512 (369)
Calibration of the Computer Science and Applications, Inc. accelerometer.
PURPOSE We established accelerometer count ranges for the Computer Science and Applications, Inc. (CSA) activity monitor corresponding to commonly employed MET categories.
P. Freedson, E. Melanson, J. Sirard
semanticscholar +1 more source
Expressive Path Queries on Graph with Data [PDF]
Graph data models have recently become popular owing to their applications, e.g., in social networks and the semantic web. Typical navigational query languages over graph databases - such as Conjunctive Regular Path Queries (CRPQs) - cannot express ...
Pablo Barcelo+2 more
doaj +1 more source
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games [PDF]
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible.
Thomas Brihaye+4 more
doaj +1 more source
Parity and Streett Games with Costs [PDF]
We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses.
Nathanaël Fijalkow, Martin Zimmermann
doaj +1 more source
μLarvaScript : rethinking the Larva scripting language [PDF]
polyLarva, the latest incarnation of the Larva runtime-verification (RV) tool suite, experienced a major redesign to its scripting language (used for specifying the monitors that carry out the RV.).peer ...
Francalanza, Adrian+1 more
core +4 more sources
Relative Entailment Among Probabilistic Implications [PDF]
We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is defined in ...
Albert Atserias+2 more
doaj +1 more source
Smart Choices and the Selection Monad [PDF]
Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized by ...
Martin Abadi, Gordon Plotkin
doaj +1 more source
Approximability in the GPAC [PDF]
Most of the physical processes arising in nature are modeled by either ordinary or partial differential equations. From the point of view of analog computability, the existence of an effective way to obtain solutions of these systems is essential.
Diogo Poças, Jeffery Zucker
doaj +1 more source
The natural science of computing [PDF]
As unconventional computing comes of age, we believe a revolution is needed in our view of computer science.
Horsman, Dominic+2 more
openaire +4 more sources
Every new technology brings new opportunity for crime, and information and communication technology (ICT) is no exception. This short article offers students of crime insights in the two main connections between ICT and criminology. On the one hand we show how ICT can be used as a tool, target, or location of crime.
Hartel, P.H. (author)+1 more
openaire +6 more sources