pinecone/core-2020-05-10-deduplication huggingface dataset:
On the recognition of four-directional orthogonal ray graphs.

Orthogonal ray graphs are the intersection graphs of horizontal and vertical rays (i.e. half-lines) in the plane. If the rays can have any possible orientation (left/right/up/down) then the graph is a 4-directional orthogonal ray graph (4-DORG). Otherwise, if all rays are only pointing into the positive x and y directions, the intersection graph is a 2-DORG. Similarly, for 3-DORGs, the horizontal rays can have any direction but the vertical ones can only have the positive direction. The recognition problem of 2-DORGs, which are a nice subclass of bipartite comparability graphs, is known to be polynomial, while the recognition problems for 3-DORGs and 4-DORGs are open. Recently it has been shown that the recognition of unit grid intersection graphs, a superclass of 4-DORGs, is NP-complete. In this paper we prove that the recognition problem of 4-DORGs is polynomial, given a partition {L,R,U,D} of the vertices of G (which corresponds to the four possible ray directions). For the proof, given the graph G, we first construct two cliques G 1,G 2 with both directed and undirected edges. Then we successively augment these two graphs, constructing eventually a graph TeX with both directed and undirected edges, such that G has a 4-DORG representation if and only if TeX has a transitive orientation respecting its directed edges. As a crucial tool for our analysis we introduce the notion of an S-orientation of a graph, which extends the notion of a transitive orientation. We expect that our proof ideas will be useful also in other situations. Using an independent approach we show that, given a permutation π of the vertices of U (π is the order of y-coordinates of ray endpoints for U), while the partition {L,R} of V ∖ U is not given, we can still efficiently check whether G has a 3-DORG representation
A polychromatic Ramsey theory for ordinals

The Ramsey degree of an ordinal α is the least number n such that any colouring of the edges of the complete graph on α using finitely many colours contains an n-chromatic clique of order type α. The Ramsey degree exists for any ordinal α < ω ω . We provide an explicit expression for computing the Ramsey degree given α. We further establish a version of this result for automatic structures. In this version the ordinal and the colouring are presentable by finite automata and the clique is additionally required to be regular. The corresponding automatic Ramsey degree turns out to be greater than the set theoretic Ramsey degree. Finally, we demonstrate that a version for computable structures fails
Adaptive and context-aware service discovery for the Internet of Things

This article was published in Lecture Notes in Computer Science [© Springer Verlag] and the definitive version is available at: http://dx.doi.org/10.1007/978-3-642-40316-3_4The Internet of Things (IoT) vision foresees a future Internet encompassing the realm of smart physical objects, which offer hosted functionality as services. The role of service discovery is crucial when providing application-level, end-to-end integration. In this paper, we propose trendy: a RESTful web services based Service Discovery protocol to tackle the challenges posed by constrained domains while offering the required interoperability. It provides a service selection technique to offer the appropriate service to the user application depending on the available context information of user and services. Furthermore, it employs a demand-based adaptive timer and caching mechanism to reduce the communication overhead and to decrease the service invocation delay. trendy’s grouping technique creates location-based teams of nodes to offer service composition. Our simulation results show that the employed techniques reduce the control packet overhead, service invocation delay and energy consumption. In addition, the grouping technique provides the foundation for group-based service mash-ups and localises control traffic to improve scalability
A Framework for Interacting Smart Objects

International audienceIn this paper, we propose a framework enabling physical objects used everyday to participate in smart interactions. These objects are RFID tagged containing self description of their properties. The paper describes how smart context aware services can be supported directly by a collection of smart objects. One of the main advantage of our approach is the smart objects being piggybacked with necessary information, optimized enough to make inferences locally, without dependence on external system support
Objectively evaluating interestingness measures for frequent itemset mining

Itemset mining approaches, while having been studied for more than 15 years, have been evaluated only on a handful of data sets. In particular, they have never been evaluated on data sets for which the ground truth was known. As a result of this, it is currently unknown whether itemset mining techniques actually recover underlying patterns. Since the weakness of the algorithmically attractive support/confidence framework became apparent early on, a number of interestingness mea- sures have been proposed. Their utility, however has not been evaluated, except for attempts to establish congruence with expert opinions. Using an extension of the Quest generator proposed in the original itemset min- ing paper, we propose to evaluate these measure objectively for the first time, showing how many non-relevant patterns slip through the cracks.status: publishe
A New Feature Selection and Feature Contrasting Approach Based on Quality Metric: Application to Efficient Classification of Complex Textual Data

