pinecone/core-2020-05-10-deduplication huggingface dataset:
Time Really Passes, Science Can't Deny That

Today's science provides quite a lean picture of time as a mere geometric
evolution parameter. I argue that time is much richer. In particular, I argue
that besides the geometric time, there is creative time, when objective chance
events happen. The existence of the latter follows straight from the existence
of free-will. Following the french philosopher Lequyer, I argue that free-will
is a prerequisite for the possibility to have rational argumentations, hence
can't be denied. Consequently, science can't deny the existence of creative
time and thus that time really passes.Comment: Talk presented at the Conference "Time in Physics" at the ETH-Zurich,
  September 2015. 7 page
Relativistic quantum clocks

The conflict between quantum theory and the theory of relativity is
exemplified in their treatment of time. We examine the ways in which their
conceptions differ, and describe a semiclassical clock model combining elements
of both theories. The results obtained with this clock model in flat spacetime
are reviewed, and the problem of generalizing the model to curved spacetime is
discussed, before briefly describing an experimental setup which could be used
to test of the model. Taking an operationalist view, where time is that which
is measured by a clock, we discuss the conclusions that can be drawn from these
results, and what clues they contain for a full quantum relativistic theory of
time.Comment: 12 pages, 4 figures. Invited contribution for the proceedings for
  "Workshop on Time in Physics" Zurich 201
Causality - Complexity - Consistency: Can Space-Time Be Based on Logic
  and Computation?

The difficulty of explaining non-local correlations in a fixed causal
structure sheds new light on the old debate on whether space and time are to be
seen as fundamental. Refraining from assuming space-time as given a priori has
a number of consequences. First, the usual definitions of randomness depend on
a causal structure and turn meaningless. So motivated, we propose an intrinsic,
physically motivated measure for the randomness of a string of bits: its length
minus its normalized work value, a quantity we closely relate to its Kolmogorov
complexity (the length of the shortest program making a universal Turing
machine output this string). We test this alternative concept of randomness for
the example of non-local correlations, and we end up with a reasoning that
leads to similar conclusions as in, but is conceptually more direct than, the
probabilistic view since only the outcomes of measurements that can actually
all be carried out together are put into relation to each other. In the same
context-free spirit, we connect the logical reversibility of an evolution to
the second law of thermodynamics and the arrow of time. Refining this, we end
up with a speculation on the emergence of a space-time structure on bit strings
in terms of data-compressibility relations. Finally, we show that logical
consistency, by which we replace the abandoned causality, it strictly weaker a
constraint than the latter in the multi-party case.Comment: 17 pages, 16 figures, small correction
Causal structures and the classification of higher order quantum
  computations

Quantum operations are the most widely used tool in the theory of quantum
information processing, representing elementary transformations of quantum
states that are composed to form complex quantum circuits. The class of quantum
transformations can be extended by including transformations on quantum
operations, and transformations thereof, and so on up to the construction of a
potentially infinite hierarchy of transformations. In the last decade, a
sub-hierarchy, known as quantum combs, was exhaustively studied, and
characterised as the most general class of transformations that can be achieved
by quantum circuits with open slots hosting variable input elements, to form a
complete output quantum circuit. The theory of quantum combs proved to be
successful for the optimisation of information processing tasks otherwise
untreatable. In more recent years the study of maps from combs to combs has
increased, thanks to interesting examples showing how this next order of maps
requires entanglement of the causal order of operations with the state of a
control quantum system, or, even more radically, superpositions of alternate
causal orderings. Some of these non-circuital transformations are known to be
achievable and have even been achieved experimentally, and were proved to
provide some computational advantage in various information-processing tasks
with respect to quantum combs. Here we provide a formal language to form all
possible types of transformations, and use it to prove general structure
theorems for transformations in the hierarchy. We then provide a mathematical
characterisation of the set of maps from combs to combs, hinting at a route for
the complete characterisation of maps in the hierarchy. The classification is
strictly related to the way in which the maps manipulate the causal structure
of input circuits.Comment: 12 pages, revtex styl
A flexible approach for finding optimal paths with minimal conflicts

Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to guarantee that they are consistent, and several automated techniques have been developed to check this. We argue that in some cases it is impossible to guarantee total consistency, and instead we want to find execution paths across such models with minimal conflicts with respect to a certain metric of interest. We present an efficient and scalable solution to find optimal paths through a combination of the theorem prover Isabelle with the constraint solver Z3. Our approach has been inspired by a healthcare problem, namely how to detect conflicts between medications taken by patients with multiple chronic conditions, and how to find preferable alternatives automatically.Postprin
Clique-width and well-quasi ordering of triangle-free graph classes.

