Patrol team language identification system for DARPA RATS P1 evaluation

This paper describes the language identification (LID) system developed by the Patrol team for the first phase of the DARPA RATS (Robust Automatic Transcription of Speech) program, which seeks to advance state of the art detection capabilities on audio from highly degraded communication channels. We show that techniques originally developed for LID on telephone speech (e.g., for the NIST language recognition evaluations) remain effective on the noisy RATS data, provided that careful consideration is applied when designing the training and development sets. In addition, we show significant improvements from the use of Wiener filtering, neural network based and language dependent i-vector modeling, and fusion.

Métodos acotados de aplicación de reglas de evolución para la implementación de Sistemas P de Transición

La característica fundamental de la Computación Natural se basa en el empleo de conceptos, principios y mecanismos del funcionamiento de la Naturaleza. La Computación Natural -y dentro de ésta, la Computación de Membranas- surge como una posible alternativa a la computación clásica y como resultado de la búsqueda de nuevos modelos de computación que puedan superar las limitaciones presentes en los modelos convencionales. En concreto, la Computación de Membranas se originó como un intento de formular un nuevo modelo computacional inspirado en la estructura y el funcionamiento de las células biológicas: los sistemas basados en este modelo constan de una estructura de membranas que actúan a la vez como separadores y como canales de comunicación, y dentro de esa estructura se alojan multiconjuntos de objetos que evolucionan de acuerdo a unas determinadas reglas de evolución. Al conjunto de dispositivos contemplados por la Computación de Membranas se les denomina genéricamente como Sistemas P. Hasta el momento los Sistemas P sólo han sido estudiados a nivel teórico y no han sido plenamente implementados ni en medios electrónicos, ni en medios bioquímicos, sólo han sido simulados o parcialmente implementados. Por tanto, la implantación de estos sistemas es un reto de investigación abierto. Esta tesis aborda uno de los problemas que debe ser resuelto para conseguir la implantación de los Sistemas P sobre plataformas hardware. El problema concreto se centra en el modelo de los Sistemas P de Transición y surge de la necesidad de disponer de algoritmos de aplicación de reglas que, independientemente de la plataforma hardware sobre la que se implementen, cumplan los requisitos de ser no deterministas, masivamente paralelos y además su tiempo de ejecución esté estáticamente acotado. Como resultado se ha obtenido un conjunto de algoritmos (tanto para plataformas secuenciales, como para plataformas paralelas) que se adecúan a las diferentes configuraciones de los Sistemas P. ABSTRACT The main feature of Natural Computing is the use of concepts, principles and mechanisms inspired by Nature. Natural Computing and within it, Membrane Computing emerges as an potential alternative to conventional computing and as from the search for new models of computation that may overcome the existing limitations in conventional models. Specifically, Membrane Computing was created to formulate a new computational paradigm inspired by the structure and functioning of biological cells: it consists of a membrane structure, which acts as separators as well as communication channels, and within this structure are stored multisets of objects that evolve according to certain evolution rules. The set of computing devices addressed by Membrane Computing are generically known P systems. Up to now, no P systems have been fully implemented yet in electronic or biochemical means. They only have been studied in theory, simulated or partially implemented. Therefore, the implementation of these systems is an open research challenge. This thesis addresses one of the problems to be solved in order to deploy P systems on hardware platforms. This specific problem is focused on the Transition P System model and emerges from the need of providing application rules algorithms that independently on the hardware platform on which they are implemented, meets the requirements of being nondeterministic, massively parallel and runtime-bounded. As a result, this thesis has developed a set of algorithms for both platforms, sequential and parallel, adapted to all possible configurations of P systems.

PREDIRCAM eHealth platform for individualized telemedical assistance for lifestyle modification in the treatment of obesity, diabetes, and cardiometabolic risk prevention: a pilot study (PREDIRCAM 1)

