A plug and play spoken dialogue interface for smart environments

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-24630-5_44Proceedings of 5th International Conference, CICLing 2004 Seoul, Korea, February 15-21, 2004In this paper we present a plug and play dialogue system for smart environments. The environment description and its state are stored on a domain ontology. This ontology is formed by entities that represent real world contextual information and abstract concepts. This information is complemented with linguistic parts that allow to automatically create a spoken interface for the environment. The spoken interface is based on multiple dialogues, related to every ontology entity with linguistic information. Firstly, the dialogue system creates appropriate grammars for the dialogues. Secondly, it creates the dialogue parts, employing a tree structure. Grammars support the recognition process and the dialogue tree supports the interpretation and generation processes. The system is being tested with a prototype formed by a living room. Users may interact with and modify the physical state of this living room environment by means of the spoken dialogue interface.This paper has been sponsored by the Spanish Ministry of Science and Technology, project number TIC2000-046

Proximal business intelligence on the semantic web

This is the post-print version of this article. The official version can be accessed from the link below - Copyright @ 2010 Springer.Ubiquitous information systems (UBIS) extend current Information System thinking to explicitly differentiate technology between devices and software components with relation to people and process. Adapting business data and management information to support specific user actions in context is an ongoing topic of research. Approaches typically focus on providing mechanisms to improve specific information access and transcoding but not on how the information can be accessed in a mobile, dynamic and ad-hoc manner. Although web ontology has been used to facilitate the loading of data warehouses, less research has been carried out on ontology based mobile reporting. This paper explores how business data can be modeled and accessed using the web ontology language and then re-used to provide the invisibility of pervasive access; uncovering more effective architectural models for adaptive information system strategies of this type. This exploratory work is guided in part by a vision of business intelligence that is highly distributed, mobile and fluid, adapting to sensory understanding of the underlying environment in which it operates. A proof-of concept mobile and ambient data access architecture is developed in order to further test the viability of such an approach. The paper concludes with an ontology engineering framework for systems of this type – named UBIS-ONTO

Evidence of polariton induced transparency in a single organic quantum wire

The resonant interaction between quasi-one dimensional excitons and photons is investigated. For a single isolated organic quantum wire, embedded in its single crystal monomer matrix, the strong exciton-photon coupling regime is reached. This is evidenced by the suppression of the resonant excitonic absorption arising when the system eigenstate is a polariton. These observations demonstrate that the resonant excitonic absorption in a semiconductor can be understood in terms of a balance between the exciton coherence time and the Rabi period between exciton-like and photon-like states of the polariton.Comment: 9 pages and 4 figure

Agricultural and Finance Intervention Increased Dietary Intake and Weight of Children Living in HIV-Affected Households in Western Kenya.

We tested whether a multisectoral household agricultural and finance intervention increased the dietary intake and improved the nutritional status of HIV-affected children. Two hospitals in rural Kenya were randomly assigned to be either the intervention or the control arm. The intervention comprised a human-powered water pump, microfinance loan for farm commodities, and training in sustainable farming practices and financial management. In each arm, 100 children (0-59 mo of age) were enrolled from households with HIV-infected adults 18-49 y old. Children were assessed beginning in April 2012 and every 3 mo for 1 y for dietary intake and anthropometry. Children in the intervention arm had a larger increase in weight (β: 0.025 kg/mo, P = 0.030), overall frequency of food consumption (β: 0.610 times · wk-1 · mo-1, P = 0.048), and intakes of staples (β: 0.222, P = 0.024), fruits and vegetables (β: 0.425, P = 0.005), meat (β: 0.074, P < 0.001), and fat (β: 0.057, P = 0.041). Livelihood interventions have potential to improve the nutrition of HIV-affected children. This trial was registered at clinicaltrials.gov as NCT01548599

Energy-Efficient Work-Stealing Language Runtimes

Work stealing is a promising approach to constructing multithreaded program runtimes of parallel programming languages. This paper presents HERMES, an energy-efficient work-stealing language runtime. The key insight is that threads in a work-stealing environment – thieves and victims – have varying impacts on the overall program running time, and a coordination of their execution “tempo ” can lead to energy efficiency with minimal performance loss. The centerpiece of HERMES is two complementary algorithms to coordinate thread tempo: the workpath-sensitive algorithm determines tempo for each thread based on thief-victim relationships on the execution path, whereas the workload-sensitive algorithm selects appropriate tempo based on the size of work-stealing deques. We construct HERMES on top of Intel Cilk Plus’s runtime, and implement tempo adjustment through standard Dynamic Voltage and Frequency Scaling (DVFS). Benchmarks running on HERMES demonstrate an average of 11-12 % energy savings with an average of 3-4% performance loss through meter-based measurements over commercial CPUs. 1

