pinecone/core-2020-05-10-deduplication huggingface dataset:
Revisiting two-sided stability constraints

We show that previous filtering propositions on two-sided stability problems do not enforce arc consistency (AC), however they maintain Bound(D) Consistency (BC(D)). We propose an optimal algorithm achieving BC(D) with O(L) time complexity where L is the length of the preference lists. We also show an adaptation of this filtering approach to achieve AC. Next, we report the first polynomial time algorithm for solving the hospital/resident problem with forced and forbidden pairs. Furthermore, we show that the particular case of this problem for stable marriage can be solved in O(n2) which improves the previously best complexity by a factor of n2. Finally, we present a comprehensive set of experiments to evaluate the filtering propositions
Mean-Field Limits Beyond Ordinary Differential Equations

16th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2016, Bertinoro, Italy, June 20-24, 2016, Advanced LecturesInternational audienceWe study the limiting behaviour of stochastic models of populations of interacting agents, as the number of agents goes to infinity. Classical mean-field results have established that this limiting behaviour is described by an ordinary differential equation (ODE) under two conditions: (1) that the dynamics is smooth; and (2) that the population is composed of a finite number of homogeneous sub-populations, each containing a large number of agents. This paper reviews recent work showing what happens if these conditions do not hold. In these cases, it is still possible to exhibit a limiting regime at the price of replacing the ODE by a more complex dynamical system. In the case of non-smooth or uncertain dynamics, the limiting regime is given by a differential inclusion. In the case of multiple population scales, the ODE is replaced by a stochastic hybrid automaton
Big Data Management in the Cloud: Evolution or Crossroad?

In this paper, we try to provide a synthetic and comprehensive state of the art concerning big data management in cloud environments. In this perspective, data management based on parallel and cloud (e.g. MapReduce) systems are overviewed, and compared by relying on meeting software requirements (e.g. data independence, software reuse), high performance, scalability, elasticity, and data availability. With respect to proposed cloud systems, we discuss evolution of their data manipulation languages and we try to learn some lessons should be exploited to ensure the viability of the next generation of large-scale data management systems for big data applications
Linking data, services and human know-how

An increasing number of everyday tasks involve a mixture of human actions and machine computation. This paper presents the first framework that allows non-programmer users to create and execute workflows where each task can be completed by a human or a machine. In this framework, humans and machines interact through a shared knowledge base which is both human and machine understandable. This knowledge base is based on the PROHOW Linked Data vocabulary that can represent human instructions and link them to machine functionalities. Our hypothesis is that non-programmer users can describe how to achievecertain tasks at a level of abstraction which is both human and machine understandable. This paper presents the PROHOW vocabulary and describes its usage within the proposed framework. We substantiate our claim with a concrete implementation of our framework and by experimental evidence.Postprin
Implicit Entity Linking in Tweets

Over the years, Twitter has become one of the largest communication platforms
providing key data to various applications such as brand monitoring, trend
detection, among others. Entity linking is one of the major tasks in natural
language understanding from tweets and it associates entity mentions in text to
corresponding entries in knowledge bases in order to provide unambiguous
interpretation and additional con- text. State-of-the-art techniques have
focused on linking explicitly mentioned entities in tweets with reasonable
success. However, we argue that in addition to explicit mentions i.e. The movie
Gravity was more ex- pensive than the mars orbiter mission entities (movie
Gravity) can also be mentioned implicitly i.e. This new space movie is crazy.
you must watch it!. This paper introduces the problem of implicit entity
linking in tweets. We propose an approach that models the entities by
exploiting their factual and contextual knowledge. We demonstrate how to use
these models to perform implicit entity linking on a ground truth dataset with
397 tweets from two domains, namely, Movie and Book. Specifically, we show: 1)
the importance of linking implicit entities and its value addition to the
standard entity linking task, and 2) the importance of exploiting contextual
knowledge associated with an entity for linking their implicit mentions. We
also make the ground truth dataset publicly available to foster the research in
this new research area.Comment: This paper was accepted at the Extended Semantic Web Conference 2016
  as a full research track pape
Affine computation and affine automaton

We introduce a quantum-like classical computational model, called affine
computation, as a generalization of probabilistic computation. After giving the
basics of affine computation, we define affine finite automata (AfA) and
compare it with quantum and probabilistic finite automata (QFA and PFA,
respectively) with respect to three basic language recognition modes. We show
that, in the cases of bounded and unbounded error, AfAs are more powerful than
QFAs and PFAs, and, in the case of nondeterministic computation, AfAs are more
powerful than PFAs but equivalent to QFAs.Comment: 23 pages. New results were added. Accepted to CSR2016
Graph editing to a given degree sequence.

