pinecone/core-2020-05-10-deduplication huggingface dataset:
ASTREA: Answer sets for a trusted reasoning environment for agents

In recent years, numerous papers have shown the power and flexibility of answer set programming (ASP) in the modeling of intelligent agents. This is not surprising since ASP was developed specifically for non-monotonic reasoning - including common-sense reasoning required in agent modeling. When dealing with multiple agents exchanging information, a common problem is dealing with conflicting information. As with humans, our intelligent agents may trust information from some agents more and than from others. In this paper, we present ASTREA, a methodology and framework for modeling multi-agent systems with trust. Starting from agents written in standard , we model the agent's knowledge, beliefs, reasoning capabilities and trust in other agents together with a conflict resolution strategy in CR-Prolog. The system is then able to advise the agent what information to take into account and what to discard
A game theoretic approach for feature clustering and its application to feature selection

In this paper, we develop a game theoretic approach for clustering features in a learning problem. Feature clustering can serve as an important preprocessing step in many problems such as feature selection, dimensionality reduction, etc. In this approach, we view features as rational players of a coalitional game where they form coalitions (or clusters) among themselves in order to maximize their individual payoffs. We show how Nash Stable Partition (NSP), a well known concept in the coalitional game theory, provides a natural way of clustering features. Through this approach, one can obtain some desirable properties of the clusters by choosing appropriate payoff functions. For a small number of features, the NSP based clustering can be found by solving an integer linear program (ILP). However, for large number of features, the ILP based approach does not scale well and hence we propose a hierarchical approach. Interestingly, a key result that we prove on the equivalence between a k-size NSP of a coalitional game and minimum k-cut of an appropriately constructed graph comes in handy for large scale problems. In this paper, we use feature selection problem (in a classification setting) as a running example to illustrate our approach. We conduct experiments to illustrate the efficacy of our approach
Smooth simultaneous structural graph matching and point-set registration

