pinecone/core-2020-05-10-deduplication huggingface dataset:
Fusing face and body display for bi-modal emotion recognition: single frame analysis and multi frame post integration

This paper presents an approach to automatic visual emotion recognition from two modalities: expressive face and body gesture. Face and body movements are captured simultaneously using two separate cameras. For each face and body image sequence single  expressive  frames are selected manually for analysis and recognition of emotions. Firstly, individual classifiers are trained from individual modalities for mono-modal emotion recognition. Secondly, we fuse facial expression and affective body gesture information at the feature and at the decision-level. In the experiments performed, the emotion classification using the two modalities achieved a better recognition accuracy outperforming the classification using the individual facial modality. We further extend the affect analysis into a whole image sequence by a multi-frame post integration approach over the single frame recognition results. In our experiments, the post integration based on the fusion of face and body has shown to be more accurate than the post integration based on the facial modality only
Specifying and Monitoring Market Mechanisms Using Rights and Obligations

We provide a formal scripting language to capture the semantics of market mechanisms. The language is based on a set of well-defined principles, and is designed to capture an agent’s rights, as derived from property, and an agent’s obligations, as derived from restrictions placed on its actions, either voluntarily or as a consequence of other actions. Rights and obligations are viewed as first-class goods, from which we define fundamental axioms about well-functioning market-oriented worlds. Coupled with the scripting language is a run-time system that is able to monitor and enforce rights and obligations. Our treatment extends to represent a variety of market mechanisms, ranging from simple two-agent single-good exchanges to complicated combinatorial auctions.Engineering and Applied Science
An Options-Based Method to Solve the Composability Problem in Sequential Auctions

Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctions selling the same good, with no dominant bidding strategy in any single auction. Second, bidding agents often need to acquire a bundle of goods by bidding in multiple auctions, again with no dominant bidding strategy in any single auction. This paper introduces an options-based infrastructure that respects the autonomy of individual sellers but still enables bidders to utilize a dominant, truthful strategy across multiple auctions.Engineering and Applied Science
Multiagent negotiation for fair and unbiased resource allocation

This paper proposes a novel solution for the n agent cake cutting (resource allocation) problem. We propose a negotiation protocol for dividing a resource among n agents and then provide an algorithm for allotting portions of the resource. We prove that this protocol can enable distribution of the resource among n agents in a fair manner. The protocol enables agents to choose portions based on their internal utility function, which they do not have to reveal. In addition to being fair, the protocol has desirable features such as being unbiased and verifiable while allocating resources. In the case where the resource is two-dimensional (a circular cake) and uniform, it is shown that each agent can get close to l/n of the whole resource.
Resource-centric worklist visualisation

Business process management, and in particular workflow management, are a major area of ICT research. At present no coherent approach has been developed to address the problem of workflow visualisation to aid workers in the process of task prioritisation. In this paper we describe the development of a new, coherent approach to worklist visualisation, via analysis and development of a resource-centric view of the worklist information. We then derive appropriate visualisations for worklists and the relevant resources to aid worker in decision making. A worklist visualisation system has been implemented as an extension to an open-source workflow system, YAWL (Yet AnotherWorkflow Language)
On the Notion of Coupling in Communication Middleware

It is well accepted that different types of distributed architectures require different levels of coupling. For example, in client-server and three-tier architectures the application components are generally tightly coupled between them and with the underlying communication middleware. Meanwhile, in off-line transaction processing, grid computing and mobile application architectures, the degree of coupling between application components and with the underlying middleware needs to be minimised along different dimensions. In the literature, terms such as synchronous, asynchronous, blocking, non-blocking, directed, and nondirected are generally used to refer to the degree of coupling required by a given architecture or provided by a given middleware. However, these terms are used with various connotations by different authors and middleware vendors. And while several informal definitions of these terms have been provided, there is a lack of an overarching framework with a formal grounding upon which software architects can rely to unambiguously communicate architectural requirements with respect to coupling. This paper addresses this gap by: (i) identifying and formally defining three dimensions of coupling; (ii) relating these dimensions to existing communication middleware; and (iii) proposing notational elements for representing coupling configurations. The identified dimensions provide the basis for a classification of middleware which can be used as a selection instrument
Self-tuning personalized information retrieval in an ontology-based framework