We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence where the aim is to obtain a graph with a given degree sequence σσ by at most k vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time 2O(k(Δ+k)2)n2logn2O(k(Δ+k)2)n2log⁡n for n-vertex graphs, where Δ=maxσΔ=maxσ, i.e., the problem is FPT when parameterized by k+Δk+Δ. We also show that Editing to a Graph with a Given Degree Sequence has a polynomial kernel when parameterized by k+Δk+Δ if only edge additions are allowed, and there is no polynomial kernel unless NP⊆coNP/polyNP⊆coNP/poly for all other combinations of allowed editing operations
Level two of the quantifier alternation hierarchy over infinite words

This is a pre-copyedited version of a contribution published in Computer Science Theory and Applications: 11th International Computer Science Symposium in Russia (CSR 2016) edited by Kulikov, A.S. and Woeginger, G.J. published by Springer International. The definitive authenticated version is available online via https://doi.org/10.1007/978-3-319-34171-2_17© Springer International Publishing Switzerland 2016. The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given language whether it is definable in some fixed fragment. The alphabetic topology was introduced as part of an effective characterization of the fragment Σ 2 over infinite words. Here, Σ 2 consists of the first-order formulas with two blocks of quantifiers, starting with an existential quantifier. Its Boolean closure is ð     ¹Σ 2 . Our first main result is an effective characterization of the Boolean closure of the alphabetic topology, that is, given an ω-regular language L, it is decidable whether L is a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun’s recent decidability result for ð     ¹Σ 2 from finite to infinite words
Subquadratic Algorithms for Succinct Stable Matching

We consider the stable matching problem when the preference lists are not
given explicitly but are represented in a succinct way and ask whether the
problem becomes computationally easier and investigate other implications. We
give subquadratic algorithms for finding a stable matching in special cases of
natural succinct representations of the problem, the $d$-attribute, $d$-list,
geometric, and single-peaked models. We also present algorithms for verifying a
stable matching in the same models. We further show that for $d = \omega(\log
n)$ both finding and verifying a stable matching in the $d$-attribute and
$d$-dimensional geometric models requires quadratic time assuming the Strong
Exponential Time Hypothesis. This suggests that these succinct models are not
significantly simpler computationally than the general case for sufficiently
large $d$
Algorithmic decidability of Engel's property for automaton groups

We consider decidability problems associated with Engel's identity
($[\cdots[[x,y],y],\dots,y]=1$ for a long enough commutator sequence) in groups
generated by an automaton. We give a partial algorithm that decides, given
$x,y$, whether an Engel identity is satisfied. It succeeds, importantly, in
proving that Grigorchuk's $2$-group is not Engel. We consider next the problem
of recognizing Engel elements, namely elements $y$ such that the map
$x\mapsto[x,y]$ attracts to $\{1\}$. Although this problem seems intractable in
general, we prove that it is decidable for Grigorchuk's group: Engel elements
are precisely those of order at most $2$. Our computations were implemented
using the package FR within the computer algebra system GAP
A Model Repository Description Language - MRDL

Repository-based development of software systems has gained more attention recently by addressing new challenges such as security and dependability. However, there are still gaps in existing modeling languages and/or formalisms dedicated to define model repositories and the way how to reuse them in the automation of software development. Thus, there is a strong requirement for defining a model repository description language not only as a modeling approach, but also as a suitable instrument to support system and software engineers in the activity of search and retrieval of appropriate models beyond keyword-based search. Moreover, modeling approaches allow using tools for the specification and the exploitation of the designed artifacts (e.g. analysis and evaluation). The goal of this paper is to advance the state of the art in model repository description for software and systems engineering. In particular, we have designed a flexible and extensible modeling language, by means of an OMG style metamodel, to specify model repositories for modeling artifacts, and we have defined an operational architecture for development tools. In particular, we show the feasibility of our own approach by reporting some preliminary prototype providing a model-based repository of security and dependability (S&D) pattern models
Puzzle: A Tool for Analyzing and Extracting Specification Clones in DSLs

The use of domain-specific languages (DSLs) is a successful
technique in the development of complex systems. Indeed, the construction
of new DSLs addressing the particular needs of software projects has
become a recurrent activity. In this context, the phenomenon of specification
cloning has started to appear. Language designers often copy&paste
some parts of the specification from legacy DSLs to “reuse” formerly
defined language constructs. As well known, this type of practices introduce
problems such as bugs propagation, thus increasing of maintenance
costs. In this paper, we present Puzzle, a tool that uses static analysis
to facilitate the detection of specification clones in DSLs implemented
under the executable metamodeling paradigm. Puzzle also enables the
extraction specification clones as reusable language modules that can be
later used to build up new DSLs
Carrying Ideas from Knowledge-Based Configuration to Software Product Lines