Background: Healthy diet and regular physical activity are powerful tools in reducing diabetes and cardiometabolic risk. Various international scientific and health organizations have advocated the use of new technologies to solve these problems. The PREDIRCAM project explores the contribution that a technological system could offer for the continuous monitoring of lifestyle habits and individualized treatment of obesity as well as cardiometabolic risk prevention. Methods: PREDIRCAM is a technological platform for patients and professionals designed to improve the effectiveness of lifestyle behavior modifications through the intensive use of the latest information and communication technologies. The platform consists of a web-based application providing communication interface with monitoring devices of physiological variables, application for monitoring dietary intake, ad hoc electronic medical records, different communication channels, and an intelligent notification system. A 2-week feasibility study was conducted in 15 volunteers to assess the viability of the platform. Results: The website received 244 visits (average time/session: 17 min 45 s). A total of 435 dietary intakes were recorded (average time for each intake registration, 4 min 42 s ± 2 min 30 s), 59 exercises were recorded in 20 heart rate monitor downloads, 43 topics were discussed through a forum, and 11 of the 15 volunteers expressed a favorable opinion toward the platform. Food intake recording was reported as the most laborious task. Ten of the volunteers considered long-term use of the platform to be feasible. Conclusions: The PREDIRCAM platform is technically ready for clinical evaluation. Training is required to use the platform and, in particular, for registration of dietary food intake.

Definición de un proceso para la creación de perfiles institucionales en redes sociales de acuerdo a su estrategia de Social Media Marketing

Desde el 23 de febrero de 2004 la ETS Ingenieros Informáticos posee un perfil en dos redes sociales: Twitter y Facebook. Desde un primer momento el departamento de Unidad de Imagen y Comunicación, encargado de dichos perfiles, ha tenido claro que este era solo el primer paso para aprovechar al máximo las ventajas de las redes sociales en un contexto educativo universitario. En este trabajo se quiere dar forma a esa aspiración desarrollando una expansión del uso de las redes sociales. En este trabajo se analizan los seis primeros meses de trabajo con el perfil de Twitter y la página de Facebook con el objetivo de averiguar qué ha funcionado y qué ha fallado en la estrategia inicial prevista. Primero, se plantea un acercamiento desde el punto de vista estadístico con los datos que arrojan diferentes herramientas de análisis social y después, desde el punto de vista personal con las respuestas de la propia comunidad de la Escuela a una encuesta de satisfacción con los nuevos canales de comunicación. Además, de cara a la creación de nuevos perfiles se analiza el trabajo que realizan en ellas otras universidades y escuelas de informáticas. Con todos los datos sobre el trabajo previo se construyen una serie de buenas prácticas para instituciones universitarias en redes sociales que servirán para desarrollar los planes editoriales de dos nuevos perfiles: un canal de YouTube y una página de LinkedIn. Para terminar, se deja constancia de todo el proceso realizado en una metodología propia que servirá para poder seguir aumentando la red social de la escuela en el futuro con un enfoque en el alumno y que se fundamentará en el análisis y la mejora constante. Se espera que esta metodología pueda servir de modelo para la creación de perfiles sociales en otras universidades o para mejorar las ya existentes.---aBSTRACT---Since February 23rd of 2014, ETS Ingenieros Informáticos had a profile in two of the most popular social networks: Twitter and Facebook. From the beginning, the Communication Department in charge of these profiles knew that this was only a starting point to take advantage of all the advantages that social networks can bring to a higher education context. Thus, this paper aims at developing an expansion of the use of social networks. The present paper analyses the first sixth months of the use of the Twitter profile and the Facebook page to determine the aspects of the initial strategy that worked successfully and those that needed improvement. Firstly, I present a statistical approach the data from a statistical point of view taking into account all the information provided by the different social analysis tools. Then, I complement this first approach with a more personal point of view including the answers of the university community to a satisfaction survey regarding the new communication channels. Finally, in order to create new profiles, other universities’ work is reviewed and examined in depth. Taking into account the previous work, a series of good practices for university institutions is developed in order to be used as the basis of the new social plan to include two new social networks: a YouTube channel and a LinkedIn page. Finally, the whole process is described in a methodology that could be used to increase the School’s social network in the future. This procedure is student-centred and based on the constant analysis and improvement of the results. It is hoped that this methodology could be used as an example of a social network profile creation or improvement for other universities’ strategy.

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.