pinecone/core-2020-05-10-deduplication huggingface dataset:
Differencing labeled transition systems

Concurrent programs often use Labeled Transition Systems (LTSs) as their operational semantic models, which provide the basis for automatic system analysis and verification. System behaviors (generated from the operational semantics) evolve as programs evolve for fixing bugs or implementing new user requirements. Even when a program remains unchanged, its LTS models explored by a model checker or analyzer may be different due to the application of different exploration methods. In this paper, we introduce a novel approach (named SpecDiff) to computing the differences between two LTSs, representing the evolving behaviors of a concurrent program. SpecDiff considers LTSs as Typed Attributed Graphs (TAGs), in which states and transitions are encoded in finite dimensional vector spaces. It then computes a maximum common subgraph of two TAGs, which represents an optimal matching of states and transitions between two evolving LTSs of the concurrent program. SpecDiff has been implemented in our home grown model checker framework PAT. Our evaluation demonstrates that SpecDiff can assist in debugging system faults, understanding the impacts of state reduction techniques, and revealing system change patterns.Full Tex
Verification of orchestration systems using compositional partial order reduction

Orc is a computation orchestration language which is designed to specify computational services, such as distributed communication and data manipulation, in a concise and elegant way. Four concurrency primitives allow programmers to orchestrate site calls to achieve a goal, while managing timeouts, priorities, and failures. To guarantee the correctness of Orc model, effective verification support is desirable. Orc has a highly concurrent semantics which introduces the problem of state-explosion to search-based verification methods like model checking. In this paper, we present a new method, called Compositional Partial Order Reduction (CPOR), which aims to provide greater state-space reduction than classic partial order reduction methods in the context of hierarchical concurrent processes. Evaluation shows that CPOR is more effective in reducing the state space than classic partial order reduction methods.Full Tex
A highly scalable parallel implementation of H.264

