Stress in interactive applications: analysis of the valence-arousal space based on physiological signals and self-reported data

Measuring users’ emotional reaction to interactive multimedia and hypermedia is important. One particularly popular self-reported method for emotion assessment is the Valence-Arousal (VA) Scale: a 9?×?9 affective grid. This paper aims to identify specific stress region(s) in the VA space by combining self-reported ratings (pairs of VA) and physiological signals (skin conductance). To this end, 31 healthy volunteers participated in an experiment by performing five stressful interaction tasks while their skin conductance was monitored. The selected interaction tasks were most frequently listed as stressful by a separate group of 15 interviewees. After each task, participants expressed their perceived emotional experience using the VA rating space. Our findings show which regions in the VA rating space may reliably indicate self-reported stress that is in alignment with one’s measured skin conductance while using interactive applications. One additional important contribution of this work is the proposed approach for the empirical identification of affect regions in the VA space based on physiological signals.     

基建仓库

基建仓库项目位于莱瓦顿的Harlingervaart运河岸边,作为周边建筑的仓库,它具有独特的趣味性良好的形体感,因此被认为是立于运河沿岸广场上的一座雕塑。建筑的入口处挑出悬臂,并且顺势突出建筑南侧的体量     

Fast and Exact Warping of Time Series Using Adaptive Segmental Approximations

Similarity search is a core module of many data analysis tasks, including search by example, classification, and clustering. For time series data, Dynamic Time Warping (DTW) has been proven a very effective similarity measure, since it minimizes the effects of shifting and distortion in time. However, the quadratic cost of DTW computation to the length of the matched sequences makes its direct application on databases of long time series very expensive. We propose a technique that decomposes the sequences into a number of segments and uses cheap approximations thereof to compute fast lower bounds for their warping distances. We present several, progressively tighter bounds, relying on the existence or not of warping constraints. Finally, we develop an index and a multi-step technique that uses the proposed bounds and performs two levels of filtering to efficiently process similarity queries. A thorough experimental study suggests that our method consistently outperforms state-of-the-art methods for DTW similarity search.     

Reverse nearest neighbors in large graphs

A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we provide a fundamental lemma, which can be used to prune the search space while traversing the graph in search for RNN. Based on it, we develop two RNN methods; an eager algorithm that attempts to prune network nodes as soon as they are visited and a lazy technique that prunes the search space when a data point is discovered. We study retrieval of an arbitrary number k of reverse nearest neighbors, investigate the benefits of materialization, cover several query types, and deal with cases where the queries and the data objects reside on nodes or edges of the graph. The proposed techniques are evaluated in various practical scenarios involving spatial maps, computer networks, and the DBLP coauthorship graph.     

Reference structure tomography

Reference structure tomography (RST) uses multidimensional modulations to encode mappings between radiating objects and measurements. RST may be used to image source-density distributions, estimate source parameters, or classify sources. The RST paradigm permits scan-free multidimensional imaging, data-efficient and computation-efficient source analysis, and direct abstraction of physical features. We introduce the basic concepts of RST and illustrate the use of RST for multidimensional imaging based on a geometric radiation model.     

Searching efficient plans for emergency rescue through simulation: the case of a metro fire

In this paper we present the way we modelled and simulated a metro system in the case of a tunnel fire, and discuss the ways this simulation may support the search for efficient rescue plans. The metro system was modelled as a complex adaptive system, comprising four interacting and co-evolving subsystems: (i) the fire and the released smoke, (ii) the group of passengers, (iii) the technological system, and (iv) the metro personnel. Based on this model, an agent-based simulation was developed. This simulation provides an appropriate dynamic representation of the designers problem space, enabling him (i) to apprehend the critical dependencies and invariants of the system under consideration, (ii) to identify the features that should characterise the designed emergency rescue plans, and (iii) to assess their efficiency. To demonstrate the usefulness of the adopted approach for the design of an efficient emergency rescue plan, the results of two experiments exploring alternative sequences of the metro personnels actions under different circumstances are presented.     

MeteoBayes: Effective Plan Recognition in a Weather Dialogue System

When you've called a voice portal for any kind of information retrieval, chances are that an automated system guided the entire interaction. It might have correctly identified your goal, but probably only after asking too many questions. MeteoBayes is a meteorological information dialogue system that lets you use natural language to direct the interaction. Based on Bayesian networks, MeteoBayes' inference engine attempts to identify user intentions by consulting its past dialogue repository. For unfamiliar words, MeteoBayes has an unknown-term disambiguation module that learns word similarities from texts to avoid unnecessary system inquiries, thus speeding up the understanding process     

Gaussian Mixture Clustering and Language Adaptation for the Development of a New Language Speech Recognition System

The porting of a speech recognition system to a new language is usually a time-consuming and expensive process since it requires collecting, transcribing, and processing a large amount of language-specific training sentences. This work presents techniques for improved cross-language transfer of speech recognition systems to new target languages. Such techniques are particularly useful for target languages where minimal amounts of training data are available. We describe a novel method to produce a language-independent system by combining acoustic models from a number of source languages. This intermediate language-independent acoustic model is used to bootstrap a target-language system by applying language adaptation. For our experiments, we use acoustic models of seven source languages to develop a target Greek acoustic model. We show that our technique significantly outperforms a system trained from scratch when less than 8 h of read speech is available