Unified access to media metadata on the web: Towards interoperability using a core vocabulary.

The goal of the W3C's Media Annotation Working Group (MAWG) is to promote interoperability between multimedia metadata formats on the Web. As experienced by everybody, audiovisual data is omnipresent on today's Web. However, different interaction interfaces and especially diverse metadata formats prevent unified search, access, and navigation. MAWG has addressed this issue by developing an interlingua ontology and an associated API. This article discusses the rationale and core concepts of the ontology and API for media resources. The specifications developed by MAWG enable interoperable contextualized and semantic annotation and search, independent of the source metadata format, and connecting multimedia data to the Linked Data cloud. Some demonstrators of such applications are also presented in this article.

Approximate Relational Reasoning for Probabilistic Programs

La seguridad verificada es una metodología para demostrar propiedades de seguridad de los sistemas informáticos que se destaca por las altas garantías de corrección que provee. Los sistemas informáticos se modelan como programas probabilísticos y para probar que verifican una determinada propiedad de seguridad se utilizan técnicas rigurosas basadas en modelos matemáticos de los programas. En particular, la seguridad verificada promueve el uso de demostradores de teoremas interactivos o automáticos para construir demostraciones completamente formales cuya corrección es certificada mecánicamente (por ordenador). La seguridad verificada demostró ser una técnica muy efectiva para razonar sobre diversas nociones de seguridad en el área de criptografía. Sin embargo, no ha podido cubrir un importante conjunto de nociones de seguridad “aproximada”. La característica distintiva de estas nociones de seguridad es que se expresan como una condición de “similitud” entre las distribuciones de salida de dos programas probabilísticos y esta similitud se cuantifica usando alguna noción de distancia entre distribuciones de probabilidad. Este conjunto incluye destacadas nociones de seguridad de diversas áreas como la minería de datos privados, el análisis de flujo de información y la criptografía. Ejemplos representativos de estas nociones de seguridad son la indiferenciabilidad, que permite reemplazar un componente idealizado de un sistema por una implementación concreta (sin alterar significativamente sus propiedades de seguridad), o la privacidad diferencial, una noción de privacidad que ha recibido mucha atención en los últimos años y tiene como objetivo evitar la publicación datos confidenciales en la minería de datos. La falta de técnicas rigurosas que permitan verificar formalmente este tipo de propiedades constituye un notable problema abierto que tiene que ser abordado. En esta tesis introducimos varias lógicas de programa quantitativas para razonar sobre esta clase de propiedades de seguridad. Nuestra principal contribución teórica es una versión quantitativa de una lógica de Hoare relacional para programas probabilísticos. Las pruebas de correción de estas lógicas son completamente formalizadas en el asistente de pruebas Coq. Desarrollamos, además, una herramienta para razonar sobre propiedades de programas a través de estas lógicas extendiendo CertiCrypt, un framework para verificar pruebas de criptografía en Coq. Confirmamos la efectividad y aplicabilidad de nuestra metodología construyendo pruebas certificadas por ordendor de varios sistemas cuyo análisis estaba fuera del alcance de la seguridad verificada. Esto incluye, entre otros, una meta-construcción para diseñar funciones de hash “seguras” sobre curvas elípticas y algoritmos diferencialmente privados para varios problemas de optimización combinatoria de la literatura reciente. ABSTRACT The verified security methodology is an emerging approach to build high assurance proofs about security properties of computer systems. Computer systems are modeled as probabilistic programs and one relies on rigorous program semantics techniques to prove that they comply with a given security goal. In particular, it advocates the use of interactive theorem provers or automated provers to build fully formal machine-checked versions of these security proofs. The verified security methodology has proved successful in modeling and reasoning about several standard security notions in the area of cryptography. However, it has fallen short of covering an important class of approximate, quantitative security notions. The distinguishing characteristic of this class of security notions is that they are stated as a “similarity” condition between the output distributions of two probabilistic programs, and this similarity is quantified using some notion of distance between probability distributions. This class comprises prominent security notions from multiple areas such as private data analysis, information flow analysis and cryptography. These include, for instance, indifferentiability, which enables securely replacing an idealized component of system with a concrete implementation, and differential privacy, a notion of privacy-preserving data mining that has received a great deal of attention in the last few years. The lack of rigorous techniques for verifying these properties is thus an important problem that needs to be addressed. In this dissertation we introduce several quantitative program logics to reason about this class of security notions. Our main theoretical contribution is, in particular, a quantitative variant of a full-fledged relational Hoare logic for probabilistic programs. The soundness of these logics is fully formalized in the Coq proof-assistant and tool support is also available through an extension of CertiCrypt, a framework to verify cryptographic proofs in Coq. We validate the applicability of our approach by building fully machine-checked proofs for several systems that were out of the reach of the verified security methodology. These comprise, among others, a construction to build “safe” hash functions into elliptic curves and differentially private algorithms for several combinatorial optimization problems from the recent literature.