The final publication is available at Springer via http://dx.doi.org/10.1007/11575863_119Proceedings of OTM Confederated Internationl Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005, Agia Napa, Cyprus, October 31 - November 4, 2005.Reliability is a well-known concern in the field of personalization technologies. We propose the extension of an ontology-based retrieval system with semantic-based personalization techniques, upon which automatic mechanisms are devised that dynamically gauge the degree of personalization, so as to benefit from adaptivity but yet reduce the risk of obtrusiveness and loss of user control. On the basis of a common domain ontology KB, the personalization framework represents, captures and exploits user preferences to bias search results towards personal user interests. Upon this, the intensity of personalization is automatically increased or decreased according to an assessment of the imprecision contained in user requests and system responses before personalization is applied.This research was supported by the European Commission under contract FP6-
001765 aceMedia. The expressed content is the view of the authors but not necessarily
the view of the aceMedia project as a whole
Interoperability Supported by Enterprise Modelling

International audienceThe application of enterprise modelling supports the common understanding of the enterprise business processes in the company and across companies. To assure a correct cooperation between two or more entities it is mandatory to build an appropriate model of them. This can lead to a stronger amplification of all the cross-interface activities between the entities. Enterprise models illustrate the organisational business aspects as a prerequisite for the successful technical integration of IT systems or their configurations. If an IT system is not accepted because its usefulness is not transparent to the staff members, then it quickly loses its value due to erroneous or incomplete input and insufficient maintenance. This at the end results in investment losses. The paper exemplifies the strengths, values, limitations and gaps of the application of enterprise modelling to support interoperability between companies. It illustrates a proposal for a common enterprise-modelling framework. This framework is presented in terms of problems to face and knowledge based methodological approach to help solving them. A specific application demonstrates enterprise modelling and the synchronisation between the models as prerequisite for the successful design of Virtual Enterprises
The semantics and tool support of OZTA.

In this work, we firstly enhance OZTA, a combination of Object-Z and Timed Automata, by introducing a set of timed patterns as language constructs that can specify the dynamic and timing features of complex real-time systems in a systematic way. Then we present the formal semantics in Unifying Theories of Programming for the enhanced OZTA. Furthermore, we develop an OZTA tool which can support editing, type-checking of OZTA models as well as projecting OZTA models into TA models so that we can utilize TA model checkers, e.g., Uppaal for verification
A fast distance between histograms

Iberoamerican Congress on Pattern Recognition (CIARP), 2005, Havana (Cuba)In this paper we present a new method for comparing histograms. Its main advantage is that it takes less time than previous methods. The present distances between histograms are defined on a structure called signature, which is a lossless representation of histograms. Moreover, the type of the elements of the sets that the histograms represent are ordinal, nominal and modulo. We show that the computational cost of these distances is O(z′) for the ordinal and nominal types and O(z′2) for the modulo one, where z′ is the number of non-empty bins of the histograms. In the literature, the computational cost of the algorithms presented depends on the number of bins in the histograms. In most applications, the histograms are sparse, so considering only the non-empty bins dramatically reduces the time needed for comparison. The distances we present in this paper are experimentally validated on image retrieval and the positioning of mobile robots through image recognition.Peer Reviewe
Nested Rules in Defeasible Logic

Defeasible Logic is a rule-based non-monotonic logic with tractable reasoning services. In this paper we extend Defeasible Logic with nested rules. We consider a new Defeasible Logic, called DL^ns, where we allow one level of nested rules. A nested rule is a rule where the antecedent or the consequent of the rule are rules themselves. The inference conditions for DL^ns are based on reflection on the inference structures (rules) of the particular theory at hand. Accordingly DL^ns can be considered an amalgamated reflective system with implicit reflection mechanism. Finally we outline some possible applications of the logic
A Framework for Analyzing Probabilistic Protocols and its Application to the Partial Secrets Exchange

International audienceWe propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties. In order to express an verify the correctness of the protocols, we develop a probabilistic version of the testing semantics. We then illustrate these concepts on an extended example: the Partial Secret Exchange, a protocol which uses a randomized primitive, the Oblivious Transfer, to achieve fairness of information exchange between two parties
Mixing, Ergodicity and the Fluctuation-Dissipation Theorem in complex
  systems