International audience ; Feature maximization is a cluster quality metric which favors clusters with maximum feature representation as regard to their associated data. This metric has already been successfully exploited, altogether, for defining unbiased clustering quality indexes, for efficient cluster labeling, as well as for substituting to distance in the clustering process, like in the IGNGF incremental clustering method. In this paper we go one step further showing that a straightforward adaptation of such metric can provide a highly efficient feature selection and feature contrasting model in the context of supervised classification. We more especially show that this technique can enhance the performance of classification methods whilst very significantly outperforming (+80%) the state-of-the art variable selection techniques in the case of the classification of unbalanced, highly multidimensional and noisy textual data, with a high degree of similarity between the classes. Our experimental dataset is a reference dataset of 7000 publications related to patents classes issued from a reference classification in the domain of pharmacology
Local Reconstructors and Tolerant Testers for Connectivity and Diameter

A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is “close” to having the property, provides oracle access to the adjacency matrix of a “correction” of the graph, i.e. a graph which has the property and is close to the given graph. For this model, we achieve local property reconstructors for the properties of connectivity and k-connectivity in undirected graphs, and the property of strong connectivity in directed graphs. Along the way, we present a method of transforming a local reconstructor (which acts as a “adjacency matrix oracle” for the corrected graph) into an “adjacency list oracle”. This allows us to recursively use our local reconstructor for (k − 1)-connectivity to obtain a local reconstructor for k-connectivity.
We also extend this notion of local reconstruction to parametrized graph properties (for instance, having diameter at most D for some parameter D) and require that the corrected graph has the property with parameter close to the original. We obtain a local reconstructor for the low diameter property, where if the original graph is close to having diameter D, then the corrected graph has diameter roughly 2D.
We also exploit a connection between local property reconstruction and property testing, observed by Brakerski, to obtain new tolerant property testers for all of the aforementioned properties. Except for the one for connectivity, these are the first tolerant property testers for these properties.National Science Foundation (U.S.) (Grant CCF-0829672)National Science Foundation (U.S.) (Grant CCF-1065125)National Science Foundation (U.S.) (Grant CCF-6922462)National Science Foundation (U.S.) (NSF-STC Award 0939370)National Science Foundation (U.S.). Graduate Research Fellowshi
Pseudorandomness for Regular Branching Programs via Fourier Analysis

We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is \(O(log^2 n)\), where n is the length of the branching program. The previous best seed length known for this model was \(n^{ 1/2 + o(1)}\), which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 2012) (which gives a seed length of \(s^{ 1/2 + o(1)}\) for arbitrary branching programs of size s). Our techniques also give seed length \(n^{ 1/2 + o(1)}\) for general oblivious, read-once branching programs of width \(2^{n^{o(1)}}\), which is incomparable to the results of Impagliazzo et al.
Our pseudorandom generator is similar to the one used by Gopalan et al. (FOCS 2012) for read-once CNFs, but the analysis is quite different; ours is based on Fourier analysis of branching programs. In particular, we show that an oblivious, read-once, regular branching program of width w has Fourier mass at most \((2w^ 2) ^k\) at level k, independent of the length of the program.Engineering and Applied Science
Improving Modular Inversion in RNS using the Plus-Minus Method

International audienceThe paper describes a new RNS modular inversion algorithm based on the extended Euclidean algorithm and the plus-minus trick. In our algorithm, comparisons over large RNS values are replaced by cheap computations modulo 4. Comparisons to an RNS version based on Fermat's little theorem were carried out. The number of elementary modular operations is signi cantly reduced: a factor 12 to 26 for multiplications and 6 to 21 for additions. Virtex 5 FPGAs implementations show that for a similar area, our plus-minus RNS modular inversion is 6 to 10 times faster
Leakage-Resilient Symmetric Encryption via Re-keying

