pinecone/core-2020-05-10-deduplication huggingface dataset:
Variable length-based genetic representation to automatically evolve wrappers

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-12433-4_44Proceedings 8th International Conference on Practical Applications of Agents and Multiagent SystemsThe Web has been the star service on the Internet, however the outsized information available and its decentralized nature has originated an intrinsic difficulty to locate, extract and compose information. An automatic approach is required to handle with this huge amount of data. In this paper we present a machine learning algorithm based on Genetic Algorithms which generates a set of complex wrappers, able to extract information from theWeb. The paper presents the experimental evaluation of these wrappers over a set of basic data sets.This work has been partially supported by the Spanish Ministry of Science
and Innovation under the projects Castilla-La Mancha project PEII09-0266-6640, COMPUBIODIVE
(TIN2007-65989), and by V-LeaF (TIN2008-02729-E/TIN)
A case study on grammatical-based representation for regular expression evolution

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-12433-4_45Proceedings of 8th International Conference on Practical Applications of Agents and Multiagent SystemsRegular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and flexible notation to define and retrieve patterns from text, the syntax and the grammatical rules of these regex notations are not easy to use, and even to understand. Any regex can be represented as a Deterministic or Non-Deterministic Finite Automata; so it is possible to design a representation to automatically build a regex, and a optimization algorithm able to find the best regex in terms of complexity. This paper introduces both, a graph-based representation for regex, and a particular heuristic-based evolutionary computing algorithm based on grammatical features from this language in a particular data extraction problem.This work has been partially supported by the Spanish Ministry of Science and Innovation
under the projects Castilla-La Mancha project PEII09-0266-6640, COMPUBIODIVE
(TIN2007-65989), and by HADA (TIN2007-64718)
An evolutionary confidence measure for spotting words in speech recognition

Proceedings of 8th International Conference on Practical Applications of Agents and Multiagent Systems, held in Salamanca (Spain), on April 26-28, 2010The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-12433-4_50Confidence measures play a very important role in keyword spotting systems. Traditional confidence measures are based on the score computed when the audio is decoded. Classification-based techniques by means of Multi-layer Perceptrons (MLPs) and Support Vector Machines have shown to be powerful ways to improve the final performance in terms of hits and false alarms. In this work we evaluate a keyword spotting system performance by incorporating an evolutionary algorithm as confidence measure and compare its performance with traditional classification techniques based on MLP. We show that this evolutionary algorithm gets better performance than the MLP when False Alarm (FA) is high and always performs better than the confidence measure based on the single score computed during the audio decoding.The authors acknowledge support from the Spanish Ministerio de
Ciencia e innovacin, project TIN2007-66862-C02-02, and from CAM/UAM, project number
CCG08-UAM/TIC-4428
Multi-Agent System (MAS) Applications in Ambient Intelligence (AmI) Environments