Complex systems such as glasses, gels, granular materials, and systems far
from equilibrium exhibit violation of the ergodic hypothesis (EH) and of the
fluctuation-dissipation theorem (FDT). Recent investigations in systems with
memory have established a hierarchical connection between mixing, the EH and
the FDT. They have shown that a failure of the mixing condition (MC) will lead
to the subsequent failures of the EH and of the FDT. Another important point is
that such violations are not limited to complex systems: simple systems may
also display this feature. Results from such systems are analytical and
obviously easier to understand than those obtained in complex structures, where
a large number of competing phenomena are present. In this work, we review some
important requirements for the validity of the FDT and its connection with
mixing, the EH and anomalous diffusion in one-dimensional systems. We show that
when the FDT fails, an out-of-equilibrium system relaxes to an effective
temperature different from that of the heat reservoir. This effective
temperature is a signature of metastability found in many complex systems such
as spin-glasses and granular materials.Comment: to be published in the Proceedings of the XIX Sitges Conference on
  ''Jammming, Yielding and Irreversible Deformation in Condensed Matter'',
  M.-C.Miguel and M. Rubi eds., Lecture Notes in Physics, Springer Verlag,
  Berli
A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web

Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family of web ontology languages based on description logic, has been proposed for the Semantic Web. Answering a query over the Semantic Web is thus not trivial, but a deductive process. However, the reasoning on OWL with data has an efficiency problem. Thus, we introduce optimization techniques for the inference algorithm. This work demonstrates the techniques for instance checking and instance retrieval problems with respect to ALC description logic which covers certain parts of OWL
Handling Transactional Properties in Web Service Composition

The development of new services by composition of existing\ud
ones has gained considerable momentum as a means of integrating heterogeneous\ud
applications and realising business collaborations. Services\ud
that enter into compositions with other services may have transactional\ud
properties, especially those in the broad area of resource management\ud
(e.g. booking services). These transactional properties may be exploited\ud
in order to derive composite services which themselves exhibit certain\ud
transactional properties. This paper presents a model for composing services\ud
that expose transactional properties and more specifically, services\ud
that support tentative holds and/or atomic execution. The proposed\ud
model is based on a high-level service composition operator that produces\ud
composite services that satisfy specified atomicity constraints. The\ud
model supports the possibility of selecting the services that enter into a\ud
composition at runtime, depending on their ability to provide resource\ud
reservations at a given point in time and taking into account user preferences
On the automatic construction of indistinguishable operations

An increasingly important design constraint for software running
on ubiquitous computing devices is security, particularly against
physical methods such as side-channel attack. One well studied methodology
for defending against such attacks is the concept of indistinguishable
functions which leak no information about program control
flow since all execution paths are computationally identical. However,
constructing such functions by hand becomes laborious and error prone
as their complexity increases. We investigate techniques for automating
this process and find that effective solutions can be constructed with
only minor amounts of computational effort.Fundação para a Ciência e Tecnologia - SFRH/BPD/20528/2004
Earthquake Science Explained

This booklet features a collection of articles originally published for teachers by the San Francisco Chronicle. It presents some of the new understanding gained and scientific advances made in the century since the Great 1906 San Francisco Earthquake. Topics include lessons learned from the 1906 earthquake, the use of seismograms, recognizing active faults, and the use of trenches to investigate faults. There is also discussion of earthquake prediction, some hazards associated with earthquakes, making buildings and roads safer, and a career profile of an earthquake scientist. Concepts introduced in each feature are designed to address state and national science-education standards. Educational levels: Middle school, High school
Embedding the stable failures model of CSP in PVS

We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platform for the formal verification not only of safety specifications, but also of liveness specifications of concurrent systems in theorem provers. Such a platform is particularly good at analyzing infinite-state systems with an arbitrary number of components. We demonstrate the power of this embedding by using it to construct formal proofs that the asymmetric dining philosophers problem with an arbitrary number of philosophers is deterministic and deadlock-free, and that an industrial-scale example, a 'virtual network' [21], with any number of dimensions, is deadlock-free. We have established some generic proof tactics for verification of properties of networks with many components. In addition, our technique of integrating FDR and PVS in our demonstration allows for handling of systems that would be difficult or impossible to analyze using either tool on its own. © Springer-Verlag Berlin Heidelberg 2005
Chunks: Component verification in CSP||B