Sistema web de gestión de seminarios

El Trabajo de Fin de Grado (TFG) aquí descrito es el resultado de la necesidad de crear un sistema de gestión de seminarios que utilizarán los planes de postgrado de la Escuela Técnica Superior de Ingenieros Informáticos de la Universidad Politécnica de Madrid. Su objetivo es facilitar, tanto al alumnado como al personal de dicha institución, la creación de seminarios ofertados para el alumnado de los distintos planes de postgrado, además de permitir la inscripción de éstos de un modo cómodo e intuitivo. La aplicación de gestión de seminarios deberá permitir que los coordinadores de un plan de postgrado puedan crear seminarios de tal manera que puedan quedar publicados para el alumnado. Para ello, será necesario que sean recogidos todos los datos necesarios del seminario, así como el plan de postgrado organizador y los planes de postgrado para los que serán ofertados. La aplicación además deberá permitir la creación de seminarios sin ser publicados al alumno provisionalmente, la edición de los seminarios ya existentes así como la creación de un seminario nuevo importando los datos de otro ya realizado. Por otra parte, se deberá incorporar en las páginas web de planes de postgrado el listado de los seminarios ofertados para el curso actual, de tal manera que se permita a los alumnos inscribirse a éstos. Por último, el personal de administración del plan de postgrado organizador de un seminario deberá tener acceso a la lista de alumnos inscritos a los seminarios, para el caso de enviar información urgente o ver los alumnos inscritos. El módulo de gestión de seminarios deberá obtener los datos de los planes de postgrado actuales gracias a un módulo de gestión de postgrados, donde se deberá permitir crear, editar y dar de baja planes de postgrado, así como gestionar el personal del postgrado que podrá realizar acciones sobre los seminarios organizados por éste. Los módulos de gestión de seminarios y de gestión de postgrados estarán integrados en un módulo de administración.---ABSTRACT---The Final Project Degree (TFG) described here is the result of the need to create a management system that will use seminars postgraduate plans at the Higher Technical School of Computer Engineering at the Universidad Politécnica de Madrid. It aims to facilitate both the students and staff of the institution, creating seminars offered to the students of the various postgraduate plans, besides allowing the registration of these in a convenient and intuitive way. The management application will allow the coordinators of a postgraduate plan to create seminars so that they can be published for students. To do this, you will need to collect all the necessary details about the seminar, as well as the postgraduate plan owner and postgraduate plans for which it will be offered. The application must also enable the creation of seminars without being published provisionally to students, the editing of existing seminars and the creation of a new seminar importing data from another already done. Moreover, it should be incorporated into web pages of postgraduate plans seminars listing offered for the current course, so that students are allowed to enrol in these. Finally, the staff of the plan organizer should have access to the list of students enrolled at seminars, in the case of sending urgent information or to see students enrolled. The management module must obtain data from current postgraduate plans through a postgraduate management module, which should be allowed to create, edit and terminate postgraduate plans, and manage staff that can perform actions on seminars organized by it. Management modules of seminars and postgraduate programs will be integrated into a management pack.

Desarrollo de ontología de títulos de grado

