Derivation of an Efficient Rule System Pattern Matcher

Formalizing algorithm derivations is a necessary prerequisite for developing automated algorithm design systems. This report describes a derivation of an algorithm for incrementally matching conjunctive patterns against a growing database. This algorithm, which is modeled on the Rete matcher used in the OPS5 production system, forms a basis for efficiently implementing a rule system. The highlights of this derivation are: (1) a formal specification for the rule system matching problem, (2) derivation of an algorithm for this task using a lattice-theoretic model of conjunctive and disjunctive variable substitutions, and (3) optimization of this algorithm, using finite differencing, for incrementally processing new data.

Virtual Model Control of a Biped Walking Robot

The transformation from high level task specification to low level motion control is a fundamental issue in sensorimotor control in animals and robots. This thesis develops a control scheme called virtual model control which addresses this issue. Virtual model control is a motion control language which uses simulations of imagined mechanical components to create forces, which are applied through joint torques, thereby creating the illusion that the components are connected to the robot. Due to the intuitive nature of this technique, designing a virtual model controller requires the same skills as designing the mechanism itself. A high level control system can be cascaded with the low level virtual model controller to modulate the parameters of the virtual mechanisms. Discrete commands from the high level controller would then result in fluid motion. An extension of Gardner's Partitioned Actuator Set Control method is developed. This method allows for the specification of constraints on the generalized forces which each serial path of a parallel mechanism can apply. Virtual model control has been applied to a bipedal walking robot. A simple algorithm utilizing a simple set of virtual components has successfully compelled the robot to walk eight consecutive steps.

Virtual Model Control of a Hexapod Walking Robot

