Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
37,207 | Fairness as a Program Property | cs.PL | We explore the following question: Is a decision-making program fair, for
some useful definition of fairness? First, we describe how several algorithmic
fairness questions can be phrased as program verification problems. Second, we
discuss an automated verification technique for proving or disproving fairness
of decisi... | computer science |
37,208 | Maximizing positive opinion influence using an evidential approach | cs.SI | In this paper, we propose a new data based model for influence maximization
in online social networks. We use the theory of belief functions to overcome
the data imperfection problem. Besides, the proposed model searches to detect
influencer users that adopt a positive opinion about the product, the idea,
etc, to be pr... | computer science |
37,209 | Artificial Intelligence Safety and Cybersecurity: a Timeline of AI
Failures | cs.AI | In this work, we present and analyze reported failures of artificially
intelligent systems and extrapolate our analysis to future AIs. We suggest that
both the frequency and the seriousness of future AI failures will steadily
increase. AI Safety can be improved based on ideas developed by cybersecurity
experts. For nar... | computer science |
37,210 | A Physician Advisory System for Chronic Heart Failure Management Based
on Knowledge Patterns | cs.AI | Management of chronic diseases such as heart failure, diabetes, and chronic
obstructive pulmonary disease (COPD) is a major problem in health care. A
standard approach that the medical community has devised to manage widely
prevalent chronic diseases such as chronic heart failure (CHF) is to have a
committee of experts... | computer science |
37,211 | Integrating Topic Models and Latent Factors for Recommendation | cs.IR | The research of personalized recommendation techniques today has mostly
parted into two mainstream directions, i.e., the factorization-based approaches
and topic models. Practically, they aim to benefit from the numerical ratings
and textual reviews, correspondingly, which compose two major information
sources in vario... | computer science |
37,212 | Probabilistic Model Checking for Complex Cognitive Tasks -- A case study
in human-robot interaction | cs.AI | This paper proposes to use probabilistic model checking to synthesize optimal
robot policies in multi-tasking autonomous systems that are subject to
human-robot interaction. Given the convincing empirical evidence that human
behavior can be related to reinforcement models, we take as input a
well-studied Q-table model ... | computer science |
37,213 | From Node Embedding To Community Embedding | cs.SI | Most of the existing graph embedding methods focus on nodes, which aim to
output a vector representation for each node in the graph such that two nodes
being "close" on the graph are close too in the low-dimensional space. Despite
the success of embedding individual nodes for graph analytics, we notice that
an importan... | computer science |
37,214 | Towards Lifelong Self-Supervision: A Deep Learning Direction for
Robotics | cs.RO | Despite outstanding success in vision amongst other domains, many of the
recent deep learning approaches have evident drawbacks for robots. This
manuscript surveys recent work in the literature that pertain to applying deep
learning systems to the robotics domain, either as means of estimation or as a
tool to resolve m... | computer science |
37,215 | Towards Blended Reactive Planning and Acting using Behavior Trees | cs.RO | In this paper, we study the problem of using a planning algorithm to
automatically create and update a Behavior Tree (BT), controlling a robot in a
dynamic environment. Exploiting the characteristic of BTs, in terms of
modularity and reactivity, the robot continually acts and plans to achieve a
given goal using a set o... | computer science |
37,216 | Detecting Affordances by Visuomotor Simulation | cs.AI | The term "affordance" denotes the behavioral meaning of objects. We propose a
cognitive architecture for the detection of affordances in the visual modality.
This model is based on the internal simulation of movement sequences. For each
movement step, the resulting sensory state is predicted by a forward model,
which i... | computer science |
37,217 | Predicting Domain Generation Algorithms with Long Short-Term Memory
Networks | cs.CR | Various families of malware use domain generation algorithms (DGAs) to
generate a large number of pseudo-random domain names to connect to a command
and control (C&C) server. In order to block DGA C&C traffic, security
organizations must first discover the algorithm by reverse engineering malware
samples, then generati... | computer science |
37,218 | QBF Solving by Counterexample-guided Expansion | cs.LO | We introduce a novel generalization of Counterexample-Guided Inductive
Synthesis (CEGIS) and instantiate it to yield a novel, competitive algorithm
for solving Quantified Boolean Formulas (QBF). Current QBF solvers based on
counterexample-guided expansion use a recursive approach which scales poorly
with the number of ... | computer science |
37,219 | Causes for Query Answers from Databases: Datalog Abduction,
View-Updates, and Integrity Constraints | cs.DB | Causality has been recently introduced in databases, to model, characterize,
and possibly compute causes for query answers. Connections between QA-causality
and consistency-based diagnosis and database repairs (wrt. integrity constraint
violations) have already been established. In this work we establish precise
connec... | computer science |
37,220 | Neuro-Symbolic Program Synthesis | cs.AI | Recent years have seen the proposal of a number of neural architectures for
the problem of Program Induction. Given a set of input-output examples, these
architectures are able to learn mappings that generalize to new test inputs.
While achieving impressive results, these approaches have a number of important
limitatio... | computer science |
37,221 | Song From PI: A Musically Plausible Network for Pop Music Generation | cs.SD | We present a novel framework for generating pop music. Our model is a
hierarchical Recurrent Neural Network, where the layers and the structure of
the hierarchy encode our prior knowledge about how pop music is composed. In
particular, the bottom layers generate the melody, while the higher levels
produce the drums and... | computer science |
37,222 | Applying Chatbots to the Internet of Things: Opportunities and
Architectural Elements | cs.AI | Internet of Things (IoT) is emerging as a significant technology in shaping
the future by connecting physical devices or things with internet. It also
presents various opportunities for intersection of other technological trends
which can allow it to become even more intelligent and efficient. In this paper
we focus ou... | computer science |
37,223 | Learning to Gather Information via Imitation | cs.RO | The budgeted information gathering problem - where a robot with a fixed fuel
budget is required to maximize the amount of information gathered from the
world - appears in practice across a wide range of applications in autonomous
exploration and inspection with mobile robots. Although there is an extensive
amount of pr... | computer science |
37,224 | Feature Engineering and Ensemble Modeling for Paper Acceptance Rank
Prediction | cs.AI | Measuring research impact and ranking academic achievement are important and
challenging problems. Having an objective picture of research institution is
particularly valuable for students, parents and funding agencies, and also
attracts attention from government and industry. KDD Cup 2016 proposes the
paper acceptance... | computer science |
37,225 | Causal Inference in Observational Data | cs.AI | Our aging population increasingly suffers from multiple chronic diseases
simultaneously, necessitating the comprehensive treatment of these conditions.
Finding the optimal set of drugs for a combinatorial set of diseases is a
combinatorial pattern exploration problem. Association rule mining is a popular
tool for such ... | computer science |
37,226 | The NOESIS Network-Oriented Exploration, Simulation, and Induction
System | cs.SI | Network data mining has become an important area of study due to the large
number of problems it can be applied to. This paper presents NOESIS, an open
source framework for network data mining that provides a large collection of
network analysis techniques, including the analysis of network structural
properties, commu... | computer science |
37,227 | An integrated Graphical User Interface for Debugging Answer Set Programs | cs.AI | Answer Set Programming (ASP) is an expressive knowledge representation and
reasoning framework. Due to its rather simple syntax paired with
high-performance solvers, ASP is interesting for industrial applications.
However, to err is human and thus debugging is an important activity during the
development process. There... | computer science |
37,228 | The Effects of Relative Importance of User Constraints in Cloud of
Things Resource Discovery: A Case Study | cs.AI | Over the last few years, the number of smart objects connected to the
Internet has grown exponentially in comparison to the number of services and
applications. The integration between Cloud Computing and Internet of Things,
named as Cloud of Things, plays a key role in managing the connected things,
their data and ser... | computer science |
37,229 | Variable Neighborhood Search Algorithms for the multi-depot dial-a-ride
problem with heterogeneous vehicles and users | cs.DM | In this work, a study on Variable Neighborhood Search algorithms for
multi-depot dial-a-ride problems is presented. In dial-a-ride problems patients
need to be transported from pre-specified pickup locations to pre-specified
delivery locations, under different considerations. The addressed problem
presents several cons... | computer science |
37,230 | Explicablility as Minimizing Distance from Expected Behavior | cs.AI | In order to have effective human AI collaboration, it is not simply enough to
address the question of autonomy; an equally important question is, how the
AI's behavior is being perceived by their human counterparts. When AI agent's
task plans are generated without such considerations, they may often
demonstrate inexpli... | computer science |
37,231 | Stream Packing for Asynchronous Multi-Context Systems using ASP | cs.LO | When a processing unit relies on data from external streams, we may face the
problem that the stream data needs to be rearranged in a way that allows the
unit to perform its task(s). On arrival of new data, we must decide whether
there is sufficient information available to start processing or whether to
wait for more ... | computer science |
37,232 | NCBO Ontology Recommender 2.0: An Enhanced Approach for Biomedical
Ontology Recommendation | cs.AI | Biomedical researchers use ontologies to annotate their data with ontology
terms, enabling better data integration and interoperability. However, the
number, variety and complexity of current biomedical ontologies make it
cumbersome for researchers to determine which ones to reuse for their specific
needs. To overcome ... | computer science |
37,233 | Team-maxmin equilibrium: efficiency bounds and algorithms | cs.AI | The Team-maxmin equilibrium prescribes the optimal strategies for a team of
rational players sharing the same goal and without the capability of
correlating their strategies in strategic games against an adversary. This
solution concept can capture situations in which an agent controls multiple
resources-corresponding ... | computer science |
37,234 | Enforcing Relational Matching Dependencies with Datalog for Entity
Resolution | cs.DB | Entity resolution (ER) is about identifying and merging records in a database
that represent the same real-world entity. Matching dependencies (MDs) have
been introduced and investigated as declarative rules that specify ER policies.
An ER process induced by MDs over a dirty instance leads to multiple clean
instances, ... | computer science |
37,235 | Randomized Mechanisms for Selling Reserved Instances in Cloud | cs.GT | Selling reserved instances (or virtual machines) is a basic service in cloud
computing. In this paper, we consider a more flexible pricing model for
instance reservation, in which a customer can propose the time length and
number of resources of her request, while in today's industry, customers can
only choose from sev... | computer science |
37,236 | Efficient Delivery Policy to Minimize User Traffic Consumption in
Guaranteed Advertising | cs.DS | In this work, we study the guaranteed delivery model which is widely used in
online display advertising. In the guaranteed delivery scenario, ad exposures
(which are also called impressions in some works) to users are guaranteed by
contracts signed in advance between advertisers and publishers. A crucial
problem for th... | computer science |
37,237 | Optimizing Expectation with Guarantees in POMDPs (Technical Report) | cs.AI | A standard objective in partially-observable Markov decision processes
(POMDPs) is to find a policy that maximizes the expected discounted-sum payoff.
However, such policies may still permit unlikely but highly undesirable
outcomes, which is problematic especially in safety-critical applications.
Recently, there has be... | computer science |
37,238 | Embedded Bandits for Large-Scale Black-Box Optimization | cs.AI | Random embedding has been applied with empirical success to large-scale
black-box optimization problems with low effective dimensions. This paper
proposes the EmbeddedHunter algorithm, which incorporates the technique in a
hierarchical stochastic bandit setting, following the optimism in the face of
uncertainty princip... | computer science |
37,239 | Blocking and Other Enhancements for Bottom-Up Model Generation Methods | cs.AI | Model generation is a problem complementary to theorem proving and is
important for fault analysis and debugging of formal specifications of security
protocols, programs and terminological definitions. This paper discusses
several ways of enhancing the paradigm of bottom-up model generation. The two
main contributions ... | computer science |
37,240 | Maximizing Non-Monotone DR-Submodular Functions with Cardinality
Constraints | cs.DS | We consider the problem of maximizing a non-monotone DR-submodular function
subject to a cardinality constraint. Diminishing returns (DR) submodularity is
a generalization of the diminishing returns property for functions defined over
the integer lattice. This generalization can be used to solve many machine
learning o... | computer science |
37,241 | Learning Filter Banks Using Deep Learning For Acoustic Signals | cs.SD | Designing appropriate features for acoustic event recognition tasks is an
active field of research. Expressive features should both improve the
performance of the tasks and also be interpret-able. Currently, heuristically
designed features based on the domain knowledge requires tremendous effort in
hand-crafting, while... | computer science |
37,242 | Choquet integral in decision analysis - lessons from the axiomatization | cs.AI | The Choquet integral is a powerful aggregation operator which lists many
well-known models as its special cases. We look at these special cases and
provide their axiomatic analysis. In cases where an axiomatization has been
previously given in the literature, we connect the existing results with the
framework that we h... | computer science |
37,243 | Contextualizing Geometric Data Analysis and Related Data Analytics: A
Virtual Microscope for Big Data Analytics | cs.AI | The relevance and importance of contextualizing data analytics is described.
Qualitative characteristics might form the context of quantitative analysis.
Topics that are at issue include: contrast, baselining, secondary data sources,
supplementary data sources, dynamic and heterogeneous data. In geometric data
analysis... | computer science |
37,244 | Fusion of EEG and Musical Features in Continuous Music-emotion
Recognition | cs.AI | Emotion estimation in music listening is confronting challenges to capture
the emotion variation of listeners. Recent years have witnessed attempts to
exploit multimodality fusing information from musical contents and
physiological signals captured from listeners to improve the performance of
emotion recognition. In th... | computer science |
37,245 | Comparing Apples and Oranges: Two Examples of the Limits of Statistical
Inference, With an Application to Google Advertising Markets | stat.AP | We show how the classic Cramer-Rao bound limits how accurately one can
simultaneously estimate values of a large number of Google Ad campaigns (or
similarly limit the measurement rate of many confounding A/B tests). | computer science |
37,246 | Digital Advertising Traffic Operation: Machine Learning for Process
Discovery | cs.CY | In a Web Advertising Traffic Operation it's necessary to manage the
day-to-day trafficking, pacing and optimization of digital and paid social
campaigns. The data analyst on Traffic Operation can not only quickly provide
answers but also speaks the language of the Process Manager and visually
displays the discovered pr... | computer science |
37,247 | Learning Weighted Association Rules in Human Phenotype Ontology | cs.AI | The Human Phenotype Ontology (HPO) is a structured repository of concepts
(HPO Terms) that are associated to one or more diseases. The process of
association is referred to as annotation. The relevance and the specificity of
both HPO terms and annotations are evaluated by a measure defined as
Information Content (IC). ... | computer science |
37,248 | Truthful Facility Location with Additive Errors | cs.GT | We address the problem of locating facilities on the $[0,1]$ interval based
on reports from strategic agents. The cost of each agent is her distance to the
closest facility, and the global objective is to minimize either the maximum
cost of an agent or the social cost.
As opposed to the extensive literature on facili... | computer science |
37,249 | A pre-semantics for counterfactual conditionals and similar logics | cs.AI | The elegant Stalnaker/Lewis semantics for counterfactual conditonals works
with distances between models. But human beings certainly have no tables of
models and distances in their head. We begin here an investigation using a more
realistic picture, based on findings in neuroscience. We call it a
pre-semantics, as its ... | computer science |
37,250 | Understanding the complexity of #SAT using knowledge compilation | cs.CC | Two main techniques have been used so far to solve the #P-hard problem #SAT.
The first one, used in practice, is based on an extension of DPLL for model
counting called exhaustive DPLL. The second approach, more theoretical,
exploits the structure of the input to compute the number of satisfying
assignments by usually ... | computer science |
37,251 | Designing a Safe Autonomous Artificial Intelligence Agent based on Human
Self-Regulation | cs.AI | There is a growing focus on how to design safe artificial intelligent (AI)
agents. As systems become more complex, poorly specified goals or control
mechanisms may cause AI agents to engage in unwanted and harmful outcomes. Thus
it is necessary to design AI agents that follow initial programming intentions
as the progr... | computer science |
37,252 | Application of Fuzzy Logic in Design of Smart Washing Machine | cs.SY | Washing machine is of great domestic necessity as it frees us from the burden
of washing our clothes and saves ample of our time. This paper will cover the
aspect of designing and developing of Fuzzy Logic based, Smart Washing Machine.
The regular washing machine (timer based) makes use of multi-turned timer based
star... | computer science |
37,253 | Pareto Efficient Multi Objective Optimization for Local Tuning of
Analogy Based Estimation | cs.SE | Analogy Based Effort Estimation (ABE) is one of the prominent methods for
software effort estimation. The fundamental concept of ABE is closer to the
mentality of expert estimation but with an automated procedure in which the
final estimate is generated by reusing similar historical projects. The main
key issue when us... | computer science |
37,254 | Morphognosis: the shape of knowledge in space and time | cs.AI | Artificial intelligence research to a great degree focuses on the brain and
behaviors that the brain generates. But the brain, an extremely complex
structure resulting from millions of years of evolution, can be viewed as a
solution to problems posed by an environment existing in space and time. The
environment generat... | computer science |
37,255 | Hedera: Scalable Indexing and Exploring Entities in Wikipedia Revision
History | cs.AI | Much of work in semantic web relying on Wikipedia as the main source of
knowledge often work on static snapshots of the dataset. The full history of
Wikipedia revisions, while contains much more useful information, is still
difficult to access due to its exceptional volume. To enable further research
on this collection... | computer science |
37,256 | From Community Detection to Community Profiling | cs.SI | Most existing community-related studies focus on detection, which aim to find
the community membership for each user from user friendship links. However,
membership alone, without a complete profile of what a community is and how it
interacts with other communities, has limited applications. This motivates us
to consid... | computer science |
37,257 | Une mesure d'expertise pour le crowdsourcing | cs.AI | Crowdsourcing, a major economic issue, is the fact that the firm outsources
internal task to the crowd. It is a form of digital subcontracting for the
general public. The evaluation of the participants work quality is a major
issue in crowdsourcing. Indeed, contributions must be controlled to ensure the
effectiveness a... | computer science |
37,258 | Logical Inferences with Contexts of RDF Triples | cs.AI | Logical inference, an integral feature of the Semantic Web, is the process of
deriving new triples by applying entailment rules on knowledge bases. The
entailment rules are determined by the model-theoretic semantics. Incorporating
context of an RDF triple (e.g., provenance, time, and location) into the
inferencing pro... | computer science |
37,259 | Artificial Intelligence Approaches To UCAV Autonomy | cs.AI | This paper covers a number of approaches that leverage Artificial
Intelligence algorithms and techniques to aid Unmanned Combat Aerial Vehicle
(UCAV) autonomy. An analysis of current approaches to autonomous control is
provided followed by an exploration of how these techniques can be extended and
enriched with AI tech... | computer science |
37,260 | Towards Automatic Learning of Heuristics for Mechanical Transformations
of Procedural Code | cs.PL | The current trends in next-generation exascale systems go towards integrating
a wide range of specialized (co-)processors into traditional supercomputers.
Due to the efficiency of heterogeneous systems in terms of Watts and FLOPS per
surface unit, opening the access of heterogeneous platforms to a wider range of
users ... | computer science |
37,261 | Identifying Consistent Statements about Numerical Data with
Dispersion-Corrected Subgroup Discovery | cs.AI | Existing algorithms for subgroup discovery with numerical targets do not
optimize the error or target variable dispersion of the groups they find. This
often leads to unreliable or inconsistent statements about the data, rendering
practical applications, especially in scientific domains, futile. Therefore, we
here exte... | computer science |
37,262 | Efficiently Summarising Event Sequences with Rich Interleaving Patterns | cs.AI | Discovering the key structure of a database is one of the main goals of data
mining. In pattern set mining we do so by discovering a small set of patterns
that together describe the data well. The richer the class of patterns we
consider, and the more powerful our description language, the better we will be
able to sum... | computer science |
37,263 | Organic Computing in the Spotlight | cs.MA | Organic Computing is an initiative in the field of systems engineering that
proposed to make use of concepts such as self-adaptation and self-organisation
to increase the robustness of technical systems. Based on the observation that
traditional design and operation concepts reach their limits, transferring more
autono... | computer science |
37,264 | Comparative Study Of Data Mining Query Languages | cs.AI | Since formulation of Inductive Database (IDB) problem, several Data Mining
(DM) languages have been proposed, confirming that KDD process could be
supported via inductive queries (IQ) answering. This paper reviews the existing
DM languages. We are presenting important primitives of the DM language and
classifying our l... | computer science |
37,265 | Incremental Maintenance Of Association Rules Under Support Threshold
Change | cs.AI | Maintenance of association rules is an interesting problem. Several
incremental maintenance algorithms were proposed since the work of (Cheung et
al, 1996). The majority of these algorithms maintain rule bases assuming that
support threshold doesn't change. In this paper, we present incremental
maintenance algorithm un... | computer science |
37,266 | Rhythm Transcription of Polyphonic Piano Music Based on Merged-Output
HMM for Multiple Voices | cs.AI | In a recent conference paper, we have reported a rhythm transcription method
based on a merged-output hidden Markov model (HMM) that explicitly describes
the multiple-voice structure of polyphonic music. This model solves a major
problem of conventional methods that could not properly describe the nature of
multiple vo... | computer science |
37,267 | Decision structure of risky choice | cs.AI | As we know, there is a controversy about the decision making under risk
between economists and psychologists. We discuss to build a unified theory of
risky choice, which would explain both of compensatory and non-compensatory
theories. For risky choice, according to cognition ability, we argue that
people could not bui... | computer science |
37,268 | Credal Networks under Epistemic Irrelevance | cs.AI | A credal network under epistemic irrelevance is a generalised type of
Bayesian network that relaxes its two main building blocks. On the one hand,
the local probabilities are allowed to be partially specified. On the other
hand, the assessments of independence do not have to hold exactly.
Conceptually, these two featur... | computer science |
37,269 | C3A: A Cognitive Collaborative Control Architecture For an Intelligent
Wheelchair | cs.RO | Retention of residual skills for persons who partially lose their cognitive
or physical ability is of utmost importance. Research is focused on developing
systems that provide need-based assistance for retention of such residual
skills. This paper describes a novel cognitive collaborative control
architecture C3A, desi... | computer science |
37,270 | Deep Reinforcement Learning for Robotic Manipulation-The state of the
art | cs.RO | The focus of this work is to enumerate the various approaches and algorithms
that center around application of reinforcement learning in robotic ma-
]]nipulation tasks. Earlier methods utilized specialized policy representations
and human demonstrations to constrict the policy. Such methods worked well with
continuous ... | computer science |
37,271 | Comparing Dataset Characteristics that Favor the Apriori, Eclat or
FP-Growth Frequent Itemset Mining Algorithms | cs.DB | Frequent itemset mining is a popular data mining technique. Apriori, Eclat,
and FP-Growth are among the most common algorithms for frequent itemset mining.
Considerable research has been performed to compare the relative performance
between these three algorithms, by evaluating the scalability of each algorithm
as the ... | computer science |
37,272 | Blue Sky Ideas in Artificial Intelligence Education from the EAAI 2017
New and Future AI Educator Program | cs.AI | The 7th Symposium on Educational Advances in Artificial Intelligence
(EAAI'17, co-chaired by Sven Koenig and Eric Eaton) launched the EAAI New and
Future AI Educator Program to support the training of early-career university
faculty, secondary school faculty, and future educators (PhD candidates or
postdocs who intend ... | computer science |
37,273 | Two forms of minimality in ASPIC+ | cs.AI | Many systems of structured argumentation explicitly require that the facts
and rules that make up the argument for a conclusion be the minimal set
required to derive the conclusion. ASPIC+ does not place such a requirement on
arguments, instead requiring that every rule and fact that are part of an
argument be used in ... | computer science |
37,274 | On Robustness in Multilayer Interdependent Network | cs.NI | Critical Infrastructures like power and communication networks are highly
interdependent on each other for their full functionality. Many significant
research have been pursued to model the interdependency and failure analysis of
these interdependent networks. However, most of these models fail to capture
the complex i... | computer science |
37,275 | Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks | cs.AI | Deep neural networks have emerged as a widely used and effective means for
tackling complex, real-world problems. However, a major obstacle in applying
them to safety-critical systems is the great difficulty in providing formal
guarantees about their behavior. We present a novel, scalable, and efficient
technique for v... | computer science |
37,276 | Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through
SMT Solving | cs.AI | Optimization of Mixed-Integer Non-Linear Programming (MINLP) supports
important decisions in applications such as Chemical Process Engineering. But
current solvers have limited ability for deductive reasoning or the use of
domain-specific theories, and the management of integrality constraints does
not yet exploit auto... | computer science |
37,277 | Exploring the bidimensional space: A dynamic logic point of view | cs.AI | We present a family of logics for reasoning about agents' positions and
motion in the plane which have several potential applications in the area of
multi-agent systems (MAS), such as multi-agent planning and robotics. The most
general logic includes (i) atomic formulas for representing the truth of a
given fact or the... | computer science |
37,278 | Solving the Brachistochrone Problem by an Influence Diagram | math.OC | Influence diagrams are a decision-theoretic extension of probabilistic
graphical models. In this paper we show how they can be used to solve the
Brachistochrone problem. We present results of numerical experiments on this
problem, compare the solution provided by the influence diagram with the
optimal solution. The R c... | computer science |
37,279 | Optimal Detection of Faulty Traffic Sensors Used in Route Planning | cs.AI | In a smart city, real-time traffic sensors may be deployed for various
applications, such as route planning. Unfortunately, sensors are prone to
failures, which result in erroneous traffic data. Erroneous data can adversely
affect applications such as route planning, and can cause increased travel
time. To minimize the... | computer science |
37,280 | Reservoir Computing Using Non-Uniform Binary Cellular Automata | cs.ET | The Reservoir Computing (RC) paradigm utilizes a dynamical system, i.e., a
reservoir, and a linear classifier, i.e., a read-out layer, to process data
from sequential classification tasks. In this paper the usage of Cellular
Automata (CA) as a reservoir is investigated. The use of CA in RC has been
showing promising re... | computer science |
37,281 | Data-Intensive Supercomputing in the Cloud: Global Analytics for
Satellite Imagery | cs.DC | We present our experiences using cloud computing to support data-intensive
analytics on satellite imagery for commercial applications. Drawing from our
background in high-performance computing, we draw parallels between the early
days of clustered computing systems and the current state of cloud computing
and its poten... | computer science |
37,282 | Developing an ontology for the access to the contents of an archival
fonds: the case of the Catasto Gregoriano | cs.AI | The research was proposed to exploit and extend the relational and contextual
nature of the information assets of the Catasto Gregoriano, kept at the
Archivio di Stato in Rome. Developed within the MODEUS project (Making Open
Data Effectively Usable), this study originates from the following key ideas of
MODEUS: to req... | computer science |
37,283 | Theoretical and Practical Advances on Smoothing for Extensive-Form Games | cs.GT | Sparse iterative methods, in particular first-order methods, are known to be
among the most effective in solving large-scale two-player zero-sum
extensive-form games. The convergence rates of these methods depend heavily on
the properties of the distance-generating function that they are based on. We
investigate the ac... | computer science |
37,284 | OntoMath Digital Ecosystem: Ontologies, Mathematical Knowledge Analytics
and Management | cs.DL | In this article we consider the basic ideas, approaches and results of
developing of mathematical knowledge management technologies based on
ontologies. These solutions form the basis of a specialized digital ecosystem
OntoMath which consists of the ontology of the logical structure of
mathematical documents Mocassin a... | computer science |
37,285 | Quantifying Program Bias | cs.PL | With the range and sensitivity of algorithmic decisions expanding at a
break-neck speed, it is imperative that we aggressively investigate whether
programs are biased. We propose a novel probabilistic program analysis
technique and apply it to quantifying bias in decision-making programs.
Specifically, we (i) present a... | computer science |
37,286 | Polynomial Time Efficient Construction Heuristics for Vertex Separation
Minimization Problem | cs.DS | Vertex Separation Minimization Problem (VSMP) consists of finding a layout of
a graph G = (V,E) which minimizes the maximum vertex cut or separation of a
layout. It is an NP-complete problem in general for which metaheuristic
techniques can be applied to find near optimal solution. VSMP has applications
in VLSI design,... | computer science |
37,287 | The Absent-Minded Driver Problem Redux | cs.AI | This paper reconsiders the problem of the absent-minded driver who must
choose between alternatives with different payoff with imperfect recall and
varying degrees of knowledge of the system. The classical absent-minded driver
problem represents the case with limited information and it has bearing on the
general area o... | computer science |
37,288 | 'Viral' Turing Machines, Computation from Noise and Combinatorial
Hierarchies | cs.AI | The interactive computation paradigm is reviewed and a particular example is
extended to form the stochastic analog of a computational process via a
transcription of a minimal Turing Machine into an equivalent asynchronous
Cellular Automaton with an exponential waiting times distribution of effective
transitions. Furth... | computer science |
37,289 | Synthesizing Imperative Programs from Examples Guided by Static Analysis | cs.PL | We present a novel algorithm that synthesizes imperative programs for
introductory programming courses. Given a set of input-output examples and a
partial program, our algorithm generates a complete program that is consistent
with every example. Our key idea is to combine enumerative program synthesis
and static analys... | computer science |
37,290 | Delving Deeper into MOOC Student Dropout Prediction | cs.AI | In order to obtain reliable accuracy estimates for automatic MOOC dropout
predictors, it is important to train and test them in a manner consistent with
how they will be used in practice. Yet most prior research on MOOC dropout
prediction has measured test accuracy on the same course used for training the
classifier, w... | computer science |
37,291 | Realization of Ontology Web Search Engine | cs.AI | This paper describes the realization of the Ontology Web Search Engine. The
Ontology Web Search Engine is realizable as independent project and as a part
of other projects. The main purpose of this paper is to present the Ontology
Web Search Engine realization details as the part of the Semantic Web Expert
System and t... | computer science |
37,292 | A Realistic Dataset for the Smart Home Device Scheduling Problem for
DCOPs | cs.AI | The field of Distributed Constraint Optimization has gained momentum in
recent years thanks to its ability to address various applications related to
multi-agent cooperation. While techniques to solve Distributed Constraint
Optimization Problems (DCOPs) are abundant and have matured substantially since
the field incept... | computer science |
37,293 | Diverse Weighted Bipartite b-Matching | cs.DS | Bipartite matching, where agents on one side of a market are matched to
agents or items on the other, is a classical problem in computer science and
economics, with widespread application in healthcare, education, advertising,
and general resource allocation. A practitioner's goal is typically to maximize
a matching ma... | computer science |
37,294 | Ontologies in System Engineering: a Field Report | cs.AI | In recent years ontologies enjoyed a growing popularity outside specialized
AI communities. System engineering is no exception to this trend, with
ontologies being proposed as a basis for several tasks in complex industrial
implements, including system design, monitoring and diagnosis. In this paper,
we consider four d... | computer science |
37,295 | A Probabilistic Framework for Location Inference from Social Media | cs.AI | We study the extent to which we can infer users' geographical locations from
social media. Location inference from social media can benefit many
applications, such as disaster management, targeted advertising, and news
content tailoring. In recent years, a number of algorithms have been proposed
for identifying user lo... | computer science |
37,296 | Contractibility for Open Global Constraints | cs.LO | Open forms of global constraints allow the addition of new variables to an
argument during the execution of a constraint program. Such forms are needed
for difficult constraint programming problems where problem construction and
problem solving are interleaved, and fit naturally within constraint logic
programming. How... | computer science |
37,297 | Balancing Lexicographic Fairness and a Utilitarian Objective with
Application to Kidney Exchange | cs.GT | Balancing fairness and efficiency in resource allocation is a classical
economic and computational problem. The price of fairness measures the
worst-case loss of economic efficiency when using an inefficient but fair
allocation rule; for indivisible goods in many settings, this price is
unacceptably high. One such sett... | computer science |
37,298 | Monte Carlo Action Programming | cs.AI | This paper proposes Monte Carlo Action Programming, a programming language
framework for autonomous systems that act in large probabilistic state spaces
with high branching factors. It comprises formal syntax and semantics of a
nondeterministic action programming language. The language is interpreted
stochastically via... | computer science |
37,299 | Bayesian Verification under Model Uncertainty | cs.SE | Machine learning enables systems to build and update domain models based on
runtime observations. In this paper, we study statistical model checking and
runtime verification for systems with this ability. Two challenges arise: (1)
Models built from limited runtime data yield uncertainty to be dealt with. (2)
There is n... | computer science |
37,300 | Analysing Congestion Problems in Multi-agent Reinforcement Learning | cs.MA | Congestion problems are omnipresent in today's complex networks and represent
a challenge in many research domains. In the context of Multi-agent
Reinforcement Learning (MARL), approaches like difference rewards and resource
abstraction have shown promising results in tackling such problems. Resource
abstraction was sh... | computer science |
37,301 | Optimal Categorical Attribute Transformation for Granularity Change in
Relational Databases for Binary Decision Problems in Educational Data Mining | cs.AI | This paper presents an approach for transforming data granularity in
hierarchical databases for binary decision problems by applying regression to
categorical attributes at the lower grain levels. Attributes from a lower
hierarchy entity in the relational database have their information content
optimized through regres... | computer science |
37,302 | A Hypercat-enabled Semantic Internet of Things Data Hub: Technical
Report | cs.AI | An increasing amount of information is generated from the rapidly increasing
number of sensor networks and smart devices. A wide variety of sources generate
and publish information in different formats, thus highlighting
interoperability as one of the key prerequisites for the success of Internet of
Things (IoT). The B... | computer science |
37,303 | Towards Monetary Incentives in Social Q&A Services | cs.AI | Community-based question answering (CQA) services are facing key challenges
to motivate domain experts to provide timely answers. Recently, CQA services
are exploring new incentive models to engage experts and celebrities by
allowing them to set a price on their answers. In this paper, we perform a
data-driven analysis... | computer science |
37,304 | Principles and Examples of Plausible Reasoning and Propositional
Plausible Logic | cs.AI | Plausible reasoning concerns situations whose inherent lack of precision is
not quantified; that is, there are no degrees or levels of precision, and hence
no use of numbers like probabilities. A hopefully comprehensive set of
principles that clarifies what it means for a formal logic to do plausible
reasoning is prese... | computer science |
37,305 | A new belief Markov chain model and its application in inventory
prediction | cs.AI | Markov chain model is widely applied in many fields, especially the field of
prediction. The classical Discrete-time Markov chain(DTMC) is a widely used
method for prediction. However, the classical DTMC model has some limitation
when the system is complex with uncertain information or state space is not
discrete. To a... | computer science |
37,306 | Multi-Robot Active Information Gathering with Periodic Communication | cs.RO | A team of robots sharing a common goal can benefit from coordination of the
activities of team members, helping the team to reach the goal more reliably or
quickly. We address the problem of coordinating the actions of a team of robots
with periodic communication capability executing an information gathering task.
We c... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.