id
stringlengths 9
10
| submitter
stringlengths 5
47
⌀ | authors
stringlengths 5
1.72k
| title
stringlengths 11
234
| comments
stringlengths 1
491
⌀ | journal-ref
stringlengths 4
396
⌀ | doi
stringlengths 13
97
⌀ | report-no
stringlengths 4
138
⌀ | categories
stringclasses 1
value | license
stringclasses 9
values | abstract
stringlengths 29
3.66k
| versions
listlengths 1
21
| update_date
int64 1,180B
1,718B
| authors_parsed
sequencelengths 1
98
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0810.0332 | Wilson Wong | Wilson Wong, Wei Liu, Mohammed Bennamoun | Enhanced Integrated Scoring for Cleaning Dirty Texts | More information is available at
http://explorer.csse.uwa.edu.au/reference/ | IJCAI Workshop on Analytics for Noisy Unstructured Text Data
(AND), 2007, pages 55-62 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An increasing number of approaches for ontology engineering from text are
gearing towards the use of online sources such as company intranet and the
World Wide Web. Despite such rise, not much work can be found in aspects of
preprocessing and cleaning dirty texts from online sources. This paper presents
an enhancement of an Integrated Scoring for Spelling error correction,
Abbreviation expansion and Case restoration (ISSAC). ISSAC is implemented as
part of a text preprocessing phase in an ontology engineering system. New
evaluations performed on the enhanced ISSAC using 700 chat records reveal an
improved accuracy of 98% as compared to 96.5% and 71% based on the use of only
basic ISSAC and of Aspell, respectively.
| [
{
"version": "v1",
"created": "Thu, 2 Oct 2008 03:42:12 GMT"
}
] | 1,222,992,000,000 | [
[
"Wong",
"Wilson",
""
],
[
"Liu",
"Wei",
""
],
[
"Bennamoun",
"Mohammed",
""
]
] |
0810.1186 | Hubie Chen | Hubie Chen, Omer Gimenez | On-the-fly Macros | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a domain-independent algorithm that computes macros in a novel
way. Our algorithm computes macros "on-the-fly" for a given set of states and
does not require previously learned or inferred information, nor prior domain
knowledge. The algorithm is used to define new domain-independent tractable
classes of classical planning that are proved to include \emph{Blocksworld-arm}
and \emph{Towers of Hanoi}.
| [
{
"version": "v1",
"created": "Tue, 7 Oct 2008 13:10:26 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Jul 2012 14:54:51 GMT"
}
] | 1,426,204,800,000 | [
[
"Chen",
"Hubie",
""
],
[
"Gimenez",
"Omer",
""
]
] |
0810.2046 | \^Hamed \"Owladeghaffari | Hamed Owladeghaffari, Witold Pedrycz, Mostafa Sharifzadeh | Modeling of Social Transitions Using Intelligent Systems | null | null | 10.1109/CANS.2008.8 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we reproduce two new hybrid intelligent systems, involve three
prominent intelligent computing and approximate reasoning methods: Self
Organizing feature Map (SOM), Neruo-Fuzzy Inference System and Rough Set Theory
(RST),called SONFIS and SORST. We show how our algorithms can be construed as a
linkage of government-society interactions, where government catches various
states of behaviors: solid (absolute) or flexible. So, transition of society,
by changing of connectivity parameters (noise) from order to disorder is
inferred.
| [
{
"version": "v1",
"created": "Sat, 11 Oct 2008 19:09:22 GMT"
}
] | 1,406,592,000,000 | [
[
"Owladeghaffari",
"Hamed",
""
],
[
"Pedrycz",
"Witold",
""
],
[
"Sharifzadeh",
"Mostafa",
""
]
] |
0810.3865 | Tshilidzi Marwala | R. Musehane, F. Netshiongolwe, F.V. Nelwamondo, L. Masisi and T.
Marwala | Relationship between Diversity and Perfomance of Multiple Classifiers
for Decision Support | 6 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper presents the investigation and implementation of the relationship
between diversity and the performance of multiple classifiers on classification
accuracy. The study is critical as to build classifiers that are strong and can
generalize better. The parameters of the neural network within the committee
were varied to induce diversity; hence structural diversity is the focus for
this study. The hidden nodes and the activation function are the parameters
that were varied. The diversity measures that were adopted from ecology such as
Shannon and Simpson were used to quantify diversity. Genetic algorithm is used
to find the optimal ensemble by using the accuracy as the cost function. The
results observed shows that there is a relationship between structural
diversity and accuracy. It is observed that the classification accuracy of an
ensemble increases as the diversity increases. There was an increase of 3%-6%
in the classification accuracy.
| [
{
"version": "v1",
"created": "Tue, 21 Oct 2008 15:42:16 GMT"
}
] | 1,224,633,600,000 | [
[
"Musehane",
"R.",
""
],
[
"Netshiongolwe",
"F.",
""
],
[
"Nelwamondo",
"F. V.",
""
],
[
"Masisi",
"L.",
""
],
[
"Marwala",
"T.",
""
]
] |
0811.0131 | Deepyaman Maiti | Ayan Acharya, Deepyaman Maiti, Aritra Banerjee, Amit Konar | Balancing Exploration and Exploitation by an Elitist Ant System with
Exponential Pheromone Deposition Rule | 2008 IEEE Region 10 Colloquium and the Third ICIIS, Kharagpur, INDIA.
Paper ID: 250 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 roadmap of connected cities is chosen as the problem
environment where the shortest route between two given cities is required to be
discovered. Simulations performed with both forms of deposition approach using
Elitist Ant System model reveal that the exponential deposition approach
outperforms the classical one by a large extent. Exhaustive experiments are
also carried out to find out the optimum setting of different controlling
parameters for exponential deposition approach and an empirical relationship
between the major controlling parameters of the algorithm and some features of
problem environment.
| [
{
"version": "v1",
"created": "Sun, 2 Nov 2008 06:07:34 GMT"
}
] | 1,225,756,800,000 | [
[
"Acharya",
"Ayan",
""
],
[
"Maiti",
"Deepyaman",
""
],
[
"Banerjee",
"Aritra",
""
],
[
"Konar",
"Amit",
""
]
] |
0811.0134 | Deepyaman Maiti | Deepyaman Maiti, Ayan Acharya, Amit Konar, Janarthanan Ramadoss | A Novel Parser Design Algorithm Based on Artificial Ants | 4th IEEE International Conference on Information and Automation for
Sustainability, 2008 | null | 10.1109/ICIAFS.2008.4783925 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 grammars. We allocate a node corresponding to each production rule
present in the given grammar. Each node is connected to all other nodes
(representing other production rules), thereby establishing a completely
connected graph susceptible to the movement of artificial ants. Each ant tries
to modify this sentential form by the production rule present in the node and
upgrades its position until the sentential form reduces to the start symbol S.
Successful ants deposit pheromone on the links that they have traversed
through. Eventually, the optimum path is discovered by the links carrying
maximum amount of pheromone concentration. The design is simple, versatile,
robust and effective and obviates the calculation of the above mentioned sets
and precedence relation tables. Further advantages of our scheme lie in i)
ascertaining whether a given string belongs to the language represented by the
grammar, and ii) finding out the shortest possible path from the given string
to the start symbol S in case multiple routes exist.
| [
{
"version": "v1",
"created": "Sun, 2 Nov 2008 06:22:55 GMT"
}
] | 1,479,168,000,000 | [
[
"Maiti",
"Deepyaman",
""
],
[
"Acharya",
"Ayan",
""
],
[
"Konar",
"Amit",
""
],
[
"Ramadoss",
"Janarthanan",
""
]
] |
0811.0136 | Deepyaman Maiti | Ayan Acharya, Deepyaman Maiti, Aritra Banerjee, R. Janarthanan, Amit
Konar | Extension of Max-Min Ant System with Exponential Pheromone Deposition
Rule | 16th IEEE International Conference on Advanced Computing and
Communication, 2008 | null | 10.1109/ADCOM.2008.4760419 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 deposition rules. A roadmap of connected cities, where the
shortest path between two specified cities are to be found out, is taken as a
platform to compare Max-Min Ant System model (an improved and popular model of
Ant System algorithm) with exponential and constant deposition rules. Extensive
simulations are performed to find the best parameter settings for non-uniform
deposition approach and experiments with these parameter settings revealed that
the above approach outstripped the traditional one by a large extent in terms
of both solution quality and convergence time.
| [
{
"version": "v1",
"created": "Sun, 2 Nov 2008 06:28:50 GMT"
}
] | 1,479,168,000,000 | [
[
"Acharya",
"Ayan",
""
],
[
"Maiti",
"Deepyaman",
""
],
[
"Banerjee",
"Aritra",
""
],
[
"Janarthanan",
"R.",
""
],
[
"Konar",
"Amit",
""
]
] |
0811.0340 | Patricia Gautier | Alain Lelu (LASELDI), Martine Cadot, Pascal Cuxac (INIST) | Document stream clustering: experimenting an incremental algorithm and
AR-based tools for highlighting dynamic trends | null | International Workshop on Webometrics, Informetrics and
Scientometrics & Seventh COLLNET Meeting, France (2006) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 selection process of association rules between clusters at time t-1
and time t for directly generating the main conclusions about the dynamics of a
data-stream. We illustrate these points with an application to a two years and
2600 documents scientific information database.
| [
{
"version": "v1",
"created": "Mon, 3 Nov 2008 16:56:51 GMT"
}
] | 1,225,756,800,000 | [
[
"Lelu",
"Alain",
"",
"LASELDI"
],
[
"Cadot",
"Martine",
"",
"INIST"
],
[
"Cuxac",
"Pascal",
"",
"INIST"
]
] |
0811.0602 | Patricia Gautier | Alain Lelu (LASELDI), Pascal Cuxac (INIST), Joel Johansson (INIST) | Classification dynamique d'un flux documentaire : une \'evaluation
statique pr\'ealable de l'algorithme GERMEN | null | JADT 2006 : 8es Journ\'ees internationales d'Analyse statistique
des Donn\'ees Textuelles, France (2006) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 framework of information watch - though scalability
is intrinsically guaranteed in a possibly distributed implementation. Our
GERMEN algorithm exhaustively picks up the whole set of density peaks of the
data at time t, by identifying the local perturbations induced by the current
document vector, such as changing cluster borders, or new/vanishing clusters.
Optimality yields from the uniqueness 1) of the density landscape for any value
of our zoom parameter, 2) of the cluster allocation operated by our border
propagation rule. This results in a rigorous independence from the data
presentation ranking or any initialization parameter. We present here as a
first step the only assessment of a static view resulting from one year of the
CNRS/INIST Pascal database in the field of geotechnics.
| [
{
"version": "v1",
"created": "Tue, 4 Nov 2008 20:42:52 GMT"
}
] | 1,225,843,200,000 | [
[
"Lelu",
"Alain",
"",
"LASELDI"
],
[
"Cuxac",
"Pascal",
"",
"INIST"
],
[
"Johansson",
"Joel",
"",
"INIST"
]
] |
0811.0942 | Florence Le Ber | Florence Le Ber (INRIA Lorraine - Loria, Cevh), Christian Brassac
(LABPSYLOR, L2P) | \'Etude longitudinale d'une proc\'edure de mod\'elisation de
connaissances en mati\`ere de gestion du territoire agricole | null | Revue d'Anthropologie des Connaissances 2, 2 (2008) 151-168 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 purpose of the Rosa system is the modelling and the comparison of
farm spatial organizations. It relies on a formalization of agronomical
knowledge and thus induces a joint knowledge building process involving both
the agronomists and the computer scientists. The paper describes the steps of
the modelling process as well as the filming procedures set up by the
psychologists and linguists in order to make explicit and to analyze the
underlying knowledge building process.
| [
{
"version": "v1",
"created": "Thu, 6 Nov 2008 13:35:12 GMT"
}
] | 1,226,016,000,000 | [
[
"Ber",
"Florence Le",
"",
"INRIA Lorraine - Loria, Cevh"
],
[
"Brassac",
"Christian",
"",
"LABPSYLOR, L2P"
]
] |
0811.1319 | Anon Plangprasopchok | Anon Plangprasopchok, Kristina Lerman | Modeling Social Annotation: a Bayesian Approach | 29 Pages, Accepted for publication at ACM Transactions on Knowledge
Discovery from Data(TKDD) on March 2, 2010 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 recommend new relevant information. Traditional text inference
methods do not make best use of social annotation, since they do not take into
account variations in individual users' perspectives and vocabulary. In a
previous work, we introduced a simple probabilistic model that takes interests
of individual annotators into account in order to find hidden topics of
annotated resources. Unfortunately, that approach had one major shortcoming:
the number of topics and interests must be specified a priori. To address this
drawback, we extend the model to a fully Bayesian framework, which offers a way
to automatically estimate these numbers. In particular, the model allows the
number of interests and topics to change as suggested by the structure of the
data. We evaluate the proposed model in detail on the synthetic and real-world
data by comparing its performance to Latent Dirichlet Allocation on the topic
extraction task. For the latter evaluation, we apply the model to infer topics
of Web resources from social annotations obtained from Delicious in order to
discover new resources similar to a specified one. Our empirical results
demonstrate that the proposed model is a promising method for exploiting social
knowledge contained in user-generated annotations.
| [
{
"version": "v1",
"created": "Sun, 9 Nov 2008 05:49:53 GMT"
},
{
"version": "v2",
"created": "Wed, 26 May 2010 23:06:48 GMT"
}
] | 1,275,004,800,000 | [
[
"Plangprasopchok",
"Anon",
""
],
[
"Lerman",
"Kristina",
""
]
] |
0811.1618 | Chendong Li | Chendong Li | Airport Gate Assignment: New Model and Implementation | 5 pages, 2 figures, 1 table. Accepted by ICOR 2008 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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
assigned to the same gate, we build a mathematical model with logical
constraints and the binary constraints, which can provide an efficient
evaluation criterion for the Airlines to estimate the current gate assignment.
To illustrate the feasibility of the model we construct experiments with the
data obtained from Continental Airlines, Houston Gorge Bush Intercontinental
Airport IAH, which indicate that our model is both energetic and effective.
Moreover, we interpret experimental results, which further demonstrate that our
proposed model can provide a powerful tool for airline companies to estimate
the efficiency of their current work of gate assignment.
| [
{
"version": "v1",
"created": "Tue, 11 Nov 2008 02:33:30 GMT"
}
] | 1,226,448,000,000 | [
[
"Li",
"Chendong",
""
]
] |
0811.1711 | Tshilidzi Marwala | Sarah Wright and Tshilidzi Marwala | Artificial Intelligence Techniques for Steam Generator Modelling | 23 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 methods evaluated were Neural Networks, Support Vector Machines,
and Adaptive Neuro-Fuzzy Inference Systems. The types of neural networks
investigated were Multi-Layer Perceptions, and Radial Basis Function. Bayesian
and committee techniques were applied to these neural networks. Each of the AI
methods considered was simulated in Matlab. The results of the simulations
showed that all the AI methods were capable of predicting the Steam Generator
data reasonably accurately. However, the Adaptive Neuro-Fuzzy Inference system
out performed the other methods in terms of accuracy and ease of
implementation, while still achieving a fast execution time as well as a
reasonable training time.
| [
{
"version": "v1",
"created": "Tue, 11 Nov 2008 14:09:36 GMT"
}
] | 1,226,448,000,000 | [
[
"Wright",
"Sarah",
""
],
[
"Marwala",
"Tshilidzi",
""
]
] |
0812.0885 | Marko Horvat | Marko Horvat | Elementary epistemological features of machine intelligence | The paper needs to be redesigned | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Theoretical analysis of machine intelligence (MI) is useful for defining a
common platform in both theoretical and applied artificial intelligence (AI).
The goal of this paper is to set canonical definitions that can assist
pragmatic research in both strong and weak AI. Described epistemological
features of machine intelligence include relationship between intelligent
behavior, intelligent and unintelligent machine characteristics, observable and
unobservable entities and classification of intelligence. The paper also
establishes algebraic definitions of efficiency and accuracy of MI tests as
their quality measure. The last part of the paper addresses the learning
process with respect to the traditional epistemology and the epistemology of MI
described here. The proposed views on MI positively correlate to the Hegelian
monistic epistemology and contribute towards amalgamating idealistic
deliberations with the AI theory, particularly in a local frame of reference.
| [
{
"version": "v1",
"created": "Thu, 4 Dec 2008 09:25:37 GMT"
},
{
"version": "v2",
"created": "Sat, 1 Dec 2012 23:10:50 GMT"
},
{
"version": "v3",
"created": "Sat, 9 Feb 2013 11:27:50 GMT"
},
{
"version": "v4",
"created": "Fri, 30 Jun 2017 14:10:03 GMT"
}
] | 1,499,040,000,000 | [
[
"Horvat",
"Marko",
""
]
] |
0812.1462 | Paolo Ferraris | Paolo Ferraris | Logic programs with propositional connectives and aggregates | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Answer set programming (ASP) is a logic programming paradigm that can be used
to solve complex combinatorial search problems. Aggregates are an ASP construct
that plays an important role in many applications. Defining a satisfactory
semantics of aggregates turned out to be a difficult problem, and in this paper
we propose a new approach, based on an analogy between aggregates and
propositional connectives. First, we extend the definition of an answer
set/stable model to cover arbitrary propositional theories; then we define
aggregates on top of them both as primitive constructs and as abbreviations for
formulas. Our definition of an aggregate combines expressiveness and
simplicity, and it inherits many theorems about programs with nested
expressions, such as theorems about strong equivalence and splitting.
| [
{
"version": "v1",
"created": "Mon, 8 Dec 2008 11:09:14 GMT"
}
] | 1,228,780,800,000 | [
[
"Ferraris",
"Paolo",
""
]
] |
0812.1843 | N. Arvind Kumar | N. Arvind Kumar | Identification of parameters underlying emotions and a classification of
emotions | 6 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The standard classification of emotions involves categorizing the expression
of emotions. In this paper, parameters underlying some emotions are identified
and a new classification based on these parameters is suggested.
| [
{
"version": "v1",
"created": "Wed, 10 Dec 2008 19:02:31 GMT"
}
] | 1,228,953,600,000 | [
[
"Kumar",
"N. Arvind",
""
]
] |
0812.2785 | Tshilidzi Marwala | Baruch Lubinsky, Bekir Genc and Tshilidzi Marwala | Prediction of Platinum Prices Using Dynamically Weighted Mixture of
Experts | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks are powerful tools for classification and regression in
static environments. This paper describes a technique for creating an ensemble
of neural networks that adapts dynamically to changing conditions. The model
separates the input space into four regions and each network is given a weight
in each region based on its performance on samples from that region. The
ensemble adapts dynamically by constantly adjusting these weights based on the
current performance of the networks. The data set used is a collection of
financial indicators with the goal of predicting the future platinum price. An
ensemble with no weightings does not improve on the naive estimate of no weekly
change; our weighting algorithm gives an average percentage error of 63% for
twenty weeks of prediction.
| [
{
"version": "v1",
"created": "Mon, 15 Dec 2008 12:35:42 GMT"
}
] | 1,229,385,600,000 | [
[
"Lubinsky",
"Baruch",
""
],
[
"Genc",
"Bekir",
""
],
[
"Marwala",
"Tshilidzi",
""
]
] |
0812.2991 | Thierry Poibeau | Amanda Bouffier (LIPN), Thierry Poibeau (LIPN), Catherine Duclos
(LIM&Bio) | Analyse et structuration automatique des guides de bonnes pratiques
cliniques : essai d'\'evaluation | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Health Practice Guideliens are supposed to unify practices and propose
recommendations to physicians. This paper describes GemFrame, a system capable
of semi-automatically filling an XML template from free texts in the clinical
domain. The XML template includes semantic information not explicitly encoded
in the text (pairs of conditions and ac-tions/recommendations). Therefore,
there is a need to compute the exact scope of condi-tions over text sequences
expressing the re-quired actions. We present a system developped for this task.
We show that it yields good performance when applied to the analysis of French
practice guidelines. We conclude with a precise evaluation of the tool.
| [
{
"version": "v1",
"created": "Tue, 16 Dec 2008 07:49:20 GMT"
}
] | 1,229,472,000,000 | [
[
"Bouffier",
"Amanda",
"",
"LIPN"
],
[
"Poibeau",
"Thierry",
"",
"LIPN"
],
[
"Duclos",
"Catherine",
"",
"LIM&Bio"
]
] |
0812.3478 | Wilson Wong | Wilson Wong, Wei Liu, Saujoe Liaw, Nicoletta Balliu, Hongwei Wu, Moses
Tade | Automatic Construction of Lightweight Domain Ontologies for Chemical
Engineering Risk Management | In the Proceedings of the 11th Conference on Process Integration,
Modelling and Optimisation for Energy Saving and Pollution Reduction (PRES),
Prague, Czech Rep., August, 2008 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The need for domain ontologies in mission critical applications such as risk
management and hazard identification is becoming more and more pressing. Most
research on ontology learning conducted in the academia remains unrealistic for
real-world applications. One of the main problems is the dependence on
non-incremental, rare knowledge and textual resources, and manually-crafted
patterns and rules. This paper reports work in progress aiming to address such
undesirable dependencies during ontology construction. Initial experiments
using a working prototype of the system revealed promising potentials in
automatically constructing high-quality domain ontologies using real-world
texts.
| [
{
"version": "v1",
"created": "Thu, 18 Dec 2008 08:58:52 GMT"
}
] | 1,229,644,800,000 | [
[
"Wong",
"Wilson",
""
],
[
"Liu",
"Wei",
""
],
[
"Liaw",
"Saujoe",
""
],
[
"Balliu",
"Nicoletta",
""
],
[
"Wu",
"Hongwei",
""
],
[
"Tade",
"Moses",
""
]
] |
0901.0786 | Vicen\c{c} G\'omez Cerd\`a | V. G\'omez, H. J. Kappen, M. Chertkov | Approximate inference on planar graphs using Loop Calculus and Belief
Propagation | 23 pages, 10 figures. Submitted to Journal of Machine Learning
Research. Proceedings version accepted for UAI 2009 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 is known. In general, full summation over all
correction terms is intractable. We develop an algorithm for the approach
presented in (Certkov et al., 2008) which represents an efficient truncation
scheme on planar graphs and a new representation of the series in terms of
Pfaffians of matrices. We analyze the performance of the algorithm for the
partition function approximation for models with binary variables and pairwise
interactions on grids and other planar graphs. We study in detail both the loop
series and the equivalent Pfaffian series and show that the first term of the
Pfaffian series for the general, intractable planar model, can provide very
accurate approximations. The algorithm outperforms previous truncation schemes
of the loop series and is competitive with other state-of-the-art methods for
approximate inference.
| [
{
"version": "v1",
"created": "Wed, 7 Jan 2009 09:21:47 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Feb 2009 14:42:14 GMT"
},
{
"version": "v3",
"created": "Mon, 25 May 2009 14:29:00 GMT"
}
] | 1,243,209,600,000 | [
[
"Gómez",
"V.",
""
],
[
"Kappen",
"H. J.",
""
],
[
"Chertkov",
"M.",
""
]
] |
0901.1289 | Florentin Smarandache | Florentin Smarandache | N-norm and N-conorm in Neutrosophic Logic and Set, and the Neutrosophic
Topologies | 11 pages, 3 diagrams | In author's book A Unifying Field in Logics: Neutrosophic Logic;
Neutrosophic Set, Neutrosophic Probability and Statistics (fourth edition),
2005; Review of the Air Force Academy, No. 1 (14), pp. 05-11, 2009. | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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.
| [
{
"version": "v1",
"created": "Fri, 9 Jan 2009 17:58:39 GMT"
}
] | 1,250,467,200,000 | [
[
"Smarandache",
"Florentin",
""
]
] |
0901.3769 | Sebastien Verel | William Beaudoin (I3S), S\'ebastien Verel (I3S), Philippe Collard
(I3S), Cathy Escazut (I3S) | Deceptiveness and Neutrality - the ND family of fitness landscapes | Genetic And Evolutionary Computation Conference, Seatle :
\'Etats-Unis d'Am\'erique (2006) | null | 10.1145/1143997.1144091 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 precisely neutral degree distribution. Even though many neutral landscape
models have already been designed, none of them are general enough to create
landscapes with specific neutral degree distributions. We propose three steps
to design such landscapes: first using an algorithm we construct a landscape
whose distribution roughly fits the target one, then we use a simulated
annealing heuristic to bring closer the two distributions and finally we affect
fitness values to each neutral network. Then using this new family of fitness
landscapes we are able to highlight the interplay between deceptiveness and
neutrality.
| [
{
"version": "v1",
"created": "Fri, 23 Jan 2009 20:15:22 GMT"
}
] | 1,232,928,000,000 | [
[
"Beaudoin",
"William",
"",
"I3S"
],
[
"Verel",
"Sébastien",
"",
"I3S"
],
[
"Collard",
"Philippe",
"",
"I3S"
],
[
"Escazut",
"Cathy",
"",
"I3S"
]
] |
0901.4004 | Yannick Toussaint | Alexander Estacio-Moreno, Yannick Toussaint, C\'edric Bousquet | Mining for adverse drug events with formal concept analysis | null | Studies in health technology and informatics 136 (2008) 803-8 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 involving one or several drug(s) and AE(s) (e.g;
syndromes or interactions) but do not address the identification of them. We
propose a method for the extraction of these relationships based on Formal
Concept Analysis (FCA) associated with disproportionality measures. This method
identifies all sets of drugs and AEs which are potential signals, syndromes or
interactions. Compared to a previous experience of disproportionality analysis
without FCA, the addition of FCA was more efficient for identifying false
positives related to concomitant drugs.
| [
{
"version": "v1",
"created": "Mon, 26 Jan 2009 13:29:40 GMT"
}
] | 1,233,014,400,000 | [
[
"Estacio-Moreno",
"Alexander",
""
],
[
"Toussaint",
"Yannick",
""
],
[
"Bousquet",
"Cédric",
""
]
] |
0901.4761 | Philippe Fournier-Viger | P. Fournier-Viger, R. Nkambou and E. Mephu Nguifo | A Knowledge Discovery Framework for Learning Task Models from User
Interactions in Intelligent Tutoring Systems | Proceedings of the 7th Mexican International Conference on Artificial
Intelligence (MICAI 2008), Springer, pp. 765-778 | null | 10.1007/978-3-540-88636-5 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 can be used to extract a partial problem space from
logged user interactions, and how it can support tutoring services during
problem-solving exercises. This article describes an extension of this approach
to extract a problem space that is richer and more adapted for supporting
tutoring services. We combined sequential pattern mining with (1) dimensional
pattern mining (2) time intervals, (3) the automatic clustering of valued
actions and (4) closed sequences mining. Some tutoring services have been
implemented and an experiment has been conducted in a tutoring system.
| [
{
"version": "v1",
"created": "Thu, 29 Jan 2009 19:58:09 GMT"
}
] | 1,233,273,600,000 | [
[
"Fournier-Viger",
"P.",
""
],
[
"Nkambou",
"R.",
""
],
[
"Nguifo",
"E. Mephu",
""
]
] |
0901.4963 | Usef Faghihi | Usef Faghihi, Philippe Fournier-Viger, Roger Nkambou, Pierre Poirier,
Andre Mayers | How Emotional Mechanism Helps Episodic Learning in a Cognitive Agent | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 episodic memory and episodic learning mechanism are closer to the
current multiple-trace theory in neuroscience, because they are inspired by it
[5] contrary to other mechanisms that are incorporated in cognitive agents.
This is because in our model emotions play a role in the encoding and
remembering of events. This allows the agent to improve its behavior by
remembering previously selected behaviors which are influenced by its emotional
mechanism. Moreover, the architecture incorporates a realistic memory
consolidation process based on a data mining algorithm.
| [
{
"version": "v1",
"created": "Fri, 30 Jan 2009 19:36:18 GMT"
}
] | 1,233,532,800,000 | [
[
"Faghihi",
"Usef",
""
],
[
"Fournier-Viger",
"Philippe",
""
],
[
"Nkambou",
"Roger",
""
],
[
"Poirier",
"Pierre",
""
],
[
"Mayers",
"Andre",
""
]
] |
0902.0798 | Ernesto Diaz-Aviles | Ernesto Diaz-Aviles | Alleviating Media Bias Through Intelligent Agent Blogging | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 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 challenges that a conscientious reader has to overcome in
order to alleviate bias.
In this paper we present an intelligent agent framework currently
facilitating analysis of the main sources of on-line news in El Salvador. We
show how prior tools of text analysis and Web 2.0 technologies can be combined
with minimal manual intervention to help individuals on their rational decision
process, while holding media outlets accountable for their work.
| [
{
"version": "v1",
"created": "Wed, 4 Feb 2009 21:25:59 GMT"
}
] | 1,233,878,400,000 | [
[
"Diaz-Aviles",
"Ernesto",
""
]
] |
0902.0899 | Camilla Schwind | R\'egis Alenda (LSIS), Nicola Olivetti (LSIS), Camilla Schwind (LIF) | Comparative concept similarity over Minspaces: Axiomatisation and
Tableaux Calculus | 25 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 structures equipped by distance functions evaluating the similarity
degree of objects. We consider here the particular case of the semantics
induced by \emph{minspaces}, the latter being distance spaces where the minimum
of a set of distances always exists. It turns out that the semantics over
arbitrary minspaces can be equivalently specified in terms of preferential
structures, typical of conditional logics. We first give a direct
axiomatisation of this logic over Minspaces. We next define a decision
procedure in the form of a tableaux calculus. Both the calculus and the
axiomatisation take advantage of the reformulation of the semantics in terms of
preferential structures.
| [
{
"version": "v1",
"created": "Thu, 5 Feb 2009 12:55:42 GMT"
}
] | 1,233,878,400,000 | [
[
"Alenda",
"Régis",
"",
"LSIS"
],
[
"Olivetti",
"Nicola",
"",
"LSIS"
],
[
"Schwind",
"Camilla",
"",
"LIF"
]
] |
0902.1080 | Baptiste Jeudy | Baptiste Jeudy (LAHC), Christine Largeron (LAHC), Fran\c{c}ois
Jacquenet (LAHC) | A Model for Managing Collections of Patterns | null | ACM Symposium on Applied Computing, Seoul : Cor\'ee, R\'epublique
de (2007) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 impact their business. Nevertheless, those users are often
overwhelmed by the large quantity of patterns extracted in such a situation.
Moreover, some privacy issues, or some commercial one may lead the users not to
be able to mine the data by themselves. Thus, the users may not have the
possibility to perform many experiments integrating various constraints in
order to focus on specific patterns they would like to extract. Post processing
of patterns may be an answer to that drawback. Thus, in this paper we present a
framework that could allow end users to manage collections of patterns. We
propose to use an efficient data structure on which some algebraic operators
may be used in order to retrieve or access patterns in pattern bases.
| [
{
"version": "v1",
"created": "Fri, 6 Feb 2009 12:50:12 GMT"
}
] | 1,234,137,600,000 | [
[
"Jeudy",
"Baptiste",
"",
"LAHC"
],
[
"Largeron",
"Christine",
"",
"LAHC"
],
[
"Jacquenet",
"François",
"",
"LAHC"
]
] |
0902.2206 | KIlian Weinberger | Kilian Weinberger, Anirban Dasgupta, Josh Attenberg, John Langford,
Alex Smola | Feature Hashing for Large Scale Multitask Learning | Fixed broken theorem | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 feasibility of this approach with experimental results for a
new use case -- multitask learning with hundreds of thousands of tasks.
| [
{
"version": "v1",
"created": "Thu, 12 Feb 2009 20:06:36 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Apr 2009 16:18:39 GMT"
},
{
"version": "v3",
"created": "Wed, 20 May 2009 19:05:20 GMT"
},
{
"version": "v4",
"created": "Thu, 21 May 2009 21:18:40 GMT"
},
{
"version": "v5",
"created": "Sat, 27 Feb 2010 15:32:35 GMT"
}
] | 1,267,228,800,000 | [
[
"Weinberger",
"Kilian",
""
],
[
"Dasgupta",
"Anirban",
""
],
[
"Attenberg",
"Josh",
""
],
[
"Langford",
"John",
""
],
[
"Smola",
"Alex",
""
]
] |
0902.2362 | Christophe Lecoutre | Olivier Roussel, Christophe Lecoutre | XML Representation of Constraint Networks: Format XCSP 2.1 | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 (Weighted CSP) can be represented using this format.
| [
{
"version": "v1",
"created": "Fri, 13 Feb 2009 18:24:27 GMT"
}
] | 1,234,742,400,000 | [
[
"Roussel",
"Olivier",
""
],
[
"Lecoutre",
"Christophe",
""
]
] |
0902.2871 | Kaninda Musumbu | Kaninda Musumbu (LaBRI) | The Semantics of Kalah Game | null | ACM International conference Proceeding series, ISBN 0-9544145-6-X
(2005) 191 - 196 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 complex to implement. Of course, they are based on a strongly
mathematical basis as in the film "Rain-Man" where one can see that gambling
can be payed with strategies based on mathematical theories. The Artificial
Intelligence gives the possibility "of thinking" to a machine and, therefore,
allows it to make decisions. In our work, we use it to give the means to the
computer choosing its best movement.
| [
{
"version": "v1",
"created": "Tue, 17 Feb 2009 09:08:35 GMT"
}
] | 1,234,915,200,000 | [
[
"Musumbu",
"Kaninda",
"",
"LaBRI"
]
] |
0903.0041 | Vit Niennattrakul | Vit Niennattrakul and Chotirat Ann Ratanamahatana | Learning DTW Global Constraint for Time Series Classification | The first runner up of Workshop and Challenge on Time Series
Classification held in conjunction with SIGKDD 2007. 8 pages, 5 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the
most effective classifiers on time series domain. Since the global constraint
has been introduced in speech community, many global constraint models have
been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and
Ratanamahatana-Keogh (R-K) band. The R-K band is a general global constraint
model that can represent any global constraints with arbitrary shape and size
effectively. However, we need a good learning algorithm to discover the most
suitable set of R-K bands, and the current R-K band learning algorithm still
suffers from an 'overfitting' phenomenon. In this paper, we propose two new
learning algorithms, i.e., band boundary extraction algorithm and iterative
learning algorithm. The band boundary extraction is calculated from the bound
of all possible warping paths in each class, and the iterative learning is
adjusted from the original R-K band learning. We also use a Silhouette index, a
well-known clustering validation technique, as a heuristic function, and the
lower bound function, LB_Keogh, to enhance the prediction speed. Twenty
datasets, from the Workshop and Challenge on Time Series Classification, held
in conjunction of the SIGKDD 2007, are used to evaluate our approach.
| [
{
"version": "v1",
"created": "Sat, 28 Feb 2009 05:46:31 GMT"
}
] | 1,236,038,400,000 | [
[
"Niennattrakul",
"Vit",
""
],
[
"Ratanamahatana",
"Chotirat Ann",
""
]
] |
0903.0211 | Nina Narodytska | Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan,
Toby Walsh | Range and Roots: Two Common Patterns for Specifying and Propagating
Counting and Occurrence Constraints | 41 pages, 7 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose Range and Roots which are two common patterns useful for
specifying a wide range of counting and occurrence constraints. We design
specialised propagation algorithms for these two patterns. Counting and
occurrence constraints specified using these patterns thus directly inherit a
propagation algorithm. To illustrate the capabilities of the Range and Roots
constraints, we specify a number of global constraints taken from the
literature. Preliminary experiments demonstrate that propagating counting and
occurrence constraints using these two patterns leads to a small loss in
performance when compared to specialised global constraints and is competitive
with alternative decompositions using elementary constraints.
| [
{
"version": "v1",
"created": "Mon, 2 Mar 2009 05:58:11 GMT"
}
] | 1,236,038,400,000 | [
[
"Bessiere",
"Christian",
""
],
[
"Hebrard",
"Emmanuel",
""
],
[
"Hnich",
"Brahim",
""
],
[
"Kiziltan",
"Zeynep",
""
],
[
"Walsh",
"Toby",
""
]
] |
0903.0279 | Jean Dezert | Jean Dezert (ONERA), Florentin Smarandache | An introduction to DSmT | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this
introduction, we present a survey of our recent theory of plausible and
paradoxical reasoning, known as Dezert-Smarandache Theory (DSmT), developed for
dealing with imprecise, uncertain and conflicting sources of information. We
focus our presentation on the foundations of DSmT and on its most important
rules of combination, rather than on browsing specific applications of DSmT
available in literature. Several simple examples are given throughout this
presentation to show the efficiency and the generality of this new approach.
| [
{
"version": "v1",
"created": "Mon, 2 Mar 2009 12:31:00 GMT"
}
] | 1,236,038,400,000 | [
[
"Dezert",
"Jean",
"",
"ONERA"
],
[
"Smarandache",
"Florentin",
""
]
] |
0903.0314 | Marvin Schiller | Marvin Schiller and Christoph Benzmueller | Granularity-Adaptive Proof Presentation | Extended Version. This SEKI Working-Paper refines and extends the
following publication: Granularity-Adaptive Proof Presentation. Proceedings
of the 14th International Conference on Artificial Intelligence in Education;
Brighton, UK, 2009. Submitted | null | null | SEKI Working-Paper SWP-2009-01 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When mathematicians present proofs they usually adapt their explanations to
their didactic goals and to the (assumed) knowledge of their addressees. Modern
automated theorem provers, in contrast, present proofs usually at a fixed level
of detail (also called granularity). Often these presentations are neither
intended nor suitable for human use. A challenge therefore is to develop user-
and goal-adaptive proof presentation techniques that obey common mathematical
practice. We present a flexible and adaptive approach to proof presentation
that exploits machine learning techniques to extract a model of the specific
granularity of proof examples and employs this model for the automated
generation of further proofs at an adapted level of granularity.
| [
{
"version": "v1",
"created": "Mon, 2 Mar 2009 15:52:15 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Mar 2009 13:55:04 GMT"
},
{
"version": "v3",
"created": "Tue, 12 May 2009 19:43:59 GMT"
},
{
"version": "v4",
"created": "Mon, 25 May 2009 21:27:30 GMT"
}
] | 1,243,296,000,000 | [
[
"Schiller",
"Marvin",
""
],
[
"Benzmueller",
"Christoph",
""
]
] |
0903.0465 | Toby Walsh | Toby Walsh | Breaking Value Symmetry | Proceedings of the Twenty-Third AAAI Conference on Artificial
Intelligence | AAAI 2008: 1585-1588 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Symmetry is an important factor in solving many constraint satisfaction
problems. One common type of symmetry is when we have symmetric values. In a
recent series of papers, we have studied methods to break value symmetries. Our
results identify computational limits on eliminating value symmetry. For
instance, we prove that pruning all symmetric values is NP-hard in general.
Nevertheless, experiments show that much value symmetry can be broken in
practice. These results may be useful to researchers in planning, scheduling
and other areas as value symmetry occurs in many different domains.
| [
{
"version": "v1",
"created": "Tue, 3 Mar 2009 08:36:47 GMT"
}
] | 1,236,124,800,000 | [
[
"Walsh",
"Toby",
""
]
] |
0903.0475 | Nina Narodytska | George Katsirelos, Nina Narodytska, Toby Walsh | Reformulating Global Grammar Constraints | 15 pages, 4 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An attractive mechanism to specify global constraints in rostering and other
domains is via formal languages. For instance, the Regular and Grammar
constraints specify constraints in terms of the languages accepted by an
automaton and a context-free grammar respectively. Taking advantage of the
fixed length of the constraint, we give an algorithm to transform a
context-free grammar into an automaton. We then study the use of minimization
techniques to reduce the size of such automata and speed up propagation. We
show that minimizing such automata after they have been unfolded and domains
initially reduced can give automata that are more compact than minimizing
before unfolding and reducing. Experimental results show that such
transformations can improve the size of rostering problems that we can 'model
and run'.
| [
{
"version": "v1",
"created": "Tue, 3 Mar 2009 09:31:41 GMT"
}
] | 1,236,124,800,000 | [
[
"Katsirelos",
"George",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Walsh",
"Toby",
""
]
] |
0903.0479 | Nina Narodytska | George Katsirelos, Nina Narodytska, Toby Walsh | Combining Symmetry Breaking and Global Constraints | 15 pages, 4 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new family of constraints which combine together lexicographical
ordering constraints for symmetry breaking with other common global
constraints. We give a general purpose propagator for this family of
constraints, and show how to improve its complexity by exploiting properties of
the included global constraints.
| [
{
"version": "v1",
"created": "Tue, 3 Mar 2009 09:52:01 GMT"
}
] | 1,236,124,800,000 | [
[
"Katsirelos",
"George",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Walsh",
"Toby",
""
]
] |
0903.0695 | Shai Haim | Shai Haim and Toby Walsh | Online Estimation of SAT Solving Runtime | 6 pages, 3 figures. Proc. of the 11th International Conf. on Theory
and Applications of Satisfiability Testing, Guangzhou, China, May 2008 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an online method for estimating the cost of solving SAT problems.
Modern SAT solvers present several challenges to estimate search cost including
non-chronological backtracking, learning and restarts. Our method uses a linear
model trained on data gathered at the start of search. We show the
effectiveness of this method using random and structured problems. We
demonstrate that predictions made in early restarts can be used to improve
later predictions. We also show that we can use such cost estimations to select
a solver from a portfolio.
| [
{
"version": "v1",
"created": "Wed, 4 Mar 2009 04:56:07 GMT"
}
] | 1,236,211,200,000 | [
[
"Haim",
"Shai",
""
],
[
"Walsh",
"Toby",
""
]
] |
0903.0786 | Carlos Loria-Saenz A | Carlos Loria-Saenz | On Requirements for Programming Exercises from an E-learning Perspective | ii + 31 pages | null | null | SEKI Working-Paper SWP-2008-01 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we deal with the question of modeling programming exercises for
novices pointing to an e-learning scenario. Our purpose is to identify basic
requirements, raise some key questions and propose potential answers from a
conceptual perspective. Presented as a general picture, we hypothetically
situate our work in a general context where e-learning instructional material
needs to be adapted to form part of an introductory Computer Science (CS)
e-learning course at the CS1-level. Meant is a potential course which aims at
improving novices skills and knowledge on the essentials of programming by
using e-learning based approaches in connection (at least conceptually) with a
general host framework like Activemath (www.activemath.org). Our elaboration
covers contextual and, particularly, cognitive elements preparing the terrain
for eventual research stages in a derived project, as indicated. We concentrate
our main efforts on reasoning mechanisms about exercise complexity that can
eventually offer tool support for the task of exercise authoring. We base our
requirements analysis on our own perception of the exercise subsystem provided
by Activemath especially within the domain reasoner area. We enrich the
analysis by bringing to the discussion several relevant contextual elements
from the CS1 courses, its definition and implementation. Concerning cognitive
models and exercises, we build upon the principles of Bloom's Taxonomy as a
relatively standardized basis and use them as a framework for study and
analysis of complexity in basic programming exercises. Our analysis includes
requirements for the domain reasoner which are necessary for the exercise
analysis. We propose for such a purpose a three-layered conceptual model
considering exercise evaluation, programming and metaprogramming.
| [
{
"version": "v1",
"created": "Wed, 4 Mar 2009 15:29:42 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2009 18:50:57 GMT"
}
] | 1,236,902,400,000 | [
[
"Loria-Saenz",
"Carlos",
""
]
] |
0903.0829 | Marko Horvat | Marko Horvat, Sinisa Popovic, Nikola Bogunovic and Kresimir Cosic | Tagging multimedia stimuli with ontologies | 7 pages, 7 figures, 1 table, submitted for publication (MIPRO 2009) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Successful management of emotional stimuli is a pivotal issue concerning
Affective Computing (AC) and the related research. As a subfield of Artificial
Intelligence, AC is concerned not only with the design of computer systems and
the accompanying hardware that can recognize, interpret, and process human
emotions, but also with the development of systems that can trigger human
emotional response in an ordered and controlled manner. This requires the
maximum attainable precision and efficiency in the extraction of data from
emotionally annotated databases While these databases do use keywords or tags
for description of the semantic content, they do not provide either the
necessary flexibility or leverage needed to efficiently extract the pertinent
emotional content. Therefore, to this extent we propose an introduction of
ontologies as a new paradigm for description of emotionally annotated data. The
ability to select and sequence data based on their semantic attributes is vital
for any study involving metadata, semantics and ontological sorting like the
Semantic Web or the Social Semantic Desktop, and the approach described in the
paper facilitates reuse in these areas as well.
| [
{
"version": "v1",
"created": "Wed, 4 Mar 2009 18:13:41 GMT"
}
] | 1,236,211,200,000 | [
[
"Horvat",
"Marko",
""
],
[
"Popovic",
"Sinisa",
""
],
[
"Bogunovic",
"Nikola",
""
],
[
"Cosic",
"Kresimir",
""
]
] |
0903.1150 | Toby Walsh | S. Armagan Tarim and Suresh Manandhar and Toby Walsh | Stochastic Constraint Programming: A Scenario-Based Approach | null | Constraints 11(1): 53-80 (2006) | 10.1007/s10601-006-6849-7 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To model combinatorial decision problems involving uncertainty and
probability, we introduce scenario based stochastic constraint programming.
Stochastic constraint programs contain both decision variables, which we can
set, and stochastic variables, which follow a discrete probability
distribution. We provide a semantics for stochastic constraint programs based
on scenario trees. Using this semantics, we can compile stochastic constraint
programs down into conventional (non-stochastic) constraint programs. This
allows us to exploit the full power of existing constraint solvers. We have
implemented this framework for decision making under uncertainty in stochastic
OPL, a language which is based on the OPL constraint modelling language
[Hentenryck et al., 1999]. To illustrate the potential of this framework, we
model a wide range of problems in areas as diverse as portfolio
diversification, agricultural planning and production/inventory management.
| [
{
"version": "v1",
"created": "Fri, 6 Mar 2009 04:12:20 GMT"
}
] | 1,236,556,800,000 | [
[
"Tarim",
"S. Armagan",
""
],
[
"Manandhar",
"Suresh",
""
],
[
"Walsh",
"Toby",
""
]
] |
0903.1152 | Toby Walsh | Toby Walsh | Stochastic Constraint Programming | Proceedings of the 15th Eureopean Conference on Artificial
Intelligence | ECAI 2002: 111-115 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To model combinatorial decision problems involving uncertainty and
probability, we introduce stochastic constraint programming. Stochastic
constraint programs contain both decision variables (which we can set) and
stochastic variables (which follow a probability distribution). They combine
together the best features of traditional constraint satisfaction, stochastic
integer programming, and stochastic satisfiability. We give a semantics for
stochastic constraint programs, and propose a number of complete algorithms and
approximation procedures. Finally, we discuss a number of extensions of
stochastic constraint programming to relax various assumptions like the
independence between stochastic variables, and compare with other approaches
for decision making under uncertainty.
| [
{
"version": "v1",
"created": "Fri, 6 Mar 2009 04:20:41 GMT"
}
] | 1,236,556,800,000 | [
[
"Walsh",
"Toby",
""
]
] |
0903.3926 | Andreas Meier | Martin Homik, Andreas Meier | Designing a GUI for Proofs - Evaluation of an HCI Experiment | null | null | null | SEKI Working-Paper SWP-2005-01 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Often user interfaces of theorem proving systems focus on assisting
particularly trained and skilled users, i.e., proof experts. As a result, the
systems are difficult to use for non-expert users. This paper describes a paper
and pencil HCI experiment, in which (non-expert) students were asked to make
suggestions for a GUI for an interactive system for mathematical proofs. They
had to explain the usage of the GUI by applying it to construct a proof sketch
for a given theorem. The evaluation of the experiment provides insights for the
interaction design for non-expert users and the needs and wants of this user
group.
| [
{
"version": "v1",
"created": "Mon, 23 Mar 2009 18:38:01 GMT"
}
] | 1,237,852,800,000 | [
[
"Homik",
"Martin",
""
],
[
"Meier",
"Andreas",
""
]
] |
0903.5054 | Knud Thomsen | Knud Thomsen | Flow of Activity in the Ouroboros Model | 6 pages, 4 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Ouroboros Model is a new conceptual proposal for an algorithmic structure
for efficient data processing in living beings as well as for artificial
agents. Its central feature is a general repetitive loop where one iteration
cycle sets the stage for the next. Sensory input activates data structures
(schemata) with similar constituents encountered before, thus expectations are
kindled. This corresponds to the highlighting of empty slots in the selected
schema, and these expectations are compared with the actually encountered
input. Depending on the outcome of this consumption analysis different next
steps like search for further data or a reset, i.e. a new attempt employing
another schema, are triggered. Monitoring of the whole process, and in
particular of the flow of activation directed by the consumption analysis,
yields valuable feedback for the optimum allocation of attention and resources
including the selective establishment of useful new memory entries.
| [
{
"version": "v1",
"created": "Sun, 29 Mar 2009 15:29:17 GMT"
}
] | 1,238,457,600,000 | [
[
"Thomsen",
"Knud",
""
]
] |
0903.5289 | Vincent Rialle | Vincent Rialle (TIMC, DMIS), Annick Vila, Yves Besnard (TIMC) | Heterogeneous knowledge representation using a finite automaton and
first order logic: a case study in electromyography | null | Artificial Intelligence in Medicine 3, 2 (1991) 65-74 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a certain number of situations, human cognitive functioning is difficult
to represent with classical artificial intelligence structures. Such a
difficulty arises in the polyneuropathy diagnosis which is based on the spatial
distribution, along the nerve fibres, of lesions, together with the synthesis
of several partial diagnoses. Faced with this problem while building up an
expert system (NEUROP), we developed a heterogeneous knowledge representation
associating a finite automaton with first order logic. A number of knowledge
representation problems raised by the electromyography test features are
examined in this study and the expert system architecture allowing such a
knowledge modeling are laid out.
| [
{
"version": "v1",
"created": "Mon, 30 Mar 2009 19:08:10 GMT"
}
] | 1,238,457,600,000 | [
[
"Rialle",
"Vincent",
"",
"TIMC, DMIS"
],
[
"Vila",
"Annick",
"",
"TIMC"
],
[
"Besnard",
"Yves",
"",
"TIMC"
]
] |
0904.0029 | Lakhdar Sais | Youssef Hamadi, Said Jabbour, Lakhdar Sais | Learning for Dynamic subsumption | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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, we simply check for backward subsumption between the
current resolvent and clauses from the original formula and encoded in the
implication graph. Our approach give rise to a strong and dynamic
simplification technique that exploits learning to eliminate literals from the
original clauses. Experimental results show that the integration of our dynamic
subsumption approach within the state-of-the-art SAT solvers Minisat and Rsat
achieves interesting improvements particularly on crafted instances.
| [
{
"version": "v1",
"created": "Tue, 31 Mar 2009 23:14:05 GMT"
}
] | 1,238,630,400,000 | [
[
"Hamadi",
"Youssef",
""
],
[
"Jabbour",
"Said",
""
],
[
"Sais",
"Lakhdar",
""
]
] |
0904.2827 | Elena Wishnevskaya S. | Elena S. Vishnevksaya | Principle of development | This paper has been withdrawn by the author | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 how many times a day a person uses the numbers and compare, it
becomes evident that the comparison is used much more frequently. However, the
comparison is not possible without two opposite basic standards. Thus, to
introduce the concept of comparison, must have two opposing standards, in turn,
the operation of comparison is necessary to introduce the concept of number.
Arguably, the scientific description of reality is impossible without the
concept of opposites.
In this paper analyzes the concept of opposites, as the basis for the
introduction of the principle of development.
| [
{
"version": "v1",
"created": "Sat, 18 Apr 2009 10:49:05 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Apr 2009 09:49:52 GMT"
},
{
"version": "v3",
"created": "Mon, 16 May 2011 08:12:00 GMT"
},
{
"version": "v4",
"created": "Wed, 12 Oct 2011 03:02:38 GMT"
},
{
"version": "v5",
"created": "Thu, 13 Oct 2011 08:13:19 GMT"
}
] | 1,318,550,400,000 | [
[
"Vishnevksaya",
"Elena S.",
""
]
] |
0904.3701 | Fabien Gandon | Guillaume Er\'et\'eo (INRIA Sophia Antipolis), Fabien Gandon (INRIA
Sophia Antipolis), Olivier Corby (INRIA Sophia Antipolis), Michel Buffa | Semantic Social Network Analysis | published in Web Science (2009) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 networks. In this paper, we propose leveraging semantic web
technologies to merge and exploit the best features of each domain. We present
how to facilitate and enhance the analysis of online social networks,
exploiting the power of semantic social network analysis.
| [
{
"version": "v1",
"created": "Thu, 23 Apr 2009 14:22:05 GMT"
}
] | 1,240,531,200,000 | [
[
"Erétéo",
"Guillaume",
"",
"INRIA Sophia Antipolis"
],
[
"Gandon",
"Fabien",
"",
"INRIA\n Sophia Antipolis"
],
[
"Corby",
"Olivier",
"",
"INRIA Sophia Antipolis"
],
[
"Buffa",
"Michel",
""
]
] |
0904.3953 | Victor Marek | V.W. Marek and J.B. Remmel | Guarded resolution for answer set programming | 13 pages, some results added. Accepted for publication at TPLP | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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.
| [
{
"version": "v1",
"created": "Sat, 25 Apr 2009 00:28:07 GMT"
},
{
"version": "v2",
"created": "Sat, 2 May 2009 10:34:13 GMT"
},
{
"version": "v3",
"created": "Sat, 14 Nov 2009 22:59:07 GMT"
},
{
"version": "v4",
"created": "Sun, 21 Feb 2010 17:57:51 GMT"
}
] | 1,266,710,400,000 | [
[
"Marek",
"V. W.",
""
],
[
"Remmel",
"J. B.",
""
]
] |
0905.0192 | Gilles Champenois | Gilles Champenois | Fuzzy Mnesors | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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.
| [
{
"version": "v1",
"created": "Sat, 2 May 2009 09:23:33 GMT"
}
] | 1,241,481,600,000 | [
[
"Champenois",
"Gilles",
""
]
] |
0905.0197 | Victor Marek | V.W. Marek and J.B. Remmel | An Application of Proof-Theory in Answer Set Programming | 22 pages. Short version was published in ICLP08. New version slightly
shorter than the previous version | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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.
| [
{
"version": "v1",
"created": "Sat, 2 May 2009 10:43:30 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jan 2010 20:12:14 GMT"
}
] | 1,263,168,000,000 | [
[
"Marek",
"V. W.",
""
],
[
"Remmel",
"J. B.",
""
]
] |
0905.3755 | Toby Walsh | Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy
Quimper and Toby Walsh | Decompositions of All Different, Global Cardinality and Related
Constraints | Proceedings of the Twenty-first International Joint Conference on
Artificial Intelligence (IJCAI-09) | IJCAI-2009 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 with access to the state of the propagator by sharing of
variables. Such sharing can be used to improve propagation between constraints.
We report experiments with our decomposition in a pseudo-Boolean solver.
| [
{
"version": "v1",
"created": "Fri, 22 May 2009 20:45:30 GMT"
}
] | 1,243,296,000,000 | [
[
"Bessiere",
"Christian",
""
],
[
"Katsirelos",
"George",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Quimper",
"Claude-Guy",
""
],
[
"Walsh",
"Toby",
""
]
] |
0905.3763 | Toby Walsh | Suresh Manandhar, Armagan Tarim, Toby Walsh | Scenario-based Stochastic Constraint Programming | Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence (IJCAI-03) | IJCAI 2003: 257-262 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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) semantics based on scenarios. Using this semantics, we can
compile stochastic constraint programs down into conventional (nonstochastic)
constraint programs. This allows us to exploit the full power of existing
constraint solvers. We have implemented this framework for decision making
under uncertainty in stochastic OPL, a language which is based on the OPL
constraint modelling language [Hentenryck et al., 1999]. To illustrate the
potential of this framework, we model a wide range of problems in areas as
diverse as finance, agriculture and production.
| [
{
"version": "v1",
"created": "Fri, 22 May 2009 21:23:40 GMT"
}
] | 1,243,296,000,000 | [
[
"Manandhar",
"Suresh",
""
],
[
"Tarim",
"Armagan",
""
],
[
"Walsh",
"Toby",
""
]
] |
0905.3766 | Toby Walsh | Carmel Domshlak, Francesca Rossi, Kristen Brent Venable, Toby Walsh | Reasoning about soft constraints and conditional preferences: complexity
results and approximation techniques | Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence (IJCAI-03) | IJCAI 2003: 215-220 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 constraints as well as conditional preferences efficiently and
uniformly. We study the complexity of testing the consistency of preference
statements, and show how soft constraints can faithfully approximate the
semantics of conditional preference statements whilst improving the
computational complexity
| [
{
"version": "v1",
"created": "Fri, 22 May 2009 21:55:20 GMT"
}
] | 1,243,296,000,000 | [
[
"Domshlak",
"Carmel",
""
],
[
"Rossi",
"Francesca",
""
],
[
"Venable",
"Kristen Brent",
""
],
[
"Walsh",
"Toby",
""
]
] |
0905.3769 | Toby Walsh | Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh | Multiset Ordering Constraints | Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence (IJCAI-03) | IJCAI 2003: 221-226 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 and implement an efficient linear time algorithm for
enforcing generalised arc consistency on such a multiset ordering constraint.
Experimental results on several problem domains show considerable promise.
| [
{
"version": "v1",
"created": "Fri, 22 May 2009 21:51:13 GMT"
}
] | 1,243,296,000,000 | [
[
"Frisch",
"Alan M.",
""
],
[
"Miguel",
"Ian",
""
],
[
"Kiziltan",
"Zeynep",
""
],
[
"Hnich",
"Brahim",
""
],
[
"Walsh",
"Toby",
""
]
] |
0905.3830 | Fionn Murtagh | F. Murtagh, A. Ganz, S. McKie, J. Mothe and K. Englmeier | Tag Clouds for Displaying Semantics: The Case of Filmscripts | 23 pages, 7 figures | Information Visualization 9, 253-262, 2010 | 10.1057/ivs.2009.19 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 word frequency and instead takes a word in a mathematical
sense as located at the average of all of its pairwise relationships. We
capture semantics through context, taken as all pairwise relationships. Our
domain of application is that of filmscript analysis. The analysis of
filmscripts, always important for cinema, is experiencing a major gain in
importance in the context of television. Our objective in this work is to
visualize the semantics of filmscript, and beyond filmscript any other
partially structured, time-ordered, sequence of text segments. In particular we
develop an innovative approach to plot characterization.
| [
{
"version": "v1",
"created": "Sat, 23 May 2009 16:11:18 GMT"
}
] | 1,308,009,600,000 | [
[
"Murtagh",
"F.",
""
],
[
"Ganz",
"A.",
""
],
[
"McKie",
"S.",
""
],
[
"Mothe",
"J.",
""
],
[
"Englmeier",
"K.",
""
]
] |
0905.4601 | Florentina Pintea | Alexandru Cicortas, Victoria Stana Iordan, Alexandra Emilia Fortis | Considerations on Construction Ontologies | 10 pages, exposed on 5th International Conference "Actualities and
Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania | Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),79-88 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 proposed, as a combination of ontology reasoning services and natural
languages generation. A multi-agent system will be conceived with an extractor
agent, a reasoner agent and a competence management agent.
| [
{
"version": "v1",
"created": "Thu, 28 May 2009 10:19:02 GMT"
}
] | 1,243,555,200,000 | [
[
"Cicortas",
"Alexandru",
""
],
[
"Iordan",
"Victoria Stana",
""
],
[
"Fortis",
"Alexandra Emilia",
""
]
] |
0905.4614 | Alexander Artikis | A. Artikis, M. Sergot and G. Paliouras | A Logic Programming Approach to Activity Recognition | The original publication is available in the Proceedings of the 2nd
ACM international workshop on Events in multimedia, 2010 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 combinations of short-term activities. The constraints on the
short-term activities that, if satisfied, lead to the recognition of a
long-term activity, are expressed using a dialect of the Event Calculus. We
illustrate the expressiveness of the dialect by showing the representation of
several typical complex activities. Furthermore, we present a detailed
evaluation of the system through experimentation on a benchmark dataset of
surveillance videos.
| [
{
"version": "v1",
"created": "Thu, 28 May 2009 11:44:04 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Apr 2013 17:06:25 GMT"
}
] | 1,367,280,000,000 | [
[
"Artikis",
"A.",
""
],
[
"Sergot",
"M.",
""
],
[
"Paliouras",
"G.",
""
]
] |
0906.1673 | Victor Odumuyiwa | Bolanle Oladejo (LORIA), Adenike Osofisan (LORIA), Victor Odumuyiwa
(LORIA) | Knowledge Management in Economic Intelligence with Reasoning on Temporal
Attributes | null | VSST 2009, S\'eminaire on Veille Strat\'egique Scientifique et
Technologique (2009) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | People have to make important decisions within a time frame. Hence, it is
imperative to employ means or strategy to aid effective decision making.
Consequently, Economic Intelligence (EI) has emerged as a field to aid
strategic and timely decision making in an organization. In the course of
attaining this goal: it is indispensable to be more optimistic towards
provision for conservation of intellectual resource invested into the process
of decision making. This intellectual resource is nothing else but the
knowledge of the actors as well as that of the various processes for effecting
decision making. Knowledge has been recognized as a strategic economic resource
for enhancing productivity and a key for innovation in any organization or
community. Thus, its adequate management with cognizance of its temporal
properties is highly indispensable. Temporal properties of knowledge refer to
the date and time (known as timestamp) such knowledge is created as well as the
duration or interval between related knowledge. This paper focuses on the needs
for a user-centered knowledge management approach as well as exploitation of
associated temporal properties. Our perspective of knowledge is with respect to
decision-problems projects in EI. Our hypothesis is that the possibility of
reasoning about temporal properties in exploitation of knowledge in EI projects
should foster timely decision making through generation of useful inferences
from available and reusable knowledge for a new project.
| [
{
"version": "v1",
"created": "Tue, 9 Jun 2009 09:33:16 GMT"
}
] | 1,244,592,000,000 | [
[
"Oladejo",
"Bolanle",
"",
"LORIA"
],
[
"Osofisan",
"Adenike",
"",
"LORIA"
],
[
"Odumuyiwa",
"Victor",
"",
"LORIA"
]
] |
0906.1694 | Nikolaj Glazunov | Nikolaj Glazunov | Toward a Category Theory Design of Ontological Knowledge Bases | 10 pages, Preliminary results to International Joint Conference on
Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K
2009) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | I discuss (ontologies_and_ontological_knowledge_bases /
formal_methods_and_theories) duality and its category theory extensions as a
step toward a solution to Knowledge-Based Systems Theory. In particular I focus
on the example of the design of elements of ontologies and ontological
knowledge bases of next three electronic courses: Foundations of Research
Activities, Virtual Modeling of Complex Systems and Introduction to String
Theory.
| [
{
"version": "v1",
"created": "Tue, 9 Jun 2009 11:03:41 GMT"
}
] | 1,244,592,000,000 | [
[
"Glazunov",
"Nikolaj",
""
]
] |
0906.3036 | Gilles Champenois | Gilles Champenois | Mnesors for automatic control | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mnesors are defined as elements of a semimodule over the min-plus integers.
This two-sorted structure is able to merge graduation properties of vectors and
idempotent properties of boolean numbers, which makes it appropriate for hybrid
systems. We apply it to the control of an inverted pendulum and design a full
logical controller, that is, without the usual algebra of real numbers.
| [
{
"version": "v1",
"created": "Tue, 16 Jun 2009 22:05:57 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2009 21:19:23 GMT"
}
] | 1,255,046,400,000 | [
[
"Champenois",
"Gilles",
""
]
] |
0906.3149 | David Tolpin | David Tolpin, Solomon Eyal Shimony | Semi-Myopic Sensing Plans for Value Optimization | 9 pages, 4 figures, presented at BISFAI 2009 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the following sequential decision problem. Given a set of items
of unknown utility, we need to select one of as high a utility as possible
(``the selection problem''). Measurements (possibly noisy) of item values prior
to selection are allowed, at a known cost. The goal is to optimize the overall
sequential decision process of measurements and selection.
Value of information (VOI) is a well-known scheme for selecting measurements,
but the intractability of the problem typically leads to using myopic VOI
estimates. In the selection problem, myopic VOI frequently badly underestimates
the value of information, leading to inferior sensing plans. We relax the
strict myopic assumption into a scheme we term semi-myopic, providing a
spectrum of methods that can improve the performance of sensing plans. In
particular, we propose the efficiently computable method of ``blinkered'' VOI,
and examine theoretical bounds for special cases. Empirical evaluation of
``blinkered'' VOI in the selection problem with normally distributed item
values shows that is performs much better than pure myopic VOI.
| [
{
"version": "v1",
"created": "Wed, 17 Jun 2009 11:45:40 GMT"
}
] | 1,245,283,200,000 | [
[
"Tolpin",
"David",
""
],
[
"Shimony",
"Solomon Eyal",
""
]
] |
0906.4332 | Joseph Y. Halpern | Adam J. Grove and Joseph Y. Halpern | Updating Sets of Probabilities | In Proceedings of the Fourteenth Conference on Uncertainty in AI,
1998, pp. 173-182 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are several well-known justifications for conditioning as the
appropriate method for updating a single probability measure, given an
observation. However, there is a significant body of work arguing for sets of
probability measures, rather than single measures, as a more realistic model of
uncertainty. Conditioning still makes sense in this context--we can simply
condition each measure in the set individually, then combine the results--and,
indeed, it seems to be the preferred updating procedure in the literature. But
how justified is conditioning in this richer setting? Here we show, by
considering an axiomatic account of conditioning given by van Fraassen, that
the single-measure and sets-of-measures cases are very different. We show that
van Fraassen's axiomatization for the former case is nowhere near sufficient
for updating sets of measures. We give a considerably longer (and not as
compelling) list of axioms that together force conditioning in this setting,
and describe other update methods that are allowed once any of these axioms is
dropped.
| [
{
"version": "v1",
"created": "Tue, 23 Jun 2009 19:34:47 GMT"
},
{
"version": "v2",
"created": "Sun, 10 Aug 2014 01:47:19 GMT"
}
] | 1,407,801,600,000 | [
[
"Grove",
"Adam J.",
""
],
[
"Halpern",
"Joseph Y.",
""
]
] |
0906.5038 | R Doomun | Huma Naeem, Asif Masood, Mukhtar Hussain, Shoab A. Khan | A Novel Two-Stage Dynamic Decision Support based Optimal Threat
Evaluation and Defensive Resource Scheduling Algorithm for Multi Air-borne
threats | 8 Pages, International Journal of Computer Science and Information
Security, IJCSIS | IJCSIS June 2009 Issue, Vol.2, No. 1 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel two-stage flexible dynamic decision support based
optimal threat evaluation and defensive resource scheduling algorithm for
multi-target air-borne threats. The algorithm provides flexibility and
optimality by swapping between two objective functions, i.e. the preferential
and subtractive defense strategies as and when required. To further enhance the
solution quality, it outlines and divides the critical parameters used in
Threat Evaluation and Weapon Assignment (TEWA) into three broad categories
(Triggering, Scheduling and Ranking parameters). Proposed algorithm uses a
variant of many-to-many Stable Marriage Algorithm (SMA) to solve Threat
Evaluation (TE) and Weapon Assignment (WA) problem. In TE stage, Threat Ranking
and Threat-Asset pairing is done. Stage two is based on a new flexible dynamic
weapon scheduling algorithm, allowing multiple engagements using
shoot-look-shoot strategy, to compute near-optimal solution for a range of
scenarios. Analysis part of this paper presents the strengths and weaknesses of
the proposed algorithm over an alternative greedy algorithm as applied to
different offline scenarios.
| [
{
"version": "v1",
"created": "Sat, 27 Jun 2009 04:24:59 GMT"
}
] | 1,246,320,000,000 | [
[
"Naeem",
"Huma",
""
],
[
"Masood",
"Asif",
""
],
[
"Hussain",
"Mukhtar",
""
],
[
"Khan",
"Shoab A.",
""
]
] |
0906.5119 | Arnaud Martin | Arnaud Martin (E3I2), Christophe Osswald (E3I2), Jean Dezert (ONERA),
Florentin Smarandache (UNM) | General combination rules for qualitative and quantitative beliefs | null | Journal of Advances in Information Fusion 3, 2 (2008) 67-89 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Martin and Osswald \cite{Martin07} have recently proposed many
generalizations of combination rules on quantitative beliefs in order to manage
the conflict and to consider the specificity of the responses of the experts.
Since the experts express themselves usually in natural language with
linguistic labels, Smarandache and Dezert \cite{Li07} have introduced a
mathematical framework for dealing directly also with qualitative beliefs. In
this paper we recall some element of our previous works and propose the new
combination rules, developed for the fusion of both qualitative or quantitative
beliefs.
| [
{
"version": "v1",
"created": "Sun, 28 Jun 2009 08:09:04 GMT"
}
] | 1,246,320,000,000 | [
[
"Martin",
"Arnaud",
"",
"E3I2"
],
[
"Osswald",
"Christophe",
"",
"E3I2"
],
[
"Dezert",
"Jean",
"",
"ONERA"
],
[
"Smarandache",
"Florentin",
"",
"UNM"
]
] |
0907.0067 | R Doomun | Huma Naeem, Asif Masood, Mukhtar Hussain, Shoab A. Khan | A Novel Two-Staged Decision Support based Threat Evaluation and Weapon
Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial
Intelligence Techinques | 7 Pages, International Journal of Computer Science and Information
Security (IJCSIS) | IJCSIS June 2009 Issue, Vol. 2, No. 1 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Surveillance control and reporting (SCR) system for air threats play an
important role in the defense of a country. SCR system corresponds to air and
ground situation management/processing along with information fusion,
communication, coordination, simulation and other critical defense oriented
tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR
system. In such a system, maximal or near maximal utilization of constrained
resources is of extreme importance. Manual TEWA systems cannot provide
optimality because of different limitations e.g.surface to air missile (SAM)
can fire from a distance of 5Km, but manual TEWA systems are constrained by
human vision range and other constraints. Current TEWA systems usually work on
target-by-target basis using some type of greedy algorithm thus affecting the
optimality of the solution and failing in multi-target scenario. his paper
relates to a novel two-staged flexible dynamic decision support based optimal
threat evaluation and weapon assignment algorithm for multi-target air-borne
threats.
| [
{
"version": "v1",
"created": "Wed, 1 Jul 2009 06:05:22 GMT"
}
] | 1,246,492,800,000 | [
[
"Naeem",
"Huma",
""
],
[
"Masood",
"Asif",
""
],
[
"Hussain",
"Mukhtar",
""
],
[
"Khan",
"Shoab A.",
""
]
] |
0907.0589 | Rahul Gupta | Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan | Generalized Collective Inference with Symmetric Clique Potentials | 30 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Collective graphical models exploit inter-instance associative dependence to
output more accurate labelings. However existing models support very limited
kind of associativity which restricts accuracy gains. This paper makes two
major contributions. First, we propose a general collective inference framework
that biases data instances to agree on a set of {\em properties} of their
labelings. Agreement is encouraged through symmetric clique potentials. We show
that rich properties leads to bigger gains, and present a systematic inference
procedure for a large class of such properties. The procedure performs message
passing on the cluster graph, where property-aware messages are computed with
cluster specific algorithms. This provides an inference-only solution for
domain adaptation. Our experiments on bibliographic information extraction
illustrate significant test error reduction over unseen domains. Our second
major contribution consists of algorithms for computing outgoing messages from
clique clusters with symmetric clique potentials. Our algorithms are exact for
arbitrary symmetric potentials on binary labels and for max-like and
majority-like potentials on multiple labels. For majority potentials, we also
provide an efficient Lagrangian Relaxation based algorithm that compares
favorably with the exact algorithm. We present a 13/15-approximation algorithm
for the NP-hard Potts potential, with runtime sub-quadratic in the clique size.
In contrast, the best known previous guarantee for graphs with Potts potentials
is only 1/2. We empirically show that our method for Potts potentials is an
order of magnitude faster than the best alternatives, and our Lagrangian
Relaxation based algorithm for majority potentials beats the best applicable
heuristic -- ICM.
| [
{
"version": "v1",
"created": "Fri, 3 Jul 2009 11:32:47 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Jul 2009 13:31:01 GMT"
}
] | 1,246,924,800,000 | [
[
"Gupta",
"Rahul",
""
],
[
"Sarawagi",
"Sunita",
""
],
[
"Diwan",
"Ajit A.",
""
]
] |
0907.0939 | Thierry Petit | Thierry Petit and Emmanuel Poder | The Soft Cumulative Constraint | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This research report presents an extension of Cumulative of Choco constraint
solver, which is useful to encode over-constrained cumulative problems. This
new global constraint uses sweep and task interval violation-based algorithms.
| [
{
"version": "v1",
"created": "Mon, 6 Jul 2009 09:11:42 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Jul 2009 09:43:51 GMT"
}
] | 1,246,924,800,000 | [
[
"Petit",
"Thierry",
""
],
[
"Poder",
"Emmanuel",
""
]
] |
0907.2775 | Dai Tri Man Le | Dai Tri Man Le | Modelling Concurrent Behaviors in the Process Specification Language | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a first-order ontology for generalized stratified
order structure. We then classify the models of the theory using
model-theoretic techniques. An ontology mapping from this ontology to the core
theory of Process Specification Language is also discussed.
| [
{
"version": "v1",
"created": "Thu, 16 Jul 2009 08:20:32 GMT"
}
] | 1,247,788,800,000 | [
[
"Le",
"Dai Tri Man",
""
]
] |
0907.2990 | Martin Josef Geiger | Martin Josef Geiger | The Single Machine Total Weighted Tardiness Problem - Is it (for
Metaheuristics) a Solved Problem ? | null | Proceedings of the 8th Metaheuristics International Conference MIC
2009, July 13-16, Hamburg, Germany, pp. 141.1-141.10 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The article presents a study of rather simple local search heuristics for the
single machine total weighted tardiness problem (SMTWTP), namely hillclimbing
and Variable Neighborhood Search. In particular, we revisit these approaches
for the SMTWTP as there appears to be a lack of appropriate/challenging
benchmark instances in this case. The obtained results are impressive indeed.
Only few instances remain unsolved, and even those are approximated within 1%
of the optimal/best known solutions. Our experiments support the claim that
metaheuristics for the SMTWTP are very likely to lead to good results, and
that, before refining search strategies, more work must be done with regard to
the proposition of benchmark data. Some recommendations for the construction of
such data sets are derived from our investigations.
| [
{
"version": "v1",
"created": "Fri, 17 Jul 2009 06:45:46 GMT"
}
] | 1,248,048,000,000 | [
[
"Geiger",
"Martin Josef",
""
]
] |
0907.2993 | Martin Josef Geiger | Martin Josef Geiger | Improvements for multi-objective flow shop scheduling by Pareto Iterated
Local Search | null | Proceedings of the 8th Metaheuristics International Conference MIC
2009, July 13-16, 2009, Hamburg, Germany, pp 195.1-195.10 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The article 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 of the search space. The concept is
successfully tested on permutation flow shop scheduling problems under multiple
objectives and compared to other local search approaches. While the obtained
results are encouraging in terms of their quality, another positive attribute
of the approach is its simplicity as it does require the setting of only very
few parameters.
| [
{
"version": "v1",
"created": "Fri, 17 Jul 2009 06:53:02 GMT"
}
] | 1,248,048,000,000 | [
[
"Geiger",
"Martin Josef",
""
]
] |
0907.4100 | Kurt Ammon | Kurt Ammon | Beyond Turing Machines | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper discusses "computational" systems capable of "computing" functions
not computable by predefined Turing machines if the systems are not isolated
from their environment. Roughly speaking, these systems can change their finite
descriptions by interacting with their environment.
| [
{
"version": "v1",
"created": "Thu, 23 Jul 2009 15:45:10 GMT"
}
] | 1,249,257,600,000 | [
[
"Ammon",
"Kurt",
""
]
] |
0907.4509 | Gilberto de Paiva | Gilberto de Paiva | Pattern Recognition Theory of Mind | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | I propose that pattern recognition, memorization and processing are key
concepts that can be a principle set for the theoretical modeling of the mind
function. Most of the questions about the mind functioning can be answered by a
descriptive modeling and definitions from these principles. An understandable
consciousness definition can be drawn based on the assumption that a pattern
recognition system can recognize its own patterns of activity. The principles,
descriptive modeling and definitions can be a basis for theoretical and applied
research on cognitive sciences, particularly at artificial intelligence
studies.
| [
{
"version": "v1",
"created": "Sun, 26 Jul 2009 19:10:43 GMT"
}
] | 1,248,739,200,000 | [
[
"de Paiva",
"Gilberto",
""
]
] |
0907.4561 | York Sure | York Sure | Fact Sheet on Semantic Web | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The report gives an overview about activities on the topic Semantic Web. It
has been released as technical report for the project "KTweb -- Connecting
Knowledge Technologies Communities" in 2003.
| [
{
"version": "v1",
"created": "Mon, 27 Jul 2009 08:28:35 GMT"
}
] | 1,248,739,200,000 | [
[
"Sure",
"York",
""
]
] |
0907.5032 | Shai Haim | Shai Haim and Toby Walsh | Restart Strategy Selection using Machine Learning Techniques | 14 pages, 4 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Restart strategies are an important factor in the performance of
conflict-driven Davis Putnam style SAT solvers. Selecting a good restart
strategy for a problem instance can enhance the performance of a solver.
Inspired by recent success applying machine learning techniques to predict the
runtime of SAT solvers, we present a method which uses machine learning to
boost solver performance through a smart selection of the restart strategy.
Based on easy to compute features, we train both a satisfiability classifier
and runtime models. We use these models to choose between restart strategies.
We present experimental results comparing this technique with the most commonly
used restart strategies. Our results demonstrate that machine learning is
effective in improving solver performance.
| [
{
"version": "v1",
"created": "Wed, 29 Jul 2009 01:21:36 GMT"
}
] | 1,248,912,000,000 | [
[
"Haim",
"Shai",
""
],
[
"Walsh",
"Toby",
""
]
] |
0907.5033 | Shai Haim | Shai Haim and Toby Walsh | Online Search Cost Estimation for SAT Solvers | 8 pages, 9 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present two different methods for estimating the cost of solving SAT
problems. The methods focus on the online behaviour of the backtracking solver,
as well as the structure of the problem. Modern SAT solvers present several
challenges to estimate search cost including coping with nonchronological
backtracking, learning and restarts. Our first method adapt an existing
algorithm for estimating the size of a search tree to deal with these
challenges. We then suggest a second method that uses a linear model trained on
data gathered online at the start of search. We compare the effectiveness of
these two methods using random and structured problems. We also demonstrate
that predictions made in early restarts can be used to improve later
predictions. We conclude by showing that the cost of solving a set of problems
can be reduced by selecting a solver from a portfolio based on such cost
estimations.
| [
{
"version": "v1",
"created": "Wed, 29 Jul 2009 01:30:53 GMT"
}
] | 1,248,912,000,000 | [
[
"Haim",
"Shai",
""
],
[
"Walsh",
"Toby",
""
]
] |
0907.5155 | Ching-an Hsiao | C. A. Hsiao | On Classification from Outlier View | Conclusion renewed; IAENG International Journal of Computer Science,
Volume 37, Issue 4, Nov, 2010 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classification is the basis of cognition. Unlike other solutions, this study
approaches it from the view of outliers. We present an expanding algorithm to
detect outliers in univariate datasets, together with the underlying
foundation. The expanding algorithm runs in a holistic way, making it a rather
robust solution. Synthetic and real data experiments show its power.
Furthermore, an application for multi-class problems leads to the introduction
of the oscillator algorithm. The corresponding result implies the potential
wide use of the expanding algorithm.
| [
{
"version": "v1",
"created": "Wed, 29 Jul 2009 15:47:33 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Jul 2009 14:17:30 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Jun 2011 13:53:49 GMT"
},
{
"version": "v4",
"created": "Mon, 2 Jan 2012 15:19:41 GMT"
}
] | 1,325,635,200,000 | [
[
"Hsiao",
"C. A.",
""
]
] |
0907.5598 | Peter de Blanc | Peter de Blanc | Convergence of Expected Utility for Universal AI | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a sequence of repeated interactions between an agent and an
environment. Uncertainty about the environment is captured by a probability
distribution over a space of hypotheses, which includes all computable
functions. Given a utility function, we can evaluate the expected utility of
any computational policy for interaction with the environment. After making
some plausible assumptions (and maybe one not-so-plausible assumption), we show
that if the utility function is unbounded, then the expected utility of any
policy is undefined.
| [
{
"version": "v1",
"created": "Fri, 31 Jul 2009 19:16:09 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Dec 2009 21:16:44 GMT"
}
] | 1,259,712,000,000 | [
[
"de Blanc",
"Peter",
""
]
] |
0908.0089 | \^Hamed \"Owladeghaffari O.Ghaffari | H. O. Ghaffari, M. Ejtemaei, M. Irannajad | Knowledge Discovery of Hydrocyclone s Circuit Based on SONFIS and SORST | Proceedings of the 11th International Mineral Processing Symposium
21-23 October 2008, Belek-Antalya, Turkey | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 and non-crisp granules can be implemented in close-open iteration.
Using different criteria and based on granulation level balance point
(interval) or a pseudo-balance point is estimated. Validation of the proposed
methods, on the data set of the hydrocyclone is rendered.
| [
{
"version": "v1",
"created": "Sat, 1 Aug 2009 17:28:13 GMT"
}
] | 1,249,344,000,000 | [
[
"Ghaffari",
"H. O.",
""
],
[
"Ejtemaei",
"M.",
""
],
[
"Irannajad",
"M.",
""
]
] |
0908.0100 | Florentin Smarandache | Florentin Smarandache, Mark Alford | A Class of DSm Conditional Rules | 9 pages. SUbmitted to COGIS 2009 International Conference in PAris | Proceedings of COGIS 2009 International Conference, Paris, France,
16-18 November 2009. Also, presented at this conference | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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.
| [
{
"version": "v1",
"created": "Sat, 1 Aug 2009 22:40:37 GMT"
}
] | 1,258,934,400,000 | [
[
"Smarandache",
"Florentin",
""
],
[
"Alford",
"Mark",
""
]
] |
0908.2050 | Guido Tack | Christian Schulte and Guido Tack | View-based Propagator Derivation | 28 pages, 7 tables, 3 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 and decreases maintainability, but will deliver better
performance than resorting to constraint decomposition.
This paper shows how to use views to derive perfect propagator variants. A
model for views and derived propagators is introduced. Derived propagators are
proved to be indeed perfect in that they inherit essential properties such as
correctness and domain and bounds consistency. Techniques for systematically
deriving propagators such as transformation, generalization, specialization,
and type conversion are developed. The paper introduces an implementation
architecture for views that is independent of the underlying constraint
programming system. A detailed evaluation of views implemented in Gecode shows
that derived propagators are efficient and that views often incur no overhead.
Without views, Gecode would either require 180 000 rather than 40 000 lines of
propagator code, or would lack many efficient propagator variants. Compared to
8 000 lines of code for views, the reduction in code for propagators yields a
1750% return on investment.
| [
{
"version": "v1",
"created": "Fri, 14 Aug 2009 12:27:51 GMT"
}
] | 1,250,467,200,000 | [
[
"Schulte",
"Christian",
""
],
[
"Tack",
"Guido",
""
]
] |
0908.3394 | Jayanta Poray | Jayanta Poray, Christoph Schommer | A Cognitive Mind-map Framework to Foster Trust | 5 pages, 4 Figures, Extended Version, presented at the 5th
International Conference on Natural Computation, 2009 | null | 10.1109/ICNC.2009.614 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 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 cells inside; mind-maps process data input incrementally and
offer lots of possibilities to interact with the user through an appropriate
communication interface. With respect to a cognitive motivated situation like a
conversation between partners, mind-maps become interesting as they are able to
process stimulating signals whenever they occur. If these signals are close to
an own understanding of the world, then the conversational partner becomes
automatically more trustful than if the signals do not or less match the own
knowledge scheme. In this (position) paper, we therefore motivate explorative
mind-maps as a cognitive engine and propose these as a decision support engine
to foster trust.
| [
{
"version": "v1",
"created": "Mon, 24 Aug 2009 10:32:01 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Aug 2009 21:17:58 GMT"
}
] | 1,251,158,400,000 | [
[
"Poray",
"Jayanta",
""
],
[
"Schommer",
"Christoph",
""
]
] |
0908.3999 | Ping Zhu | Ping Zhu | An improved axiomatic definition of information granulation | 10 pages | null | null | null | cs.AI | http://creativecommons.org/licenses/by/3.0/ | 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 and give a universal construction of information
granulation by relating information granulations with a class of functions of
multiple variables. We show that the improved axiomatic definition has some
concrete information granulations in the literature as instances.
| [
{
"version": "v1",
"created": "Thu, 27 Aug 2009 12:30:49 GMT"
}
] | 1,251,417,600,000 | [
[
"Zhu",
"Ping",
""
]
] |
0909.0122 | Sanjiang Li | Sanjiang Li, Anthony G. Cohn | Reasoning with Topological and Directional Spatial Information | null | Computational Intelligence, 2012, 28(4):579-616 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current research on qualitative spatial representation and reasoning mainly
focuses on one single aspect of space. In real world applications, however,
multiple spatial aspects are often involved simultaneously.
This paper investigates problems arising in reasoning with combined
topological and directional information. We use the RCC8 algebra and the
Rectangle Algebra (RA) for expressing topological and directional information
respectively. We give examples to show that the bipath-consistency algorithm
BIPATH is incomplete for solving even basic RCC8 and RA constraints. If
topological constraints are taken from some maximal tractable subclasses of
RCC8, and directional constraints are taken from a subalgebra, termed DIR49, of
RA, then we show that BIPATH is able to separate topological constraints from
directional ones. This means, given a set of hybrid topological and directional
constraints from the above subclasses of RCC8 and RA, we can transfer the joint
satisfaction problem in polynomial time to two independent satisfaction
problems in RCC8 and RA. For general RA constraints, we give a method to
compute solutions that satisfy all topological constraints and approximately
satisfy each RA constraint to any prescribed precision.
| [
{
"version": "v1",
"created": "Tue, 1 Sep 2009 08:31:22 GMT"
}
] | 1,382,313,600,000 | [
[
"Li",
"Sanjiang",
""
],
[
"Cohn",
"Anthony G.",
""
]
] |
0909.0138 | Sanjiang Li | Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingsheng Ying | Reasoning about Cardinal Directions between Extended Objects | null | Artificial Intelligence, Volume 174, Issues 12-13, August 2010,
Pages 951-983 | 10.1016/j.artint.2010.05.006 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Direction relations between extended spatial objects are important
commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model,
known as Cardinal Direction Calculus (CDC), for representing direction
relations between connected plane regions. CDC is perhaps the most expressive
qualitative calculus for directional information, and has attracted increasing
interest from areas such as artificial intelligence, geographical information
science, and image retrieval. Given a network of CDC constraints, the
consistency problem is deciding if the network is realizable by connected
regions in the real plane. This paper provides a cubic algorithm for checking
consistency of basic CDC constraint networks, and proves that reasoning with
CDC is in general an NP-Complete problem. For a consistent network of basic CDC
constraints, our algorithm also returns a 'canonical' solution in cubic time.
This cubic algorithm is also adapted to cope with cardinal directions between
possibly disconnected regions, in which case currently the best algorithm is of
time complexity O(n^5).
| [
{
"version": "v1",
"created": "Tue, 1 Sep 2009 09:58:22 GMT"
}
] | 1,277,942,400,000 | [
[
"Zhang",
"Xiaotong",
""
],
[
"Liu",
"Weiming",
""
],
[
"Li",
"Sanjiang",
""
],
[
"Ying",
"Mingsheng",
""
]
] |
0909.0682 | Shirin Sohrabi | Shirin Sohrabi and Sheila A. McIlraith | On Planning with Preferences in HTN | This paper appears in Twelfth International Workshop on Non-Monotonic
Reasoning (NMR08). An earlier version of this paper appears in Fourth
Multidisciplinary Workshop on Advances in Preference Handling (M-Pref08) at
AAAI-08 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we address the problem of generating preferred plans by
combining the procedural control knowledge specified by Hierarchical Task
Networks (HTNs) with rich qualitative user preferences. The outcome of our work
is a language for specifyin user preferences, tailored to HTN planning,
together with a provably optimal preference-based planner, HTNPLAN, that is
implemented as an extension of SHOP2. To compute preferred plans, we propose an
approach based on forward-chaining heuristic search. Our heuristic uses an
admissible evaluation function measuring the satisfaction of preferences over
partial plans. Our empirical evaluation demonstrates the effectiveness of our
HTNPLAN heuristics. We prove our approach sound and optimal with respect to the
plans it generates by appealing to a situation calculus semantics of our
preference language and of HTN planning. While our implementation builds on
SHOP2, the language and techniques proposed here are relevant to a broad range
of HTN planners.
| [
{
"version": "v1",
"created": "Thu, 3 Sep 2009 15:27:52 GMT"
}
] | 1,252,022,400,000 | [
[
"Sohrabi",
"Shirin",
""
],
[
"McIlraith",
"Sheila A.",
""
]
] |
0909.0901 | Eugen Staab | Eugen Staab and Martin Caminada | Assessing the Impact of Informedness on a Consultant's Profit | 20 pages, 42 figures, Technical Report, University of Luxembourg | null | null | ISBN 978-2-87971-027-3 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the notion of informedness in a client-consultant setting. Using a
software simulator, we examine the extent to which it pays off for consultants
to provide their clients with advice that is well-informed, or with advice that
is merely meant to appear to be well-informed. The latter strategy is
beneficial in that it costs less resources to keep up-to-date, but carries the
risk of a decreased reputation if the clients discover the low level of
informedness of the consultant. Our experimental results indicate that under
different circumstances, different strategies yield the optimal results (net
profit) for the consultants.
| [
{
"version": "v1",
"created": "Fri, 4 Sep 2009 15:31:37 GMT"
}
] | 1,252,281,600,000 | [
[
"Staab",
"Eugen",
""
],
[
"Caminada",
"Martin",
""
]
] |
0909.1021 | Pierrick Tranouez | Pierrick Tranouez (LITIS), Patrice Langlois (IDEES), Eric Daud\'e
(IDEES) | A multiagent urban traffic simulation Part I: dealing with the ordinary | null | ICCSA 2009, France (2009) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe in this article a multiagent urban traffic simulation, as we
believe individual-based modeling is necessary to encompass the complex
influence the actions of an individual vehicle can have on the overall flow of
vehicles. We first describe how we build a graph description of the network
from purely geometric data, ESRI shapefiles. We then explain how we include
traffic related data to this graph. We go on after that with the model of the
vehicle agents: origin and destination, driving behavior, multiple lanes,
crossroads, and interactions with the other vehicles in day-to-day, ?ordinary?
traffic. We conclude with the presentation of the resulting simulation of this
model on the Rouen agglomeration.
| [
{
"version": "v1",
"created": "Sat, 5 Sep 2009 12:20:17 GMT"
}
] | 1,252,368,000,000 | [
[
"Tranouez",
"Pierrick",
"",
"LITIS"
],
[
"Langlois",
"Patrice",
"",
"IDEES"
],
[
"Daudé",
"Eric",
"",
"IDEES"
]
] |
0909.1151 | Antoine Seilles | Jean Sallantin (LIRMM), Antoine Seilles (LIRMM) | n-Opposition theory to structure debates | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2007 was the first international congress on the ?square of oppositions?. A
first attempt to structure debate using n-opposition theory was presented along
with the results of a first experiment on the web. Our proposal for this paper
is to define relations between arguments through a structure of opposition
(square of oppositions is one structure of opposition). We will be trying to
answer the following questions: How to organize debates on the web 2.0? How to
structure them in a logical way? What is the role of n-opposition theory, in
this context? We present in this paper results of three experiments
(Betapolitique 2007, ECAP 2008, Intermed 2008).
| [
{
"version": "v1",
"created": "Mon, 7 Sep 2009 06:41:06 GMT"
}
] | 1,252,368,000,000 | [
[
"Sallantin",
"Jean",
"",
"LIRMM"
],
[
"Seilles",
"Antoine",
"",
"LIRMM"
]
] |
0909.2091 | Denis Pallez | Hideyuki Takagi (I3S), Denis Pallez (I3S) | Paired Comparisons-based Interactive Differential Evolution | null | World Congress on Nature and Biologically Inspired Computing,
Coimbatore : Inde (2009) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose Interactive Differential Evolution (IDE) based on paired
comparisons for reducing user fatigue and evaluate its convergence speed in
comparison with Interactive Genetic Algorithms (IGA) and tournament IGA. User
interface and convergence performance are two big keys for reducing Interactive
Evolutionary Computation (IEC) user fatigue. Unlike IGA and conventional IDE,
users of the proposed IDE and tournament IGA do not need to compare whole
individuals each other but compare pairs of individuals, which largely
decreases user fatigue. In this paper, we design a pseudo-IEC user and evaluate
another factor, IEC convergence performance, using IEC simulators and show that
our proposed IDE converges significantly faster than IGA and tournament IGA,
i.e. our proposed one is superior to others from both user interface and
convergence performance points of view.
| [
{
"version": "v1",
"created": "Fri, 11 Sep 2009 06:30:05 GMT"
}
] | 1,271,808,000,000 | [
[
"Takagi",
"Hideyuki",
"",
"I3S"
],
[
"Pallez",
"Denis",
"",
"I3S"
]
] |
0909.2339 | \^Hamed \"Owladeghaffari O.Ghaffari | H. Owladeghaffari, H. Aghababaei | Back analysis based on SOM-RST system | 10th. International Symposium on Landslides and Engineering and.
Engineered Slopes, Xi'an, China | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes application of information granulation theory, on the
back analysis of Jeffrey mine southeast wall Quebec. In this manner, using a
combining of Self Organizing Map (SOM) and rough set theory (RST), crisp and
rough granules are obtained. Balancing of crisp granules and sub rough granules
is rendered in close-open iteration. Combining of hard and soft computing,
namely finite difference method (FDM) and computational intelligence and taking
in to account missing information are two main benefits of the proposed method.
As a practical example, reverse analysis on the failure of the southeast wall
Jeffrey mine is accomplished.
| [
{
"version": "v1",
"created": "Sat, 12 Sep 2009 14:03:04 GMT"
}
] | 1,252,972,800,000 | [
[
"Owladeghaffari",
"H.",
""
],
[
"Aghababaei",
"H.",
""
]
] |
0909.2375 | Nevin Vunka Jungum | Mashud Kabir | Similarity Matching Techniques for Fault Diagnosis in Automotive
Infotainment Electronics | International Journal of Computer Science Issues(IJCSI), Volume 3,
pp14-19, August 2009 | M. Kabir, " SIMILARITY MATCHING TECHNIQUES FOR FAULT DIAGNOSIS IN
AUTOMOTIVE INFOTAINMENT ELECTRONICS", International Journal of Computer
Science Issues(IJCSI), Volume 3, pp14-19, August 2009 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fault diagnosis has become a very important area of research during the last
decade due to the advancement of mechanical and electrical systems in
industries. The automobile is a crucial field where fault diagnosis is given a
special attention. Due to the increasing complexity and newly added features in
vehicles, a comprehensive study has to be performed in order to achieve an
appropriate diagnosis model. A diagnosis system is capable of identifying the
faults of a system by investigating the observable effects (or symptoms). The
system categorizes the fault into a diagnosis class and identifies a probable
cause based on the supplied fault symptoms. Fault categorization and
identification are done using similarity matching techniques. The development
of diagnosis classes is done by making use of previous experience, knowledge or
information within an application area. The necessary information used may come
from several sources of knowledge, such as from system analysis. In this paper
similarity matching techniques for fault diagnosis in automotive infotainment
applications are discussed.
| [
{
"version": "v1",
"created": "Sat, 12 Sep 2009 22:06:05 GMT"
}
] | 1,252,972,800,000 | [
[
"Kabir",
"Mashud",
""
]
] |
0909.2376 | Nevin Vunka Jungum | Alexis Lazanas | Performing Hybrid Recommendation in Intermodal Transportation-the
FTMarket System's Recommendation Module | International Journal of Computer Science Issues (IJCSI), Volume 3,
pp24-34, August 2009 | A. Lazanas"Performing Hybrid Recommendation in Intermodal
Transportation-the FTMarket System's Recommendation Module ",International
Journal of Computer Science Issues (IJCSI), Volume 3, pp24-34, August 2009 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diverse recommendation techniques have been already proposed and encapsulated
into several e-business applications, aiming to perform a more accurate
evaluation of the existing information and accordingly augment the assistance
provided to the users involved. This paper reports on the development and
integration of a recommendation module in an agent-based transportation
transactions management system. The module is built according to a novel hybrid
recommendation technique, which combines the advantages of collaborative
filtering and knowledge-based approaches. The proposed technique and supporting
module assist customers in considering in detail alternative transportation
transactions that satisfy their requests, as well as in evaluating completed
transactions. The related services are invoked through a software agent that
constructs the appropriate knowledge rules and performs a synthesis of the
recommendation policy.
| [
{
"version": "v1",
"created": "Sat, 12 Sep 2009 22:21:12 GMT"
}
] | 1,252,972,800,000 | [
[
"Lazanas",
"Alexis",
""
]
] |
0909.3273 | Toby Walsh | Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy
Quimper, and Toby Walsh | Decomposition of the NVALUE constraint | To appear in Proceedings of the Eighth International Workshop on
Constraint Modelling and Reformulation, held alongside the 15th International
Conference on Principles and Practice of Constraint Programming (CP 2009),
Lisbon, Portugal | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study decompositions of NVALUE, a global constraint that can be used to
model a wide range of problems where values need to be counted. Whilst
decomposition typically hinders propagation, we identify one decomposition that
maintains a global view as enforcing bound consistency on the decomposition
achieves bound consistency on the original global NVALUE constraint. Such
decompositions offer the prospect for advanced solving techniques like nogood
learning and impact based branching heuristics. They may also help SAT and IP
solvers take advantage of the propagation of global constraints.
| [
{
"version": "v1",
"created": "Thu, 17 Sep 2009 16:58:28 GMT"
}
] | 1,253,232,000,000 | [
[
"Bessiere",
"Christian",
""
],
[
"Katsirelos",
"George",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Quimper",
"Claude-Guy",
""
],
[
"Walsh",
"Toby",
""
]
] |
0909.3276 | Toby Walsh | George Katsirelos, and Toby Walsh | Symmetries of Symmetry Breaking Constraints | To appear in the Proceedings of the Ninth International Workshop on
Symmetry and Constraint Satisfaction Problems, held alongside the 15th
International Conference on Principles and Practice of Constraint Programming
(CP 2009), Lisbon, Portugal | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Symmetry is an important feature of many constraint programs. We show that
any 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. We use these observations in two methods for eliminating
symmetry from a problem. These methods are designed to have many of the
advantages of symmetry breaking methods that post static symmetry breaking
constraint without some of the disadvantages. In particular, the two methods
prune the search space using fast and efficient propagation of posted
constraints, whilst reducing the conflict between symmetry breaking and
branching heuristics. Experimental results show that the two methods perform
well on some standard benchmarks.
| [
{
"version": "v1",
"created": "Thu, 17 Sep 2009 17:16:34 GMT"
}
] | 1,253,232,000,000 | [
[
"Katsirelos",
"George",
""
],
[
"Walsh",
"Toby",
""
]
] |
0909.4446 | Toby Walsh | Mirco Gelain, Maria Pini, Francesca Rossi, Brent Venable and Toby
Walsh | Elicitation strategies for fuzzy constraint problems with missing
preferences: algorithms and experimental studies | Principles and Practice of Constraint Programming, 14th International
Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fuzzy constraints are a popular approach to handle preferences and
over-constrained problems in scenarios where one needs to be cautious, such as
in medical or space applications. We consider here fuzzy constraint problems
where some of the preferences may be missing. This models, for example,
settings where agents are distributed and have privacy issues, or where there
is an ongoing preference elicitation process. In this setting, we study how to
find a solution which is optimal irrespective of the missing preferences. In
the process of finding such a solution, we may elicit preferences from the user
if necessary. However, our goal is to ask the user as little as possible. We
define a combined solving and preference elicitation scheme with a large number
of different instantiations, each corresponding to a concrete algorithm which
we compare experimentally. We compute both the number of elicited preferences
and the "user effort", which may be larger, as it contains all the preference
values the user has to compute to be able to respond to the elicitation
requests. While the number of elicited preferences is important when the
concern is to communicate as little information as possible, the user effort
measures also the hidden work the user has to do to be able to communicate the
elicited preferences. Our experimental results show that some of our algorithms
are very good at finding a necessarily optimal solution while asking the user
for only a very small fraction of the missing preferences. The user effort is
also very small for the best algorithms. Finally, we test these algorithms on
hard constraint problems with possibly missing constraints, where the aim is to
find feasible solutions irrespective of the missing constraints.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 2009 13:54:38 GMT"
}
] | 1,253,836,800,000 | [
[
"Gelain",
"Mirco",
""
],
[
"Pini",
"Maria",
""
],
[
"Rossi",
"Francesca",
""
],
[
"Venable",
"Brent",
""
],
[
"Walsh",
"Toby",
""
]
] |
0909.4452 | Toby Walsh | Michael J. Maher and Nina Narodytska and Claude-Guy Quimper and Toby
Walsh | Flow-Based Propagators for the SEQUENCE and Related Global Constraints | Principles and Practice of Constraint Programming, 14th International
Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose new filtering algorithms for the SEQUENCE constraint and some
extensions of the SEQUENCE constraint based on network flows. We enforce domain
consistency on the SEQUENCE constraint in $O(n^2)$ time down a branch of the
search tree. This improves upon the best existing domain consistency algorithm
by a factor of $O(\log n)$. The flows used in these algorithms are derived from
a linear program. Some of them differ from the flows used to propagate global
constraints like GCC since the domains of the variables are encoded as costs on
the edges rather than capacities. Such flows are efficient for maintaining
bounds consistency over large domains and may be useful for other global
constraints.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 2009 14:05:14 GMT"
}
] | 1,253,836,800,000 | [
[
"Maher",
"Michael J.",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Quimper",
"Claude-Guy",
""
],
[
"Walsh",
"Toby",
""
]
] |
0909.4456 | Toby Walsh | George Katsirelos and Nina Narodytska and Toby Walsh | The Weighted CFG Constraint | Integration of AI and OR Techniques in Constraint Programming for
Combinatorial Optimization Problems, 5th International Conference, CPAIOR
2008, Paris, France, May 20-23, 2008, Proceedings | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the weighted CFG constraint and propose a propagation algorithm
that enforces domain consistency in $O(n^3|G|)$ time. We show that this
algorithm can be decomposed into a set of primitive arithmetic constraints
without hindering propagation.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 2009 14:17:40 GMT"
}
] | 1,253,836,800,000 | [
[
"Katsirelos",
"George",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Walsh",
"Toby",
""
]
] |
0910.1014 | Pierrick Tranouez | Pierrick Tranouez (LITIS), Antoine Dutot (LITIS) | Building upon Fast Multipole Methods to Detect and Model Organizations | null | DCDIS Series B: Applications & Algorithms 16, 4 (2009) 489 - 500 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many models in natural and social sciences are comprised of sets of
inter-acting entities whose intensity of interaction decreases with distance.
This often leads to structures of interest in these models composed of dense
packs of entities. Fast Multipole Methods are a family of methods developed to
help with the calculation of a number of computable models such as described
above. We propose a method that builds upon FMM to detect and model the dense
structures of these systems.
| [
{
"version": "v1",
"created": "Tue, 6 Oct 2009 14:19:56 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2009 08:35:15 GMT"
}
] | 1,254,960,000,000 | [
[
"Tranouez",
"Pierrick",
"",
"LITIS"
],
[
"Dutot",
"Antoine",
"",
"LITIS"
]
] |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.