International audienceIn the paper, we study whether it is possible to construct an efficient leakage-resilient symmetric scheme using the AES block cipher. We aim at bridging the gap between the theoretical leakage-resilient symmetric primitives used to build encryption schemes and the prac-tical schemes that do not have any security proof against side-channel adversaries. Our goal is to construct an as efficient as possible leakage-resilient encryption scheme, but we do not want to change the crypto-graphic schemes already implemented. The basic idea consists in adding a leakage-resilient re-keying scheme on top of the encryption scheme and has been already suggested by Kocher to thwart differential power analy-sis techniques. Indeed, in such analysis, the adversary queries the encryp-tion box and from the knowledge of the plaintext/ciphertext, she can per-form a divide-and-conquer key recovery attack. The method consisting in changing the key for each or after a small number of encryption with the same key is known as re-keying. It prevents DPA adversaries but not SPA attacks which uses one single leakage trace. Here, we prove that using a leakage-resilient re-keying scheme on top of a secure encryption scheme in the standard model, leads to a leakage-resilient encryption scheme. The main advantage of the AES block cipher is that its implementations are generally heuristically-secure against SPA adversaries. This assump-tion is used in many concrete instantiations of leakage-resilient symmet-ric primitives. Consequently, if we use it and change the key for each new message block, the adversary will not be able to recover any key if the re-keying scheme is leakage-resilient. There is mainly two different techniques for re-keying scheme, either parallel or sequential, but if we want to avoid the adversary having access to many inputs/outputs, only the sequential method is possible. However, the main drawback of the latter technique is that in case of de-synchronization, many useless com-putations are required. In our re-keying scheme, we use ideas from the skip-list data structure to efficiently recover a specific key. Full version of the paper published in the proceedings of CHES 2013
Factory modelling: combining energy modelling for buildings and production systems

Traditionally, manufacturing facilities and building services are analysed separately to manufacturing operations. This is despite manufacturing operations using and discarding energy with the support of facilities. Therefore improvements in energy and other resource use to work towards sustainable manufacturing have been sub-optimal. This paper presents research in which buildings, facilities and manufacturing operations are viewed as inter-related systems. The objectives are to improve overall resource efficiency and to exploit opportunities to use energy and / or waste from one process as potential inputs to other processes. The novelty here is the combined simulation of production and building energy use and waste in order to reduce overall resource consumption. The paper presents a literature review, develops the conceptual modelling approach and introduces the prototype IES Ltd THERM software. The work has been applied to industrial cases to demonstrate the ability of the prototype to support activities towards sustainable manufacturing
Business strategy and innovativeness: results from an empirical study

This study reports on the testing of the hypothesis that there is a positive relationship between business strategy and innovativeness. Business strategy is defined here to include market focus strategy, technology development strategy, and operations priorities - including cost, quality, delivery / dependability, and flexibility.  An empirical study is conducted based on data collected using a questionnaire developed. 184 manufacturing firms from different industries in the Northern Marmara region in Turkey participated in the study. Multivariate statistics techniques and structural equation modeling are employed. The results have been affirmative supporting the hypothesis. Market focus and technology development factors are found to mediate the effects of operations priorities on innovativeness. That market focus, technology development and cost efficiency have direct effects on innovativeness is another finding of managerial importance
One-of-a-Kind Production (OKP) planning and control: An empirical framework for the special purpose machines industry

In this paper, we focus on the One-of-a-Kind Production (OKP) industry, where each product is designed and manufactured based on specific customer requirements to a large extent, according to an Engineer To Order (ETO) approach. This research has been carried out among the "SIGI-X" project, funded by the Italian Ministry of Economic Development (MISE). The paper illustrates an empirical study on the state-of-the-art of information systems supporting the leading processes in OKP companies. Through a set of 21 case studies in Italian companies producing special machines, we aim to: identify and investigate strengths and weaknesses of the main OKP business processes; analyze the ICT support and its level of integration among the different ICT solutions; identify levers for improvement, concerning organizational, methodological and informatics aspects; build a practical framework that could define and link the main processes in order to obtain a sort of guideline useful for reengineering the processes, and laying the foundation for a new integrated ICT business template for OKP companies. The lack of support of three fundamental tasks such as project management, planning and cost control underlines that there is substantial room for improvement under the ICT support perspective. Finally, the development of an integrated IT environment to support (in particular) project management and planning activities, specifically addressed to OKP context, would help these companies to improve their performance and competitiveness
Ranking-based semantics for argumentation frameworks

An argumentation system consists of a set of interacting arguments and a semantics for evaluating them. This paper proposes a new family of semantics which rank-orders arguments from the most acceptable to the weakest one(s). The new semantics enjoy two other main features: i) an attack weakens its target but does not kill it, ii) the number of attackers has a great impact on the acceptability of an argument.We start by proposing a set of rational postulates that such semantics could satisfy, then construct various semantics that enjoy them
Bipolar Possibility Theory as a Basis for a Logic of Desire and Beliefs