Daligault, Rao and Thomassé asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (WG 2015) gave a negative answer to this question, but their counterexample is a class that can only be characterised by infinitely many forbidden induced subgraphs. This raises the issue of whether their question has a positive answer for finitely defined hereditary graph classes. Apart from two stubborn cases, this has been confirmed when at most two induced subgraphs   H1,H2H1,H2  are forbidden. We confirm it for one of the two stubborn cases, namely for the case   (H1,H2)=(triangle,P2+P4)(H1,H2)=(triangle,P2+P4)  by proving that the class of   (triangle,P2+P4)(triangle,P2+P4) -free graphs has bounded clique-width and is well-quasi-ordered. Our technique is based on a special decomposition of 3-partite graphs. We also use this technique to completely determine which classes of   (triangle,H)(triangle,H) -free graphs are well-quasi-ordered
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2.

Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerplanar square root, and whether G has a square root that is of pathwidth at most 2
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and
  Neighborhood Diversity

This paper settles the computational complexity of model checking of several
extensions of the monadic second order (MSO) logic on two classes of graphs:
graphs of bounded treewidth and graphs of bounded neighborhood diversity.
  A classical theorem of Courcelle states that any graph property definable in
MSO is decidable in linear time on graphs of bounded treewidth. Algorithmic
metatheorems like Courcelle's serve to generalize known positive results on
various graph classes. We explore and extend three previously studied MSO
extensions: global and local cardinality constraints (CardMSO and MSO-LCC) and
optimizing the fair objective function (fairMSO).
  First, we show how these extensions of MSO relate to each other in their
expressive power. Furthermore, we highlight a certain "linearity" of some of
the newly introduced extensions which turns out to play an important role.
Second, we provide parameterized algorithm for the aforementioned structural
parameters. On the side of neighborhood diversity, we show that combining the
linear variants of local and global cardinality constraints is possible while
keeping the linear (FPT) runtime but removing linearity of either makes this
impossible. Moreover, we provide a polynomial time (XP) algorithm for the most
powerful of studied extensions, i.e. the combination of global and local
constraints. Furthermore, we show a polynomial time (XP) algorithm on graphs of
bounded treewidth for the same extension. In addition, we propose a general
procedure of deriving XP algorithms on graphs on bounded treewidth via
formulation as Constraint Satisfaction Problems (CSP). This shows an alternate
approach as compared to standard dynamic programming formulations.Comment: An extended abstract appeared in Proceedings of WG 201
Natural language analysis of online health forums

Despite advances in concept extraction from free text, finding\ud
meaningful health related information from online patient forums\ud
still poses a significant challenge. Here we demonstrate how structured\ud
information can be extracted from posts found in such online health related\ud
forums by forming relationships between a drug/treatment and a\ud
symptom or side effect, including the polarity/sentiment of the patient.\ud
In particular, a rule-based natural language processing (NLP) system\ud
is deployed, where information in sentences is linked together though\ud
anaphora resolution. Our NLP relationship extraction system provides\ud
a strong baseline, achieving an F1 score of over 80% in discovering the\ud
said relationships that are present in the posts we analysed
Connecting targets to tweets : semantic attention-based model for target-specific stance detection.

Understanding what people say and really mean in tweets is still a wide open research question. In particular, understanding the stance of a tweet, which is determined not only by its content, but also by the given target, is a very recent research aim of the community. It still remains a challenge to construct a tweet’s vector representation with respect to the target, especially when the target is only implicitly mentioned, or not mentioned at all in the tweet. We believe that better performance can be obtained by incorporating the information of the target into the tweet’s vector representation. In this paper, we thus propose to embed a novel attention mechanism at the semantic level in the bi-directional GRU-CNN structure, which is more fine-grained than the existing token-level attention mechanism. This novel attention mechanism allows the model to automatically attend to useful semantic features of informative tokens in deciding the target-specific stance, which further results in a conditional vector representation of the tweet, with respect to the given target. We evaluate our proposed model on a recent, widely applied benchmark Stance Detection dataset from Twitter for the SemEval-2016 Task 6.A. Experimental results demonstrate that the proposed model substantially outperforms several strong baselines, which include the state-of-the-art token-level attention mechanism on bi-directional GRU outputs and the SVM classifier
Quality-Aware Reactive Programming for the Internet of Things