Software variability modelling (SVM) has become a central concern in software product lines -- especially configurable software product lines (CSPL) require rigorous SVM. Dynamic SPLs, service oriented SPLs, and autonomous or pervasive systems are examples where CSPLs are applied. Knowledge-based configuration (KBC) is an established way to address variability modelling aiming for the automatic product configuration of physical products. Our aim was to study what major ideas from KBC can be applied to SVM, particularly in the context of CSPLs. Our main contribution is the identification of major ideas from KBC that could be applied to SVM. First, we call for the separation of types and instances. Second, conceptual clarity of modelling concepts, e.g., having both taxonomical and compositional relations would be useful. Third, we argue for the importance of a conceptual basis that provides a foundation for multiple representations, e.g., graphical and textual. Applying the insights and experiences embedded in these ideas may help in the development of modelling support for software product lines, particularly in terms of conceptual clarity and as a basis for tool support with a high level of automation
Occurrence and Functions of PACAP in the Placenta

Pituitary adenylate cyclase activating polypeptide (PACAP) is an endogenous neuropeptide with a widespread distribution both in the nervous system and peripheral organs. The peptide is also present in the female gonadal\ud
system, indicating its role in reproductive functions. While a lot of data are known on PACAP-induced effects in oogenesis and in the regulation of gonadotropin secretion at pituitary level, its placental effects are somewhat\ud
neglected in spite of the documented implantation deficit in mice lacking endogenous PACAP. The aim of the present review is to give a brief summary on the occurrence and actions of PACAP and its receptors in the placenta.\ud
Radioimmunoassay (RIA) measurements revealed increased serum PACAP levels during the third trimester and several changes in placental PACAP content in obstetrical pathological conditions, further supporting the function\ud
of PACAP during pregnancy. Both the peptide and its receptors have been shown in different parts of the\ud
placenta and the umbilical cord. PACAP influences blood vessel and smooth muscle contractility of the uteroplacental unit and is involved in regulation of local hormone secretion. The effects of PACAP on trophoblast cells have been mainly studied in vitro. Effects of PACAP on cell survival, angiogenesis\ud
and invasion/proliferation have been described in different trophoblast cell lines. PACAP increases proliferation and decreases invasion in proliferative\ud
extravillous trophoblast cells, but not in primary trophoblast cells, where PACAP decreased the secretion of various angiogenic markers. PACAP pretreatment enhances survival of non-tumorous primary trophoblast cells exposed to oxidative stress, but it does not influence the cell death-inducing effects of methotrexate in proliferative extravillous cytotrophoblast cells. Interestingly, PACAP has pro-apoptotic effect in choriocarcinoma cells suggesting that the effect of PACAP depends on the type of trophoblast cells. These data strongly support that PACAP plays a role in normal and pathological pregnancies and our review provides an overview of currently available experimental data worth to be further investigated to elucidate the exact role of this peptide in the placenta
A nation of tribes and priests : the Jews and the immorality of the caste system

In the currently dominant discourse about Indian society, the caste system appears as an immoral social structure: its principles represent immoral behaviour as moral obligation. The chapter raises the question as to how this inherently implausible conception of the caste system crystallised in the European understanding of India. It argues that the Old Testament account of the Jewish nation and religion became the framework for describing the people and religion of 'the Gentiles' or 'Hindus' in India. The Hindus were viewed as a nation divided into a hierarchy of tribes and united by one religion led by the tribe of the priesthood. In the course of the nineteenth century, Protestant authors then came to the conclusion that caste was a religious institution: dominated by Brahmin priests, this institution imposed the civil laws of a nation as religious obligations of divine origin. If we were to discard the overtly biblical elements from the nineteenth-century missionary descriptions of Hinduism and caste, it would become difficult to distinguish them from the contemporary moral discourse
Selectoscope: A Modern Web-App for Positive Selection Analysis of Genomic Data

Selectoscope is a web application which combines a number of popular tools used to infer positive selection in an easy to use pipeline. A set of homologous DNA sequences to be analyzed and evaluated are submitted to the server by uploading protein-coding gene sequences in the FASTA format. The sequences are aligned and a phylogenetic tree is constructed. The codeml procedure from the PAML package is used first to adjust branch lengths and to find a starting point for the likelihood maximization, then FastCodeML is executed. Upon completion, branches and positions under positive selection are visualized simultaneously on the tree and alignment viewers. Run logs are accessible through the web interface. Selectoscope is based on the Docker virtualization technology. This makes the application easy to install with a negligible performance overhead. The application is highly scalable and can be used on a single PC or on a large high performance clusters. The source code is freely available at https://github.com/anzaika/selectoscope
When a FILTER makes the difference in continuously answering SPARQL queries on streaming and quasi-static linked data

