pinecone/core-2020-05-10-deduplication huggingface dataset:
Tractable Pathfinding for the Stochastic On-Time Arrival Problem

We present a new and more efficient technique for computing the route that
maximizes the probability of on-time arrival in stochastic networks, also known
as the path-based stochastic on-time arrival (SOTA) problem. Our primary
contribution is a pathfinding algorithm that uses the solution to the
policy-based SOTA problem---which is of pseudo-polynomial-time complexity in
the time budget of the journey---as a search heuristic for the optimal path. In
particular, we show that this heuristic can be exceptionally efficient in
practice, effectively making it possible to solve the path-based SOTA problem
as quickly as the policy-based SOTA problem. Our secondary contribution is the
extension of policy-based preprocessing to path-based preprocessing for the
SOTA problem. In the process, we also introduce Arc-Potentials, a more
efficient generalization of Stochastic Arc-Flags that can be used for both
policy- and path-based SOTA. After developing the pathfinding and preprocessing
algorithms, we evaluate their performance on two different real-world networks.
To the best of our knowledge, these techniques provide the most efficient
computation strategy for the path-based SOTA problem for general probability
distributions, both with and without preprocessing.Comment: Submission accepted by the International Symposium on Experimental
  Algorithms 2016 and published by Springer in the Lecture Notes in Computer
  Science series on June 1, 2016. Includes typographical corrections and
  modifications to pre-processing made after the initial submission to SODA'15
  (July 7, 2014
Better partitions of protein graphs for subsystem quantum chemistry

Determining the interaction strength between proteins and small molecules is
key to analyzing their biological function. Quantum-mechanical calculations
such as \emph{Density Functional Theory} (DFT) give accurate and theoretically
well-founded results. With common implementations the running time of DFT
calculations increases quadratically with molecule size. Thus, numerous
subsystem-based approaches have been developed to accelerate quantum-chemical
calculations. These approaches partition the protein into different fragments,
which are treated separately. Interactions between different fragments are
approximated and introduce inaccuracies in the calculated interaction energies.
  To minimize these inaccuracies, we represent the amino acids and their
interactions as a weighted graph in order to apply graph partitioning. None of
the existing graph partitioning work can be directly used, though, due to the
unique constraints in partitioning such protein graphs. We therefore present
and evaluate several algorithms, partially building upon established concepts,
but adapted to handle the new constraints. For the special case of partitioning
a protein along the main chain, we also present an efficient dynamic
programming algorithm that yields provably optimal results. In the general
scenario our algorithms usually improve the previous approach significantly and
take at most a few seconds.Comment: 14 pages main part, 6 pages appendix. Published in the Proceedings of
  the 15th International Symposium on Experimental Algorithms (SEA 2016
Factorizations of Elements in Noncommutative Rings: A Survey

We survey results on factorizations of non zero-divisors into atoms
(irreducible elements) in noncommutative rings. The point of view in this
survey is motivated by the commutative theory of non-unique factorizations.
Topics covered include unique factorization up to order and similarity, 2-firs,
and modular LCM domains, as well as UFRs and UFDs in the sense of Chatters and
Jordan and generalizations thereof. We recall arithmetical invariants for the
study of non-unique factorizations, and give transfer results for arithmetical
invariants in matrix rings, rings of triangular matrices, and classical maximal
orders as well as classical hereditary orders in central simple algebras over
global fields.Comment: 50 pages, comments welcom
A Multi Bearer Adaptable Communication Demonstrator for Train-to-Ground IP Communication to Increase Resilience

Preprint versionThis paper presents the setup of a demonstrator based on
Multipath TCP protocol to provide a multi bearer—WiFi and WiMAX—
and resilient agnostic layer to support train-to-ground IP communica-
tion. The adaptable communication and resilient architecture consists
of three main blocks: an Acquisition System, a Detection System and a
Multipath Communication System. Several tests carried out with jam-
ming devices disturbing the data transfer established between the end
devices demonstrate the resilient capability and performance of the pro-
posed architecture to overcome electromagnetic attacks.The work described in this paper is partially supported by
the EU FP7-SEC-2011-1 Collaborative Research Project entitled SECRET and by the
Spanish Ministry of Economy and Competitiveness through the SAREMSIG TEC2013-
47012-C2 project (Contribution to a Safe Railway Operation: Evaluating the effect of
Electromagnetic Disturbances on Railway Control Signalling Systems). This work is
produced within the Training and Research Unit UFI11/16 funded by the UPV/EHU
Quantum measurement of spins and magnets, and the classical limit of
  PR-boxes

When Alice measures all her spin-$\half$ of a large ensemble of $N$ singlets,
all along the same direction $\vec a$, she prepares at a distance an ensemble
of spins for Bob which, because of statistical fluctuations, have a magnetic
moment of the order $\sqrt{N}$. By making $N$ large enough, this magnetic
moment can be made arbitrarily large. We show that, nevertheless, Bob can't
read out of this large magnetic moment Alice's choice of measurement direction
$\vec a$. We also consider stronger than quantum correlations and show that
Tsirelson's bound follows from the physical assumption that in the macroscopic
limit all measurements are compatible and that this should not lead to
signaling.Comment: Talk presented at the European Chist-Era DIQIP project meeting in May
  2013. 5 page
Analysing multiparticle quantum states

The analysis of multiparticle quantum states is a central problem in quantum
information processing. This task poses several challenges for experimenters
and theoreticians. We give an overview over current problems and possible
solutions concerning systematic errors of quantum devices, the reconstruction
of quantum states, and the analysis of correlations and complexity in
multiparticle density matrices.Comment: 20 pages, 4 figures, prepared for proceedings of the "Quantum
  [Un]speakables II" conference (Vienna, 2014
Few-body entanglement manipulation

In order to cope with the fact that there exists no single maximally
entangled state (up to local unitaries) in the multipartite setting, we
introduced in [J. I. de Vicente, C. Spee and B. Kraus, Phys. Rev. Lett. 111,
110502 (2013)] the maximally entangled set of n-partite quantum states. This
set consists of the states that are most useful under conversion of pure states
via Local Operations assisted by Classical Communication (LOCC). We will review
our results here on the maximally entangled set of three- and generic
four-qubit states. Moreover, we will discuss the preparation of arbitrary (pure
or mixed) states via deterministic LOCC transformations. In particular, we will
consider the deterministic preparation of arbitrary three-qubit (four-qubit)
states via LOCC using as a resource a six-qubit (23-qubit) state respectively.Comment: 10 pages, 2 figures, minor change
Causarum Investigatio and the Two Bell's Theorems of John Bell

“Bell’s theorem” can refer to two different theorems that John Bell proved, the first in 1964 and the second in 1976. His 1964 theorem is the incompatibility of quantum phenomena with the joint assumptions of locality and predetermination. His 1976 theorem is their incompatibility with the single property of local causality. This is contrary to Bell’s own later assertions, that his 1964 theorem began with the assumption of local causality, even if not by that name. Although the two Bell’s theorems are logically equivalent, their assumptions are not. Hence, the earlier and later theorems suggest quite different conclusions, embraced by operationalists and realists, respectively. The key issue is whether locality or local causality is the appropriate notion emanating from relativistic causality, and this rests on one’s basic notion of causation. For operationalists the appropriate notion is what is here called the Principle of agent-causation, while for realists it is Reichenbach’s Principle of common cause. By breaking down the latter into even more basic Postulates, it is possible to obtain a version of Bell’s theorem in which each camp could reject one assumption, happy that the remaining assumptions reflect its weltanschauung. Formulating Bell’s theorem in terms of causation is fruitful not just for attempting to reconcile the two camps, but also for better describing the ontology of different quantum interpretations and for more deeply understanding the implications of Bell’s marvellous work.Griffith Sciences, School of Environment and ScienceFull Tex
Addressing the Regression Test Problem with Change Impact Analysis for
  Ada

The regression test selection problem--selecting a subset of a test-suite
given a change--has been studied widely over the past two decades. However, the
problem has seen little attention when constrained to high-criticality
developments and where a "safe" selection of tests need to be chosen. Further,
no practical approaches have been presented for the programming language Ada.
In this paper, we introduce an approach to solving the selection problem given
a combination of both static and dynamic data for a program and a change-set.
We present a change impact analysis for Ada that selects the safe set of tests
that need to be re-executed to ensure no regressions. We have implemented the
approach in the commercial, unit-testing tool VectorCAST, and validated it on a
number of open-source examples. On an example of a fully-functioning Ada
implementation of a DNS server (IRONSIDES), the experimental results show a 97%
reduction in test-case execution.Comment: Appears in the Proceedings of Ada-Europe 201
Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics

International audienceThis paper considers realizability of schedules by stochastic concurrent timed systems. Schedules are high level views of desired executions represented as partial orders decorated with timing constraints, while systems are represented as elementary stochastic time Petri nets. We first consider logical realizability: a schedule is realizable by a net N if it embeds in a time process of N that satisfies all its constraints. However, with continuous time domains, the probability of a time process that realizes a schedule is null. We hence consider probabilistic realizability up to α time units, that holds if the probability that N logically realizes S with constraints enlarged by α is strictly positive. Upon a sensible restriction guaranteeing time progress, logical and probabilistic realizability of a schedule can be checked on the finite set of symbolic prefixes extracted from a bounded unfolding of the net. We give a construction technique for these prefixes and show that they represent all time processes of a net occurring up to a given maximal date. We then show how to verify existence of an embedding and compute the probability of its realization
Anti-alignments in conformance checking: the dark side of process models

Conformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the wellknown state space explosion problem, hence handling process models exhibiting large or even infinite state spaces remains a challenge. One important metric in conformance checking is to asses the precision of the model with respect to the observed executions, i.e., characterize the ability of the model to produce behavior unrelated to the one observed. By avoiding the computation of the full state space of a model, current techniques only provide estimations of the precision metric, which in some situations tend to be very optimistic, thus hiding real problems a process model may have. In this paper we present the notion of antialignment as a concept to help unveiling traces in the model that may deviate significantly from the observed behavior. Using anti-alignments, current estimations can be improved, e.g., in precision checking. We show how to express the problem of finding anti-alignments as the satisfiability of a Boolean formula, and provide a tool which can deal with large models efficiently.Peer ReviewedPostprint (author's final draft
Decidable Classes of Unbounded Petri Nets with Time and Urgency

International audienceAdding real time information to Petri net models often leads to un-decidability of classical verification problems such as reachability and bounded-ness. For instance, models such as Timed-Transition Petri nets (TPNs) are intractable except in a bounded setting. On the other hand, the model of Timed-Arc Petri nets enjoys decidability results for boundedness and control-state reachability problems at the cost of disallowing urgency (the ability to enforce actions within a time delay). Our goal is to investigate decidable classes of Petri nets with time that capture some urgency and still allow unbounded behaviors, which go beyond finite state systems. We present, up to our knowledge, the first decidability results on reachability and boundedness for Petri net variants that combine unbounded places, time, and urgency. For this, we introduce the class of Timed-Arc Petri nets with restricted Urgency, where urgency can be used only on transitions consuming tokens from bounded places. We show that control-state reachability and boundedness are de-cidable for this new class, by extending results from Timed-Arc Petri nets (without urgency). Our main result concerns (marking) reachability, which is un-decidable for both TPNs (because of unrestricted urgency) [20] and Timed-Arc Petri Nets (because of infinite number of " clocks "). We obtain decidability of reachability for unbounded TPNs with restricted urgency under a new, yet natural , timed-arc semantics presenting them as Timed-Arc Petri Nets with restricted urgency. Decidability of reachability under the intermediate marking semantics is also obtained for a restricted subclass
Effects of additive noise on the stability of glacial cycles

It is well acknowledged that the sequence of glacial-interglacial cycles is
paced by the astronomical forcing. However, how much is the sequence robust
against natural fluctuations associated, for example, with the chaotic motions
of atmosphere and oceans? In this article, the stability of the
glacial-interglacial cycles is investigated on the basis of simple conceptual
models. Specifically, we study the influence of additive white Gaussian noise
on the sequence of the glacial cycles generated by stochastic versions of
several low-order dynamical system models proposed in the literature. In the
original deterministic case, the models exhibit different types of attractors:
a quasiperiodic attractor, a piecewise continuous attractor, strange nonchaotic
attractors, and a chaotic attractor. We show that the combination of the
quasiperiodic astronomical forcing and additive fluctuations induce a form of
temporarily quantised instability. More precisely, climate trajectories
corresponding to different noise realizations generally cluster around a small
number of stable or transiently stable trajectories present in the
deterministic system. Furthermore, these stochastic trajectories may show
sensitive dependence on very small amounts of perturbations at key times.
Consistently with the complexity of each attractor, the number of trajectories
leaking from the clusters may range from almost zero (the model with a
quasiperiodic attractor) to a significant fraction of the total (the model with
a chaotic attractor), the models with strange nonchaotic attractors being
intermediate. Finally, we discuss the implications of this investigation for
research programmes based on numerical simulators. }Comment: Parlty based on a lecture given by M. Crucifix at workshop held in
  Rome in 2013 as a part of Mathematics of Planet Earth 201
Western historical traditions of well-being

This chapter provides a brief historical overview of Western philosophical views about well-being from the eighth century before the Common Era to the middle of the twentieth century. We explain different understandings of the concept of well-being, including our preferred understanding of well-being as the subjective states and objective conditions that make our lives go well for us. Although this review is necessarily incomplete, we discuss some of the most salient and influential contributions to our subject. To that end, we cover some key views from ancient Greece, including the aristocratic values that were considered central to leading a good life, notions of personal and more expansive harmony as they key to well-being, and the idea that the experience of pleasure is all we should really care about. We also explain some of the major religious conceptions of the good life and their progression through the Middle Ages and beyond. We further consider more recent secular conceptions of well-being, including several views on the importance of personal and public happiness. Finally, we discuss views to the effect that happiness is not enough for the good life and that we should strive for loftier goals
Detection of malicious data in vehicular ad-hoc networks for traffic
  signal control applications

Effective applications of vehicular ad hoc networks in traffic signal control
require new methods for detection of malicious data. Injection of malicious
data can result in significantly decreased performance of such applications,
increased vehicle delays, fuel consumption, congestion, or even safety threats.
This paper introduces a method, which combines a model of expected driver
behaviour with position verification in order to detect the malicious data
injected by vehicle nodes that perform Sybil attacks. Effectiveness of this
approach was demonstrated in simulation experiments for a decentralized
self-organizing system that controls the traffic signals at multiple
intersections in an urban road network. Experimental results show that the
proposed method is useful for mitigating the negative impact of malicious data
on the performance of traffic signal control.Comment: 11 pages, 4 figure
C*-tensor categories and subfactors for totally disconnected groups

We associate a rigid C*-tensor category $C$ to a totally disconnected locally
compact group $G$ and a compact open subgroup $K < G$. We characterize when $C$
has the Haagerup property or property (T), and when $C$ is weakly amenable.
When $G$ is compactly generated, we prove that $C$ is essentially equivalent to
the planar algebra associated by Jones and Burstein to a group acting on a
locally finite bipartite graph. We then concretely realize $C$ as the category
of bimodules generated by a hyperfinite subfactor.Comment: v2: minor changes, final version, to appear in the proceedings of the
  2015 Abel Symposiu
Decomposable approximations revisited

Nuclear C*-algebras enjoy a number of approximation properties, most famously
the completely positive approximation property. This was recently sharpened to
arrange for the incoming maps to be sums of order-zero maps. We show that, in
addition, the outgoing maps can be chosen to be asymptotically order-zero.
Further these maps can be chosen to be asymptotically multiplicative if and
only if the C*-algebra and all its traces are quasidiagonal.Comment: New section 4 added, providing a lifting lemma needed for the
  statement of Prop 3.2. Footnote 5 added to end of proof of Prop 3.2, and
  bibliography and precise locations of references updated. No other changes
  made to sects 1-3. 19 Page
A dynamic emotional model for agent societies

This paper presents a first approximation of a dynamic emotional
model to be employed in agent societies. The proposed model is
based on the PAD emotional model and allows the representation of
the emotional contagion phenomena of a heterogeneous group of agents
which are capable of express emotions. Moreover, the proposal allows
the definition of the social emotion of this group of agents. The model is
mainly based on three elements: personality, empathy and affinity. These
elements allow the characterization of each individual, causing them susceptible
to vary in some degre the emotions of other individuals
Fair Multi-agent Task Allocation for Large Data Sets Analysis

International audienceMany companies are using MapReduce applications to process very large amounts of data. Static optimization of such applications is complex because they are based on user-defined operations, called map and reduce, which prevents some algebraic optimization. In order to optimize the task allocation, several systems collect data from previous runs and predict the performance doing job profiling. However they are not effective during the learning phase, or when a new type of job or data set appears. In this paper, we present an adaptive multi-agent system for large data sets analysis with MapReduce. We do not preprocess data and we adopt a dynamic approach, where the reducer agents interact during the job. In order to decrease the workload of the most loaded reducer-and so the execution time-we propose a task reallocation based on negotiation
Detecting social emotions with a NAO robot

This article aims to give an approach of a dynamic and emotional
propagation, which allows to calculate the propagation of the emotion
of a group of humans and/or intelligent entities. The dynamic model
is based on the Newton laws in order to calculate the emotional attraction
among them. To obtain the emotions we use a NAO robot as a tool
to move around of a real environment for interacting with the humans.
The robot obtains the emotions through image processing. Moreover, the
robot can start a dialogue game with humans in order to estimate the
personality of a new individual.This work is partially supported by the MINECO project TIN2015-65515-C4-1-
R and the FPI grant AP2013-01276 awarded to Jaime-Andres Rincon
Some open questions on arithmetic Zariski pairs

In this paper, complement-equivalent arithmetic Zariski pairs will be
exhibited answering in the negative a question by Eyral-Oka on these curves and
their groups. A complement-equivalent arithmetic Zariski pair is a pair of
complex projective plane curves having Galois-conjugate equations in some
number field whose complements are homeomorphic, but whose embeddings in
$\mathbb{P}^2$ are not.
  Most of the known invariants used to detect Zariski pairs depend on the
\'etale fundamental group. In the case of Galois-conjugate curves, their
\'etale fundamental groups coincide. Braid monodromy factorization appears to
be sensitive to the difference between \'etale fundamental groups and
homeomorphism class of embeddings.Comment: 21 pages, 7 figure