Developing parallel applications that can harness and efficiently use future many-core architectures is the key challenge for scalable computing systems. We contribute to this challenge by presenting a parallel implementation of H.264 that scales to a large number of cores. The algorithm exploits the fact that independent macroblocks (MBs) can be processed in parallel, but whereas a previous approach exploits only intra-frame MB-level parallelism, our algorithm exploits intra-frame as well as inter-frame MB-level parallelism. It is based on the observation that inter-frame dependencies have a limited spatial range. The algorithm has been implemented on a many-core architecture consisting of NXP TriMedia TM3270 embedded processors. This required to develop a subscription mechanism, where MBs are subscribed to the kick-off lists associated with the reference MBs. Extensive simulation results show that the implementation scales very well, achieving a speedup of more than 54 on a 64-core processor, in which case the previous approach achieves a speedup of only 23. Potential drawbacks of the 3D-Wave strategy are that the memory requirements increase since there can be many frames in flight, and that the frame latency might increase. Scheduling policies to address these drawbacks are also presented. The results show that these policies combat memory and latency issues with a negligible effect on the performance scalability. Results analyzing the impact of the memory latency, L1 cache size, and the synchronization and thread management overhead are also presented. Finally, we present performance requirements for entropy (CABAC) decoding.\ud
\ud
This work was performed while the fourth author was with NXP Semiconductors.Peer ReviewedPostprint (author's final draft
Naturalistic Affective Expression Classification by a Multi-Stage Approach Based on Hidden Markov Models

In naturalistic behaviour, the affective states of a person\ud
change at a rate much slower than the typical rate at which video or\ud
audio is recorded (e.g. 25fps for video). Hence, there is a high probability\ud
that consecutive recorded instants of expressions represent a same\ud
affective content. In this paper, a multi-stage automatic affective expression\ud
recognition system is proposed which uses Hidden Markov Models\ud
(HMMs) to take into account this temporal relationship and finalize the\ud
classification process. The hidden states of the HMMs are associated\ud
with the levels of affective dimensions to convert the classification problem\ud
into a best path finding problem in HMM. The system was tested on\ud
the audio data of the Audio/Visual Emotion Challenge (AVEC) datasets\ud
showing performance significantly above that of a one-stage classification\ud
system that does not take into account the temporal relationship, as well\ud
as above the baseline set provided by this Challenge. Due to the generality\ud
of the approach, this system could be applied to other types of\ud
affective modalities
Analysing the relevance of experience partitions to the prediction of players’ self-reports of affect

A common practice in modeling affect from physiological signals consists of reducing the signals to a set of statistical features that feed predictors of self-reported emotions. This paper analyses the impact of various time-windows, used for the extraction of physiological features, to the accuracy of affective models of players in a simple 3D game. Results show that the signals recorded in the central part of a short gaming experience contain more relevant information to the prediction of positive affective states than the starting and ending parts while the relevant information to predict anxiety and frustration appear not to be localized in a specific time interval but rather dependent on particular game stimuli.peer-reviewe
A game-based corpus for analysing the interplay between game context and player experience

Recognizing players’ affective state while playing video games has been the focus of many recent research studies. In this paper we describe the process that has been followed to build a corpus based on game events and recorded video sessions from human players while playing Super Mario Bros. We present different types of information that have been extracted from game context, player preferences and perception of the game, as well as user features, automatically extracted from video recordings. We run a number of initial experiments to analyse players’ behavior while playing video games as a case study of the possible use of the corpus.peer-reviewe
A model-driven approach for enforcing summarizability in multidimensional modeling

The development of a data warehouse system is based on a conceptual multidimensional model, which provides a high level of abstraction in the accurate and expressive description of real-world situations. Once this model has been designed, the corresponding logical representation must be obtained as the basis of the implementation of the data warehouse according to one specific technology. However, there is a semantic gap between the dimension hierarchies modeled in a conceptual multidimensional model and its implementation. This gap particularly complicates a suitable treatment of summarizability issues, which may in turn lead to erroneous results from business intelligence tools. Therefore, it is crucial not only to capture adequate dimension hierarchies in the conceptual multidimensional model of the data warehouse, but also to correctly transform these multidimensional structures in a summarizability-compliant representation. A model-driven normalization process is therefore defined in this paper to address this summarizability-aware transformation of the dimension hierarchies in rich conceptual models.This work has been partially supported by the following projects: SERENIDAD (PEII-11-0327-7035) from Junta de Comunidades de Castilla-La Mancha (Spain) and by the MESOLAP (TIN2010-14860) project from the Spanish Ministry of Education and Science
Levels for Conceptual Modeling

Usually object types are organized in taxonomies by means of a specialization relation (also called subtyping or isa) \u27implemented\u27 by means of inheritance. This paper proposes a (non-incompatible) alternative to taxonomies that relies on three primitives: grounding, a specific kind of factual existential dependence, extensional atemporal parthood, and existence at a time. On the basis of these relations, specific, generic, and compositional grounding relations between object types are introduced. By clearly separating the objects from the substrata on which they are grounded, these grounding relations allow to stratify object types in levels and to manage inheritance in a flexible way. In particular, this approach helps to avoid isa overloading and to overcome some classical difficulties related to inheritance, e.g. attribute overriding, attribute hiding, or dynamic and multiple classification and specialization, that are relevant aspects especially in modeling roles
A goal-oriented approach for optimizing non-functional requirements in web applications

Web design methodologies should be able to provide a requirements analysis stage to consider the large and heterogeneous audience of Web applications. In this stage, non-functional requirements (NFRs) should be addressed in order to improve the quality of the Web application perceived by users. To this aim, different configurations of requirements could be implemented depending on the NFRs preferred by the Web user. Furthermore, prioritizing and making tradeoffs between NFRs is crucial for satisfying the audience of Web applications. Therefore, this work presents an algorithm based on the Pareto optimal approach to evaluate and select the optimal configuration of requirements for a Web application. To do this, the NFRs are maximized according to a priority list provided by the audience. Our approach is illustrated with a running example.This work has been partially supported by the MANTRA project (GV/2011/035) from the University of Alicante, and by the MESOLAP (TIN2010-14860) from the Spanish Ministry of Education and Science. José Alfonso Aguilar is subventioned by CONACYT (Consejo Nacional de Ciencia y Tecnología) Mexico and University of Sinaloa, Mexico
A tool for filtering large conceptual schemas

The wealth of knowledge the conceptual schemas of many real-world information systems contain makes them very useful to their potential target audience. However, the sheer size of those schemas makes it difficult to extract knowledge from them. There are many information system development activities in which people needs to get a piece of the knowledge contained in a large conceptual schema. We present an
information filtering tool in which a user focuses on one or more entity types of interest for her task at hand, and the tool automatically filters the schema in order to obtain a reduced conceptual schema including a set of entity and relationship types (and other knowledge) relevant to that task.Peer ReviewedPostprint (published version
Smile: Enabling easy and fast development of domain-specific scheduling protocols

Modern server systems schedule large amounts of concurrent requests constrained by, e.g., correctness criteria and service-level agreements. Since standard database management systems provide only limited consistency levels, the state of the art is to develop schedulers imperatively which is time-consuming and error-prone. In this poster, we present Smile (declarative Scheduling MIddLEware), a tool for developing domain-specific scheduling protocols declaratively. Smile decreases the effort to implement and adapt such protocols because it abstracts from low level scheduling details allowing developers to focus on the protocol implementation. We demonstrate the advantages of our approach by implementing a domain-specific use case protocol
Assessing Test Adequacy for Black Box Systems without Specifications

Testing a black-box system without recourse to a specification is difficult, because there is no basis for estimating how many tests will be required, or to assess how complete a given test set is. Several researchers have noted that there is a duality between these testing problems and the problem of inductive inference (learning a model of a hidden system from a given set of examples). It is impossible to tell how many examples will be required to infer an accurate model, and there is no basis for telling how complete a given set of examples is. These issues have been addressed in the domain of inductive inference by developing statistical techniques, where the accuracy of an inferred model is subject to a tolerable degree of error. This paper explores the application of these techniques to assess test sets of black-box systems. It shows how they can be used to reason in a statistically justified manner about the number of tests required to fully exercise a system without a specification, and how to provide a valid adequacy measure for black-box test sets in an applied context.Peer-reviewedPost-printThe 23rd International Conference on Testing Software and Systems (ICTSS), Paris, 7-10 November 201
On-Line Construction of Position Heaps

International audienceWe propose a simple linear-time on-line algorithm for constructing a position heap for a string [EMOW11]. Our definition of position heap differs slightly from the one proposed in [EMOW11] in that it considers the suffixes ordered in the descending order of length. Our construction is based on classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees [Ukk95]. Using suffix pointers, the position heap can be extended into the augmented position heap that allows for a linear-time string matching algorithm [EMOW11]
Call Center Stress Recognition with Person-Specific Models

Nine call center employees wore a skin conductance sensor
on the wrist for a week at work and reported stress levels of each call.
Although everyone had the same job profile, we found large differences
in how individuals reported stress levels, with similarity from day to day
within the same participant, but large differences across the participants.
We examined two ways to address the individual differences to automat-
ically recognize classes of stressful/non-stressful calls, namely modifying
the loss function of Support Vector Machines (SVMs) to adapt to the
varying priors, and giving more importance to training samples from the
most similar people in terms of their skin conductance lability. We tested
the methods on 1500 calls and achieved an accuracy across participants
of 78.03% when trained and tested on different days from the same per-
son, and of 73.41% when trained and tested on different people using the
proposed adaptations to SVMs
Are you friendly or just polite? - analysis of smiles in spontaneous face-to-face interactions

This work is part of a research effort to understand and characterize the morphological and dynamic features of polite and amused smiles. We analyzed a dataset consisting of young adults (n=61), interested in learning about banking services, who met with a professional banker face-to-face in a conference room while both participants’ faces were unobtrusively recorded. We analyzed 258 instances of amused and polite smiles from this dataset, noting also if they were shared, which we defined as if the rise of one starts before the decay of another. Our analysis confirms previous findings showing longer durations of amused smiles while also suggesting new findings about symmetry of the smile dynamics. We found more symmetry in the velocities of the rise and decay of the amused smiles, and less symmetry in the polite smiles. We also found fastest decay velocity for polite but shared smiles.National Science Foundation (U.S.) (NSF IIS Award HCC-0705647)MIT Media Lab Consortiu
Multi-score Learning for Affect Recognition: the Case of Body Postures

An important challenge in building automatic affective state\ud
recognition systems is establishing the ground truth. When the groundtruth\ud
is not available, observers are often used to label training and testing\ud
sets. Unfortunately, inter-rater reliability between observers tends to\ud
vary from fair to moderate when dealing with naturalistic expressions.\ud
Nevertheless, the most common approach used is to label each expression\ud
with the most frequent label assigned by the observers to that expression.\ud
In this paper, we propose a general pattern recognition framework\ud
that takes into account the variability between observers for automatic\ud
affect recognition. This leads to what we term a multi-score learning\ud
problem in which a single expression is associated with multiple values\ud
representing the scores of each available emotion label. We also propose\ud
several performance measurements and pattern recognition methods for\ud
this framework, and report the experimental results obtained when testing\ud
and comparing these methods on two affective posture datasets
Generic physiological features as predictors of player experience

This paper examines the generality of features extracted from heart rate (HR) and skin conductance (SC) signals as predictors of self-reported player affect expressed as pairwise preferences. Artificial neural networks are trained to accurately map physiological features to expressed affect in two dissimilar and independent game surveys. The performance of the obtained affective models which are trained on one game is tested on the unseen physiological and self-reported data of the other game. Results in this early study suggest that there exist features of HR and SC such as average HR and one and two-step SC variation that are able to predict affective states across games of different genre and dissimilar game mechanics.peer-reviewe
Rating vs. preference : a comparative study of self-reporting

This paper introduces a comparative analysis between rating and pairwise self-reporting via questionnaires in user survey experiments. Two dissimilar game user survey experiments are employed in which the two questionnaire schemes are tested and compared for reliable affect annotation. The statistical analysis followed to test our hypotheses shows that even though the two self-reporting schemes are consistent there are significant order of reporting effects when subjects report via a rating questionnaire. The paper concludes with a discussion of the appropriateness of each self-reporting scheme under conditions drawn from the experimental results obtained.peer-reviewe
Theoretical aspects of Andreev spectroscopy and tunneling spectroscopy
  in non-centrosymmetric superconductors: a topical review

Tunneling spectroscopy at surfaces of unconventional superconductors has
proven an invaluable tool for obtaining information about the pairing symmetry.
It is known that mid gap Andreev bound states manifest itself as a zero bias
conductance peak in tunneling spectroscopy. The zero bias conductance peak is a
signature for a non-trivial pair potential that exhibits different signs on
different regions of the Fermi surface. Here, we review recent theoretical
results on the spectrum of Andreev bound states near interfaces and surfaces in
non-centrosymmetric superconductors. We introduce a theoretical scheme to
calculate the energy spectrum of a non-centrosymmetric superconductor. Then, we
discuss the interplay between the spin orbit vector field on the Fermi surface
and the order parameter symmetry. The Andreev states carry a spin supercurrent
and represent a helical edge mode along the interface. We study the topological
nature of the resulting edge currents. If the triplet component of the order
parameter dominates, then the helical edge mode exists. If, on the other hand,
the singlet component dominates, the helical edge mode is absent. A quantum
phase transition occurs for equal spin singlet and triplet order parameter
components. We discuss the tunneling conductance and the Andreev point contact
conductance between a normal metal and a non-centrosymmetric superconductor.Comment: 42 pages, 11 figure
Towards Optimal Bounds on the Recoverable Strains in Polycrystalline Shape Memory Alloys

International audienceThe set of recoverable (or stress-free) strains plays a central role in the peculiar properties of shape memory alloys. New upper bounds are presented for estimating the recoverable strains of polycrystalline shape memory alloys, in the finite strains setting. Those bounds take the texture of the polycrystal (i.e. the shapes, distribution and orientations of the grains) into account. A reference two-orientation problem is studied for investigating the optimality of the bounds proposed
Hybrid specification of reactive systems: an institutional approach

This paper introduces a rigorous methodology for requirements specification of systems that react to external stimulus by evolving through different operational modes. In each mode different functionalities are provided. Starting from a classical state-machine specification, the envisaged methodology interprets each state as a different mode of operation endowed with an algebraic specification of the corresponding functionality. Specifications are given in an expressive variant of hybrid logic which is, at a later stage, translated into first-order logic to bring into scene suitable tool support. The paper’s main contribution is to pro- vide rigorous foundations for the method, framing specification logics as institutions and the translation process as a comorphism between them.Fundação para a Ciência e a Tecnologia (FCT)
Breakup reaction models for two- and three-cluster projectiles

Breakup reactions are one of the main tools for the study of exotic nuclei,
and in particular of their continuum. In order to get valuable information from
measurements, a precise reaction model coupled to a fair description of the
projectile is needed. We assume that the projectile initially possesses a
cluster structure, which is revealed by the dissociation process. This
structure is described by a few-body Hamiltonian involving effective forces
between the clusters. Within this assumption, we review various reaction
models. In semiclassical models, the projectile-target relative motion is
described by a classical trajectory and the reaction properties are deduced by
solving a time-dependent Schroedinger equation. We then describe the principle
and variants of the eikonal approximation: the dynamical eikonal approximation,
the standard eikonal approximation, and a corrected version avoiding Coulomb
divergence. Finally, we present the continuum-discretized coupled-channel
method (CDCC), in which the Schroedinger equation is solved with the projectile
continuum approximated by square-integrable states. These models are first
illustrated by applications to two-cluster projectiles for studies of nuclei
far from stability and of reactions useful in astrophysics. Recent extensions
to three-cluster projectiles, like two-neutron halo nuclei, are then presented
and discussed. We end this review with some views of the future in
breakup-reaction theory.Comment: Will constitute a chapter of "Clusters in Nuclei - Vol.2." to be
  published as a volume of "Lecture Notes in Physics" (Springer