We present a graph matching method that encompasses both a model of structural consistency and a model of geometrical deformations. Our method poses the graph matching problem as one of mixture modelling which is solved using the EM algorithm. The solution is then approximated as a succession of assignment problems which are solved, in a smooth way, using Softassign. Our method allows us to detect outliers in both graphs involved in the matching. Unlike the outlier rejectors such as RANSAC and Graph Transformation Matching, our method is\ud
able to refine an initial the tentative correspondence-set in a more flexible way than simply removing spurious correspondences. In the experiments, our method shows a good ratio between effectiveness and computational time compared with other methods inside and outside the graphs’ field.Postprint (author’s final draft
Mining association rules for label ranking

Lecture Notes in Computer Science Volume 6635, 2011.Recently, a number of learning algorithms have been adapted for label ranking, including instance-based and tree-based methods. In this paper, we continue this line of work by proposing an adaptation of association rules for label ranking based on the APRIORI algorithm. Given that the original APRIORI algorithm does not aim to obtain predictive models, two changes were needed for this achievement. The adaptation essentially consists of using variations of the support and confidence measures based on ranking similarity functions that are suitable for label ranking. Additionally we propose a simple greedy method to select the parameters of the algorithm. We also adapt the method to make a prediction from the possibly con icting consequents of the rules that apply to an example. Despite having made our adaptation from a very simple variant of association rules for classification, partial results clearly show that the method is making valid predictions. Additionally, they show that it competes well with state-of-the-art label ranking algorithms.This work was partially supported by project Rank! (PTDC/EIA/81178/2006) from FCT and Palco AdI project Palco3.0 financed by QREN and Fundo Europeu de Desenvolvimento Regional (FEDER). We thank the anonymous referees for useful comments
Evaluating pattern set mining strategies in a constraint programming framework

The pattern mining community has shifted its attention from local pattern mining to pattern set mining. The task of pattern set mining is concerned with finding a set of patterns that satisfies a set of constraints and often also scores best w.r.t. an optimisation criteria. Furthermore, while in local pattern mining the constraints are imposed at the level of individual patterns, in pattern set mining they are also concerned with the overall set of patterns. A wide variety of different pattern set mining techniques is available in literature. The key contribution of this paper is that it studies, compares and evaluates such search strategies for pattern set mining. The investigation employs concept-learning as a benchmark for pattern set mining and employs a constraint programming framework in which key components of pattern set mining are formulated and implemented. The study leads to novel insights into the strong and weak points of different pattern set mining strategies.status: publishe
Experimental Analysis of RSSI-based Indoor Location Systems with WL Circularly Polarized Antennas

Circularly polarized antennas are used in 2.4 GHz ZigBee radio modules to evaluate performance improvement of RSSI (Received Signal Strength Indicator) based location techniques, with respect to conventional linearly polarized antennas. Experimental RSSI measurements in an indoor environment clearly show that multipath fading is significantly reduced when CP antennas are used; this determines a more reliable estimation of the field amplitude decay law as a function of the distance of the mobile node from the fixed access point, and then a higher location accuracy. At the best of authors' knowledge, it is the first time that the circular polarization features are applied to RSSI-based radio location techniques
Non-adaptive complex group testing with multiple positive sets

LNCS v. 6648 is conference proceedings of TAMC 2011Given n items with at most d of them having a particular property (referred as positive items), a single test on a selected subset of them is positive if the subset contains any positive item. The non-adaptive group testing problem is to design how to group the items to minimize the number of tests required to identify all positive items in which all tests are performed in parallel. This problem is well-studied and algorithms exist that match the lower bound with a small gap of logd asymptoticically. An important generalization of the problem is to consider the case that individual positive item cannot make a test positive, but a combination of them (referred as positive subsets) can do. The problem is referred as the non-adaptive complex group testing. Assume there are at most d positive subsets whose sizes are at most s, existing algorithms either require Ω(logs n) tests for general n or O((s+d/d) log n) tests for some special values of n . However, the number of items in each test cannot be very small or very large in real situation. The above algorithms cannot be applied because there is no control on the number of items in each test. In this paper, we provide a novel and practical derandomized algorithm to construct the tests, which has two important properties. (1) Our algorithm requires only O((d+s)d+s+1/(ddss log n) tests for all positive integers n which matches the upper bound on the number of tests when all positive subsets are singletons, i.e. s = 1. (2) All tests in our algorithm can have the same number of tested items k. Thus, our algorithm can solve the problem with additional constraints on the number of tested items in each test, such as maximum or minimum number of tested items. © 2011 Springer-Verlag.postprintThe 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011), Tokyo, Japan, 23-25 May 2011. In Lecture Notes in Computer Science, 2011, v. 6648, p. 172-18
Approximability of the Subset Sum Reconfiguration Problem

The subset sum problem is a well-known NP-complete problem in which we wish to find a packing (subset) of items (integers) into a knapsack with capacity so that the sum of the integers in the packing is at most the capacity of the knapsack and at least a given integer threshold. In this paper, we study the problem of reconfiguring one packing into another packing by moving only one item at a time, while at all times maintaining the feasibility of packings. First we show that this decision problem is strongly NP-hard, and is PSPACE-complete if we are given a conflict graph for the set of items in which each vertex corresponds to an item and each edge represents a pair of items that are not allowed to be packed together into the knapsack. We then study an optimization version of the problem: we wish to maximize the minimum sum among all packings in the reconfiguration. We show that this maximization problem admits a polynomial-time approximation scheme (PTAS), while the problem is APX-hard if we are given a conflict graph
plasp: A Prototype for PDDL-Based Planning in ASP

We present a prototypical system, plasp, implementing Planning by  compilation to Answer Set Programming (ASP). Our approach is inspired by  Planning as Satisfiability, yet it aims at keeping the actual compilation simple  in favor of modeling planning techniques by meta-programming in ASP. This  has several advantages. First, ASP modelings are easily modifiable and can be  studied in a transparent setting. Second, we can take advantage of available ASP  grounders to obtain propositional representations. Third, we can harness ASP  solvers providing incremental solving mechanisms. Finally, the ASP community  gains access to a wide range of planning problems, and the planning community  benefits from the knowledge representation and reasoning capacities of ASP.Full Tex
The future internet - Future Internet Assembly 2011: Achievements and technological promises

Irrespective of whether we use economic or societal metrics, the Internet is one of the most important technical infrastructures in existence today. It will be a catalyst for much of our innovation and prosperity in the future. A competitive Europe will require Internet connectivity and services beyond the capabilities offered by current technologies. Future Internet research is therefore a must. \ud
\ud
This book is published in full compliance with the Open Access publishing initiative; it is based on the research carried out within the Future Internet Assembly (FIA). It contains a sample of representative results from the recent FIA meetings spanning a broad range of topics, all being of crucial importance for the future Internet. \ud
\ud
The book includes 32 contributions and has been structured into the following sections, each of which is preceded by a short introduction:\ud
\ud
Foundations: architectural issues; socio-economic issues; security and trust; and experiments and experimental design. Future Internet Areas: networks, services, and content; and applications
An approach to investigating socio-economic tussles arising from building the future internet

With the evolution of the Internet from a controlled research network to a worldwide social and economic platform, the initial assumptions regarding stakeholder cooperative behavior are no longer valid. Conflicts have emerged in situations where there are opposing interests. Previous work in the literature has termed these conflicts tussles. This article presents the research of the SESERV project, which develops a methodology to investigate such tussles and is carrying out a survey of tussles identified within the research projects funded under the Future Networks topic of the FP7. Selected tussles covering both social and economic aspects are analyzed also in this article
Assessment of economic management of overlay traffic: Methodology and results

Overlay applications generate huge amounts of traffic in the Internet, which determines a problem for Internet Service Providers, since it results in high charges for inter-domain traffic. Traditional traffic management techniques cannot deal successfully with overlay traffic. An incentive-based approach that employs economic concepts and mechanisms is required in order to deal with the overlay traffic in a way that is mutually beneficial for all stakeholders of the Future Internet. This "TripleWin" situation is the target of Economic Traffic Management (ETM). A wide variety of techniques are employed by ETM for optimizing overlay traffic management considering performance requirements of overlay and underlay networks together with cost implications for ISPs. However, the assessment of ETM requires an innovative methodology. In this article this methodology is described and major results are presented as obtained accordingly from the evaluation of different ETM mechanisms
Lattice Codes for the Wiretap Gaussian Channel: Construction and
  Analysis

We consider the Gaussian wiretap channel, where two legitimate players Alice
and Bob communicate over an additive white Gaussian noise (AWGN) channel, while
Eve is eavesdropping, also through an AWGN channel. We propose a coding
strategy based on lattice coset encoding. We analyze Eve's probability of
decoding, from which we define the secrecy gain as a design criterion for
wiretap lattice codes, expressed in terms of the lattice theta series, which
characterizes Eve's confusion as a function of the channel parameters. The
secrecy gain is studied for even unimodular lattices, and an asymptotic
analysis shows that it grows exponentially in the dimension of the lattice.
Examples of wiretap lattice codes are given. Interestingly, minimizing Eve's
probability of error involves the same optimization of the theta series as does
the flatness factor, another newly defined code design that characterizes
lattice codes that achieve strong secrecy.Comment: 43 pages, 16 figures, submitted to IEEE Trans. on Inform. Theor
Strong paraconsistency by separating composition and decomposition in classical logic

In this paper I elaborate a proof system that is able to prove all classical first order logic consequences of consistent premise sets, without proving trivial consequences of inconsistent premises (as in A, ¬A ⊢ B). Essentially this result is obtained by formally distinguishing consequences that are the result of merely decomposing the premises into their subformulas from consequences that may be the result of also composing ‘new’, more complex formulas. I require that, whenever ‘new’ formulas are derived, they are to be preceded by a special +-symbol and these +-preceded formulas are not to be decomposed. By doing this, the proofs are separated into a decomposition phase followed by a composition phase. The proofs are recursive, axiomatizable and, as they do not trivialize inconsistent premise sets, they define a very strong non-transitive paraconsistent logic, for which I also provide an adequate semantics
Meta-learning architectures. Collecting, organizing and exploiting meta-knowledge

In this chapter, we provide a survey of the various architectures that have been developed, or simply proposed, to build extended meta-learning systems that cover entire data mining workflows. They all consist of integrated repositories of meta-knowledge on the knowledge discovery process and leverage that information to propose useful workflows. Our main observation is that most of these systems are very different, and were seemingly developed independently from each other, without really capitalizing on the benefits of prior systems. By bringing these different architectures together and highlighting their strengths and weaknesses, we aim to reuse what we have learned, and we draw a roadmap towards a new generation of knowledge discovery support systems.status: publishe
Parameter identification in cardiac electrophysiology using Proper Orthogonal Decomposition method

International audienceWe consider the problem of estimating some parameters (like ionic models or parameters involved in the initial stimulation) of a model of electrocardiograms (ECG) from the data of the Einthoven leads. This problem can be viewed as a first attempt to identify or to locate a pathology. The direct model is based on the bidomain equations in the heart and a Poisson equation in the torso. To keep the computational time reasonable, the evaluation of the direct problem is approximated with a reduced order model based on Proper Orthogonal Decomposition (POD). The optimization problem is solved using a genetic algorithm. Numerical tests show that, with noisy synthetic data, the proposed procedure allows to recover ionic parameters and initial activation regions with a fair accuracy
FootbOWL: Using a generic ontology of football competition for planning match summaries

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-21034-1_16Proceedings of 8th Extended Semantic Web Conference, ESWC 2011, Heraklion, Crete, Greece, May 29-June 2, 2011We present a two-layer OWL ontology-based Knowledge Base (KB) that allows for flexible content selection and discourse structuring in Natural Language text Generation (NLG) and discuss its use for these two tasks. The first layer of the ontology contains an application-independent base ontology. It models the domain and was not designed with NLG in mind. The second layer, which is added on top of the base ontology, models entities and events that can be inferred from the base ontology, including inferable logico-semantic relations between individuals. The nodes in the KB are weighted according to learnt models of content selection, such that a subset of them can be extracted. The extraction is done using templates that also consider semantic relations between the nodes and a simple user profile. The discourse structuring submodule maps the semantic relations to discourse relations and forms discourse units to then arrange them into a coherent discourse graph. The approach is illustrated and evaluated on a KB that models the First Spanish Football League
A Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms

International audienceIn this paper, we investigate an extension of the description logic SHIQ -a knowledge representation formalism used for the Semantic Web-with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. It was proved that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. We have identified a kind of role inclusion axioms that is responsible for this undecidability and we propose a restriction on these axioms to obtain decidability. Next, we present a tableaux-based algorithm that decides satisfiability of concepts in the new logic
Programming from Galois connections

Problem statements often resort to superlatives such as in eg. “. . . the smallest such number”, “. . . the best approximation”, “. . . the longest such list” which lead to specifications made of two parts: one defining a broad class of solutions (the easy part) and the other requesting the optimal such solution (the hard part).

This paper introduces a binary relational combinator which mirrors this linguistic structure and exploits its potential for calculating programs by optimization. This applies in particular to specifications written in the form of Galois connections, in which one of the adjoints delivers the optimal solution being sought.

The framework encompasses re-factoring of results previously developed by Bird and de Moor for greedy and dynamic programming, in a way which makes them less technically involved and therefore easier to understand and play with.Mondrian Project funded by the Portuguese NSF under contract PTDC/EIA-CCO/108302/200
Antitumor Ribonucleases

Ribonucleases are small basic proteins that have shown remarkable antitumor activity linked to their ability to destroy RNA. Therefore, they are a second line of cancer chemotherapeutics as they are not genotoxic. This chapter summarizes the main biochemical characteristics of these enzymes and the key factors responsible for their cytotoxic mechanism. Some of them are shared by most cytotoxins, but each RNase has particular cancer cell killing abilities. The effects on the cell cycle and the induced apoptosis mechanism are cell dependent. The knowledge obtained from the cytotoxic mechanism of natural cytotoxic RNases has been used to artificially engineer more potent and selective RNA-degrading enzymes. These approaches are also described. The chapter ends with a brief description of the results of the clinical trials performed with RNasesThis work has been supported by grants BFU2009-06935 from MICINN (Spain) and GRCT04 from the University of Giron
Bright solitary matter waves: formation, stability and interactions

In recent years, bright soliton-like structures composed of gaseous
Bose-Einstein condensates have been generated at ultracold temperature. The
experimental capacity to precisely engineer the nonlinearity and potential
landscape experienced by these solitary waves offers an attractive platform for
fundamental study of solitonic structures. The presence of three spatial
dimensions and trapping implies that these are strictly distinct objects to the
true soliton solutions. Working within the zero-temperature mean-field
description, we explore the solutions and stability of bright solitary waves,
as well as their interactions. Emphasis is placed on elucidating their
similarities and differences to the true bright soliton. The rich behaviour
introduced in the bright solitary waves includes the collapse instability and
symmetry-breaking collisions. We review the experimental formation and
observation of bright solitary matter waves to date, and compare to theoretical
predictions. Finally we discuss the current state-of-the-art of this area,
including beyond-mean-field descriptions, exotic bright solitary waves, and
proposals to exploit bright solitary waves in interferometry and as surface
probes.Comment: 40 pages, 14 figure
Using artificial intelligence techniques for strategy generation in the Commons game

Published version of a chapter in the book: Hybrid Artificial Intelligent Systems. Also available from the publisher on SpringerLink: http://dx.doi.org/10.1007/978-3-642-21219-2_7In this paper, we consider the use of artificial intelligence techniques to aid in discovery of winning strategies for the Commons Game (CG). The game represents a common scenario in which multiple parties share the use of a self-replenishing resource. The resource deteriorates quickly if used indiscriminately. If used responsibly, however, the resource thrives. We consider the scenario one player uses hill climbing or particle swarm optimization to select the course of action, while the remaining N − 1 players use a fixed probability vector. We show that hill climbing and particle swarm optimization consistently generate winning strategies