pinecone/core-2020-05-10-deduplication huggingface dataset:
Cryptanalysis of the convex hull click human identification protocol

Recently a convex hull based human identification protocol was proposed by Sobrado and Birget, whose steps can be performed by humans without additional aid. The main part of the protocol involves the user mentally forming a convex hull of secret icons in a set of graphical icons and then clicking randomly within this convex hull. In this paper we show two efficient probabilistic attacks on this protocol which reveal the user’s secret after the observation of only a handful of authentication sessions. We show that while the first attack can be mitigated through appropriately chosen values of system parameters, the second attack succeeds with a non-negligible probability even with large system parameter values which cross the threshold of usability
Semi-automated dialogue act classification for situated social agents in games

As a step toward simulating dynamic dialogue between agents and humans in virtual environments, we describe learning a model of social behavior composed of interleaved utterances and physical actions. In our model, utterances are abstracted as {speech act, propositional content, referent} triples. After training a classifier on 100 gameplay logs from The Restaurant Game annotated with dialogue act triples, we have automatically classified utterances in an additional 5,000 logs. A quantitative evaluation of statistical models learned from the gameplay logs demonstrates that semi-automatically classified dialogue acts yield significantly more predictive power than automatically clustered utterances, and serve as a better common currency for modeling interleaved actions and utterances
A discussion on the design of graph database benchmarks

Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interrelated data. The objective of this paper is to raise a new topic of discussion in the benchmarking community and allow practitioners having a set of basic guidelines for GDB benchmarking. We strongly believe that GDBs will become an important player in the market field of data analysis, and with that, their performance and capabilities will also become important. For this reason, we discuss those aspects that are important from our perspective, i.e. the characteristics of the graphs to be included in the benchmark, the characteristics of the queries that are important in graph analysis applications and the evaluation workbench.Postprint (author’s final draft
The Monte Carlo Event Generator DPMJET-III

A new version of the Monte Carlo event generator DPMJET is presented. It is a
code system based on the Dual Parton Model and unifies all features of the
DTUNUC-2, DPMJET-II and PHOJET 1.12 event generators. DPMJET-III allows the
simulation of hadron-hadron, hadron-nucleus, nucleus-nucleus, photon-hadron,
photon-photon and photon-nucleus interactions from a few GeV up to the highest
cosmic ray energies.Comment: 6 pages, Talk given at the Conference ``Monte Carlo 2000'', Lisbon,
  Portugal, 23-26 Oct. 200
Beyond Quantifier-Free Interpolation in Extensions of Presburger
  Arithmetic (Extended Technical Report)

Craig interpolation has emerged as an effective means of generating candidate
program invariants. We present interpolation procedures for the theories of
Presburger arithmetic combined with (i) uninterpreted predicates (QPA+UP), (ii)
uninterpreted functions (QPA+UF) and (iii) extensional arrays (QPA+AR). We
prove that none of these combinations can be effectively interpolated without
the use of quantifiers, even if the input formulae are quantifier-free. We go
on to identify fragments of QPA+UP and QPA+UF with restricted forms of guarded
quantification that are closed under interpolation. Formulae in these fragments
can easily be mapped to quantifier-free expressions with integer division. For
QPA+AR, we formulate a sound interpolation procedure that potentially produces
interpolants with unrestricted quantifiers.Comment: extended version (including proofs, complete rules listings, etc) of
  a VMCAI 2011 proceedings versio
Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits
  using DNA Strand Displacement

We propose a novel theoretical biomolecular design to implement any Boolean
circuit using the mechanism of DNA strand displacement. The design is scalable:
all species of DNA strands can in principle be mixed and prepared in a single
test tube, rather than requiring separate purification of each species, which
is a barrier to large-scale synthesis. The design is time-responsive: the
concentration of output species changes in response to the concentration of
input species, so that time-varying inputs may be continuously processed. The
design is digital: Boolean values of wires in the circuit are represented as
high or low concentrations of certain species, and we show how to construct a
single-input, single-output signal restoration gate that amplifies the
difference between high and low, which can be distributed to each wire in the
circuit to overcome signal degradation. This means we can achieve a digital
abstraction of the analog values of concentrations. Finally, the design is
energy-efficient: if input species are specified ideally (meaning absolutely 0
concentration of unwanted species), then output species converge to their ideal
concentrations at steady-state, and the system at steady-state is in (dynamic)
equilibrium, meaning that no energy is consumed by irreversible reactions until
the input again changes.
  Drawbacks of our design include the following. If input is provided
non-ideally (small positive concentration of unwanted species), then energy
must be continually expended to maintain correct output concentrations even at
steady-state. In addition, our fuel species - those species that are
permanently consumed in irreversible reactions - are not "generic"; each gate
in the circuit is powered by its own specific type of fuel species. Hence
different circuits must be powered by different types of fuel. Finally, we
require input to be given according to the dual-rail convention, so that an
input of 0 is specified not only by the absence of a certain species, but by
the presence of another. That is, we do not construct a "true NOT gate" that
sets its output to high concentration if and only if its input's concentration
is low. It remains an open problem to design scalable, time-responsive,
digital, energy-efficient molecular circuits that additionally solve one of
these problems, or to prove that some subset of their resolutions are mutually
incompatible.Comment: version 2: the paper itself is unchanged from version 1, but the
  arXiv software stripped some asterisk characters out of the abstract whose
  purpose was to highlight words. These characters have been replaced with
  underscores in version 2. The arXiv software also removed the second
  paragraph of the abstract, which has been (attempted to be) re-inserted.
  Also, although the secondary subject is "Soft Condensed Matter", this
  classification was chosen by the arXiv moderators after submission, not
  chosen by the authors. The authors consider this submission to be a
  theoretical computer science paper
Negative Interactions in Irreversible Self-Assembly

This paper explores the use of negative (i.e., repulsive) interaction the
abstract Tile Assembly Model defined by Winfree. Winfree postulated negative
interactions to be physically plausible in his Ph.D. thesis, and Reif, Sahu,
and Yin explored their power in the context of reversible attachment
operations. We explore the power of negative interactions with irreversible
attachments, and we achieve two main results. Our first result is an
impossibility theorem: after t steps of assembly, Omega(t) tiles will be
forever bound to an assembly, unable to detach. Thus negative glue strengths do
not afford unlimited power to reuse tiles. Our second result is a positive one:
we construct a set of tiles that can simulate a Turing machine with space bound
s and time bound t, while ensuring that no intermediate assembly grows larger
than O(s), rather than O(s * t) as required by the standard Turing machine
simulation with tiles
Semantic Agent for Distributed Knowledge Management

At the beginning of the decade, the Agent Mediated Knowledge Management workshops series as well as Bonifacio's theoretical approach layed the foundations of a new eld of distributed knowledge management based upon the agent paradigm. The agent based approach enables key features for knowledge management. The local management of knowledge by agents allows to go beyond the limitations of centralized knowledge management. Thus, knowledge can be maintained in each agent at a coarse-grained level, with different representations. In the mean time the rise of the semantic web technologies enables a new range of possibilities for agents dedicated to knowledge management. In this chapter we investigate the integration of semantic web technologies into an agent architecture that allows agents to represent their knowledge and their behavior in a semantic manner. We present the semantic agent model, its implementation and we discuss the perpectives open by semantic agents
Analysing a publish/subscribe system for mobile ad hoc networks with ProbLog

Acceptance rate: 45%Fadip is a Publish/Subscribe system for Mobile Ad hoc Networks which uses probabilistic routing of messages to deal with the volatile nature of the network. It uses controlled propagation of publications and subscriptions, with the fading gossip technique to reduce the number of broadcasts. We present a probabilistic logic program in
ProbLog that models Fadip. This allows us to calculate the probabilities that messages are successfully received by subscribers and to analyse the performance of the Fadip system.status: publishe
Min-Max Coverage in Multi-interface Networks

International audienceWe consider devices equipped with multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost. In this paper, we consider the problem of establishing the connections defined by a network G = (V,E) while keeping as low as possible the maximum cost set of active interfaces at the single nodes. Nodes V represent the devices, edges E represent the connections that must be established. We study the problem of minimizing the maximum cost set of active interfaces among the nodes of the network in order to cover all the edges. We prove that the problem is NP-hard for any fixed Δ ≥ 5 and k ≥ 16, with Δ being the maximum degree, and k being the number of different interfaces among the network. We also show that the problem cannot be approximated within Ω(ln Δ). We then provide a general approximation algorithm which guarantees a factor of O((1 + b)ln (Δ)), with b being a parameter depending on the topology of the input graph. Interestingly, b can be bounded by a constant for many graph classes. Other approximation and exact algorithms for special cases are presented
Bandwidth Constrained Multi-interface Networks

International audienceIn heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost, and provides a communication bandwidth. In this paper, we consider the problem of activating the cheapest set of interfaces among a network G = (V,E) in order to guarantee a minimum bandwidth B of communication between two specified nodes. Nodes V represent the devices, edges E represent the connections that can be established. In practical cases, a bounded number k of different interfaces among all the devices can be considered. Despite this assumption, the problem turns out to be NP-hard even for small values of k and Δ, where Δ is the maximum degree of the network. In particular, the problem is NP-hard for any fixed k ≥ 2 and Δ ≥ 3, while it is polynomially solvable when k = 1, or Δ ≤ 2 and k = O(1). Moreover, we show that the problem is not approximable within ηlogB or Ω(loglog|V|) for any fixed k ≥ 3, Δ ≥ 3, and for a certain constant η, unless P=NP. We then provide an approximation algorithm with ratio guarantee of b max , where b max is the maximum communication bandwidth allowed among all the available interfaces. Finally, we focus on particular cases by providing complexity results and polynomial algorithms for Δ ≤ 2
Upward Point-Set Embeddability

We study the problem of Upward Point-Set Embeddability, that is the problem
of deciding whether a given upward planar digraph $D$ has an upward planar
embedding into a point set $S$. We show that any switch tree admits an upward
planar straight-line embedding into any convex point set. For the class of
$k$-switch trees, that is a generalization of switch trees (according to this
definition a switch tree is a $1$-switch tree), we show that not every
$k$-switch tree admits an upward planar straight-line embedding into any convex
point set, for any $k \geq 2$. Finally we show that the problem of Upward
Point-Set Embeddability is NP-complete
Folk Theorems on the Correspondence between State-Based and Event-Based
  Systems

Kripke Structures and Labelled Transition Systems are the two most prominent
semantic models used in concurrency theory. Both models are commonly believed
to be equi-expressive. One can find many ad-hoc embeddings of one of these
models into the other. We build upon the seminal work of De Nicola and
Vaandrager that firmly established the correspondence between stuttering
equivalence in Kripke Structures and divergence-sensitive branching
bisimulation in Labelled Transition Systems. We show that their embeddings can
also be used for a range of other equivalences of interest, such as strong
bisimilarity, simulation equivalence, and trace equivalence. Furthermore, we
extend the results by De Nicola and Vaandrager by showing that there are
additional translations that allow one to use minimisation techniques in one
semantic domain to obtain minimal representatives in the other semantic domain
for these equivalences.Comment: Full version of SOFSEM 2011 pape
The Straight-Line RAC Drawing Problem is NP-Hard

Recent cognitive experiments have shown that the negative impact of an edge
crossing on the human understanding of a graph drawing, tends to be eliminated
in the case where the crossing angles are greater than 70 degrees. This
motivated the study of RAC drawings, in which every pair of crossing edges
intersects at right angle. In this work, we demonstrate a class of graphs with
unique RAC combinatorial embedding and we employ members of this class in order
to show that it is NP-hard to decide whether a graph admits a straight-line RAC
drawing.Comment: 23 pages in tota
An overview of comonotonicity and its applications in finance and insurance

Over the last decade, it has been shown that the concept of comonotonicity is a helpful tool for solving several research and practical problems in the domain of finance and insurance. In this chapter, we give an extensive bibliographic overview --- without claiming to be complete --- of the developments of the theory of comonotonicity and its applications, with an emphasis on the achievements in the period 2004-2010. These applications range from pricing and hedging of derivatives over risk management to life insurance
Modelling Information Flows in Financial Markets

This paper presents an overview of information-based asset pricing. In this
approach, an asset is defined by its cash-flow structure. The market is assumed
to have access to "partial" information about future cash flows. Each cash flow
is determined by a collection of independent market factors called X-factors.
The market filtration is generated by a set of information processes, each of
which carries information about one of the X-factors, and eventually reveals
the X-factor. Each information process has two terms, one of which contains a
"signal" about the associated X-factor, and the other of which represents
"market noise". The price of an asset is given by the expectation of the
discounted cash flows in the risk-neutral measure, conditional on the
information provided by the market. When the market noise is modelled by a
Brownian bridge one is able to construct explicit formulae for asset prices, as
well as semi-analytic expressions for the prices and greeks of options and
derivatives. In particular, option price data can be used to determine the
information flow-rate parameters implicit in the definitions of the information
processes. One consequence of the modelling framework is a specific scheme of
stochastic volatility and correlation processes. Instead of imposing a
volatility and correlation model upon the dynamics of a set of assets, one is
able to deduce the dynamics of the volatilities and correlations of the asset
price movements from more primitive assumptions involving the associated cash
flows. The paper concludes with an examination of situations involving
asymmetric information. We present a simple model for informed traders and show
how this can be used as a basis for so-called statistical arbitrage. Finally,
we consider the problem of price formation in a heterogeneous market with
multiple agents
Hydrodynamic simulations of shell convection in stellar cores

Shell convection driven by nuclear burning in a stellar core is a common
hydrodynamic event in the evolution of many types of stars. We encounter and
simulate this convection (i) in the helium core of a low-mass red giant during
core helium flash leading to a dredge-down of protons across an entropy
barrier, (ii) in a carbon-oxygen core of an intermediate-mass star during core
carbon flash, and (iii) in the oxygen and carbon burning shell above the
silicon-sulfur rich core of a massive star prior to supernova explosion. Our
results, which were obtained with the hydrodynamics code HERAKLES, suggest that
both entropy gradients and entropy barriers are less important for stellar
structure than commonly assumed. Our simulations further reveal a new dynamic
mixing process operating below the base of shell convection zones.Comment: 8 pages, 3 figures .. submitted to a proceedings of conference about
  "Red Giants as Probes of the Structure and Evolution of the Milky Way" which
  has taken place between 15-17 November 2010 in Rom
Provincial Chinese actors in Africa: The case of Sichuan in Uganda

Contains fulltext :
                  169174.pdf (publisher's version ) (Open Access)In 2001, the Chinese government began a strong, sustained push for Chinese companies to increase their outgoing investment. The expansion of China's "Going Out" or "Going Global" strategy has brought an increasing number of new domestic and international actors in China-Africa relations. Although scholars and journalists have reported on the role of Chinese ministries and state-owned enterprises (SOEs) in Africa, the role of China’s provincial/local governments and provincial companies is seldom covered.  Medical teams from Chinese provinces have long been officially "twinned" with particular African countries: Hunan Province serves Sierra Leone and Zimbabwe, for example. Yet unofficial "twinning" between Chinese provinces and African countries has also gradually taken shape in the last thirty years. This generally evolved as Chinese aid workers from particular provinces gained experience in particular African countries, and then introduced others from their province over time. This has laid the foundation for "clustering" - when a group of companies from one region in China all locate fairly close to each other in one African country. As China's "Going Out" policies have evolved, overseas business clusters are becoming officially recognized and promoted by Chinese government officials at all levels.  This brief explores how "twinning" has led to "clustering" of provincial Chinese actors in Africa, and how twinning and clustering are related to China's foreign aid program.4 p
Some Experiments in Evaluating ASR Systems Applied to Multimedia Retrieval

Proceedings of: 7th International Workshop on Adaptive Multimedia Retrieval (AMR 2009). Took place 2009, September 24-25, in Madrid. The event Web site is http://nlp.uned.es/amr2009/This paper describes some tests performed on different types of voice/audio input applying three commercial speech recognition tools. Three multimedia retrieval scenarios are considered: a question answering system, an automatic transcription of audio from video files and a real-time captioning system used in the classroom for deaf students. A software tool, RET (Recognition Evaluation Tool), has been developed to test the output of commercial ASR systems.This research work has been supported by the Regional Government of Madrid under the Research Network MA2VICMR (S2009/TIC-1542) and by the Spanish Ministry of Education under the project BRAVO (TIN2007-67407-C03-01).Publicad
Prosemantic features for content-based image retrieval

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-18449-9_8Revised Selected Papers of 7th International Workshop, AMR 2009, Madrid, Spain, September 24-25, 2009We present here, an image description approach based on prosemantic features. The images are represented by a set of low-level features related to their structure and color distribution. Those descriptions are fed to a battery of image classifiers trained to evaluate the membership of the images with respect to a set of 14 overlapping classes. Prosemantic features are obtained by packing together the scores. To verify the effectiveness of the approach, we designed a target search experiment in which both low-level and prosemantic features are embedded into a content-based image retrieval system exploiting relevance feedback. The experiments show that the use of prosemantic features allows for a more successful and quick retrieval of the query images
GVSR: an On-Line Guide for Choosing a Graph Visualization Software

International audienceIt is easy to find graph visualization applications for all sorts of uses. However, choosing an appropriate application may be difficult. This poster pre-sents a website (\url{http://gvsr.polytech.univ-nantes.fr/}) built to help users to choose a program adapted to their problems. So far, this site references eighty programs and aims at helping users both in their choices and in comparing the programs. The site is also designed as a tool repository helping the community to access and compare the available tools, and benchmark new techniques and algorithms
Model-based clustering with Hidden Markov Models and its application to financial time-series data

We have developed a method to partition a set of data into clusters by use of Hidden Markov Models. Given a number of clusters, each of which is represented by one Hidden Markov Model, an iterative procedure finds the combination of cluster models and an assignment of data points to cluster models which maximizes the joint likelihood of the clustering. To reflect the non-Markovian nature of some aspects of the data we also extend classical Hidden Markov Models to employ a non-homogeneous Markov chain, where the non-homogeneity is dependent not on the time of the observation but rather on a quantity derived from previous observations. We present the method, a proof of convergence for the training procedure and an evaluation of the method on simulated time-series data as well as on large data sets of financial time-series from the Public Saving and Loan Banks in Germany