CSP||B is an approach to combining the process algebra CSP with the formal development method B, enabling the formal description of systems involving both event-oriented and state-oriented aspects of behaviour. The approach provides architectures which enable the application of CSP verification tools and B verification tools to the appropriate parts of the overall description. Previous work has considered how large descriptions can be verified using coarse grained component parts. This paper presents a generalisation of that work so that CSP vertical bar vertical bar B descriptions can be decomposed into finer grained components, chunks, which focus on demonstrating the absence of particular divergent behaviour separately. The theory underpinning chunks is applicable not only to CSP vertical bar vertical bar B specification but to CSP specifications. This makes it an attractive technique to decomposing large systems for analysing with FDR
Finding similar patterns in microarray data

In this paper we propose a clustering algorithm called s-Cluster for analysis of gene expression data based on pattern-similarity. The algorithm captures the tight clusters exhibiting strong similar expression patterns in Microarray data,and allows a high level of overlap among discovered clusters without completely grouping all genes like other algorithms. This reflects the biological fact that not all functions are turned on in an experiment, and that many genes are co-expressed in multiple groups in response to different stimuli. The experiments have demonstrated that the proposed algorithm successfully groups the genes with strong similar expression patterns and that the found clusters are interpretable.\ud
\u
Systematically evolving configuration parameters for computational intelligence methods

Paper presented at The First International Conference (PReMI 2005); LNCS 3776: pp. 376-381.The configuration of a computational intelligence (CI) method is
responsible for its intelligence (e.g. tolerance, flexibility) as well as its
accuracy. In this paper, we investigate how to automatically improve the
performance of a CI method by finding alternate configuration parameter values
that produce more accurate results. We explore this by using a genetic
algorithm (GA) to find suitable configurations for the CI methods in an
integrated CI system, given several different input data sets. This paper
describes the implementation and validation of our approach in the domain of
software testing, but ultimately we believe it can be applied in many situations
where a CI method must produce accurate results for a wide variety of
problems
A methodology for developing and deploying distributed applications

We describe a methodology for developing and deploying distributed Java applications using a reflective middleware system called RAFDA. We illustrate the methodology by describing how it has been used to develop a peer-to-peer infrastructure, and explain the benefits relative to other techniques. The strengths of the approach are that the application logic can be designed and implemented completely independently of distribution concerns, easing the development task, and that this gives great flexibility to alter distribution decisions late in the development cycle.Postprin
Satisfiability checking for PC(ID)

The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MIDL, experimentally validating our approach.status: publishe
CoConES: An approach for components and contracts in embedded systems

This chapter presents CoCoNES (Components and Contracts for Embedded Software), a methodology for the development of embedded software, supported by a tool chain. The methodology is based on the composition of reusable components with the addition of a contract principle for modeling nonfunctional constraints. Non-functional constraints are an important aspect of embedded systems, and need to be modeled explicitly. The tool chain contains CCOM, a tool used for the design phase of software development, coupled with DRACO, a middleware layer that supports the component-based architecture at run-time.status: publishe
Quantum Anonymous Transmissions

We consider the problem of hiding sender and receiver of classical and
quantum bits (qubits), even if all physical transmissions can be monitored. We
present a quantum protocol for sending and receiving classical bits
anonymously, which is completely traceless: it successfully prevents later
reconstruction of the sender. We show that this is not possible classically. It
appears that entangled quantum states are uniquely suited for traceless
anonymous transmissions. We then extend this protocol to send and receive
qubits anonymously. In the process we introduce a new primitive called
anonymous entanglement, which may be useful in other contexts as well.Comment: 18 pages, LaTeX. Substantially updated version. To appear at
  ASIACRYPT '0
Do All Elliptic Curves of the Same Order Have the Same Difficulty of
  Discrete Log?

The aim of this paper is to justify the common cryptographic practice of
selecting elliptic curves using their order as the primary criterion. We can
formalize this issue by asking whether the discrete log problem (DLOG) has the
same difficulty for all curves over a given finite field with the same order.
We prove that this is essentially true by showing polynomial time random
reducibility of DLOG among such curves, assuming the Generalized Riemann
Hypothesis (GRH). We do so by constructing certain expander graphs, similar to
Ramanujan graphs, with elliptic curves as nodes and low degree isogenies as
edges.
  The result is obtained from the rapid mixing of random walks on this graph.
Our proof works only for curves with (nearly) the same endomorphism rings.
Without this technical restriction such a DLOG equivalence might be false;
however, in practice the restriction may be moot, because all known polynomial
time techniques for constructing equal order curves produce only curves with
nearly equal endomorphism rings.Comment: 26 pages, revised, to appear in Advances in Cryptology -- Asiacrypt
  200