Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,607 | Agreement Maintenance Based on Schema and Ontology Change in P2P
Environment | cs.AI | This paper is concern about developing a semantic agreement maintenance
method based on semantic distance by calculating the change of local schema or
ontology. This approach is important in dynamic and autonomous environment, in
which the current approach assumed that agreement or mapping in static
environment. The co... | computer science |
36,608 | Optimisation of a Crossdocking Distribution Centre Simulation Model | cs.AI | This paper reports on continuing research into the modelling of an order
picking process within a Crossdocking distribution centre using Simulation
Optimisation. The aim of this project is to optimise a discrete event
simulation model and to understand factors that affect finding its optimal
performance. Our initial in... | computer science |
36,609 | On The Complexity and Completeness of Static Constraints for Breaking
Row and Column Symmetry | cs.AI | We consider a common type of symmetry where we have a matrix of decision
variables with interchangeable rows and columns. A simple and efficient method
to deal with such row and column symmetry is to post symmetry breaking
constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and
negative results on ... | computer science |
36,610 | Artificial Learning in Artificial Memories | cs.AI | Memory refinements are designed below to detect those sequences of actions
that have been repeated a given number n. Subsequently such sequences are
permitted to run without CPU involvement. This mimics human learning. Actions
are rehearsed and once learned, they are performed automatically without
conscious involvemen... | computer science |
36,611 | An axiomatic formalization of bounded rationality based on a
utility-information equivalence | cs.AI | Classic decision-theory is based on the maximum expected utility (MEU)
principle, but crucially ignores the resource costs incurred when determining
optimal decisions. Here we propose an axiomatic framework for bounded
decision-making that considers resource costs. Agents are formalized as
probability measures over inp... | computer science |
36,612 | Application of Data Mining to Network Intrusion Detection: Classifier
Selection Model | cs.NI | As network attacks have increased in number and severity over the past few
years, intrusion detection system (IDS) is increasingly becoming a critical
component to secure the network. Due to large volumes of security audit data as
well as complex and dynamic properties of intrusion behaviors, optimizing
performance of ... | computer science |
36,613 | How to Maximize User Satisfaction Degree in Multi-service IP Networks | cs.NI | Bandwidth allocation is a fundamental problem in communication networks. With
current network moving towards the Future Internet model, the problem is
further intensified as network traffic demanding far from exceeds network
bandwidth capability. Maintaining a certain user satisfaction degree therefore
becomes a challe... | computer science |
36,614 | A Note on Semantic Web Services Specification and Composition in
Constructive Description Logics | cs.AI | The idea of the Semantic Web is to annotate Web content and services with
computer interpretable descriptions with the aim to automatize many tasks
currently performed by human users. In the context of Web services, one of the
most interesting tasks is their composition. In this paper we formalize this
problem in the f... | computer science |
36,615 | Testing and Debugging Techniques for Answer Set Solver Development | cs.AI | This paper develops automated testing and debugging techniques for answer set
solver development. We describe a flexible grammar-based black-box ASP fuzz
testing tool which is able to reveal various defects such as unsound and
incomplete behavior, i.e. invalid answer sets and inability to find existing
solutions, in st... | computer science |
36,616 | Logic Programming for Finding Models in the Logics of Knowledge and its
Applications: A Case Study | cs.AI | The logics of knowledge are modal logics that have been shown to be effective
in representing and reasoning about knowledge in multi-agent domains.
Relatively few computational frameworks for dealing with computation of models
and useful transformations in logics of knowledge (e.g., to support multi-agent
planning with... | computer science |
36,617 | Loop Formulas for Description Logic Programs | cs.AI | Description Logic Programs (dl-programs) proposed by Eiter et al. constitute
an elegant yet powerful formalism for the integration of answer set programming
with description logics, for the Semantic Web. In this paper, we generalize the
notions of completion and loop formulas of logic programs to description logic
prog... | computer science |
36,618 | Formalization of Psychological Knowledge in Answer Set Programming and
its Application | cs.AI | In this paper we explore the use of Answer Set Programming (ASP) to
formalize, and reason about, psychological knowledge. In the field of
psychology, a considerable amount of knowledge is still expressed using only
natural language. This lack of a formalization complicates accurate studies,
comparisons, and verificatio... | computer science |
36,619 | Associative control processor with a rigid structure | cs.AR | The approach of applying associative processor for decision making problem
was proposed. It focuses on hardware implementations of fuzzy processing
systems, associativity as effective management basis of fuzzy processor. The
structural approach is being developed resulting in a quite simple and compact
parallel associa... | computer science |
36,620 | Introduction to the 26th International Conference on Logic Programming
Special Issue | cs.AI | This is the preface to the 26th International Conference on Logic Programming
Special Issue | computer science |
36,621 | Constraint Propagation for First-Order Logic and Inductive Definitions | cs.LO | Constraint propagation is one of the basic forms of inference in many
logic-based reasoning systems. In this paper, we investigate constraint
propagation for first-order logic (FO), a suitable language to express a wide
variety of constraints. We present an algorithm with polynomial-time data
complexity for constraint ... | computer science |
36,622 | RDFViewS: A Storage Tuning Wizard for RDF Applications | cs.DB | In recent years, the significant growth of RDF data used in numerous
applications has made its efficient and scalable manipulation an important
issue. In this paper, we present RDFViewS, a system capable of choosing the
most suitable views to materialize, in order to minimize the query response
time for a specific SPAR... | computer science |
36,623 | Mining tree-query associations in graphs | cs.DB | New applications of data mining, such as in biology, bioinformatics, or
sociology, are faced with large datasetsstructured as graphs. We introduce a
novel class of tree-shapedpatterns called tree queries, and present algorithms
for miningtree queries and tree-query associations in a large data graph. Novel
about our cl... | computer science |
36,624 | Modeling Spammer Behavior: Naïve Bayes vs. Artificial Neural Networks | cs.IR | Addressing the problem of spam emails in the Internet, this paper presents a
comparative study on Na\"ive Bayes and Artificial Neural Networks (ANN) based
modeling of spammer behavior. Keyword-based spam email filtering techniques
fall short to model spammer behavior as the spammer constantly changes tactics
to circumv... | computer science |
36,625 | Hybrid tractability of soft constraint problems | cs.AI | The constraint satisfaction problem (CSP) is a central generic problem in
computer science and artificial intelligence: it provides a common framework
for many theoretical problems as well as for many real-life applications. Soft
constraint problems are a generalisation of the CSP which allow the user to
model optimisa... | computer science |
36,626 | Machine Learning Approaches for Modeling Spammer Behavior | cs.IR | Spam is commonly known as unsolicited or unwanted email messages in the
Internet causing potential threat to Internet Security. Users spend a valuable
amount of time deleting spam emails. More importantly, ever increasing spam
emails occupy server storage space and consume network bandwidth. Keyword-based
spam email fi... | computer science |
36,627 | An Influence Diagram-Based Approach for Estimating Staff Training in
Software Industry | cs.SE | The successful completion of a software development process depends on the
analytical capability and foresightedness of the project manager. For the
project manager, the main intriguing task is to manage the risk factors as they
adversely influence the completion deadline. One such key risk factor is staff
training. Th... | computer science |
36,628 | Modélisation d'une analyse pragma-linguistique d'un forum de
discussion | cs.AI | We present in this paper, a modelling of an expertise in pragmatics. We
follow knowledge engineering techniques and observe the expert when he analyses
a social discussion forum. Then a number of models are defined. These models
emphasises the process followed by the expert and a number of criteria used in
his analysis... | computer science |
36,629 | Artificial Brain Based on Credible Neural Circuits in a Human Brain | cs.AI | Neurons are individually translated into simple gates to plan a brain based
on human psychology and intelligence. State machines, assumed previously
learned in subconscious associative memory are shown to enable equation solving
and rudimentary thinking using nanoprocessing within short term memory. | computer science |
36,630 | Strong Equivalence of Qualitative Optimization Problems | cs.LO | We introduce the framework of qualitative optimization problems (or, simply,
optimization problems) to represent preference theories. The formalism uses
separate modules to describe the space of outcomes to be compared (the
generator) and the preferences on outcomes (the selector). We consider two
types of optimization... | computer science |
36,631 | Extending Object-Oriented Languages by Declarative Specifications of
Complex Objects using Answer-Set Programming | cs.PL | Many applications require complexly structured data objects. Developing new
or adapting existing algorithmic solutions for creating such objects can be a
non-trivial and costly task if the considered objects are subject to different
application-specific constraints. Often, however, it is comparatively easy to
declarati... | computer science |
36,632 | Emotional control - conditio sine qua non for advanced artificial
intelligences? | cs.AI | Humans dispose of two intertwined information processing pathways, cognitive
information processing via neural firing patterns and diffusive volume control
via neuromodulation. The cognitive information processing in the brain is
traditionally considered to be the prime neural correlate of human
intelligence, clinical ... | computer science |
36,633 | Data Mining Session-Based Patient Reported Outcomes (PROs) in a Mental
Health Setting: Toward Data-Driven Clinical Decision Support and Personalized
Treatment | cs.AI | The CDOI outcome measure - a patient-reported outcome (PRO) instrument
utilizing direct client feedback - was implemented in a large, real-world
behavioral healthcare setting in order to evaluate previous findings from
smaller controlled studies. PROs provide an alternative window into treatment
effectiveness based on ... | computer science |
36,634 | KL-learning: Online solution of Kullback-Leibler control problems | math.OC | We introduce a stochastic approximation method for the solution of an ergodic
Kullback-Leibler control problem. A Kullback-Leibler control problem is a
Markov decision process on a finite state space in which the control cost is
proportional to a Kullback-Leibler divergence of the controlled transition
probabilities wi... | computer science |
36,635 | Maximum Production of Transmission Messages Rate for Service Discovery
Protocols | cs.NI | Minimizing the number of dropped User Datagram Protocol (UDP) messages in a
network is regarded as a challenge by researchers. This issue represents
serious problems for many protocols particularly those that depend on sending
messages as part of their strategy, such us service discovery protocols. This
paper proposes ... | computer science |
36,636 | Networks Utilization Improvements for Service Discovery Performance | cs.NI | Service discovery requests' messages have a vital role in sharing and
locating resources in many of service discovery protocols. Sending more
messages than a link can handle may cause congestion and loss of messages which
dramatically influences the performance of these protocols. Re-send the lost
messages result in la... | computer science |
36,637 | Pervasive Flexibility in Living Technologies through Degeneracy Based
Design | nlin.AO | The capacity to adapt can greatly influence the success of systems that need
to compensate for damaged parts, learn how to achieve robust performance in new
environments, or exploit novel opportunities that originate from new
technological interfaces or emerging markets. Many of the conditions in which
technology is re... | computer science |
36,638 | Application of Data Mining Techniques to a Selected Business
Organisation with Special Reference to Buying Behaviour | cs.DB | Data mining is a new concept & an exploration and analysis of large data
sets, in order to discover meaningful patterns and rules. Many organizations
are now using the data mining techniques to find out meaningful patterns from
the database. The present paper studies how data mining techniques can be apply
to the large... | computer science |
36,639 | Performance Evaluation of Road Traffic Control Using a Fuzzy Cellular
Model | cs.AI | In this paper a method is proposed for performance evaluation of road traffic
control systems. The method is designed to be implemented in an on-line
simulation environment, which enables optimisation of adaptive traffic control
strategies. Performance measures are computed using a fuzzy cellular traffic
model, formula... | computer science |
36,640 | Enhancing Support for Knowledge Works: A relatively unexplored vista of
computing research | cs.AI | Let us envision a new class of IT systems, the "Support Systems for Knowledge
Works" or SSKW. An SSKW can be defined as a system built for providing
comprehensive support to human knowledge-workers while performing instances of
complex knowledge-works of a particular type within a particular domain of
professional acti... | computer science |
36,641 | Document Clustering based on Topic Maps | cs.IR | Importance of document clustering is now widely acknowledged by researchers
for better management, smart navigation, efficient filtering, and concise
summarization of large collection of documents like World Wide Web (WWW). The
next challenge lies in semantically performing clustering based on the semantic
contents of ... | computer science |
36,642 | A comparison of two suffix tree-based document clustering algorithms | cs.IR | Document clustering as an unsupervised approach extensively used to navigate,
filter, summarize and manage large collection of document repositories like the
World Wide Web (WWW). Recently, focuses in this domain shifted from traditional
vector based document similarity for clustering to suffix tree based document
simi... | computer science |
36,643 | Parameterized Complexity and Kernel Bounds for Hard Planning Problems | cs.DS | The propositional planning problem is a notoriously difficult computational
problem. Downey et al. (1999) initiated the parameterized analysis of planning
(with plan length as the parameter) and B\"ackstr\"om et al. (2012) picked up
this line of research and provided an extensive parameterized analysis under
various re... | computer science |
36,644 | Student Modeling using Case-Based Reasoning in Conventional Learning
System | cs.AI | Conventional face-to-face classrooms are still the main learning system
applied in Indonesia. In assisting such conventional learning towards an
optimal learning, formative evaluations are needed to monitor the progress of
the class. This task can be very hard when the size of the class is large.
Hence, this research a... | computer science |
36,645 | MaTrust: An Effective Multi-Aspect Trust Inference Model | cs.DB | Trust is a fundamental concept in many real-world applications such as
e-commerce and peer-to-peer networks. In these applications, users can generate
local opinions about the counterparts based on direct experiences, and these
opinions can then be aggregated to build trust among unknown users. The
mechanism to build n... | computer science |
36,646 | Secured Wireless Communication using Fuzzy Logic based High Speed
Public-Key Cryptography (FLHSPKC) | cs.CR | In this paper secured wireless communication using fuzzy logic based high
speed public key cryptography (FLHSPKC) has been proposed by satisfying the
major issues likes computational safety, power management and restricted usage
of memory in wireless communication. Wireless Sensor Network (WSN) has several
major constr... | computer science |
36,647 | Dynamic Decision Support System Based on Bayesian Networks Application
to fight against the Nosocomial Infections | cs.AI | The improvement of medical care quality is a significant interest for the
future years. The fight against nosocomial infections (NI) in the intensive
care units (ICU) is a good example. We will focus on a set of observations
which reflect the dynamic aspect of the decision, result of the application of
a Medical Decisi... | computer science |
36,648 | Mining Determinism in Human Strategic Behavior | cs.GT | This work lies in the fusion of experimental economics and data mining. It
continues author's previous work on mining behaviour rules of human subjects
from experimental data, where game-theoretic predictions partially fail to
work. Game-theoretic predictions aka equilibria only tend to success with
experienced subject... | computer science |
36,649 | Quantum Consciousness Soccer Simulator | cs.AI | In cognitive sciences it is not uncommon to use various games effectively.
For example, in artificial intelligence, the RoboCup initiative was to set up
to catalyse research on the field of autonomous agent technology. In this
paper, we introduce a similar soccer simulation initiative to try to
investigate a model of h... | computer science |
36,650 | A New Similarity Measure for Taxonomy Based on Edge Counting | cs.AI | This paper introduces a new similarity measure based on edge counting in a
taxonomy like WorldNet or Ontology. Measurement of similarity between text
segments or concepts is very useful for many applications like information
retrieval, ontology matching, text mining, and question answering and so on.
Several measures h... | computer science |
36,651 | An Experiment on the Connection between the DLs' Family DL<ForAllPiZero>
and the Real World | cs.AI | This paper describes the analysis of a selected testbed of Semantic Web
ontologies, by a SPARQL query, which determines those ontologies that can be
related to the description logic DL<ForAllPiZero>, introduced in [4] and
studied in [9]. We will see that a reasonable number of them is expressible
within such computatio... | computer science |
36,652 | A hybrid cross entropy algorithm for solving dynamic transit network
design problem | cs.NI | This paper proposes a hybrid multiagent learning algorithm for solving the
dynamic simulation-based bilevel network design problem. The objective is to
determine the op-timal frequency of a multimodal transit network, which
minimizes total users' travel cost and operation cost of transit lines. The
problem is formulate... | computer science |
36,653 | Visualization and clustering by 3D cellular automata: Application to
unstructured data | cs.AI | Given the limited performance of 2D cellular automata in terms of space when
the number of documents increases and in terms of visualization clusters, our
motivation was to experiment these cellular automata by increasing the size to
view the impact of size on quality of results. The representation of textual
data was ... | computer science |
36,654 | Obesity Heuristic, New Way On Artificial Immune Systems | cs.AI | There is a need for new metaphors from immunology to flourish the application
areas of Artificial Immune Systems. A metaheuristic called Obesity Heuristic
derived from advances in obesity treatment is proposed. The main forces of the
algorithm are the generation omega-6 and omega-3 fatty acids. The algorithm
works with... | computer science |
36,655 | New Heuristics for Interfacing Human Motor System using Brain Waves | cs.HC | There are many new forms of interfacing human users to machines. We persevere
here electric mechanical form of interaction between human and machine. The
emergence of brain-computer interface allows mind-to-movement systems. The
story of the Pied Piper inspired us to devise some new heuristics for
interfacing human mot... | computer science |
36,656 | Intrusion Detection on Smartphones | cs.CR | Smartphone technology is more and more becoming the predominant communication
tool for people across the world. People use their smartphones to keep their
contact data, to browse the internet, to exchange messages, to keep notes,
carry their personal files and documents, etc. Users while browsing are also
capable of sh... | computer science |
36,657 | Investigation of "Enhancing flexibility and robustness in multi-agent
task scheduling" | cs.DS | Wilson et al. propose a measure of flexibility in project scheduling problems
and propose several ways of distributing flexibility over tasks without
overrunning the deadline. These schedules prove quite robust: delays of some
tasks do not necessarily lead to delays of subsequent tasks. The number of
tasks that finish ... | computer science |
36,658 | Simulating Ability: Representing Skills in Games | cs.GT | Throughout the history of games, representing the abilities of the various
agents acting on behalf of the players has been a central concern. With
increasingly sophisticated games emerging, these simulations have become more
realistic, but the underlying mechanisms are still, to a large extent, of an ad
hoc nature. Thi... | computer science |
36,659 | An investigation into the relationship between type-2 FOU size and
environmental uncertainty in robotic control | cs.RO | It has been suggested that, when faced with large amounts of uncertainty in
situations of automated control, type-2 fuzzy logic based controllers will
out-perform the simpler type-1 varieties due to the latter lacking the
flexibility to adapt accordingly. This paper aims to investigate this problem
in detail in order t... | computer science |
36,660 | A Knowledge-based Treatment of Human-Automation Systems | cs.HC | In a supervisory control system the human agent knowledge of past, current,
and future system behavior is critical for system performance. Being able to
reason about that knowledge in a precise and structured manner is central to
effective system design. In this paper we introduce the application of a
well-established ... | computer science |
36,661 | Tractable Combinations of Global Constraints | cs.AI | We study the complexity of constraint satisfaction problems involving global
constraints, i.e., special-purpose constraints provided by a solver and
represented implicitly by a parametrised algorithm. Such constraints are widely
used; indeed, they are one of the key reasons for the success of constraint
programming in ... | computer science |
36,662 | Routing in Wireless Mesh Networks: Two Soft Computing Based Approaches | cs.NI | Due to dynamic network conditions, routing is the most critical part in WMNs
and needs to be optimised. The routing strategies developed for WMNs must be
efficient to make it an operationally self configurable network. Thus we need
to resort to near shortest path evaluation. This lays down the requirement of
some soft ... | computer science |
36,663 | Soft Computing Framework for Routing in Wireless Mesh Networks: An
Integrated Cost Function Approach | cs.NI | Dynamic behaviour of a WMN imposes stringent constraints on the routing
policy of the network. In the shortest path based routing the shortest paths
needs to be evaluated within a given time frame allowed by the WMN dynamics.
The exact reasoning based shortest path evaluation methods usually fail to meet
this rigid req... | computer science |
36,664 | Artificial Intelligence MArkup Language: A Brief Tutorial | cs.AI | The purpose of this paper is to serve as a reference guide for the
development of chatterbots implemented with the AIML language. In order to
achieve this, the main concepts in Pattern Recognition area are described
because the AIML uses such theoretical framework in their syntactic and
semantic structures. After that,... | computer science |
36,665 | Action-based Character AI in Video-games with CogBots Architecture: A
Preliminary Report | cs.AI | In this paper we propose an architecture for specifying the interaction of
non-player characters (NPCs) in the game-world in a way that abstracts common
tasks in four main conceptual components, namely perception, deliberation,
control, action. We argue that this architecture, inspired by AI research on
autonomous agen... | computer science |
36,666 | Parameterized Complexity Results for Plan Reuse | cs.AI | Planning is a notoriously difficult computational problem of high worst-case
complexity. Researchers have been investing significant efforts to develop
heuristics or restrictions to make planning practically feasible. Case-based
planning is a heuristic approach where one tries to reuse previous experience
when solving ... | computer science |
36,667 | A generalized back-door criterion | stat.ME | We generalize Pearl's back-door criterion for directed acyclic graphs (DAGs)
to more general types of graphs that describe Markov equivalence classes of
DAGs and/or allow for arbitrarily many hidden variables. We also give easily
checkable necessary and sufficient graphical criteria for the existence of a
set of variab... | computer science |
36,668 | How to minimize the energy consumption in mobile ad-hoc networks | cs.AI | In this work we are interested in the problem of energy management in Mobile
Ad-hoc Network (MANET). The solving and optimization of MANET allow assisting
the users to efficiently use their devices in order to minimize the batteries
power consumption. In this framework, we propose a modelling of the MANET in
form of a ... | computer science |
36,669 | The Use of Cuckoo Search in Estimating the Parameters of Software
Reliability Growth Models | cs.AI | This work aims to investigate the reliability of software products as an
important attribute of computer programs; it helps to decide the degree of
trustworthiness a program has in accomplishing its specific functions. This is
done using the Software Reliability Growth Models (SRGMs) through the
estimation of their par... | computer science |
36,670 | A novel approach of solving the CNF-SAT problem | cs.AI | In this paper, we discussed CNF-SAT problem (NP-Complete problem) and
analysis two solutions that can solve the problem, the PL-Resolution algorithm
and the WalkSAT algorithm. PL-Resolution is a sound and complete algorithm that
can be used to determine satisfiability and unsatisfiability with certainty.
WalkSAT can de... | computer science |
36,671 | A gradient descent technique coupled with a dynamic simulation to
determine the near optimum orientation of floor plan designs | cs.CE | A prototype tool to assist architects during the early design stage of floor
plans has been developed, consisting of an Evolutionary Program for the Space
Allocation Problem (EPSAP), which generates sets of floor plan alternatives
according to the architect's preferences; and a Floor Plan Performance
Optimization Progr... | computer science |
36,672 | Man and Machine: Questions of Risk, Trust and Accountability in Today's
AI Technology | cs.CY | Artificial Intelligence began as a field probing some of the most fundamental
questions of science - the nature of intelligence and the design of intelligent
artifacts. But it has grown into a discipline that is deeply entwined with
commerce and society. Today's AI technology, such as expert systems and
intelligent ass... | computer science |
36,673 | An Architecture for Autonomously Controlling Robot with Embodiment in
Real World | cs.RO | In the real world, robots with embodiment face various issues such as dynamic
continuous changes of the environment and input/output disturbances. The key to
solving these issues can be found in daily life; people `do actions associated
with sensing' and `dynamically change their plans when necessary'. We propose
the u... | computer science |
36,674 | Knowledge Representation for Robots through Human-Robot Interaction | cs.AI | The representation of the knowledge needed by a robot to perform complex
tasks is restricted by the limitations of perception. One possible way of
overcoming this situation and designing "knowledgeable" robots is to rely on
the interaction with the user. We propose a multi-modal interaction framework
that allows to eff... | computer science |
36,675 | ROSoClingo: A ROS package for ASP-based robot control | cs.RO | Knowledge representation and reasoning capacities are vital to cognitive
robotics because they provide higher level cognitive functions for reasoning
about actions, environments, goals, perception, etc. Although Answer Set
Programming (ASP) is well suited for modelling such functions, there was so far
no seamless way t... | computer science |
36,676 | Reasoning for Moving Blocks Problem: Formal Representation and
Implementation | cs.RO | The combined approach of the Qualitative Reasoning and Probabilistic
Functions for the knowledge representation is proposed. The method aims at
represent uncertain, qualitative knowledge that is essential for the moving
blocks task's execution. The attempt to formalize the commonsense knowledge is
performed with the Si... | computer science |
36,677 | Levels of Integration between Low-Level Reasoning and Task Planning | cs.RO | We provide a systematic analysis of levels of integration between discrete
high-level reasoning and continuous low-level reasoning to address hybrid
planning problems in robotics. We identify four distinct strategies for such an
integration: (i) low-level checks are done for all possible cases in advance
and then this ... | computer science |
36,678 | Herding the Crowd: Automated Planning for Crowdsourced Planning | cs.AI | There has been significant interest in crowdsourcing and human computation.
One subclass of human computation applications are those directed at tasks that
involve planning (e.g. travel planning) and scheduling (e.g. conference
scheduling). Much of this work appears outside the traditional automated
planning forums, an... | computer science |
36,679 | Automated Attack Planning | cs.AI | Penetration Testing is a methodology for assessing network security, by
generating and executing possible attacks. Doing so automatically allows for
regular and systematic testing. A key question then is how to automatically
generate the attacks. A natural way to address this issue is as an attack
planning problem. In ... | computer science |
36,680 | Les POMDP font de meilleurs hackers: Tenir compte de l'incertitude dans
les tests de penetration | cs.AI | Penetration Testing is a methodology for assessing network security, by
generating and executing possible hacking attacks. Doing so automatically
allows for regular and systematic testing. A key question is how to generate
the attacks. This is naturally formulated as planning under uncertainty, i.e.,
under incomplete k... | computer science |
36,681 | Combining Answer Set Programming and POMDPs for Knowledge Representation
and Reasoning on Mobile Robots | cs.AI | For widespread deployment in domains characterized by partial observability,
non-deterministic actions and unforeseen changes, robots need to adapt sensing,
processing and interaction with humans to the tasks at hand. While robots
typically cannot process all sensor inputs or operate without substantial
domain knowledg... | computer science |
36,682 | POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration
Testing | cs.AI | Penetration Testing is a methodology for assessing network security, by
generating and executing possible hacking attacks. Doing so automatically
allows for regular and systematic testing. A key question is how to generate
the attacks. This is naturally formulated as planning under uncertainty, i.e.,
under incomplete k... | computer science |
36,683 | GOTCHA Password Hackers! | cs.CR | We introduce GOTCHAs (Generating panOptic Turing Tests to Tell Computers and
Humans Apart) as a way of preventing automated offline dictionary attacks
against user selected passwords. A GOTCHA is a randomized puzzle generation
protocol, which involves interaction between a computer and a human.
Informally, a GOTCHA sho... | computer science |
36,684 | An Agent-based Model of the Cognitive Mechanisms Underlying the Origins
of Creative Cultural Evolution | cs.MA | Human culture is uniquely cumulative and open-ended. Using a computational
model of cultural evolution in which neural network based agents evolve ideas
for actions through invention and imitation, we tested the hypothesis that this
is due to the capacity for recursive recall. We compared runs in which agents
were limi... | computer science |
36,685 | Validation Rules for Assessing and Improving SKOS Mapping Quality | cs.AI | The Simple Knowledge Organization System (SKOS) is popular for expressing
controlled vocabularies, such as taxonomies, classifications, etc., for their
use in Semantic Web applications. Using SKOS, concepts can be linked to other
concepts and organized into hierarchies inside a single terminology system.
Meanwhile, exp... | computer science |
36,686 | An Extensive Report on Cellular Automata Based Artificial Immune System
for Strengthening Automated Protein Prediction | cs.AI | Artificial Immune System (AIS-MACA) a novel computational intelligence
technique is can be used for strengthening the automated protein prediction
system with more adaptability and incorporating more parallelism to the system.
Most of the existing approaches are sequential which will classify the input
into four major ... | computer science |
36,687 | Effectiveness of pre- and inprocessing for CDCL-based SAT solving | cs.LO | Applying pre- and inprocessing techniques to simplify CNF formulas both
before and during search can considerably improve the performance of modern SAT
solvers. These algorithms mostly aim at reducing the number of clauses,
literals, and variables in the formula. However, to be worthwhile, it is
necessary that their ad... | computer science |
36,688 | Intelligent City Traffic Management and Public Transportation System | cs.AI | Intelligent Transportation System in case of cities is controlling traffic
congestion and regulating the traffic flow. This paper presents three modules
that will help in managing city traffic issues and ultimately gives advanced
development in transportation system. First module, Congestion Detection and
Management wi... | computer science |
36,689 | Dissociation and Propagation for Approximate Lifted Inference with
Standard Relational Database Management Systems | cs.DB | Probabilistic inference over large data sets is a challenging data management
problem since exact inference is generally #P-hard and is most often solved
approximately with sampling-based methods today. This paper proposes an
alternative approach for approximate evaluation of conjunctive queries with
standard relationa... | computer science |
36,690 | Knowledge-Based Programs as Plans: Succinctness and the Complexity of
Plan Existence | cs.AI | Knowledge-based programs (KBPs) are high-level protocols describing the
course of action an agent should perform as a function of its knowledge. The
use of KBPs for expressing action policies in AI planning has been surprisingly
overlooked. Given that to each KBP corresponds an equivalent plan and vice
versa, KBPs are ... | computer science |
36,691 | A Complete Parameterized Complexity Analysis of Bounded Planning | cs.AI | The propositional planning problem is a notoriously difficult computational
problem, which remains hard even under strong syntactical and structural
restrictions. Given its difficulty it becomes natural to study planning in the
context of parameterized complexity. In this paper we continue the work
initiated by Downey,... | computer science |
36,692 | Toward a Formal Model of the Shifting Relationship between Concepts and
Contexts during Associative Thought | cs.AI | The quantum inspired State Context Property (SCOP) theory of concepts is
unique amongst theories of concepts in offering a means of incorporating that
for each concept in each different context there are an unlimited number of
exemplars, or states, of varying degrees of typicality. Working with data from
a study in whi... | computer science |
36,693 | On the Tractability of Minimal Model Computation for Some CNF Theories | cs.AI | Designing algorithms capable of efficiently constructing minimal models of
CNFs is an important task in AI. This paper provides new results along this
research line and presents new algorithms for performing minimal model finding
and checking over positive propositional CNFs and model minimization over
propositional CN... | computer science |
36,694 | A Hybrid Local Search for Simplified Protein Structure Prediction | cs.CE | Protein structure prediction based on Hydrophobic-Polar energy model
essentially becomes searching for a conformation having a compact hydrophobic
core at the center. The hydrophobic core minimizes the interaction energy
between the amino acids of the given protein. Local search algorithms can
quickly find very good co... | computer science |
36,695 | Free-configuration Biased Sampling for Motion Planning: Errata | cs.RO | This document contains improved and updated proofs of convergence for the
sampling method presented in our paper "Free-configuration Biased Sampling for
Motion Planning". | computer science |
36,696 | Adaptive Measurement-Based Policy-Driven QoS Management with
Fuzzy-Rule-based Resource Allocation | cs.NI | Fixed and wireless networks are increasingly converging towards common
connectivity with IP-based core networks. Providing effective end-to-end
resource and QoS management in such complex heterogeneous converged network
scenarios requires unified, adaptive and scalable solutions to integrate and
co-ordinate diverse QoS... | computer science |
36,697 | Automatic ontology generation for data mining using fca and clustering | cs.DB | Motivated by the increased need for formalized representations of the domain
of Data Mining, the success of using Formal Concept Analysis (FCA) and Ontology
in several Computer Science fields, we present in this paper a new approach for
automatic generation of Fuzzy Ontology of Data Mining (FODM), through the
fusion of... | computer science |
36,698 | Unsupervised learning human's activities by overexpressed recognized
non-speech sounds | cs.AI | Human activity and environment produces sounds such as, at home, the noise
produced by water, cough, or television. These sounds can be used to determine
the activity in the environment. The objective is to monitor a person's
activity or determine his environment using a single low cost microphone by
sound analysis. Th... | computer science |
36,699 | A novel local search based on variable-focusing for random K-SAT | cs.AI | We introduce a new local search algorithm for satisfiability problems. Usual
approaches focus uniformly on unsatisfied clauses. The new method works by
picking uniformly random variables in unsatisfied clauses. A Variable-based
Focused Metropolis Search (V-FMS) is then applied to random 3-SAT. We show that
it is quite ... | computer science |
36,700 | Sound, Complete and Minimal UCQ-Rewriting for Existential Rules | cs.AI | We address the issue of Ontology-Based Data Access, with ontologies
represented in the framework of existential rules, also known as Datalog+/-. A
well-known approach involves rewriting the query using ontological knowledge.
We focus here on the basic rewriting technique which consists of rewriting the
initial query in... | computer science |
36,701 | Structural Weights in Ontology Matching | cs.AI | Ontology matching finds correspondences between similar entities of different
ontologies. Two ontologies may be similar in some aspects such as structure,
semantic etc. Most ontology matching systems integrate multiple matchers to
extract all the similarities that two ontologies may have. Thus, we face a
major problem ... | computer science |
36,702 | Inferring Multilateral Relations from Dynamic Pairwise Interactions | cs.AI | Correlations between anomalous activity patterns can yield pertinent
information about complex social processes: a significant deviation from normal
behavior, exhibited simultaneously by multiple pairs of actors, provides
evidence for some underlying relationship involving those pairs---i.e., a
multilateral relation. W... | computer science |
36,703 | Towards a New Science of a Clinical Data Intelligence | cs.CY | In this paper we define Clinical Data Intelligence as the analysis of data
generated in the clinical routine with the goal of improving patient care. We
define a science of a Clinical Data Intelligence as a data analysis that
permits the derivation of scientific, i.e., generalizable and reliable results.
We argue that ... | computer science |
36,704 | A brief network analysis of Artificial Intelligence publication | cs.AI | In this paper, we present an illustration to the history of Artificial
Intelligence(AI) with a statistical analysis of publish since 1940. We
collected and mined through the IEEE publish data base to analysis the
geological and chronological variance of the activeness of research in AI. The
connections between differen... | computer science |
36,705 | A Constraint Programming Approach for Mining Sequential Patterns in a
Sequence Database | cs.AI | Constraint-based pattern discovery is at the core of numerous data mining
tasks. Patterns are extracted with respect to a given set of constraints
(frequency, closedness, size, etc). In the context of sequential pattern
mining, a large number of devoted techniques have been developed for solving
particular classes of c... | computer science |
36,706 | Solving Minimum Vertex Cover Problem Using Learning Automata | cs.AI | Minimum vertex cover problem is an NP-Hard problem with the aim of finding
minimum number of vertices to cover graph. In this paper, a learning automaton
based algorithm is proposed to find minimum vertex cover in graph. In the
proposed algorithm, each vertex of graph is equipped with a learning automaton
that has two ... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.