pinecone/core-2020-05-10-deduplication huggingface dataset:
Faster Approximation Schemes and Parameterized Algorithms on
  H-Minor-Free and Odd-Minor-Free Graphs

We improve the running time of the general algorithmic technique known as
Baker's approach (1994) on H-minor-free graphs from O(n^{f(|H|)}) to O(f(|H|)
n^{O(1)}). The numerous applications include e.g. a 2-approximation for
coloring and PTASes for various problems such as dominating set and max-cut,
where we obtain similar improvements.
  On classes of odd-minor-free graphs, which have gained significant attention
in recent time, we obtain a similar acceleration for a variant of the
structural decomposition theorem proved by Demaine et al. (2010). We use these
algorithms to derive faster 2-approximations; furthermore, we present the first
PTASes and subexponential FPT-algorithms for independent set and vertex cover
on these graph classes using a novel dynamic programming technique.
  We also introduce a technique to derive (nearly) subexponential parameterized
algorithms on H-minor-free graphs. Our technique applies, in particular, to
problems such as Steiner tree, (directed) subgraph with a property, (directed)
longest path, and (connected/independent) dominating set, on some or all proper
minor-closed graph classes. We obtain as a corollary that all problems with a
minor-monotone subexponential kernel and amenable to our technique can be
solved in subexponential FPT-time on H-minor free graphs. This results in a
general methodology for subexponential parameterized algorithms outside the
framework of bidimensionality
Counting dependent and independent strings

The paper gives estimations for the sizes of the the following sets: (1) the
set of strings that have a given dependency with a fixed string, (2) the set of
strings that are pairwise \alpha independent, (3) the set of strings that are
mutually \alpha independent. The relevant definitions are as follows: C(x) is
the Kolmogorov complexity of the string x. A string y has \alpha -dependency
with a string x if C(y) - C(y|x) \geq \alpha. A set of strings {x_1, \ldots,
x_t} is pairwise \alpha-independent if for all i different from j, C(x_i) -
C(x_i | x_j) \leq \alpha. A tuple of strings (x_1, \ldots, x_t) is mutually
\alpha-independent if C(x_{\pi(1)} \ldots x_{\pi(t)}) \geq C(x_1) + \ldots +
C(x_t) - \alpha, for every permutation \pi of [t]
Impossibility of independence amplification in Kolmogorov complexity
  theory

The paper studies randomness extraction from sources with bounded
independence and the issue of independence amplification of sources, using the
framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is
${\rm dep}(x,y) = \max\{C(x) - C(x \mid y), C(y) - C(y\mid x)\}$, where
$C(\cdot)$ denotes the Kolmogorov complexity. It is shown that there exists a
computable Kolmogorov extractor $f$ such that, for any two $n$-bit strings with
complexity $s(n)$ and dependency $\alpha(n)$, it outputs a string of length
$s(n)$ with complexity $s(n)- \alpha(n)$ conditioned by any one of the input
strings. It is proven that the above are the optimal parameters a Kolmogorov
extractor can achieve. It is shown that independence amplification cannot be
effectively realized. Specifically, if (after excluding a trivial case) there
exist computable functions $f_1$ and $f_2$ such that ${\rm dep}(f_1(x,y),
f_2(x,y)) \leq \beta(n)$ for all $n$-bit strings $x$ and $y$ with ${\rm
dep}(x,y) \leq \alpha(n)$, then $\beta(n) \geq \alpha(n) - O(\log n)$
Genres of participation in social networking systems: A study of the 2009 Norwegian parliamentary election

Published version of a chapter in the book: Electronic Participation. Also available at http://dx.doi.org/10.1007/978-3-642-15158-3_9In the Norwegian context, eParticipation in the form of online campaigning has been on the agenda since 2001. After Obama’s successful presidential campaign in 2008, expectations about the use of SNS in the Norwegian parliamentary election were high. This study explores genres of participation in the early stages of the 2009 Norwegian parliamentary election campaign. The main finding is that the political parties have seen the need for a presence in SNS’, and that a genre repertoire for political communication through SNS is beginning to evolve. However, there is little agreement between citizens and politicians about how the different genres should be enacted. Further work with genres is presented as a possible solution to lessening this communication gap
On the influence of sensor morphology on vergence

