250 research outputs found
Inappropriate Use of Nonpsychotropic Medications in Nursing Homes
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/111070/1/j.1532-5415.1995.tb06098.x.pd
A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints
We present formalized proofs verifying that the first-order unification
algorithm defined over lists of satisfiable constraints generates a most
general unifier (MGU), which also happens to be idempotent. All of our proofs
have been formalized in the Coq theorem prover. Our proofs show that finite
maps produced by the unification algorithm provide a model of the axioms
characterizing idempotent MGUs of lists of constraints. The axioms that serve
as the basis for our verification are derived from a standard set by extending
them to lists of constraints. For us, constraints are equalities between terms
in the language of simple types. Substitutions are formally modeled as finite
maps using the Coq library Coq.FSets.FMapInterface. Coq's method of functional
induction is the main proof technique used in proving many of the axioms.Comment: In Proceedings UNIF 2010, arXiv:1012.455
A novel spatiotemporal home heating controller design: system emulation and field testing
We have developed a spatiotemporal heating control algorithm for use in homes. This system utilises a combination of relatively low-tech hardware interfaced with electric heating systems and a smartphone interface to this hardware, and a central server that progressively learns users’ room-specific presence profiles and thermal preferences. This paper describes the associated spatiotemporal heating control algorithm, its evaluation utilising the dynamic building performance simulation software EnergyPlus, and a longitudinal deployment of the algorithm controlling a quasi-autonomous spatiotemporal home heating system in three domestic homes. In this we focus on the prediction of occupants’ presence and preferred set-point temperature as well as on the calculation of optimum start time and the utilisation of user-scheduled absences; this for two comfort strategies: to maximise comfort and to minimise discomfort. The former aims to deliver conditions equating to a ‘neutral’ thermal sensation, whereas the latter targets a ‘slightly cool’ sensation with corresponding heating energy savings. Simulation results confirmed that the algorithm functions as intended and that it is capable of reducing energy demand by a factor of seven compared with EnergyStar recommended settings for programmable thermostats. Field study results align with these findings and highlight the possibility to reduce energy under the minimise discomfort strategy without compromising on occupants’ thermal comfort
CAD modeling, multibody system formalisms and visualization : an integrated approach
In this paper an integrated approach of CAD (Computer Aided Design) modeling, generation of equations of motion, simulation and visualization of multibody systems is described. An object-oriented data model for different multibody formalisms is integrated in a commercially available CAD-3D-system. With respect to existing CAD-interfaces, different solid model design methods and various visualization demands the datamodel allow, multi body modeling with a direct interface to a data base. Different software tools like an integrated Newton-Euler formalism are able to use immediately the parametrized multi body system data base. For multibody systems with closed kinematic loops a set of ordinary differential equations and decoupled algebraic equations is formulated automatically which can be solved with explicit multistep integration algorithms. This is achieved by a minimal set of generalized coordinates being specified during the numerical integration. A additional interface provides data for visualization from the simulation tool
Size-dependent scanning parameters (kVp and mAs) for photon-counting spectral CT system in pediatric imaging: simulation study
A History of Discrete Event Simulation Programming Languages
The history of simulation programming languages is organized as a progression in periods of similar developments. The five periods, spanning 1955-1986, are labeled: The Period of Search (1955-1960); The Advent (1961-1965); The Formative Period (1966-1970); The Expansional Period (1971-1978); and The Period of Consolidation and Regeneration (1979-1986). The focus is on recognizing the people and places that have made important contributions in addition to the nature of the contribution. A balance between comprehensive and in-depth treatment has been reached by providing more detailed description of those languages which have or have had major use. Over 30 languages are mentioned, and numerous variations are described in the major contributors. A concluding summary notes the concepts and techniques either originating with simulation programming languages or given significant visibility by them
- …
