Ontological reasoning for improving the treatment of emotions in text

With the advent of affective computing, the task of adequately identifying, representing and processing the emotional connotations of text has acquired importance. Two problems facing this task are addressed in this paper: the composition of sentence emotion from word emotion, and a representation of emotion that allows easy conversion between existing computational representations. The emotion of a sentence of text should be derived by composition of the emotions of the words in the sentence, but no method has been proposed so far to model this compositionality. Of the various existing approaches for representing emotions, some are better suited for some problems and some for others, but there is no easy way of converting from one to another. This paper presents a system that addresses these two problems by reasoning with two ontologies implemented with Semantic Web technologies: one designed to represent word dependency relations within a sentence, and one designed to represent emotions. The ontology of word dependency relies on roles to represent the way emotional contributions project over word dependencies. By applying automated classification of mark-up results in terms of the emotion ontology the system can interpret unrestricted input in terms of a restricted set of concepts for which particular rules are provided. The rules applied at the end of the process provide configuration parameters for a system for emotional voice synthesis.     

Nogood-FC for solving partitionable constraint satisfaction problems

Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a graph partitioning software; after partitioning, each sub-CSP is arranged into a DFS-tree CSP structure that is used as a hierarchy of communication by our distributed algorithm. We show that our distributed algorithm outperforms well-known centralized algorithms solving partitionable CSPs.     

Rule-based tools for the configuration of ambient intelligence systems: a comparative user study

Multimedia Tools and Applications - This paper describes a 63-participant user study that compares two widely known systems supporting end users in creating trigger-action rules for the Internet of...     

Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form

This paper describes an algorithm to enforce hyper-arc consistency of polynomial constraints defined over finite domains. First, the paper describes the language of so called polynomial constraints over finite domains, and it introduces a canonical form for such constraints. Then, the canonical form is used to transform the problem of testing the satisfiability of a constraint in a box into the problem of studying the sign of a related polynomial function in the same box, a problem which is effectively solved by using the modified Bernstein form of polynomials. The modified Bernstein form of polynomials is briefly discussed, and the proposed hyper-arc consistency algorithm is finally detailed. The proposed algorithm is a subdivision procedure which, starting from an initial approximation of the domains of variables, removes values from domains to enforce hyper-arc consistency.     

Turbulent premixed flame model based on a recent dispersion model

A model of turbulent premixed combustion is formulated based on a recent dispersion model and on earlier flame models. The dispersion model accounts for the effect of velocity correlation on turbulent dispersion without using parameters that are explicitly dependent on time or space. The earlier flame models are used as a basis for formulating an appropriate chemical source term. The resulting model is more general than the earlier models.The proposed model and one of the earlier models are validated against various experimental flames. It is shown that the proposed model is more accurate and requires less calibration. Furthermore, the proposed model is tested successfully against general criteria for premixed combustion modeling formulated in earlier works. It is therefore concluded that the dispersion model is a useful tool for premixed combustion modeling.     

Stepwise dissection and visualization of the catalytic mechanism of haloalkane dehalogenase LinB using molecular dynamics simulations and computer graphics

The different steps of the dehalogenation reaction carried out by LinB on three different substrates have been characterized using a combination of quantum mechanical calculations and molecular dynamics simulations. This has allowed us to obtain information in atomic detail about each step of the reaction mechanism, that is, substrate entrance and achievement of the near-attack conformation, transition state stabilization within the active site, halide stabilization, water molecule activation and subsequent hydrolytic attack on the ester intermediate with formation of alcohol, and finally product release. Importantly, no bias or external forces were applied during the whole procedure so that both intermediates and products were completely free to sample configuration space in order to adapt to the plasticity of the active site and/or search for an exit. Differences in substrate reactivity were found to be correlated with the ease of adopting the near-attack conformation and two different exit pathways were found for product release that do not interfere with substrate entrance. Additional support for the different entry and exit pathways was independently obtained from an examination of the enzyme's normal modes.     

Information systems for enhancing social experience in a conference context: A sensor based approach

We combine Auto Identification and Web technologies in an extensible on-site event support system for enhancing experience of conference organizers as well as participants. Our system enables users to authenticate themselves using RFID badges and to access interactive, Web-based services via a touchscreen PC. The developed services aim at supporting social interactions of participants, and thus validate the promising usage directions of the combination of offline social networks and the online social Web. The main hypothesis of our work is that: ??A sensor based information system can truly enhance social conference experience.?? Technically, we have investigated employment of Web 2.0 technologies in social, sensor and mobile technologies enabled systems at conferences and events. This article gives an overview of the overall system and its evaluation via a user survey and usage log data collected during the Extended Semantic Web Conference (ESWC) 2010 and similar international conferences, altogether with several hundred participants.     

A Mixed Closure-CSP Method for Solving Scheduling Problems

Scheduling problems can be viewed as a set of temporal metric and disjunctive constraints and so they can be formulated in terms of CSP techniques. In the literature, there are CSP-based methods which sequentially interleave search efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Therefore, the number of backtrackings needed to obtain a solution is reduced. In this paper, we propose a new method that effectively integrates the CSP process into a limited closure process: not by interleaving them but rather as a part of the same process. Such an integration allows us to define more informed heuristics. These heuristics are used to limit the complete closure process to a maximum number of disjunctions, thereby reducing its complexity while at the same time reducing the search space. Some open disjunctive solutions can be maintained in the CSP process, limiting the number of backtrackings necessary, and avoiding having to know all the problem constraints in advance. Our experiments with flow-shop and job-shop instances show that this approach obtains a feasible solution/optimal solution without having to use backtracking in most cases. We also analyze the behaviour of our algorithm when some constraints are known dynamically and we demonstrate that it can provide better results than a pure CSP process.     

Non-Gaussian Model for Ringing Phenomena in Offshore Structures

Significant interest has been shown in identifying the nonlinear mechanisms that induce a ringing type response in offshore structural systems. This high frequency transient type response has been observed in offshore systems, particularly in tension leg platforms (TLPs). Given the implications of this behavior on the fatigue life of TLP tendons, it is essential that ringing be considered in the overall response evaluation. This study presents two non-Gaussian probabilistic models of nonlinear viscous hydrodynamic wave forces that induce ringing. The response of a single-degree-of-freedom system exposed to these non-Gaussian wave force models is then evaluated using analytical and numerical studies based on the It? differentiation rule and the Monte Carlo simulation procedure, respectively. The results demonstrate that the proposed models induce ringing type response in a simplified structure. This study provides a probabilistic framework for modeling ringing type phenomenon which will serve as a building block for more refined hydrodynamic load models.