On the computational complexity of dynamic slicing problems for program schemas

This is the preprint version of the Article - Copyright @ 2011 Cambridge University PressGiven a program, a quotient can be obtained from it by deleting zero or more statements. The field of program slicing is concerned with computing a quotient of a program that preserves part of the behaviour of the original program. All program slicing algorithms take account of the structural properties of a program, such as control dependence and data dependence, rather than the semantics of its functions and predicates, and thus work, in effect, with program schemas. The dynamic slicing criterion of Korel and Laski requires only that program behaviour is preserved in cases where the original program follows a particular path, and that the slice/quotient follows this path. In this paper we formalise Korel and Laski's definition of a dynamic slice as applied to linear schemas, and also formulate a less restrictive definition in which the path through the original program need not be preserved by the slice. The less restrictive definition has the benefit of leading to smaller slices. For both definitions, we compute complexity bounds for the problems of establishing whether a given slice of a linear schema is a dynamic slice and whether a linear schema has a non-trivial dynamic slice, and prove that the latter problem is NP-hard in both cases. We also give an example to prove that minimal dynamic slices (whether or not they preserve the original path) need not be unique.This work was partly supported by the Engineering and Physical Sciences Research Council, UK, under grant EP/E002919/1

A Goal-based Framework for Contextual Requirements Modeling and Analysis

Requirements Engineering (RE) research often ignores, or presumes a uniform nature of the context in which the system operates. This assumption is no longer valid in emerging computing paradigms, such as ambient, pervasive and ubiquitous computing, where it is essential to monitor and adapt to an inherently varying context. Besides influencing the software, context may influence stakeholders' goals and their choices to meet them. In this paper, we propose a goal-oriented RE modeling and reasoning framework for systems operating in varying contexts. We introduce contextual goal models to relate goals and contexts; context analysis to refine contexts and identify ways to verify them; reasoning techniques to derive requirements reflecting the context and users priorities at runtime; and finally, design time reasoning techniques to derive requirements for a system to be developed at minimum cost and valid in all considered contexts. We illustrate and evaluate our approach through a case study about a museum-guide mobile information system

Multiple Parton Interactions, top--antitop and W+4j production at the LHC

The expected rate for Multiple Parton Interactions (MPI) at the LHC is large. This requires an estimate of their impact on all measurement foreseen at the LHC while opening unprecendented opportunities for a detailed study of these phenomena. In this paper we examine the MPI background to top-antitop production, in the semileptonic channel, in the early phase of data taking when the full power of $b$--tagging will not be available. The MPI background turns out to be small but non negligible, of the order of 20% of the background provided by W+4j production through a Single Parton Interaction. We then analyze the possibility of studying Multiple Parton Interactions in the W+4j channel, a far more complicated setting than the reactions examined at lower energies. The MPI contribution turns out to be dominated by final states with two energetic jets which balance in transverse momentum, and it appears possible, thanks to the good angular resolution of ATLAS and CMS, to separate the Multiple Parton Interactions contribution from Single Parton Interaction processes. The large cross section for two jet production suggests that also Triple Parton Interactions (TPI) could provide a non negligible contribution. Our preliminary analysis suggests that it might be indeed possible to investigate TPI at the LHC.Comment: Typos fixed. Published in JHE

Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization

Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and control variables, and their representation on the discrete level as quadratic programming problems. To tackle complex problems and achieve high accuracy in the solution, one is required to solve matrix systems of huge scale resulting from Newton iteration, and hence fast and robust methods for these systems are required. We present preconditioned iterative techniques for solving a number of these problems using Krylov subspace methods, considering in what circumstances one may predict rapid convergence of the solvers in theory, as well as the solutions observed from practical computations

Semantic-based policy engineering for autonomic systems

This paper presents some important directions in the use of ontology-based semantics in achieving the vision of Autonomic Communications. We examine the requirements of Autonomic Communication with a focus on the demanding needs of ubiquitous computing environments, with an emphasis on the requirements shared with Autonomic Computing. We observe that ontologies provide a strong mechanism for addressing the heterogeneity in user task requirements, managed resources, services and context. We then present two complimentary approaches that exploit ontology-based knowledge in support of autonomic communications: service-oriented models for policy engineering and dynamic semantic queries using content-based networks. The paper concludes with a discussion of the major research challenges such approaches raise