Dada la amplia información que rodea el dominio de programas de estudios superiores, específicamente los estudios de grado, este trabajo fin de grado propone la construcción de un modelo para representar dicha información mediante la construcción de una red de ontologías, proporcionando una definición común de conceptos importantes, y que posteriormente puede ser reutilizada para la construcción de aplicaciones que ayuden a las partes interesadas, como, estudiantes, personal académico y administrativo, a la búsqueda y acceso de información oportuna. Para la construcción de esta red de ontologías, se siguen las recomendaciones y pautas propuestas por la metodología NeOn [1a] [1b], que sigue un paradigma basado en la reutilización de recursos de conocimiento. Por otra parte, se realiza una populación de dicha red de ontologías mediante datos específicos del grado en Ingeniería Informática de la Universidad Politécnica de Madrid. La construcción de una red de ontologías siguiendo las directrices de la metodología NeOn requiere la realización de distintas actividades y tareas, como el estudio del dominio, estudio de la viabilidad, especificación de requisitos, conceptualización, formalización, implementación y mantenimiento. Se realizan también muchas otras actividades y tareas dependiendo del contexto en el que se construye la ontología. En este proyecto se hace un especial énfasis en las actividades de especificación de requisitos, conceptualización e implementación, además de la actividad de búsqueda de recursos ontológicos para su posterior reutilización. Se ha construido una red de ontologías llamada: European Bachelor Degree Ontology (EBDO) que incluye términos y conceptos importantes que se han detectado en la etapa de especificación de requisitos y que las ontologías a reutilizar no contemplan. Las decisiones de diseño para la construcción de esta nueva red de ontologías y su alineamiento con las ontologías a reutilizar se han basado en la especificación de requisitos ontológicos. Una vez definidos los conceptos relevantes de la red de ontologías, se ha implementado la red de ontologías en un lenguaje computable. Una vez que la red de ontologías se ha implementado se han realizado tareas de evaluación para corregir posible errores. Finalmente, cuando se ha obtenido una versión estable de la ontología, se ha realizado la instanciación de individuos del plan de estudios del grado en Ingeniería Informática de la Universidad Politécnica de Madrid.---ABSTRACT---Given the extensive information surrounding the domain of higher education programs, specifically bachelor degree studies, this bachelor degree project proposes the construction of a model to represent this information by building an ontology network, providing a common definition of important concepts. This network can be reused to build semantic applications that help stakeholders, such as, students, academic and organisational staff, to search and access to timely information. For the construction of this network of ontologies, guidelines and recommendations proposed by the NeOn Methodology [1a] [1b] have been followed. This methodology follows a paradigm based on the reuse of knowledge resources. Moreover, a population of this ontology network is performed with specific data of the Computer Science Degree from Universidad Politécnica de Madrid Building a network of ontologies following the guidelines of the NeOn Methodology requires the completion of various activities and tasks such as, the study of the domain, study of the feasibility, requirements specification, conceptualization, formalization, implementation and maintenance. Many other activities and tasks are also performed depending on the context in which the ontology is built. In this project a special emphasis is made on the activities of requirements specification, conceptualization and search of ontological resources for reuse and implementation. A new network of ontologies, named European Bachelor Degree Ontology (EBDO), has been built. This network includes terms and concepts that have been detected at the stage of requirements specification and that the reused ontologies have not contemplated. Design principles for the construction of this new network of ontologies and for the reused ontologies alignment have been based on the ontological specification requirements. Once the relevant concepts of the ontology network are defined, the network has been implemented in a computable ontology language. Once the network ontology is implemented, the evaluation activity has been conducted to correct the errors that the network presented. Finally, when a stable version of the ontology has been obtained, the instantiation of individuals of the study program of the Bachelor Degree in Computer Science from Universidad Politécnica de Madrid has been performed.

Brownian dynamics simulations of protein folding: Access to milliseconds time scale and beyond

Protein folding occurs on a time scale ranging from milliseconds to minutes for a majority of proteins. Computer simulation of protein folding, from a random configuration to the native structure, is nontrivial owing to the large disparity between the simulation and folding time scales. As an effort to overcome this limitation, simple models with idealized protein subdomains, e.g., the diffusion–collision model of Karplus and Weaver, have gained some popularity. We present here new results for the folding of a four-helix bundle within the framework of the diffusion–collision model. Even with such simplifying assumptions, a direct application of standard Brownian dynamics methods would consume 10,000 processor-years on current supercomputers. We circumvent this difficulty by invoking a special Brownian dynamics simulation. The method features the calculation of the mean passage time of an event from the flux overpopulation method and the sampling of events that lead to productive collisions even if their probability is extremely small (because of large free-energy barriers that separate them from the higher probability events). Using these developments, we demonstrate that a coarse-grained model of the four-helix bundle can be simulated in several days on current supercomputers. Furthermore, such simulations yield folding times that are in the range of time scales observed in experiments.

An Access Control Model for Protecting Provenance Graphs

Postprint

Republican Scientific-Medical Library, The Republic of Armenia: progress and programs*

In 1990, the Republican Scientific-Medical Library (RSML) of the Ministry of Health of Armenia in collaboration with the Fund for Armenian Relief created a vision of a national library network supported by information technology. This vision incorporated four goals: (1) to develop a national resource collection of biomedical literature accessible to all health professionals, (2) to develop a national network for access to bibliographic information, (3) to develop a systematic mechanism for sharing resources, and (4) to develop a national network of health sciences libraries. During the last decade, the RSML has achieved significant progress toward all four goals and has realized its vision of becoming a fully functional national library. The RSML now provides access to the literature of the health sciences including access to the Armenian medical literature, provides education and training to health professionals and health sciences librarians, and manages a national network of libraries of the major health care institutions in Armenia. The RSML is now able to provide rapid access to the biomedical literature and train health professionals and health sciences librarians in Armenia in information system use. This paper describes the evolution of the RSML and how it was accomplished.

