Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,402 | Informal Concepts in Machines | cs.AI | This paper constructively proves the existence of an effective procedure
generating a computable (total) function that is not contained in any given
effectively enumerable set of such functions. The proof implies the existence
of machines that process informal concepts such as computable (total) functions
beyond the li... | computer science |
18,403 | A two-step fusion process for multi-criteria decision applied to natural
hazards in mountains | cs.AI | Mountain river torrents and snow avalanches generate human and material
damages with dramatic consequences. Knowledge about natural phenomenona is
often lacking and expertise is required for decision and risk management
purposes using multi-disciplinary quantitative or qualitative approaches.
Expertise is considered as... | computer science |
18,404 | On Building a Knowledge Base for Stability Theory | cs.AI | A lot of mathematical knowledge has been formalized and stored in
repositories by now: different mathematical theorems and theories have been
taken into consideration and included in mathematical repositories.
Applications more distant from pure mathematics, however --- though based on
these theories --- often need mor... | computer science |
18,405 | Recognizability of Individual Creative Style Within and Across Domains:
Preliminary Studies | cs.AI | It is hypothesized that creativity arises from the self-mending capacity of
an internal model of the world, or worldview. The uniquely honed worldview of a
creative individual results in a distinctive style that is recognizable within
and across domains. It is further hypothesized that creativity is domaingeneral
in th... | computer science |
18,406 | Feature Selection Using Regularization in Approximate Linear Programs
for Markov Decision Processes | cs.AI | Approximate dynamic programming has been used successfully in a large variety
of domains, but it relies on a small set of provided approximation features to
calculate solutions reliably. Large and rich sets of features can cause
existing algorithms to overfit because of a limited number of samples. We
address this shor... | computer science |
18,407 | Evolving Genes to Balance a Pole | cs.AI | We discuss how to use a Genetic Regulatory Network as an evolutionary
representation to solve a typical GP reinforcement problem, the pole balancing.
The network is a modified version of an Artificial Regulatory Network proposed
a few years ago, and the task could be solved only by finding a proper way of
connecting in... | computer science |
18,408 | Using machine learning to make constraint solver implementation
decisions | cs.AI | Programs to solve so-called constraint problems are complex pieces of
software which require many design decisions to be made more or less
arbitrarily by the implementer. These decisions affect the performance of the
finished solver significantly. Once a design decision has been made, it cannot
easily be reversed, alth... | computer science |
18,409 | A Soft Computing Model for Physicians' Decision Process | cs.AI | In this paper the author presents a kind of Soft Computing Technique, mainly
an application of fuzzy set theory of Prof. Zadeh [16], on a problem of Medical
Experts Systems. The choosen problem is on design of a physician's decision
model which can take crisp as well as fuzzy data as input, unlike the
traditional model... | computer science |
18,410 | The Complexity of Manipulating $k$-Approval Elections | cs.AI | An important problem in computational social choice theory is the complexity
of undesirable behavior among agents, such as control, manipulation, and
bribery in election systems. These kinds of voting strategies are often
tempting at the individual level but disastrous for the agents as a whole.
Creating election syste... | computer science |
18,411 | Inaccuracy Minimization by Partioning Fuzzy Data Sets - Validation of
Analystical Methodology | cs.AI | In the last two decades, a number of methods have been proposed for
forecasting based on fuzzy time series. Most of the fuzzy time series methods
are presented for forecasting of car road accidents. However, the forecasting
accuracy rates of the existing methods are not good enough. In this paper, we
compared our propo... | computer science |
18,412 | Combining Naive Bayes and Decision Tree for Adaptive Intrusion Detection | cs.AI | In this paper, a new learning algorithm for adaptive network intrusion
detection using naive Bayesian classifier and decision tree is presented, which
performs balance detections and keeps false positives at acceptable level for
different types of network attacks, and eliminates redundant attributes as well
as contradi... | computer science |
18,413 | Automated Reasoning and Presentation Support for Formalizing Mathematics
in Mizar | cs.AI | This paper presents a combination of several automated reasoning and proof
presentation tools with the Mizar system for formalization of mathematics. The
combination forms an online service called MizAR, similar to the SystemOnTPTP
service for first-order automated reasoning. The main differences to
SystemOnTPTP are th... | computer science |
18,414 | Integrating Structured Metadata with Relational Affinity Propagation | cs.AI | Structured and semi-structured data describing entities, taxonomies and
ontologies appears in many domains. There is a huge interest in integrating
structured information from multiple sources; however integrating structured
data to infer complex common structures is a difficult task because the
integration must aggreg... | computer science |
18,415 | A Formalization of the Turing Test | cs.AI | The paper offers a mathematical formalization of the Turing test. This
formalization makes it possible to establish the conditions under which some
Turing machine will pass the Turing test and the conditions under which every
Turing machine (or every Turing machine of the special class) will fail the
Turing test. | computer science |
18,416 | Growing a Tree in the Forest: Constructing Folksonomies by Integrating
Structured Metadata | cs.AI | Many social Web sites allow users to annotate the content with descriptive
metadata, such as tags, and more recently to organize content hierarchically.
These types of structured metadata provide valuable evidence for learning how a
community organizes knowledge. For instance, we can aggregate many personal
hierarchies... | computer science |
18,417 | Symmetries of Symmetry Breaking Constraints | cs.AI | Symmetry is an important feature of many constraint programs. We show that
any problem symmetry acting on a set of symmetry breaking constraints can be
used to break symmetry. Different symmetries pick out different solutions in
each symmetry class. This simple but powerful idea can be used in a number of
different way... | computer science |
18,418 | Learning Probabilistic Hierarchical Task Networks to Capture User
Preferences | cs.AI | We propose automatically learning probabilistic Hierarchical Task Networks
(pHTNs) in order to capture a user's preferences on plans, by observing only
the user's behavior. HTNs are a common choice of representation for a variety
of purposes in planning, including work on learning in planning. Our
contributions are (a)... | computer science |
18,419 | Brain-Like Stochastic Search: A Research Challenge and Funding
Opportunity | cs.AI | Brain-Like Stochastic Search (BLiSS) refers to this task: given a family of
utility functions U(u,A), where u is a vector of parameters or task
descriptors, maximize or minimize U with respect to u, using networks (Option
Nets) which input A and learn to generate good options u stochastically. This
paper discusses why ... | computer science |
18,420 | Variational Program Inference | cs.AI | We introduce a framework for representing a variety of interesting problems
as inference over the execution of probabilistic model programs. We represent a
"solution" to such a problem as a guide program which runs alongside the model
program and influences the model program's random choices, leading the model
program ... | computer science |
18,421 | The Dilated Triple | cs.AI | The basic unit of meaning on the Semantic Web is the RDF statement, or
triple, which combines a distinct subject, predicate and object to make a
definite assertion about the world. A set of triples constitutes a graph, to
which they give a collective meaning. It is upon this simple foundation that
the rich, complex kno... | computer science |
18,422 | Game Information System | cs.AI | In this Information system age many organizations consider information system
as their weapon to compete or gain competitive advantage or give the best
services for non profit organizations. Game Information System as combining
Information System and game is breakthrough to achieve organizations'
performance. The Game ... | computer science |
18,423 | Virtual information system on working area | cs.AI | In order to get strategic positioning for competition in business
organization, the information system must be ahead in this information age
where the information as one of the weapons to win the competition and in the
right hand the information will become a right bullet. The information system
with the information te... | computer science |
18,424 | Indonesian Earthquake Decision Support System | cs.AI | Earthquake DSS is an information technology environment which can be used by
government to sharpen, make faster and better the earthquake mitigation
decision. Earthquake DSS can be delivered as E-government which is not only for
government itself but in order to guarantee each citizen's rights for
education, training a... | computer science |
18,425 | MDPs with Unawareness | cs.AI | Markov decision processes (MDPs) are widely used for modeling decision-making
problems in robotics, automated control, and economics. Traditional MDPs assume
that the decision maker (DM) knows all states and actions. However, this may
not be true in many situations of interest. We define a new framework, MDPs
with unaw... | computer science |
18,426 | Global Optimization for Value Function Approximation | cs.AI | Existing value function approximation methods have been successfully used in
many applications, but they often lack useful a priori error bounds. We propose
a new approximate bilinear programming formulation of value function
approximation, which employs global optimization. The formulation provides
strong a priori gua... | computer science |
18,427 | A General Framework for Equivalences in Answer-Set Programming by
Countermodels in the Logic of Here-and-There | cs.AI | Different notions of equivalence, such as the prominent notions of strong and
uniform equivalence, have been studied in Answer-Set Programming, mainly for
the purpose of identifying programs that can serve as substitutes without
altering the semantics, for instance in program optimization. Such semantic
comparisons are... | computer science |
18,428 | Human Disease Diagnosis Using a Fuzzy Expert System | cs.AI | Human disease diagnosis is a complicated process and requires high level of
expertise. Any attempt of developing a web-based expert system dealing with
human disease diagnosis has to overcome various difficulties. This paper
describes a project work aiming to develop a web-based fuzzy expert system for
diagnosing human... | computer science |
18,429 | Vagueness of Linguistic variable | cs.AI | In the area of computer science focusing on creating machines that can engage
on behaviors that humans consider intelligent. The ability to create
intelligent machines has intrigued humans since ancient times and today with
the advent of the computer and 50 years of research into various programming
techniques, the dre... | computer science |
18,430 | An Efficient Technique for Similarity Identification between Ontologies | cs.AI | Ontologies usually suffer from the semantic heterogeneity when simultaneously
used in information sharing, merging, integrating and querying processes.
Therefore, the similarity identification between ontologies being used becomes
a mandatory task for all these processes to handle the problem of semantic
heterogeneity.... | computer science |
18,431 | The State of the Art: Ontology Web-Based Languages: XML Based | cs.AI | Many formal languages have been proposed to express or represent Ontologies,
including RDF, RDFS, DAML+OIL and OWL. Most of these languages are based on XML
syntax, but with various terminologies and expressiveness. Therefore, choosing
a language for building an Ontology is the main step. The main point of
choosing lan... | computer science |
18,432 | Understanding Semantic Web and Ontologies: Theory and Applications | cs.AI | Semantic Web is actually an extension of the current one in that it
represents information more meaningfully for humans and computers alike. It
enables the description of contents and services in machine-readable form, and
enables annotating, discovering, publishing, advertising and composing services
to be automated. ... | computer science |
18,433 | GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables | cs.AI | Finding the structure of a graphical model has been received much attention
in many fields. Recently, it is reported that the non-Gaussianity of data
enables us to identify the structure of a directed acyclic graph without any
prior knowledge on the structure. In this paper, we propose a novel
non-Gaussianity based alg... | computer science |
18,434 | Soft Approximations and uni-int Decision Making | cs.AI | Notions of core, support and inversion of a soft set have been defined and
studied. Soft approximations are soft sets developed through core and support,
and are used for granulating the soft space. Membership structure of a soft set
has been probed in and many interesting properties presented. The mathematical
apparat... | computer science |
18,435 | Reasoning Support for Risk Prediction and Prevention in Independent
Living | cs.AI | In recent years there has been growing interest in solutions for the delivery
of clinical care for the elderly, due to the large increase in aging
population. Monitoring a patient in his home environment is necessary to ensure
continuity of care in home settings, but, to be useful, this activity must not
be too invasiv... | computer science |
18,436 | Solving the Resource Constrained Project Scheduling Problem with
Generalized Precedences by Lazy Clause Generation | cs.AI | The technical report presents a generic exact solution approach for
minimizing the project duration of the resource-constrained project scheduling
problem with generalized precedences (Rcpsp/max). The approach uses lazy clause
generation, i.e., a hybrid of finite domain and Boolean satisfiability solving,
in order to a... | computer science |
18,437 | Experimental Evaluation of Branching Schemes for the CSP | cs.AI | The search strategy of a CP solver is determined by the variable and value
ordering heuristics it employs and by the branching scheme it follows. Although
the effects of variable and value ordering heuristics on search effort have
been widely studied, the effects of different branching schemes have received
less attent... | computer science |
18,438 | The Challenge of Believability in Video Games: Definitions, Agents
Models and Imitation Learning | cs.AI | In this paper, we address the problem of creating believable agents (virtual
characters) in video games. We consider only one meaning of believability,
``giving the feeling of being controlled by a player'', and outline the problem
of its evaluation. We present several models for agents in games which can
produce belie... | computer science |
18,439 | Automatable Evaluation Method Oriented toward Behaviour Believability
for Video Games | cs.AI | Classic evaluation methods of believable agents are time-consuming because
they involve many human to judge agents. They are well suited to validate work
on new believable behaviours models. However, during the implementation,
numerous experiments can help to improve agents' believability. We propose a
method which aim... | computer science |
18,440 | AI 3D Cybug Gaming | cs.AI | In this short paper I briefly discuss 3D war Game based on artificial
intelligence concepts called AI WAR. Going in to the details, I present the
importance of CAICL language and how this language is used in AI WAR. Moreover
I also present a designed and implemented 3D War Cybug for AI WAR using CAICL
and discus the im... | computer science |
18,441 | Multi-Agent Only-Knowing Revisited | cs.AI | Levesque introduced the notion of only-knowing to precisely capture the
beliefs of a knowledge base. He also showed how only-knowing can be used to
formalize non-monotonic behavior within a monotonic logic. Despite its appeal,
all attempts to extend only-knowing to the many agent case have undesirable
properties. A bel... | computer science |
18,442 | Optimal Bangla Keyboard Layout using Association Rule of Data Mining | cs.AI | In this paper we present an optimal Bangla Keyboard Layout, which distributes
the load equally on both hands so that maximizing the ease and minimizing the
effort. Bangla alphabet has a large number of letters, for this it is difficult
to type faster using Bangla keyboard. Our proposed keyboard will maximize the
speed ... | computer science |
18,443 | Optimal Bangla Keyboard Layout using Data Mining Technique | cs.AI | This paper presents an optimal Bangla Keyboard Layout, which distributes the
load equally on both hands so that maximizing the ease and minimizing the
effort. Bangla alphabet has a large number of letters, for this it is difficult
to type faster using Bangla keyboard. Our proposed keyboard will maximize the
speed of op... | computer science |
18,444 | The Most Advantageous Bangla Keyboard Layout Using Data Mining Technique | cs.AI | Bangla alphabet has a large number of letters, for this it is complicated to
type faster using Bangla keyboard. The proposed keyboard will maximize the
speed of operator as they can type with both hands parallel. Association rule
of data mining to distribute the Bangla characters in the keyboard is used
here. The frequ... | computer science |
18,445 | General Scaled Support Vector Machines | cs.AI | Support Vector Machines (SVMs) are popular tools for data mining tasks such
as classification, regression, and density estimation. However, original SVM
(C-SVM) only considers local information of data points on or over the margin.
Therefore, C-SVM loses robustness. To solve this problem, one approach is to
translate (... | computer science |
18,446 | Measuring Similarity of Graphs and their Nodes by Neighbor Matching | cs.AI | The problem of measuring similarity of graphs and their nodes is important in
a range of practical problems. There is a number of proposed measures, some of
them being based on iterative calculation of similarity between two graphs and
the principle that two nodes are as similar as their neighbors are. In our
work, we ... | computer science |
18,447 | Qualitative Reasoning about Relative Direction on Adjustable Levels of
Granularity | cs.AI | An important issue in Qualitative Spatial Reasoning is the representation of
relative direction. In this paper we present simple geometric rules that enable
reasoning about relative direction between oriented points. This framework, the
Oriented Point Algebra OPRA_m, has a scalable granularity m. We develop a
simple al... | computer science |
18,448 | A Distributed AI Aided 3D Domino Game | cs.AI | In the article a turn-based game played on four computers connected via
network is investigated. There are three computers with natural intelligence
and one with artificial intelligence. Game table is seen by each player's own
view point in all players' monitors. Domino pieces are three dimensional. For
distributed sys... | computer science |
18,449 | Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on
Rough Set Theory | cs.AI | In this paper it is considered rule reduct generation problem, based on Rough
Set Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG)
algorithms are well-known. Alternative to these algorithms Pruning Algorithm of
Generation A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation
(PRG) algo... | computer science |
18,450 | Reasoning about Cardinal Directions between Extended Objects: The
Hardness Result | cs.AI | The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a
very expressive qualitative calculus for directional information of extended
objects. Early work has shown that consistency checking of complete networks of
basic CDC constraints is tractable while reasoning with the CDC in general is
NP-hard. T... | computer science |
18,451 | Imitation learning of motor primitives and language bootstrapping in
robots | cs.AI | Imitation learning in robots, also called programing by demonstration, has
made important advances in recent years, allowing humans to teach context
dependant motor skills/tasks to robots. We propose to extend the usual contexts
investigated to also include acoustic linguistic expressions that might denote
a given moto... | computer science |
18,452 | Significance of Classification Techniques in Prediction of Learning
Disabilities | cs.AI | The aim of this study is to show the importance of two classification
techniques, viz. decision tree and clustering, in prediction of learning
disabilities (LD) of school-age children. LDs affect about 10 percent of all
children enrolled in schools. The problems of children with specific learning
disabilities have been... | computer science |
18,453 | Detecting Ontological Conflicts in Protocols between Semantic Web
Services | cs.AI | The task of verifying the compatibility between interacting web services has
traditionally been limited to checking the compatibility of the interaction
protocol in terms of message sequences and the type of data being exchanged.
Since web services are developed largely in an uncoordinated way, different
services often... | computer science |
18,454 | Gradient Computation In Linear-Chain Conditional Random Fields Using The
Entropy Message Passing Algorithm | cs.AI | The paper proposes a numerically stable recursive algorithm for the exact
computation of the linear-chain conditional random field gradient. It operates
as a forward algorithm over the log-domain expectation semiring and has the
purpose of enhancing memory efficiency when applied to long observation
sequences. Unlike t... | computer science |
18,455 | Reinforcement Learning Based on Active Learning Method | cs.AI | In this paper, a new reinforcement learning approach is proposed which is
based on a powerful concept named Active Learning Method (ALM) in modeling. ALM
expresses any multi-input-single-output system as a fuzzy combination of some
single-input-singleoutput systems. The proposed method is an actor-critic
system similar... | computer science |
18,456 | A New Sufficient Condition for 1-Coverage to Imply Connectivity | cs.AI | An effective approach for energy conservation in wireless sensor networks is
scheduling sleep intervals for extraneous nodes while the remaining nodes stay
active to provide continuous service. For the sensor network to operate
successfully the active nodes must maintain both sensing coverage and network
connectivity, ... | computer science |
18,457 | Target tracking in the recommender space: Toward a new recommender
system based on Kalman filtering | cs.AI | In this paper, we propose a new approach for recommender systems based on
target tracking by Kalman filtering. We assume that users and their seen
resources are vectors in the multidimensional space of the categories of the
resources. Knowing this space, we propose an algorithm based on a Kalman filter
to track users a... | computer science |
18,458 | Extended Active Learning Method | cs.AI | Active Learning Method (ALM) is a soft computing method which is used for
modeling and control, based on fuzzy logic. Although ALM has shown that it acts
well in dynamic environments, its operators cannot support it very well in
complex situations due to losing data. Thus ALM can find better membership
functions if mor... | computer science |
18,459 | Should one compute the Temporal Difference fix point or minimize the
Bellman Residual? The unified oblique projection view | cs.AI | We investigate projection methods, for evaluating a linear approximation of
the value function of a policy in a Markov Decision Process context. We
consider two popular approaches, the one-step Temporal Difference fix-point
computation (TD(0)) and the Bellman Residual (BR) minimization. We describe
examples, where each... | computer science |
18,460 | Distributed Graph Coloring: An Approach Based on the Calling Behavior of
Japanese Tree Frogs | cs.AI | Graph coloring, also known as vertex coloring, considers the problem of
assigning colors to the nodes of a graph such that adjacent nodes do not share
the same color. The optimization version of the problem concerns the
minimization of the number of used colors. In this paper we deal with the
problem of finding valid c... | computer science |
18,461 | Bayesian Modeling of a Human MMORPG Player | cs.AI | This paper describes an application of Bayesian programming to the control of
an autonomous avatar in a multiplayer role-playing game (the example is based
on World of Warcraft). We model a particular task, which consists of choosing
what to do and to select which target in a situation where allies and foes are
present... | computer science |
18,462 | Reinforcement Learning in Partially Observable Markov Decision Processes
using Hybrid Probabilistic Logic Programs | cs.AI | We present a probabilistic logic programming framework to reinforcement
learning, by integrating reinforce-ment learning, in POMDP environments, with
normal hybrid probabilistic logic programs with probabilistic answer set
seman-tics, that is capable of representing domain-specific knowledge. We
formally prove the corr... | computer science |
18,463 | Multimodal Biometric Systems - Study to Improve Accuracy and Performance | cs.AI | Biometrics is the science and technology of measuring and analyzing
biological data of human body, extracting a feature set from the acquired data,
and comparing this set against to the template set in the database.
Experimental studies show that Unimodal biometric systems had many
disadvantages regarding performance a... | computer science |
18,464 | A Bayesian Methodology for Estimating Uncertainty of Decisions in
Safety-Critical Systems | cs.AI | Uncertainty of decisions in safety-critical engineering applications can be
estimated on the basis of the Bayesian Markov Chain Monte Carlo (MCMC)
technique of averaging over decision models. The use of decision tree (DT)
models assists experts to interpret causal relations and find factors of the
uncertainty. Bayesian... | computer science |
18,465 | Using ASP with recent extensions for causal explanations | cs.AI | We examine the practicality for a user of using Answer Set Programming (ASP)
for representing logical formalisms. We choose as an example a formalism aiming
at capturing causal explanations from causal information. We provide an
implementation, showing the naturalness and relative efficiency of this
translation job. We... | computer science |
18,466 | URSA: A System for Uniform Reduction to SAT | cs.AI | There are a huge number of problems, from various areas, being solved by
reducing them to SAT. However, for many applications, translation into SAT is
performed by specialized, problem-specific tools. In this paper we describe a
new system for uniform solving of a wide class of problems by reducing them to
SAT. The sys... | computer science |
18,467 | Are SNOMED CT Browsers Ready for Institutions? Introducing MySNOM | cs.AI | SNOMED Clinical Terms (SNOMED CT) is one of the most widespread ontologies in
the life sciences, with more than 300,000 concepts and relationships, but is
distributed with no associated software tools. In this paper we present MySNOM,
a web-based SNOMED CT browser. MySNOM allows organizations to browse their own
distri... | computer science |
18,468 | A study on the relation between linguistics-oriented and domain-specific
semantics | cs.AI | In this paper we dealt with the comparison and linking between lexical
resources with domain knowledge provided by ontologies. It is one of the issues
for the combination of the Semantic Web Ontologies and Text Mining. We
investigated the relations between the linguistics oriented and domain-specific
semantics, by asso... | computer science |
18,469 | Process Makna - A Semantic Wiki for Scientific Workflows | cs.AI | Virtual e-Science infrastructures supporting Web-based scientific workflows
are an example for knowledge-intensive collaborative and weakly-structured
processes where the interaction with the human scientists during process
execution plays a central role. In this paper we propose the lightweight
dynamic user-friendly i... | computer science |
18,470 | Use of semantic technologies for the development of a dynamic
trajectories generator in a Semantic Chemistry eLearning platform | cs.AI | ChemgaPedia is a multimedia, webbased eLearning service platform that
currently contains about 18.000 pages organized in 1.700 chapters covering the
complete bachelor studies in chemistry and related topics of chemistry,
pharmacy, and life sciences. The eLearning encyclopedia contains some 25.000
media objects and the ... | computer science |
18,471 | Using Semantic Wikis for Structured Argument in Medical Domain | cs.AI | This research applies ideas from argumentation theory in the context of
semantic wikis, aiming to provide support for structured-large scale
argumentation between human agents. The implemented prototype is exemplified by
modelling the MMR vaccine controversy. | computer science |
18,472 | Creating a new Ontology: a Modular Approach | cs.AI | Creating a new Ontology: a Modular Approach | computer science |
18,473 | A semantic approach for the requirement-driven discovery of web services
in the Life Sciences | cs.AI | Research in the Life Sciences depends on the integration of large,
distributed and heterogeneous data sources and web services. The discovery of
which of these resources are the most appropriate to solve a given task is a
complex research question, since there is a large amount of plausible
candidates and there is litt... | computer science |
18,474 | Scientific Collaborations: principles of WikiBridge Design | cs.AI | Semantic wikis, wikis enhanced with Semantic Web technologies, are
appropriate systems for community-authored knowledge models. They are
particularly suitable for scientific collaboration. This paper details the
design principles ofWikiBridge, a semantic wiki. | computer science |
18,475 | Populous: A tool for populating ontology templates | cs.AI | We present Populous, a tool for gathering content with which to populate an
ontology. Domain experts need to add content, that is often repetitive in its
form, but without having to tackle the underlying ontological representation.
Populous presents users with a table based form in which columns are
constrained to take... | computer science |
18,476 | Querying Biomedical Ontologies in Natural Language using Answer Set | cs.AI | In this work, we develop an intelligent user interface that allows users to
enter biomedical queries in a natural language, and that presents the answers
(possibly with explanations if requested) in a natural language. We develop a
rule layer over biomedical ontologies and databases, and use automated
reasoners to answ... | computer science |
18,477 | Bisimulations for fuzzy transition systems | cs.AI | There has been a long history of using fuzzy language equivalence to compare
the behavior of fuzzy systems, but the comparison at this level is too coarse.
Recently, a finer behavioral measure, bisimulation, has been introduced to
fuzzy finite automata. However, the results obtained are applicable only to
finite-state ... | computer science |
18,478 | Nondeterministic fuzzy automata | cs.AI | Fuzzy automata have long been accepted as a generalization of
nondeterministic finite automata. A closer examination, however, shows that the
fundamental property---nondeterminism---in nondeterministic finite automata has
not been well embodied in the generalization. In this paper, we introduce
nondeterministic fuzzy a... | computer science |
18,479 | Experimental Comparison of Representation Methods and Distance Measures
for Time Series Data | cs.AI | The previous decade has brought a remarkable increase of the interest in
applications that deal with querying and mining of time series data. Many of
the research efforts in this context have focused on introducing new
representation methods for dimensionality reduction or novel similarity
measures for the underlying d... | computer science |
18,480 | A new Recommender system based on target tracking: a Kalman Filter
approach | cs.AI | In this paper, we propose a new approach for recommender systems based on
target tracking by Kalman filtering. We assume that users and their seen
resources are vectors in the multidimensional space of the categories of the
resources. Knowing this space, we propose an algorithm based on a Kalman filter
to track users a... | computer science |
18,481 | Dynamic Capitalization and Visualization Strategy in Collaborative
Knowledge Management System for EI Process | cs.AI | Knowledge is attributed to human whose problem-solving behavior is subjective
and complex. In today's knowledge economy, the need to manage knowledge
produced by a community of actors cannot be overemphasized. This is due to the
fact that actors possess some level of tacit knowledge which is generally
difficult to arti... | computer science |
18,482 | Dynamic Knowledge Capitalization through Annotation among Economic
Intelligence Actors in a Collaborative Environment | cs.AI | The shift from industrial economy to knowledge economy in today's world has
revolutionalized strategic planning in organizations as well as their problem
solving approaches. The point of focus today is knowledge and service
production with more emphasis been laid on knowledge capital. Many
organizations are investing o... | computer science |
18,483 | Descriptive-complexity based distance for fuzzy sets | cs.AI | A new distance function dist(A,B) for fuzzy sets A and B is introduced. It is
based on the descriptive complexity, i.e., the number of bits (on average) that
are needed to describe an element in the symmetric difference of the two sets.
The distance gives the amount of additional information needed to describe any
one ... | computer science |
18,484 | Artificial Intelligence in Reverse Supply Chain Management: The State of
the Art | cs.AI | Product take-back legislation forces manufacturers to bear the costs of
collection and disposal of products that have reached the end of their useful
lives. In order to reduce these costs, manufacturers can consider reuse,
remanufacturing and/or recycling of components as an alternative to disposal.
The implementation ... | computer science |
18,485 | Automatic Estimation of the Exposure to Lateral Collision in Signalized
Intersections using Video Sensors | cs.AI | Intersections constitute one of the most dangerous elements in road systems.
Traffic signals remain the most common way to control traffic at high-volume
intersections and offer many opportunities to apply intelligent transportation
systems to make traffic more efficient and safe. This paper describes an
automated meth... | computer science |
18,486 | Symmetry Breaking with Polynomial Delay | cs.AI | A conservative class of constraint satisfaction problems CSPs is a class for
which membership is preserved under arbitrary domain reductions. Many
well-known tractable classes of CSPs are conservative. It is well known that
lexleader constraints may significantly reduce the number of solutions by
excluding symmetric so... | computer science |
18,487 | Looking for plausibility | cs.AI | In the interpretation of experimental data, one is actually looking for
plausible explanations. We look for a measure of plausibility, with which we
can compare different possible explanations, and which can be combined when
there are different sets of data. This is contrasted to the conventional
measure for probabilit... | computer science |
18,488 | SAPFOCS: a metaheuristic based approach to part family formation
problems in group technology | cs.AI | This article deals with Part family formation problem which is believed to be
moderately complicated to be solved in polynomial time in the vicinity of Group
Technology (GT). In the past literature researchers investigated that the part
family formation techniques are principally based on production flow analysis
(PFA)... | computer science |
18,489 | On Elementary Loops of Logic Programs | cs.AI | Using the notion of an elementary loop, Gebser and Schaub refined the theorem
on loop formulas due to Lin and Zhao by considering loop formulas of elementary
loops only. In this article, we reformulate their definition of an elementary
loop, extend it to disjunctive programs, and study several properties of
elementary ... | computer science |
18,490 | Extending Binary Qualitative Direction Calculi with a Granular Distance
Concept: Hidden Feature Attachment | cs.AI | In this paper we introduce a method for extending binary qualitative
direction calculi with adjustable granularity like OPRAm or the star calculus
with a granular distance concept. This method is similar to the concept of
extending points with an internal reference direction to get oriented points
which are the basic e... | computer science |
18,491 | Learning a Representation of a Believable Virtual Character's
Environment with an Imitation Algorithm | cs.AI | In video games, virtual characters' decision systems often use a simplified
representation of the world. To increase both their autonomy and believability
we want those characters to be able to learn this representation from human
players. We propose to use a model called growing neural gas to learn by
imitation the to... | computer science |
18,492 | Information-theoretic measures associated with rough set approximations | cs.AI | Although some information-theoretic measures of uncertainty or granularity
have been proposed in rough set theory, these measures are only dependent on
the underlying partition and the cardinality of the universe, independent of
the lower and upper approximations. It seems somewhat unreasonable since the
basic idea of ... | computer science |
18,493 | An architecture for the evaluation of intelligent systems | cs.AI | One of the main research areas in Artificial Intelligence is the coding of
agents (programs) which are able to learn by themselves in any situation. This
means that agents must be useful for purposes other than those they were
created for, as, for example, playing chess. In this way we try to get closer
to the pristine... | computer science |
18,494 | Intelligent Semantic Web Search Engines: A Brief Survey | cs.AI | The World Wide Web (WWW) allows the people to share the information (data)
from the large database repositories globally. The amount of information grows
billions of databases. We need to search the information will specialize tools
known generically search engine. There are many of search engines available
today, retr... | computer science |
18,495 | Online Least Squares Estimation with Self-Normalized Processes: An
Application to Bandit Problems | cs.AI | The analysis of online least squares estimation is at the heart of many
stochastic sequential decision making problems. We employ tools from the
self-normalized processes to provide a simple and self-contained proof of a
tail bound of a vector-valued martingale. We use the bound to construct a new
tighter confidence se... | computer science |
18,496 | Hybrid Model for Solving Multi-Objective Problems Using Evolutionary
Algorithm and Tabu Search | cs.AI | This paper presents a new multi-objective hybrid model that makes cooperation
between the strength of research of neighborhood methods presented by the tabu
search (TS) and the important exploration capacity of evolutionary algorithm.
This model was implemented and tested in benchmark functions (ZDT1, ZDT2, and
ZDT3), ... | computer science |
18,497 | New Worst-Case Upper Bound for #XSAT | cs.AI | An algorithm running in O(1.1995n) is presented for counting models for exact
satisfiability formulae(#XSAT). This is faster than the previously best
algorithm which runs in O(1.2190n). In order to improve the efficiency of the
algorithm, a new principle, i.e. the common literals principle, is addressed to
simplify for... | computer science |
18,498 | Back and Forth Between Rules and SE-Models (Extended Version) | cs.AI | Rules in logic programming encode information about mutual interdependencies
between literals that is not captured by any of the commonly used semantics.
This information becomes essential as soon as a program needs to be modified or
further manipulated.
We argue that, in these cases, a program should not be viewed s... | computer science |
18,499 | Practical inventory routing: A problem definition and an optimization
method | cs.AI | The global objective of this work is to provide practical optimization
methods to companies involved in inventory routing problems, taking into
account this new type of data. Also, companies are sometimes not able to deal
with changing plans every period and would like to adopt regular structures for
serving customers. | computer science |
18,500 | Fuzzy Approach to Critical Bus Ranking under Normal and Line Outage
Contingencies | cs.AI | Identification of critical or weak buses for a given operating condition is
an important task in the load dispatch centre. It has become more vital in view
of the threat of voltage instability leading to voltage collapse. This paper
presents a fuzzy approach for ranking critical buses in a power system under
normal and... | computer science |
18,501 | An Agent Based Architecture (Using Planning) for Dynamic and Semantic
Web Services Composition in an EBXML Context | cs.AI | The process-based semantic composition of Web Services is gaining a
considerable momentum as an approach for the effective integration of
distributed, heterogeneous, and autonomous applications. To compose Web
Services semantically, we need an ontology. There are several ways of inserting
semantics in Web Services. One... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.