© 2017, IFIP International Federation for Information Processing. The reactive paradigm recently became very popular in user-interface development: updates — such as the ones from the mouse, keyboard, or from the network — can trigger a chain of computations organised in a dependency graph, letting the underlying engine control the scheduling of these computations. In the context of the Internet of Things (IoT), typical applications deploy components in distributed nodes and link their interfaces, employing a publish-subscribe architecture. The paradigm for Distributed Reactive Programming marries these two concepts, treating each distributed component as a reactive computation. However, existing approaches either require expensive synchronisation mechanisms or they do not support pipelining, i.e., allowing multiple “waves” of updates to be executed in parallel. We propose Quarp (Quality-Aware Reactive Programming), a scalable and light-weight mechanism aimed at the IoT to orchestrate components triggered by updates of data-producing components or of aggregating components. This mechanism appends meta-information to messages between components capturing the context of the data, used to dynamically monitor and guarantee useful properties of the dynamic applications. These include the so-called glitch freedom, time synchronisation, and geographical proximity. We formalise Quarp using a simple operational semantics, provide concrete examples of useful instances of contexts, and situate our approach in the realm of distributed reactive programming.FCT - Fuel Cell Technologies Program(732505 LightKone)Partially financed by the personal FCT grant SFRH/BPD/91908/2012. The research leading to these results has received funding from the European Union’s Horizon 2020 - The EU Framework Programme for Research and Innovation 2014-2020, under grant agreement No. 732505.Project “TEC4Growth - Pervasive Intelligence, Enhancers and Proofs of Concept with Industrial Impact/NORTE-01- 0145-FEDER-000020” is financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement, and through the European Regional Development Fund (ERDF).info:eu-repo/semantics/publishedVersio
ECHO: An Adaptive Orchestration Platform for Hybrid Dataflows across
  Cloud and Edge

The Internet of Things (IoT) is offering unprecedented observational data
that are used for managing Smart City utilities. Edge and Fog gateway devices
are an integral part of IoT deployments to acquire real-time data and enact
controls. Recently, Edge-computing is emerging as first-class paradigm to
complement Cloud-centric analytics. But a key limitation is the lack of a
platform-as-a-service for applications spanning Edge and Cloud. Here, we
propose ECHO, an orchestration platform for dataflows across distributed
resources. ECHO's hybrid dataflow composition can operate on diverse data
models -- streams, micro-batches and files, and interface with native runtime
engines like TensorFlow and Storm to execute them. It manages the application's
lifecycle, including container-based deployment and a registry for state
management. ECHO can schedule the dataflow on different Edge, Fog and Cloud
resources, and also perform dynamic task migration between resources. We
validate the ECHO platform for executing video analytics and sensor streams for
Smart Traffic and Smart Utility applications on Raspberry Pi, NVidia TX1, ARM64
and Azure Cloud VM resources, and present our results.Comment: 17 pages, 5 figures, 2 tables, submitted to ICSOC-201
Validation of Service Blueprint models by means of formal simulation techniques

