pinecone/core-2020-05-10-deduplication huggingface dataset:
Discussions on an Interval Arithmetic Standard at Dagstuhl Seminar 08021

International audienceEfforts have been made to standardize interval arithmetic (IA) for over a decade. The reasons have been to enable more widespread use of the technology, to enable more widespread sharing and collaboration among researchers and developers of the technology, and to enable easier checking that computer codes have been correctly programmed. During the late 1990's, the first author of this report led such a project to introduce an interval data type into the Fortran language. One reason for failure of that effort was the Fortran language standardization committee's lack of familiarity with interval technology and consequent caution. Another was misunderstanding between the Fortran standardization committee's basic tenets on standardizing interline optimization and some views expressed by members of the interval analysis community. A third was confusion over how extended IA (arithmetic dealing with division by intervals that contain zero) should be handled. This was coupled with a heavy committee load associated with other projects, such as standardizing an interface for interoperability with "C" language programs. Since then, the interval analysis community has studied and gained additional understanding of extended IA. One such study is a systematization of the options (Pryce and Corliss, Computing 2006). Another, with a particular point of view, is Prof. Kulisch's contribution to this volume. Extended arithmetic remains a controversial part of efforts to standardize the arithmetic, particularly whether the underlying model should consider -infinity and +infinity to be numbers in their own right or if -infinity and +infinity should just be considered placeholders to describe unbounded sets of finite real numbers. A practical consequence is a difference in the value of 0 × X when X is an unbounded interval. Nonetheless, our understanding and thinking about this issue is clearer than a decade ago. This, coupled with the desire to have a standard, should lead to progress
An Asymmetric Protocol for Argumentation Games in Defeasible Logic

Agent interactions where the agents hold conflicting goals could be modelled as adversarial argumentation games. In many real-life situations (e.g., criminal litigation, consumer legislation), due to ethical, moral or other principles governing interaction, the burden of proof, i.e., which party is to lose if the evidence is balanced [4], is a priori fixed to one of the parties. Analogously, when resolving disputes in a heterogeneous agent-system the unequal importance of different agents for carrying out the overall system goal need to be accounted for. In this paper we present an asymmetric protocol for an adversarial argumentation game in Defeasible Logic, suggesting Defeasible Logic as a general representation formalism for argumentation games modelling agent interactions
Reasoning with Levels of Modalities in BDI Logic

Modelling real world problems using rational agents has been heavily investigated over the past two decades. BDI (Beliefs, Desires, and Intentions) Logic has been widely used to represent and reason about rational agency. However, in the real world, we often have to deal with different levels of confidence in the beliefs we hold, desires we have, and intentions that we commit to. This paper proposes the basis of a framework that extends BDI Logic to take into account qualitative levels of the mentalistic notions of beliefs, desires, and intentions. We also describe a set of axioms and properties of the extended logic.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Toward Semantic Mobile Web 2.0 through Multiagent Systems

In this paper, a solution for semantic annotation of Consumers
Generated Content, based on the actions of a multiagent system,
is presented. This solution is designed in the context of an spin-off which
was born from Minerva project for mobile services1. Our proposal aims
to build a Mobile Web 2.0 platform for the dissemination of interesting
events, captured by users through mobile phones. The multiagent system
creates an agent for each event, which suggests and manages several
semantic features linked to an Ontology related to events.Junta de Andalucía 2C/040 WeTeV
Agents for cross-organisational business interoperability

Increasing complexity of products and services together with shrinking lead times means that demands are often best satisfied through dynamic networks of collaborating enterprises. Businesses seek agile partnerships where companies focus on core business activities and partners provide complementary expertise. Successful collaboration demands a tight yet flexible integration of business processes. In this paper we focus on issues of process interoperability and the use of agents to support cross-organisational process interoperability. We maintain that an informed decision on the place of agents within this context demands a systematic approach: such an approach forms the core contribution of this paper. We apply a modified version of the function-behaviour-structure (FBS) framework of Gero as an organising schema to develop a clarifying structure; and to help determine the role of software agents. In particular, we use the formal elements of the FBS framework to identify those areas where agents may be applied. We highlight the need to combine this with appropriate mechanisms to promote semantic interoperability
Emergent process interoperability within virtual organisations

