id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0609076 | Asymptotic Spectral Distribution of Crosscorrelation Matrix in
Asynchronous CDMA | cs.IT math.IT | Asymptotic spectral distribution (ASD) of the crosscorrelation matrix is
investigated for a random spreading short/long-code asynchronous direct
sequence-code division multiple access (DS-CDMA) system. The discrete-time
decision statistics are obtained as the output samples of a bank of symbol
matched filters of all ... |
cs/0609079 | Modern Statistics by Kriging | cs.NA cs.CE | We present statistics (S-statistics) based only on random variable (not
random value) with a mean squared error of mean estimation as a concept of
error.
|
cs/0609081 | Recurrence relations and fast algorithms | cs.CE cs.NA | We construct fast algorithms for evaluating transforms associated with
families of functions which satisfy recurrence relations. These include
algorithms both for computing the coefficients in linear combinations of the
functions, given the values of these linear combinations at certain points,
and, vice versa, for e... |
cs/0609087 | A comparative analysis of the geometrical surface texture of a real and
virtual model of a tooth flank of a cylindrical gear | cs.CE | The paper presents the methodology of modelling tooth flanks of cylindrical
gears in the Cad environment. The modelling consists in a computer simulation
of gear generation. A model of tooth flanks is an envelope curve of a family of
envelopes that originate from the rolling motion of a solid tool model in
relation t... |
cs/0609088 | Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization | cs.IT math.IT | The normalized min-sum algorithm can achieve near-optimal performance at
decoding LDPC codes. However, it is a critical question to understand the
mathematical principle underlying the algorithm. Traditionally, people thought
that the normalized min-sum algorithm is a good approximation to the
sum-product algorithm, ... |
cs/0609089 | Fast Min-Sum Algorithms for Decoding of LDPC over GF(q) | cs.IT math.IT | In this paper, we present a fast min-sum algorithm for decoding LDPC codes
over GF(q). Our algorithm is different from the one presented by David Declercq
and Marc Fossorier in ISIT 05 only at the way of speeding up the horizontal
scan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds up
the com... |
cs/0609090 | Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes | cs.IT math.IT | Many implementations for decoding LDPC codes are based on the
(normalized/offset) min-sum algorithm due to its satisfactory performance and
simplicity in operations. Usually, each iteration of the min-sum algorithm
contains two scans, the horizontal scan and the vertical scan. This paper
presents a single-scan versio... |
cs/0609093 | PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation
Assumption | cs.LG | We propose and analyze a new vantage point for the learning of mixtures of
Gaussians: namely, the PAC-style model of learning probability distributions
introduced by Kearns et al. Here the task is to construct a hypothesis mixture
of Gaussians that is statistically indistinguishable from the actual mixture
generating... |
cs/0609094 | An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate
Block Lengths and Applications | cs.IT math.IT | This paper derives an improved sphere-packing (ISP) bound targeting codes of
short to moderate block lengths. We first review the 1967 sphere-packing (SP67)
bound for discrete memoryless channels, and a recent improvement by Valembois
and Fossorier. These concepts are used for the derivation of a new lower bound
on t... |
cs/0609096 | Finite-State Dimension and Lossy Decompressors | cs.CC cs.IT math.IT | This paper examines information-theoretic questions regarding the difficulty
of compressing data versus the difficulty of decompressing data and the role
that information loss plays in this interaction. Finite-state compression and
decompression are shown to be of equivalent difficulty, even when the
decompressors ar... |
cs/0609097 | Traveing Salesperson Problems for a double integrator | cs.RO | In this paper we propose some novel path planning strategies for a double
integrator with bounded velocity and bounded control inputs. First, we study
the following version of the Traveling Salesperson Problem (TSP): given a set
of points in $\real^d$, find the fastest tour over the point set for a double
integrator.... |
cs/0609099 | Coding for Parallel Channels: Gallager Bounds and Applications to
Repeat-Accumulate Codes | cs.IT math.IT | This paper is focused on the performance analysis of binary linear block
codes (or ensembles) whose transmission takes place over independent and
memoryless parallel channels. New upper bounds on the maximum-likelihood (ML)
decoding error probability are derived. The framework of the second version of
the Duman and S... |
cs/0609100 | Total Variation Minimization and Graph Cuts for Moving Objects
Segmentation | cs.CV | In this paper, we are interested in the application to video segmentation of
the discrete shape optimization problem involving the shape weighted perimeter
and an additional term depending on a parameter. Based on recent works and in
particular the one of Darbon and Sigelle, we justify the equivalence of the
shape op... |
cs/0609111 | A State-Based Regression Formulation for Domains with Sensing
Actions<br> and Incomplete Information | cs.AI | 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 a three-valued characterization of domains
with sensing actions to define the regression function. We prove the soundness
and complete... |
cs/0609112 | A Richer Understanding of the Complexity of Election Systems | cs.GT cs.CC cs.MA | We provide an overview of some recent progress on the complexity of election
systems. The issues studied include the complexity of the winner, manipulation,
bribery, and control problems.
|
cs/0609117 | Constructing LDPC Codes by 2-Lifts | cs.IT math.IT | We propose a new low-density parity-check code construction scheme based on
2-lifts. The proposed codes have an advantage of admitting efficient hardware
implementations. With the motivation of designing codes with low error floors,
we present an analysis of the low-weight stopping set distributions of the
proposed c... |
cs/0609119 | Verification, Validation and Integrity of Distributed and Interchanged
Rule Based Policies and Contracts in the Semantic Web | cs.AI cs.SE | Rule-based policy and contract systems have rarely been studied in terms of
their software engineering properties. This is a serious omission, because in
rule-based policy or contract representation languages rules are being used as
a declarative programming language to formalize real-world decision logic and
create ... |
cs/0609120 | Rule-based Knowledge Representation for Service Level Agreement | cs.AI cs.DB cs.LO cs.MA cs.SE | Automated management and monitoring of service contracts like Service Level
Agreements (SLAs) or higher-level policies is vital for efficient and reliable
distributed service-oriented architectures (SOA) with high quality of ser-vice
(QoS) levels. IT service provider need to manage, execute and maintain
thousands of ... |
cs/0609121 | Approximating Rate-Distortion Graphs of Individual Data: Experiments in
Lossy Compression and Denoising | cs.IT math.IT | Classical rate-distortion theory requires knowledge of an elusive source
distribution. Instead, we analyze rate-distortion properties of individual
objects using the recently developed algorithmic rate-distortion theory. The
latter is based on the noncomputable notion of Kolmogorov complexity. To apply
the theory we ... |
cs/0609122 | Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing
Tradeoff Perspective | cs.IT math.IT | We consider a general multiple antenna network with multiple sources,
multiple destinations and multiple relays in terms of the
diversity-multiplexing tradeoff (DMT). We examine several subcases of this most
general problem taking into account the processing capability of the relays
(half-duplex or full-duplex), and ... |
cs/0609123 | Optimal Design of Multiple Description Lattice Vector Quantizers | cs.IT math.IT | In the design of multiple description lattice vector quantizers (MDLVQ),
index assignment plays a critical role. In addition, one also needs to choose
the Voronoi cell size of the central lattice v, the sublattice index N, and the
number of side descriptions K to minimize the expected MDLVQ distortion, given
the tota... |
cs/0609125 | Problem Evolution: A new approach to problem solving systems | cs.NE | In this paper we present a novel tool to evaluate problem solving systems.
Instead of using a system to solve a problem, we suggest using the problem to
evaluate the system. By finding a numerical representation of a problem's
complexity, one can implement genetic algorithm to search for the most complex
problem the ... |
cs/0609132 | Semantic Description of Parameters in Web Service Annotations | cs.AI | A modification of OWL-S regarding parameter description is proposed. It is
strictly based on Description Logic. In addition to class description of
parameters it also allows the modelling of relations between parameters and the
precise description of the size of data to be supplied to a service. In
particular, it sol... |
cs/0609133 | An application-oriented terminology evaluation: the case of back-of-the
book indexes | cs.AI cs.IR | This paper addresses the problem of computational terminology evaluation not
per se but in a specific application context. This paper describes the
evaluation procedure that has been used to assess the validity of our overall
indexing approach and the quality of the IndDoc indexing tool. Even if
user-oriented extende... |
cs/0609134 | Using NLP to build the hypertextuel network of a back-of-the-book index | cs.AI cs.IR | Relying on the idea that back-of-the-book indexes are traditional devices for
navigation through large documents, we have developed a method to build a
hypertextual network that helps the navigation in a document. Building such an
hypertextual network requires selecting a list of descriptors, identifying the
relevant... |
cs/0609135 | Event-based Information Extraction for the biomedical domain: the
Caderige project | cs.AI cs.IR | This paper gives an overview of the Caderige project. This project involves
teams from different areas (biology, machine learning, natural language
processing) in order to develop high-level analysis tools for extracting
structured information from biological bibliographical databases, especially
Medline. The paper g... |
cs/0609136 | The ALVIS Format for Linguistically Annotated Documents | cs.AI | The paper describes the ALVIS annotation format designed for the indexing of
large collections of documents in topic-specific search engines. This paper is
exemplified on the biological domain and on MedLine abstracts, as developing a
specialized search engine for biologists is one of the ALVIS case studies. The
ALVI... |
cs/0609137 | Ontologies and Information Extraction | cs.AI cs.IR | This report argues that, even in the simplest cases, IE is an ontology-driven
process. It is not a mere text filtering method based on simple pattern
matching and keywords, because the extracted pieces of texts are interpreted
with respect to a predefined partial domain model. This report shows that
depending on the ... |
cs/0609138 | MDL Denoising Revisited | cs.IT math.IT | We refine and extend an earlier MDL denoising criterion for wavelet-based
denoising. We start by showing that the denoising problem can be reformulated
as a clustering problem, where the goal is to obtain separate clusters for
informative and non-informative wavelet coefficients, respectively. This
suggests two refin... |
cs/0609139 | The Capacity of Channels with Feedback | cs.IT math.IT | We introduce a general framework for treating channels with memory and
feedback. First, we generalize Massey's concept of directed information and use
it to characterize the feedback capacity of general channels. Second, we
present coding results for Markov channels. This requires determining
appropriate sufficient s... |
cs/0609140 | Motion Primitives for Robotic Flight Control | cs.RO cs.LG | We introduce a simple framework for learning aggressive maneuvers in flight
control of UAVs. Having inspired from biological environment, dynamic movement
primitives are analyzed and extended using nonlinear contraction theory.
Accordingly, primitives of an observed movement are stably combined and
concatenated. We d... |
cs/0609142 | Modular self-organization | cs.AI | The aim of this paper is to provide a sound framework for addressing a
difficult problem: the automatic construction of an autonomous agent's modular
architecture. We combine results from two apparently uncorrelated domains:
Autonomous planning through Markov Decision Processes and a General Data
Clustering Approach ... |
cs/0609143 | ECA-LP / ECA-RuleML: A Homogeneous Event-Condition-Action Logic
Programming Language | cs.AI cs.LO cs.SE | Event-driven reactive functionalities are an urgent need in nowadays
distributed service-oriented applications and (Semantic) Web-based
environments. An important problem to be addressed is how to correctly and
efficiently capture and process the event-based behavioral, reactive logic
represented as ECA rules in comb... |
cs/0609144 | The Management and Integration of Biomedical Knowledge: Application in
the Health-e-Child Project (Position Paper) | cs.DB | The Health-e-Child project aims to develop an integrated healthcare platform
for European paediatrics. In order to achieve a comprehensive view of childrens
health, a complex integration of biomedical data, information, and knowledge is
necessary. Ontologies will be used to formally define this domain knowledge and
w... |
cs/0609145 | A Semidefinite Relaxation for Air Traffic Flow Scheduling | cs.CE | We first formulate the problem of optimally scheduling air traffic low with
sector capacity constraints as a mixed integer linear program. We then use
semidefinite relaxation techniques to form a convex relaxation of that problem.
Finally, we present a randomization algorithm to further improve the quality of
the sol... |
cs/0609146 | A Combinatorial Family of Near Regular LDPC Codes | cs.IT math.IT | An elementary combinatorial Tanner graph construction for a family of
near-regular low density parity check codes achieving high girth is presented.
The construction allows flexibility in the choice of design parameters like
rate, average degree, girth and block length of the code and yields an
asymptotic family. The... |
cs/0609148 | Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes | cs.IT math.IT | Message-passing iterative decoders for low-density parity-check (LDPC) block
codes are known to be subject to decoding failures due to so-called
pseudo-codewords. These failures can cause the large signal-to-noise ratio
performance of message-passing iterative decoding to be worse than that
predicted by the maximum-l... |
cs/0609153 | Mining Generalized Graph Patterns based on User Examples | cs.DS cs.LG | There has been a lot of recent interest in mining patterns from graphs.
Often, the exact structure of the patterns of interest is not known. This
happens, for example, when molecular structures are mined to discover fragments
useful as features in chemical compound classification task, or when web sites
are mined to ... |
cs/0609154 | Loop Calculus Helps to Improve Belief Propagation and Linear Programming
Decodings of Low-Density-Parity-Check Codes | cs.IT cond-mat.dis-nn cond-mat.stat-mech math.IT | We illustrate the utility of the recently developed loop calculus for
improving the Belief Propagation (BP) algorithm. If the algorithm that
minimizes the Bethe free energy fails we modify the free energy by accounting
for a critical loop in a graphical representation of the code. The
log-likelihood specific critical... |
cs/0609155 | Detection of Markov Random Fields on Two-Dimensional Intersymbol
Interference Channels | cs.IT math.IT | We present a novel iterative algorithm for detection of binary Markov random
fields (MRFs) corrupted by two-dimensional (2D) intersymbol interference (ISI)
and additive white Gaussian noise (AWGN). We assume a first-order binary MRF as
a simple model for correlated images. We assume a 2D digital storage channel,
wher... |
cs/0609156 | Entangled Graphs | cs.IT cs.DM math.IT | In this paper we prove a separability criterion for mixed states in $\mathbb
C^p\otimes\mathbb C^q$. We also show that the density matrix of a graph with
only one entangled edge is entangled.
|
cs/0609157 | Sensor Scheduling for Optimal Observability Using Estimation Entropy | cs.IT cs.AI math.IT | We consider sensor scheduling as the optimal observability problem for
partially observable Markov decision processes (POMDP). This model fits to the
cases where a Markov process is observed by a single sensor which needs to be
dynamically adjusted or by a set of sensors which are selected one at a time in
a way that... |
cs/0609159 | Duality for Several Families of Evaluation Codes | cs.IT cs.DM math.IT | We consider generalizations of Reed-Muller codes, toric codes, and codes from
certain plane curves, such as those defined by norm and trace functions on
finite fields. In each case we are interested in codes defined by evaluating
arbitrary subsets of monomials, and in identifying when the dual codes are also
obtained... |
cs/0609160 | Redundancies of Correction-Capability-Optimized Reed-Muller Codes | cs.IT cs.DM math.IT | This article is focused on some variations of Reed-Muller codes that yield
improvements to the rate for a prescribed decoding performance under the
Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for
the redundancies of the new codes are given.
|
cs/0609161 | The Order Bound on the Minimum Distance of the One-Point Codes
Associated to a Garcia-Stichtenoth Tower of Function Fields | cs.IT cs.DM math.IT | Garcia and Stichtenoth discovered two towers of function fields that meet the
Drinfeld-Vl\u{a}du\c{t} bound on the ratio of the number of points to the
genus. For one of these towers, Garcia, Pellikaan and Torres derived a
recursive description of the Weierstrass semigroups associated to a tower of
points on the asso... |
cs/0609162 | On Semigroups Generated by Two Consecutive Integers and Improved
Hermitian Codes | cs.IT cs.DM math.IT | Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point
codes leads to two methods for improving code rate. One method, due to Feng and
Rao, removes parity checks that may be recovered by their majority voting
algorithm. The second method is to design the code to correct only those error
vectors of a... |
cs/0609164 | Conditional Expressions for Blind Deconvolution: Multi-point form | cs.CV | We present conditional expression (CE) for finding blurs convolved in given
images. The CE is given in terms of the zero-values of the blurs evaluated at
multi-point. The CE can detect multiple blur all at once. We illustrate the
multiple blur-detection by using a test image.
|
cs/0609165 | Simple method to eliminate blur based on Lane and Bates algorithm | cs.CV | A simple search method for finding a blur convolved in a given image is
presented. The method can be easily extended to a large blur. The method has
been experimentally tested with a model blurred image.
|
cs/0610002 | Conditional Expressions for Blind Deconvolution: Derivative form | cs.CV | We developed novel conditional expressions (CEs) for Lane and Bates' blind
deconvolution. The CEs are given in term of the derivatives of the zero-values
of the z-transform of given images. The CEs make it possible to automatically
detect multiple blur convolved in the given images all at once without
performing any ... |
cs/0610004 | Rapport technique du projet OGRE | cs.CL cs.AI | This repport concerns automatic understanding of (french) iterative
sentences, i.e. sentences where one single verb has to be interpreted by a more
or less regular plurality of events. A linguistic analysis is proposed along an
extension of Reichenbach's theory, several formal representations are
considered and a cor... |
cs/0610006 | A Typed Hybrid Description Logic Programming Language with Polymorphic
Order-Sorted DL-Typed Unification for Semantic Web Type Systems | cs.AI | In this paper we elaborate on a specific application in the context of hybrid
description logic programs (hybrid DLPs), namely description logic Semantic Web
type systems (DL-types) which are used for term typing of LP rules based on a
polymorphic, order-sorted, hybrid DL-typed unification as procedural semantics
of ... |
cs/0610007 | Full Text Searching in the Astrophysics Data System | cs.DL astro-ph cs.DB | The Smithsonian/NASA Astrophysics Data System (ADS) provides a search system
for the astronomy and physics scholarly literature. All major and many smaller
astronomy journals that were published on paper have been scanned back to
volume 1 and are available through the ADS free of charge. All scanned pages
have been c... |
cs/0610008 | Connectivity in the Astronomy Digital Library | cs.DL astro-ph cs.DB | The Astrophysics Data System (ADS) provides an extensive system of links
between the literature and other on-line information. Recently, the journals of
the American Astronomical Society (AAS) and a group of NASA data centers have
collaborated to provide more links between on-line data obtained by space
missions and ... |
cs/0610010 | One-Pass, One-Hash n-Gram Statistics Estimation | cs.DB cs.CL | In multimedia, text or bioinformatics databases, applications query sequences
of n consecutive symbols called n-grams. Estimating the number of distinct
n-grams is a view-size estimation problem. While view sizes can be estimated by
sampling under statistical assumptions, we desire an unassuming algorithm with
univer... |
cs/0610011 | Creation and use of Citations in the ADS | cs.DL astro-ph cs.DB cs.IR | With over 20 million records, the ADS citation database is regularly used by
researchers and librarians to measure the scientific impact of individuals,
groups, and institutions. In addition to the traditional sources of citations,
the ADS has recently added references extracted from the arXiv e-prints on a
nightly b... |
cs/0610012 | On Shift Sequences for Interleaved Construction of Sequence Sets with
Low Correlation | cs.IT math.IT | Construction of signal sets with low correlation property is of interest to
designers of CDMA systems. One of the preferred ways of constructing such sets
is the interleaved construction which uses two sequences a and b with 2-level
autocorrelation and a shift sequence e. The shift sequence has to satisfy
certain con... |
cs/0610015 | Why did the accident happen? A norm-based reasoning approach | cs.AI | In this paper we describe an architecture of a system that answer the
question : Why did the accident happen? from the textual description of an
accident. We present briefly the different parts of the architecture and then
we describe with more detail the semantic part of the system i.e. the part in
which the norm-ba... |
cs/0610016 | Norm Based Causal Reasoning in Textual Corpus | cs.AI cs.CL | Truth based entailments are not sufficient for a good comprehension of NL. In
fact, it can not deduce implicit information necessary to understand a text. On
the other hand, norm based entailments are able to reach this goal. This idea
was behind the development of Frames (Minsky 75) and Scripts (Schank 77, Schank
79... |
cs/0610018 | Raisonnement stratifi\'{e} \`{a} base de normes pour inf\'{e}rer les
causes dans un corpus textuel | cs.AI cs.CL | To understand texts written in natural language (LN), we use our knowledge
about the norms of the domain. Norms allow to infer more implicit information
from the text. This kind of information can, in general, be defeasible, but it
remains useful and acceptable while the text do not contradict it explicitly.
In this ... |
cs/0610019 | NectaRSS, an RSS feed ranking system that implicitly learns user
preferences | cs.IR cs.HC | In this paper a new RSS feed ranking method called NectaRSS is introduced.
The system recommends information to a user based on his/her past choices. User
preferences are automatically acquired, avoiding explicit feedback, and ranking
is based on those preferences distilled to a user profile. NectaRSS uses the
well-k... |
cs/0610020 | XString: XML as a String | cs.DB | Extensible markup language (XML) is a technology that has been much hyped, so
that XML has become an industry buzzword. Behind the hype is a powerful
technology for data representation in a platform independent manner. As a text
document, however, XML suffers from being too bloated, and requires an XML
parser to acce... |
cs/0610021 | On the Fading Paper Achievable Region of the Fading MIMO Broadcast
Channel | cs.IT math.IT | We consider transmission over the ergodic fading multi-antenna broadcast
(MIMO-BC) channel with partial channel state information at the transmitter and
full information at the receiver. Over the equivalent {\it non}-fading channel,
capacity has recently been shown to be achievable using transmission schemes
that wer... |
cs/0610022 | Iterative Decoding of Low-Density Parity Check Codes (A Survey) | cs.IT cs.CC math.IT | Much progress has been made on decoding algorithms for error-correcting codes
in the last decade. In this article, we give an introduction to some
fundamental results on iterative, message-passing algorithms for low-density
parity check codes. For certain important stochastic channels, this line of
work has enabled g... |
cs/0610023 | Une exp\'{e}rience de s\'{e}mantique inf\'{e}rentielle | cs.AI | We develop a system which must be able to perform the same inferences that a
human reader of an accident report can do and more particularly to determine
the apparent causes of the accident. We describe the general framework in which
we are situated, linguistic and semantic levels of the analysis and the
inference ru... |
cs/0610025 | Low Correlation Sequences over the QAM Constellation | cs.IT math.IT | This paper presents the first concerted look at low correlation sequence
families over QAM constellations of size M^2=4^m and their potential
applicability as spreading sequences in a CDMA setting.
Five constructions are presented, and it is shown how such sequence families
have the ability to transport a larger am... |
cs/0610029 | Data in the ADS -- Understanding How to Use it Better | cs.DL cs.DB | The Smithsonian/NASA ADS Abstract Service contains a wealth of data for
astronomers and librarians alike, yet the vast majority of usage consists of
rudimentary searches. Hints on how to obtain more focused search results by
using more of the various capabilities of the ADS are presented, including
searching by affil... |
cs/0610033 | A kernel for time series based on global alignments | cs.CV cs.LG | We propose in this paper a new family of kernels to handle times series,
notably speech data, within the framework of kernel methods which includes
popular algorithms such as the Support Vector Machine. These kernels elaborate
on the well known Dynamic Time Warping (DTW) family of distances by considering
the same se... |
cs/0610037 | The Capacity Region of a Class of Discrete Degraded Interference
Channels | cs.IT math.IT | We provide a single-letter characterization for the capacity region of a
class of discrete degraded interference channels (DDICs). The class of DDICs
considered includes the discrete additive degraded interference channel (DADIC)
studied by Benzel. We show that for the class of DDICs studied, encoder
cooperation does... |
cs/0610039 | The Application of Fuzzy Logic to the Construction of the Ranking
Function of Information Retrieval Systems | cs.IR cs.AI | The quality of the ranking function is an important factor that determines
the quality of the Information Retrieval system. Each document is assigned a
score by the ranking function; the score indicates the likelihood of relevance
of the document given a query. In the vector space model, the ranking function
is defin... |
cs/0610041 | A Computational Model of Spatial Memory Anticipation during Visual
Search | cs.NE | Some visual search tasks require to memorize the location of stimuli that
have been previously scanned. Considerations about the eye movements raise the
question of how we are able to maintain a coherent memory, despite the frequent
drastically changes in the perception. In this article, we present a
computational mo... |
cs/0610043 | Farthest-Point Heuristic based Initialization Methods for K-Modes
Clustering | cs.AI | The k-modes algorithm has become a popular technique in solving categorical
data clustering problems in different application domains. However, the
algorithm requires random selection of initial points for the clusters.
Different initial points often lead to considerable distinct clustering
results. In this paper we ... |
cs/0610045 | Spectra of large block matrices | cs.IT math.IT math.OA | In a frequency selective slow-fading channel in a MIMO system, the channel
matrix is of the form of a block matrix. This paper proposes a method to
calculate the limit of the eigenvalue distribution of block matrices if the
size of the blocks tends to infinity. While it considers random matrices, it
takes an operator... |
cs/0610047 | Capacity of the Trapdoor Channel with Feedback | cs.IT math.IT | We establish that the feedback capacity of the trapdoor channel is the
logarithm of the golden ratio and provide a simple communication scheme that
achieves capacity. As part of the analysis, we formulate a class of dynamic
programs that characterize capacities of unifilar finite-state channels. The
trapdoor channel ... |
cs/0610050 | The Mathematical Parallels Between Packet Switching and Information
Transmission | cs.IT cs.NI math.IT | All communication networks comprise of transmission systems and switching
systems, even though they are usually treated as two separate issues.
Communication channels are generally disturbed by noise from various sources.
In circuit switched networks, reliable communication requires the
error-tolerant transmission of... |
cs/0610052 | Finite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief
Propagation Decoders | cs.IT math.IT | This paper focuses on finite-dimensional upper and lower bounds on decodable
thresholds of Zm and binary low-density parity-check (LDPC) codes, assuming
belief propagation decoding on memoryless channels. A concrete framework is
presented, admitting systematic searches for new bounds. Two noise measures are
considere... |
cs/0610053 | Towards a Bayesian framework for option pricing | cs.CE q-fin.PR | In this paper, we describe a general method for constructing the posterior
distribution of an option price. Our framework takes as inputs the prior
distributions of the parameters of the stochastic process followed by the
underlying, as well as the likelihood function implied by the observed price
history for the und... |
cs/0610057 | Properties of codes in rank metric | cs.DM cs.IT math.IT | We study properties of rank metric and codes in rank metric over finite
fields. We show that in rank metric perfect codes do not exist. We derive an
existence bound that is the equivalent of the Gilbert--Varshamov bound in
Hamming metric. We study the asymptotic behavior of the minimum rank distance
of codes satisfyi... |
cs/0610058 | Context-sensitive access to e-document corpus | cs.IR | The methodology of context-sensitive access to e-documents considers context
as a problem model based on the knowledge extracted from the application
domain, and presented in the form of application ontology. Efficient access to
an information in the text form is needed. Wiki resources as a modern text
format provide... |
cs/0610059 | Camera motion estimation through planar deformation determination | cs.CV | In this paper, we propose a global method for estimating the motion of a
camera which films a static scene. Our approach is direct, fast and robust, and
deals with adjacent frames of a sequence. It is based on a quadratic
approximation of the deformation between two images, in the case of a scene
with constant depth ... |
cs/0610060 | Comparing Typical Opening Move Choices Made by Humans and Chess Engines | cs.AI | The opening book is an important component of a chess engine, and thus
computer chess programmers have been developing automated methods to improve
the quality of their books. For chess, which has a very rich opening theory,
large databases of high-quality games can be used as the basis of an opening
book, from which... |
cs/0610061 | The Delay-Limited Capacity Region of OFDM Broadcast Channels | cs.IT math.IT | In this work, the delay limited capacity (DLC) of orthogonal frequency
division multiplexing (OFDM) systems is investigated. The analysis is organized
into two parts. In the first part, the impact of system parameters on the OFDM
DLC is analyzed in a general setting. The main results are that under weak
assumptions t... |
cs/0610067 | Language, logic and ontology: uncovering the structure of commonsense
knowledge | cs.AI math.LO | The purpose of this paper is twofold: (i) we argue that the structure of
commonsense knowledge must be discovered, rather than invented; and (ii) we
argue that natural language, which is the best known theory of our (shared)
commonsense knowledge, should itself be used as a guide to discovering the
structure of commo... |
cs/0610074 | Collaborative Decoding of Interleaved Reed-Solomon Codes and
Concatenated Code Designs | cs.IT math.IT | Interleaved Reed-Solomon codes are applied in numerous data processing, data
transmission, and data storage systems. They are generated by interleaving
several codewords of ordinary Reed-Solomon codes. Usually, these codewords are
decoded independently by classical algebraic decoding methods. However, by
collaborativ... |
cs/0610075 | On Geometric Algebra representation of Binary Spatter Codes | cs.AI quant-ph | Kanerva's Binary Spatter Codes are reformulated in terms of geometric
algebra. The key ingredient of the construction is the representation of XOR
binding in terms of geometric product.
|
cs/0610076 | Peano Count Trees (P-Trees) and Rule Association Mining for Gene
Expression Profiling of Microarray Data | cs.DS cs.IR q-bio.MN | The greatest challenge in maximizing the use of gene expression data is to
develop new computational tools capable of interconnecting and interpreting the
results from different organisms and experimental settings. We propose an
integrative and comprehensive approach including a super-chip containing data
from microa... |
cs/0610077 | MIMO Broadcast Channels with Block Diagonalization and Finite Rate
Feedback | cs.IT math.IT | Block diagonalization is a linear precoding technique for the multiple
antenna broadcast (downlink) channel that involves transmission of multiple
data streams to each receiver such that no multi-user interference is
experienced at any of the receivers. This low-complexity scheme operates only a
few dB away from capa... |
cs/0610079 | An Enhanced Covering Lemma for Multiterminal Source Coding | cs.IT math.IT | An enhanced covering lemma for a Markov chain is proved in this paper, and
then the distributed source coding problem of correlated general sources with
one average distortion criterion under fixed-length coding is investigated.
Based on the enhanced lemma, a sufficient and necessary condition for
determining the ach... |
cs/0610082 | Theoretical analysis of network cranback protocols performance | cs.IT math.IT | Suggested the decision of the network cranback protocols performance
analyzing problem from Eyal Felstine, Reuven Cohen and Ofer Hadar, " Crankback
Prediction in Hierarchical ATM networks", Journal of Network and Systems
Management, Vol. 10, No. 3, September 2002. It show that the false alarm
probability and probabil... |
cs/0610083 | Estimation of the traffic in the binary channel for data networks | cs.IT math.IT | It is impossible to provide an effective utilization of communication
networks without the analysis of the quantitative characteristics of the
traffic in real time. The constant supervision of all channels of the data
practically is impracticable because requires transfer of the significant
additional information on ... |
cs/0610091 | On the Behavior of Journal Impact Factor Rank-Order Distribution | cs.IR physics.soc-ph | An empirical law for the rank-order behavior of journal impact factors is
found. Using an extensive data base on impact factors including journals on
Education, Agrosciences, Geosciences, Biosciences and Environ- mental,
Chemical, Computer, Engineering, Material, Mathematical, Medical and Physical
Sciences we have fo... |
cs/0610093 | Semantic results for ontic and epistemic change | cs.LO cs.AI cs.MA | We give some semantic results for an epistemic logic incorporating dynamic
operators to describe information changing events. Such events include
epistemic changes, where agents become more informed about the non-changing
state of the world, and ontic changes, wherein the world changes. The events
are executed in inf... |
cs/0610095 | Solving planning domains with polytree causal graphs is NP-complete | cs.AI cs.CC | We show that solving planning domains on binary variables with polytree
causal graph is \NP-complete. This is in contrast to a polynomial-time
algorithm of Domshlak and Brafman that solves these planning domains for
polytree causal graphs of bounded indegree.
|
cs/0610098 | Characterizing Solution Concepts in Games Using Knowledge-Based Programs | cs.GT cs.DC cs.MA | We show how solution concepts in games such as Nash equilibrium, correlated
equilibrium, rationalizability, and sequential equilibrium can be given a
uniform definition in terms of \emph{knowledge-based programs}. Intuitively,
all solution concepts are implementations of two knowledge-based programs, one
appropriate ... |
cs/0610099 | Properties of Codes with the Rank Metric | cs.IT math.IT | In this paper, we study properties of rank metric codes in general and
maximum rank distance (MRD) codes in particular. For codes with the rank
metric, we first establish Gilbert and sphere-packing bounds, and then obtain
the asymptotic forms of these two bounds and the Singleton bound. Based on the
asymptotic bounds... |
cs/0610100 | A Mobile Transient Internet Architecture | cs.NI cs.IT math.IT | This paper describes a new architecture for transient mobile networks
destined to merge existing and future network architectures, communication
implementations and protocol operations by introducing a new paradigm to data
delivery and identification. The main goal of our research is to enable
seamless end-to-end com... |
cs/0610102 | Quantum communication is possible with pure state | cs.IT math.IT | It is believed that quantum communication is not possible with a pure
ensemble of states because quantum entropy of pure state is zero. This is
indeed possible due to geometric consequence of entanglement.
|
cs/0610103 | On the Secrecy Capacity of Fading Channels | cs.IT math.IT | We consider the secure transmission of information over an ergodic fading
channel in the presence of an eavesdropper. Our eavesdropper can be viewed as
the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a
system is characterized under the assumption of asymptotically long coherence
intervals... |
cs/0610104 | ARQ Diversity in Fading Random Access Channels | cs.IT math.IT | A cross-layer optimization approach is adopted for the design of symmetric
random access wireless systems. Instead of the traditional collision model, a
more realistic physical layer model is considered. Based on this model, an
Incremental Redundancy Automatic Repeat reQuest (IR-ARQ) scheme, tailored to
jointly comba... |
cs/0610105 | How To Break Anonymity of the Netflix Prize Dataset | cs.CR cs.DB | We present a new class of statistical de-anonymization attacks against
high-dimensional micro-data, such as individual preferences, recommendations,
transaction records and so on. Our techniques are robust to perturbation in the
data and tolerate some mistakes in the adversary's background knowledge.
We apply our d... |
cs/0610106 | On the Error Exponents of ARQ Channels with Deadlines | cs.IT math.IT | We consider communication over Automatic Repeat reQuest (ARQ) memoryless
channels with deadlines. In particular, an upper bound L is imposed on the
maximum number of ARQ transmission rounds. In this setup, it is shown that
incremental redundancy ARQ outperforms Forney's memoryless decoding in terms of
the achievable ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.