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.     

From Images to Shape Models for Object Detection

We present an object class detection approach which fully integrates the complementary strengths offered by shape matchers. Like an object detector, it can learn class models directly from images, and can localize novel instances in the presence of intra-class variations, clutter, and scale changes. Like a shape matcher, it finds the boundaries of objects, rather than just their bounding-boxes. This is achieved by a novel technique for learning a shape model of an object class given images of example instances. Furthermore, we also integrate Hough-style voting with a non-rigid point matching algorithm to localize the model in cluttered images. As demonstrated by an extensive evaluation, our method can localize object boundaries accurately and does not need segmented examples for training (only bounding-boxes).     

Information systems in the public sector: The e-Government enactment framework

Despite the burgeoning number of studies of public sector information systems, very few scholars have focussed on the relationship between e-Government policies and information systems choice and design. Drawing on Fountain’s (2001) technology enactment framework, this paper endeavours to conduct an in-depth investigation of the intricacies characterising the choice and design of new technologies in the context of e-Government reforms. By claiming that technologies are carriers of e-Government reform aims, this study investigates the logics embedded in the design of new technology and extant political interests and values inscribed in e-Government policies. The e-Government enactment framework is proposed as a theoretical and analytical approach to understand and study the complexity of these relationships which shape e-Government policies.     

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.     

SusyMath: A Mathematica package for quantum superfield calculations

SusyMath is a Mathematica package for quantum superfield calculations. It defines a standard form to translate the correction to the effective action corresponding to a given supergraph into a Mathematica expression, which is then evaluated and simplified. Several functions for manipulations of these expressions are provided, and the package also has the ability to save the outcomes of its calculations in form.

Program summary

Title of program: SusyMathCatalogue identifier:ADYQ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYQ_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland, also at http://fma.if.usp.br/~alysson/SusyMathLicensing provisions: LGPL, CPC non-profit use licenseProgramming language: MathematicaPlatform: Any platform supporting Mathematica 4.0 or higherComputer tested on: PC (Athlon64 X2 +3800); 1 GB RAMOperating system under which the program has been tested: Linux (Debian 4.0); XOrg 7.0.22; Mathematica 5.2No. of lines in distributed program, including test data, etc.:42 472No. of bytes in distributed program, including test data, etc.:471 596Distribution format:tar.gzNature of the problem: Evaluate quantum corrections to the effective action of supersymmetric field theories, formulated in the superfield formalism, both in three- and four-spacetime dimensions.Solution method: A set of procedures for integration by parts, application of the algebra of covariant derivatives and Grassman integration, along with several auxiliary functions, is introduced.Restrictions: At the moment, the background field method is not implemented, but the system is designed to be further generalized.Running time: Depends on the complexity of the problem. From seconds for simpler one-loop diagrams to several hours for simple two-loop graphs.     

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.