Proceedings of: 8th Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS`10). Salamanca (Spain), 28-30 April 2010Research in context-aware systems has been moving towards reusable and adaptable architectures for managing more advanced human-computer interfaces. Ambient. Intelligence (AmI) investigates computer-based services, which are ubiquitous and based on a variety of objects and devices. Their intelligent and intuitive interfaces act as mediators through which people can interact with the ambient environment. In this paper we present an agent-based architecture which supports the execution of agents in AmI environments. Two case studies are also presented, an airport information system and a railway information system, which uses spoken conversational agents to respond to the user's requests using the contextual information that includes the location information of the user.This work has been partially supported by CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, SINPROB, CAM MADRINET S-0505/TIC/0255 and DPS2008-07029-C02-02Publicad
A Legal View of Ambient Assisted Living Developments

Proceedings of: 8th International Conference on Practical Applications of Agents and Multiagent Systems, Salamanca, Spain, April 26-28, 2010.In this paper, a legal approach to Ambient Assisted Living is considered.
A general framework for context-aware applications is presented and a general view
of legal principles to be considered in this framework. The analysis of a specific application
of AAL, developed in a previous work, allows understanding these principles
in a real development and the applicability for designing AAL applications.This work has been partially supported by Projects CICYT TIN2008-
06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, SINPROB, CAM CONTEXTS
S2009/TIC-1485 and DPS2008-07029-C02-02.Publicad
Probable Innocence and Independent Knowledge

International audienceWe analyse the \textsc{Crowds} anonymity protocol under the novel assumption that the attacker has independent knowledge on behavioural patterns of individual users. Under such conditions we study, reformulate and extend Reiter and Rubin's notion of probable innocence, and provide a new formalisation for it based on the concept of protocol vulnerability. Accordingly, we establish new formal relationships between protocol parameters and attackers' knowledge expressing necessary and sufficient conditions to ensure probable innocence
Keldysh Green's function approach to coherence in a non-equilibrium
  steady state: connecting Bose-Einstein condensation and lasing

Solid state quantum condensates often differ from previous examples of
condensates (such as Helium, ultra-cold atomic gases, and superconductors) in
that the quasiparticles condensing have relatively short lifetimes, and so as
for lasers, external pumping is required to maintain a steady state. On the
other hand, compared to lasers, the quasiparticles are generally more strongly
interacting, and therefore better able to thermalise. This leads to questions
of how to describe such non-equilibrium condensates, and their relation to
equilibrium condensates and lasers. This chapter discusses in detail how the
non-equilibrium Green's function approach can be applied to the description of
such a non-equilibrium condensate, in particular, a system of microcavity
polaritons, driven out of equilibrium by coupling to multiple baths. By
considering the steady states, and fluctuations about them, it is possible to
provide a description that relates both to equilibrium condensation and to
lasing, while at the same time, making clear the differences from simple
lasers
Fostering the adoption of i* by practitioners: some challenges and research directions

The i* framework is a widespread formalism in the software engineering discipline that allows expressing intentionality of system actors. From the time it was issued, in the mid-nineties, a growing research community has adopted it either in its standard form or formulating variations in order to adapt it to some particular purpose. New methods, techniques and tools have made evolve the framework in a way that it may be currently considered quite mature from the scientific\ud
perspective. However, the i* framework has not been transferred to practitioners at the same extent yet: industrial experiences using i* are not many and have been mainly conducted by i* experts that are part of that very research community. Therefore, it may be argued that some steps are needed for boosting the adoption of i* by practitioners. In this chapter, we identify some scientific challenges whose overcoming could represent a step towards this goal. For each challenge, we present the problem that is addressed, its current state of the art and some envisaged lines of research.Preprin
Towards a framework for constraint-based test  case generation

In this paper, we propose an approach for automated test 
case generation based on techniques from constraint programming (CP). 
We advocate the use of standard CP search strategies in order to express 
preferences on the generated test cases and to obtain the desired degree 
of coverage. We develop our framework in the concrete context of an 
imperative language and show that the technique is sufficiently powerful 
to deal with arbitrary pointer-based data-structures allocated on the 
heap.status: publishe
A transformational approach for proving properties of the CHR constraint store

Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR constraint store. In contrast to Logic Programming (LP), there are not many tools available for deriving such information for CHR. Hence, instead of building analyses for CHR from scratch, we define a transformation from CHR to Prolog and reuse existing analysis tools for Prolog.

The proposed transformation has been implemented and combined with PolyTypes 1.3, a type analyser for Prolog, resulting in an accurate description of the types of CHR programs. Moreover, the transformation is not limited to type analysis. It can also be used to prove other properties of the constraints showing up in constraint stores, using tools for Prolog.status: publishe
Investigating the Use of the Experience Clip Method

The focus of this paper is on the use of the Experience Clip method for evaluating mobile applications. In this method one participant uses the to-be-evaluated mobile application while the other participant films whatever happens during the field test. Afterwards, participants are interviewed by the researcher(s) to clarify the recorded situations. Investigating the use of the Experience Clip method was achieved by evaluating two mobile multimedia geocaching applications. The method was found very suitable for capturing rich, emotional user experiences and uncovering usability issues. Furthermore, digital photo cameras, used by participants for filming, offer great image quality, ease-of-use, sufficient storage capacity, and attract little attention of bystanders. However, there is one concern that when participants film each other, another experience is added on top of the experience with the mobile application. It is unclear how the filming experience affects actual use and the validity of the collected data.status: publishe
Damage detections in nonlinear vibrating thermally loaded plates

In this work, geometrically nonlinear vibrations of fully clamped rectangular plates subjected to thermal changesare used to study the sensitivity of some vibration response parameters to the presence of damage and elevated temperature. The geometrically nonlinear version of the Mindlin plate theory is used to model the plate behaviour.Damage is represented as a stiffness reduction in a small area of the plate. The plates are subjected to harmonicloading leading to large amplitude vibrations and temperature changes. The plate vibration response is obtained by a pseudo-load mode superposition method. The main results are focussed on establishing the influence of damage on the vibration response of the heated and the unheated plates and the change in the time-history diagrams and the Poincaré maps caused by damage and elevated temperature. The damage criterion formulated earlier for nonheated plates, based on analyzing the points in the Poincaré sections of the damaged and healthy plate, is modified and tested for the case of plates additionally subjected to elevated temperatures. The importance of taking into account the actual temperature in the process of damage detection is shown
Avoiding full extension field arithmetic in pairing computations

The most costly operations encountered in pairing computations are those that take place in the full extension ﬁeld Fpk . At high \ud
levels of security, the complexity of operations in Fpk dominates the \ud
complexity of the operations that occur in the lower degree subﬁelds. \ud
Consequently, full extension ﬁeld operations have the greatest eﬀect on \ud
the runtime of Miller’s algorithm. Many recent optimizations in the \ud
literature have focussed on improving the overall operation count by \ud
presenting new explicit formulas that reduce the number of subﬁeld \ud
operations encountered throughout an iteration of Miller’s algorithm. \ud
Unfortunately, almost all of these improvements tend to suﬀer for larger \ud
embedding degrees where the expensive extension ﬁeld operations far \ud
outweigh the operations in the smaller subﬁelds. In this paper, we \ud
propose a new way of carrying out Miller’s algorithm that involves \ud
new explicit formulas which reduce the number of full extension ﬁeld \ud
operations that occur in an iteration of the Miller loop, resulting in \ud
signiﬁcant speed ups in most practical situations of between 5 and 30 \ud
percent
Strong cryptography from weak secrets

Distributed-password public-key cryptography (DPwPKC) allows the members of a group of people, each one holding a small secret password only, to help a leader to perform the private operation, associated to a public-key cryptosystem. Abdalla et al. recently defined this tool [1], with a practical construction. Unfortunately, the latter applied to the ElGamal decryption only, and relied on the DDH assumption, excluding any recent pairing-based cryptosystems. In this paper, we extend their techniques to support, and exploit, pairing-based properties: we take advantage of pairing-friendly groups to obtain efficient (simulation-sound) zero-knowledge proofs, whose security relies on the Decisional Linear assumption. As a consequence, we provide efficient protocols, secure in the standard model, for ElGamal decryption as in [1], but also for Linear decryption, as well as extraction of several identity-based cryptosystems [6,4]. Furthermore, we strenghten their security model by suppressing the useless testPwd queries in the functionality
Flexible Group Key Exchange with On-Demand Computation of Subgroup Keys

Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communication and exchange of data. At any time point concurrent communication sessions involving different subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communication scenarios where various user subsets may be involved in different sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more flexible GKE protocols allowing not only the computation of a group key for some initial set of users but also efficient derivation of independent secret keys for all potential subsets. In particular we improve and generalize the recently introduced GKE protocols enabling on-demand derivation of peer-to-peer keys (so called GKE+P protocols). We show how a group of users can agree on a secret group key while obtaining some additional information that they can use on-demand to efficiently compute independent secret keys for any possible subgroup. Our security analysis relies on the Gap Diffie-Hellman assumption and uses random oracles
Generalized Buneman pruning for inferring the most parsimonious
  multi-state phylogeny

Accurate reconstruction of phylogenies remains a key challenge in
evolutionary biology. Most biologically plausible formulations of the problem
are formally NP-hard, with no known efficient solution. The standard in
practice are fast heuristic methods that are empirically known to work very
well in general, but can yield results arbitrarily far from optimal. Practical
exact methods, which yield exponential worst-case running times but generally
much better times in practice, provide an important alternative. We report
progress in this direction by introducing a provably optimal method for the
weighted multi-state maximum parsimony phylogeny problem. The method is based
on generalizing the notion of the Buneman graph, a construction key to
efficient exact methods for binary sequences, so as to apply to sequences with
arbitrary finite numbers of states with arbitrary state transition weights. We
implement an integer linear programming (ILP) method for the multi-state
problem using this generalized Buneman graph and demonstrate that the resulting
method is able to solve data sets that are intractable by prior exact methods
in run times comparable with popular heuristics. Our work provides the first
method for provably optimal maximum parsimony phylogeny inference that is
practical for multi-state data sets of more than a few characters.Comment: 15 page
IDBA - A practical iterative De Bruijn graph De Novo assembler

LNCS v. 6044 is conference proceedings of 14th RECOMB 2010The de Bruijn graph assembly approach breaks reads into k-mers before assembling them into contigs. The string graph approach forms contigs by connecting two reads with k or more overlapping nucleotides. Both approaches must deal with the following problems: false-positive vertices, due to erroneous reads; gap problem, due to non-uniform coverage; branching problem, due to erroneous reads and repeat regions. A proper choice of k is crucial but for single k there is always a trade-off: a small k favors the situation of erroneous reads and non-uniform coverage, and a large k favors short repeat regions. We propose an iterative de Bruijn graph approach iterating from small to large k exploring the advantages of the in between values. Our IDBA outperforms the existing algorithms by constructing longer contigs with similar accuracy and using less memory, both with real and simulated data. The running time of the algorithm is comparable to existing algorithms. © Springer-Verlag Berlin Heidelberg 2010.postprintThe 14th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2010), Lisbon, Portugal, 25-28 April 2010. In Lecture Notes in Computer Science, 2010, v. 6044, p. 426-44
Discovering Regulatory Overlapping RNA Transcripts

STEREO is a novel algorithm that discovers cis-regulatory RNA interactions by assembling complete and potentially overlapping same-strand RNA transcripts from tiling expression data. STEREO first identifies coherent segments of transcription and then discovers individual transcripts that are consistent with the observed segments given intensity and shape constraints. We used STEREO to identify 1446 regions of overlapping transcription in two strains of yeast, including transcripts that comprise a new form of molecular toggle switch that controls gene variegation
Introduction to Astronomy with Radioactivity

In the late nineteenth century, Antoine Henri Becquerel discovered
radioactivity and thus the physics of weak interactions, well before atomic and
quantum physics was known. The different types of radioactive decay, alpha,
beta, and gamma decay, all are different types of interactions causing the
same, spontaneous, and time-independent decay of an unstable nucleus into
another and more stable nucleus. Nuclear reactions in cosmic sites re-arrange
the basic constituents of atomic nuclei (neutrons and protons) among the
different configurations which are allowed by Nature, thus producing
radioactive isotopes as a by-product. Throughout cosmic history, such reactions
occur in different sites, and lead to rearrangements of the relative abundances
of cosmic nuclei, a process called cosmic chemical evolution, which can be
studied through the observations of radioactivity. The special role of
radioactivity in such studies is contributed by the intrinsic decay of such
material after it has been produced in cosmic sites. This brings in a new
aspect, the clock of the radioactive decay. Observational studies of cosmic
radioactivities intrinsically obtain isotopic information which are at the
heart of cosmic nucleosynthesis. They are best performed by precision mass
spectroscopy in terrestrial laboratories, which has been combined with
sophisticated radiochemistry to extract meteoritic components originating from
outside the solar system, and by spectroscopy of characteristic gamma-ray lines
emitted upon radioactive decay in cosmic environments and measured with
space-based telescopes. This book describes where and how specific astronomical
messages from cosmic radioactivity help to complement the studies of cosmic
nucleosynthesis sites anad of cosmic chemical evolution.Comment: 20 pages, 9 figure
Massive Stars and their Supernovae

Massive stars and their supernovae are prominent sources of radioactive
isotopes, the observations of which thus can help to improve our astrophysical
models of those. Our understanding of stellar evolution and the final explosive
endpoints such as supernovae or hypernovae or gamma-ray bursts relies on the
combination of magneto-hydrodynamics, energy generation due to nuclear
reactions accompanying composition changes, radiation transport, and
thermodynamic properties (such as the equation of state of stellar matter).
Nuclear energy production includes all nuclear reactions triggered during
stellar evolution and explosive end stages, also among unstable isotopes
produced on the way. Radiation transport covers atomic physics (e.g. opacities)
for photon transport, but also nuclear physics and neutrino nucleon/nucleus
interactions in late phases and core collapse. Here we want to focus on the
astrophysical aspects, i.e. a description of the evolution of massive stars and
their endpoints, with a special emphasis on the composition of their ejecta (in
form of stellar winds during the evolution or of explosive ejecta). Low and
intermediate mass stars end their evolution as a white dwarf with an unburned C
and O composition. Massive stars evolve beyond this point and experience all
stellar burning stages from H over He, C, Ne, O and Si-burning up to core
collapse and explosive endstages. In this chapter we discuss the
nucleosynthesis processes involved and the production of radioactive nuclei in
more detail.Comment: 79 pages; Chapter of "Astronomy with Radioactivities", a book in
  Springer's 'lecture notes in physics series, Vol. 812, Eds. Roland Diehl,
  Dieter H. Hartmann, and Nikos Prantzos, to appear in summer 201
Ω-Arithmetization of Ellipses

International audienceMulti-resolution analysis and numerical precision problems are very important subjects in fields like image analysis or geometrical modeling. In the continuation of our previous works, we propose to apply the method of Ω-arithmetization to ellipses. We obtain a discrete multi-resolution representation of arcs of ellipses. The corresponding algorithms are completely constructive and thus, can be exactly translated into functional computer programs. Moreover, we give a global condition for the connectivity of the discrete curves generated by the method at every scale