In the field of developmental robotics, a lot of attention has been devoted to algorithms that allow agents to build up skills through sensorimotor interaction. Such interaction is largely affected by the agent's morphology, that is, its shape, limb articulation, as well as the position and density of sensors on its body surface. Despite its importance, the impact of morphology on behavior has not been systematically addressed. In this paper, we take inspiration from the human vision system, and demonstrate using a binocular active vision platform why sensor morphology in combination with other properties of the body, are essential conditions to achieve coordinated visual behavior (here, vergence). Specifically, to evaluate the effect of sensor morphology on behavior, we present an information-theoretic analysis quantifying the statistical regularities induced through sensorimotor interaction. Our results show that only for an adequate sensor morphology, vergence increases the amount of information structure in the sensorimotor loop
Classical and Intuitionistic Subexponential Logics are Equally Expressive

International audienceIt is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the other direction has no truth-preserving propositional encodings. We show here that subexponential logic, which is a family of substructural refinements of classical logic, each parametric over a preorder over the subexponential connectives, does not suffer from this asymmetry if the preorder is systematically modified as part of the encoding. Precisely, we show a bijection between synthetic (i.e., focused) partial sequent derivations modulo a given encoding. Particular instances of our encoding for particular subexponential preorders give rise to both known and novel adequacy theorems for substructural logics
A logic of sequentiality

Game semantics has been used to interpret both proofs and functional programs: an important further development on the programming side has been to model higher-order programs with state by allowing strategies with ``history-sensitive'' behaviour. In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs in a new kind of affine logic. We describe the semantics of our logic formally by giving a notion of categorical model and an instance based on a simple category of games. Using further categorical properties of this model, we prove a full completeness result: each total strategy is the semantics of a unique cut-free \emph{core} proof in the system. We then use this result to derive an explicit cut-elimination procedure
Towards a canonical classical natural deduction system

This paper studies a new classical natural deduction system, presented as a typed calculus named $\lml$. It is designed to be
isomorphic to Curien-Herbelin's calculus, both at the level of proofs and reduction, and the isomorphism is based on the correct correspondence between cut (resp. left-introduction) in sequent calculus, and substitution (resp. elimination) in natural deduction. It is a combination of Parigot's $\lambda\mu$-calculus with the idea
of ``coercion calculus'' due to Cervesato-Pfenning, accommodating let-expressions in a surprising way: they expand Parigot's syntactic class of named terms.

