Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,507 | Solving the undirected feedback vertex set problem by local search | cs.AI | An undirected graph consists of a set of vertices and a set of undirected
edges between vertices. Such a graph may contain an abundant number of cycles,
then a feedback vertex set (FVS) is a set of vertices intersecting with each of
these cycles. Constructing a FVS of cardinality approaching the global minimum
value is... | computer science |
36,508 | Feature Selection On Boolean Symbolic Objects | cs.IR | With the boom in IT technology, the data sets used in application are more
and more larger and are described by a huge number of attributes, therefore,
the feature selection become an important discipline in Knowledge discovery and
data mining, allowing the experts to select the most relevant features to
improve the qu... | computer science |
36,509 | On the Relative Expressiveness of Argumentation Frameworks, Normal Logic
Programs and Abstract Dialectical Frameworks | cs.AI | We analyse the expressiveness of the two-valued semantics of abstract
argumentation frameworks, normal logic programs and abstract dialectical
frameworks. By expressiveness we mean the ability to encode a desired set of
two-valued interpretations over a given propositional signature using only
atoms from that signature... | computer science |
36,510 | Implementing Default and Autoepistemic Logics via the Logic of GK | cs.AI | The logic of knowledge and justified assumptions, also known as logic of
grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for
nonmonotonic reasoning. To date, it has been used to embed in it default logic
(propositional case), autoepistemic logic, Turner's logic of universal
causation, and gen... | computer science |
36,511 | Design Of Fuzzy Logic Traffic Controller For Isolated Intersections With
Emergency Vehicle Priority System Using MATLAB Simulation | cs.AI | Traffic is the chief puzzle problem which every country faces because of the
enhancement in number of vehicles throughout the world, especially in large
urban towns. Hence the need arises for simulating and optimizing traffic
control algorithms to better accommodate this increasing demand. Fuzzy
optimization deals with... | computer science |
36,512 | Logic and Constraint Logic Programming for Distributed Constraint
Optimization | cs.MA | The field of Distributed Constraint Optimization Problems (DCOPs) has gained
momentum, thanks to its suitability in capturing complex problems (e.g.,
multi-agent coordination and resource allocation problems) that are naturally
distributed and cannot be realistically addressed in a centralized manner. The
state of the ... | computer science |
36,513 | FO(C): A Knowledge Representation Language of Causality | cs.LO | Cause-effect relations are an important part of human knowledge. In real
life, humans often reason about complex causes linked to complex effects. By
comparison, existing formalisms for representing knowledge about causal
relations are quite limited in the kind of specifications of causes and effects
they allow. In thi... | computer science |
36,514 | Dialogues for proof search | math.LO | Dialogue games are a two-player semantics for a variety of logics, including
intuitionistic and classical logic. Dialogues can be viewed as a kind of
analytic calculus not unlike tableaux. Can dialogue games be an effective
foundation for proof search in intuitionistic logic (both first-order and
propositional)? We ann... | computer science |
36,515 | An Abductive Framework for Horn Knowledge Base Dynamics | cs.LO | The dynamics of belief and knowledge is one of the major components of any
autonomous system that should be able to incorporate new pieces of information.
We introduced the Horn knowledge base dynamics to deal with two important
points: first, to handle belief states that need not be deductively closed; and
the second ... | computer science |
36,516 | The Metrics Matter! On the Incompatibility of Different Flavors of
Replanning | cs.AI | When autonomous agents are executing in the real world, the state of the
world as well as the objectives of the agent may change from the agent's
original model. In such cases, the agent's planning process must modify the
plan under execution to make it amenable to the new conditions, and to resume
execution. This brin... | computer science |
36,517 | Developing Corpus-based Translation Methods between Informal and Formal
Mathematics: Project Description | cs.AI | The goal of this project is to (i) accumulate annotated informal/formal
mathematical corpora suitable for training semi-automated translation between
informal and formal mathematics by statistical machine-translation methods,
(ii) to develop such methods oriented at the formalization task, and in
particular (iii) to co... | computer science |
36,518 | Student Dropout Risk Assessment in Undergraduate Course at Residential
University | cs.CY | Student dropout prediction is an indispensable for numerous intelligent
systems to measure the education system and success rate of any university as
well as throughout the university in the world. Therefore, it becomes essential
to develop efficient methods for prediction of the students at risk of dropping
out, enabl... | computer science |
36,519 | Transaction Logic with (Complex) Events | cs.AI | This work deals with the problem of combining reactive features, such as the
ability to respond to events and define complex events, with the execution of
transactions over general Knowledge Bases (KBs).
With this as goal, we build on Transaction Logic (TR), a logic precisely
designed to model and execute transaction... | computer science |
36,520 | CDF-Intervals: A Reliable Framework to Reason about Data with
Uncertainty | cs.LO | This research introduces a new constraint domain for reasoning about data
with uncertainty. It extends convex modeling with the notion of p-box to gain
additional quantifiable information on the data whereabouts. Unlike existing
approaches, the p-box envelops an unknown probability instead of approximating
its represen... | computer science |
36,521 | HATP: An HTN Planner for Robotics | cs.RO | Hierarchical Task Network (HTN) planning is a popular approach that cuts down
on the classical planning search space by relying on a given hierarchical
library of domain control knowledge. This provides an intuitive methodology for
specifying high-level instructions on how robots and agents should perform
tasks, while ... | computer science |
36,522 | Towards an ASP-Based Architecture for Autonomous UAVs in Dynamic
Environments (Extended Abstract) | cs.AI | Traditional AI reasoning techniques have been used successfully in many
domains, including logistics, scheduling and game playing. This paper is part
of a project aimed at investigating how such techniques can be extended to
coordinate teams of unmanned aerial vehicles (UAVs) in dynamic environments.
Specifically chall... | computer science |
36,523 | A Comparison of Monte Carlo Tree Search and Mathematical Optimization
for Large Scale Dynamic Resource Allocation | math.OC | Dynamic resource allocation (DRA) problems are an important class of dynamic
stochastic optimization problems that arise in a variety of important
real-world applications. DRA problems are notoriously difficult to solve to
optimality since they frequently combine stochastic elements with intractably
large state and act... | computer science |
36,524 | Mathematical Programming Strategies for Solving the Minimum Common
String Partition Problem | cs.AI | The minimum common string partition problem is an NP-hard combinatorial
optimization problem with applications in computational biology. In this work
we propose the first integer linear programming model for solving this problem.
Moreover, on the basis of the integer linear programming model we develop a
deterministic ... | computer science |
36,525 | Understanding model counting for $β$-acyclic CNF-formulas | cs.CC | We extend the knowledge about so-called structural restrictions of
$\mathrm{\#SAT}$ by giving a polynomial time algorithm for $\beta$-acyclic
$\mathrm{\#SAT}$. In contrast to previous algorithms in the area, our algorithm
does not proceed by dynamic programming but works along an elimination order,
solving a weighted v... | computer science |
36,526 | The PeerRank Method for Peer Assessment | cs.AI | We propose the PeerRank method for peer assessment. This constructs a grade
for an agent based on the grades proposed by the agents evaluating the agent.
Since the grade of an agent is a measure of their ability to grade correctly,
the PeerRank method weights grades by the grades of the grading agent. The
PeerRank meth... | computer science |
36,527 | Conformant Planning as a Case Study of Incremental QBF Solving | cs.LO | We consider planning with uncertainty in the initial state as a case study of
incremental quantified Boolean formula (QBF) solving. We report on experiments
with a workflow to incrementally encode a planning instance into a sequence of
QBFs. To solve this sequence of incrementally constructed QBFs, we use our
general-p... | computer science |
36,528 | The Computational Impact of Partial Votes on Strategic Voting | cs.GT | In many real world elections, agents are not required to rank all candidates.
We study three of the most common methods used to modify voting rules to deal
with such partial votes. These methods modify scoring rules (like the Borda
count), elimination style rules (like single transferable vote) and rules based
on the t... | computer science |
36,529 | A Vague Improved Markov Model Approach for Web Page Prediction | cs.IR | Today most of the information in all areas is available over the web. It
increases the web utilization as well as attracts the interest of researchers
to improve the effectiveness of web access and web utilization. As the number
of web clients gets increased, the bandwidth sharing is performed that
decreases the web ac... | computer science |
36,530 | Integrating Vague Association Mining with Markov Model | cs.IR | The increasing demand of world wide web raises the need of predicting the
user's web page request.The most widely used approach to predict the web pages
is the pattern discovery process of Web usage mining. This process involves
inevitability of many techniques like Markov model, association rules and
clustering. Fuzzy... | computer science |
36,531 | Weakly monotone averaging functions | cs.AI | Monotonicity with respect to all arguments is fundamental to the definition
of aggregation functions. It is also a limiting property that results in many
important non-monotonic averaging functions being excluded from the theoretical
framework. This work proposes a definition for weakly monotonic averaging
functions, s... | computer science |
36,532 | Computational Analysis of Perfect-Information Position Auctions | cs.GT | After experimentation with other designs, the major search engines converged
on the weighted, generalized second-price auction (wGSP) for selling keyword
advertisements. Notably, this convergence occurred before position auctions
were well understood (or, indeed, widely studied) theoretically. While much
progress has b... | computer science |
36,533 | The Mathematical Abstraction Theory, The Fundamentals for Knowledge
Representation and Self-Evolving Autonomous Problem Solving Systems | cs.LO | The intention of the present study is to establish the mathematical
fundamentals for automated problem solving essentially targeted for robotics by
approaching the task universal algebraically introducing knowledge as
realizations of generalized free algebra based nets, graphs with gluing forms
connecting in- and out-e... | computer science |
36,534 | Axiomatizing Causal Reasoning | cs.AI | Causal models defined in terms of a collection of equations, as defined by
Pearl, are axiomatized here. Axiomatizations are provided for three
successively more general classes of causal models: (1) the class of recursive
theories (those without feedback), (2) the class of theories where the
solutions to the equations ... | computer science |
36,535 | Random Algorithms for the Loop Cutset Problem | cs.AI | We show how to find a minimum loop cutset in a Bayesian network with high
probability. Finding such a loop cutset is the first step in Pearl's method of
conditioning for inference. Our random algorithm for finding a loop cutset,
called "Repeated WGuessI", outputs a minimum loop cutset, after O(c 6^k k n)
steps, with pr... | computer science |
36,536 | A Logic for Reasoning about Upper Probabilities | cs.AI | We present a propositional logic to reason about the uncertainty of events,
where the uncertainty is modeled by a set of probability measures assigning an
interval of probability to each event. We give a sound and complete
axiomatization for the logic, and show that the satisfiability problem is
NP-complete, no harder ... | computer science |
36,537 | Renewal Strings for Cleaning Astronomical Databases | cs.AI | Large astronomical databases obtained from sky surveys such as the
SuperCOSMOS Sky Surveys (SSS) invariably suffer from a small number of spurious
records coming from artefactual effects of the telescope, satellites and junk
objects in orbit around earth and physical defects on the photographic plate or
CCD. Though rel... | computer science |
36,538 | An Evasion and Counter-Evasion Study in Malicious Websites Detection | cs.CR | Malicious websites are a major cyber attack vector, and effective detection
of them is an important cyber defense task. The main defense paradigm in this
regard is that the defender uses some kind of machine learning algorithms to
train a detection model, which is then used to classify websites in question.
Unlike othe... | computer science |
36,539 | On the Conditional Independence Implication Problem: A Lattice-Theoretic
Approach | cs.AI | A lattice-theoretic framework is introduced that permits the study of the
conditional independence (CI) implication problem relative to the class of
discrete probability measures. Semi-lattices are associated with CI statements
and a finite, sound and complete inference system relative to semi-lattice
inclusions is pre... | computer science |
36,540 | Fuzzy inequational logic | cs.LO | We present a logic for reasoning about graded inequalities which generalizes
the ordinary inequational logic used in universal algebra. The logic deals with
atomic predicate formulas of the form of inequalities between terms and
formalizes their semantic entailment and provability in graded setting which
allows to draw... | computer science |
36,541 | Incremental Cardinality Constraints for MaxSAT | cs.LO | Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean
Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a
succession of SAT solver calls to reach an optimum solution making extensive
use of cardinality constraints. Many of these algorithms are non-incremental in
nature, i.e. at eac... | computer science |
36,542 | Definition and properties to assess multi-agent environments as social
intelligence tests | cs.MA | Social intelligence in natural and artificial systems is usually measured by
the evaluation of associated traits or tasks that are deemed to represent some
facets of social behaviour. The amalgamation of these traits is then used to
configure the intuitive notion of social intelligence. Instead, in this paper
we start ... | computer science |
36,543 | Challenges in Bridging Social Semantics and Formal Semantics on the Web | cs.AI | This paper describes several results of Wimmics, a research lab which names
stands for: web-instrumented man-machine interactions, communities, and
semantics. The approaches introduced here rely on graph-oriented knowledge
representation, reasoning and operationalization to model and support actors,
actions and interac... | computer science |
36,544 | Classificatory Sorites, Probabilistic Supervenience, and Rule-Making | cs.AI | We view sorites in terms of stimuli acting upon a system and evoking this
system's responses. Supervenience of responses on stimuli implies that they
either lack tolerance (i.e., they change in every vicinity of some of the
stimuli), or stimuli are not always connectable by finite chains of stimuli in
which successive ... | computer science |
36,545 | A Multistage Stochastic Programming Approach to the Dynamic and
Stochastic VRPTW - Extended version | cs.AI | We consider a dynamic vehicle routing problem with time windows and
stochastic customers (DS-VRPTW), such that customers may request for services
as vehicles have already started their tours. To solve this problem, the goal
is to provide a decision rule for choosing, at each time step, the next action
to perform in lig... | computer science |
36,546 | A Quantum Production Model | cs.AI | The production system is a theoretical model of computation relevant to the
artificial intelligence field allowing for problem solving procedures such as
hierarchical tree search. In this work we explore some of the connections
between artificial intelligence and quantum computation by presenting a model
for a quantum ... | computer science |
36,547 | An Integrated Semantic Web Service Discovery and Composition Framework | cs.AI | In this paper we present a theoretical analysis of graph-based service
composition in terms of its dependency with service discovery. Driven by this
analysis we define a composition framework by means of integration with
fine-grained I/O service discovery that enables the generation of a graph-based
composition which c... | computer science |
36,548 | Deep Neural Programs for Adaptive Control in Cyber-Physical Systems | cs.AI | We introduce Deep Neural Programs (DNP), a novel programming paradigm for
writing adaptive controllers for cy-ber-physical systems (CPS). DNP replace if
and while statements, whose discontinuity is responsible for undecidability in
CPS analysis, intractability in CPS design, and frailness in CPS
implementation, with th... | computer science |
36,549 | Advances in Artificial Intelligence: Are you sure, we are on the right
track? | cs.AI | Over the past decade, AI has made a remarkable progress. It is agreed that
this is due to the recently revived Deep Learning technology. Deep Learning
enables to process large amounts of data using simplified neuron networks that
simulate the way in which the brain works. However, there is a different point
of view, wh... | computer science |
36,550 | Influence-Optimistic Local Values for Multiagent Planning --- Extended
Version | cs.AI | Recent years have seen the development of methods for multiagent planning
under uncertainty that scale to tens or even hundreds of agents. However, most
of these methods either make restrictive assumptions on the problem domain, or
provide approximate solutions without any guarantees on quality. Methods in the
former c... | computer science |
36,551 | Automated Reasoning for Robot Ethics | cs.AI | Deontic logic is a very well researched branch of mathematical logic and
philosophy. Various kinds of deontic logics are considered for different
application domains like argumentation theory, legal reasoning, and acts in
multi-agent systems. In this paper, we show how standard deontic logic can be
used to model ethica... | computer science |
36,552 | Development of a VO Registry Subject Ontology using Automated Methods | cs.AI | We report on our initial work to automate the generation of a domain ontology
using subject fields of resources held in the Virtual Observatory registry.
Preliminary results are comparable to more generalized ontology learning
software currently in use. We expect to be able to refine our solution to
improve both the de... | computer science |
36,553 | OntoLoki: an automatic, instance-based method for the evaluation of
biological ontologies on the Semantic Web | cs.AI | The delineation of logical definitions for each class in an ontology and the
consistent application of these definitions to the assignment of instances to
classes are important criteria for ontology evaluation. If ontologies are
specified with property-based restrictions on class membership, then such
consistency can b... | computer science |
36,554 | Unified vector space mapping for knowledge representation systems | cs.AI | One of the most significant problems which inhibits further developments in
the areas of Knowledge Representation and Artificial Intelligence is a problem
of semantic alignment or knowledge mapping. The progress in its solution will
be greatly beneficial for further advances of information retrieval, ontology
alignment... | computer science |
36,555 | An Introduction to Logics of Knowledge and Belief | cs.AI | This chapter provides an introduction to some basic concepts of epistemic
logic, basic formal languages, their semantics, and proof systems. It also
contains an overview of the handbook, and a brief history of epistemic logic
and pointers to the literature. | computer science |
36,556 | Game-theoretic Approach for Non-Cooperative Planning | cs.AI | When two or more self-interested agents put their plans to execution in the
same environment, conflicts may arise as a consequence, for instance, of a
common utilization of resources. In this case, an agent can postpone the
execution of a particular action, if this punctually solves the conflict, or it
can resort to ex... | computer science |
36,557 | External Validity: From Do-Calculus to Transportability Across
Populations | stat.ME | The generalizability of empirical findings to new environments, settings or
populations, often called "external validity," is essential in most scientific
explorations. This paper treats a particular problem of generalizability,
called "transportability," defined as a license to transfer causal effects
learned in exper... | computer science |
36,558 | Towards an intelligent VNS heuristic for the k-labelled spanning forest
problem | cs.OH | In a currently ongoing project, we investigate a new possibility for solving
the k-labelled spanning forest (kLSF) problem by an intelligent Variable
Neighbourhood Search (Int-VNS) metaheuristic. In the kLSF problem we are given
an undirected input graph G and an integer positive value k, and the aim is to
find a spann... | computer science |
36,559 | Doubly Robust Policy Evaluation and Optimization | stat.ME | We study sequential decision making in environments where rewards are only
partially observed, but can be modeled as a function of observed contexts and
the chosen action by the decision maker. This setting, known as contextual
bandits, encompasses a wide variety of applications such as health care,
content recommendat... | computer science |
36,560 | Quantum Structure in Cognition, Origins, Developments, Successes and
Expectations | cs.AI | We provide an overview of the results we have attained in the last decade on
the identification of quantum structures in cognition and, more specifically,
in the formalization and representation of natural concepts. We firstly discuss
the quantum foundational reasons that led us to investigate the mechanisms of
formati... | computer science |
36,561 | Hyper Temporal Networks | cs.DS | Simple Temporal Networks (STNs) provide a powerful and general tool for
representing conjunctions of maximum delay constraints over ordered pairs of
temporal variables. In this paper we introduce Hyper Temporal Networks (HyTNs),
a strict generalization of STNs, to overcome the limitation of considering only
conjunction... | computer science |
36,562 | Non-normal modalities in variants of Linear Logic | cs.LO | This article presents modal versions of resource-conscious logics. We
concentrate on extensions of variants of Linear Logic with one minimal
non-normal modality. In earlier work, where we investigated agency in
multi-agent systems, we have shown that the results scale up to logics with
multiple non-minimal modalities. ... | computer science |
36,563 | Quantum Structure of Negation and Conjunction in Human Thought | cs.AI | We analyse in this paper the data collected in a set of experiments performed
on human subjects on the combination of natural concepts. We investigate the
mutual influence of conceptual conjunction and negation by measuring the
membership weights of a list of exemplars with respect to two concepts, e.g.,
'Fruits' and '... | computer science |
36,564 | GeomRDF: A Geodata Converter with a Fine-Grained Structured
Representation of Geometry in the Web | cs.DB | In recent years, with the advent of the web of data, a growing number of
national mapping agencies tend to publish their geospatial data as Linked Data.
However, differences between traditional GIS data models and Linked Data model
can make the publication process more complicated. Besides, it may require, to
be done, ... | computer science |
36,565 | Exploration of the scalability of LocFaults approach for error
localization with While-loops programs | cs.AI | A model checker can produce a trace of counterexample, for an erroneous
program, which is often long and difficult to understand. In general, the part
about the loops is the largest among the instructions in this trace. This makes
the location of errors in loops critical, to analyze errors in the overall
program. In th... | computer science |
36,566 | Exploration of the scalability of LocFaults | cs.AI | A model checker can produce a trace of counterexample, for an erroneous
program, which is often long and difficult to understand. In general, the part
about the loops is the largest among the instructions in this trace. This makes
the location of errors in loops critical, to analyze errors in the overall
program. In th... | computer science |
36,567 | Data Science as a New Frontier for Design | cs.AI | The purpose of this paper is to contribute to the challenge of transferring
know-how, theories and methods from design research to the design processes in
information science and technologies. More specifically, we shall consider a
domain, namely data-science, that is becoming rapidly a globally invested
research and d... | computer science |
36,568 | Identifying Similar Patients Using Self-Organising Maps: A Case Study on
Type-1 Diabetes Self-care Survey Responses | cs.CE | Diabetes is considered a lifestyle disease and a well managed self-care plays
an important role in the treatment. Clinicians often conduct surveys to
understand the self-care behaviors in their patients. In this context, we
propose to use Self-Organising Maps (SOM) to explore the survey data for
assessing the self-care... | computer science |
36,569 | The concept of free will as an infinite metatheoretic recursion | cs.AI | It is argued that the concept of free will, like the concept of truth in
formal languages, requires a separation between an object level and a
meta-level for being consistently defined. The Jamesian two-stage model, which
deconstructs free will into the causally open "free" stage with its closure in
the "will" stage, i... | computer science |
36,570 | Geometry and Determinism of Optimal Stationary Control in Partially
Observable Markov Decision Processes | math.OC | It is well known that for any finite state Markov decision process (MDP)
there is a memoryless deterministic policy that maximizes the expected reward.
For partially observable Markov decision processes (POMDPs), optimal memoryless
policies are generally stochastic. We study the expected reward optimization
problem ove... | computer science |
36,571 | A Rule-Based Short Query Intent Identification System | cs.IR | Using SMS (Short Message System), cell phones can be used to query for
information about various topics. In an SMS based search system, one of the key
problems is to identify a domain (broad topic) associated with the user query;
so that a more comprehensive search can be carried out by the domain specific
search engin... | computer science |
36,572 | Properties of Sparse Distributed Representations and their Application
to Hierarchical Temporal Memory | cs.AI | Empirical evidence demonstrates that every region of the neocortex represents
information using sparse activity patterns. This paper examines Sparse
Distributed Representations (SDRs), the primary information representation
strategy in Hierarchical Temporal Memory (HTM) systems and the neocortex. We
derive a number of ... | computer science |
36,573 | ASPeRiX, a First Order Forward Chaining Approach for Answer Set
Computing | cs.LO | The natural way to use Answer Set Programming (ASP) to represent knowledge in
Artificial Intelligence or to solve a combinatorial problem is to elaborate a
first order logic program with default negation. In a preliminary step this
program with variables is translated in an equivalent propositional one by a
first tool:... | computer science |
36,574 | Revisable Justified Belief: Preliminary Report | cs.LO | The theory $\mathsf{CDL}$ of Conditional Doxastic Logic is the single-agent
version of Board's multi-agent theory $\mathsf{BRSIC}$ of conditional belief.
$\mathsf{CDL}$ may be viewed as a version of AGM belief revision theory in
which Boolean combinations of revisions are expressible in the language. We
introduce a the... | computer science |
36,575 | RecSys Challenge 2016: job recommendations based on preselection of
offers and gradient boosting | cs.AI | We present the Mim-Solution's approach to the RecSys Challenge 2016, which
ranked 2nd. The goal of the competition was to prepare job recommendations for
the users of the website Xing.com.
Our two phase algorithm consists of candidate selection followed by the
candidate ranking. We ranked the candidates by the predic... | computer science |
36,576 | DeepBach: a Steerable Model for Bach Chorales Generation | cs.AI | This paper introduces DeepBach, a graphical model aimed at modeling
polyphonic music and specifically hymn-like pieces. We claim that, after being
trained on the chorale harmonizations by Johann Sebastian Bach, our model is
capable of generating highly convincing chorales in the style of Bach.
DeepBach's strength comes... | computer science |
36,577 | A New Type-II Fuzzy Logic Based Controller for Non-linear Dynamical
Systems with Application to a 3-PSP Parallel Robot | cs.SY | The concept of uncertainty is posed in almost any complex system including
parallel robots as an outstanding instance of dynamical robotics systems. As
suggested by the name, uncertainty, is some missing information that is beyond
the knowledge of human thus we may tend to handle it properly to minimize the
side-effect... | computer science |
36,578 | N-gram Opcode Analysis for Android Malware Detection | cs.CR | Android malware has been on the rise in recent years due to the increasing
popularity of Android and the proliferation of third party application markets.
Emerging Android malware families are increasingly adopting sophisticated
detection avoidance techniques and this calls for more effective approaches for
Android mal... | computer science |
36,579 | Decision Theory in an Algebraic Setting | cs.AI | In decision theory an act is a function from a set of conditions to the set
of real numbers. The set of conditions is a partition in some algebra of
events. The expected value of an act can be calculated when a probability
measure is given. We adopt an algebraic point of view by substituting the
algebra of events with ... | computer science |
36,580 | Finding Better Active Learners for Faster Literature Reviews | cs.SE | Literature reviews can be time-consuming and tedious to complete. By
cataloging and refactoring three state-of-the-art active learning techniques
from evidence-based medicine and legal electronic discovery, this paper finds
and implements FASTREAD, a faster technique for studying a large corpus of
documents. This paper... | computer science |
36,581 | A Model of Multi-Agent Consensus for Vague and Uncertain Beliefs | cs.MA | Consensus formation is investigated for multi-agent systems in which agents'
beliefs are both vague and uncertain. Vagueness is represented by a third truth
state meaning \emph{borderline}. This is combined with a probabilistic model of
uncertainty. A belief combination operator is then proposed which exploits
borderli... | computer science |
36,582 | Reinforcement Learning With Temporal Logic Rewards | cs.AI | Reinforcement learning (RL) depends critically on the choice of reward
functions used to capture the de- sired behavior and constraints of a robot.
Usually, these are handcrafted by a expert designer and represent heuristics
for relatively simple tasks. Real world applications typically involve more
complex tasks with ... | computer science |
36,583 | Learning to Drive using Inverse Reinforcement Learning and Deep
Q-Networks | cs.AI | We propose an inverse reinforcement learning (IRL) approach using Deep
Q-Networks to extract the rewards in problems with large state spaces. We
evaluate the performance of this approach in a simulation-based autonomous
driving scenario. Our results resemble the intuitive relation between the
reward function and readin... | computer science |
36,584 | Application of Advanced Record Linkage Techniques for Complex Population
Reconstruction | cs.DB | Record linkage is the process of identifying records that refer to the same
entities from several databases. This process is challenging because commonly
no unique entity identifiers are available. Linkage therefore has to rely on
partially identifying attributes, such as names and addresses of people. Recent
years hav... | computer science |
36,585 | Algorithms for Graph-Constrained Coalition Formation in the Real World | cs.MA | Coalition formation typically involves the coming together of multiple,
heterogeneous, agents to achieve both their individual and collective goals. In
this paper, we focus on a special case of coalition formation known as
Graph-Constrained Coalition Formation (GCCF) whereby a network connecting the
agents constrains t... | computer science |
36,586 | Real-time interactive sequence generation and control with Recurrent
Neural Network ensembles | cs.AI | Recurrent Neural Networks (RNN), particularly Long Short Term Memory (LSTM)
RNNs, are a popular and very successful method for learning and generating
sequences. However, current generative RNN techniques do not allow real-time
interactive control of the sequence generation process, thus aren't well suited
for live cre... | computer science |
36,587 | Crowdsourced Outcome Determination in Prediction Markets | cs.AI | A prediction market is a useful means of aggregating information about a
future event. To function, the market needs a trusted entity who will verify
the true outcome in the end. Motivated by the recent introduction of
decentralized prediction markets, we introduce a mechanism that allows for the
outcome to be determin... | computer science |
36,588 | A Comment on Argumentation | math.LO | We use the theory of defaults and their meaning of [GS16] to develop (the
outline of a) new theory of argumentation. | computer science |
36,589 | Context and Interference Effects in the Combinations of Natural Concepts | cs.AI | The mathematical formalism of quantum theory exhibits significant
effectiveness when applied to cognitive phenomena that have resisted
traditional (set theoretical) modeling. Relying on a decade of research on the
operational foundations of micro-physical and conceptual entities, we present a
theoretical framework for ... | computer science |
36,590 | A modified Physarum-inspired model for the user equilibrium traffic
assignment problem | cs.ET | The user equilibrium traffic assignment principle is very important in the
traffic assignment problem. Mathematical programming models are designed to
solve the user equilibrium problem in traditional algorithms. Recently, the
Physarum shows the ability to address the user equilibrium and system
optimization traffic as... | computer science |
36,591 | Computational Complexity of Testing Proportional Justified
Representation | cs.GT | We consider a committee voting setting in which each voter approves of a
subset of candidates and based on the approvals, a target number of candidates
are selected. Aziz et al. (2015) proposed two representation axioms called
justified representation and extended justified representation. Whereas the
former can be tes... | computer science |
36,592 | Boolean kernels for collaborative filtering in top-N item recommendation | cs.IR | In many personalized recommendation problems available data consists only of
positive interactions (implicit feedback) between users and items. This problem
is also known as One-Class Collaborative Filtering (OC-CF). Linear models
usually achieve state-of-the-art performances on OC-CF problems and many
efforts have bee... | computer science |
36,593 | SampleRNN: An Unconditional End-to-End Neural Audio Generation Model | cs.SD | In this paper we propose a novel model for unconditional audio generation
based on generating one audio sample at a time. We show that our model, which
profits from combining memory-less modules, namely autoregressive multilayer
perceptrons, and stateful recurrent neural networks in a hierarchical structure
is able to ... | computer science |
36,594 | Curiosity-Aware Bargaining | cs.AI | Opponent modeling consists in modeling the strategy or preferences of an
agent thanks to the data it provides. In the context of automated negotiation
and with machine learning, it can result in an advantage so overwhelming that
it may restrain some casual agents to be part of the bargaining process. We
qualify as "cur... | computer science |
36,595 | Experimenting with recursive queries in database and logic programming
systems | cs.AI | This paper considers the problem of reasoning on massive amounts of (possibly
distributed) data. Presently, existing proposals show some limitations: {\em
(i)} the quantity of data that can be handled contemporarily is limited, due to
the fact that reasoning is generally carried out in main-memory; {\em (ii)} the
inter... | computer science |
36,596 | Direct Optimization of Ranking Measures | cs.IR | Web page ranking and collaborative filtering require the optimization of
sophisticated performance measures. Current Support Vector approaches are
unable to optimize them directly and focus on pairwise comparisons instead. We
present a new approach which allows direct optimization of the relevant loss
functions. This i... | computer science |
36,597 | General-Purpose Computing on a Semantic Network Substrate | cs.AI | This article presents a model of general-purpose computing on a semantic
network substrate. The concepts presented are applicable to any semantic
network representation. However, due to the standards and technological
infrastructure devoted to the Semantic Web effort, this article is presented
from this point of view. ... | computer science |
36,598 | An Adaptive Strategy for the Classification of G-Protein Coupled
Receptors | cs.AI | One of the major problems in computational biology is the inability of
existing classification models to incorporate expanding and new domain
knowledge. This problem of static classification models is addressed in this
paper by the introduction of incremental learning for problems in
bioinformatics. Many machine learni... | computer science |
36,599 | Performance Bounds for Lambda Policy Iteration and Application to the
Game of Tetris | cs.AI | We consider the discrete-time infinite-horizon optimal control problem
formalized by Markov Decision Processes. We revisit the work of Bertsekas and
Ioffe, that introduced $\lambda$ Policy Iteration, a family of algorithms
parameterized by $\lambda$ that generalizes the standard algorithms Value
Iteration and Policy It... | computer science |
36,600 | Computer Model of a "Sense of Humour". I. General Algorithm | cs.AI | A computer model of a "sense of humour" is proposed. The humorous effect is
interpreted as a specific malfunction in the course of information processing
due to the need for the rapid deletion of the false version transmitted into
consciousness. The biological function of a sense of humour consists in
speeding up the b... | computer science |
36,601 | Computer Model of a "Sense of Humour". II. Realization in Neural
Networks | cs.AI | The computer realization of a "sense of humour" requires the creation of an
algorithm for solving the "linguistic problem", i.e. the problem of recognizing
a continuous sequence of polysemantic images. Such algorithm may be realized in
the Hopfield model of a neural network after its proper modification. | computer science |
36,602 | Comparing the notions of optimality in CP-nets, strategic games and soft
constraints | cs.AI | The notion of optimality naturally arises in many areas of applied
mathematics and computer science concerned with decision making. Here we
consider this notion in the context of three formalisms used for different
purposes in reasoning about multi-agent systems: strategic games, CP-nets, and
soft constraints. To relat... | computer science |
36,603 | Exploration Of The Dendritic Cell Algorithm Using The Duration Calculus | cs.AI | As one of the newest members in Artificial Immune Systems (AIS), the
Dendritic Cell Algorithm (DCA) has been applied to a range of problems. These
applications mainly belong to the field of anomaly detection. However,
real-time detection, a new challenge to anomaly detection, requires improvement
on the real-time capab... | computer science |
36,604 | Agent Based Approaches to Engineering Autonomous Space Software | cs.MA | Current approaches to the engineering of space software such as satellite
control systems are based around the development of feedback controllers using
packages such as MatLab's Simulink toolbox. These provide powerful tools for
engineering real time systems that adapt to changes in the environment but are
limited whe... | computer science |
36,605 | Particle Filtering on the Audio Localization Manifold | cs.AI | We present a novel particle filtering algorithm for tracking a moving sound
source using a microphone array. If there are N microphones in the array, we
track all $N \choose 2$ delays with a single particle filter over time. Since
it is known that tracking in high dimensions is rife with difficulties, we
instead integr... | computer science |
36,606 | The role of semantics in mining frequent patterns from knowledge bases
in description logics with rules | cs.LO | We propose a new method for mining frequent patterns in a language that
combines both Semantic Web ontologies and rules. In particular we consider the
setting of using a language that combines description logics with DL-safe
rules. This setting is important for the practical application of data mining
to the Semantic W... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.