id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0405050 | Traffic Accident Analysis Using Decision Trees and Neural Networks | cs.AI | The costs of fatalities and injuries due to traffic accident have a great
impact on society. This paper presents our research to model the severity of
injury resulting from traffic accidents using artificial neural networks and
decision trees. We have applied them to an actual data set obtained from the
National Auto... |
cs/0405051 | Short Term Load Forecasting Models in Czech Republic Using Soft
Computing Paradigms | cs.AI | This paper presents a comparative study of six soft computing models namely
multilayer perceptron networks, Elman recurrent neural network, radial basis
function network, Hopfield model, fuzzy inference system and hybrid fuzzy
neural network for the hourly electricity demand forecast of Czech Republic.
The soft compu... |
cs/0405052 | Decision Support Systems Using Intelligent Paradigms | 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 (SC)
technologies that underlie the conception, design and utilization of
intelligent sy... |
cs/0405054 | The model of the tables in design documentation for operating with the
electronic catalogs and for specifications making in a CAD system | cs.CE cs.DS | The hierarchic block model of the tables in design documentation as a part of
a CAD system is described, intended for automatic specifications making of
elements of the drawings, with usage of the electronic catalogs. The model is
created for needs of a CAD system of reconstruction of the industrial plants,
where the... |
cs/0405055 | Modular technology of developing of the extensions of a CAD system.
Axonometric piping diagrams. Parametric representation | cs.CE cs.DS | Applying the modular technology of developing of the problem-oriented
extensions of a CAD system to a problem of automation of creating of the
axonometric piping diagrams on an example of the program system TechnoCAD
GlassX is described. The proximity of composition of the schemas is detected
for special technologica... |
cs/0405056 | Modular technology of developing of the extensions of a CAD system. The
axonometric piping diagrams. Common and special operations | cs.CE cs.DS | Applying the modular technology of developing of the problem-oriented
extensions of a CAD system to a problem of automation of creating of the
axonometric piping diagrams on an example of the program system TechnoCAD
GlassX is described. The features of realization of common operations,
composition and realization of... |
cs/0405057 | Mathematical and programming toolkit of the computer aided design of the
axonometric piping diagrams | cs.CE cs.DS | The problem of the automation of the designing of the axonometric piping
diagrams include, as the minimum, manipulations with the flat schemas of
three-dimensional wireframe objects (with dimension of 2,5). The specialized
model, methodical and mathematical approaches are required because of large
bulk of calculuss. ... |
cs/0405062 | Efficiency Enhancement of Probabilistic Model Building Genetic
Algorithms | cs.NE | This paper presents two different efficiency-enhancement techniques for
probabilistic model building genetic algorithms. The first technique proposes
the use of a mutation operator which performs local search in the sub-solution
neighborhood identified through the probabilistic model. The second technique
proposes bu... |
cs/0405063 | Let's Get Ready to Rumble: Crossover Versus Mutation Head to Head | cs.NE | This paper analyzes the relative advantages between crossover and mutation on
a class of deterministic and stochastic additively separable problems. This
study assumes that the recombination and mutation operators have the knowledge
of the building blocks (BBs) and effectively exchange or search among competing
BBs. ... |
cs/0405064 | Designing Competent Mutation Operators via Probabilistic Model Building
of Neighborhoods | cs.NE | This paper presents a competent selectomutative genetic algorithm (GA), that
adapts linkage and solves hard problems quickly, reliably, and accurately. A
probabilistic model building process is used to automatically identify key
building blocks (BBs) of the search problem. The mutation operator uses the
probabilistic... |
cs/0405065 | Efficiency Enhancement of Genetic Algorithms via Building-Block-Wise
Fitness Estimation | cs.NE | This paper studies fitness inheritance as an efficiency enhancement technique
for a class of competent genetic algorithms called estimation distribution
algorithms. Probabilistic models of important sub-solutions are developed to
estimate the fitness of a proportion of individuals in the population, thereby
avoiding ... |
cs/0405069 | Mining Frequent Itemsets from Secondary Memory | cs.DB cs.IR | Mining frequent itemsets is at the core of mining association rules, and is
by now quite well understood algorithmically. However, most algorithms for
mining frequent itemsets assume that the main memory is large enough for the
data structures used in the mining, and very few efficient algorithms deal with
the case w... |
cs/0405071 | Regression with respect to sensing actions and partial states | cs.AI | In this paper, we present a state-based regression function for planning
domains where an agent does not have complete information and may have sensing
actions. We consider binary domains and employ the 0-approximation [Son & Baral
2001] to define the regression function. In binary domains, the use of
0-approximation... |
cs/0405072 | Grid Databases for Shared Image Analysis in the MammoGrid Project | cs.DB cs.DC | The MammoGrid project aims to prove that Grid infrastructures can be used for
collaborative clinical analysis of database-resident but geographically
distributed medical images. This requires: a) the provision of a
clinician-facing front-end workstation and b) the ability to service real-world
clinician queries acros... |
cs/0405074 | MammoGrid: A Service Oriented Architecture based Medical Grid
Application | cs.DC cs.DB | The MammoGrid project has recently delivered its first proof-of-concept
prototype using a Service-Oriented Architecture (SOA)-based Grid application to
enable distributed computing spanning national borders. The underlying AliEn
Grid infrastructure has been selected because of its practicality and because
of its emer... |
cs/0405076 | An Abductive Framework For Computing Knowledge Base Updates | cs.DB | This paper introduces an abductive framework for updating knowledge bases
represented by extended disjunctive programs. We first provide a simple
transformation from abductive programs to update programs which are logic
programs specifying changes on abductive hypotheses. Then, extended abduction,
which was introduce... |
cs/0405087 | A Grid Information Infrastructure for Medical Image Analysis | cs.DB cs.DC | The storage and manipulation of digital images and the analysis of the
information held in those images are essential requirements for next-generation
medical information systems. The medical community has been exploring
collaborative approaches for managing image data and exchanging knowledge and
Grid technology [1]... |
cs/0405090 | Propositional Defeasible Logic has Linear Complexity | cs.AI | Defeasible logic is a rule-based nonmonotonic logic, with both strict and
defeasible rules, and a priority relation on rules. We show that inference in
the propositional form of the logic can be performed in linear time. This
contrasts markedly with most other propositional nonmonotonic logics, in which
inference is ... |
cs/0405093 | Computerized Face Detection and Recognition | cs.CV | This publication presents methods for face detection, analysis and
recognition: fast normalized cross-correlation (fast correlation coefficient)
between multiple templates based face pre-detection method, method for
detection of exact face contour based on snakes and Generalized Gradient Vector
Flow field, method for... |
cs/0405095 | Blind Detection and Compensation of Camera Lens Geometric Distortions | cs.CV | This paper presents a blind detection and compensation technique for camera
lens geometric distortions. The lens distortion introduces higher-order
correlations in the frequency domain and in turn it can be detected using
higher-order spectral analysis tools without assuming any specific calibration
target. The exist... |
cs/0405098 | A Logic for Reasoning about Evidence | cs.AI cs.LO | We introduce a logic for reasoning about evidence that essentially views
evidence as a function from prior beliefs (before making an observation) to
posterior beliefs (after making the observation). We provide a sound and
complete axiomatization for the logic, and consider the complexity of the
decision problem. Alth... |
cs/0405099 | Web search engine based on DNS | cs.NI cs.IR | Now no web search engine can cover more than 60 percent of all the pages on
Internet. The update interval of most pages database is almost one month. This
condition hasn't changed for many years. Converge and recency problems have
become the bottleneck problem of current web search engine. To solve these
problems, a ... |
cs/0405104 | Knowledge Reduction and Discovery based on Demarcation Information | cs.LG cs.DB cs.IT math.IT | Knowledge reduction, includes attribute reduction and value reduction, is an
important topic in rough set literature. It is also closely relevant to other
fields, such as machine learning and data mining. In this paper, an algorithm
called TWI-SQUEEZE is proposed. It can find a reduct, or an irreducible
attribute sub... |
cs/0405106 | Pruning Search Space in Defeasible Argumentation | cs.AI | Defeasible argumentation has experienced a considerable growth in AI in the
last decade. Theoretical results have been combined with development of
practical applications in AI & Law, Case-Based Reasoning and various
knowledge-based systems. However, the dialectical process associated with
inference is computationall... |
cs/0405107 | A Framework for Combining Defeasible Argumentation with Labeled
Deduction | cs.AI cs.SC | In the last years, there has been an increasing demand of a variety of
logical systems, prompted mostly by applications of logic in AI and other
related areas. Labeled Deductive Systems (LDS) were developed as a flexible
methodology to formalize such a kind of complex logical systems. Defeasible
argumentation has pro... |
cs/0405113 | A proposal to design expert system for the calculations in the domain of
QFT | cs.AI | Main purposes of the paper are followings: 1) To show examples of the
calculations in domain of QFT via ``derivative rules'' of an expert system; 2)
To consider advantages and disadvantage that technology of the calculations; 3)
To reflect about how one would develop new physical theories, what knowledge
would be use... |
cs/0406001 | Side-Information Coding with Turbo Codes and its Application to Quantum
Key Distribution | cs.IT cs.CR math.IT quant-ph | Turbo coding is a powerful class of forward error correcting codes, which can
achieve performances close to the Shannon limit. The turbo principle can be
applied to the problem of side-information source coding, and we investigate
here its application to the reconciliation problem occurring in a
continuous-variable q... |
cs/0406003 | Algorithms for weighted multi-tape automata | cs.CL cs.DS | This report defines various operations for weighted multi-tape automata
(WMTAs) and describes algorithms that have been implemented for those
operations in the WFSC toolkit. Some algorithms are new, others are known or
similar to known algorithms. The latter will be recalled to make this report
more complete and self... |
cs/0406004 | Application of Business Intelligence In Banks (Pakistan) | cs.DB | The financial services industry is rapidly changing. Factors such as
globalization, deregulation, mergers and acquisitions, competition from
non-financial institutions, and technological innovation, have forced companies
to re-think their business.Many large companies have been using Business
Intelligence (BI) comput... |
cs/0406007 | Parallel Mixed Bayesian Optimization Algorithm: A Scaleup Analysis | cs.NE cs.DC | Estimation of Distribution Algorithms have been proposed as a new paradigm
for evolutionary optimization. This paper focuses on the parallelization of
Estimation of Distribution Algorithms. More specifically, the paper discusses
how to predict performance of parallel Mixed Bayesian Optimization Algorithm
(MBOA) that ... |
cs/0406008 | Image compression by rectangular wavelet transform | cs.CV | We study image compression by a separable wavelet basis
$\big\{\psi(2^{k_1}x-i)\psi(2^{k_2}y-j),$ $\phi(x-i)\psi(2^{k_2}y-j),$
$\psi(2^{k_1}(x-i)\phi(y-j),$ $\phi(x-i)\phi(y-i)\big\},$ where $k_1, k_2 \in
\mathbb{Z}_+$; $i,j\in\mathbb{Z}$; and $\phi,\psi$ are elements of a standard
biorthogonal wavelet basis in $L_2(... |
cs/0406011 | Blind Construction of Optimal Nonlinear Recursive Predictors for
Discrete Sequences | cs.LG math.ST nlin.CD physics.data-an stat.TH | We present a new method for nonlinear prediction of discrete random sequences
under minimal structural assumptions. We give a mathematical construction for
optimal predictors of such processes, in the form of hidden Markov models. We
then describe an algorithm, CSSR (Causal-State Splitting Reconstruction), which
appr... |
cs/0406015 | Zipf's law and the creation of musical context | cs.CL cond-mat.stat-mech | This article discusses the extension of the notion of context from
linguistics to the domain of music. In language, the statistical regularity
known as Zipf's law -which concerns the frequency of usage of different words-
has been quantitatively related to the process of text generation. This
connection is establishe... |
cs/0406016 | Schema-based Scheduling of Event Processors and Buffer Minimization for
Queries on Structured Data Streams | cs.DB | We introduce an extension of the XQuery language, FluX, that supports
event-based query processing and the conscious handling of main memory buffers.
Purely event-based queries of this language can be executed on streaming XML
data in a very direct way. We then develop an algorithm that allows to
efficiently rewrite ... |
cs/0406017 | Using Self-Organising Mappings to Learn the Structure of Data Manifolds | cs.NE cs.CV | In this paper it is shown how to map a data manifold into a simpler form by
progressively discarding small degrees of freedom. This is the key to
self-organising data fusion, where the raw data is embedded in a very
high-dimensional space (e.g. the pixel values of one or more images), and the
requirement is to isolat... |
cs/0406021 | A direct formulation for sparse PCA using semidefinite programming | cs.CE | We examine the problem of approximating, in the Frobenius-norm sense, a
positive, semidefinite symmetric matrix by a rank-one matrix, with an upper
bound on the cardinality of its eigenvector. The problem arises in the
decomposition of a covariance matrix into sparse factors, and has wide
applications ranging from bi... |
cs/0406025 | Directional Consistency for Continuous Numerical Constraints | cs.AI cs.MS | Bounds consistency is usually enforced on continuous constraints by first
decomposing them into binary and ternary primitives. This decomposition has
long been shown to drastically slow down the computation of solutions. To
tackle this, Benhamou et al. have introduced an algorithm that avoids formally
decomposing con... |
cs/0406029 | Subset Queries in Relational Databases | cs.DB | In this paper, we motivated the need for relational database systems to
support subset query processing. We defined new operators in relational
algebra, and new constructs in SQL for expressing subset queries. We also
illustrated the applicability of subset queries through different examples
expressed using extended ... |
cs/0406031 | A Public Reference Implementation of the RAP Anaphora Resolution
Algorithm | cs.CL | This paper describes a standalone, publicly-available implementation of the
Resolution of Anaphora Procedure (RAP) given by Lappin and Leass (1994). The
RAP algorithm resolves third person pronouns, lexical anaphors, and identifies
pleonastic pronouns. Our implementation, JavaRAP, fills a current need in
anaphora res... |
cs/0406032 | A Dynamic Clustering-Based Markov Model for Web Usage Mining | cs.IR cs.AI | Markov models have been widely utilized for modelling user web navigation
behaviour. In this work we propose a dynamic clustering-based method to
increase a Markov model's accuracy in representing a collection of user web
navigation sessions. The method makes use of the state cloning concept to
duplicate states in a ... |
cs/0406038 | A New Approach to Draw Detection by Move Repetition in Computer Chess
Programming | cs.AI | We will try to tackle both the theoretical and practical aspects of a very
important problem in chess programming as stated in the title of this article -
the issue of draw detection by move repetition. The standard approach that has
so far been employed in most chess programs is based on utilising positional
matrice... |
cs/0406039 | Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any
Fixed Distance | cs.IT math.IT | Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance
d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n
grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are
designed that improve on the BCH codes and have the lowest asymptotic
redundancy \... |
cs/0406042 | Business Process Measures | cs.CE cs.PF | The paper proposes a new methodology for defining business process measures
and their computation. The approach is based on metamodeling according to MOF.
Especially, a metamodel providing precise definitions of typical process
measures for UML activity diagram-like notation is proposed, including precise
definitions... |
cs/0406043 | The Computational Complexity of Orientation Search Problems in
Cryo-Electron Microscopy | cs.DS cs.CG cs.CV | In this report we study the problem of determining three-dimensional
orientations for noisy projections of randomly oriented identical particles.
The problem is of central importance in the tomographic reconstruction of the
density map of macromolecular complexes from electron microscope images and it
has been studie... |
cs/0406047 | Self-organizing neural networks in classification and image recognition | cs.CV cs.AI | Self-organizing neural networks are used for brick finding in OPERA
experiment. Self-organizing neural networks and wavelet analysis used for
recognition and extraction of car numbers from images.
|
cs/0406048 | On Expanders Graphs: Parameters and Applications | cs.IT math.IT | We give a new lower bound on the expansion coefficient of an edge-vertex
graph of a $d$-regular graph. As a consequence, we obtain an improvement on the
lower bound on relative minimum distance of the expander codes constructed by
Sipser and Spielman. We also derive some improved results on the vertex
expansion of gr... |
cs/0406050 | Finite-Length Scaling for Iteratively Decoded LDPC Ensembles | cs.IT cond-mat.dis-nn cs.DM math.IT | In this paper we investigate the behavior of iteratively decoded low-density
parity-check codes over the binary erasure channel in the so-called ``waterfall
region." We show that the performance curves in this region follow a very basic
scaling law. We conjecture that essentially the same scaling behavior applies
in ... |
cs/0406054 | Building a linguistic corpus from bee dance data | cs.CL | This paper discusses the problems and possibility of collecting bee dance
data in a linguistic \textit{corpus} and use linguistic instruments such as
Zipf's law and entropy statistics to decide on the question whether the dance
carries information of any kind. We describe this against the historical
background of att... |
cs/0406055 | Web Services: A Process Algebra Approach | cs.AI cs.DB | It is now well-admitted that formal methods are helpful for many issues
raised in the Web service area. In this paper we present a framework for the
design and verification of WSs using process algebras and their tools. We
define a two-way mapping between abstract specifications written using these
calculi and execut... |
cs/0406056 | P=NP | cs.CC cs.AI | We claim to resolve the P=?NP problem via a formal argument for P=NP.
|
cs/0406058 | Proofs of Zero Knowledge | cs.CR cs.DB | We present a protocol for verification of ``no such entry'' replies from
databases. We introduce a new cryptographic primitive as the underlying
structure, the keyed hash tree, which is an extension of Merkle's hash tree. We
compare our scheme to Buldas et al.'s Undeniable Attesters and Micali et al.'s
Zero Knowledge... |
cs/0406060 | Well-Definedness and Semantic Type-Checking in the Nested Relational
Calculus and XQuery | cs.DB cs.PL | Two natural decision problems regarding the XML query language XQuery are
well-definedness and semantic type-checking. We study these problems in the
setting of a relational fragment of XQuery. We show that well-definedness and
semantic type-checking are undecidable, even in the positive-existential case.
Nevertheles... |
cs/0407002 | Annotating Predicate-Argument Structure for a Parallel Treebank | cs.CL | We report on a recently initiated project which aims at building a
multi-layered parallel treebank of English and German. Particular attention is
devoted to a dedicated predicate-argument layer which is used for aligning
translationally equivalent sentences of the two languages. We describe both our
conceptual decisi... |
cs/0407004 | Zero-error communication over networks | cs.IT cs.CR math.IT | Zero-Error communication investigates communication without any error. By
defining channels without probabilities, results from Elias can be used to
completely characterize which channel can simulate which other channels. We
introduce the ambiguity of a channel, which completely characterizes the
possibility in princ... |
cs/0407005 | Statistical Machine Translation by Generalized Parsing | cs.CL | Designers of statistical machine translation (SMT) systems have begun to
employ tree-structured translation models. Systems involving tree-structured
translation models tend to be complex. This article aims to reduce the
conceptual complexity of such systems, in order to make them easier to design,
implement, debug, ... |
cs/0407007 | The semijoin algebra and the guarded fragment | 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 discuss some
interesting connections between the semijoin algebra and the guarded fragment
of first-order logic. We also provide an Ehrenfeucht-Fraisse game,
characterizing the discerning... |
cs/0407008 | Autogenic Training With Natural Language Processing Modules: A Recent
Tool For Certain Neuro Cognitive Studies | cs.AI | Learning to respond to voice-text input involves the subject's ability in
understanding the phonetic and text based contents and his/her ability to
communicate based on his/her experience. The neuro-cognitive facility of the
subject has to support two important domains in order to make the learning
process complete. ... |
cs/0407009 | Search Using N-gram Technique Based Statistical Analysis for Knowledge
Extraction in Case Based Reasoning Systems | cs.AI cs.IR | Searching techniques for Case Based Reasoning systems involve extensive
methods of elimination. In this paper, we look at a new method of arriving at
the right solution by performing a series of transformations upon the data.
These involve N-gram based comparison and deduction of the input data with the
case data, us... |
cs/0407010 | Improved error bounds for the erasure/list scheme: the binary and
spherical cases | cs.IT math.IT | We derive improved bounds on the error and erasure rate for spherical codes
and for binary linear codes under Forney's erasure/list decoding scheme and
prove some related results.
|
cs/0407011 | Distance distribution of binary codes and the error probability of
decoding | cs.IT math.IT | We address the problem of bounding below the probability of error under
maximum likelihood decoding of a binary code with a known distance distribution
used on a binary symmetric channel. An improved upper bound is given for the
maximum attainable exponent of this probability (the reliability function of
the channel)... |
cs/0407016 | Learning for Adaptive Real-time Search | cs.AI cs.LG | Real-time heuristic search is a popular model of acting and learning in
intelligent autonomous agents. Learning real-time search agents improve their
performance over time by acquiring and refining a value function guiding the
application of their actions. As computing the perfect value function is
typically intracta... |
cs/0407021 | Multi-agent coordination using nearest neighbor rules: revisiting the
Vicsek model | cs.MA cs.AI | Recently, Jadbabaie, Lin, and Morse (IEEE TAC, 48(6)2003:988-1001) offered a
mathematical analysis of the discrete time model of groups of mobile autonomous
agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. showed
that all agents shall move in the same heading, provided that these agents are
pe... |
cs/0407024 | An agent-based intelligent environmental monitoring system | cs.MA cs.CE | Fairly rapid environmental changes call for continuous surveillance and
on-line decision making. There are two main areas where IT technologies can be
valuable. In this paper we present a multi-agent system for monitoring and
assessing air-quality attributes, which uses data coming from a meteorological
station. A co... |
cs/0407025 | An agent framework for dynamic agent retraining: Agent academy | cs.MA | Agent Academy (AA) aims to develop a multi-agent society that can train new
agents for specific or general tasks, while constantly retraining existing
agents in a recursive mode. The system is based on collecting information both
from the environment and the behaviors of the acting agents and their related
successes/... |
cs/0407026 | Summarizing Encyclopedic Term Descriptions on the Web | cs.CL | We are developing an automatic method to compile an encyclopedic corpus from
the Web. In our previous work, paragraph-style descriptions for a term are
extracted from Web pages and organized based on domains. However, these
descriptions are independent and do not comprise a condensed text as in
hand-crafted encyclope... |
cs/0407027 | Unsupervised Topic Adaptation for Lecture Speech Retrieval | cs.CL | We are developing a cross-media information retrieval system, in which users
can view specific segments of lecture videos by submitting text queries. To
produce a text index, the audio track is extracted from a lecture video and a
transcription is generated by automatic speech recognition. In this paper, to
improve t... |
cs/0407028 | Effects of Language Modeling on Speech-driven Question Answering | cs.CL | We integrate automatic speech recognition (ASR) and question answering (QA)
to realize a speech-driven QA system, and evaluate its performance. We adapt an
N-gram language model to natural language questions, so that the input of our
system can be recognized with a high accuracy. We target WH-questions which
consist ... |
cs/0407029 | Static versus Dynamic Arbitrage Bounds on Multivariate Option Prices | cs.CE | We compare static arbitrage price bounds on basket calls, i.e. bounds that
only involve buy-and-hold trading strategies, with the price range obtained
within a multi-variate generalization of the Black-Scholes model. While there
is no gap between these two sets of prices in the univariate case, we observe
here that c... |
cs/0407034 | On the Complexity of Case-Based Planning | cs.AI cs.CC | We analyze the computational complexity of problems related to case-based
planning: planning when a plan for a similar instance is known, and planning
from a library of plans. We prove that planning from a single case has the same
complexity than generative planning (i.e., planning "from scratch"); using an
extended ... |
cs/0407035 | A Framework for High-Accuracy Privacy-Preserving Mining | cs.DB cs.IR | To preserve client privacy in the data mining process, a variety of
techniques based on random perturbation of data records have been proposed
recently. In this paper, we present a generalized matrix-theoretic model of
random perturbation, which facilitates a systematic approach to the design of
perturbation mechanis... |
cs/0407037 | Generalized Evolutionary Algorithm based on Tsallis Statistics | cs.AI | Generalized evolutionary algorithm based on Tsallis canonical distribution is
proposed. The algorithm uses Tsallis generalized canonical distribution to
weigh the configurations for `selection' instead of Gibbs-Boltzmann
distribution. Our simulation results show that for an appropriate choice of
non-extensive index t... |
cs/0407039 | On the Convergence Speed of MDL Predictions for Bernoulli Sequences | cs.LG cs.AI cs.IT math.IT math.PR | We consider the Minimum Description Length principle for online sequence
prediction. If the underlying model class is discrete, then the total expected
square loss is a particularly interesting performance measure: (a) this
quantity is bounded, implying convergence with probability one, and (b) it
additionally specif... |
cs/0407040 | Decomposition Based Search - A theoretical and experimental evaluation | cs.AI | In this paper we present and evaluate a search strategy called Decomposition
Based Search (DBS) which is based on two steps: subproblem generation and
subproblem solution. The generation of subproblems is done through value
ranking and domain splitting. Subdomains are explored so as to generate,
according to the heur... |
cs/0407042 | Postponing Branching Decisions | cs.AI | Solution techniques for Constraint Satisfaction and Optimisation Problems
often make use of backtrack search methods, exploiting variable and value
ordering heuristics. In this paper, we propose and analyse a very simple method
to apply in case the value ordering heuristic produces ties: postponing the
branching deci... |
cs/0407044 | Reduced cost-based ranking for generating promising subproblems | cs.AI | In this paper, we propose an effective search procedure that interleaves two
steps: subproblem generation and subproblem solution. We mainly focus on the
first part. It consists of a variable domain value ranking based on reduced
costs. Exploiting the ranking, we generate, in a Limited Discrepancy Search
tree, the mo... |
cs/0407046 | A Bimachine Compiler for Ranked Tagging Rules | cs.CL | This paper describes a novel method of compiling ranked tagging rules into a
deterministic finite-state device called a bimachine. The rules are formulated
in the framework of regular rewrite operations and allow unrestricted regular
expressions in both left and right rule contexts. The compiler is illustrated
by an ... |
cs/0407047 | Channel-Independent and Sensor-Independent Stimulus Representations | cs.CV cs.AI | This paper shows how a machine, which observes stimuli through an
uncharacterized, uncalibrated channel and sensor, can glean machine-independent
information (i.e., channel- and sensor-independent information) about the
stimuli. First, we demonstrate that a machine defines a specific coordinate
system on the stimulus... |
cs/0407049 | Preferred Answer Sets for Ordered Logic Programs | cs.LO cs.AI | We extend answer set semantics to deal with inconsistent programs (containing
classical negation), by finding a ``best'' answer set. Within the context of
inconsistent programs, it is natural to have a partial order on rules,
representing a preference for satisfying certain rules, possibly at the cost of
violating le... |
cs/0407053 | Design of a Parallel and Distributed Web Search Engine | cs.IR cs.DC | This paper describes the architecture of MOSE (My Own Search Engine), a
scalable parallel and distributed engine for searching the web. MOSE was
specifically designed to efficiently exploit affordable parallel architectures,
such as clusters of workstations. Its modular and scalable architecture can
easily be tuned t... |
cs/0407054 | From truth to computability I | cs.LO cs.AI cs.GT math.LO | The recently initiated approach called computability logic is a formal theory
of interactive computation. See a comprehensive online source on the subject at
http://www.cis.upenn.edu/~giorgi/cl.html . The present paper contains a
soundness and completeness proof for the deductive system CL3 which axiomatizes
the most... |
cs/0407057 | Universal Convergence of Semimeasures on Individual Random Sequences | cs.LG cs.AI cs.CC cs.IT math.IT math.PR | Solomonoff's central result on induction is that the posterior of a universal
semimeasure M converges rapidly and with probability 1 to the true sequence
generating posterior mu, if the latter is computable. Hence, M is eligible as a
universal sequence predictor in case of unknown mu. Despite some nearby results
and ... |
cs/0407060 | Tight bounds for LDPC and LDGM codes under MAP decoding | cs.IT cond-mat.dis-nn math.IT | A new method for analyzing low density parity check (LDPC) codes and low
density generator matrix (LDGM) codes under bit maximum a posteriori
probability (MAP) decoding is introduced. The method is based on a rigorous
approach to spin glasses developed by Francesco Guerra. It allows to construct
lower bounds on the e... |
cs/0407061 | A measure of similarity between graph vertices | cs.IR cond-mat.dis-nn cs.DM physics.data-an | We introduce a concept of similarity between vertices of directed graphs. Let
G_A and G_B be two directed graphs. We define a similarity matrix whose (i,
j)-th real entry expresses how similar vertex j (in G_A) is to vertex i (in
G_B. The similarity matrix can be obtained as the limit of the normalized even
iterates ... |
cs/0407064 | A Sequent Calculus and a Theorem Prover for Standard Conditional Logics | cs.LO cs.AI | In this paper we present a cut-free sequent calculus, called SeqS, for some
standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus
uses labels and transition formulas and can be used to prove decidability and
space complexity bounds for the respective logics. We also present CondLean, a
theor... |
cs/0407065 | Word Sense Disambiguation by Web Mining for Word Co-occurrence
Probabilities | cs.CL cs.IR cs.LG | This paper describes the National Research Council (NRC) Word Sense
Disambiguation (WSD) system, as applied to the English Lexical Sample (ELS)
task in Senseval-3. The NRC system approaches WSD as a classical supervised
machine learning problem, using familiar tools such as the Weka machine
learning software and Bril... |
cs/0408001 | Semantic Linking - a Context-Based Approach to Interactivity in
Hypermedia | cs.IR cs.LG | The semantic Web initiates new, high level access schemes to online content
and applications. One area of superior need for a redefined content exploration
is given by on-line educational applications and their concepts of
interactivity in the framework of open hypermedia systems. In the present paper
we discuss aspe... |
cs/0408004 | Hypermedia Learning Objects System - On the Way to a Semantic
Educational Web | cs.IR cs.LG | While eLearning systems become more and more popular in daily education,
available applications lack opportunities to structure, annotate and manage
their contents in a high-level fashion. General efforts to improve these
deficits are taken by initiatives to define rich meta data sets and a
semanticWeb layer. In the ... |
cs/0408005 | Educational Content Management - A Cellular Approach | cs.CY cs.IR | In recent times online educational applications more and more are requested
to provide self-consistent learning offers for students at the university
level. Consequently they need to cope with the wide range of complexity and
interrelations university course teaching brings along. An urgent need to
overcome simplisti... |
cs/0408006 | Why Two Sexes? | cs.NE cs.GL q-bio.PE | Evolutionary role of the separation into two sexes from a cyberneticist's
point of view. [I translated this 1965 article from Russian "Nauka i Zhizn"
(Science and Life) in 1988. In a popular form, the article puts forward several
useful ideas not all of which even today are necessarily well known or widely
accepted. ... |
cs/0408007 | Online convex optimization in the bandit setting: gradient descent
without a gradient | cs.LG cs.CC | We consider a the general online convex optimization framework introduced by
Zinkevich. In this setting, there is a sequence of convex functions. Each
period, we must choose a signle point (from some feasible set) and pay a cost
equal to the value of the next function on our chosen point. Zinkevich shows
that, if the... |
cs/0408008 | Iterative Quantization Using Codes On Graphs | cs.IT math.IT | We study codes on graphs combined with an iterative message passing algorithm
for quantization. Specifically, we consider the binary erasure quantization
(BEQ) problem which is the dual of the binary erasure channel (BEC) coding
problem. We show that duals of capacity achieving codes for the BEC yield codes
which app... |
cs/0408010 | A Simple Proportional Conflict Redistribution Rule | cs.AI | One proposes a first alternative rule of combination to WAO (Weighted Average
Operator) proposed recently by Josang, Daniel and Vannoorenberghe, called
Proportional Conflict Redistribution rule (denoted PCR1). PCR1 and WAO are
particular cases of WO (the Weighted Operator) because the conflicting mass is
redistribute... |
cs/0408011 | The asymptotic number of binary codes and binary matroids | cs.IT cs.DM math.IT | The asyptotic number of nonequivalent binary n-codes is determined. This is
also the asymptotic number of nonisomorphic binary n-matroids. The connection
to a result of Lefmann, Roedl, Phelps is explored. The latter states that
almost all binary n-codes have a trivial automorphism group.
|
cs/0408012 | Three-Dimensional Face Orientation and Gaze Detection from a Single
Image | cs.CV cs.HC | Gaze detection and head orientation are an important part of many advanced
human-machine interaction applications. Many systems have been proposed for
gaze detection. Typically, they require some form of user cooperation and
calibration. Additionally, they may require multiple cameras and/or restricted
head positions... |
cs/0408017 | Improved Upper Bound for the Redundancy of Fix-Free Codes | cs.IT math.IT | A variable-length code is a fix-free code if no codeword is a prefix or a
suffix of any other codeword. In a fix-free code any finite sequence of
codewords can be decoded in both directions, which can improve the robustness
to channel noise and speed up the decoding process. In this paper we prove a
new sufficient co... |
cs/0408021 | An Algorithm for Quasi-Associative and Quasi-Markovian Rules of
Combination in Information Fusion | cs.AI | In this paper one proposes a simple algorithm of combining the fusion rules,
those rules which first use the conjunctive rule and then the transfer of
conflicting mass to the non-empty sets, in such a way that they gain the
property of associativity and fulfill the Markovian requirement for dynamic
fusion. Also, a ne... |
cs/0408023 | On Global Warming (Softening Global Constraints) | cs.AI cs.PL | We describe soft versions of the global cardinality constraint and the
regular constraint, with efficient filtering algorithms maintaining domain
consistency. For both constraints, the softening is achieved by augmenting the
underlying graph. The softened constraints can be used to extend the
meta-constraint framewor... |
cs/0408026 | Incremental Construction of Minimal Acyclic Sequential Transducers from
Unsorted Data | cs.CL cs.DS | This paper presents an efficient algorithm for the incremental construction
of a minimal acyclic sequential transducer (ST) for a dictionary consisting of
a list of input and output strings. The algorithm generalises a known method of
constructing minimal finite-state automata (Daciuk et al. 2000). Unlike the
algorit... |
cs/0408027 | CHR Grammars | cs.CL cs.PL | A grammar formalism based upon CHR is proposed analogously to the way
Definite Clause Grammars are defined and implemented on top of Prolog. These
grammars execute as robust bottom-up parsers with an inherent treatment of
ambiguity and a high flexibility to model various linguistic phenomena. The
formalism extends pr... |
cs/0408030 | The Revolution In Database System Architecture | cs.DB | Database system architectures are undergoing revolutionary changes.
Algorithms and data are being unified by integrating programming languages with
the database system. This gives an extensible object-relational system where
non-procedural relational operators manipulate object sets. Coupled with this,
each DBMS is n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.