This calculus aims to be the simultaneous answer to three problems. The first problem is the lack of a canonical natural deduction
system for classical logic. $\lml$ is not yet another classical calculus, but rather a canonical reflection in natural deduction of
the impeccable treatment of classical logic by sequent calculus. The second problem is the lack of a formalization of the usual semantics
of Curien-Herbelin's calculus, that explains co-terms and cuts as, respectively, contexts and hole-filling instructions. The mentioned
isomorphism is the required formalization, based on the precise notions of context and hole-expression offered by $\lml$. The third
problem is the lack of a robust process of ``read-back'' into natural deduction syntax of calculi in the sequent calculus format,
that affects mainly the recent proof-theoretic efforts of derivation of  $\lambda$-calculi for call-by-value. An isomorphic counterpart
to the $Q$-subsystem of Curien-Herbelin's-calculus is derived, obtaining a new
$\lambda$-calculus for call-by-value, combining control and let-expressions.Fundação para a Ciência e a Tecnologia (FCT
Fibrational induction rules for initial algebras

This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our results are semantic in nature and are inspired by Hermida and Jacobs’ elegant algebraic formulation of induction for polynomial data types. Our contribution is to derive, under slightly different assumptions, an induction rule that is generic over all inductive types, polynomial or not. Our induction rule is generic over the kinds of properties to be proved as well: like Hermida and Jacobs, we work in a general fibrational setting and so can accommodate very general notions of properties on inductive types rather than just those of particular syntactic forms. We establish the correctness of our generic induction rule by reducing induction to iteration. We show how our rule can be instantiated to give induction rules for the data types of rose trees, finite hereditary sets, and hyperfunctions. The former lies outside the scope of Hermida and Jacobs’ work because it is not polynomial; as far as we are aware, no induction rules have been known to exist for the latter two in a general fibrational framework. Our instantiation for hyperfunctions underscores the value of working in the general fibrational setting since this data type cannot be interpreted as a set
The isomorphism problem for ω-automatic trees

The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height is at least as hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalbán, and Nies [9] showing that the isomorphism problem for ω-automatic structures is not ∑_2^1. Moreover, assuming the continuum hypothesis CH, we can show that the isomorphism problem for ω-automatic trees of finite height is recursively equivalent with second-order arithmetic. On the way to our main results, we show lower and upper bounds for the isomorphism problem for ω-automatic trees of every finite height: (i) It is decidable (∏_1^0-complete, resp.) for height 1 (2, resp.), (ii) (∏_1^1-hard and in (∏_2^1 for height 3, and (iii) (∏_(n-3)^1- and (∏_(n-3)^1-hard and in (∏_(2n-4)^1(assuming CH) for all n ≥ 4. All proofs are elementary and do not rely on theorems from set theory. Complete proofs can be found in [18]
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

International audienceWe prove ''untyping'' theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to the typed settings. Some of these theorems are obtained via a detour through fragments of cyclic linear logic, and give rise to a substantial optimisation of standard proof search algorithms
Convergence of multi-dimensional quantized $SDE$'s

43 pagesInternational audienceWe quantize a multidimensional $SDE$ (in the Stratonovich sense) by solving the related system of $ODE$'s in which the $d$-dimensional Brownian motion has been replaced by the components of functional stationary quantizers. We make a connection with rough path theory to show that the solutions of the quantized solutions of the $ODE$ converge toward the solution of the $SDE$. On our way to this result we provide convergence rates of optimal quantizations toward the Brownian motion for $\frac 1q$-H\" older distance, $q>2$, in $L^p(\P)$
Discrete approximation of the free Fock space

International audienceWe prove that the free Fock space ${\F}(\R^+;\C)$, which is very commonly used in Free Probability Theory, is the continuous free product of copies of the space $\C^2$. We describe an explicit embeding and approximation of this continuous free product structure by means of a discrete-time approximation: the free toy Fock space, a countable free product of copies of $\C^2$. We show that the basic creation, annihilation and gauge operators of the free Fock space are also limit of elementary operators on the free toy Fock space. When applying these constructions and results to the probabilistic interpretations of these spaces, we recover some discrete approximations of the semi-circular Brownian motion and of the free Poisson process. All these results are also extended to the higher multiplicity case, that is, ${\F}(\R^+;\C^N)$ is the continuous free product of copies of the space $\C^{N+1}$
The symbolic model for algebra: functions and mechanisms

The symbolic mode of reasoning in algebra, as it emerged during the sixteenth century, can be considered as a form of model-based reasoning. In this paper we will discuss the functions and mechanisms of this model and show how the model relates to its arithmetical basis. We will argue that the symbolic model was made possible by the epistemic justification of the basic operations of algebra as practiced within the abbaco tradition. We will also show that this form of model-based reasoning facilitated the expansion of the number concept from Renaissance interpretations of number to the full notion of algebraic numbers
Theoretical model of user acceptance : in the view of measuring success in web personalization

This paper attempts to develop a theoretical acceptance model for measuring Web personalization success. Key factors impacting Web personalization acceptance are identified from a detailed literature review. The final model is then cast in a structural equation modeling (SEM) framework comprising nineteen manifest variables, which are grouped into three focal behaviors of Web users. These variables could provide a framework for better understanding of numerous factors that contribute to the success measures of Web personalization technology. Especially, those concerning the quality of personalized features and how personalized information through personalized Website can be delivered to the user. The interrelationship between success constructs is also explained. Empirical validations of this theoretical model are expected on future research
Robust Partitioned Scheduling for Real-Time Multiprocessor Systems

International audienceIn this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors. We propose a partitioning heuristic that takes into account possible Worst Case Execution Time (WCET) overruns. Our goal is to maximize the duration a task can be allowed to exceed its WCET without compromising the timeliness constraints of all the tasks. This duration is denoted in the paper the allowance of the task and is computed with a sensitivity analysis. The partitioning heuristic we propose, assigns the tasks to the processors in order (i) to maximize the allowance of the tasks and (ii) to tolerate bounded execution duration overruns. Property (ii) is important as real-time applications are often prone to be subject to OS approximations or software faults that might result in execution duration overruns. We show with performance evaluations that Allowance-Fit-Decreasing partitioning improves the temporal robustness of real-time systems w.r.t. classical {First-Fit/Best-Fit/Next-Fit}-Decreasing partitioning
Flexible and dynamic replication control for interdependent distributed real-time embedded systems

Replication is a proven concept for increasing the availability of distributed
systems. However, actively replicating every software component in distributed
embedded systems may not be a feasible approach. Not only the available
resources are often limited, but also the imposed overhead could significantly degrade
the system’s performance.
This paper proposes heuristics to dynamically determine which components to
replicate based on their significance to the system as a whole, its consequent
number of passive replicas, and where to place those replicas in the network. The
activation of passive replicas is coordinated through a fast convergence protocol
that reduces the complexity of the needed interactions among nodes until a new
collective global service solution is determined
Slicing Behavior Tree Models for Verification

Program slicing is a reduction technique that removes irrelevant parts of a program automatically, based on dependencies. It is used in the context of documentation to improve the user's understanding as well as for reducing the size of a program when analysing. In this paper we describe an approach for slicing not program code but models of software or systems written in the graphical Behavior Tree language. Our focus is to utilise this reduction technique when model checking Behavior Tree models. Model checking as a fully automated analysis technique is restricted in the size of the model and slicing provides one means to improve on the inherent limitations. We present a Health Information System as a case study. The full model of the system could not be verified due to memory limits. However, our slicing algorithm renders the model to a size for which the model checker terminates. The results nicely demonstrate and quantify the benefits of our approach.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Polarized Resolution Modulo

International audienceWe present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into clause form. Restricting Resolution modulo in this way requires to extend it in another and distinguish the rules that apply to negative and positive atomic propositions. This method can be seen as a restriction of Equational resolution that mixes clause selection and literal selection restrictions. Unlike many restrictions of Resolution, it is not an instance of Ordered resolution
Safe Equivalences for Security Properties

International audienceIn the ﬁeld of Security, process equivalences have been used to char- acterize various information-hiding properties (for instance secrecy, anonymity and non-interference) based on the principle that a protocol P with a variable x satisﬁes such property if and only if, for every pair of secrets s1 and s2 , P [s1 /x ] is equivalent to P [s2 /x ]. We argue that, in the presence of nondeterminism, the above principle relies on the assumption that the scheduler “works for the beneﬁt of the protocol”, and this is usually not a safe assumption. Non-safe equivalences, in this sense, include trace equivalence and bisimulation. We present a formalism in which we can specify admissible schedulers and, correspondingly, safe ver- sions of these equivalences. We then show safe bisimulation is still a congruence. We conclude showing how to use safe equivalences to characterize information- hiding properties
Learning Automaton Based On-Line Discovery and Tracking of Spatio-temporal Event Patterns

Published version of an article from the book: Lecture Notes in Computer Science, 2010, Volume 6230/2010, 327-338. The original publication is available at Springerlink. http://dx.doi.org/10.1007/978-3-642-15246-7_31Discovering and tracking of spatio-temporal patterns in noisy sequences of events is a difficult task that has become increasingly pertinent due to recent advances in ubiquitous computing, such as community-based social networking applications. The core activities for applications of this class include the sharing and notification of events, and the importance and usefulness of these functionalites increases as event-sharing expands into larger areas of one’s life. Ironically, instead of being helpful, an excessive number of event notifications can quickly render the functionality of event-sharing to be obtrusive. Rather, any notification of events that provides redundant information to the application/user can be seen to be an unnecessary distraction. In this paper, we introduce a new scheme for discovering and tracking noisy spatio-temporal event patterns, with the purpose of suppressing reoccurring patterns, while discerning novel events. Our scheme is based on maintaining a collection of hypotheses, each one conjecturing a specific spatio-temporal event pattern. A dedicated Learning Automaton (LA) – the Spatio-Temporal Pattern LA (STPLA) – is associated with each hypothesis. By processing events as they unfold, we attempt to infer the correctness of each hypothesis through a real-time guided random walk. Consequently, the scheme we present is computationally efficient, with a minimal memory footprint. Furthermore, it is ergodic, allowing adaptation. Empirical results involving extensive simulations demonstrate the STPLA’s superior convergence and adaptation speed, as well as an ability to operate successfully with noise, including both the erroneous inclusion and omission of events. Additionally, the results included, which involve a so-called “Presence Sharing” application, are both promising and in our opinion, impressive. It is thus our opinion that the proposed STPLA scheme is, in general, ideal for improving the usefulness of event notification and sharing systems, since it is capable of significantly, robustly and adaptively suppressing redundant information
An agent model for business relationships

Relationships are fundamental to all but the most impersonal forms of interaction in business. An agent aims to secure projected needs by attempting to build a set of (business) relationships with other agents. A relationship is built by exchanging private information, and is characterised by its intimacy — degree of closeness — and balance — degree of fairness. Each argumentative interaction between two agents then has two goals: to satisfy some immediate need, and to do so in a way that develops the relationship in a desired direction. An agent’s desire to develop each relationship in a particular way then places constraints on the argumentative utterances. This paper describes argumentative interaction constrained by a desire to develop such relationships.Peer Reviewe
Fraud detection in ERP systems using scenario matching

ERP systems generally implement controls to prevent certain common kinds of fraud.  In addition however, there is an imperative need for detection of more sophisticated patterns of fraudulent activity as evidenced by the legal requirement for company audits and the common incidence of fraud.  This paper describes the design and implementation of a framework for detecting patterns of fraudulent activity in ERP systems. We include the description of six fraud scenarios and the process of specifying and detecting the occurrence of those scenarios in ERP user log data using the prototype software which we have developed. The test results for detecting these scenarios in log data have been verified and confirm the success of our approach which can be generalized to ERP systems in general