The current speed of market change means that business opportunities today are increasingly short-lived. To successfully pursue these opportunities, enterprises increasingly establish virtual organisations, drawing upon established networks of partners having complementary skills and expertise. The formation of a virtual organisation traditionally derives from a top-down decomposition of a business goal into a set of activities, followed by a recruitment of members to implement these activities. As this essentially presupposes a closed-world context, it does not foster innovative solutions and will fail if a decomposition cannot be found or the recruited members cannot work with each other. The approach proposed here aims to address these challenges through innovative use of agent technology, allowing process interoperability to emerge as a result of shared interests and complementary expertise of individual agents. Members of the virtual organisation are drawn from a comparatively stable yet open business ecosystem or virtual breeding environment [1] in response to a business opportunity which is "pinned" to a notice board as soon as it appears. We show how this approach can complement top-down decomposition, using a simple case study and a prototype. The prototype is implemented in JADE
Combining Aspect and Model-Driven Engineering Approaches for Software Process Modeling and Simulation

International audienceOne major advantage of executable software process models is that once defined, they can be simulated, checked and validated in short incremental and iterative cycles. This also makes them a powerful asset for important process improvement decisions such as resource allocation, deadlock identification and process management. In this paper, we propose a framework that combines Aspect and Model-Driven Engineering approaches in order to ensure process modeling, simulation and execution. This framework is based upon UML4SPM, a UML2.0-based language for Software Process Modeling and Kermeta, an executable metaprogramming language
SofTOA: software ranging for TOA-based positioning of WLAN terminals

TOA-based trilateration constitutes an interesting choice to locate terminals employing WLAN networks. A major limitation of this technique is the requirement for hardware modifications in the WLAN device in order to achieve accurate ranging. This paper presents an approach that overcomes this limitation. It is based on RTT measurements performed through time-stamping\ud
the transmission and reception of IEEE 802.11 MAC frames from the WLAN driver’s code, employing the CPU clock as time-base. Some statistical processing is needed in order to mitigate the noise of the measurements. This paper presents experimental results obtained with a prototype showing ranging errors of a few meters when applied to estimate distances up to 25 meters in both indoor and outdoor environments.Peer ReviewedPostprint (published version
A spine approach to branching diffusions with applications to L-p-convergence of martingales

We present a modified formalization of the 'spine' change of measure approach for branching diffusions in the spirit, of those found in Kyprianou [40] and Lyons et al. [44, 437 41]. We use our formulation to interpret certain 'Gibbs-Boltzmann' weightings of particles and use this to give an intuitive proof of a general 'Many-to-One' result which enables expectations of sums over particles in the branching diffusion to be calculated purely in terms of an expectation of one 'spine' particle. We also exemplify spine proofs of the L-p-convergence (p >= 1) of some key 'additive' martingales for three distinct models of branching diffusions including flew results for a multi-type branching Brownian motion and discussion of left-most particle speeds
Multi-region probabilistic histograms for robust and scalable identity inference

We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumination, resolution, as well as scale and misalignment problems. Each face is described in terms of multi-region probabilistic histograms of visual words, followed by a normalised distance calculation between the histograms of two faces. We also propose a fast histogram approximation method which dramatically reduces the computational burden with minimal impact on discrimination performance. Experiments on the “Labeled Faces in the Wild” dataset (unconstrained environments) as well as FERET (controlled variations) show that the proposed algorithm obtains performance on par with a more complex method and displays a clear advantage over predecessor systems. Furthermore, the use of multiple regions (as opposed to a single overall region) improves accuracy in most cases, especially when dealing with illumination changes and very low resolution images. The experiments also show that normalised distances can noticeably improve robustness by partially counteracting the effects of image variations
Analysis of the utility of classical and novel speech quality measures for speaker verification

Proceedings of Third International Conference, ICB 2009, Alghero, ItalyThe final publication is available at Springer via  http://dx.doi.org/10.1007/978-3-642-01793-3_45In this work, we analyze several quality measures for speaker verification from the point of view of their utility, i.e., their ability to predict performance in an authentication task. We select several quality measures derived from classic indicators of speech degradation, namely ITU P.563 estimator of subjective quality, signal to noise ratio and kurtosis of linear predictive coefficients. Moreover, we propose a novel quality measure derived from what we have called Universal Background Model Likelihood (UBML), which indicates the degradation of a speech utterance in terms of its divergence with respect to a given universal model. Utility of quality measures is evaluated following the protocols and databases of NIST Speaker Recognition Evaluation (SRE) 2006 and 2008 (telephone-only subset), and ultimately by means of error-vs.-rejection plots as recommended by NIST. Results presented in this study show significant utility for all the quality measures analyzed, and also a moderate decorrelation among them.This work has been supported by the Spanish Ministry of Education under project TEC2006-13170-C02-01
Minimising speaker verification utterance length through confidence based early verification decisions

This paper presents a novel approach of estimating the confidence interval of speaker verification scores. This approach is utilised to minimise the utterance lengths required in order to produce a confident verification decision. The confidence estimation method is also extended to address both the problem of high correlation in consecutive frame scores, and robustness with very limited training samples. The proposed technique achieves a drastic reduction in the typical data requirements for producing confident decisions in an automatic speaker verification system. When evaluated on the NIST 2005 SRE, the early verification decision method demonstrates that an average of 5–10 seconds of speech is sufficient to produce verification rates approaching those achieved previously using an average in excess of 100 seconds of speech.\u
Support vector machine regression for robust speaker verification in mismatching and forensic conditions

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-01793-3_50Proceedings of Third International Conference, ICB 2009, Alghero, ItalyIn this paper we propose the use of Support Vector Machine Regression (SVR) for robust speaker verification in two scenarios: i) strong mismatch in speech conditions and ii) forensic environment. The proposed approach seeks robustness to situations where a proper background database is reduced or not present, a situation typical in forensic cases which has been called database mismatch. For the mismatching condition scenario, we use the NIST SRE 2008 core task as a highly variable environment, but with a mostly representative background set coming from past NIST evaluations. For the forensic scenario, we use the Ahumada III database, a public corpus in Spanish coming from real authored forensic cases collected by Spanish Guardia Civil. We show experiments illustrating the robustness of a SVR scheme using a GLDS kernel under strong session variability, even when no session variability is applied, and especially in the forensic scenario, under database mismatch.This work has been supported by the Spanish Ministry of Education under project TEC2006-13170-C02-0
Building a personal symbolic space model from GSM CellID Positioning Data

