Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,505 | AGNOSCO - Identification of Infected Nodes with artificial Ant Colonies | cs.AI | If a computer node is infected by a virus, worm or a backdoor, then this is a
security risk for the complete network structure where the node is associated.
Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of
support for the identification of such infected nodes but suffer from the need
of p... | computer science |
35,506 | A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning | cs.AI | We introduce a new tractable temporal constraint language, which strictly
contains the Ord-Horn language of Buerkert and Nebel and the class of AND/OR
precedence constraints. The algorithm we present for this language decides
whether a given set of constraints is consistent in time that is quadratic in
the input size. ... | computer science |
35,507 | Swarm-Based Spatial Sorting | cs.AI | Purpose: To present an algorithm for spatially sorting objects into an
annular structure. Design/Methodology/Approach: A swarm-based model that
requires only stochastic agent behaviour coupled with a pheromone-inspired
"attraction-repulsion" mechanism. Findings: The algorithm consistently
generates high-quality annular... | computer science |
35,508 | Distributed Self Management for Distributed Security Systems | cs.MA | Distributed system as e.g. artificial immune systems, complex adaptive
systems, or multi-agent systems are widely used in Computer Science, e.g. for
network security, optimisations, or simulations. In these systems, small
entities move through the network and perform certain tasks. At some time, the
entities move to an... | computer science |
35,509 | Next Challenges in Bringing Artificial Immune Systems to Production in
Network Security | cs.MA | The human immune system protects the human body against various pathogens
like e.g. biological viruses and bacteria. Artificial immune systems reuse the
architecture, organization, and workflows of the human immune system for
various problems in computer science. In the network security, the artificial
immune system is... | computer science |
35,510 | Compressing Binary Decision Diagrams | cs.AI | The paper introduces a new technique for compressing Binary Decision Diagrams
in those cases where random access is not required. Using this technique,
compression and decompression can be done in linear time in the size of the BDD
and compression will in many cases reduce the size of the BDD to 1-2 bits per
node. Empi... | computer science |
35,511 | Modeling Loosely Annotated Images with Imagined Annotations | cs.IR | In this paper, we present an approach to learning latent semantic analysis
models from loosely annotated images for automatic image annotation and
indexing. The given annotation in training images is loose due to: (1)
ambiguous correspondences between visual features and annotated keywords; (2)
incomplete lists of anno... | computer science |
35,512 | The end of Sleeping Beauty's nightmare | cs.AI | The way a rational agent changes her belief in certain
propositions/hypotheses in the light of new evidence lies at the heart of
Bayesian inference. The basic natural assumption, as summarized in van
Fraassen's Reflection Principle ([1984]), would be that in the absence of new
evidence the belief should not change. Yet... | computer science |
35,513 | Temporized Equilibria | cs.GT | This paper has been withdrawn by the author due to a crucial error in the
submission action. | computer science |
35,514 | An Intelligent Multi-Agent Recommender System for Human Capacity
Building | cs.AI | This paper presents a Multi-Agent approach to the problem of recommending
training courses to engineering professionals. The recommendation system is
built as a proof of concept and limited to the electrical and mechanical
engineering disciplines. Through user modelling and data collection from a
survey, collaborative ... | computer science |
35,515 | Development of Hybrid Intelligent Systems and their Applications from
Engineering Systems to Complex Systems | cs.AI | In this study, we introduce general frame of MAny Connected Intelligent
Particles Systems (MACIPS). Connections and interconnections between particles
get a complex behavior of such merely simple system (system in
system).Contribution of natural computing, under information granulation
theory, are the main topic of thi... | computer science |
35,516 | Neural networks in 3D medical scan visualization | cs.AI | For medical volume visualization, one of the most important tasks is to
reveal clinically relevant details from the 3D scan (CT, MRI ...), e.g. the
coronary arteries, without obscuring them with less significant parts. These
volume datasets contain different materials which are difficult to extract and
visualize with 1... | computer science |
35,517 | Use of a Quantum Computer and the Quick Medical Reference To Give an
Approximate Diagnosis | cs.AI | The Quick Medical Reference (QMR) is a compendium of statistical knowledge
connecting diseases to findings (symptoms). The information in QMR can be
represented as a Bayesian network. The inference problem (or, in more medical
language, giving a diagnosis) for the QMR is to, given some findings, find the
probability of... | computer science |
35,518 | A new Hedging algorithm and its application to inferring latent random
variables | cs.GT | We present a new online learning algorithm for cumulative discounted gain.
This learning algorithm does not use exponential weights on the experts.
Instead, it uses a weighting scheme that depends on the regret of the master
algorithm relative to the experts. In particular, experts whose discounted
cumulative gain is s... | computer science |
35,519 | Modeling belief systems with scale-free networks | cs.AI | Evolution of belief systems has always been in focus of cognitive research.
In this paper we delineate a new model describing belief systems as a network
of statements considered true. Testing the model a small number of parameters
enabled us to reproduce a variety of well-known mechanisms ranging from opinion
changes ... | computer science |
35,520 | A Distributed Process Infrastructure for a Distributed Data Structure | cs.AI | The Resource Description Framework (RDF) is continuing to grow outside the
bounds of its initial function as a metadata framework and into the domain of
general-purpose data modeling. This expansion has been facilitated by the
continued increase in the capacity and speed of RDF database repositories known
as triple-sto... | computer science |
35,521 | AceWiki: A Natural and Expressive Semantic Wiki | cs.HC | We present AceWiki, a prototype of a new kind of semantic wiki using the
controlled natural language Attempto Controlled English (ACE) for representing
its content. ACE is a subset of English with a restricted grammar and a formal
semantics. The use of ACE has two important advantages over existing semantic
wikis. Firs... | computer science |
35,522 | AceWiki: Collaborative Ontology Management in Controlled Natural
Language | cs.HC | AceWiki is a prototype that shows how a semantic wiki using controlled
natural language - Attempto Controlled English (ACE) in our case - can make
ontology management easy for everybody. Sentences in ACE can automatically be
translated into first-order logic, OWL, or SWRL. AceWiki integrates the OWL
reasoner Pellet and... | computer science |
35,523 | Agent Models of Political Interactions | cs.AI | Looks at state interactions from an agent based AI perspective to see state
interactions as an example of emergent intelligent behavior. Exposes basic
principles of game theory. | computer science |
35,524 | Proposition of the Interactive Pareto Iterated Local Search Procedure -
Elements and Initial Experiments | cs.AI | The article presents an approach to interactively solve multi-objective
optimization problems. While the identification of efficient solutions is
supported by computational intelligence techniques on the basis of local
search, the search is directed by partial preference information obtained from
the decision maker.
... | computer science |
35,525 | Superposition for Fixed Domains | cs.AI | Superposition is an established decision procedure for a variety of
first-order logic theories represented by sets of clauses. A satisfiable
theory, saturated by superposition, implicitly defines a minimal term-generated
model for the theory. Proving universal properties with respect to a saturated
theory directly lead... | computer science |
35,526 | MOOPPS: An Optimization System for Multi Objective Scheduling | cs.AI | In the current paper, we present an optimization system solving multi
objective production scheduling problems (MOOPPS). The identification of Pareto
optimal alternatives or at least a close approximation of them is possible by a
set of implemented metaheuristics. Necessary control parameters can easily be
adjusted by ... | computer science |
35,527 | ECOLANG - Communications Language for Ecological Simulations Network | cs.AI | This document describes the communication language used in one multiagent
system environment for ecological simulations, based on EcoDynamo simulator
application linked with several intelligent agents and visualisation
applications, and extends the initial definition of the language. The agents
actions and perceptions ... | computer science |
35,528 | Agent-based Ecological Model Calibration - on the Edge of a New Approach | cs.AI | The purpose of this paper is to present a new approach to ecological model
calibration -- an agent-based software. This agent works on three stages: 1- It
builds a matrix that synthesizes the inter-variable relationships; 2- It
analyses the steady-state sensitivity of different variables to different
parameters; 3- It ... | computer science |
35,529 | Randomized Distributed Configuration Management of Wireless Networks:
Multi-layer Markov Random Fields and Near-Optimality | cs.DC | Distributed configuration management is imperative for wireless
infrastructureless networks where each node adjusts locally its physical and
logical configuration through information exchange with neighbors. Two issues
remain open. The first is the optimality. The second is the complexity. We
study these issues through... | computer science |
35,530 | Electricity Demand and Energy Consumption Management System | cs.AI | This project describes the electricity demand and energy consumption
management system and its application to Southern Peru smelter. It is composed
of an hourly demand-forecasting module and of a simulation component for a
plant electrical system. The first module was done using dynamic neural
networks with backpropaga... | computer science |
35,531 | Normalized Information Distance | cs.IR | The normalized information distance is a universal distance measure for
objects of all kinds. It is based on Kolmogorov complexity and thus
uncomputable, but there are ways to utilize it. First, compression algorithms
can be used to approximate the Kolmogorov complexity if the objects have a
string representation. Seco... | computer science |
35,532 | Simulated annealing for weighted polygon packing | cs.CG | In this paper we present a new algorithm for a layout optimization problem:
this concerns the placement of weighted polygons inside a circular container,
the two objectives being to minimize imbalance of mass and to minimize the
radius of the container. This problem carries real practical significance in
industrial app... | computer science |
35,533 | A computational model of affects | cs.AI | This article provides a simple logical structure, in which affective concepts
(i.e. concepts related to emotions and feelings) can be defined. The set of
affects defined is similar to the set of emotions covered in the OCC model
(Ortony A., Collins A., and Clore G. L.: The Cognitive Structure of Emotions.
Cambridge Uni... | computer science |
35,534 | Edhibou: a Customizable Interface for Decision Support in a Semantic
Portal | cs.AI | The Semantic Web is becoming more and more a reality, as the required
technologies have reached an appropriate level of maturity. However, at this
stage, it is important to provide tools facilitating the use and deployment of
these technologies by end-users. In this paper, we describe EdHibou, an
automatically generate... | computer science |
35,535 | Embedding Non-Ground Logic Programs into Autoepistemic Logic for
Knowledge Base Combination | cs.LO | In the context of the Semantic Web, several approaches to the combination of
ontologies, given in terms of theories of classical first-order logic and rule
bases, have been proposed. They either cast rules into classical logic or limit
the interaction between rules and ontologies. Autoepistemic logic (AEL) is an
attrac... | computer science |
35,536 | Mining Complex Hydrobiological Data with Galois Lattices | cs.AI | We have used Galois lattices for mining hydrobiological data. These data are
about macrophytes, that are macroscopic plants living in water bodies. These
plants are characterized by several biological traits, that own several
modalities. Our aim is to cluster the plants according to their common traits
and modalities a... | computer science |
35,537 | Action Theory Evolution | cs.AI | Like any other logical theory, domain descriptions in reasoning about actions
may evolve, and thus need revision methods to adequately accommodate new
information about the behavior of actions. The present work is about changing
action domain descriptions in propositional dynamic logic. Its contribution is
threefold: f... | computer science |
35,538 | Contextual hypotheses and semantics of logic programs | cs.LO | Logic programming has developed as a rich field, built over a logical
substratum whose main constituent is a nonclassical form of negation, sometimes
coexisting with classical negation. The field has seen the advent of a number
of alternative semantics, with Kripke-Kleene semantics, the well-founded
semantics, the stab... | computer science |
35,539 | On finitely recursive programs | cs.AI | Disjunctive finitary programs are a class of logic programs admitting
function symbols and hence infinite domains. They have very good computational
properties, for example ground queries are decidable while in the general case
the stable model semantics is highly undecidable. In this paper we prove that a
larger class... | computer science |
35,540 | Automating Access Control Logics in Simple Type Theory with LEO-II | cs.LO | Garg and Abadi recently proved that prominent access control logics can be
translated in a sound and complete way into modal logic S4. We have previously
outlined how normal multimodal logics, including monomodal logics K and S4, can
be embedded in simple type theory (which is also known as higher-order logic)
and we h... | computer science |
35,541 | Resource Adaptive Agents in Interactive Theorem Proving | cs.LO | We introduce a resource adaptive agent mechanism which supports the user in
interactive theorem proving. The mechanism uses a two layered architecture of
agent societies to suggest appropriate commands together with possible command
argument instantiations. Experiments with this approach show that its
effectiveness can... | computer science |
35,542 | A remark on higher order RUE-resolution with EXTRUE | cs.AI | We show that a prominent counterexample for the completeness of first order
RUE-resolution does not apply to the higher order RUE-resolution approach
EXTRUE. | computer science |
35,543 | Geospatial semantics: beyond ontologies, towards an enactive approach | cs.AI | Current approaches to semantics in the geospatial domain are mainly based on
ontologies, but ontologies, since continue to build entirely on the symbolic
methodology, suffers from the classical problems, e.g. the symbol grounding
problem, affecting representational theories. We claim for an enactive approach
to semanti... | computer science |
35,544 | Cut-Simulation and Impredicativity | cs.LO | We investigate cut-elimination and cut-simulation in impredicative
(higher-order) logics. We illustrate that adding simple axioms such as Leibniz
equations to a calculus for an impredicative logic -- in our case a sequent
calculus for classical type theory -- is like adding cut. The phenomenon
equally applies to promin... | computer science |
35,546 | Topological Centrality and Its Applications | cs.IR | Recent development of network structure analysis shows that it plays an
important role in characterizing complex system of many branches of sciences.
Different from previous network centrality measures, this paper proposes the
notion of topological centrality (TC) reflecting the topological positions of
nodes and edges... | computer science |
35,547 | Writing Positive/Negative-Conditional Equations Conveniently | cs.AI | We present a convenient notation for positive/negative-conditional equations.
The idea is to merge rules specifying the same function by using case-, if-,
match-, and let-expressions. Based on the presented macro-rule-construct,
positive/negative-conditional equational specifications can be written on a
higher level. A... | computer science |
35,548 | ASF+ --- eine ASF-aehnliche Spezifikationssprache | cs.AI | Maintaining the main aspects of the algebraic specification language ASF as
presented in [Bergstra&al.89] we have extend ASF with the following concepts:
While once exported names in ASF must stay visible up to the top the module
hierarchy, ASF+ permits a more sophisticated hiding of signature names. The
erroneous merg... | computer science |
35,549 | Progress in Computer-Assisted Inductive Theorem Proving by
Human-Orientedness and Descente Infinie? | cs.AI | In this short position paper we briefly review the development history of
automated inductive theorem proving and computer-assisted mathematical
induction. We think that the current low expectations on progress in this field
result from a faulty narrow-scope historical projection. Our main motivation is
to explain--on ... | computer science |
35,550 | A Systematic Approach to Artificial Agents | cs.AI | Agents and agent systems are becoming more and more important in the
development of a variety of fields such as ubiquitous computing, ambient
intelligence, autonomous computing, intelligent systems and intelligent
robotics. The need for improvement of our basic knowledge on agents is very
essential. We take a systemati... | computer science |
35,551 | Syntactic Confluence Criteria for Positive/Negative-Conditional Term
Rewriting Systems | cs.AI | We study the combination of the following already known ideas for showing
confluence of unconditional or conditional term rewriting systems into
practically more useful confluence criteria for conditional systems: Our
syntactical separation into constructor and non-constructor symbols, Huet's
introduction and Toyama's ... | computer science |
35,552 | A Self-Contained and Easily Accessible Discussion of the Method of
Descente Infinie and Fermat's Only Explicitly Known Proof by Descente Infinie | cs.AI | We present the only proof of Pierre Fermat by descente infinie that is known
to exist today. As the text of its Latin original requires active mathematical
interpretation, it is more a proof sketch than a proper mathematical proof. We
discuss descente infinie from the mathematical, logical, historical,
linguistic, and ... | computer science |
35,553 | lim+, delta+, and Non-Permutability of beta-Steps | cs.AI | Using a human-oriented formal example proof of the (lim+) theorem, i.e. that
the sum of limits is the limit of the sum, which is of value for reference on
its own, we exhibit a non-permutability of beta-steps and delta+-steps
(according to Smullyan's classification), which is not visible with
non-liberalized delta-rule... | computer science |
35,554 | An Algebraic Dexter-Based Hypertext Reference Model | cs.AI | We present the first formal algebraic specification of a hypertext reference
model. It is based on the well-known Dexter Hypertext Reference Model and
includes modifications with respect to the development of hypertext since the
WWW came up. Our hypertext model was developed as a product model with the aim
to automatic... | computer science |
35,555 | Full First-Order Sequent and Tableau Calculi With Preservation of
Solutions and the Liberalized delta-Rule but Without Skolemization | cs.AI | We present a combination of raising, explicit variable dependency
representation, the liberalized delta-rule, and preservation of solutions for
first-order deductive theorem proving. Our main motivation is to provide the
foundation for our work on inductive theorem proving, where the preservation of
solutions is indisp... | computer science |
35,556 | Hilbert's epsilon as an Operator of Indefinite Committed Choice | cs.AI | Paul Bernays and David Hilbert carefully avoided overspecification of
Hilbert's epsilon-operator and axiomatized only what was relevant for their
proof-theoretic investigations. Semantically, this left the epsilon-operator
underspecified. In the meanwhile, there have been several suggestions for
semantics of the epsilo... | computer science |
35,557 | Lectures on Jacques Herbrand as a Logician | cs.LO | We give some lectures on the work on formal logic of Jacques Herbrand, and
sketch his life and his influence on automated theorem proving. The intended
audience ranges from students interested in logic over historians to logicians.
Besides the well-known correction of Herbrand's False Lemma by Goedel and
Dreben, we als... | computer science |
35,558 | On Solving Boolean Multilevel Optimization Problems | cs.LO | Many combinatorial optimization problems entail a number of hierarchically
dependent optimization problems. An often used solution is to associate a
suitably large cost with each individual optimization problem, such that the
solution of the resulting aggregated optimization problem solves the original
set of hierarchi... | computer science |
35,559 | Faith in the Algorithm, Part 2: Computational Eudaemonics | cs.CY | Eudaemonics is the study of the nature, causes, and conditions of human
well-being. According to the ethical theory of eudaemonia, reaping satisfaction
and fulfillment from life is not only a desirable end, but a moral
responsibility. However, in modern society, many individuals struggle to meet
this responsibility. Co... | computer science |
35,560 | Safe Reasoning Over Ontologies | cs.AI | As ontologies proliferate and automatic reasoners become more powerful, the
problem of protecting sensitive information becomes more serious. In
particular, as facts can be inferred from other facts, it becomes increasingly
likely that information included in an ontology, while not itself deemed
sensitive, may be able ... | computer science |
35,561 | Design, development and implementation of a tool for construction of
declarative functional descriptions of semantic web services based on WSMO
methodology | cs.AI | Semantic web services (SWS) are self-contained, self-describing, semantically
marked-up software resources that can be published, discovered, composed and
executed across the Web in a semi-automatic way. They are a key component of
the future Semantic Web, in which networked computer programs become providers
and users... | computer science |
35,562 | An Investigation Report on Auction Mechanism Design | cs.AI | Auctions are markets with strict regulations governing the information
available to traders in the market and the possible actions they can take.
Since well designed auctions achieve desirable economic outcomes, they have
been widely used in solving real-world optimization problems, and in
structuring stock or futures ... | computer science |
35,563 | CP-logic: A Language of Causal Probabilistic Events and Its Relation to
Logic Programming | cs.AI | This papers develops a logical language for representing probabilistic causal
laws. Our interest in such a language is twofold. First, it can be motivated as
a fundamental study of the representation of causal knowledge. Causality has an
inherent dynamic aspect, which has been studied at the semantical level by
Shafer ... | computer science |
35,564 | Towards an Intelligent System for Risk Prevention and Management | cs.AI | Making a decision in a changeable and dynamic environment is an arduous task
owing to the lack of information, their uncertainties and the unawareness of
planners about the future evolution of incidents. The use of a decision support
system is an efficient solution of this issue. Such a system can help emergency
planne... | computer science |
35,565 | Agent-Based Decision Support System to Prevent and Manage Risk
Situations | cs.AI | The topic of risk prevention and emergency response has become a key social
and political concern. One approach to address this challenge is to develop
Decision Support Systems (DSS) that can help emergency planners and responders
to detect emergencies, as well as to suggest possible course of actions to deal
with the ... | computer science |
35,566 | Variations of the Turing Test in the Age of Internet and Virtual Reality | cs.AI | Inspired by Hofstadter's Coffee-House Conversation (1982) and by the science
fiction short story SAM by Schattschneider (1988), we propose and discuss
criteria for non-mechanical intelligence. Firstly, we emphasize the practical
need for such tests in view of massively multiuser online role-playing games
(MMORPGs) and ... | computer science |
35,567 | Quality Classifiers for Open Source Software Repositories | cs.SE | Open Source Software (OSS) often relies on large repositories, like
SourceForge, for initial incubation. The OSS repositories offer a large variety
of meta-data providing interesting information about projects and their
success. In this paper we propose a data mining approach for training
classifiers on the OSS meta-da... | computer science |
35,568 | Quantified Multimodal Logics in Simple Type Theory | cs.AI | We present a straightforward embedding of quantified multimodal logic in
simple type theory and prove its soundness and completeness. Modal operators
are replaced by quantification over a type of possible worlds. We present
simple experiments, using existing higher-order theorem provers, to demonstrate
that the embeddi... | computer science |
35,569 | Interpretations of the Web of Data | cs.AI | The emerging Web of Data utilizes the web infrastructure to represent and
interrelate data. The foundational standards of the Web of Data include the
Uniform Resource Identifier (URI) and the Resource Description Framework (RDF).
URIs are used to identify resources and RDF is used to relate resources. While
RDF has bee... | computer science |
35,570 | Profiling of a network behind an infectious disease outbreak | cs.AI | Stochasticity and spatial heterogeneity are of great interest recently in
studying the spread of an infectious disease. The presented method solves an
inverse problem to discover the effectively decisive topology of a
heterogeneous network and reveal the transmission parameters which govern the
stochastic spreads over ... | computer science |
35,571 | Where are the really hard manipulation problems? The phase transition in
manipulating the veto rule | cs.AI | Voting is a simple mechanism to aggregate the preferences of agents. Many
voting rules have been shown to be NP-hard to manipulate. However, a number of
recent theoretical results suggest that this complexity may only be in the
worst-case since manipulation is often easy in practice. In this paper, we show
that empiric... | computer science |
35,572 | Circuit Complexity and Decompositions of Global Constraints | cs.AI | We show that tools from circuit complexity can be used to study
decompositions of global constraints. In particular, we study decompositions of
global constraints into conjunctive normal form with the property that unit
propagation on the decomposition enforces the same level of consistency as a
specialized propagation... | computer science |
35,573 | Swap Bribery | cs.GT | In voting theory, bribery is a form of manipulative behavior in which an
external actor (the briber) offers to pay the voters to change their votes in
order to get her preferred candidate elected. We investigate a model of bribery
where the price of each vote depends on the amount of change that the voter is
asked to i... | computer science |
35,574 | Automating Quantified Multimodal Logics in Simple Type Theory -- A Case
Study | cs.AI | In a case study we investigate whether off the shelf higher-order theorem
provers and model generators can be employed to automate reasoning in and about
quantified multimodal logics. In our experiments we exploit the new TPTP
infrastructure for classical higher-order logic. | computer science |
35,575 | Information Modeling for a Dynamic Representation of an Emergency
Situation | cs.AI | In this paper we propose an approach to build a decision support system that
can help emergency planners and responders to detect and manage emergency
situations. The internal mechanism of the system is independent from the
treated application. Therefore, we think the system may be used or adapted
easily to different c... | computer science |
35,576 | Computational Understanding and Manipulation of Symmetries | cs.AI | For natural and artificial systems with some symmetry structure,
computational understanding and manipulation can be achieved without learning
by exploiting the algebraic structure. Here we describe this algebraic
coordinatization method and apply it to permutation puzzles. Coordinatization
yields a structural understa... | computer science |
35,577 | Quantifying Rational Belief | cs.AI | Some criticisms that have been raised against the Cox approach to probability
theory are addressed. Should we use a single real number to measure a degree of
rational belief? Can beliefs be compared? Are the Cox axioms obvious? Are there
counterexamples to Cox? Rather than justifying Cox's choice of axioms we follow
a ... | computer science |
35,578 | Examples as Interaction: On Humans Teaching a Computer to Play a Game | cs.AI | This paper reviews an experiment in human-computer interaction, where
interaction takes place when humans attempt to teach a computer to play a
strategy board game. We show that while individually learned models can be
shown to improve the playing performance of the computer, their straightforward
composition results i... | computer science |
35,579 | Industrial-Strength Formally Certified SAT Solving | cs.LO | Boolean Satisfiability (SAT) solvers are now routinely used in the
verification of large industrial problems. However, their application in
safety-critical domains such as the railways, avionics, and automotive
industries requires some form of assurance for the results, as the solvers can
(and sometimes do) have bugs. ... | computer science |
35,580 | A Dynamic Vulnerability Map to Assess the Risk of Road Network Traffic
Utilization | cs.AI | Le Havre agglomeration (CODAH) includes 16 establishments classified Seveso
with high threshold. In the literature, we construct vulnerability maps to help
decision makers assess the risk. Such approaches remain static and do take into
account the population displacement in the estimation of the vulnerability. We
propo... | computer science |
35,581 | Different goals in multiscale simulations and how to reach them | cs.AI | In this paper we sum up our works on multiscale programs, mainly simulations.
We first start with describing what multiscaling is about, how it helps
perceiving signal from a background noise in a ?ow of data for example, for a
direct perception by a user or for a further use by another program. We then
give three exam... | computer science |
35,582 | A Semantic Similarity Measure for Expressive Description Logics | cs.AI | A totally semantic measure is presented which is able to calculate a
similarity value between concept descriptions and also between concept
description and individual or between individuals expressed in an expressive
description logic. It is applicable on symbolic descriptions although it uses a
numeric approach for th... | computer science |
35,583 | A Decision-Optimization Approach to Quantum Mechanics and Game Theory | cs.GT | The fundamental laws of quantum world upsets the logical foundation of
classic physics. They are completely counter-intuitive with many bizarre
behaviors. However, this paper shows that they may make sense from the
perspective of a general decision-optimization principle for cooperation. This
principle also offers a ge... | computer science |
35,584 | A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning | cs.AI | Probabilistic sampling methods have become very popular to solve single-shot
path planning problems. Rapidly-exploring Random Trees (RRTs) in particular
have been shown to be efficient in solving high dimensional problems. Even
though several RRT variants have been proposed for dynamic replanning, these
methods only pe... | computer science |
35,585 | Combining a Probabilistic Sampling Technique and Simple Heuristics to
solve the Dynamic Path Planning Problem | cs.AI | Probabilistic sampling methods have become very popular to solve single-shot
path planning problems. Rapidly-exploring Random Trees (RRTs) in particular
have been shown to be very efficient in solving high dimensional problems. Even
though several RRT variants have been proposed to tackle the dynamic replanning
problem... | computer science |
35,586 | Single-Agent On-line Path Planning in Continuous, Unpredictable and
Highly Dynamic Environments | cs.AI | This document is a thesis on the subject of single-agent on-line path
planning in continuous,unpredictable and highly dynamic environments. The
problem is finding and traversing a collision-free path for a holonomic robot,
without kinodynamic restrictions, moving in an environment with several
unpredictably moving obst... | computer science |
35,587 | Design of Intelligent layer for flexible querying in databases | cs.DB | Computer-based information technologies have been extensively used to help
many organizations, private companies, and academic and education institutions
manage their processes and information systems hereby become their nervous
centre. The explosion of massive data sets created by businesses, science and
governments n... | computer science |
35,588 | Consensus Dynamics in a non-deterministic Naming Game with Shared Memory | cs.MA | In the naming game, individuals or agents exchange pairwise local information
in order to communicate about objects in their common environment. The goal of
the game is to reach a consensus about naming these objects. Originally used to
investigate language formation and self-organizing vocabularies, we extend the
clas... | computer science |
35,589 | A Rational Decision Maker with Ordinal Utility under Uncertainty:
Optimism and Pessimism | cs.AI | In game theory and artificial intelligence, decision making models often
involve maximizing expected utility, which does not respect ordinal invariance.
In this paper, the author discusses the possibility of preserving ordinal
invariance and still making a rational decision under uncertainty. | computer science |
35,590 | Believe It or Not: Adding Belief Annotations to Databases | cs.DB | We propose a database model that allows users to annotate data with belief
statements. Our motivation comes from scientific database applications where a
community of users is working together to assemble, revise, and curate a shared
data repository. As the community accumulates knowledge and the database
content evolv... | computer science |
35,591 | Why so? or Why no? Functional Causality for Explaining Query Answers | cs.DB | In this paper, we propose causality as a unified framework to explain query
answers and non-answers, thus generalizing and extending several previously
proposed approaches of provenance and missing query result explanations.
We develop our framework starting from the well-studied definition of actual
causes by Halper... | computer science |
35,592 | Genetic algorithm for robotic telescope scheduling | cs.AI | This work was inspired by author experiences with a telescope scheduling.
Author long time goal is to develop and further extend software for an
autonomous observatory. The software shall provide users with all the
facilities they need to take scientific images of the night sky, cooperate with
other autonomous observat... | computer science |
35,593 | Constraint solvers: An empirical evaluation of design decisions | cs.AI | This paper presents an evaluation of the design decisions made in four
state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To
assess the impact of design decisions, instances of the five problem classes
n-Queens, Golomb Ruler, Magic Square, Social Golfers, and Balanced Incomplete
Block Design are m... | computer science |
35,594 | Some considerations on how the human brain must be arranged in order to
make its replication in a thinking machine possible | cs.AI | For the most of my life, I have earned my living as a computer vision
professional busy with image processing tasks and problems. In the computer
vision community there is a widespread belief that artificial vision systems
faithfully replicate human vision abilities or at least very closely mimic
them. It was a great s... | computer science |
35,595 | Efficiently Discovering Hammock Paths from Induced Similarity Networks | cs.AI | Similarity networks are important abstractions in many information management
applications such as recommender systems, corpora analysis, and medical
informatics. For instance, by inducing similarity networks between movies rated
similarly by users, or between documents containing common terms, and or
between clinical ... | computer science |
35,596 | Redundancy, Deduction Schemes, and Minimum-Size Bases for Association
Rules | cs.LO | Association rules are among the most widely employed data analysis methods in
the field of Data Mining. An association rule is a form of partial implication
between two sets of binary variables. In the most common approach, association
rules are parameterized by a lower bound on their confidence, which is the
empirical... | computer science |
35,597 | Belief Propagation for Min-cost Network Flow: Convergence and
Correctness | cs.DM | Message passing type algorithms such as the so-called Belief Propagation
algorithm have recently gained a lot of attention in the statistics, signal
processing and machine learning communities as attractive algorithms for
solving a variety of optimization and inference problems. As a decentralized,
easy to implement an... | computer science |
35,598 | The Socceral Force | cs.AI | We have an audacious dream, we would like to develop a simulation and virtual
reality system to support the decision making in European football (soccer). In
this review, we summarize the efforts that we have made to fulfil this dream
until recently. In addition, an introductory version of FerSML (Footballer and
Footba... | computer science |
35,599 | GRASP for the Coalition Structure Formation Problem | cs.AI | The coalition structure formation problem represents an active research area
in multi-agent systems. A coalition structure is defined as a partition of the
agents involved in a system into disjoint coalitions. The problem of finding
the optimal coalition structure is NP-complete. In order to find the optimal
solution i... | computer science |
35,600 | Learning Better Context Characterizations: An Intelligent Information
Retrieval Approach | cs.IR | This paper proposes an incremental method that can be used by an intelligent
system to learn better descriptions of a thematic context. The method starts
with a small number of terms selected from a simple description of the topic
under analysis and uses this description as the initial search context. Using
these terms... | computer science |
35,601 | Integrating User's Domain Knowledge with Association Rule Mining | cs.DB | This paper presents a variation of Apriori algorithm that includes the role
of domain expert to guide and speed up the overall knowledge discovery task.
Usually, the user is interested in finding relationships between certain
attributes instead of the whole dataset. Moreover, he can help the mining
algorithm to select ... | computer science |
35,602 | Real-Time Alert Correlation with Type Graphs | cs.AI | The premise of automated alert correlation is to accept that false alerts
from a low level intrusion detection system are inevitable and use attack
models to explain the output in an understandable way. Several algorithms exist
for this purpose which use attack graphs to model the ways in which attacks can
be combined.... | computer science |
35,603 | System Dynamics Modelling of the Processes Involving the Maintenance of
the Naive T Cell Repertoire | cs.AI | The study of immune system aging, i.e. immunosenescence, is a relatively new
research topic. It deals with understanding the processes of immunodegradation
that indicate signs of functionality loss possibly leading to death. Even
though it is not possible to prevent immunosenescence, there is great benefit
in comprehen... | computer science |
35,604 | Query strategy for sequential ontology debugging | cs.LO | Debugging of ontologies is an important prerequisite for their wide-spread
application, especially in areas that rely upon everyday users to create and
maintain knowledge bases, as in the case of the Semantic Web. Recent approaches
use diagnosis methods to identify causes of inconsistent or incoherent
ontologies. Howev... | computer science |
35,605 | Simple Type Theory as Framework for Combining Logics | cs.LO | Simple type theory is suited as framework for combining classical and
non-classical logics. This claim is based on the observation that various
prominent logics, including (quantified) multimodal logics and intuitionistic
logics, can be elegantly embedded in simple type theory. Furthermore, simple
type theory is suffic... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.