We are witnessing a growing interest for Web applications that (i) require to continuously combine highly dynamic data stream with background data and (ii) have reactivity as key performance indicator. The Semantic Web community showed that RDF Stream Processing (RSP) is an adequate framework to develop this type of applications. However, when the background data is distributed over theWeb, even RSP engines risk losing reactiveness due to the time necessary to access the background data. State-of-the-art RSP engines remain reactive using a local replica of the background data, but such a replica progressively become stale if not updated to reflect the changes in the remote background data. For this reason, recently, the RSP community investigated maintenance policies (collectively named Acqua) that guarantee reactiveness while maximizing the freshness of the replica. Acquaâ\u80\u99s policies apply to queries that join a basic graph pattern in a window clause with another basic graph pattern in a service clause. In this paper, we extend the class of queries considered in Acqua adding a FILTER clause that selects mapping in the background data. We propose a new maintenance policy (namely, the Filter Update Policy) and we show how to combine it with Acqua policies. A set of experimental evaluations empirically proves the ability of the proposed policies to guarantee reactiveness while keeping the replica fresher than with the Acqua policies
REST APIs: A large-scale analysis of compliance with principles and best practices

Quickly and dominantly, REST APIs have spread over the Web and percolated into modern software development practice, especially in the Mobile Internet where they conveniently enable offloading data and computations onto cloud services. We analyze more than 78GB of HTTP traffic collected by Italy’s biggest Mobile Internet provider over one full day and study how big the trend is in practice, how it changed the traffic that is generated by applications, and how REST APIs are implemented in practice. The analysis provides insight into the compliance of state-of-the-art APIs with theoretical Web engineering principles and guidelines, knowledge that affects how applications should be developed to be scalable and robust. The perspective is that of the Mobile Internet
SnowWatch: A multi-modal citizen science application

The demo presents Snow Watch, a citizen science system that supports the acquisition and processing of mountain images for the purpose of extracting snow information, predicting the amount of water available in the dry season, and supporting a multi-objective lake regulation problem. We discuss how the proposed architecture has been rapidly prototyped using a general-purpose architecture to collect sensor and user-generated Web content from heterogeneous sources, process it for knowledge extraction, relying on the contribution of voluntary crowds, engaged and retained with gamification techniques
Abstracting and Structuring Web Contents for Supporting Personal Web Experiences

This paper presents a novel approach for supporting abstraction and structuring mechanisms of Web contents. The goal of this approach is to enable users to create/extract Web contents in the form of objects that they can manipulate to create Personal Web experiences. We present an architecture that not only allows the user interaction with individual objects but also supports the integration of many objects found in diverse Web sites. We claim that once Web contents have been organized as objects it is possible to create many types of Personal Web interactions. The approach involves end-users and developers and it is fully supported by dedicated tools. We show how end-users can use our tools to identify contents and transform them into objects stored in our platform. We show how developers can use of objects to create Personal Web applications
Robustness of the Parsimonious Reconciliation Method in Cophylogeny

International audienceThe aim of this paper is to explore the robustness of the parsimonious host-symbiont tree reconciliation method under editing or small perturbations of the input. The editing involves making different choices of unique symbiont mapping to a host in the case where multiple associations exist. This is made necessary by the fact that no tree reconciliation method is currently able to handle such associations. The analysis performed could however also address the problem of errors. The perturbations are re-rootings of the symbiont tree to deal with a possibly wrong placement of the root specially in the case of fast-evolving species. In order to do this robustness analysis, we introduce a simulation scheme specifically designed for the host-symbiont cophylogeny context, as well as a measure to compare sets of tree reconciliations, both of which are of interest by themselves
Counting, generating and sampling tree alignments

International audiencePairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical sets of matches between identical pairs of trees. This ambiguity is uninformative, and detrimental to any probabilistic analysis.In this work, we consider tree alignments up to equivalence. Our first result is a precise asymptotic  enumeration of tree alignments, obtained from a context-free grammar by mean of basic analytic combinatorics. Our second result focuses on alignments between two given ordered trees $S$ and $T$. By refining our grammar to align specific trees, we obtain a decomposition scheme for the  space of alignments,  and use it to design an efficient dynamic programming algorithm for sampling alignments under the  Gibbs-Boltzmann probability distribution. This generalizes existing tree alignment algorithms, and opens the door for a probabilistic analysis of the space of suboptimal RNA secondary structures alignments