Série : Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol. 7The context in which a person uses a mobile context-aware application can be described by many dimensions, including the, most popular, location and position. Some of the data used to describe these dimensions can be acquired directly from sensors or computed by reasoning algorithms. In this paper we propose to contextualize the mobile user of context-aware applications by describing his/her location in a symbolic space model as an alternative to the use of a position represented by a pair of coordinates in a
geometric absolute referential. By exploiting the ubiquity of GSM networks, we describe a method to progressively create this symbolic and personal space model, and propose an approach to compute the level of familiarity a person has with each of the identified places. The validity of the developed model is evaluated by comparing the identified places and the computed values for the familiarity index with a ground truth represented by GPS data and the detailed agenda of a few persons
Vertical alignment of process models – how can we get there?

There is a wide variety of drivers for business process modelling initiatives, reaching from business evolution and process optimisation over compliance checking and process certification to process enactment. That, in turn, results in models that differ in content due to serving different purposes. In particular, processes are modelled on different abstraction levels and assume different perspectives. Vertical alignment of process models aims at handling these deviations. While the advantages of such an alignment for inter-model analysis and change propagation are out of question, a number of challenges has still to be\ud
addressed. In this paper, we discuss three main challenges for vertical alignment in detail. Against this background, the potential application of techniques from the field of process integration is critically assessed. Based thereon, we identify specific research questions that guide the design of a framework for model alignment
Modelling of Biotechnological Processes - An approach based on Artificial Neural Networks

In this chapter we describe a software tool for modelling fermentation processes, the FerMoANN, which allows researchers in biology and biotechnology areas to access the potential of Artificial Neural Networks (ANNs) for this task. The FerMoANN is tested and validated using two fermentation processes, an Escherichia coli recombinant protein production and the production of a secreted protein with Saccharomyces cerevisiae in fed-batch reactors. The application to these two case studies, tested for different configurations of feedforward ANNs, illustrate the usefulness of these structures, when trained according to a supervised learning paradigm
Effective use of multicore-based parallel computers for scientific computing

This thesis studies how the multi-core hardware architecture can be efficiently used for real-world scientific applications that arise from computational cardiology and computational geoscience. The investigation has been carried out from different angles: numerical algorithms, parallel programming and performance modeling and prediction. It is shown that high-performance implementations and optimizations must match both the underlying computations and the target parallel platform. Several good practices are summarized for parallel programming and performance analysis on the multi-core architecture, which can be of help to many other scientists
A Hybrid Tissue-Level Model of the Left Ventricle: Application to the Analysis of the Regional Cardiac Function in Heart Failure