Bipolar possibility theory relies on the use of four set functions. On the one hand, a weak possibility and a strong necessity measure are increasing set functions, which are respectively max-decomposable with respect to union and min-decomposable with respect to intersection. On the other hand, strong possibility and weak necessity measures are two decreasing set functions, which are respectively min-decomposable with respect to union and max-decomposable with respect to intersection. In the first part of the paper we advocate the use of the last two functions for modeling a notion of graded desire. Moreover, we show that the combination of weak possibility and strong possibility allows us to model a notion of realistic desire, i.e., a desire that does not only account for satisfactoriness but also for its epistemic possibility. In the second part of the paper we show that possibility theory offers a semantic basis for developing a modal logic of beliefs and desires
A scalable learning algorithm for Kernel Probabilistic Classifier

In this paper we propose a probabilistic classification algorithm that learns a set of kernel functions that associate a probability distribution over classes to an input vector. This model is obtained by maximizing a measure over the probability distributions through a local optimization process. This measure focuses on the faithfulness of the whole probability distribution induced rather than only considering the probabilities of the classes separately. We show that, thanks to a pre-processing computation, the complexity of the evaluation of this measure with respect to a model is no longer dependent on the size of the training set. This makes the local optimization of the whole set of kernel functions tractable, even for large databases. We experiment our method on five benchmark datasets and the KDD Cup 2012 dataset
On the implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers

In this paper we explain the design and preliminary implementation of a solver for the positive satisfiability problem of concepts in a fuzzy description logic over the infinite-valued product logic. This very solver also answers 1-satisfiability in quasi-witnessed models. The solver works by first performing a direct reduction of the problem to a satisfiability problem of a quantifier free boolean formula with non-linear real arithmetic properties, and secondly solves the resulting formula with an SMT solver. We show that the satisfiability problem for such formulas is still a very challenging problem for even the most advanced SMT solvers, and so it represents an interesting problem for the community working on the theory and practice of SMT solvers.Research partially funded by the Spanish MICINN projects ARINF (TIN2009-14704-C03-01/03) and TASSAT (TIN2010-20967-C04-01/03), MINECO project EdeTRI (TIN2012-39348-C02-01), Agreement Techologies (CONSOLIDER CSD 2007- 0022), Catalan Government (2009SGR-1433/34) and ESF project POST - UP II No. CZ.1.07/2.3.00/30.0041 that is co-financed by the European Social Fund and the state budget of the Czech Republic.Peer Reviewe
Enforcement in Argumentation is a kind of Update

In the literature, enforcement consists in changing an argumentation system in order to force it to accept a given set of arguments. In this paper, we extend this notion by allowing incomplete information about the initial argumentation sys- tem. Generalized enforcement is an operation that maps a propositional formula describing a system and a propositional formula that describes a goal, to a new formula describing the possible resulting systems. This is done under some con- straints about the allowed changes. We give a set of postulates restraining the class of enforcement operators and provide a representation theorem linking them to a family of proximity relations on argumentation systems
On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation

In a previous work we defined a recursive warrant semantics for Defeasible Logic Programming based on a general notion of collective conflict among arguments. The main feature of this recursive semantics is that an output of a program is a pair consisting of a set of warranted and a set of blocked formulas. A program may have multiple outputs in case of circular definitions of conflicts among arguments. In this paper we design an algorithm for computing each output and we provide an experimental evaluation of the algorithm based on two SAT encodings defined for the two main combinatorial subproblems that arise when computing warranted and blocked conclusions for each output.The authors acknowledge the Spanish projects ARINF (TIN2009-14704-C03-01),  TASSAT  (TIN2010-20967-C04-03)  and  EdeTRI  (TIN2012-39348-C02-01).Peer Reviewe
Neuroimaging in PTSD-related psychotherapies

Neuroimaging studies conducted in PTSD patients who have undergone various psychological treatments have provided evidence of modifications in cerebral blood flow (Single Photon Emission Computer Tomography, SPECT), neuronal volume and density (Magnetic Resonance Imaging, MRI) and, more recently, brain electric signal (EEG). However, to date the number of such studies is still far too remains limited since only a few psychotherapies have been investigated using SPECT and MRI. In this respect, a recent study designed to monitor psychotherapy-related neurobiological changes is expected to pave the way for a new concept in PTSD treatment investigations. The purpose of this chapter is to review the results of functional and structural changes being reported in PTSD treatments during the period from 1999 to 2012, to presenting a critical review and to analysanalyze is of the reported pathophysiological changes