As service design has gained interest in the last years, so has gained one of its primary tools: the Service Blueprint. In essence, a service blueprint is a graphical tool for the design of business models, specifically for the design of business service operations. Despite its level of adoption, tool support for service design tasks is still on its early days and available tools for service blueprint modeling are mainly focused on enhancing usability and enabling collaborative edition, disregarding the formal aspects of modeling. In this paper we present a way to support the validation of service blueprint models by simulation. This approach is based on annotating the models with formal semantics, so that each task can be translated into formal logics, and from them, to executable SQL statements. This works opens a new direction in the way to bridge formal techniques and creative service design processes.Peer ReviewedPostprint (author's final draft
On completeness of coherent states in noncommutative spaces with
  generalised uncertainty principle

Coherent states are required to form a complete set of vectors in the Hilbert
space by providing the resolution of identity. We study the completeness of
coherent states for two different models in a noncommutative space associated
with the generalised uncertainty relation by finding the resolution of unity
with a positive definite weight function. The weight function, which is
sometimes known as the Borel measure, is obtained through explicit analytic
solutions of the Stieltjes and Hausdorff moment problem with the help of the
standard techniques of inverse Mellin transform.Comment: 6 page
Gravitational "seesaw" and light bending in higher-derivative gravity

Local gravitational theories with more than four derivatives have remarkable
quantum properties, e.g., they are super-renormalizable and may be unitary in
the Lee-Wick sense. Therefore, it is important to explore also the IR limit of
these theories and identify observable signatures of the higher derivatives. In
the present work we study the scattering of a photon by a classical external
gravitational field in the sixth-derivative model whose propagator contains
only real, simple poles. Also, we discuss the possibility of a gravitational
seesaw-like mechanism, which could allow the make up of a relatively small
physical mass from the huge massive parameters of the action. If possible, this
mechanism would be a way out of the Planck suppression, affecting the
gravitational deflection of low energy photons. It turns out that the mechanism
which actually occurs works only to shift heavier masses to the further UV
region. This fact may be favourable for protecting the theory from
instabilities, but makes experimental detection of higher derivatives more
difficult.Comment: 6 pages, 1 figure. Talk given at GROUP31 (31st ICGTMP), Rio de
  Janeiro, June 201
Software for full-color 3D reconstruction of the biological tissues
  internal structure

A software for processing sets of full-color images of biological tissue
histological sections is developed. We used histological sections obtained by
the method of high-precision layer-by-layer grinding of frozen biological
tissues. The software allows restoring the image of the tissue for an arbitrary
cross-section of the tissue sample. Thus, our method is designed to create a
full-color 3D reconstruction of the biological tissue structure. The resolution
of 3D reconstruction is determined by the quality of the initial histological
sections. The newly developed technology available to us provides a resolution
of up to 5 - 10 {\mu}m in three dimensions.Comment: 11 pages, 8 figure
Plasticity of the Muscle Stem Cell Microenvironment

Satellite cells (SCs) are adult muscle stem cells capable of repairing damaged and creating new muscle tissue throughout life. Their functionality is tightly controlled by a microenvironment composed of a wide variety of factors, such as numerous secreted molecules and different cell types, including blood vessels, oxygen, hormones, motor neurons, immune cells, cytokines, fibroblasts, growth factors, myofibers, myofiber metabolism, the extracellular matrix and tissue stiffness. This complex niche controls SC biology-quiescence, activation, proliferation, differentiation or renewal and return to quiescence. In this review, we attempt to give a brief overview of the most important players in the niche and their mutual interaction with SCs. We address the importance of the niche to SC behavior under physiological and pathological conditions, and finally survey the significance of an artificial niche both for basic and translational research purposes
Mining Process Model Descriptions of Daily Life through Event
  Abstraction

Process mining techniques focus on extracting insight in processes from event
logs. Process mining has the potential to provide valuable insights in
(un)healthy habits and to contribute to ambient assisted living solutions when
applied on data from smart home environments. However, events recorded in smart
home environments are on the level of sensor triggers, at which process
discovery algorithms produce overgeneralizing process models that allow for too
much behavior and that are difficult to interpret for human experts. We show
that abstracting the events to a higher-level interpretation can enable
discovery of more precise and more comprehensible models. We present a
framework for the extraction of features that can be used for abstraction with
supervised learning methods that is based on the XES IEEE standard for event
logs. This framework can automatically abstract sensor-level events to their
interpretation at the human activity level, after training it on training data
for which both the sensor and human activity events are known. We demonstrate
our abstraction framework on three real-life smart home event logs and show
that the process models that can be discovered after abstraction are more
precise indeed.Comment: arXiv admin note: substantial text overlap with arXiv:1606.0728
Efficient adaptive implementation of the serial schedule generation scheme using preprocessing and bloom filters

The majority of scheduling metaheuristics use indirect representation of solutions as a way to efficiently explore the search space. Thus, a crucial part of such metaheuristics is a “schedule generation scheme” – procedure translating the indirect solution representation into a schedule. Schedule generation scheme is used every time a new candidate solution needs to be evaluated. Being relatively slow, it eats up most of the running time of the metaheuristic and, thus, its speed plays significant role in performance of the metaheuristic. Despite its importance, little attention has been paid in the literature to efficient implementation of schedule generation schemes. We give detailed description of serial schedule generation scheme, including new improvements, and propose a new approach for speeding it up, by using Bloom filters. The results are further strengthened by automated control of parameters. Finally, we employ online algorithm selection to dynamically choose which of the two implementations to use. This hybrid approach significantly outperforms conventional implementation on a wide range of instances