Since robots are typically designed with an individual actuator at each joint, the control of these systems is often difficult and non-intuitive. This thesis explains a more intuitive control scheme called Virtual Model Control. This thesis also demonstrates the simplicity and ease of this control method by using it to control a simulated walking hexapod. Virtual Model Control uses imagined mechanical components to create virtual forces, which are applied through the joint torques of real actuators. This method produces a straightforward means of controlling joint torques to produce a desired robot behavior. Due to the intuitive nature of this control scheme, the design of a virtual model controller is similar to the design of a controller with basic mechanical components. The ease of this control scheme facilitates the use of a high level control system which can be used above the low level virtual model controllers to modulate the parameters of the imaginary mechanical components. In order to apply Virtual Model Control to parallel mechanisms, a solution to the force distribution problem is required. This thesis uses an extension of Gardner`s Partitioned Force Control method which allows for the specification of constrained degrees of freedom. This virtual model control technique was applied to a simulated hexapod robot. Although the hexapod is a highly non-linear, parallel mechanism, the virtual models allowed text-book control solutions to be used while the robot was walking. Using a simple linear control law, the robot walked while simultaneously balancing a pendulum and tracking an object.

Incremental Verification of Timing Constraints for Real-Time Systems

Testing constraints for real-time systems are usually verified through the satisfiability of propositional formulae. In this paper, we propose an alternative where the verification of timing constraints can be done by counting the number of truth assignments instead of boolean satisfiability. This number can also tell us how “far away” is a given specification from satisfying its safety assertion. Furthermore, specifications and safety assertions are often modified in an incremental fashion, where problematic bugs are fixed one at a time. To support this development, we propose an incremental algorithm for counting satisfiability. Our proposed incremental algorithm is optimal as no unnecessary nodes are created during each counting. This works for the class of path RTL. To illustrate this application, we show how incremental satisfiability counting can be applied to a well-known rail-road crossing example, particularly when its specification is still being refined.

A Privacy Conscious Bluetooth Infrastructure for Location Aware Computing

We present a low cost and easily deployed infrastructure for location aware computing that is built using standard Bluetooth® technologies and personal computers. Mobile devices are able to determine their location to room-level granularity with existing bluetooth technology, and to even greater resolution with the use of the recently adopted bluetooth 1.2 specification, all while maintaining complete anonymity. Various techniques for improving the speed and resolution of the system are described, along with their tradeoffs in privacy. The system is trivial to implement on a large scale – our network covering 5,000 square meters was deployed by a single student over the course of a few days at a cost of less than US$1,000.

Performance-Driven Microfabrication-Oriented Methodology for MEMS Conceptual Design with Application in Microfluidic Device Design

Performance and manufacturability are two important issues that must be taken into account during MEMS design. Existing MEMS design models or systems follow a process-driven design paradigm, that is, design starts from the specification of process sequence or the customization of foundry-ready process template. There has been essentially no methodology or model that supports generic, high-level design synthesis for MEMS conceptual design. As a result, there lacks a basis for specifying the initial process sequences. To address this problem, this paper proposes a performance-driven, microfabrication-oriented methodology for MEMS conceptual design. A unified behaviour representation method is proposed which incorporates information of both physical interactions and chemical/biological/other reactions. Based on this method, a behavioural process based design synthesis model is proposed, which exploits multidisciplinary phenomena for design solutions, including both the structural components and their configuration for the MEMS device, as well as the necessary substances for the chemical/biological/other reactions. The model supports both forward and backward synthetic search for suitable phenomena. To ensure manufacturability, a strategy of using microfabrication-oriented phenomena as design knowledge is proposed, where the phenomena are developed from existing MEMS devices that have associated MEMS-specific microfabrication processes or foundry-ready process templates. To test the applicability of the proposed methodology, the paper also studies microfluidic device design and uses a micro-pump design for the case study.

Compositional hypotheses of subcompositional stability and specific perturbation change and their testing

In standard multivariate statistical analysis common hypotheses of interest concern changes in mean vectors and subvectors. In compositional data analysis it is now well established that compositional change is most readily described in terms of the simplicial operation of perturbation and that subcompositions replace the marginal concept of subvectors. To motivate the statistical developments of this paper we present two challenging compositional problems from food production processes. Against this background the relevance of perturbations and subcompositions can be clearly seen. Moreover we can identify a number of hypotheses of interest involving the specification of particular perturbations or differences between perturbations and also hypotheses of subcompositional stability. We identify the two problems as being the counterpart of the analysis of paired comparison or split plot experiments and of separate sample comparative experiments in the jargon of standard multivariate analysis. We then develop appropriate estimation and testing procedures for a complete lattice of relevant compositional hypotheses

Geoprocesamiento con SQL en OrbisGIS

OrbisGIS dispone de un lenguaje que permite la manipulación de datos de forma independiente al formato. Éste se ajusta al estándar SQL92 (Lenguaje de Consulta Estructurado) y se extiende espacialmente según el OGC simple features SQL specification, lo que permite un alto nivel de compatibilidad con sistemas de bases de datos tradicionales como PostgreSQL/PostGIS. Habitualmente el SQL es procesado en servidores, sin embargo este artículo presentará cómo puede aplicarse en el cliente, principalmente para la definición y utilización de geoprocesos. La aplicación del SQL más inmediata es la manipulación de las fuentes de datos especificando una serie de instrucciones o script. Aparte, la implementación de SQL de OrbisGIS permite la parametrización de estos scripts de manera que pueden ser reutilizados con diferentes fuentes de datos y sin necesidad de conocer el proceso internamente. La reutilización puede darse tanto como ejecución del script como inclusión en un constructor de modelos que permite encadenar múltiples scripts dando lugar a un nuevo proceso más complejo. Por otra parte, el uso de disparadores permite la definición de reglas de validación mediante instrucciones SQL. Es posible definir reglas topológicas (entre otras) que definan relaciones entre dos o más fuentes de datos y que controlarán el proceso de edición tanto espacial como alfanumérico. Para finalizar, la especificación de vistas (en el sentido de los SGBD) permite reducir la redundancia en los datos y realizar algunas aplicaciones interesantes como la visualización de la evolución de los distintos imperios a lo largo de la historia

Sistema multimodal para la planificación de viajes en transportes públicos de código abierto y basado en estándares 'de facto' = A multimodal journey planner based on open source software and 'de facto' standards

Este artículo muestra cómo con bajo coste y riesgo se puede desarrollar un sistema de planificación de viaje multimodal, basado en un enfoque de código abierto y estándares ‘de facto’. Se ha desarrollado completamente una solución de código abierto para un sistema de información de transporte público puerta a puerta basado en estándares ‘de facto’. El cálculo de rutas se realiza mediante Graphserver, mientras que la cartografía se basa en OpenStreetMap. También se ha demostrado cómo exportar una base de datos real de horarios de transporte público como la del operador ETM (Empresa de Transporte Metropolitano de València) a la especificación de Google Transit, para permitir el cálculo de rutas, tanto desde nuestro prototipo como desde Google Transit

Simultaneous estimation of indirect and interaction effects using structural equation models

Interaction effects are usually modeled by means of moderated regression analysis. Structural equation models with non-linear constraints make it possible to estimate interaction effects while correcting for measurement error. From the various specifications, Jöreskog and Yang's (1996, 1998), likely the most parsimonious, has been chosen and further simplified. Up to now, only direct effects have been specified, thus wasting much of the capability of the structural equation approach. This paper presents and discusses an extension of Jöreskog and Yang's specification that can handle direct, indirect and interaction effects simultaneously. The model is illustrated by a study of the effects of an interactive style of use of budgets on both company innovation and performance

Análisis de los efectos generados por la decisión 391 sobre el régimen común de acceso a los recursos genéticos de la CAN, en el fenómeno de la biopiratería (1996-2010)

Después que muchos Estados se enriquecieran tanto intelectual como económicamente de la explotación o apropiación ilegal de la biodiversidad andina de la cual los miembros de la CAN eran país de origen, surge la necesidad de proteger la riqueza de la región, razón por la cual nace la Decisión 391 en 1996 sobre un Régimen Común de Acceso a Recursos genéticos. De esta manera los países miembros de la CAN se convirtieron en los primeros con un mecanismo de control para el acceso a los recursos genéticos y partición equitativa de los beneficios; buscando con ello sentar bases para la creación de conocimientos sobre el tema, el desarrollo de capacidades científicas y tecnológicas, y la promoción del uso sostenible de los recursos. Sin embargo por razones de carácter nacional la implementación del mismo no ha progresado, generando que los casos de biopiratería aumenten e incluso sean difíciles de prevenir. Siendo este un tema de gran relevancia para Bolivia, Colombia, Ecuador, Perú y Venezuela, esta monografía examinará en las siguientes páginas la reglamentación nacional para comprender a mayor profundidad los defectos y/o cualidades de las decisiones tomadas por los Estados para la aplicación de la Decisión 391, y así mismo evidenciará las razones por las cuales la implementación de la Decisión no ha tenido éxito total sobre el control de la biopiratería, entre ellas la falta de reglamentación, la especificación de roles, la concientización ciudadana e incluso información al público en general.

INFO2009 CW2 - Resource and Poster Assignment

specification of resource, poster and individual commentary which make up the poster group assignment

Annotated Bibliographies Notes Set

Slides, handouts and links covering relevant topics including how to create an annotated bibliography, exemplar bibliography, reference managers etc. The coursework specification with assessment criteria is available as a single item from http://www.edshare.soton.ac.uk/6044/

INFO1010 Presentations - small group exercise

Quick in class exercise to familiarise students with key points in presentation. timing is tight, but possible to run four groups with four minute presentation, one minute feedback on each slot, and five minute wash up. Associated coursework specification and mark scheme included, but also located at This item will be online at: http://www.edshare.soton.ac.uk/4201/ slides specify two scenarios

Requirements Capture: Using UML Use Cases

This is a presentation for our year one INFO1008 course of Computational Systems. It covers the need for requirements capture and the difficulty of building a specification based on user information. We present UML Use Cases and Use Case diagrams as a way of capturing requirements from the users point of view in a semi-structured way.