Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,302 | The Role of Artificial Intelligence Technologies in Crisis Response | cs.AI | Crisis response poses many of the most difficult information technology in
crisis management. It requires information and communication-intensive efforts,
utilized for reducing uncertainty, calculating and comparing costs and
benefits, and managing resources in a fashion beyond those regularly available
to handle routi... | computer science |
18,303 | Toward a combination rule to deal with partial conflict and specificity
in belief functions theory | cs.AI | We present and discuss a mixed conjunctive and disjunctive rule, a
generalization of conflict repartition rules, and a combination of these two
rules. In the belief functions theory one of the major problem is the conflict
repartition enlightened by the famous Zadeh's example. To date, many
combination rules have been ... | computer science |
18,304 | A new generalization of the proportional conflict redistribution rule
stable in terms of decision | cs.AI | In this chapter, we present and discuss a new generalized proportional
conflict redistribution rule. The Dezert-Smarandache extension of the
Demster-Shafer theory has relaunched the studies on the combination rules
especially for the management of the conflict. Many combination rules have been
proposed in the last few ... | computer science |
18,305 | Une nouvelle règle de combinaison répartissant le conflit -
Applications en imagerie Sonar et classification de cibles Radar | cs.AI | These last years, there were many studies on the problem of the conflict
coming from information combination, especially in evidence theory. We can
summarise the solutions for manage the conflict into three different
approaches: first, we can try to suppress or reduce the conflict before the
combination step, secondly,... | computer science |
18,306 | Perfect Derived Propagators | cs.AI | When implementing a propagator for a constraint, one must decide about
variants: When implementing min, should one also implement max? Should one
implement linear equations both with and without coefficients? Constraint
variants are ubiquitous: implementing them requires considerable (if not
prohibitive) effort and dec... | computer science |
18,307 | Defaults and Normality in Causal Structures | cs.AI | A serious defect with the Halpern-Pearl (HP) definition of causality is
repaired by combining a theory of causality with a theory of defaults. In
addition, it is shown that (despite a claim to the contrary) a cause according
to the HP condition need not be a single conjunct. A definition of causality
motivated by Wrigh... | computer science |
18,308 | The model of quantum evolution | cs.AI | This paper has been withdrawn by the author due to extremely unscientific
errors. | computer science |
18,309 | Belief decision support and reject for textured images characterization | cs.AI | The textured images' classification assumes to consider the images in terms
of area with the same texture. In uncertain environment, it could be better to
take an imprecise decision or to reject the area corresponding to an unlearning
class. Moreover, on the areas that are the classification units, we can have
more tha... | computer science |
18,310 | The Correspondence Analysis Platform for Uncovering Deep Structure in
Data and Information | cs.AI | We study two aspects of information semantics: (i) the collection of all
relationships, (ii) tracking and spotting anomaly and change. The first is
implemented by endowing all relevant information spaces with a Euclidean metric
in a common projected space. The second is modelled by an induced ultrametric.
A very genera... | computer science |
18,311 | Extension of Inagaki General Weighted Operators and A New Fusion Rule
Class of Proportional Redistribution of Intersection Masses | cs.AI | In this paper we extend Inagaki Weighted Operators fusion rule (WO) in
information fusion by doing redistribution of not only the conflicting mass,
but also of masses of non-empty intersections, that we call Double Weighted
Operators (DWO). Then we propose a new fusion rule Class of Proportional
Redistribution of Inter... | computer science |
18,312 | Implementing general belief function framework with a practical
codification for low complexity | cs.AI | In this chapter, we propose a new practical codification of the elements of
the Venn diagram in order to easily manipulate the focal elements. In order to
reduce the complexity, the eventual constraints must be integrated in the
codification at the beginning. Hence, we only consider a reduced hyper power
set $D_r^\Thet... | computer science |
18,313 | A new probabilistic transformation of belief mass assignment | cs.AI | In this paper, we propose in Dezert-Smarandache Theory (DSmT) framework, a
new probabilistic transformation, called DSmP, in order to build a subjective
probability measure from any basic belief assignment defined on any model of
the frame of discernment. Several examples are given to show how the DSmP
transformation w... | computer science |
18,314 | On Introspection, Metacognitive Control and Augmented Data Mining Live
Cycles | cs.AI | We discuss metacognitive modelling as an enhancement to cognitive modelling
and computing. Metacognitive control mechanisms should enable AI systems to
self-reflect, reason about their actions, and to adapt to new situations. In
this respect, we propose implementation details of a knowledge taxonomy and an
augmented da... | computer science |
18,315 | Hacia una teoria de unificacion para los comportamientos cognitivos | cs.AI | Each cognitive science tries to understand a set of cognitive behaviors. The
structuring of knowledge of this nature's aspect is far from what it can be
expected about a science. Until now universal standard consistently describing
the set of cognitive behaviors has not been found, and there are many questions
about th... | computer science |
18,316 | Randomised Variable Neighbourhood Search for Multi Objective
Optimisation | cs.AI | Various local search approaches have recently been applied to machine
scheduling problems under multiple objectives. Their foremost consideration is
the identification of the set of Pareto optimal alternatives. An important
aspect of successfully solving these problems lies in the definition of an
appropriate neighbour... | computer science |
18,317 | Foundations of the Pareto Iterated Local Search Metaheuristic | cs.AI | The paper describes the proposition and application of a local search
metaheuristic for multi-objective optimization problems. It is based on two
main principles of heuristic search, intensification through variable
neighborhoods, and diversification through perturbations and successive
iterations in favorable regions ... | computer science |
18,318 | A Computational Study of Genetic Crossover Operators for Multi-Objective
Vehicle Routing Problem with Soft Time Windows | cs.AI | The article describes an investigation of the effectiveness of genetic
algorithms for multi-objective combinatorial optimization (MOCO) by presenting
an application for the vehicle routing problem with soft time windows. The work
is motivated by the question, if and how the problem structure influences the
effectivenes... | computer science |
18,319 | Genetic Algorithms for multiple objective vehicle routing | cs.AI | The talk describes a general approach of a genetic algorithm for multiple
objective optimization problems. A particular dominance relation between the
individuals of the population is used to define a fitness operator, enabling
the genetic algorithm to adress even problems with efficient, but
convex-dominated alternati... | computer science |
18,320 | A framework for the interactive resolution of multi-objective vehicle
routing problems | cs.AI | The article presents a framework for the resolution of rich vehicle routing
problems which are difficult to address with standard optimization techniques.
We use local search on the basis on variable neighborhood search for the
construction of the solutions, but embed the techniques in a flexible framework
that allows ... | computer science |
18,321 | Improving Local Search for Fuzzy Scheduling Problems | cs.AI | The integration of fuzzy set theory and fuzzy logic into scheduling is a
rather new aspect with growing importance for manufacturing applications,
resulting in various unsolved aspects. In the current paper, we investigate an
improved local search technique for fuzzy scheduling problems with fitness
plateaus, using a m... | computer science |
18,322 | Bin Packing Under Multiple Objectives - a Heuristic Approximation
Approach | cs.AI | The article proposes a heuristic approximation approach to the bin packing
problem under multiple objectives. In addition to the traditional objective of
minimizing the number of bins, the heterogeneousness of the elements in each
bin is minimized, leading to a biobjective formulation of the problem with a
tradeoff bet... | computer science |
18,323 | An application of the Threshold Accepting metaheuristic for curriculum
based course timetabling | cs.AI | The article presents a local search approach for the solution of timetabling
problems in general, with a particular implementation for competition track 3
of the International Timetabling Competition 2007 (ITC 2007). The heuristic
search procedure is based on Threshold Accepting to overcome local optima. A
stochastic n... | computer science |
18,324 | Variable Neighborhood Search for the University Lecturer-Student
Assignment Problem | cs.AI | The paper presents a study of local search heuristics in general and variable
neighborhood search in particular for the resolution of an assignment problem
studied in the practical work of universities. Here, students have to be
assigned to scientific topics which are proposed and supported by members of
staff. The pro... | computer science |
18,325 | Extended ASP tableaux and rule redundancy in normal logic programs | cs.AI | We introduce an extended tableau calculus for answer set programming (ASP).
The proof system is based on the ASP tableaux defined in [Gebser&Schaub, ICLP
2006], with an added extension rule. We investigate the power of Extended ASP
Tableaux both theoretically and empirically. We study the relationship of
Extended ASP T... | computer science |
18,326 | Achieving compositionality of the stable model semantics for Smodels
programs | cs.AI | In this paper, a Gaifman-Shapiro-style module architecture is tailored to the
case of Smodels programs under the stable model semantics. The composition of
Smodels program modules is suitably limited by module conditions which ensure
the compatibility of the module system with stable models. Hence the semantics
of an e... | computer science |
18,327 | Balancing Exploration and Exploitation by an Elitist Ant System with
Exponential Pheromone Deposition Rule | cs.AI | The paper presents an exponential pheromone deposition rule to modify the
basic ant system algorithm which employs constant deposition rule. A stability
analysis using differential equation is carried out to find out the values of
parameters that make the ant system dynamics stable for both kinds of
deposition rule. A ... | computer science |
18,328 | A Novel Parser Design Algorithm Based on Artificial Ants | cs.AI | This article presents a unique design for a parser using the Ant Colony
Optimization algorithm. The paper implements the intuitive thought process of
human mind through the activities of artificial ants. The scheme presented here
uses a bottom-up approach and the parsing program can directly use ambiguous or
redundant ... | computer science |
18,329 | Extension of Max-Min Ant System with Exponential Pheromone Deposition
Rule | cs.AI | The paper presents an exponential pheromone deposition approach to improve
the performance of classical Ant System algorithm which employs uniform
deposition rule. A simplified analysis using differential equations is carried
out to study the stability of basic ant system dynamics with both exponential
and constant dep... | computer science |
18,330 | Document stream clustering: experimenting an incremental algorithm and
AR-based tools for highlighting dynamic trends | cs.AI | We address here two major challenges presented by dynamic data mining: 1) the
stability challenge: we have implemented a rigorous incremental density-based
clustering algorithm, independent from any initial conditions and ordering of
the data-vectors stream, 2) the cognitive challenge: we have implemented a
stringent s... | computer science |
18,331 | Classification dynamique d'un flux documentaire : une évaluation
statique préalable de l'algorithme GERMEN | cs.AI | Data-stream clustering is an ever-expanding subdomain of knowledge
extraction. Most of the past and present research effort aims at efficient
scaling up for the huge data repositories. Our approach focuses on qualitative
improvement, mainly for "weak signals" detection and precise tracking of
topical evolutions in the ... | computer science |
18,332 | Étude longitudinale d'une procédure de modélisation de
connaissances en matière de gestion du territoire agricole | cs.AI | This paper gives an introduction to this issue, and presents the framework
and the main steps of the Rosa project. Four teams of researchers, agronomists,
computer scientists, psychologists and linguists were involved during five
years within this project that aimed at the development of a knowledge based
system. The p... | computer science |
18,333 | Modeling Social Annotation: a Bayesian Approach | cs.AI | Collaborative tagging systems, such as Delicious, CiteULike, and others,
allow users to annotate resources, e.g., Web pages or scientific papers, with
descriptive labels called tags. The social annotations contributed by thousands
of users, can potentially be used to infer categorical knowledge, classify
documents or r... | computer science |
18,334 | Airport Gate Assignment: New Model and Implementation | cs.AI | Airport gate assignment is of great importance in airport operations. In this
paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model
and implement the model with Optimization Programming language (OPL). With the
objective to minimize the number of conflicts of any two adjacent aircrafts
assigne... | computer science |
18,335 | Artificial Intelligence Techniques for Steam Generator Modelling | cs.AI | This paper investigates the use of different Artificial Intelligence methods
to predict the values of several continuous variables from a Steam Generator.
The objective was to determine how the different artificial intelligence
methods performed in making predictions on the given dataset. The artificial
intelligence me... | computer science |
18,336 | Approximate inference on planar graphs using Loop Calculus and Belief
Propagation | cs.AI | We introduce novel results for approximate inference on planar graphical
models using the loop calculus framework. The loop calculus (Chertkov and
Chernyak, 2006) allows to express the exact partition function of a graphical
model as a finite sum of terms that can be evaluated once the belief
propagation (BP) solution ... | computer science |
18,337 | N-norm and N-conorm in Neutrosophic Logic and Set, and the Neutrosophic
Topologies | cs.AI | In this paper we present the N-norms/N-conorms in neutrosophic logic and set
as extensions of T-norms/T-conorms in fuzzy logic and set. Also, as an
extension of the Intuitionistic Fuzzy Topology we present the Neutrosophic
Topologies. | computer science |
18,338 | Deceptiveness and Neutrality - the ND family of fitness landscapes | cs.AI | When a considerable number of mutations have no effects on fitness values,
the fitness landscape is said neutral. In order to study the interplay between
neutrality, which exists in many real-world applications, and performances of
metaheuristics, it is useful to design landscapes which make it possible to
tune precise... | computer science |
18,339 | Mining for adverse drug events with formal concept analysis | cs.AI | The pharmacovigilance databases consist of several case reports involving
drugs and adverse events (AEs). Some methods are applied consistently to
highlight all signals, i.e. all statistically significant associations between
a drug and an AE. These methods are appropriate for verification of more
complex relationships... | computer science |
18,340 | A Knowledge Discovery Framework for Learning Task Models from User
Interactions in Intelligent Tutoring Systems | cs.AI | Domain experts should provide relevant domain knowledge to an Intelligent
Tutoring System (ITS) so that it can guide a learner during problemsolving
learning activities. However, for many ill-defined domains, the domain
knowledge is hard to define explicitly. In previous works, we showed how
sequential pattern mining c... | computer science |
18,341 | How Emotional Mechanism Helps Episodic Learning in a Cognitive Agent | cs.AI | In this paper we propose the CTS (Concious Tutoring System) technology, a
biologically plausible cognitive agent based on human brain functions.This
agent is capable of learning and remembering events and any related information
such as corresponding procedures, stimuli and their emotional valences. Our
proposed episod... | computer science |
18,342 | Alleviating Media Bias Through Intelligent Agent Blogging | cs.AI | Consumers of mass media must have a comprehensive, balanced and plural
selection of news to get an unbiased perspective; but achieving this goal can
be very challenging, laborious and time consuming. News stories development
over time, its (in)consistency, and different level of coverage across the
media outlets are ch... | computer science |
18,343 | Comparative concept similarity over Minspaces: Axiomatisation and
Tableaux Calculus | cs.AI | We study the logic of comparative concept similarity $\CSL$ introduced by
Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative
similarity comparison. In this logic we can formulate assertions of the form "
objects A are more similar to B than to C". The semantics of this logic is
defined by s... | computer science |
18,344 | A Model for Managing Collections of Patterns | cs.AI | Data mining algorithms are now able to efficiently deal with huge amount of
data. Various kinds of patterns may be discovered and may have some great
impact on the general development of knowledge. In many domains, end users may
want to have their data mined by data mining tools in order to extract patterns
that could ... | computer science |
18,345 | Feature Hashing for Large Scale Multitask Learning | cs.AI | Empirical evidence suggests that hashing is an effective strategy for
dimensionality reduction and practical nonparametric estimation. In this paper
we provide exponential tail bounds for feature hashing and show that the
interaction between random subspaces is negligible with high probability. We
demonstrate the feasi... | computer science |
18,346 | XML Representation of Constraint Networks: Format XCSP 2.1 | cs.AI | We propose a new extended format to represent constraint networks using XML.
This format allows us to represent constraints defined either in extension or
in intension. It also allows us to reference global constraints. Any instance
of the problems CSP (Constraint Satisfaction Problem), QCSP (Quantified CSP)
and WCSP (... | computer science |
18,347 | The Semantics of Kalah Game | cs.AI | The present work consisted in developing a plateau game. There are the
traditional ones (monopoly, cluedo, ect.) but those which interest us leave
less place at the chance (luck) than to the strategy such that the chess game.
Kallah is an old African game, its rules are simple but the strategies to be
used are very com... | computer science |
18,348 | Learning for Dynamic subsumption | cs.AI | In this paper a new dynamic subsumption technique for Boolean CNF formulae is
proposed. It exploits simple and sufficient conditions to detect during
conflict analysis, clauses from the original formula that can be reduced by
subsumption. During the learnt clause derivation, and at each step of the
resolution process, ... | computer science |
18,349 | Principle of development | cs.AI | Today, science have a powerful tool for the description of reality - the
numbers. However, the concept of number was not immediately, lets try to trace
the evolution of the concept. The numbers emerged as the need for accurate
estimates of the amount in order to permit a comparison of some objects. So if
you see to it ... | computer science |
18,350 | Semantic Social Network Analysis | cs.AI | Social Network Analysis (SNA) tries to understand and exploit the key
features of social networks in order to manage their life cycle and predict
their evolution. Increasingly popular web 2.0 sites are forming huge social
network. Classical methods from social network analysis (SNA) have been applied
to such online net... | computer science |
18,351 | Guarded resolution for answer set programming | cs.AI | We describe a variant of resolution rule of proof and show that it is
complete for stable semantics of logic programs. We show applications of this
result. | computer science |
18,352 | Fuzzy Mnesors | cs.AI | A fuzzy mnesor space is a semimodule over the positive real numbers. It can
be used as theoretical framework for fuzzy sets. Hence we can prove a great
number of properties for fuzzy sets without refering to the membership
functions. | computer science |
18,353 | An Application of Proof-Theory in Answer Set Programming | cs.AI | We apply proof-theoretic techniques in answer Set Programming. The main
results include: 1. A characterization of continuity properties of
Gelfond-Lifschitz operator for logic program. 2. A propositional
characterization of stable models of logic programs (without referring to loop
formulas. | computer science |
18,354 | Decompositions of All Different, Global Cardinality and Related
Constraints | cs.AI | We show that some common and important global constraints like ALL-DIFFERENT
and GCC can be decomposed into simple arithmetic constraints on which we
achieve bound or range consistency, and in some cases even greater pruning.
These decompositions can be easily added to new solvers. They also provide
other constraints w... | computer science |
18,355 | Scenario-based Stochastic Constraint Programming | cs.AI | To model combinatorial decision problems involving uncertainty and
probability, we extend the stochastic constraint programming framework proposed
in [Walsh, 2002] along a number of important dimensions (e.g. to multiple
chance constraints and to a range of new objectives). We also provide a new
(but equivalent) semant... | computer science |
18,356 | Reasoning about soft constraints and conditional preferences: complexity
results and approximation techniques | cs.AI | Many real life optimization problems contain both hard and soft constraints,
as well as qualitative conditional preferences. However, there is no single
formalism to specify all three kinds of information. We therefore propose a
framework, based on both CP-nets and soft constraints, that handles both hard
and soft cons... | computer science |
18,357 | Multiset Ordering Constraints | cs.AI | We identify a new and important global (or non-binary) constraint. This
constraint ensures that the values taken by two vectors of variables, when
viewed as multisets, are ordered. This constraint is useful for a number of
different applications including breaking symmetry and fuzzy constraint
satisfaction. We propose ... | computer science |
18,358 | Tag Clouds for Displaying Semantics: The Case of Filmscripts | cs.AI | We relate tag clouds to other forms of visualization, including planar or
reduced dimensionality mapping, and Kohonen self-organizing maps. Using a
modified tag cloud visualization, we incorporate other information into it,
including text sequence and most pertinent words. Our notion of word pertinence
goes beyond just... | computer science |
18,359 | Considerations on Construction Ontologies | cs.AI | The paper proposes an analysis on some existent ontologies, in order to point
out ways to resolve semantic heterogeneity in information systems. Authors are
highlighting the tasks in a Knowledge Acquisiton System and identifying aspects
related to the addition of new information to an intelligent system. A solution
is ... | computer science |
18,360 | A Logic Programming Approach to Activity Recognition | cs.AI | We have been developing a system for recognising human activity given a
symbolic representation of video content. The input of our system is a set of
time-stamped short-term activities detected on video frames. The output of our
system is a set of recognised long-term activities, which are pre-defined
temporal combinat... | computer science |
18,361 | Knowledge Discovery of Hydrocyclone s Circuit Based on SONFIS and SORST | cs.AI | This study describes application of some approximate reasoning methods to
analysis of hydrocyclone performance. In this manner, using a combining of Self
Organizing Map (SOM), Neuro-Fuzzy Inference System (NFIS)-SONFIS- and Rough Set
Theory (RST)-SORST-crisp and fuzzy granules are obtained. Balancing of crisp
granules ... | computer science |
18,362 | A Class of DSm Conditional Rules | cs.AI | In this paper we introduce two new DSm fusion conditioning rules with
example, and as a generalization of them a class of DSm fusion conditioning
rules, and then extend them to a class of DSm conditioning rules. | computer science |
18,363 | View-based Propagator Derivation | cs.AI | When implementing a propagator for a constraint, one must decide about
variants: When implementing min, should one also implement max? Should one
implement linear constraints both with unit and non-unit coefficients?
Constraint variants are ubiquitous: implementing them requires considerable (if
not prohibitive) effort... | computer science |
18,364 | A Cognitive Mind-map Framework to Foster Trust | cs.AI | The explorative mind-map is a dynamic framework, that emerges automatically
from the input, it gets. It is unlike a verificative modeling system where
existing (human) thoughts are placed and connected together. In this regard,
explorative mind-maps change their size continuously, being adaptive with
connectionist cell... | computer science |
18,365 | An improved axiomatic definition of information granulation | cs.AI | To capture the uncertainty of information or knowledge in information
systems, various information granulations, also known as knowledge
granulations, have been proposed. Recently, several axiomatic definitions of
information granulation have been introduced. In this paper, we try to improve
these axiomatic definitions... | computer science |
18,366 | Emotion: Appraisal-coping model for the "Cascades" problem | cs.AI | Modelling emotion has become a challenge nowadays. Therefore, several models
have been produced in order to express human emotional activity. However, only
a few of them are currently able to express the close relationship existing
between emotion and cognition. An appraisal-coping model is presented here,
with the aim... | computer science |
18,367 | Emotion : modèle d'appraisal-coping pour le problème des Cascades | cs.AI | Modeling emotion has become a challenge nowadays. Therefore, several models
have been produced in order to express human emotional activity. However, only
a few of them are currently able to express the close relationship existing
between emotion and cognition. An appraisal-coping model is presented here,
with the aim ... | computer science |
18,368 | Covering rough sets based on neighborhoods: An approach without using
neighborhoods | cs.AI | Rough set theory, a mathematical tool to deal with inexact or uncertain
knowledge in information systems, has originally described the indiscernibility
of elements by equivalence relations. Covering rough sets are a natural
extension of classical rough sets by relaxing the partitions arising from
equivalence relations ... | computer science |
18,369 | An axiomatic approach to the roughness measure of rough sets | cs.AI | In Pawlak's rough set theory, a set is approximated by a pair of lower and
upper approximations. To measure numerically the roughness of an approximation,
Pawlak introduced a quantitative measure of roughness by using the ratio of the
cardinalities of the lower and upper approximations. Although the roughness
measure i... | computer science |
18,370 | Opportunistic Adaptation Knowledge Discovery | cs.AI | Adaptation has long been considered as the Achilles' heel of case-based
reasoning since it requires some domain-specific knowledge that is difficult to
acquire. In this paper, two strategies are combined in order to reduce the
knowledge engineering cost induced by the adaptation knowledge (CA) acquisition
task: CA is l... | computer science |
18,371 | On Backtracking in Real-time Heuristic Search | cs.AI | Real-time heuristic search algorithms are suitable for situated agents that
need to make their decisions in constant time. Since the original work by Korf
nearly two decades ago, numerous extensions have been suggested. One of the
most intriguing extensions is the idea of backtracking wherein the agent
decides to retur... | computer science |
18,372 | New Generalization Bounds for Learning Kernels | cs.AI | This paper presents several novel generalization bounds for the problem of
learning kernels based on the analysis of the Rademacher complexity of the
corresponding hypothesis sets. Our bound for learning kernels with a convex
combination of p base kernels has only a log(p) dependency on the number of
kernels, p, which ... | computer science |
18,373 | A Necessary and Sufficient Condition for Graph Matching Being Equivalent
to the Maximum Weight Clique Problem | cs.AI | This paper formulates a necessary and sufficient condition for a generic
graph matching problem to be equivalent to the maximum vertex and edge weight
clique problem in a derived association graph. The consequences of this results
are threefold: first, the condition is general enough to cover a broad range of
practical... | computer science |
18,374 | Elkan's k-Means for Graphs | cs.AI | This paper extends k-means algorithms from the Euclidean domain to the domain
of graphs. To recompute the centroids, we apply subgradient methods for solving
the optimization-based formulation of the sample mean of graphs. To accelerate
the k-means algorithm for graphs without trading computational time against
solutio... | computer science |
18,375 | Similarité en intension vs en extension : à la croisée de
l'informatique et du théâtre | cs.AI | Traditional staging is based on a formal approach of similarity leaning on
dramaturgical ontologies and instanciation variations. Inspired by interactive
data mining, that suggests different approaches, we give an overview of
computer science and theater researches using computers as partners of the
actor to escape the... | computer science |
18,376 | A general approach to belief change in answer set programming | cs.AI | We address the problem of belief change in (nonmonotonic) logic programming
under answer set semantics. Unlike previous approaches to belief change in
logic programming, our formal techniques are analogous to those of
distance-based belief revision in propositional logic. In developing our
results, we build upon the mo... | computer science |
18,377 | Oriented Straight Line Segment Algebra: Qualitative Spatial Reasoning
about Oriented Objects | cs.AI | Nearly 15 years ago, a set of qualitative spatial relations between oriented
straight line segments (dipoles) was suggested by Schlieder. This work received
substantial interest amongst the qualitative spatial reasoning community.
However, it turned out to be difficult to establish a sound constraint calculus
based on ... | computer science |
18,378 | $α$-Discounting Multi-Criteria Decision Making ($α$-D MCDM) | cs.AI | In this book we introduce a new procedure called \alpha-Discounting Method
for Multi-Criteria Decision Making (\alpha-D MCDM), which is as an alternative
and extension of Saaty Analytical Hierarchy Process (AHP). It works for any
number of preferences that can be transformed into a system of homogeneous
linear equation... | computer science |
18,379 | Dominion -- A constraint solver generator | cs.AI | This paper proposes a design for a system to generate constraint solvers that
are specialised for specific problem models. It describes the design in detail
and gives preliminary experimental results showing the feasibility and
effectiveness of the approach. | computer science |
18,380 | Logical Evaluation of Consciousness: For Incorporating Consciousness
into Machine Architecture | cs.AI | Machine Consciousness is the study of consciousness in a biological,
philosophical, mathematical and physical perspective and designing a model that
can fit into a programmable system architecture. Prime objective of the study
is to make the system architecture behave consciously like a biological model
does. Present w... | computer science |
18,381 | Some improved results on communication between information systems | cs.AI | To study the communication between information systems, Wang et al. [C. Wang,
C. Wu, D. Chen, Q. Hu, and C. Wu, Communicating between information systems,
Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and
type-2 consistent functions. Some properties of such functions and induced
relation ma... | computer science |
18,382 | Homomorphisms between fuzzy information systems revisited | cs.AI | Recently, Wang et al. discussed the properties of fuzzy information systems
under homomorphisms in the paper [C. Wang, D. Chen, L. Zhu, Homomorphisms
between fuzzy information systems, Applied Mathematics Letters 22 (2009)
1045-1050], where homomorphisms are based upon the concepts of consistent
functions and fuzzy rel... | computer science |
18,383 | Establishment of Relationships between Material Design and Product
Design Domains by Hybrid FEM-ANN Technique | cs.AI | In this paper, research on AI based modeling technique to optimize
development of new alloys with necessitated improvements in properties and
chemical mixture over existing alloys as per functional requirements of product
is done. The current research work novels AI in lieu of predictions to
establish association betwe... | computer science |
18,384 | Modeling of Human Criminal Behavior using Probabilistic Networks | cs.AI | Currently, criminals profile (CP) is obtained from investigators or forensic
psychologists interpretation, linking crime scene characteristics and an
offenders behavior to his or her characteristics and psychological profile.
This paper seeks an efficient and systematic discovery of nonobvious and
valuable patterns bet... | computer science |
18,385 | Model-Driven Constraint Programming | cs.AI | Constraint programming can definitely be seen as a model-driven paradigm. The
users write programs for modeling problems. These programs are mapped to
executable models to calculate the solutions. This paper focuses on efficient
model management (definition and transformation). From this point of view, we
propose to re... | computer science |
18,386 | Rewriting Constraint Models with Metamodels | cs.AI | An important challenge in constraint programming is to rewrite constraint
models into executable programs calculat- ing the solutions. This phase of
constraint processing may require translations between constraint programming
lan- guages, transformations of constraint representations, model
optimizations, and tuning o... | computer science |
18,387 | Using ATL to define advanced and flexible constraint model
transformations | cs.AI | Transforming constraint models is an important task in re- cent constraint
programming systems. User-understandable models are defined during the modeling
phase but rewriting or tuning them is manda- tory to get solving-efficient
models. We propose a new architecture al- lowing to define bridges between any
(modeling o... | computer science |
18,388 | Feature Importance in Bayesian Assessment of Newborn Brain Maturity from
EEG | cs.AI | The methodology of Bayesian Model Averaging (BMA) is applied for assessment
of newborn brain maturity from sleep EEG. In theory this methodology provides
the most accurate assessments of uncertainty in decisions. However, the
existing BMA techniques have been shown providing biased assessments in the
absence of some pr... | computer science |
18,389 | Importance of Sources using the Repeated Fusion Method and the
Proportional Conflict Redistribution Rules #5 and #6 | cs.AI | We present in this paper some examples of how to compute by hand the PCR5
fusion rule for three sources, so the reader will better understand its
mechanism. We also take into consideration the importance of sources, which is
different from the classical discounting of sources. | computer science |
18,390 | Terrorism Event Classification Using Fuzzy Inference Systems | cs.AI | Terrorism has led to many problems in Thai societies, not only property
damage but also civilian casualties. Predicting terrorism activities in advance
can help prepare and manage risk from sabotage by these activities. This paper
proposes a framework focusing on event classification in terrorism domain using
fuzzy inf... | computer science |
18,391 | Probabilistic Semantic Web Mining Using Artificial Neural Analysis | cs.AI | Most of the web user's requirements are search or navigation time and getting
correctly matched result. These constrains can be satisfied with some
additional modules attached to the existing search engines and web servers.
This paper proposes that powerful architecture for search engines with the
title of Probabilisti... | computer science |
18,392 | Matrix Coherence and the Nystrom Method | cs.AI | The Nystrom method is an efficient technique to speed up large-scale learning
applications by generating low-rank approximations. Crucial to the performance
of this technique is the assumption that a matrix can be well approximated by
working exclusively with a subset of its columns. In this work we relate this
assumpt... | computer science |
18,393 | Symmetry within Solutions | cs.AI | We define the concept of an internal symmetry. This is a symmety within a
solution of a constraint satisfaction problem. We compare this to solution
symmetry, which is a mapping between different solutions of the same problem.
We argue that we may be able to exploit both types of symmetry when finding
solutions. We ill... | computer science |
18,394 | Propagating Conjunctions of AllDifferent Constraints | cs.AI | We study propagation algorithms for the conjunction of two AllDifferent
constraints. Solutions of an AllDifferent constraint can be seen as perfect
matchings on the variable/value bipartite graph. Therefore, we investigate the
problem of finding simultaneous bipartite matchings. We present an extension of
the famous Ha... | computer science |
18,395 | Decision Support Systems (DSS) in Construction Tendering Processes | cs.AI | The successful execution of a construction project is heavily impacted by
making the right decision during tendering processes. Managing tender
procedures is very complex and uncertain involving coordination of many tasks
and individuals with different priorities and objectives. Bias and inconsistent
decision are inevi... | computer science |
18,396 | Towards Closed World Reasoning in Dynamic Open Worlds (Extended Version) | cs.AI | The need for integration of ontologies with nonmonotonic rules has been
gaining importance in a number of areas, such as the Semantic Web. A number of
researchers addressed this problem by proposing a unified semantics for hybrid
knowledge bases composed of both an ontology (expressed in a fragment of
first-order logic... | computer science |
18,397 | On the comparison of plans: Proposition of an instability measure for
dynamic machine scheduling | cs.AI | On the basis of an analysis of previous research, we present a generalized
approach for measuring the difference of plans with an exemplary application to
machine scheduling. Our work is motivated by the need for such measures, which
are used in dynamic scheduling and planning situations. In this context,
quantitative ... | computer science |
18,398 | Ontology-based inference for causal explanation | cs.AI | We define an inference system to capture explanations based on causal
statements, using an ontology in the form of an IS-A hierarchy. We first
introduce a simple logical language which makes it possible to express that a
fact causes another fact and that a fact explains another fact. We present a
set of formal inferenc... | computer science |
18,399 | The Exact Closest String Problem as a Constraint Satisfaction Problem | cs.AI | We report (to our knowledge) the first evaluation of Constraint Satisfaction
as a computational framework for solving closest string problems. We show that
careful consideration of symbol occurrences can provide search heuristics that
provide several orders of magnitude speedup at and above the optimal distance.
We als... | computer science |
18,400 | Joint Structured Models for Extraction from Overlapping Sources | cs.AI | We consider the problem of jointly training structured models for extraction
from sources whose instances enjoy partial overlap. This has important
applications like user-driven ad-hoc information extraction on the web. Such
applications present new challenges in terms of the number of sources and their
arbitrary patte... | computer science |
18,401 | An approach to visualize the course of solving of a research task in
humans | cs.AI | A technique to study the dynamics of solving of a research task is suggested.
The research task was based on specially developed software Right- Wrong
Responder (RWR), with the participants having to reveal the response logic of
the program. The participants interacted with the program in the form of a
semi-binary dial... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.