<p>An event monitor is a part of a real-time system that can be used to</p><p>check if the system follows the specifications posed on its behavior. This dissertation covers an approach to event monitoring where such specifications (represented by time constraints) are represented by graphs.</p><p>Not much work has previously been done on designing and implementing constraint graph-based event monitors. In this work, we focus on presenting an extensible design for such an event monitor. We also evaluate different data structure types (linked lists, dynamic arrays, and static arrays) that can be used for representing the constraint graphs internally. This is done by creating an event monitor implementation, and conducting a number of benchmarks where the time used by the monitor is measured.</p><p>The result is presented in the form of a design specification and a summary of the benchmark results. Dynamic arrays are found to be the generally most efficient, but advantages and disadvantages of all the data structure types are discussed.</p>

<p>In this work an investigation is performed in whether the algorithms Simultaneous Perturbation Stochastic Approximation (SPSA) and Virtual Force Algorithm (VFA) are suitable for real-time strategic placement of sensors in a dynamic environment. An evaluation of these algorithms is conducted and compared to Simulated Annealing (SA), which has been used before in similar applications.</p><p>For the tests, a computer based model of the sensors and the environment in which they are used, is implemented. The model handles sensors, moving objects, specifications for the area the sensors are supposed to monitor, and all interaction between components within the model.</p><p>It was the belief of the authors that SPSA and VFA are suited for this kind of problem, and that they have advantages over SA in complex scenarios. The results shows this to be true although SA seems to perform better when it comes to smaller number of sensors to be placed</p>

No description available.

<p>The field of real-time computer animation is undergoing major changes, and many of the methods used to this point are no longer sufficient to achieve the degree of realism that is desired. There is a need for an animation method that provides greater realism, simpler ways to create animations, and more vivid and lifelike virtual creatures. This thesis suggests the possibility of doing that with a physically-based method, by researching current and alternative solutions, developing an architecture for a physically-based system, and describing an implementation of such a system.</p>

Flash memories are used as the main storage in many portable consumer electronic devices because they are more robust than hard drives. This document gives an overview of existing consumer flash memory technologies which are mostly removable flash memory cards. It discusses to which degree consumer flash devices are suitable for real-time systems and provides a detailed timing analysis of some consumer flash devices. Further, it describes methods to analyze mount times, access performance and timing predictability of flash memories. Important factors which influence access timings of flash memories are pointed out and different flash file systems are evaluated with regard to their suitability for real-time systems. Some remaining problems of existing flash file system implementations concerning real-time use are discussed.

Thesis (Ph. D.)--University of Missouri-Columbia, 1999. / Typescript. Vita. Includes bibliographical references (leaves 187-195). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1999. / Typescript. Vita. Includes bibliographical references (leaves 187-195). Also available on the Internet.

Thesis (D. Engr.)--Technische Universität München. / At head of title: Deutsche Geodätische Kommission bei der Bayerischend Akademie der Wissenschaften.

Thesis (M.S. in Information Technology Management and M.S. in Computer Science)--Naval Postgraduate School, March 2004. / Thesis advisor(s): Burt Lundy. Includes bibliographical references (p. 99-100). Also available online.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 328-349). Available also in a digital version from Dissertation Abstracts.