A Computer-Assisted Personalized Approach in an Undergraduate Plant Physiology Class1

We used Computer-Assisted Personalized Approach (CAPA), a networked teaching and learning tool that generates computer individualized homework problem sets, in our large-enrollment introductory plant physiology course. We saw significant improvement in student examination performance with regular homework assignments, with CAPA being an effective and efficient substitute for hand-graded homework. Using CAPA, each student received a printed set of similar but individualized problems of a conceptual (qualitative) and/or quantitative nature with quality graphics. Because each set of problems is unique, students were encouraged to work together to clarify concepts but were required to do their own work for credit. Students could enter answers multiple times without penalty, and they were able to obtain immediate feedback and hints until the due date. These features increased student time on task, allowing higher course standards and student achievement in a diverse student population. CAPA handles routine tasks such as grading, recording, summarizing, and posting grades. In anonymous surveys, students indicated an overwhelming preference for homework in CAPA format, citing several features such as immediate feedback, multiple tries, and on-line accessibility as reasons for their preference. We wrote and used more than 170 problems on 17 topics in introductory plant physiology, cataloging them in a computer library for general access. Representative problems are compared and discussed.

Evidence of different thermoregulatory mechanisms between two sympatric Scarabaeus species using infrared thermography and micro-computer tomography

In endotherms insects, the thermoregulatory mechanisms modulate heat transfer from the thorax to the abdomen to avoid overheating or cooling in order to obtain a prolonged flight performance. Scarabaeus sacer and S. cicatricosus, two sympatric species with the same habitat and food preferences, showed daily temporal segregation with S. cicatricosus being more active during warmer hours of the day in opposition to S. sacer who avoid it. In the case of S. sacer, their endothermy pattern suggested an adaptive capacity for thorax heat retention. In S. cicatricosus, an active ‘heat exchanger’ mechanism was suggested. However, no empirical evidence had been documented until now. Thermographic sequences recorded during flight performance showed evidence of the existence of both thermoregulatory mechanisms. In S. sacer, infrared sequences showed a possible heat insulator (passive thermal window), which prevents heat transfer from meso- and metathorax to the abdomen during flight. In S. cicatricosus, infrared sequences revealed clear and effective heat flow between the thorax and abdomen (abdominal heat transfer) that should be considered the main mechanism of thermoregulation. This was related to a subsequent increase in abdominal pumping (as a cooling mechanism) during flight. Computer microtomography scanning, anatomical dissections and internal air volume measurements showed two possible heat retention mechanisms for S. sacer; the abdominal air sacs and the development of the internal abdominal sternites that could explain the thermoregulation between thorax and abdomen. Our results suggest that interspecific interactions between sympatric species are regulated by very different mechanisms. These mechanisms create unique thermal niches for the different species, thereby preventing competition and modulating spatio-temporal distribution and the composition of dung beetle assemblages.

A Survey on FPGA-Based Sensor Systems: Towards Intelligent and Reconfigurable Low-Power Sensors for Computer Vision, Control and Signal Processing

The current trend in the evolution of sensor systems seeks ways to provide more accuracy and resolution, while at the same time decreasing the size and power consumption. The use of Field Programmable Gate Arrays (FPGAs) provides specific reprogrammable hardware technology that can be properly exploited to obtain a reconfigurable sensor system. This adaptation capability enables the implementation of complex applications using the partial reconfigurability at a very low-power consumption. For highly demanding tasks FPGAs have been favored due to the high efficiency provided by their architectural flexibility (parallelism, on-chip memory, etc.), reconfigurability and superb performance in the development of algorithms. FPGAs have improved the performance of sensor systems and have triggered a clear increase in their use in new fields of application. A new generation of smarter, reconfigurable and lower power consumption sensors is being developed in Spain based on FPGAs. In this paper, a review of these developments is presented, describing as well the FPGA technologies employed by the different research groups and providing an overview of future research within this field.

To know or not to know: collection and use of racial and ethnic data in Federal assistance programs; a report.

Prepared by Cynthia Norris Graae, Program analyst, Office of Federal Civil Rights Evaluation.

Development and humanitarian assistance programs, FY 1973 presentation to the Congress, program and project data: Latin America.

Cover title.

Economic policies and programs in Middle America.

Mode of access: Internet.

Economic policies and programs in South America

Mode of access: Internet.

Immigration reform : federal programs show progress in implementing alien verification systems : report to Congressional committees /

"March 1989"