International audienceThis work contributes to the systemic interpretation of clinical data for the analysis of the regional cardiac function in the context of heart failure. A two-step patient-specific approach, combining a realistic geometry and a hybrid, tissue-level electromechanical model of the left ventricle is proposed. For the first step, a fast framework to extract a realistic geometry of the left ventricle from MSCT data is proposed. This geometry is then applied to a tissue-level model of the left ventricle, coupling a discrete electrical model, a mechanical model integrating a visco-elastic law, solved by a finite element method and a hydraulic model. A set of simulations carried out with the model are shown and preliminary results of the parameter identification approach, based on real patient data, are presented and discussed
Sensitivity Comparison of Planar Parallel Manipulators

International audienceThis paper deals with the sensitivity comparison of three Degree-of-Freedom planar parallel manipulators. First, a methodology is described to obtain the sensitivity coefficients of the pose of the moving platform of the manipulators to variations in their geometric parameters and actuated variables. Their sensitivity coefficients are derived and expressed algebraically for a matter of analysis simplicity. Moreover, two aggregate sensitivity indices are determined, the first one is related to the orientation of the moving platform of the manipulator and the other one to its position. Then, a methodology is proposed to compare PPMs with regard to their workspace size and sensitivity. Finally, 3-\underline{\textsf{R}}\textsf{P}\textsf{R}, 3-\textsf{R}\underline{\textsf{P}}\textsf{R}, 3-\underline{\textsf{R}}\textsf{R}\textsf{R}, 3-\textsf{R}\underline{\textsf{R}}\textsf{R} and 3-\underline{\textsf{P}}\textsf{R}\textsf{R} PPMs are compared in order to highlight the contributions of the paper
Straightening-free algorithm for the singularity analysis of Stewart-Gough platforms with collinear/coplanar attachments

Presentado al 5th Computational Kinematics celebrado en Duisburg (Germany) del 6 al 8 de mayo de 2009.An algorithm to derive the pure condition of any double-planar Stewart-Gough platform in a standard form suitable for comparison is presented. By applying the multilinear properties of brackets directly to the superbracket encoding of the pure condition, no straightening is required. It is then shown that any 3-3 platform has a corresponding 6-6 platform having its same superbracket, meaning that they have identical singularity loci. In general, the superbracket of any doubleplanar platform can be written as a linear combination of the superbrackets of 3-3 platforms, leading to a direct singularity assessment by inspecting the resulting decomposition.This work was supported by projects: 'Analysis and motion planning of complex robotic systems' (4802), 'Grup de recerca consolidat - Grup de Robòtica' (4810).This work has been partially supported by the Spanish Ministry of Education and Science, under the I+D project DPI2007-60858, and the Catalan Research Commission through the Robotics Group.Peer Reviewe
How to extract and expand randomness : a summary and explanation of existing results

We examine the use of randomness extraction and expansion in key agreement (KA) pro-\ud
tocols to generate uniformly random keys in the standard model. Although existing works provide the\ud
basic theorems necessary, they lack details or examples of appropriate cryptographic primitives and/or\ud
parameter sizes. This has lead to the large amount of min-entropy needed in the (non-uniform) shared\ud
secret being overlooked in proposals and efficiency comparisons of KA protocols. We therefore summa-\ud
rize existing work in the area and examine the security levels achieved with the use of various extractors\ud
and expanders for particular parameter sizes. The tables presented herein show that the shared secret\ud
needs a min-entropy of at least 292 bits (and even more with more realistic assumptions) to achieve an\ud
overall security level of 80 bits using the extractors and expanders we consider. The tables may be used\ud
to �nd the min-entropy required for various security levels and assumptions. We also �nd that when\ud
using the short exponent theorems of Gennaro et al., the short exponents may need to be much longer\ud
than they suggested
Simultaneous alignment and folding of protein sequences

Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding problems. We presentpartiFold-Align, the first algorithm for simultaneous alignment and consensus folding of unaligned protein sequences; the algorithm’s complexity is polynomial in time and space. Algorithmically,partiFold-Align exploits sparsity in the set of super-secondary structure pairings and alignment candidates to achieve an effectively cubic running time for simultaneous pairwise alignment and folding. We demonstrate the efficacy of these techniques on transmembrane β-barrel proteins, an important yet difficult class of proteins with few known three-dimensional structures. Testing against structurally derived sequence alignments,partiFold-Align significantly outperforms state-of-the-art pairwise sequence alignment tools in the most difficult low sequence homology case and improves secondary structure prediction where current approaches fail. Importantly, partiFold-Align requires no prior training. These general techniques are widely applicable to many more protein families. partiFold-Align is available at http://partiFold.csail.mit.edu