id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0402021 | A Numerical Example on the Principles of Stochastic Discrimination | cs.CV cs.LG | Studies on ensemble methods for classification suffer from the difficulty of
modeling the complementary strengths of the components. Kleinberg's theory of
stochastic discrimination (SD) addresses this rigorously via mathematical
notions of enrichment, uniformity, and projectability of an ensemble. We
explain these co... |
cs/0402023 | A Service-Based Approach for Managing Mammography Data | cs.DB cs.SE | Grid-based technologies are emerging as a potential open-source
standards-based solution for managing and collabo-rating distributed resources.
In view of these new computing solutions, the Mammogrid project is developing a
service-based and Grid-aware application which manages a Euro-pean-wide
database of mammograms... |
cs/0402024 | Pattern Reification as the Basis for Description-Driven Systems | cs.DB cs.SE | One of the main factors driving object-oriented software development for
information systems is the requirement for systems to be tolerant to change. To
address this issue in designing systems, this paper proposes a pattern-based,
object-oriented, description-driven system (DDS) architecture as an extension
to the st... |
cs/0402025 | A perspective on the Healthgrid initiative | cs.DB cs.SE | This paper presents a perspective on the Healthgrid initiative which involves
European projects deploying pioneering applications of grid technology in the
health sector. In the last couple of years, several grid projects have been
funded on health related issues at national and European levels. A crucial
issue is to... |
cs/0402029 | Mapping Topics and Topic Bursts in PNAS | cs.IR cs.HC | Scientific research is highly dynamic. New areas of science continually
evolve;others gain or lose importance, merge or split. Due to the steady
increase in the number of scientific publications it is hard to keep an
overview of the structure and dynamic development of one's own field of
science, much less all scient... |
cs/0402030 | Computational complexity and simulation of rare events of Ising spin
glasses | cs.NE cs.AI | We discuss the computational complexity of random 2D Ising spin glasses,
which represent an interesting class of constraint satisfaction problems for
black box optimization. Two extremal cases are considered: (1) the +/- J spin
glass, and (2) the Gaussian spin glass. We also study a smooth transition
between these tw... |
cs/0402031 | Parameter-less hierarchical BOA | cs.NE cs.AI | The parameter-less hierarchical Bayesian optimization algorithm (hBOA)
enables the use of hBOA without the need for tuning parameters for solving each
problem instance. There are three crucial parameters in hBOA: (1) the selection
pressure, (2) the window size for restricted tournaments, and (3) the
population size. ... |
cs/0402032 | Fitness inheritance in the Bayesian optimization algorithm | cs.NE cs.AI cs.LG | This paper describes how fitness inheritance can be used to estimate fitness
for a proportion of newly sampled candidate solutions in the Bayesian
optimization algorithm (BOA). The goal of estimating fitness for some candidate
solutions is to reduce the number of fitness evaluations for problems where
fitness evaluat... |
cs/0402033 | Recycling Computed Answers in Rewrite Systems for Abduction | cs.AI | In rule-based systems, goal-oriented computations correspond naturally to the
possible ways that an observation may be explained. In some applications, we
need to compute explanations for a series of observations with the same domain.
The question whether previously computed answers can be recycled arises. A yes
answ... |
cs/0402035 | Memory As A Monadic Control Construct In Problem-Solving | cs.AI | Recent advances in programming languages study and design have established a
standard way of grounding computational systems representation in category
theory. These formal results led to a better understanding of issues of control
and side-effects in functional and imperative languages. This framework can be
success... |
cs/0402042 | Anonymity and Information Hiding in Multiagent Systems | cs.CR cs.LO cs.MA | We provide a framework for reasoning about information-hiding requirements in
multiagent systems and for reasoning about anonymity in particular. Our
framework employs the modal logic of knowledge within the context of the runs
and systems framework, much in the spirit of our earlier work on secrecy
[Halpern and O'Ne... |
cs/0402047 | Parameter-less Optimization with the Extended Compact Genetic Algorithm
and Iterated Local Search | cs.NE | This paper presents a parameter-less optimization framework that uses the
extended compact genetic algorithm (ECGA) and iterated local search (ILS), but
is not restricted to these algorithms. The presented optimization algorithm
(ILS+ECGA) comes as an extension of the parameter-less genetic algorithm (GA),
where the ... |
cs/0402049 | An architecture for massive parallelization of the compact genetic
algorithm | cs.NE | This paper presents an architecture which is suitable for a massive
parallelization of the compact genetic algorithm. The resulting scheme has
three major advantages. First, it has low synchronization costs. Second, it is
fault tolerant, and third, it is scalable.
The paper argues that the benefits that can be obta... |
cs/0402050 | A philosophical essay on life and its connections with genetic
algorithms | cs.NE | This paper makes a number of connections between life and various facets of
genetic and evolutionary algorithms research. Specifically, it addresses the
topics of adaptation, multiobjective optimization, decision making, deception,
and search operators, among others. It argues that human life, from birth to
death, is... |
cs/0402051 | Nested Intervals Tree Encoding with Continued Fractions | cs.DB | We introduce a new variation of Tree Encoding with Nested Intervals, find
connections with Materialized Path, and suggest a method for moving parts of
the hierarchy.
|
cs/0402053 | The Complexity of Modified Instances | cs.CC cs.AI | In this paper we study the complexity of solving a problem when a solution of
a similar instance is known. This problem is relevant whenever instances may
change from time to time, and known solutions may not remain valid after the
change. We consider two scenarios: in the first one, what is known is only a
solution ... |
cs/0402055 | Lexical Base as a Compressed Language Model of the World (on the
material of the Ukrainian language) | cs.CL | In the article the fact is verified that the list of words selected by formal
statistical methods (frequency and functional genre unrestrictedness) is not a
conglomerate of non-related words. It creates a system of interrelated items
and it can be named "lexical base of language". This selected list of words
covers a... |
cs/0402057 | Integrating Defeasible Argumentation and Machine Learning Techniques | cs.AI | The field of machine learning (ML) is concerned with the question of how to
construct algorithms that automatically improve with experience. In recent
years many successful ML applications have been developed, such as datamining
programs, information-filtering systems, etc. Although ML algorithms allow the
detection ... |
cs/0402061 | A Correlation-Based Distance | cs.IR | In this short technical report, we define on the sample space R^D a distance
between data points which depends on their correlation. We also derive an
expression for the center of mass of a set of points with respect to this
distance.
|
cs/0403001 | Evolving a Stigmergic Self-Organized Data-Mining | cs.AI cs.IR | Self-organizing complex systems typically are comprised of a large number of
frequently similar components or events. Through their process, a pattern at
the global-level of a system emerges solely from numerous interactions among
the lower-level components of the system. Moreover, the rules specifying
interactions a... |
cs/0403002 | Epistemic Foundation of Stable Model Semantics | cs.AI | Stable model semantics has become a very popular approach for the management
of negation in logic programming. This approach relies mainly on the closed
world assumption to complete the available knowledge and its formulation has
its basis in the so-called Gelfond-Lifschitz transformation.
The primary goal of this ... |
cs/0403003 | Genetic Algorithms and Quantum Computation | cs.NE | Recently, researchers have applied genetic algorithms (GAs) to address some
problems in quantum computation. Also, there has been some works in the
designing of genetic algorithms based on quantum theoretical concepts and
techniques. The so called Quantum Evolutionary Programming has two major
sub-areas: Quantum Insp... |
cs/0403006 | The role of behavior modifiers in representation development | cs.AI | We address the problem of the development of representations and their
relationship to the environment. We study a software agent which develops in a
network a representation of its simple environment which captures and
integrates the relationships between agent and environment through a closure
mechanism. The inclus... |
cs/0403009 | Demolishing Searle's Chinese Room | cs.AI cs.GL | Searle's Chinese Room argument is refuted by showing that he has actually
given two different versions of the room, which fail for different reasons.
Hence, Searle does not achieve his stated goal of showing ``that a system could
have input and output capabilities that duplicated those of a native Chinese
speaker and... |
cs/0403012 | Distributed Control by Lagrangian Steepest Descent | cs.MA cs.GT nlin.AO | Often adaptive, distributed control can be viewed as an iterated game between
independent players. The coupling between the players' mixed strategies,
arising as the system evolves from one instant to the next, is determined by
the system designer. Information theory tells us that the most likely joint
strategy of th... |
cs/0403014 | Search Efficiency in Indexing Structures for Similarity Searching | cs.DB | Similarity searching finds application in a wide variety of domains including
multilingual databases, computational biology, pattern recognition and text
retrieval. Similarity is measured in terms of a distance function, edit
distance, in general metric spaces, which is expensive to compute. Indexing
techniques can b... |
cs/0403016 | A Comparative Study of Arithmetic Constraints on Integer Intervals | cs.PL cs.AI | We propose here a number of approaches to implement constraint propagation
for arithmetic constraints on integer intervals. To this end we introduce
integer interval arithmetic. Each approach is explained using appropriate proof
rules that reduce the variable domains. We compare these approaches using a set
of benchm... |
cs/0403017 | Extending the SDSS Batch Query System to the National Virtual
Observatory Grid | cs.DB | The Sloan Digital Sky Survey science database is approaching 2TB. While the
vast majority of queries normally execute in seconds or minutes, this
interactive execution time can be disproportionately increased by a small
fraction of queries that take hours or days to run; either because they require
non-index scans of... |
cs/0403018 | The World Wide Telescope: An Archetype for Online Science | cs.DB | Most scientific data will never be directly examined by scientists; rather it
will be put into online databases where it will be analyzed and summarized by
computer programs. Scientists increasingly see their instruments through online
scientific archives and analysis tools, rather than examining the raw data.
Today ... |
cs/0403020 | The Sloan Digital Sky Survey Science Archive: Migrating a Multi-Terabyte
Astronomical Archive from Object to Relational DBMS | cs.DB | The Sloan Digital Sky Survey Science Archive is the first in a series of
multi-Terabyte digital archives in Astronomy and other data-intensive sciences.
To facilitate data mining in the SDSS archive, we adapted a commercial database
engine and built specialized tools on top of it. Originally we chose an
object-orient... |
cs/0403021 | A Quick Look at SATA Disk Performance | cs.DB cs.PF | We have been investigating the use of low-cost, commodity components for
multi-terabyte SQL Server databases. Dubbed storage bricks, these servers are
white box PCs containing the largest ATA drives, value-priced AMD or Intel
processors, and inexpensive ECC memory. One issue has been the wiring mess, air
flow problem... |
cs/0403025 | Distribution of Mutual Information from Complete and Incomplete Data | cs.LG cs.AI cs.IT math.IT math.ST stat.TH | Mutual information is widely used, in a descriptive way, to measure the
stochastic dependence of categorical random variables. In order to address
questions such as the reliability of the descriptive value, one must consider
sample-to-population inferential approaches. This paper deals with the
posterior distribution... |
cs/0403027 | An approach to membrane computing under inexactitude | cs.OH cs.NE | In this paper we introduce a fuzzy version of symport/antiport membrane
systems. Our fuzzy membrane systems handle possibly inexact copies of reactives
and their rules are endowed with threshold functions that determine whether a
rule can be applied or not to a given set of objects, depending of the degree
of accurac... |
cs/0403031 | Concept of E-machine: How does a "dynamical" brain learn to process
"symbolic" information? Part I | cs.AI cs.LG | The human brain has many remarkable information processing characteristics
that deeply puzzle scientists and engineers. Among the most important and the
most intriguing of these characteristics are the brain's broad universality as
a learning system and its mysterious ability to dynamically change
(reconfigure) its b... |
cs/0403032 | Where Fail-Safe Default Logics Fail | cs.AI cs.LO | Reiter's original definition of default logic allows for the application of a
default that contradicts a previously applied one. We call failure this
condition. The possibility of generating failures has been in the past
considered as a semantical problem, and variants have been proposed to solve
it. We show that it ... |
cs/0403035 | Web pages search engine based on DNS | cs.NI cs.IR | Search engine is main access to the largest information source in this world,
Internet. Now Internet is changing every aspect of our life. Information
retrieval service may be its most important services. But for common user,
internet search service is still far from our expectation, too many unrelated
search results... |
cs/0403038 | Tournament versus Fitness Uniform Selection | cs.LG cs.AI | In evolutionary algorithms a critical parameter that must be tuned is that of
selection pressure. If it is set too low then the rate of convergence towards
the optimum is likely to be slow. Alternatively if the selection pressure is
set too high the system is likely to become stuck in a local optimum due to a
loss of... |
cs/0403039 | A Flexible Rule Compiler for Speech Synthesis | cs.CL cs.AI | We present a flexible rule compiler developed for a text-to-speech (TTS)
system. The compiler converts a set of rules into a finite-state transducer
(FST). The input and output of the FST are subject to parameterization, so that
the system can be applied to strings and sequences of feature-structures. The
resulting t... |
cs/0404001 | On the Practicality of Intrinsic Reconfiguration As a Fault Recovery
Method in Analog Systems | cs.PF cs.NE | Evolvable hardware combines the powerful search capability of evolutionary
algorithms with the flexibility of reprogrammable devices, thereby providing a
natural framework for reconfiguration. This framework has generated an interest
in using evolvable hardware for fault-tolerant systems because reconfiguration
can e... |
cs/0404002 | Mathematical Analysis of Multi-Agent Systems | cs.RO cs.MA | We review existing approaches to mathematical modeling and analysis of
multi-agent systems in which complex collective behavior arises out of local
interactions between many simple agents. Though the behavior of an individual
agent can be considered to be stochastic and unpredictable, the collective
behavior of such ... |
cs/0404003 | Enhancing the expressive power of the U-Datalog language | cs.DB | U-Datalog has been developed with the aim of providing a set-oriented logical
update language, guaranteeing update parallelism in the context of a
Datalog-like language. In U-Datalog, updates are expressed by introducing
constraints (+p(X), to denote insertion, and [minus sign]p(X), to denote
deletion) inside Datalog... |
cs/0404004 | Dealing With Curious Players in Secure Networks | cs.CR cs.GT cs.MA | In secure communications networks there are a great number of user
behavioural problems, which need to be dealt with. Curious players pose a very
real and serious threat to the integrity of such a network. By traversing a
network a Curious player could uncover secret information, which that user has
no need to know, ... |
cs/0404006 | Delimited continuations in natural language: quantification and polarity
sensitivity | cs.CL cs.PL | Making a linguistic theory is like making a programming language: one
typically devises a type system to delineate the acceptable utterances and a
denotational semantics to explain observations on their behavior. Via this
connection, the programming language concept of delimited continuations can
help analyze natural... |
cs/0404007 | Polarity sensitivity and evaluation order in type-logical grammar | cs.CL | We present a novel, type-logical analysis of_polarity sensitivity_: how
negative polarity items (like "any" and "ever") or positive ones (like "some")
are licensed or prohibited. It takes not just scopal relations but also linear
order into account, using the programming-language notions of delimited
continuations an... |
cs/0404009 | Tabular Parsing | cs.CL | This is a tutorial on tabular parsing, on the basis of tabulation of
nondeterministic push-down automata. Discussed are Earley's algorithm, the
Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse
trees, and further issues.
|
cs/0404011 | Parametric external predicates for the DLV System | cs.AI | This document describes syntax, semantics and implementation guidelines in
order to enrich the DLV system with the possibility to make external C function
calls. This feature is realized by the introduction of parametric external
predicates, whose extension is not specified through a logic program but
implicitly comp... |
cs/0404012 | Toward the Implementation of Functions in the DLV System (Preliminary
Technical Report) | cs.AI | This document describes the functions as they are treated in the DLV system.
We give first the language, then specify the main implementation issues.
|
cs/0404013 | Tycoon: A Distributed Market-based Resource Allocation System | cs.DC cs.MA | P2P clusters like the Grid and PlanetLab enable in principle the same
statistical multiplexing efficiency gains for computing as the Internet
provides for networking. The key unsolved problem is resource allocation.
Existing solutions are not economically efficient and require high latency to
acquire resources. We de... |
cs/0404017 | Exploring tradeoffs in pleiotropy and redundancy using evolutionary
computing | cs.NE cs.NI | Evolutionary computation algorithms are increasingly being used to solve
optimization problems as they have many advantages over traditional
optimization algorithms. In this paper we use evolutionary computation to study
the trade-off between pleiotropy and redundancy in a client-server based
network. Pleiotropy is a... |
cs/0404018 | NLML--a Markup Language to Describe the Unlimited English Grammar | cs.CL cs.AI | In this paper we present NLML (Natural Language Markup Language), a markup
language to describe the syntactic and semantic structure of any grammatically
correct English expression. At first the related works are analyzed to
demonstrate the necessity of the NLML: simple form, easy management and direct
storage. Then ... |
cs/0404019 | Optimizing genetic algorithm strategies for evolving networks | cs.NE cs.NI | This paper explores the use of genetic algorithms for the design of networks,
where the demands on the network fluctuate in time. For varying network
constraints, we find the best network using the standard genetic algorithm
operators such as inversion, mutation and crossover. We also examine how the
choice of geneti... |
cs/0404024 | Computability Logic: a formal theory of interaction | cs.LO cs.AI math.LO | Computability logic is a formal theory of (interactive) computability in the
same sense as classical logic is a formal theory of truth. This approach was
initiated very recently in "Introduction to computability logic" (Annals of
Pure and Applied Logic 123 (2003), pp.1-99). The present paper reintroduces
computabilit... |
cs/0404025 | Test Collections for Patent-to-Patent Retrieval and Patent Map
Generation in NTCIR-4 Workshop | cs.CL | This paper describes the Patent Retrieval Task in the Fourth NTCIR Workshop,
and the test collections produced in this task. We perform the invalidity
search task, in which each participant group searches a patent collection for
the patents that can invalidate the demand in an existing claim. We also
perform the auto... |
cs/0404026 | DAB Content Annotation and Receiver Hardware Control with XML | cs.GL cs.CL | The Eureka-147 Digital Audio Broadcasting (DAB) standard defines the 'dynamic
labels' data field for holding information about the transmission content.
However, this information does not follow a well-defined structure since it is
designed to carry text for direct output to displays, for human interpretation.
This p... |
cs/0404030 | XML framework for concept description and knowledge representation | cs.AI cs.LO | An XML framework for concept description is given, based upon the fact that
the tree structure of XML implies the logical structure of concepts as defined
by attributional calculus. Especially, the attribute-value representation is
implementable in the XML framework. Since the attribute-value representation is
an imp... |
cs/0404032 | When Do Differences Matter? On-Line Feature Extraction Through Cognitive
Economy | cs.LG cs.AI cs.NE | For an intelligent agent to be truly autonomous, it must be able to adapt its
representation to the requirements of its task as it interacts with the world.
Most current approaches to on-line feature extraction are ad hoc; in contrast,
this paper presents an algorithm that bases judgments of state compatibility
and s... |
cs/0404033 | The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data | cs.GL cs.DB | In a variety of applications, we need to keep track of the development of a
data set over time. For maintaining and querying this multi version data
I/O-efficiently, external memory data structures are required. In this paper,
we present a probabilistic self-balancing persistent data structure in external
memory call... |
cs/0404036 | Online Searching with an Autonomous Robot | cs.RO cs.DS | We discuss online strategies for visibility-based searching for an object
hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task
is closely related to a number of well-studied problems. Our robot uses a
three-dimensional laser scanner in a stop, scan, plan, go fashion for building
a virtual t... |
cs/0404038 | 2-Sat Sub-Clauses and the Hypernodal Structure of the 3-Sat Problem | cs.CC cs.AI | Like simpler graphs, nested (hypernodal) graphs consist of two components: a
set of nodes and a set of edges, where each edge connects a pair of nodes. In
the hypernodal graph model, however, a node may contain other graphs, so that a
node may be contained in a graph that it contains. The inherently recursive
structu... |
cs/0404039 | Algorithms for Estimating Information Distance with Application to
Bioinformatics and Linguistics | cs.CC cs.CE q-bio.GN | After reviewing unnormalized and normalized information distances based on
incomputable notions of Kolmogorov complexity, we discuss how Kolmogorov
complexity can be approximated by data compression algorithms. We argue that
optimal algorithms for data compression with side information can be
successfully used to app... |
cs/0404041 | NLOMJ--Natural Language Object Model in Java | cs.CL cs.PL | In this paper we present NLOMJ--a natural language object model in Java with
English as the experiment language. This modal describes the grammar elements
of any permissible expression in a natural language and their complicated
relations with each other with the concept "Object" in OOP(Object Oriented
Programming). ... |
cs/0404042 | Extraction of topological features from communication network
topological patterns using self-organizing feature maps | cs.NE cs.CV | Different classes of communication network topologies and their
representation in the form of adjacency matrix and its eigenvalues are
presented. A self-organizing feature map neural network is used to map
different classes of communication network topological patterns. The neural
network simulation results are repor... |
cs/0404045 | Speculation on graph computation architectures and computing via
synchronization | cs.NE cs.AI | A speculative overview of a future topic of research. The paper is a
collection of ideas concerning two related areas:
1) Graph computation machines ("computing with graphs"). This is the class of
models of computation in which the state of the computation is represented as a
graph or network.
2) Arc-based neural... |
cs/0404046 | Visualising the structure of architectural open spaces based on shape
analysis | cs.CV cs.CG cs.DS | This paper proposes the application of some well known two-dimensional
geometrical shape descriptors for the visualisation of the structure of
architectural open spaces. The paper demonstrates the use of visibility
measures such as distance to obstacles and amount of visible space to calculate
shape descriptors such ... |
cs/0404049 | Exploiting Cross-Document Relations for Multi-document Evolving
Summarization | cs.CL cs.AI | This paper presents a methodology for summarization from multiple documents
which are about a specific topic. It is based on the specification and
identification of the cross-document relations that occur among textual
elements within those documents. Our methodology involves the specification of
the topic-specific e... |
cs/0404051 | Knowledge And The Action Description Language A | cs.AI | We introduce Ak, an extension of the action description language A (Gelfond
and Lifschitz, 1993) to handle actions which affect knowledge. We use sensing
actions to increase an agent's knowledge of the world and non-deterministic
actions to remove knowledge. We include complex plans involving conditionals
and loops i... |
cs/0404057 | Convergence of Discrete MDL for Sequential Prediction | cs.LG cs.AI math.ST stat.TH | We study the properties of the Minimum Description Length principle for
sequence prediction, considering a two-part MDL estimator which is chosen from
a countable class of models. This applies in particular to the important case
of universal sequence prediction, where the model class corresponds to all
algorithms for... |
cs/0405002 | Splitting an operator: Algebraic modularity results for logics with
fixpoint semantics | cs.AI cs.LO | It is well known that, under certain conditions, it is possible to split
logic programs under stable model semantics, i.e. to divide such a program into
a number of different "levels", such that the models of the entire program can
be constructed by incrementally constructing models for each level. Similar
results ex... |
cs/0405004 | Quantum Computers | cs.AI cs.AR | This research paper gives an overview of quantum computers - description of
their operation, differences between quantum and silicon computers, major
construction problems of a quantum computer and many other basic aspects. No
special scientific knowledge is necessary for the reader.
|
cs/0405005 | Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard | cs.CC cs.DM cs.IT math.IT | Maximum-likelihood decoding is one of the central algorithmic problems in
coding theory. It has been known for over 25 years that maximum-likelihood
decoding of general linear codes is NP-hard. Nevertheless, it was so far
unknown whether maximum- likelihood decoding remains hard for any specific
family of codes with ... |
cs/0405007 | "In vivo" spam filtering: A challenge problem for data mining | cs.AI cs.DB cs.IR | Spam, also known as Unsolicited Commercial Email (UCE), is the bane of email
communication. Many data mining researchers have addressed the problem of
detecting spam, generally by treating it as a static text classification
problem. True in vivo spam filtering has characteristics that make it a rich
and challenging d... |
cs/0405008 | A Comparative Study of Fuzzy Classification Methods on Breast Cancer
Data | cs.AI | In this paper, we examine the performance of four fuzzy rule generation
methods on Wisconsin breast cancer data. The first method generates fuzzy if
then rules using the mean and the standard deviation of attribute values. The
second approach generates fuzzy if then rules using the histogram of attributes
values. The... |
cs/0405009 | Intelligent Systems: Architectures and Perspectives | cs.AI | The integration of different learning and adaptation techniques to overcome
individual limitations and to achieve synergetic effects through the
hybridization or fusion of these techniques has, in recent years, contributed
to a large number of new intelligent system designs. Computational intelligence
is an innovativ... |
cs/0405010 | A Neuro-Fuzzy Approach for Modelling Electricity Demand in Victoria | cs.AI | Neuro-fuzzy systems have attracted growing interest of researchers in various
scientific and engineering areas due to the increasing need of intelligent
systems. This paper evaluates the use of two popular soft computing techniques
and conventional statistical approach based on Box--Jenkins autoregressive
integrated ... |
cs/0405011 | Neuro Fuzzy Systems: Sate-of-the-Art Modeling Techniques | cs.AI | Fusion of Artificial Neural Networks (ANN) and Fuzzy Inference Systems (FIS)
have attracted the growing interest of researchers in various scientific and
engineering areas due to the growing need of adaptive intelligent systems to
solve the real world problems. ANN learns from scratch by adjusting the
interconnection... |
cs/0405012 | Is Neural Network a Reliable Forecaster on Earth? A MARS Query! | cs.AI | Long-term rainfall prediction is a challenging task especially in the modern
world where we are facing the major environmental problem of global warming. In
general, climate and rainfall are highly non-linear phenomena in nature
exhibiting what is known as the butterfly effect. While some regions of the
world are not... |
cs/0405013 | DCT Based Texture Classification Using Soft Computing Approach | cs.AI | Classification of texture pattern is one of the most important problems in
pattern recognition. In this paper, we present a classification method based on
the Discrete Cosine Transform (DCT) coefficients of texture image. As DCT works
on gray level image, the color scheme of each image is transformed into gray
levels... |
cs/0405014 | Estimating Genome Reversal Distance by Genetic Algorithm | cs.AI | Sorting by reversals is an important problem in inferring the evolutionary
relationship between two genomes. The problem of sorting unsigned permutation
has been proven to be NP-hard. The best guaranteed error bounded is the 3/2-
approximation algorithm. However, the problem of sorting signed permutation can
be solve... |
cs/0405016 | Intrusion Detection Systems Using Adaptive Regression Splines | cs.AI | Past few years have witnessed a growing recognition of intelligent techniques
for the construction of efficient and reliable intrusion detection systems. Due
to increasing incidents of cyber attacks, building effective intrusion
detection systems (IDS) are essential for protecting information systems
security, and ye... |
cs/0405017 | Data Mining Approach for Analyzing Call Center Performance | cs.AI | The aim of our research was to apply well-known data mining techniques (such
as linear neural networks, multi-layered perceptrons, probabilistic neural
networks, classification and regression trees, support vector machines and
finally a hybrid decision tree neural network approach) to the problem of
predicting the qu... |
cs/0405018 | Modeling Chaotic Behavior of Stock Indices Using Intelligent Paradigms | cs.AI | The use of intelligent systems for stock market predictions has been widely
established. In this paper, we investigate how the seemingly chaotic behavior
of stock markets could be well represented using several connectionist
paradigms and soft computing techniques. To demonstrate the different
techniques, we consider... |
cs/0405019 | Hybrid Fuzzy-Linear Programming Approach for Multi Criteria Decision
Making Problems | cs.AI | The purpose of this paper is to point to the usefulness of applying a linear
mathematical formulation of fuzzy multiple criteria objective decision methods
in organising business activities. In this respect fuzzy parameters of linear
programming are modelled by preference-based membership functions. This paper
begins... |
cs/0405024 | Meta-Learning Evolutionary Artificial Neural Networks | cs.AI | In this paper, we present MLEANN (Meta-Learning Evolutionary Artificial
Neural Network), an automatic computational framework for the adaptive
optimization of artificial neural networks wherein the neural network
architecture, activation function, connection weights; learning algorithm and
its parameters are adapted ... |
cs/0405025 | The Largest Compatible Subset Problem for Phylogenetic Data | cs.AI | The phylogenetic tree construction is to infer the evolutionary relationship
between species from the experimental data. However, the experimental data are
often imperfect and conflicting each others. Therefore, it is important to
extract the motif from the imperfect data. The largest compatible subset
problem is tha... |
cs/0405026 | A Concurrent Fuzzy-Neural Network Approach for Decision Support Systems | cs.AI | Decision-making is a process of choosing among alternative courses of action
for solving complicated problems where multi-criteria objectives are involved.
The past few years have witnessed a growing recognition of Soft Computing
technologies that underlie the conception, design and utilization of
intelligent systems... |
cs/0405027 | Evolution of a Subsumption Architecture Neurocontroller | cs.AI cs.NE | An approach to robotics called layered evolution and merging features from
the subsumption architecture into evolutionary robotics is presented, and its
advantages are discussed. This approach is used to construct a layered
controller for a simulated robot that learns which light source to approach in
an environment ... |
cs/0405028 | Analysis of Hybrid Soft and Hard Computing Techniques for Forex
Monitoring Systems | cs.AI | In a universe with a single currency, there would be no foreign exchange
market, no foreign exchange rates, and no foreign exchange. Over the past
twenty-five years, the way the market has performed those tasks has changed
enormously. The need for intelligent monitoring systems has become a necessity
to keep track of... |
cs/0405029 | A New Computational Framework For 2D Shape-Enclosing Contours | cs.CV cs.CG | In this paper, a new framework for one-dimensional contour extraction from
discrete two-dimensional data sets is presented. Contour extraction is
important in many scientific fields such as digital image processing, computer
vision, pattern recognition, etc. This novel framework includes (but is not
limited to) algor... |
cs/0405030 | Business Intelligence from Web Usage Mining | cs.AI | The rapid e-commerce growth has made both business community and customers
face a new situation. Due to intense competition on one hand and the customer's
option to choose from several alternatives business community has realized the
necessity of intelligent marketing strategies and relationship management. Web
usage... |
cs/0405031 | Adaptation of Mamdani Fuzzy Inference System Using Neuro - Genetic
Approach for Tactical Air Combat Decision Support System | cs.AI | Normally a decision support system is build to solve problem where
multi-criteria decisions are involved. The knowledge base is the vital part of
the decision support containing the information or data that is used in
decision-making process. This is the field where engineers and scientists have
applied several intel... |
cs/0405032 | EvoNF: A Framework for Optimization of Fuzzy Inference Systems Using
Neural Network Learning and Evolutionary Computation | cs.AI | Several adaptation techniques have been investigated to optimize fuzzy
inference systems. Neural network learning algorithms have been used to
determine the parameters of fuzzy inference system. Such models are often
called as integrated neuro-fuzzy models. In an integrated neuro-fuzzy model
there is no guarantee tha... |
cs/0405033 | Optimization of Evolutionary Neural Networks Using Hybrid Learning
Algorithms | cs.AI | Evolutionary artificial neural networks (EANNs) refer to a special class of
artificial neural networks (ANNs) in which evolution is another fundamental
form of adaptation in addition to learning. Evolutionary algorithms are used to
adapt the connection weights, network architecture and learning algorithms
according t... |
cs/0405037 | A Probabilistic Model of Machine Translation | cs.CL | A probabilistic model for computer-based generation of a machine translation
system on the basis of English-Russian parallel text corpora is suggested. The
model is trained using parallel text corpora with pre-aligned source and target
sentences. The training of the model results in a bilingual dictionary of words
an... |
cs/0405038 | Deductive Algorithmic Knowledge | cs.AI cs.LO | The framework of algorithmic knowledge assumes that agents use algorithms to
compute the facts they explicitly know. In many cases of interest, a deductive
system, rather than a particular algorithm, captures the formal reasoning used
by the agents to compute what they explicitly know. We introduce a logic for
reason... |
cs/0405039 | Catching the Drift: Probabilistic Content Models, with Applications to
Generation and Summarization | cs.CL | We consider the problem of modeling the content structure of texts within a
specific domain, in terms of the topics the texts address and the order in
which these topics appear. We first present an effective knowledge-lean method
for learning content models from un-annotated documents, utilizing a novel
adaptation of... |
cs/0405041 | The modulus in the CAD system drawings as a base of developing of the
problem-oriented extensions | cs.CE cs.DS | The concept of the "modulus" in the CAD system drawings is characterized,
being a base of developing of the problem-oriented extensions. The modulus
consists of visible geometric elements of the drawing and invisible parametric
representation of the modelling object. The technological advantages of
moduluss in a comp... |
cs/0405043 | Prediction with Expert Advice by Following the Perturbed Leader for
General Weights | cs.LG cs.AI | When applying aggregating strategies to Prediction with Expert Advice, the
learning rate must be adaptively tuned. The natural choice of
sqrt(complexity/current loss) renders the analysis of Weighted Majority
derivatives quite complicated. In particular, for arbitrary weights there have
been no results proven so far.... |
cs/0405044 | Corpus structure, language models, and ad hoc information retrieval | cs.IR cs.CL | Most previous work on the recently developed language-modeling approach to
information retrieval focuses on document-specific characteristics, and
therefore does not take into account the structure of the surrounding corpus.
We propose a novel algorithmic framework in which information provided by
document-based lang... |
cs/0405047 | Modular technology of developing of the problem-oriented extensions of a
CAD system of reconstruction of the plant | cs.CE cs.DS | The modular technology of creation of the problem-oriented extensions of a
CAD system is described, which was realised in a system TechnoCAD GlassX for
designing of reconstruction of the plants. The modularity of the technology is
expressed in storage of all parameters of the design in one element of the
drawing - mo... |
cs/0405049 | Export Behaviour Modeling Using EvoNF Approach | cs.AI | The academic literature suggests that the extent of exporting by
multinational corporation subsidiaries (MCS) depends on their product
manufactured, resources, tax protection, customers and markets, involvement
strategy, financial independence and suppliers' relationship with a
multinational corporation (MNC). The ai... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.