id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0306125 | Predicting Response-Function Results of Electrical/Mechanical Systems
Through Artificial Neural Network | cs.NE | In the present paper a newer application of Artificial Neural Network (ANN)
has been developed i.e., predicting response-function results of
electrical-mechanical system through ANN. This method is specially useful to
complex systems for which it is not possible to find the response-function
because of complexity of ... |
cs/0306126 | Bayesian Treatment of Incomplete Discrete Data applied to Mutual
Information and Feature Selection | cs.LG cs.AI math.PR | Given the joint chances of a pair of random variables one can compute
quantities of interest, like the mutual information. The Bayesian treatment of
unknown chances involves computing, from a second order prior distribution and
the data likelihood, a posterior distribution of the chances. A common
treatment of incomp... |
cs/0306130 | Anusaaraka: Machine Translation in Stages | cs.CL cs.AI | Fully-automatic general-purpose high-quality machine translation systems
(FGH-MT) are extremely difficult to build. In fact, there is no system in the
world for any pair of languages which qualifies to be called FGH-MT. The
reasons are not far to seek. Translation is a creative process which involves
interpretation o... |
cs/0306135 | Pruning Isomorphic Structural Sub-problems in Configuration | cs.AI | Configuring consists in simulating the realization of a complex product from
a catalog of component parts, using known relations between types, and picking
values for object attributes. This highly combinatorial problem in the field of
constraint programming has been addressed with a variety of approaches since
the f... |
cs/0307001 | Serving Database Information Using a Flexible Server in a Three Tier
Architecture | cs.DC cs.DB | The D0 experiment at Fermilab relies on a central Oracle database for storing
all detector calibration information. Access to this data is needed by hundreds
of physics applications distributed worldwide. In order to meet the demands of
these applications from scarce resources, we have created a distributed system
th... |
cs/0307002 | AWESOME: A General Multiagent Learning Algorithm that Converges in
Self-Play and Learns a Best Response Against Stationary Opponents | cs.GT cs.LG cs.MA | A satisfactory multiagent learning algorithm should, {\em at a minimum},
learn to play optimally against stationary opponents and converge to a Nash
equilibrium in self-play. The algorithm that has come closest, WoLF-IGA, has
been proven to have these two properties in 2-player 2-action repeated
games--assuming that ... |
cs/0307003 | How many candidates are needed to make elections hard to manipulate? | cs.GT cs.CC cs.MA | In multiagent settings where the agents have different preferences,
preference aggregation is a central issue. Voting is a general method for
preference aggregation, but seminal results have shown that all general voting
protocols are manipulable. One could try to avoid manipulation by using voting
protocols where de... |
cs/0307004 | State complexes for metamorphic robots | cs.RO cs.CG | A metamorphic robotic system is an aggregate of homogeneous robot units which
can individually and selectively locomote in such a way as to change the global
shape of the system. We introduce a mathematical framework for defining and
analyzing general metamorphic robots. This formal structure, combined with
ideas fro... |
cs/0307006 | BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games | cs.GT cs.LG cs.MA | We present BL-WoLF, a framework for learnability in repeated zero-sum games
where the cost of learning is measured by the losses the learning agent accrues
(rather than the number of rounds). The game is adversarially chosen from some
family that the learner knows. The opponent knows the game and the learner's
learni... |
cs/0307010 | Probabilistic Reasoning as Information Compression by Multiple
Alignment, Unification and Search: An Introduction and Overview | cs.AI | This article introduces the idea that probabilistic reasoning (PR) may be
understood as "information compression by multiple alignment, unification and
search" (ICMAUS). In this context, multiple alignment has a meaning which is
similar to but distinct from its meaning in bio-informatics, while unification
means a si... |
cs/0307011 | Supporting Out-of-turn Interactions in a Multimodal Web Interface | cs.IR cs.HC | Multimodal interfaces are becoming increasingly important with the advent of
mobile devices, accessibility considerations, and novel software technologies
that combine diverse interaction media. This article investigates systems
support for web browsing in a multimodal interface. Specifically, we outline
the design a... |
cs/0307013 | 'Computing' as Information Compression by Multiple Alignment,
Unification and Search | cs.AI cs.CC | This paper argues that the operations of a 'Universal Turing Machine' (UTM)
and equivalent mechanisms such as the 'Post Canonical System' (PCS) - which are
widely accepted as definitions of the concept of `computing' - may be
interpreted as *information compression by multiple alignment, unification and
search* (ICMA... |
cs/0307014 | Syntax, Parsing and Production of Natural Language in a Framework of
Information Compression by Multiple Alignment, Unification and Search | cs.AI cs.CL | This article introduces the idea that "information compression by multiple
alignment, unification and search" (ICMAUS) provides a framework within which
natural language syntax may be represented in a simple format and the parsing
and production of natural language may be performed in a transparent manner.
The ICMA... |
cs/0307015 | Architecture of an Open-Sourced, Extensible Data Warehouse Builder:
InterBase 6 Data Warehouse Builder (IB-DWB) | cs.DB | We report the development of an open-sourced data warehouse builder,
InterBase Data Warehouse Builder (IB-DWB), based on Borland InterBase 6 Open
Edition Database Server. InterBase 6 is used for its low maintenance and small
footprint. IB-DWB is designed modularly and consists of 5 main components, Data
Plug Platform... |
cs/0307016 | Complexity of Determining Nonemptiness of the Core | cs.GT cs.CC cs.MA | Coalition formation is a key problem in automated negotiation among
self-interested agents, and other multiagent applications. A coalition of
agents can sometimes accomplish things that the individual agents cannot, or
can do things more efficiently. However, motivating the agents to abide to a
solution requires care... |
cs/0307017 | Definition and Complexity of Some Basic Metareasoning Problems | cs.AI cs.CC | In most real-world settings, due to limited time or other resources, an agent
cannot perform all potentially useful deliberation and information gathering
actions. This leads to the metareasoning problem of selecting such actions.
Decision-theoretic methods for metareasoning have been studied in AI, but there
are few... |
cs/0307018 | Universal Voting Protocol Tweaks to Make Manipulation Hard | cs.GT cs.CC cs.MA | Voting is a general method for preference aggregation in multiagent settings,
but seminal results have shown that all (nondictatorial) voting protocols are
manipulable. One could try to avoid manipulation by using voting protocols
where determining a beneficial manipulation is hard computationally. A number
of recent... |
cs/0307025 | Information Compression by Multiple Alignment, Unification and Search as
a Unifying Principle in Computing and Cognition | cs.AI | This article presents an overview of the idea that "information compression
by multiple alignment, unification and search" (ICMAUS) may serve as a unifying
principle in computing (including mathematics and logic) and in such aspects of
human cognition as the analysis and production of natural language, fuzzy
pattern ... |
cs/0307028 | Issues in Communication Game | cs.CL | As interaction between autonomous agents, communication can be analyzed in
game-theoretic terms. Meaning game is proposed to formalize the core of
intended communication in which the sender sends a message and the receiver
attempts to infer its meaning intended by the sender. Basic issues involved in
the game of natu... |
cs/0307030 | Parsing and Generation with Tabulation and Compilation | cs.CL | The standard tabulation techniques for logic programming presuppose fixed
order of computation. Some data-driven control should be introduced in order to
deal with diverse contexts. The present paper describes a data-driven method of
constraint transformation with a sort of compilation which subsumes
accessibility ch... |
cs/0307031 | Automatic Classification using Self-Organising Neural Networks in
Astrophysical Experiments | cs.NE astro-ph cs.AI | Self-Organising Maps (SOMs) are effective tools in classification problems,
and in recent years the even more powerful Dynamic Growing Neural Networks, a
variant of SOMs, have been developed. Automatic Classification (also called
clustering) is an important and difficult problem in many Astrophysical
experiments, for... |
cs/0307032 | Data Management and Mining in Astrophysical Databases | cs.DB astro-ph physics.data-an | We analyse the issues involved in the management and mining of astrophysical
data. The traditional approach to data management in the astrophysical field is
not able to keep up with the increasing size of the data gathered by modern
detectors. An essential role in the astrophysical research will be assumed by
automat... |
cs/0307037 | Supporting Dynamic Ad hoc Collaboration Capabilities | cs.OH cs.AI | Modern HENP experiments such as CMS and Atlas involve as many as 2000
collaborators around the world. Collaborations this large will be unable to
meet often enough to support working closely together. Many of the tools
currently available for collaboration focus on heavy-weight applications such
as videoconferencing ... |
cs/0307038 | Manifold Learning with Geodesic Minimal Spanning Trees | cs.CV cs.LG | In the manifold learning problem one seeks to discover a smooth low
dimensional surface, i.e., a manifold embedded in a higher dimensional linear
vector space, based on a set of measured sample points on the surface. In this
paper we consider the closely related problem of estimating the manifold's
intrinsic dimensio... |
cs/0307039 | Modeling Business | cs.CE | Business concepts are studied using a metamodel-based approach, using UML
2.0. The Notation Independent Business concepts metamodel is introduced. The
approach offers a mapping between different business modeling notations which
could be used for bridging BM tools and boosting the MDA approach.
|
cs/0307040 | Bridging the gap between modal temporal logics and constraint-based QSR
as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes | cs.AI cs.LO | The aim of this work is to provide a family of qualitative theories for
spatial change in general, and for motion of spatial scenes in particular. To
achieve this, we consider a spatio-temporalisation MTALC(D_x), of the
well-known ALC(D) family of Description Logics (DLs) with a concrete domainan.
In particular, the ... |
cs/0307044 | The Linguistic DS: Linguisitic Description in MPEG-7 | cs.CL | MPEG-7 (Moving Picture Experts Group Phase 7) is an XML-based international
standard on semantic description of multimedia content. This document discusses
the Linguistic DS and related tools. The linguistic DS is a tool, based on the
GDA tag set (http://i-content.org/GDA/tagset.html), for semantic annotation of
ling... |
cs/0307045 | Flexible Camera Calibration Using a New Analytical Radial Undistortion
Formula with Application to Mobile Robot Localization | cs.CV | Most algorithms in 3D computer vision rely on the pinhole camera model
because of its simplicity, whereas virtually all imaging devices introduce
certain amount of nonlinear distortion, where the radial distortion is the most
severe part. Common approach to radial distortion is by the means of polynomial
approximatio... |
cs/0307046 | A New Analytical Radial Distortion Model for Camera Calibration | cs.CV | Common approach to radial distortion is by the means of polynomial
approximation, which introduces distortion-specific parameters into the camera
model and requires estimation of these distortion parameters. The task of
estimating radial distortion is to find a radial distortion model that allows
easy undistortion as... |
cs/0307047 | Rational Radial Distortion Models with Analytical Undistortion Formulae | cs.CV | The common approach to radial distortion is by the means of polynomial
approximation, which introduces distortion-specific parameters into the camera
model and requires estimation of these distortion parameters. The task of
estimating radial distortion is to find a radial distortion model that allows
easy undistortio... |
cs/0307048 | Integrating cardinal direction relations and other orientation relations
in Qualitative Spatial Reasoning | cs.AI | We propose a calculus integrating two calculi well-known in Qualitative
Spatial Reasoning (QSR): Frank's projection-based cardinal direction calculus,
and a coarser version of Freksa's relative orientation calculus. An original
constraint propagation procedure is presented, which implements the interaction
between th... |
cs/0307050 | A ternary Relation Algebra of directed lines | cs.AI | We define a ternary Relation Algebra (RA) of relative position relations on
two-dimensional directed lines (d-lines for short). A d-line has two degrees of
freedom (DFs): a rotational DF (RDF), and a translational DF (TDF). The
representation of the RDF of a d-line will be handled by an RA of 2D
orientations, CYC_t, ... |
cs/0307051 | An Analytical Piecewise Radial Distortion Model for Precision Camera
Calibration | cs.CV | The common approach to radial distortion is by the means of polynomial
approximation, which introduces distortion-specific parameters into the camera
model and requires estimation of these distortion parameters. The task of
estimating radial distortion is to find a radial distortion model that allows
easy undistortio... |
cs/0307053 | Hamevol1.0: a C++ code for differential equations based on Runge-Kutta
algorithm. An application to matter enhanced neutrino oscillation | cs.CE | We present a C++ implementation of a fifth order semi-implicit Runge-Kutta
algorithm for solving Ordinary Differential Equations. This algorithm can be
used for studying many different problems and in particular it can be applied
for computing the evolution of any system whose Hamiltonian is known. We
consider in par... |
cs/0307054 | Contributions to the Development and Improvement of a Regulatory and
Pre-Regulatory Digitally System for the Tools within Flexible Fabrication
Systems | cs.CE cs.SE | The paper reports the obtained results for the projection and realization of
a digitally system aiming to assist the equipment for a regulatory and
pre-regulatory tools and holding tools within the flexible fabrication systems
(FFS). Moreover, based on the present results, the same methodology can be
applied for assi... |
cs/0307055 | Learning Analogies and Semantic Relations | cs.LG cs.CL cs.IR | We present an algorithm for learning from unlabeled text, based on the Vector
Space Model (VSM) of information retrieval, that can solve verbal analogy
questions of the kind found in the Scholastic Aptitude Test (SAT). A verbal
analogy has the form A:B::C:D, meaning "A is to B as C is to D"; for example,
mason:stone:... |
cs/0307056 | From Statistical Knowledge Bases to Degrees of Belief | cs.AI | An intelligent agent will often be uncertain about various properties of its
environment, and when acting in that environment it will frequently need to
quantify its uncertainty. For example, if the agent wishes to employ the
expected-utility paradigm of decision theory to guide its actions, it will need
to assign de... |
cs/0307060 | Neural realisation of the SP theory: cell assemblies revisited | cs.AI cs.NE | This paper describes how the elements of the SP theory (Wolff, 2003a) may be
realised with neural structures and processes. To the extent that this is
successful, the insights that have been achieved in the SP theory - the
integration and simplification of a range of phenomena in perception and
cognition - may be inc... |
cs/0307061 | Boundary knot method for Laplace and biharmonic problems | cs.CE cs.MS | The boundary knot method (BKM) [1] is a meshless boundary-type radial basis
function (RBF) collocation scheme, where the nonsingular general solution is
used instead of fundamental solution to evaluate the homogeneous solution,
while the dual reciprocity method (DRM) is employed to approximation of
particular solutio... |
cs/0307063 | An Alternative to RDF-Based Languages for the Representation and
Processing of Ontologies in the Semantic Web | cs.AI | This paper describes an approach to the representation and processing of
ontologies in the Semantic Web, based on the ICMAUS theory of computation and
AI. This approach has strengths that complement those of languages based on the
Resource Description Framework (RDF) such as RDF Schema and DAML+OIL. The main
benefits... |
cs/0307064 | Implementing an Agent Trade Server | cs.CE | An experimental server for stock trading autonomous agents is presented and
made available, together with an agent shell for swift development. The server,
written in Java, was implemented as proof-of-concept for an agent trade server
for a real financial exchange.
|
cs/0307068 | Web Access to Cultural Heritage for the Disabled | cs.CY cs.HC cs.IR | Physical disabled access is something that most cultural institutions such as
museums consider very seriously. Indeed, there are normally legal requirements
to do so. However, online disabled access is still a relatively novel and
developing field. Many cultural organizations have not yet considered the
issues in dep... |
cs/0307069 | A logic for reasoning about upper probabilities | cs.AI cs.LO | We present a propositional logic %which can be used to reason about the
uncertainty of events, where the uncertainty is modeled by a set of probability
measures assigning an interval of probability to each event. We give a sound
and complete axiomatization for the logic, and show that the satisfiability
problem is NP... |
cs/0307070 | Modeling Belief in Dynamic Systems, Part I: Foundations | cs.AI cs.LO | Belief change is a fundamental problem in AI: Agents constantly have to
update their beliefs to accommodate new observations. In recent years, there
has been much work on axiomatic characterizations of belief change. We claim
that a better understanding of belief change can be gained from examining
appropriate semant... |
cs/0307071 | Modeling Belief in Dynamic Systems, Part II: Revisions and Update | cs.AI cs.LO | The study of belief change has been an active area in philosophy and AI. In
recent years two special cases of belief change, belief revision and belief
update, have been studied in detail. In a companion paper, we introduce a new
framework to model belief change. This framework combines temporal and
epistemic modalit... |
cs/0307072 | Camera Calibration: a USU Implementation | cs.CV | The task of camera calibration is to estimate the intrinsic and extrinsic
parameters of a camera model. Though there are some restricted techniques to
infer the 3-D information about the scene from uncalibrated cameras, effective
camera calibration procedures will open up the possibility of using a wide
range of exis... |
cs/0307073 | Search and Navigation in Relational Databases | cs.DB | We present a new application for keyword search within relational databases,
which uses a novel algorithm to solve the join discovery problem by finding
Memex-like trails through the graph of foreign key dependencies. It differs
from previous efforts in the algorithms used, in the presentation mechanism and
in the us... |
cs/0308001 | Two- versus three-dimensional connectivity testing of first-order
queries to semi-algebraic sets | cs.LO cs.CG cs.DB | This paper addresses the question whether one can determine the connectivity
of a semi-algebraic set in three dimensions by testing the connectivity of a
finite number of two-dimensional ``samples'' of the set, where these samples
are defined by first-order queries. The question is answered negatively for two
classes... |
cs/0308002 | Quantifying and Visualizing Attribute Interactions | cs.AI | Interactions are patterns between several attributes in data that cannot be
inferred from any subset of these attributes. While mutual information is a
well-established approach to evaluating the interactions between two
attributes, we surveyed its generalizations as to quantify interactions between
several attribute... |
cs/0308003 | A Family of Simplified Geometric Distortion Models for Camera
Calibration | cs.CV | The commonly used radial distortion model for camera calibration is in fact
an assumption or a restriction. In practice, camera distortion could happen in
a general geometrical manner that is not limited to the radial sense. This
paper proposes a simplified geometrical distortion modeling method by using two
differen... |
cs/0308004 | DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators | cs.DB cs.DS | We present a new algorithm for fast record retrieval,
distribute-probe-gather, or DPG. DPG has important applications both in sorting
and in joins. Current main memory sorting algorithms split their work into
three phases: extraction of key-pointer pairs; sorting of the key-pointer
pairs; and copying of the original ... |
cs/0308005 | Disabled Access for Museum Websites | cs.CY cs.HC cs.IR | Physical disabled access is something that most museums consider very
seriously. Indeed, there are normally legal requirements to do so. However,
online disabled access is still a relatively novel field. Most museums have not
yet considered the issues in depth. The Human-Computer Interface for their
websites is norma... |
cs/0308008 | A Grid Based Architecture for High-Performance NLP | cs.DC cs.CL | We describe the design and early implementation of an extensible,
component-based software architecture for natural language engineering
applications which interfaces with high performance distributed computing
services. The architecture leverages existing linguistic resource description
and discovery mechanisms base... |
cs/0308009 | The Generalized Riemann or Henstock Integral Underpinning Multivariate
Data Analysis: Application to Faint Structure Finding in Price Processes | cs.CE cs.CV | Practical data analysis involves many implicit or explicit assumptions about
the good behavior of the data, and excludes consideration of various
potentially pathological or limit cases. In this work, we present a new general
theory of data, and of data processing, to bypass some of these assumptions.
The new framewo... |
cs/0308013 | A Robust and Computational Characterisation of Peer-to-Peer Database
Systems | cs.DC cs.DB | In this paper we give a robust logical and computational characterisation of
peer-to-peer database systems. We first define a pre- cise model-theoretic
semantics of a peer-to-peer system, which allows for local inconsistency
handling. We then characterise the general computa- tional properties for the
problem of answ... |
cs/0308014 | On the expressive power of semijoin queries | cs.DB cs.LO | The semijoin algebra is the variant of the relational algebra obtained by
replacing the join operator by the semijoin operator. We provide an
Ehrenfeucht-Fraiss\'{e} game, characterizing the discerning power of the
semijoin algebra. This game gives a method for showing that queries are not
expressible in the semijoin... |
cs/0308016 | Collaborative Creation of Digital Content in Indian Languages | cs.CL | The world is passing through a major revolution called the information
revolution, in which information and knowledge is becoming available to people
in unprecedented amounts wherever and whenever they need it. Those societies
which fail to take advantage of the new technology will be left behind, just
like in the in... |
cs/0308017 | Information Revolution | cs.CL | The world is passing through a major revolution called the information
revolution, in which information and knowledge is becoming available to people
in unprecedented amounts wherever and whenever they need it. Those societies
which fail to take advantage of the new technology will be left behind, just
like in the in... |
cs/0308018 | Anusaaraka: Overcoming the Language Barrier in India | cs.CL | The anusaaraka system makes text in one Indian language accessible in another
Indian language. In the anusaaraka approach, the load is so divided between man
and computer that the language load is taken by the machine, and the
interpretation of the text is left to the man. The machine presents an image of
the source ... |
cs/0308019 | Language Access: An Information Based Approach | cs.CL | The anusaaraka system (a kind of machine translation system) makes text in
one Indian language accessible through another Indian language. The machine
presents an image of the source text in a language close to the target
language. In the image, some constructions of the source language (which do not
have equivalents... |
cs/0308020 | LERIL : Collaborative Effort for Creating Lexical Resources | cs.CL | The paper reports on efforts taken to create lexical resources pertaining to
Indian languages, using the collaborative model. The lexical resources being
developed are: (1) Transfer lexicon and grammar from English to several Indian
languages. (2) Dependencey tree bank of annotated corpora for several Indian
language... |
cs/0308022 | Extending Dublin Core Metadata to Support the Description and Discovery
of Language Resources | cs.CL cs.DL | As language data and associated technologies proliferate and as the language
resources community expands, it is becoming increasingly difficult to locate
and reuse existing resources. Are there any lexical resources for such-and-such
a language? What tool works with transcripts in this particular format? What is
a go... |
cs/0308023 | On the complexity of curve fitting algorithms | cs.CC cs.CV | We study a popular algorithm for fitting polynomial curves to scattered data
based on the least squares with gradient weights. We show that sometimes this
algorithm admits a substantial reduction of complexity, and, furthermore, find
precise conditions under which this is possible. It turns out that this is,
indeed, ... |
cs/0308025 | Controlled hierarchical filtering: Model of neocortical sensory
processing | cs.NE cs.AI cs.LG q-bio.NC | A model of sensory information processing is presented. The model assumes
that learning of internal (hidden) generative models, which can predict the
future and evaluate the precision of that prediction, is of central importance
for information extraction. Furthermore, the model makes a bridge to
goal-oriented system... |
cs/0308028 | Finding Traitors in Secure Networks Using Byzantine Agreements | cs.CR cs.DC cs.GT cs.MA | Secure networks rely upon players to maintain security and reliability.
However not every player can be assumed to have total loyalty and one must use
methods to uncover traitors in such networks. We use the original concept of
the Byzantine Generals Problem by Lamport, and the more formal Byzantine
Agreement describ... |
cs/0308030 | Learning in Multiagent Systems: An Introduction from a Game-Theoretic
Perspective | cs.MA cs.AI | We introduce the topic of learning in multiagent systems. We first provide a
quick introduction to the field of game theory, focusing on the equilibrium
concepts of iterated dominance, and Nash equilibrium. We show some of the most
relevant findings in the theory of learning in games, including theorems on
fictitious... |
cs/0308031 | Artificial Neural Networks for Beginners | cs.NE cs.AI | The scope of this teaching package is to make a brief induction to Artificial
Neural Networks (ANNs) for people who have no previous knowledge of them. We
first make a brief introduction to models of networks, for then describing in
general terms ANNs. As an application, we explain the backpropagation
algorithm, sinc... |
cs/0308032 | Evaluation of text data mining for database curation: lessons learned
from the KDD Challenge Cup | cs.CL q-bio.OT | MOTIVATION: The biological literature is a major repository of knowledge.
Many biological databases draw much of their content from a careful curation of
this literature. However, as the volume of literature increases, the burden of
curation increases. Text mining may provide useful tools to assist in the
curation pr... |
cs/0308033 | Coherent Keyphrase Extraction via Web Mining | cs.LG cs.CL cs.IR | Keyphrases are useful for a variety of purposes, including summarizing,
indexing, labeling, categorizing, clustering, highlighting, browsing, and
searching. The task of automatic keyphrase extraction is to select keyphrases
from within the text of a given document. Automatic keyphrase extraction makes
it feasible to ... |
cs/0308034 | Fingerprint based bio-starter and bio-access | cs.CV | In the paper will be presented a safety and security system based on
fingerprint technology. The results suggest a new scenario where the new cars
can use a fingerprint sensor integrated in car handle to allow access and in
the dashboard as starter button.
|
cs/0308035 | IS (Iris Security) | cs.CV | In the paper will be presented a safety system based on iridology. The
results suggest a new scenario where the security problem in supervised and
unsupervised areas can be treat with the present system and the iris image
recognition.
|
cs/0308037 | Distributed and Parallel Net Imaging | cs.CV astro-ph cs.DC | A very complex vision system is developed to detect luminosity variations
connected with the discovery of new planets in the Universe. The traditional
imaging system can not manage a so large load. A private net is implemented to
perform an automatic vision and decision architecture. It lets to carry out an
on-line d... |
cs/0308038 | Image Analysis in Astronomy for very large vision machine | cs.CV astro-ph cs.DC | It is developed a very complex system (hardware/software) to detect
luminosity variations connected with the discovery of new planets outside the
Solar System. Traditional imaging approaches are very demanding in terms of
computing time; then, the implementation of an automatic vision and decision
software architectu... |
cs/0308039 | A new approach to relevancy in Internet searching - the "Vox Populi
Algorithm" | cs.DS cond-mat.dis-nn cs.IR | In this paper we will derive a new algorithm for Internet searching. The main
idea of this algorithm is to extend the existing algorithms by a component,
which reflects the interests of the users more than existing methods. The "Vox
Populi Algorithm" (VPA) creates a feedback from the users to the content of the
searc... |
cs/0308042 | Centralized reward system gives rise to fast and efficient work sharing
for intelligent Internet agents lacking direct communication | cs.IR | WWW has a scale-free structure where novel information is often difficult to
locate. Moreover, Intelligent agents easily get trapped in this structure. Here
a novel method is put forth, which turns these traps into information
repositories, supplies: We populated an Internet environment with intelligent
news foragers... |
cs/0309007 | ROC Curves Within the Framework of Neural Network Assembly Memory Model:
Some Analytic Results | cs.AI cs.IR q-bio.NC q-bio.QM | On the basis of convolutional (Hamming) version of recent Neural Network
Assembly Memory Model (NNAMM) for intact two-layer autoassociative Hopfield
network optimal receiver operating characteristics (ROCs) have been derived
analytically. A method of taking into account explicitly a priori probabilities
of alternativ... |
cs/0309009 | What Is Working Memory and Mental Imagery? A Robot that Learns to
Perform Mental Computations | cs.AI cs.NE | This paper goes back to Turing (1936) and treats his machine as a cognitive
model (W,D,B), where W is an "external world" represented by memory device (the
tape divided into squares), and (D,B) is a simple robot that consists of the
sensory-motor devices, D, and the brain, B. The robot's sensory-motor devices
(the "e... |
cs/0309011 | Indexing of Tables Referencing Complex Structures | cs.DB | We introduce indexing of tables referencing complex structures such as
digraphs and spatial objects, appearing in genetics and other data intensive
analysis. The indexing is achieved by extracting dimension schemas from the
referenced structures. The schemas and their dimensionality are determined by
proper coloring ... |
cs/0309012 | Exploration of RNA Editing and Design of Robust Genetic Algorithms | cs.NE cs.AI nlin.AO q-bio.GN | This paper presents our computational methodology using Genetic Algorithms
(GA) for exploring the nature of RNA editing. These models are constructed
using several genetic editing characteristics that are gleaned from the RNA
editing system as observed in several organisms. We have expanded the
traditional Genetic Al... |
cs/0309013 | Semi-metric Behavior in Document Networks and its Application to
Recommendation Systems | cs.IR cond-mat.dis-nn cond-mat.stat-mech cs.AI cs.DL cs.HC cs.MA | Recommendation systems for different Document Networks (DN) such as the World
Wide Web (WWW) and Digital Libraries, often use distance functions extracted
from relationships among documents and keywords. For instance, documents in the
WWW are related via a hyperlink network, while documents in bibliographic
databases... |
cs/0309015 | Reliable and Efficient Inference of Bayesian Networks from Sparse Data
by Statistical Learning Theory | cs.LG | To learn (statistical) dependencies among random variables requires
exponentially large sample size in the number of observed random variables if
any arbitrary joint probability distribution can occur.
We consider the case that sparse data strongly suggest that the probabilities
can be described by a simple Bayesia... |
cs/0309016 | Using Simulated Annealing to Calculate the Trembles of Trembling Hand
Perfection | cs.GT cs.CC cs.DS cs.LG cs.NE q-bio.PE | Within the literature on non-cooperative game theory, there have been a
number of attempts to propose logorithms which will compute Nash equilibria.
Rather than derive a new algorithm, this paper shows that the family of
algorithms known as Markov chain Monte Carlo (MCMC) can be used to calculate
Nash equilibria. MCM... |
cs/0309018 | Using Propagation for Solving Complex Arithmetic Constraints | math.NA cs.AR cs.CC cs.NA cs.PF cs.RO | Solving a system of nonlinear inequalities is an important problem for which
conventional numerical analysis has no satisfactory method. With a
box-consistency algorithm one can compute a cover for the solution set to
arbitrarily close approximation. Because of difficulties in the use of
propagation for complex arith... |
cs/0309019 | Building a Test Collection for Speech-Driven Web Retrieval | cs.CL | This paper describes a test collection (benchmark data) for retrieval systems
driven by spoken queries. This collection was produced in the subtask of the
NTCIR-3 Web retrieval task, which was performed in a TREC-style evaluation
workshop. The search topics and document collection for the Web retrieval task
were used... |
cs/0309021 | A Cross-media Retrieval System for Lecture Videos | cs.CL | We propose a cross-media lecture-on-demand system, in which users can
selectively view specific segments of lecture videos by submitting text
queries. Users can easily formulate queries by using the textbook associated
with a target lecture, even if they cannot come up with effective keywords. Our
system extracts the... |
cs/0309022 | Proposed Specification of a Distributed XML-Query Network | cs.DC cs.IR | W3C's XML-Query language offers a powerful instrument for information
retrieval on XML repositories. This article describes an implementation of this
retrieval in a real world's scenario. Distributed XML-Query processing reduces
load on every single attending node to an acceptable level. The network allows
every part... |
cs/0309025 | Evidential Force Aggregation | cs.AI | In this paper we develop an evidential force aggregation method intended for
classification of evidential intelligence into recognized force structures. We
assume that the intelligence has already been partitioned into clusters and use
the classification method individually in each cluster. The classification is
base... |
cs/0309030 | Model-Based Debugging using Multiple Abstract Models | cs.SE cs.AI | This paper introduces an automatic debugging framework that relies on
model-based reasoning techniques to locate faults in programs. In particular,
model-based diagnosis, together with an abstract interpretation based conflict
detection mechanism is used to derive diagnoses, which correspond to possible
faults in pro... |
cs/0309034 | Measuring Praise and Criticism: Inference of Semantic Orientation from
Association | cs.CL cs.IR cs.LG | The evaluative character of a word is called its semantic orientation.
Positive semantic orientation indicates praise (e.g., "honest", "intrepid") and
negative semantic orientation indicates criticism (e.g., "disturbing",
"superfluous"). Semantic orientation varies in both direction (positive or
negative) and degree ... |
cs/0309035 | Combining Independent Modules to Solve Multiple-choice Synonym and
Analogy Problems | cs.CL cs.IR cs.LG | Existing statistical approaches to natural language problems are very coarse
approximations to the true complexity of language processing. As such, no
single technique will be best for all problem instances. Many researchers are
examining ensemble methods that combine the output of successful, separately
developed mo... |
cs/0309036 | A Neural Network Assembly Memory Model Based on an Optimal Binary Signal
Detection Theory | cs.AI cs.IR cs.NE q-bio.NC q-bio.QM | A ternary/binary data coding algorithm and conditions under which Hopfield
networks implement optimal convolutional or Hamming decoding algorithms has
been described. Using the coding/decoding approach (an optimal Binary Signal
Detection Theory, BSDT) introduced a Neural Network Assembly Memory Model
(NNAMM) is built... |
cs/0309038 | A novel evolutionary formulation of the maximum independent set problem | cs.NE | We introduce a novel evolutionary formulation of the problem of finding a
maximum independent set of a graph. The new formulation is based on the
relationship that exists between a graph's independence number and its acyclic
orientations. It views such orientations as individuals and evolves them with
the aid of evol... |
cs/0309039 | Two novel evolutionary formulations of the graph coloring problem | cs.NE | We introduce two novel evolutionary formulations of the problem of coloring
the nodes of a graph. The first formulation is based on the relationship that
exists between a graph's chromatic number and its acyclic orientations. It
views such orientations as individuals and evolves them with the aid of
evolutionary oper... |
cs/0309041 | Fast Verification of Convexity of Piecewise-linear Surfaces | cs.CG cs.CV | We show that a realization of a closed connected PL-manifold of dimension n-1
in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron
(finite or infinite) if and only if the interior of each (n-3)-face has a
point, which has a neighborhood lying on the boundary of an n-dimensional
convex body. N... |
cs/0309048 | Goedel Machines: Self-Referential Universal Problem Solvers Making
Provably Optimal Self-Improvements | cs.LO cs.AI | We present the first class of mathematically rigorous, general, fully
self-referential, self-improving, optimally efficient problem solvers. Inspired
by Kurt Goedel's celebrated self-referential formulas (1931), such a problem
solver rewrites any part of its own code as soon as it has found a proof that
the rewrite i... |
cs/0309053 | A Hierarchical Situation Calculus | cs.AI cs.LO | A situation calculus is presented that provides a solution to the frame
problem for hierarchical situations, that is, situations that have a modular
structure in which parts of the situation behave in a relatively independent
manner. This situation calculus is given in a relational, functional, and modal
logic form. ... |
cs/0310005 | Using Artificial Intelligence for Model Selection | cs.AI q-bio.QM | We apply the optimization algorithm Adaptive Simulated Annealing (ASA) to the
problem of analyzing data on a large population and selecting the best model to
predict that an individual with various traits will have a particular disease.
We compare ASA with traditional forward and backward regression on computer
simul... |
cs/0310006 | The Lowell Database Research Self Assessment | cs.DB | A group of senior database researchers gathers every few years to assess the
state of database research and to point out problem areas that deserve
additional focus. This report summarizes the discussion and conclusions of the
sixth ad-hoc meeting held May 4-6, 2003 in Lowell, Mass. It observes that
information manag... |
cs/0310009 | On Interference of Signals and Generalization in Feedforward Neural
Networks | cs.NE | This paper studies how the generalization ability of neurons can be affected
by mutual processing of different signals. This study is done on the basis of a
feedforward artificial neural network. The mutual processing of signals can
possibly be a good model of patterns in a set generalized by a neural network
and in ... |
cs/0310010 | Transient Diversity in Multi-Agent Systems | cs.AI cs.MA | Diversity is an important aspect of highly efficient multi-agent teams. We
introduce the main factors that drive a multi-agent system in either direction
along the diversity scale. A metric for diversity is described, and we
speculate on the concept of transient diversity. Finally, an experiment on
social entropy usi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.