Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,007 | A Neural Network Classifier of Volume Datasets | cs.GR | Many state-of-the art visualization techniques must be tailored to the
specific type of dataset, its modality (CT, MRI, etc.), the recorded object or
anatomical region (head, spine, abdomen, etc.) and other parameters related to
the data acquisition process. While parts of the information (imaging modality
and acquisit... | computer science |
36,008 | What Does Artificial Life Tell Us About Death? | cs.AI | Short philosophical essay | computer science |
36,009 | Soft Constraints for Quality Aspects in Service Oriented Architectures | cs.AI | We propose the use of Soft Constraints as a natural way to model Service
Oriented Architecture. In the framework, constraints are used to model
components and connectors and constraint aggregation is used to represent their
interactions. The "quality of a service" is measured and considered when
performing queries to s... | computer science |
36,010 | Recommender Systems for the Conference Paper Assignment Problem | cs.IR | Conference paper assignment, i.e., the task of assigning paper submissions to
reviewers, presents multi-faceted issues for recommender systems research.
Besides the traditional goal of predicting `who likes what?', a conference
management system must take into account aspects such as: reviewer capacity
constraints, ade... | computer science |
36,011 | An Event Based Approach To Situational Representation | cs.DB | Many application domains require representing interrelated real-world
activities and/or evolving physical phenomena. In the crisis response domain,
for instance, one may be interested in representing the state of the unfolding
crisis (e.g., forest fire), the progress of the response activities such as
evacuation and tr... | computer science |
36,012 | On Chase Termination Beyond Stratification | cs.DB | We study the termination problem of the chase algorithm, a central tool in
various database problems such as the constraint implication problem,
Conjunctive Query optimization, rewriting queries using views, data exchange,
and data integration. The basic idea of the chase is, given a database instance
and a set of cons... | computer science |
36,013 | Constructive Decision Theory | cs.GT | In most contemporary approaches to decision making, a decision problem is
described by a sets of states and set of outcomes, and a rich set of acts,
which are functions from states to outcomes over which the decision maker (DM)
has preferences. Most interesting decision problems, however, do not come with
a state space... | computer science |
36,014 | Towards the Patterns of Hard CSPs with Association Rule Mining | cs.DB | The hardness of finite domain Constraint Satisfaction Problems (CSPs) is a
very important research area in Constraint Programming (CP) community. However,
this problem has not yet attracted much attention from the researchers in the
association rule mining community. As a popular data mining technique,
association rule... | computer science |
36,015 | Restricted Global Grammar Constraints | cs.AI | We investigate the global GRAMMAR constraint over restricted classes of
context free grammars like deterministic and unambiguous context-free grammars.
We show that detecting disentailment for the GRAMMAR constraint in these cases
is as hard as parsing an unrestricted context free grammar.We also consider the
class of ... | computer science |
36,016 | Query Significance in Databases via Randomizations | cs.DB | Many sorts of structured data are commonly stored in a multi-relational
format of interrelated tables. Under this relational model, exploratory data
analysis can be done by using relational queries. As an example, in the
Internet Movie Database (IMDb) a query can be used to check whether the average
rank of action movi... | computer science |
36,017 | Agent-Oriented Approach for Detecting and Managing Risks in Emergency
Situations | cs.AI | This paper presents an agent-oriented approach to build a decision support
system aimed at helping emergency managers to detect and to manage risks. We
stress the flexibility and the adaptivity characteristics that are crucial to
build a robust and efficient system, able to resolve complex problems. The
system should b... | computer science |
36,018 | How Controlled English can Improve Semantic Wikis | cs.HC | The motivation of semantic wikis is to make acquisition, maintenance, and
mining of formal knowledge simpler, faster, and more flexible. However, most
existing semantic wikis have a very technical interface and are restricted to a
relatively low level of expressivity. In this paper, we explain how AceWiki
uses controll... | computer science |
36,019 | Graph Theory and Optimization Problems for Very Large Networks | cs.NI | Graph theory provides a primary tool for analyzing and designing computer
communication networks. In the past few decades, Graph theory has been used to
study various types of networks, including the Internet, wide Area Networks,
Local Area Networks, and networking protocols such as border Gateway Protocol,
Open shorte... | computer science |
36,020 | Relativized hyperequivalence of logic programs for modular programming | cs.AI | A recent framework of relativized hyperequivalence of programs offers a
unifying generalization of strong and uniform equivalence. It seems to be
especially well suited for applications in program optimization and modular
programming due to its flexibility that allows us to restrict, independently of
each other, the he... | computer science |
36,021 | Graphical Probabilistic Routing Model for OBS Networks with Realistic
Traffic Scenario | cs.NI | Burst contention is a well-known challenging problem in Optical Burst
Switching (OBS) networks. Contention resolution approaches are always reactive
and attempt to minimize the BLR based on local information available at the
core node. On the other hand, a proactive approach that avoids burst losses
before they occur i... | computer science |
36,022 | Scaling Analysis of Affinity Propagation | cs.AI | We analyze and exploit some scaling properties of the Affinity Propagation
(AP) clustering algorithm proposed by Frey and Dueck (2007). First we observe
that a divide and conquer strategy, used on a large data set hierarchically
reduces the complexity ${\cal O}(N^2)$ to ${\cal O}(N^{(h+2)/(h+1)})$, for a
data-set of si... | computer science |
36,023 | State of the Art Review for Applying Computational Intelligence and
Machine Learning Techniques to Portfolio Optimisation | cs.CE | Computational techniques have shown much promise in the field of Finance,
owing to their ability to extract sense out of dauntingly complex systems. This
paper reviews the most promising of these techniques, from traditional
computational intelligence methods to their machine learning siblings, with
particular view to ... | computer science |
36,024 | An Agent Based Classification Model | cs.AI | The major function of this model is to access the UCI Wisconsin Breast Can-
cer data-set[1] and classify the data items into two categories, which are
normal and anomalous. This kind of classifi cation can be referred as anomaly
detection, which discriminates anomalous behaviour from normal behaviour in
computer system... | computer science |
36,025 | Faster Algorithms for Max-Product Message-Passing | cs.AI | Maximum A Posteriori inference in graphical models is often solved via
message-passing algorithms, such as the junction-tree algorithm, or loopy
belief-propagation. The exact solution to this problem is well known to be
exponential in the size of the model's maximal cliques after it is
triangulated, while approximate i... | computer science |
36,026 | Sum of Us: Strategyproof Selection from the Selectors | cs.GT | We consider directed graphs over a set of n agents, where an edge (i,j) is
taken to mean that agent i supports or trusts agent j. Given such a graph and
an integer k\leq n, we wish to select a subset of k agents that maximizes the
sum of indegrees, i.e., a subset of k most popular or most trusted agents. At
the same ti... | computer science |
36,027 | Named Models in Coalgebraic Hybrid Logic | cs.LO | Hybrid logic extends modal logic with support for reasoning about individual
states, designated by so-called nominals. We study hybrid logic in the broad
context of coalgebraic semantics, where Kripke frames are replaced with
coalgebras for a given functor, thus covering a wide range of reasoning
principles including, ... | computer science |
36,028 | Alternation-Trading Proofs, Linear Programming, and Lower Bounds | cs.CC | A fertile area of recent research has demonstrated concrete polynomial time
lower bounds for solving natural hard problems on restricted computational
models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path,
Mod6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs
of these low... | computer science |
36,029 | Abstract Answer Set Solvers with Learning | cs.AI | Nieuwenhuis, Oliveras, and Tinelli (2006) showed how to describe enhancements
of the Davis-Putnam-Logemann-Loveland algorithm using transition systems,
instead of pseudocode. We design a similar framework for several algorithms
that generate answer sets for logic programs: Smodels, Smodels-cc, Asp-Sat with
Learning (Cm... | computer science |
36,030 | ICD 10 Based Medical Expert System Using Fuzzy Temporal Logic | cs.AI | Medical diagnosis process involves many levels and considerable amount of
time and money are invariably spent for the first level of diagnosis usually
made by the physician for all the patients every time. Hence there is a need
for a computer based system which not only asks relevant questions to the
patients but also ... | computer science |
36,031 | Comparing Simulation Output Accuracy of Discrete Event and Agent Based
Models: A Quantitive Approach | cs.AI | In our research we investigate the output accuracy of discrete event
simulation models and agent based simulation models when studying human centric
complex systems. In this paper we focus on human reactive behaviour as it is
possible in both modelling approaches to implement human reactive behaviour in
the model by us... | computer science |
36,032 | A Little More, a Lot Better: Improving Path Quality by a Simple Path
Merging Algorithm | cs.RO | Sampling-based motion planners are an effective means for generating
collision-free motion paths. However, the quality of these motion paths (with
respect to quality measures such as path length, clearance, smoothness or
energy) is often notoriously low, especially in high-dimensional configuration
spaces. We introduce... | computer science |
36,033 | Detecting Botnets Through Log Correlation | cs.AI | Botnets, which consist of thousands of compromised machines, can cause
significant threats to other systems by launching Distributed Denial of Service
(SSoS) attacks, keylogging, and backdoors. In response to these threats, new
effective techniques are needed to detect the presence of botnets. In this
paper, we have us... | computer science |
36,034 | A Decidable Class of Nested Iterated Schemata (extended version) | cs.LO | Many problems can be specified by patterns of propositional formulae
depending on a parameter, e.g. the specification of a circuit usually depends
on the number of bits of its input. We define a logic whose formulae, called
"iterated schemata", allow to express such patterns. Schemata extend
propositional logic with in... | computer science |
36,035 | Janus: Automatic Ontology Builder from XSD Files | cs.DB | The construction of a reference ontology for a large domain still remains an
hard human task. The process is sometimes assisted by software tools that
facilitate the information extraction from a textual corpus. Despite of the
great use of XML Schema files on the internet and especially in the B2B domain,
tools that of... | computer science |
36,036 | Mining Knowledge in Astrophysical Massive Data Sets | cs.AI | Modern scientific data mainly consist of huge datasets gathered by a very
large number of techniques and stored in very diversified and often
incompatible data repositories. More in general, in the e-science environment,
it is considered as a critical and urgent requirement to integrate services
across distributed, het... | computer science |
36,037 | Use of Python and Phoenix-M Interface in Robotics | cs.RO | In this paper I will show how to use Python programming with a computer
interface such as Phoenix-M 1 to drive simple robots. In my quest towards
Artificial Intelligence(AI) I am experimenting with a lot of different
possibilities in Robotics. This one will try to mimic the working of a simple
insect's nervous system u... | computer science |
36,038 | A Factorial Experiment on Scalability of Search Based Software Testing | cs.SE | Software testing is an expensive process, which is vital in the industry.
Construction of the test-data in software testing requires the major cost and
to decide which method to use in order to generate the test data is important.
This paper discusses the efficiency of search-based algorithms (preferably
genetic algori... | computer science |
36,039 | Context Capture in Software Development | cs.SE | The context of a software developer is something hard to define and capture,
as it represents a complex network of elements across different dimensions that
are not limited to the work developed on an IDE. We propose the definition of a
software developer context model that takes into account all the dimensions
that ch... | computer science |
36,040 | Evolutionary Mechanics: new engineering principles for the emergence of
flexibility in a dynamic and uncertain world | nlin.AO | Engineered systems are designed to deftly operate under predetermined
conditions yet are notoriously fragile when unexpected perturbations arise. In
contrast, biological systems operate in a highly flexible manner; learn quickly
adequate responses to novel conditions, and evolve new routines/traits to
remain competitiv... | computer science |
36,041 | Adaptive Submodular Optimization under Matroid Constraints | cs.DS | Many important problems in discrete optimization require maximization of a
monotonic submodular function subject to matroid constraints. For these
problems, a simple greedy algorithm is guaranteed to obtain near-optimal
solutions. In this article, we extend this classic result to a general class of
adaptive optimizatio... | computer science |
36,042 | A Human-Centric Approach to Group-Based Context-Awareness | cs.AI | The emerging need for qualitative approaches in context-aware information
processing calls for proper modeling of context information and efficient
handling of its inherent uncertainty resulted from human interpretation and
usage. Many of the current approaches to context-awareness either lack a solid
theoretical basis... | computer science |
36,043 | A Simplified and Improved Free-Variable Framework for Hilbert's epsilon
as an Operator of Indefinite Committed Choice | cs.AI | Free variables occur frequently in mathematics and computer science with ad
hoc and altering semantics. We present the most recent version of our
free-variable framework for two-valued logics with properly improved
functionality, but only two kinds of free variables left (instead of three):
implicitly universally and i... | computer science |
36,044 | Kernels for Global Constraints | cs.AI | Bessiere et al. (AAAI'08) showed that several intractable global constraints
can be efficiently propagated when certain natural problem parameters are
small. In particular, the complete propagation of a global constraint is
fixed-parameter tractable in k - the number of holes in domains - whenever
bound consistency can... | computer science |
36,045 | Backdoors to Tractable Answer-Set Programming | cs.CC | Answer Set Programming (ASP) is an increasingly popular framework for
declarative programming that admits the description of problems by means of
rules and constraints that form a disjunctive logic program. In particular,
many AI problems such as reasoning in a nonmonotonic setting can be directly
formulated in ASP. Al... | computer science |
36,046 | Foundations for Uniform Interpolation and Forgetting in Expressive
Description Logics | cs.LO | We study uniform interpolation and forgetting in the description logic ALC.
Our main results are model-theoretic characterizations of uniform inter-
polants and their existence in terms of bisimula- tions, tight complexity
bounds for deciding the existence of uniform interpolants, an approach to
computing interpolants ... | computer science |
36,047 | Augmenting Tractable Fragments of Abstract Argumentation | cs.AI | We present a new and compelling approach to the efficient solution of
important computational problems that arise in the context of abstract
argumentation. Our approach makes known algorithms defined for restricted
fragments generally applicable, at a computational cost that scales with the
distance from the fragment. ... | computer science |
36,048 | Combining Ontology Development Methodologies and Semantic Web Platforms
for E-government Domain Ontology Development | cs.AI | One of the key challenges in electronic government (e-government) is the
development of systems that can be easily integrated and interoperated to
provide seamless services delivery to citizens. In recent years, Semantic Web
technologies based on ontology have emerged as promising solutions to the above
engineering pro... | computer science |
36,049 | Limits of Preprocessing | cs.AI | We present a first theoretical analysis of the power of polynomial-time
preprocessing for important combinatorial problems from various areas in AI. We
consider problems from Constraint Satisfaction, Global Constraints,
Satisfiability, Nonmonotonic and Bayesian Reasoning. We show that, subject to a
complexity theoretic... | computer science |
36,050 | Exhaustive Search-based Model for Hybrid Sensor Network | cs.AI | A new model for a cluster of hybrid sensors network with multi sub-clusters
is proposed. The model is in particular relevant to the early warning system in
a large scale monitoring system in, for example, a nuclear power plant. It
mainly addresses to a safety critical system which requires real-time processes
with high... | computer science |
36,051 | Feature Subset Selection for Software Cost Modelling and Estimation | cs.SE | Feature selection has been recently used in the area of software engineering
for improving the accuracy and robustness of software cost models. The idea
behind selecting the most informative subset of features from a pool of
available cost drivers stems from the hypothesis that reducing the
dimensionality of datasets w... | computer science |
36,052 | Elegant Object-oriented Software Design via Interactive, Evolutionary
Computation | cs.SE | Design is fundamental to software development but can be demanding to
perform. Thus to assist the software designer, evolutionary computing is being
increasingly applied using machine-based, quantitative fitness functions to
evolve software designs. However, in nature, elegance and symmetry play a
crucial role in the r... | computer science |
36,053 | Intelligent Search Heuristics for Cost Based Scheduling | cs.AI | Nurse scheduling is a difficult optimization problem with multiple
constraints. There is extensive research in the literature solving the problem
using meta-heuristics approaches. In this paper, we will investigate an
intelligent search heuristics that handles cost based scheduling problem. The
heuristics demonstrated ... | computer science |
36,054 | Relative Expressiveness of Defeasible Logics | cs.AI | We address the relative expressiveness of defeasible logics in the framework
DL. Relative expressiveness is formulated as the ability to simulate the
reasoning of one logic within another logic. We show that such simulations must
be modular, in the sense that they also work if applied only to part of a
theory, in order... | computer science |
36,055 | An efficient algorithm for estimating state sequences in imprecise
hidden Markov models | cs.AI | We present an efficient exact algorithm for estimating state sequences from
outputs (or observations) in imprecise hidden Markov models (iHMM), where both
the uncertainty linking one state to the next, and that linking a state to its
output, are represented using coherent lower previsions. The notion of
independence we... | computer science |
36,056 | D-FLAT: Declarative Problem Solving Using Tree Decompositions and
Answer-Set Programming | cs.AI | In this work, we propose Answer-Set Programming (ASP) as a tool for rapid
prototyping of dynamic programming algorithms based on tree decompositions. In
fact, many such algorithms have been designed, but only a few of them found
their way into implementation. The main obstacle is the lack of easy-to-use
systems which (... | computer science |
36,057 | Annotating Answer-Set Programs in LANA? | cs.SE | While past research in answer-set programming (ASP) mainly focused on theory,
ASP solver technology, and applications, the present work situates itself in
the context of a quite recent research trend: development support for ASP. In
particular, we propose to augment answer-set programs with additional
meta-information ... | computer science |
36,058 | Disjunctive Datalog with Existential Quantifiers: Semantics,
Decidability, and Complexity Issues | cs.AI | Datalog is one of the best-known rule-based languages, and extensions of it
are used in a wide context of applications. An important Datalog extension is
Disjunctive Datalog, which significantly increases the expressivity of the
basic language. Disjunctive Datalog is useful in a wide range of applications,
ranging from... | computer science |
36,059 | Simulated Tom Thumb, the Rule Of Thumb for Autonomous Robots | cs.RO | For a mobile robot to be truly autonomous, it must solve the simultaneous
localization and mapping (SLAM) problem. We develop a new metaheuristic
algorithm called Simulated Tom Thumb (STT), based on the detailed adventure of
the clever Tom Thumb and advances in researches relating to path planning based
on potential fu... | computer science |
36,060 | Distributional Framework for Emergent Knowledge Acquisition and its
Application to Automated Document Annotation | cs.AI | The paper introduces a framework for representation and acquisition of
knowledge emerging from large samples of textual data. We utilise a
tensor-based, distributional representation of simple statements extracted from
text, and show how one can use the representation to infer emergent knowledge
patterns from the textu... | computer science |
36,061 | Introduction to the 28th International Conference on Logic Programming
Special Issue | cs.PL | We are proud to introduce this special issue of the Journal of Theory and
Practice of Logic Programming (TPLP), dedicated to the full papers accepted for
the 28th International Conference on Logic Programming (ICLP). The ICLP
meetings started in Marseille in 1982 and since then constitute the main venue
for presenting ... | computer science |
36,062 | An example illustrating the imprecision of the efficient approach for
diagnosis of Petri nets via integer linear programming | cs.SY | This document demonstrates that the efficient approach for diagnosis of Petri
nets via integer linear programming may be unable to detect a fault even if the
system is diagnosable. | computer science |
36,063 | Causal Inference by Surrogate Experiments: z-Identifiability | cs.AI | We address the problem of estimating the effect of intervening on a set of
variables X from experiments on a different set, Z, that is more accessible to
manipulation. This problem, which we call z-identifiability, reduces to
ordinary identifiability when Z = empty and, like the latter, can be given
syntactic character... | computer science |
36,064 | The Do-Calculus Revisited | cs.AI | The do-calculus was developed in 1995 to facilitate the identification of
causal effects in non-parametric models. The completeness proofs of [Huang and
Valtorta, 2006] and [Shpitser and Pearl, 2006] and the graphical criteria of
[Tian and Shpitser, 2010] have laid this identification problem to rest. Recent
exploratio... | computer science |
36,065 | Scaling Up Decentralized MDPs Through Heuristic Search | cs.AI | Decentralized partially observable Markov decision processes (Dec-POMDPs) are
rich models for cooperative decision-making under uncertainty, but are often
intractable to solve optimally (NEXP-complete). The transition and observation
independent Dec-MDP is a general subclass that has been shown to have
complexity in NP... | computer science |
36,066 | A Bayesian Approach to Constraint Based Causal Inference | cs.AI | We target the problem of accuracy and robustness in causal inference from
finite data sets. Some state-of-the-art algorithms produce clear output
complete with solid theoretical guarantees but are susceptible to propagating
erroneous decisions, while others are very adept at handling and representing
uncertainty, but n... | computer science |
36,067 | Dynamic Stochastic Orienteering Problems for Risk-Aware Applications | cs.AI | Orienteering problems (OPs) are a variant of the well-known prize-collecting
traveling salesman problem, where the salesman needs to choose a subset of
cities to visit within a given deadline. OPs and their extensions with
stochastic travel times (SOPs) have been used to model vehicle routing problems
and tourist trip ... | computer science |
36,068 | Exploiting Structure in Cooperative Bayesian Games | cs.GT | Cooperative Bayesian games (BGs) can model decision-making problems for teams
of agents under imperfect information, but require space and computation time
that is exponential in the number of agents. While agent independence has been
used to mitigate these problems in perfect information settings, we propose a
novel a... | computer science |
36,069 | Heuristic Ranking in Tightly Coupled Probabilistic Description Logics | cs.AI | The Semantic Web effort has steadily been gaining traction in the recent
years. In particular,Web search companies are recently realizing that their
products need to evolve towards having richer semantic search capabilities.
Description logics (DLs) have been adopted as the formal underpinnings for
Semantic Web languag... | computer science |
36,070 | Probability and Asset Updating using Bayesian Networks for Combinatorial
Prediction Markets | cs.AI | A market-maker-based prediction market lets forecasters aggregate information
by editing a consensus probability distribution either directly or by trading
securities that pay off contingent on an event of interest. Combinatorial
prediction markets allow trading on any event that can be specified as a
combination of a ... | computer science |
36,071 | Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing | cs.AI | We consider the linear programming relaxation of an energy minimization
problem for Markov Random Fields. The dual objective of this problem can be
treated as a concave and unconstrained, but non-smooth function. The idea of
smoothing the objective prior to optimization was recently proposed in a series
of papers. Some... | computer science |
36,072 | From imprecise probability assessments to conditional probabilities with
quasi additive classes of conditioning events | cs.AI | In this paper, starting from a generalized coherent (i.e. avoiding uniform
loss) intervalvalued probability assessment on a finite family of conditional
events, we construct conditional probabilities with quasi additive classes of
conditioning events which are consistent with the given initial assessment.
Quasi additiv... | computer science |
36,073 | Creating a level playing field for all symbols in a discretization | cs.DS | In time series analysis research there is a strong interest in discrete
representations of real valued data streams. One approach that emerged over a
decade ago and is still considered state-of-the-art is the Symbolic Aggregate
Approximation algorithm. This discretization algorithm was the first symbolic
approach that ... | computer science |
36,074 | Module Theorem for The General Theory of Stable Models | cs.AI | The module theorem by Janhunen et al. demonstrates how to provide a modular
structure in answer set programming, where each module has a well-defined
input/output interface which can be used to establish the compositionality of
answer sets. The theorem is useful in the analysis of answer set programs, and
is a basis of... | computer science |
36,075 | Wikipedia Vandalism Detection Through Machine Learning: Feature Review
and New Proposals: Lab Report for PAN at CLEF 2010 | cs.IR | Wikipedia is an online encyclopedia that anyone can edit. In this open model,
some people edits with the intent of harming the integrity of Wikipedia. This
is known as vandalism. We extend the framework presented in (Potthast, Stein,
and Gerling, 2008) for Wikipedia vandalism detection. In this approach, several
vandal... | computer science |
36,076 | Improved Local Search in Artificial Bee Colony using Golden Section
Search | cs.AI | Artificial bee colony (ABC), an optimization algorithm is a recent addition
to the family of population based search algorithm. ABC has taken its
inspiration from the collective intelligent foraging behavior of honey bees. In
this study we have incorporated golden section search mechanism in the
structure of basic ABC ... | computer science |
36,077 | Illustrating a neural model of logic computations: The case of Sherlock
Holmes' old maxim | cs.AI | Natural languages can express some logical propositions that humans are able
to understand. We illustrate this fact with a famous text that Conan Doyle
attributed to Holmes: 'It is an old maxim of mine that when you have excluded
the impossible, whatever remains, however improbable, must be the truth'. This
is a subtle... | computer science |
36,078 | A Superposition Calculus for Abductive Reasoning | cs.LO | We present a modification of the superposition calculus that is meant to
generate consequences of sets of first-order axioms. This approach is proven to
be sound and deductive-complete in the presence of redundancy elimination
rules, provided the considered consequences are built on a given finite set of
ground terms, ... | computer science |
36,079 | Query Answering over Contextualized RDF/OWL Knowledge with
Forall-Existential Bridge Rules: Attaining Decidability using Acyclicity
(full version) | cs.LO | The recent outburst of context-dependent knowledge on the Semantic Web (SW)
has led to the realization of the importance of the quads in the SW community.
Quads, which extend a standard RDF triple, by adding a new parameter of the
`context' of an RDF triple, thus informs a reasoner to distinguish between the
knowledge ... | computer science |
36,080 | A Methodology for Empirical Analysis of LOD Datasets | cs.AI | CoCoE stands for Complexity, Coherence and Entropy, and presents an
extensible methodology for empirical analysis of Linked Open Data (i.e., RDF
graphs). CoCoE can offer answers to questions like: Is dataset A better than B
for knowledge discovery since it is more complex and informative?, Is dataset X
better than Y fo... | computer science |
36,081 | A self-organizing system for urban traffic control based on predictive
interval microscopic model | cs.AI | This paper introduces a self-organizing traffic signal system for an urban
road network. The key elements of this system are agents that control traffic
signals at intersections. Each agent uses an interval microscopic traffic model
to predict effects of its possible control actions in a short time horizon. The
execute... | computer science |
36,082 | On the satisfiability problem for SPARQL patterns | cs.DB | The satisfiability problem for SPARQL patterns is undecidable in general,
since the expressive power of SPARQL 1.0 is comparable with that of the
relational algebra. The goal of this paper is to delineate the boundary of
decidability of satisfiability in terms of the constraints allowed in filter
conditions. The classe... | computer science |
36,083 | Initial Experiments with TPTP-style Automated Theorem Provers on ACL2
Problems | cs.AI | This paper reports our initial experiments with using external ATP on some
corpora built with the ACL2 system. This is intended to provide the first
estimate about the usefulness of such external reasoning and AI systems for
solving ACL2 problems. | computer science |
36,084 | Changing the Environment Based on Empowerment as Intrinsic Motivation | cs.AI | One aspect of intelligence is the ability to restructure your own environment
so that the world you live in becomes more beneficial to you. In this paper we
investigate how the information-theoretic measure of agent empowerment can
provide a task-independent, intrinsic motivation to restructure the world. We
show how c... | computer science |
36,085 | An exact and two heuristic strategies for truthful bidding in
combinatorial transport auctions | cs.GT | To support a freight carrier in a combinatorial transport auction, we
proposes an exact and two heuristic strategies for bidding on subsets of
requests. The exact bidding strategy is based on the concept of elementary
request combinations. We show that it is sufficient and necessary for a carrier
to bid on each element... | computer science |
36,086 | Tableaux for Dynamic Logic of Propositional Assignments | cs.LO | The Dynamic Logic for Propositional Assignments (DL-PA) has recently been
studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the
abstract atomic programs of PDL are replaced by assignments of propositional
variables to truth values. This makes DL-PA enjoy some interesting meta-logical
properties ... | computer science |
36,087 | Fault-Tolerant, but Paradoxical Path-Finding in Physical and Conceptual
Systems | cs.SE | We report our initial investigations into reliability and path-finding based
models and propose future areas of interest. Inspired by broken sidewalks
during on-campus construction projects, we develop two models for navigating
this "unreliable network." These are based on a concept of "accumulating risk"
backward from... | computer science |
36,088 | Conjunction and Negation of Natural Concepts: A Quantum-theoretic
Modeling | cs.AI | We perform two experiments with the aim to investigate the effects of
negation on the combination of natural concepts. In the first experiment, we
test the membership weights of a list of exemplars with respect to two
concepts, e.g., {\it Fruits} and {\it Vegetables}, and their conjunction {\it
Fruits And Vegetables}. ... | computer science |
36,089 | Music and Vocal Separation Using Multi-Band Modulation Based Features | cs.SD | The potential use of non-linear speech features has not been investigated for
music analysis although other commonly used speech features like Mel Frequency
Ceptral Coefficients (MFCC) and pitch have been used extensively. In this
paper, we assume an audio signal to be a sum of modulated sinusoidal and then
use the ene... | computer science |
36,090 | The Effect of Social Learning on Individual Learning and Evolution | cs.AI | We consider the effects of social learning on the individual learning and
genetic evolution of a colony of artificial agents capable of genetic,
individual and social modes of adaptation. We confirm that there is strong
selection pressure to acquire traits of individual learning and social learning
when these are adapt... | computer science |
36,091 | Quantum POMDPs | cs.AI | We present quantum observable Markov decision processes (QOMDPs), the quantum
analogues of partially observable Markov decision processes (POMDPs). In a
QOMDP, an agent's state is represented as a quantum state and the agent can
choose a superoperator to apply. This is similar to the POMDP belief state,
which is a prob... | computer science |
36,092 | Algorithms for CVaR Optimization in MDPs | cs.AI | In many sequential decision-making problems we may want to manage risk by
minimizing some measure of variability in costs in addition to minimizing a
standard criterion. Conditional value-at-risk (CVaR) is a relatively new risk
measure that addresses some of the shortcomings of the well-known
variance-related risk meas... | computer science |
36,093 | Eigenspace Method for Spatiotemporal Hotspot Detection | cs.AI | Hotspot detection aims at identifying subgroups in the observations that are
unexpected, with respect to the some baseline information. For instance, in
disease surveillance, the purpose is to detect sub-regions in spatiotemporal
space, where the count of reported diseases (e.g. Cancer) is higher than
expected, with re... | computer science |
36,094 | CCCP Algorithms to Minimize the Bethe free energy of 3-SAT Problem | cs.AI | The k-sat problem is a prototypical constraint satisfaction problem. There
are many algorithms to study k-sat problem, BP algorithm is famous one of them.
But BP algorithm does not converge when $\alpha$(constraint density)is bigger
than some threshold value. In this paper we use CCCP (Concave Convex Procedure)
algorit... | computer science |
36,095 | Automatic Channel Fault Detection and Diagnosis System for a Small
Animal APD-Based Digital PET Scanner | cs.AI | Fault detection and diagnosis is critical to many applications in order to
ensure proper operation and performance over time. Positron emission tomography
(PET) systems that require regular calibrations by qualified scanner operators
are good candidates for such continuous improvements. Furthermore, for scanners
employ... | computer science |
36,096 | Acyclicity Notions for Existential Rules and Their Application to Query
Answering in Ontologies | cs.DB | Answering conjunctive queries (CQs) over a set of facts extended with
existential rules is a prominent problem in knowledge representation and
databases. This problem can be solved using the chase algorithm, which extends
the given set of facts with fresh facts in order to satisfy the rules. If the
chase terminates, th... | computer science |
36,097 | Identifying roles of clinical pharmacy with survey evaluation | cs.AI | The survey data sets are important sources of data and their successful
exploitation is of key importance for informed policy-decision making. We
present how a survey analysis approach initially developed for customer
satisfaction research in marketing can be adapted for the introduction of
clinical pharmacy services i... | computer science |
36,098 | Automatic Fado Music Classification | cs.SD | In late 2011, Fado was elevated to the oral and intangible heritage of
humanity by UNESCO. This study aims to develop a tool for automatic detection
of Fado music based on the audio signal. To do this, frequency spectrum-related
characteristics were captured form the audio signal: in addition to the Mel
Frequency Cepst... | computer science |
36,099 | The Propagation Depth of Local Consistency | cs.AI | We establish optimal bounds on the number of nested propagation steps in
$k$-consistency tests. It is known that local consistency algorithms such as
arc-, path- and $k$-consistency are not efficiently parallelizable. Their
inherent sequential nature is caused by long chains of nested propagation
steps, which cannot be... | computer science |
36,100 | Architecture of a Fuzzy Expert System Used for Dyslalic Children Therapy | cs.AI | In this paper we present architecture of a fuzzy expert system used for
therapy of dyslalic children. With fuzzy approach we can create a better model
for speech therapist decisions. A software interface was developed for
validation of the system. The main objectives of this task are: personalized
therapy (the therapy ... | computer science |
36,101 | Low-Autocorrelation Binary Sequences: On Improved Merit Factors and
Runtime Predictions to Achieve Them | cs.DS | The search for binary sequences with a high figure of merit, known as the low
autocorrelation binary sequence ($labs$}) problem, represents a formidable
computational challenge. To mitigate the computational constraints of the
problem, we consider solvers that accept odd values of sequence length $L$ and
return solutio... | computer science |
36,102 | Cognitive Surveillance: Why does it never appear among the AVSS
Conferences topics? | cs.AI | Video Surveillance is a fast evolving field of research and development (R&D)
driven by the urgent need for public security and safety (due to the growing
threats of terrorism, vandalism, and anti-social behavior). Traditionally,
surveillance systems are comprised of two components - video cameras
distributed over the ... | computer science |
36,103 | SROIQsigma is decidable | cs.LO | We consider a dynamic extension of the description logic $\mathcal{SROIQ}$.
This means that interpretations could evolve thanks to some actions such as
addition and/or deletion of an element (respectively, a pair of elements) of a
concept (respectively, of a role). The obtained logic is called
$\mathcal{SROIQ}$ with ex... | computer science |
36,104 | Pattern-wave model of brain. Mechanisms of information processing,
memory organization | cs.AI | The structure of the axon-dendrite connections of neurons of the brain
creates a rich spatial structure in which provided various combinations of
signals surrounding neurons. Structure of dendritic trees and shape of
dendritic spines allow repeatedly increase combinatorial component through
cross synapses influence nei... | computer science |
36,105 | Linearized and Single-Pass Belief Propagation | cs.DB | How can we tell when accounts are fake or real in a social network? And how
can we tell which accounts belong to liberal, conservative or centrist users?
Often, we can answer such questions and label nodes in a network based on the
labels of their neighbors and appropriate assumptions of homophily ("birds of a
feather ... | computer science |
36,106 | An Efficient Hybrid CS and K-Means Algorithm for the Capacitated PMedian
Problem | math.OC | Capacitated p-median problem (CPMP) is an important variation of facility
location problem in which p capacitated medians are economically selected to
serve a set of demand vertices so that the total assigned demand to each of the
candidate medians must not exceed its capacity. This paper surveys and analyses
the combi... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.