id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0607091 | Finite element method for thermal analysis of concentrating solar
receivers | cs.CE | Application of finite element method and heat conductivity transfer model for
calculation of temperature distribution in receiver for dish-Stirling
concentrating solar system is described. The method yields discretized
equations that are entirely local to the elements and provides complete
geometric flexibility. A co... |
cs/0607095 | Gallager's Exponent for MIMO Channels: A Reliability-Rate Tradeoff | cs.IT math.IT | In this paper, we derive Gallager's random coding error exponent for
multiple-input multiple-output (MIMO) channels, assuming no channel-state
information (CSI) at the transmitter and perfect CSI at the receiver. This
measure gives insight into a fundamental tradeoff between the communication
reliability and informat... |
cs/0607096 | Logical settings for concept learning from incomplete examples in First
Order Logic | cs.LG | We investigate here concept learning from incomplete examples. Our first
purpose is to discuss to what extent logical learning settings have to be
modified in order to cope with data incompleteness. More precisely we are
interested in extending the learning from interpretations setting introduced by
L. De Raedt that ... |
cs/0607098 | List decoding of noisy Reed-Muller-like codes | cs.DS cs.IT math.IT | First- and second-order Reed-Muller (RM(1) and RM(2), respectively) codes are
two fundamental error-correcting codes which arise in communication as well as
in probabilistically-checkable proofs and learning. In this paper, we take the
first steps toward extending the quick randomized decoding tools of RM(1) into
the... |
cs/0607099 | Degrees of Freedom Region for the MIMO X Channel | cs.IT math.IT | We provide achievability as well as converse results for the degrees of
freedom region of a MIMO $X$ channel, i.e., a system with two transmitters, two
receivers, each equipped with multiple antennas, where independent messages
need to be conveyed over fixed channels from each transmitter to each receiver.
With M=1 a... |
cs/0607102 | Multiaccess Channels with State Known to Some Encoders and Independent
Messages | cs.IT math.IT | We consider a state-dependent multiaccess channel (MAC) with state
non-causally known to some encoders. We derive an inner bound for the capacity
region in the general discrete memoryless case and specialize to a binary
noiseless case. In the case of maximum entropy channel state, we obtain the
capacity region for bi... |
cs/0607103 | Ideas by Statistical Mechanics (ISM) | cs.CE cs.MS cs.NE | Ideas by Statistical Mechanics (ISM) is a generic program to model evolution
and propagation of ideas/patterns throughout populations subjected to
endogenous and exogenous interactions. The program is based on the author's
work in Statistical Mechanics of Neocortical Interactions (SMNI), and uses the
author's Adaptiv... |
cs/0607104 | Reducing the Computation of Linear Complexities of Periodic Sequences
over $GF(p^m)$ | cs.CR cs.IT math.IT | The linear complexity of a periodic sequence over $GF(p^m)$ plays an
important role in cryptography and communication [12]. In this correspondence,
we prove a result which reduces the computation of the linear complexity and
minimal connection polynomial of a period $un$ sequence over $GF(p^m)$ to the
computation of ... |
cs/0607107 | Linear Predictive Coding as an Estimator of Volatility | cs.IT math.IT | In this paper, we present a method of estimating the volatility of a signal
that displays stochastic noise (such as a risky asset traded on an open market)
utilizing Linear Predictive Coding. The main purpose is to associate volatility
with a series of statistical properties that can lead us, through further
investig... |
cs/0607108 | Properties of subspace subcodes of optimum codes in rank metric | cs.IT cs.DM math.IT | Maximum rank distance codes denoted MRD-codes are the equivalent in rank
metric of MDS-codes. Given any integer $q$ power of a prime and any integer $n$
there is a family of MRD-codes of length $n$ over $\FF{q^n}$ having
polynomial-time decoding algorithms. These codes can be seen as the analogs of
Reed-Solomon codes... |
cs/0607110 | A Theory of Probabilistic Boosting, Decision Trees and Matryoshki | cs.LG | We present a theory of boosting probabilistic classifiers. We place ourselves
in the situation of a user who only provides a stopping parameter and a
probabilistic weak learner/classifier and compare three types of boosting
algorithms: probabilistic Adaboost, decision tree, and tree of trees of ... of
trees, which we... |
cs/0607112 | Improving convergence of Belief Propagation decoding | cs.IT math.IT | The decoding of Low-Density Parity-Check codes by the Belief Propagation (BP)
algorithm is revisited. We check the iterative algorithm for its convergence to
a codeword (termination), we run Monte Carlo simulations to find the
probability distribution function of the termination time, n_it. Tested on an
example [155,... |
cs/0607120 | Expressing Implicit Semantic Relations without Supervision | cs.CL cs.AI cs.IR cs.LG | We present an unsupervised learning algorithm that mines large text corpora
for patterns that express implicit semantic relations. For a given input word
pair X:Y with some unspecified semantic relations, the corresponding output
list of patterns <P1,...,Pm> is ranked according to how well each pattern Pi
expresses t... |
cs/0607132 | On q-ary codes correcting all unidirectional errors of a limited
magnitude | cs.IT math.IT | We consider codes over the alphabet Q={0,1,..,q-1}intended for the control of
unidirectional errors of level l. That is, the transmission channel is such
that the received word cannot contain both a component larger than the
transmitted one and a component smaller than the transmitted one. Moreover, the
absolute valu... |
cs/0607133 | Self-Replication and Self-Assembly for Manufacturing | cs.MA cs.CE | It has been argued that a central objective of nanotechnology is to make
products inexpensively, and that self-replication is an effective approach to
very low-cost manufacturing. The research presented here is intended to be a
step towards this vision. We describe a computational simulation of nanoscale
machines flo... |
cs/0607134 | Leading strategies in competitive on-line prediction | cs.LG | We start from a simple asymptotic result for the problem of on-line
regression with the quadratic loss function: the class of continuous
limited-memory prediction strategies admits a "leading prediction strategy",
which not only asymptotically performs at least as well as any continuous
limited-memory strategy but al... |
cs/0607136 | Competing with Markov prediction strategies | cs.LG | Assuming that the loss function is convex in the prediction, we construct a
prediction strategy universal for the class of Markov prediction strategies,
not necessarily continuous. Allowing randomization, we remove the requirement
of convexity.
|
cs/0607138 | A Foundation to Perception Computing, Logic and Automata | cs.AI cs.LG | In this report, a novel approach to intelligence and learning is introduced,
this approach is based on what we call 'perception logic'. Based on this logic,
a computing mechanism and automata are introduced. Multi-resolution analysis of
perceptual information is given, in which learning is accomplished in at most
O(l... |
cs/0607140 | Stylized Facts in Internal Rates of Return on Stock Index and its
Derivative Transactions | cs.IT cs.CE math.IT | Universal features in stock markets and their derivative markets are studied
by means of probability distributions in internal rates of return on buy and
sell transaction pairs. Unlike the stylized facts in log normalized returns,
the probability distributions for such single asset encounters encorporate the
time fac... |
cs/0607143 | Target Type Tracking with PCR5 and Dempster's rules: A Comparative
Analysis | cs.AI | In this paper we consider and analyze the behavior of two combinational rules
for temporal (sequential) attribute data fusion for target type estimation. Our
comparative analysis is based on Dempster's fusion rule proposed in
Dempster-Shafer Theory (DST) and on the Proportional Conflict Redistribution
rule no. 5 (PCR... |
cs/0607147 | Fusion of qualitative beliefs using DSmT | cs.AI | This paper introduces the notion of qualitative belief assignment to model
beliefs of human experts expressed in natural language (with linguistic
labels). We show how qualitative beliefs can be efficiently combined using an
extension of Dezert-Smarandache Theory (DSmT) of plausible and paradoxical
quantitative reaso... |
cs/0608002 | An Introduction to the DSm Theory for the Combination of Paradoxical,
Uncertain, and Imprecise Sources of Information | cs.AI | The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this
introduction, we present a sur... |
cs/0608004 | Separating the articles of authors with the same name | cs.DL cs.IR | I describe a method to separate the articles of different authors with the
same name. It is based on a distance between any two publications, defined in
terms of the probability that they would have as many coincidences if they were
drawn at random from all published documents. Articles with a given author name
are t... |
cs/0608006 | A Graph-based Framework for Transmission of Correlated Sources over
Broadcast Channels | cs.IT math.IT | In this paper we consider the communication problem that involves
transmission of correlated sources over broadcast channels. We consider a
graph-based framework for this information transmission problem. The system
involves a source coding module and a channel coding module. In the source
coding module, the sources ... |
cs/0608007 | On the randomness of independent experiments | cs.IT math.IT | Given a probability distribution P, what is the minimum amount of bits needed
to store a value x sampled according to P, such that x can later be recovered
(except with some small probability)? Or, what is the maximum amount of uniform
randomness that can be extracted from x? Answering these and similar
information-t... |
cs/0608009 | Stability in multidimensional Size Theory | cs.CG cs.CV | This paper proves that in Size Theory the comparison of multidimensional size
functions can be reduced to the 1-dimensional case by a suitable change of
variables. Indeed, we show that a foliation in half-planes can be given, such
that the restriction of a multidimensional size function to each of these
half-planes t... |
cs/0608010 | MIMO scheme performance and detection in epsilon noise | cs.IT math.IT | New approach for analysis and decoding MIMO signaling is developed for usual
model of nongaussion noise consists of background and impulsive noise named
epsilon - noise. It is shown that non-gaussion noise performance significantly
worse than gaussion ones. Stimulation results strengthen out theory. Robust in
statist... |
cs/0608015 | Towards "Propagation = Logic + Control" | cs.PL cs.AI | Constraint propagation algorithms implement logical inference. For
efficiency, it is essential to control whether and in what order basic
inference steps are taken. We provide a high-level framework that clearly
differentiates between information needed for controlling propagation versus
that needed for the logical s... |
cs/0608017 | Infinite Qualitative Simulations by Means of Constraint Programming | cs.AI cs.LO | We introduce a constraint-based framework for studying infinite qualitative
simulations concerned with contingencies such as time, space, shape, size,
abstracted into a finite set of qualitative relations. To define the
simulations, we combine constraints that formalize the background knowledge
concerned with qualita... |
cs/0608018 | The single-serving channel capacity | cs.IT math.IT | In this paper we provide the answer to the following question: Given a noisy
channel and epsilon>0, how many bits can be transmitted with an error of at
most epsilon by a single use of the channel?
|
cs/0608019 | Relation Variables in Qualitative Spatial Reasoning | cs.AI | We study an alternative to the prevailing approach to modelling qualitative
spatial reasoning (QSR) problems as constraint satisfaction problems. In the
standard approach, a relation between objects is a constraint whereas in the
alternative approach it is a variable. The relation-variable approach greatly
simplifies... |
cs/0608021 | The Shannon capacity of a graph and the independence numbers of its
powers | cs.IT cs.DM math.IT | The independence numbers of powers of graphs have been long studied, under
several definitions of graph products, and in particular, under the strong
graph product. We show that the series of independence numbers in strong powers
of a fixed graph can exhibit a complex structure, implying that the Shannon
Capacity of ... |
cs/0608023 | Optimal resource allocation for OFDM multiuser channels | cs.IT math.IT | In this paper, a unifying framework for orthogonal frequency division
multiplexing (OFDM) multiuser resource allocation is presented. The isolated
seeming problems of maximizing a weighted sum of rates for a given power budget
$\bar{P}$ and minimizing sum power for given rate requirements
$\mathbf{\bar{R}}$ can be in... |
cs/0608028 | Using Sets of Probability Measures to Represent Uncertainty | cs.AI | I explore the use of sets of probability measures as a representation of
uncertainty.
|
cs/0608029 | Guessing Facets: Polytope Structure and Improved LP Decoder | cs.IT math.IT | A new approach for decoding binary linear codes by solving a linear program
(LP) over a relaxed codeword polytope was recently proposed by Feldman et al.
In this paper we investigate the structure of the polytope used in the LP
relaxation decoding. We begin by showing that for expander codes, every
fractional pseudoc... |
cs/0608033 | A Study on Learnability for Rigid Lambek Grammars | cs.LG | We present basic notions of Gold's "learnability in the limit" paradigm,
first presented in 1967, a formalization of the cognitive process by which a
native speaker gets to grasp the underlying grammar of his/her own native
language by being exposed to well formed sentences generated by that grammar.
Then we present ... |
cs/0608037 | Cascade hash tables: a series of multilevel double hashing schemes with
O(1) worst case lookup time | cs.DS cs.AI | In this paper, the author proposes a series of multilevel double hashing
schemes called cascade hash tables. They use several levels of hash tables. In
each table, we use the common double hashing scheme. Higher level hash tables
work as fail-safes of lower level hash tables. By this strategy, it could
effectively re... |
cs/0608042 | An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric
Memoryless Channels | cs.IT math.IT | This paper derives an improved sphere-packing (ISP) bound for finite-length
codes whose transmission takes place over symmetric memoryless channels. We
first review classical results, i.e., the 1959 sphere-packing (SP59) bound of
Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of
Shannon et... |
cs/0608043 | Using Users' Expectations to Adapt Business Intelligence Systems | cs.IR | This paper takes a look at the general characteristics of business or
economic intelligence system. The role of the user within this type of system
is emphasized. We propose two models which we consider important in order to
adapt this system to the user. The first model is based on the definition of
decisional probl... |
cs/0608044 | Network Coding in a Multicast Switch | cs.NI cs.IT math.IT | We consider the problem of serving multicast flows in a crossbar switch. We
show that linear network coding across packets of a flow can sustain traffic
patterns that cannot be served if network coding were not allowed. Thus,
network coding leads to a larger rate region in a multicast crossbar switch. We
demonstrate ... |
cs/0608049 | Solving non-uniqueness in agglomerative hierarchical clustering using
multidendrograms | cs.IR math.ST physics.data-an stat.TH | In agglomerative hierarchical clustering, pair-group methods suffer from a
problem of non-uniqueness when two or more distances between different clusters
coincide during the amalgamation process. The traditional approach for solving
this drawback has been to take any arbitrary criterion in order to break ties
betwee... |
cs/0608056 | Wiretap Channel With Side Information | cs.IT math.IT | This submission has been withdrawn by the author.
|
cs/0608057 | Hybrid Elections Broaden Complexity-Theoretic Resistance to Control | cs.GT cs.CC cs.MA | Electoral control refers to attempts by an election's organizer ("the chair")
to influence the outcome by adding/deleting/partitioning voters or candidates.
The groundbreaking work of Bartholdi, Tovey, and Trick [BTT92] on
(constructive) control proposes computational complexity as a means of
resisting control attemp... |
cs/0608060 | Duality and Capacity Region of AF Relay MAC and BC | cs.IT math.IT | We consider multi-hop multiple access (MAC) and broadcast channels (BC) where
communication takes place with the assistance of relays that amplify and
forward (AF) their received signals. For a two hop parallel AF relay MAC,
assuming a sum power constraint across all relays we characterize optimal relay
amplification... |
cs/0608070 | Finite State Channels with Time-Invariant Deterministic Feedback | cs.IT math.IT | We consider capacity of discrete-time channels with feedback for the general
case where the feedback is a time-invariant deterministic function of the
output samples. Under the assumption that the channel states take values in a
finite alphabet, we find an achievable rate and an upper bound on the capacity.
We furthe... |
cs/0608071 | Broadcast Cooperation Strategies for Two Colocated Users | cs.IT math.IT | This work considers the problem of communication from a single transmitter,
over a network with colocated users, through an independent block Rayleigh
fading channel. The colocation nature of the users allows cooperation, which
increases the overall achievable rate, from the transmitter to the destined
user. The tran... |
cs/0608072 | Applications of Random Parameter Matrices Kalman Filtering in Uncertain
Observation and Multi-Model Systems | cs.IT math.IT | This paper considers the Linear Minimum Variance recursive state estimation
for the linear discrete time dynamic system with random state transition and
measurement matrices, i.e., random parameter matrices Kalman filtering. It is
shown that such system can be converted to a linear dynamic system with
deterministic p... |
cs/0608073 | Parametrical Neural Networks and Some Other Similar Architectures | cs.CV cs.NE | A review of works on associative neural networks accomplished during last
four years in the Institute of Optical Neural Technologies RAS is given. The
presentation is based on description of parametrical neural networks (PNN). For
today PNN have record recognizing characteristics (storage capacity, noise
immunity and... |
cs/0608078 | Searching for Globally Optimal Functional Forms for Inter-Atomic
Potentials Using Parallel Tempering and Genetic Programming | cs.NE cs.AI | We develop a Genetic Programming-based methodology that enables discovery of
novel functional forms for classical inter-atomic force-fields, used in
molecular dynamics simulations. Unlike previous efforts in the field, that fit
only the parameters to the fixed functional forms, we instead use a novel
algorithm to sea... |
cs/0608081 | How Hard Is Bribery in Elections? | cs.GT cs.CC cs.MA | We study the complexity of influencing elections through bribery: How
computationally complex is it for an external actor to determine whether by a
certain amount of bribing voters a specified candidate can be made the
election's winner? We study this problem for election systems as varied as
scoring protocols and Do... |
cs/0608085 | A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision
Branching Programs | cs.CC cs.DM cs.IT math.IT | For a decision problem from coding theory, we prove a quadratic expected
time-space tradeoff of the form $\eT\eS=\Omega(\tfrac{n^2}{q})$ for $q$-way
deterministic decision branching programs, where $q\geq 2$. Here $\eT$ is the
expected computation time and $\eS$ is the expected space, when all inputs are
equally like... |
cs/0608086 | Analog Codes on Graphs | cs.IT cs.DM math.IT | We consider the problem of transmission of a sequence of real data produced
by a Nyquist sampled band-limited analog source over a band-limited analog
channel, which introduces an additive white Gaussian noise. An analog coding
scheme is described, which can achieve a mean-squared error distortion
proportional to $(1... |
cs/0608087 | On an Improvement over R\'enyi's Equivocation Bound | cs.IT cs.DM math.IT | We consider the problem of estimating the probability of error in
multi-hypothesis testing when MAP criterion is used. This probability, which is
also known as the Bayes risk is an important measure in many communication and
information theory problems. In general, the exact Bayes risk can be difficult
to obtain. Man... |
cs/0608089 | Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR
regime | cs.IT math.IT | This paper deals with throughput scaling laws for random ad-hoc wireless
networks in a rich scattering environment. We develop schemes to optimize the
ratio, $\rho(n)$ of achievable network sum capacity to the sum of the
point-to-point capacities of source-destinations pairs operating in isolation.
For fixed SNR netw... |
cs/0608091 | On-line topological simplification of weighted graphs | cs.DS cs.DB | We describe two efficient on-line algorithms to simplify weighted graphs by
eliminating degree-two vertices. Our algorithms are on-line in that they react
to updates on the data, keeping the simplification up-to-date. The supported
updates are insertions of vertices and edges; hence, our algorithms are
partially dyna... |
cs/0608093 | Connection between continuous and digital n-manifolds and the Poincare
conjecture | cs.DM cs.CV math.AT | We introduce LCL covers of closed n-dimensional manifolds by n-dimensional
disks and study their properties. We show that any LCL cover of an
n-dimensional sphere can be converted to the minimal LCL cover, which consists
of 2n+2 disks. We prove that an LCL collection of n-disks is a cover of a
continuous n-sphere if ... |
cs/0608095 | Stationary Algorithmic Probability | cs.IT cs.CC math.IT math.PR | Kolmogorov complexity and algorithmic probability are defined only up to an
additive resp. multiplicative constant, since their actual values depend on the
choice of the universal reference computer. In this paper, we analyze a natural
approach to eliminate this machine-dependence.
Our method is to assign algorithm... |
cs/0608099 | Automated verification of weak equivalence within the SMODELS system | cs.AI cs.LO | In answer set programming (ASP), a problem at hand is solved by (i) writing a
logic program whose answer sets correspond to the solutions of the problem, and
by (ii) computing the answer sets of the program using an answer set solver as
a search engine. Typically, a programmer creates a series of gradually
improving ... |
cs/0608100 | Similarity of Semantic Relations | cs.CL cs.IR cs.LG | There are at least two kinds of similarity. Relational similarity is
correspondence between relations, in contrast with attributional similarity,
which is correspondence between attributes. When two words have a high degree
of attributional similarity, we call them synonyms. When two pairs of words
have a high degree... |
cs/0608103 | Logic programs with monotone abstract constraint atoms | cs.AI cs.LO | We introduce and study logic programs whose clauses are built out of monotone
constraint atoms. We show that the operational concept of the one-step
provability operator generalizes to programs with monotone constraint atoms,
but the generalization involves nondeterminism. Our main results demonstrate
that our formal... |
cs/0608105 | Application Layer Definition and Analyses of Controller Area Network Bus
for Wire Harness Assembly Machine | cs.RO cs.NI | With the feature of multi-master bus access, nondestructive contention-based
arbitration and flexible configuration, Controller Area Network (CAN) bus is
applied into the control system of Wire Harness Assembly Machine (WHAM). To
accomplish desired goal, the specific features of the CAN bus is analyzed by
compared wi... |
cs/0608107 | The Haar Wavelet Transform of a Dendrogram | cs.IR | We describe a new wavelet transform, for use on hierarchies or binary rooted
trees. The theoretical framework of this approach to data analysis is
described. Case studies are used to further exemplify this approach. A first
set of application studies deals with data array smoothing, or filtering. A
second set of appl... |
cs/0608115 | Neural Network Clustering Based on Distances Between Objects | cs.CV cs.NE | We present an algorithm of clustering of many-dimensional objects, where only
the distances between objects are used. Centers of classes are found with the
aid of neuron-like procedure with lateral inhibition. The result of clustering
does not depend on starting conditions. Our algorithm makes it possible to give
an ... |
cs/0608117 | Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC
Code Ensemble | cs.IT math.IT | Code annealing, a new method of designing good codes of short block length,
is proposed, which is then concatenated with cyclic lifting to create finite
codes of low frame error rate (FER) error floors without performance outliers.
The stopping set analysis is performed on the cyclically lifted code ensemble
assuming... |
cs/0608121 | Cross Entropy Approximation of Structured Covariance Matrices | cs.IT math.IT | We apply two variations of the principle of Minimum Cross Entropy (the
Kullback information measure) to fit parameterized probability density models
to observed data densities. For an array beamforming problem with P incident
narrowband point sources, N > P sensors, and colored noise, both approaches
yield eigenvecto... |
cs/0608123 | Proof of a Conjecture of Helleseth Regarding Pairs of Binary m-Sequences | cs.IT math.IT | This paper has been withdrawn by the author(s), due a crucial sign error in
Thm. 11.
|
cs/0609001 | A Robust Solution Procedure for Hyperelastic Solids with Large Boundary
Deformation | cs.NA cs.CE | Compressible Mooney-Rivlin theory has been used to model hyperelastic solids,
such as rubber and porous polymers, and more recently for the modeling of soft
tissues for biomedical tissues, undergoing large elastic deformations. We
propose a solution procedure for Lagrangian finite element discretization of a
static n... |
cs/0609003 | In Quest of Image Semantics: Are We Looking for It Under the Right
Lamppost? | cs.CV cs.IR | In the last years we witness a dramatic growth of research focused on
semantic image understanding. Indeed, without understanding image content
successful accomplishment of any image-processing task is simply incredible. Up
to the recent times, the ultimate need for such understanding has been met by
the knowledge th... |
cs/0609006 | New Quasi-Cyclic Codes from Simplex Codes | cs.IT math.IT | As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many
good linear codes. But quasi-cyclic codes studied so far are mainly limited to
one generator (1-generator) QC codes. In this correspondence, 2-generator and
3-generator QC codes are studied, and many good, new QC codes are constructed
from simp... |
cs/0609007 | A Massive Local Rules Search Approach to the Classification Problem | cs.LG | An approach to the classification problem of machine learning, based on
building local classification rules, is developed. The local rules are
considered as projections of the global classification rules to the event we
want to classify. A massive global optimization algorithm is used for
optimization of quality crit... |
cs/0609010 | An effective edge--directed frequency filter for removal of aliasing in
upsampled images | cs.CV | Raster images can have a range of various distortions connected to their
raster structure. Upsampling them might in effect substantially yield the
raster structure of the original image, known as aliasing. The upsampling
itself may introduce aliasing into the upsampled image as well. The presented
method attempts to ... |
cs/0609011 | Scheduling for Stable and Reliable Communication over Multiaccess
Channels and Degraded Broadcast Channels | cs.NI cs.IT math.IT | Information-theoretic arguments focus on modeling the reliability of
information transmission, assuming availability of infinite data at sources,
thus ignoring randomness in message generation times at the respective sources.
However, in information transport networks, not only is reliable transmission
important, but... |
cs/0609018 | Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay
Channels | cs.IT math.IT | This paper describes an efficient implementation of binning for the relay
channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC
codes to approach the theoretically promised rate of the decode-and-forward
relaying strategy by incorporating relay-generated information bits in
specially designed bi... |
cs/0609019 | Improving Term Extraction with Terminological Resources | cs.CL | Studies of different term extractors on a corpus of the biomedical domain
revealed decreasing performances when applied to highly technical texts. The
difficulty or impossibility of customising them to new domains is an additional
limitation. In this paper, we propose to use external terminologies to
influence generi... |
cs/0609030 | Space Division Multiple Access with a Sum Feedback Rate Constraint | cs.IT cs.NI math.IT | On a multi-antenna broadcast channel, simultaneous transmission to multiple
users by joint beamforming and scheduling is capable of achieving high
throughput, which grows double logarithmically with the number of users. The
sum rate for channel state information (CSI) feedback, however, increases
linearly with the nu... |
cs/0609041 | Primitive operations for the construction and reorganization of
minimally persistent formations | cs.MA | In this paper, we study the construction and transformation of
two-dimensional persistent graphs. Persistence is a generalization to directed
graphs of the undirected notion of rigidity. In the context of moving
autonomous agent formations, persistence characterizes the efficacy of a
directed structure of unilateral ... |
cs/0609042 | On Divergence-Power Inequalities | cs.IT math.IT | Expressions for (EPI Shannon type) Divergence-Power Inequalities (DPI) in two
cases (time-discrete and band-limited time-continuous) of stationary random
processes are given. The new expressions connect the divergence rate of the sum
of independent processes, the individual divergence rate of each process, and
their ... |
cs/0609043 | Challenging the principle of compositionality in interpreting natural
language texts | cs.CL | The paper aims at emphasizing that, even relaxed, the hypothesis of
compositionality has to face many problems when used for interpreting natural
language texts. Rather than fixing these problems within the compositional
framework, we believe that a more radical change is necessary, and propose
another approach.
|
cs/0609044 | The role of time in considering collections | cs.CL | The paper concerns the understanding of plurals in the framework of
Artificial Intelligence and emphasizes the role of time. The construction of
collection(s) and their evolution across time is often crucial and has to be
accounted for. The paper contrasts a "de dicto" collection where the collection
can be considere... |
cs/0609045 | Metric entropy in competitive on-line prediction | cs.LG | Competitive on-line prediction (also known as universal prediction of
individual sequences) is a strand of learning theory avoiding making any
stochastic assumptions about the way the observations are generated. The
predictor's goal is to compete with a benchmark class of prediction rules,
which is often a proper Ban... |
cs/0609046 | Exhausting Error-Prone Patterns in LDPC Codes | cs.IT cs.DS math.IT | It is proved in this work that exhaustively determining bad patterns in
arbitrary, finite low-density parity-check (LDPC) codes, including stopping
sets for binary erasure channels (BECs) and trapping sets (also known as
near-codewords) for general memoryless symmetric channels, is an NP-complete
problem, and efficie... |
cs/0609049 | Scanning and Sequential Decision Making for Multi-Dimensional Data -
Part I: the Noiseless Case | cs.IT cs.LG math.IT | We investigate the problem of scanning and prediction ("scandiction", for
short) of multidimensional data arrays. This problem arises in several aspects
of image and video processing, such as predictive coding, for example, where an
image is compressed by coding the error sequence resulting from scandicting it.
Thus,... |
cs/0609050 | Exact Spectral Analysis of Single-h and Multi-h CPM Signals through PAM
decomposition and Matrix Series Evaluation | cs.IT math.IT | In this paper we address the problem of closed-form spectral evaluation of
CPM. We show that the multi-h CPM signal can be conveniently generated by a PTI
SM. The output is governed by a Markov chain with the unusual peculiarity of
being cyclostationary and reducible; this holds also in the single-h context.
Judiciou... |
cs/0609051 | Multilingual person name recognition and transliteration | cs.CL cs.IR | We present an exploratory tool that extracts person names from multilingual
news collections, matches name variants referring to the same person, and
infers relationships between people based on the co-occurrence of their names
in related news. A novel feature is the matching of name variants across
languages and wri... |
cs/0609052 | Undecidability of the unification and admissibility problems for modal
and description logics | cs.LO cs.AI | We show that the unification problem `is there a substitution instance of a
given formula that is provable in a given logic?' is undecidable for basic
modal logics K and K4 extended with the universal modality. It follows that the
admissibility problem for inference rules is undecidable for these logics as
well. Thes... |
cs/0609053 | Navigating multilingual news collections using automatically extracted
information | cs.CL cs.IR | We are presenting a text analysis tool set that allows analysts in various
fields to sieve through large collections of multilingual news items quickly
and to find information that is of relevance to them. For a given document
collection, the tool set automatically clusters the texts into groups of
similar articles, ... |
cs/0609054 | High Data-Rate Single-Symbol ML Decodable Distributed STBCs for
Cooperative Networks | cs.IT math.IT | High data-rate Distributed Orthogonal Space-Time Block Codes (DOSTBCs) which
achieve the single-symbol decodability and full diversity order are proposed in
this paper. An upper bound of the data-rate of the DOSTBC is derived and it is
approximately twice larger than that of the conventional repetition-based
cooperat... |
cs/0609055 | Coding for Additive White Noise Channels with Feedback Corrupted by
Uniform Quantization or Bounded Noise | cs.IT math.IT | We present simple coding strategies, which are variants of the
Schalkwijk-Kailath scheme, for communicating reliably over additive white noise
channels in the presence of corrupted feedback. More specifically, we consider
a framework comprising an additive white forward channel and a backward link
which is used for f... |
cs/0609056 | Matrix Games, Linear Programming, and Linear Approximation | cs.GT cs.AI | The following four classes of computational problems are equivalent: solving
matrix games, solving linear programs, best $l^{\infty}$ linear approximation,
best $l^1$ linear approximation.
|
cs/0609058 | The JRC-Acquis: A multilingual aligned parallel corpus with 20+
languages | cs.CL | We present a new, unique and freely available parallel corpus containing
European Union (EU) documents of mostly legal nature. It is available in all 20
official EUanguages, with additional documents being available in the languages
of the EU candidate countries. The corpus consists of almost 8,000 documents
per lang... |
cs/0609059 | Automatic annotation of multilingual text collections with a conceptual
thesaurus | cs.CL cs.IR | Automatic annotation of documents with controlled vocabulary terms
(descriptors) from a conceptual thesaurus is not only useful for document
indexing and retrieval. The mapping of texts onto the same thesaurus
furthermore allows to establish links between similar documents. This is also a
substantial requirement of t... |
cs/0609060 | Automatic Identification of Document Translations in Large Multilingual
Document Collections | cs.CL cs.IR | Texts and their translations are a rich linguistic resource that can be used
to train and test statistics-based Machine Translation systems and many other
applications. In this paper, we present a working system that can identify
translations and other very similar documents among a large number of
candidates, by rep... |
cs/0609061 | Cross-lingual keyword assignment | cs.CL cs.IR | This paper presents a language-independent approach to controlled vocabulary
keyword assignment using the EUROVOC thesaurus. Due to the multilingual nature
of EUROVOC, the keywords for a document written in one language can be
displayed in all eleven official European Union languages. The mapping of
documents written... |
cs/0609063 | Extending an Information Extraction tool set to Central and Eastern
European languages | cs.CL cs.IR | In a highly multilingual and multicultural environment such as in the
European Commission with soon over twenty official languages, there is an
urgent need for text analysis tools that use minimal linguistic knowledge so
that they can be adapted to many languages without much human effort. We are
presenting two such ... |
cs/0609064 | Exploiting multilingual nomenclatures and language-independent text
features as an interlingua for cross-lingual text analysis applications | cs.CL cs.IR | We are proposing a simple, but efficient basic approach for a number of
multilingual and cross-lingual language technology applications that are not
limited to the usual two or three languages, but that can be applied with
relatively little effort to larger sets of languages. The approach consists of
using existing m... |
cs/0609065 | Geocoding multilingual texts: Recognition, disambiguation and
visualisation | cs.CL cs.IR | We are presenting a method to recognise geographical references in free text.
Our tool must work on various languages with a minimum of language-dependent
resources, except a gazetteer. The main difficulty is to disambiguate these
place names by distinguishing places from persons and by selecting the most
likely plac... |
cs/0609066 | Building and displaying name relations using automatic unsupervised
analysis of newspaper articles | cs.CL cs.IR | We present a tool that, from automatically recognised names, tries to infer
inter-person relations in order to present associated people on maps. Based on
an in-house Named Entity Recognition tool, applied on clusters of an average of
15,000 news articles per day, in 15 different languages, we build a knowledge
base ... |
cs/0609067 | A tool set for the quick and efficient exploration of large document
collections | cs.CL cs.IR | We are presenting a set of multilingual text analysis tools that can help
analysts in any field to explore large document collections quickly in order to
determine whether the documents contain information of interest, and to find
the relevant text passages. The automatic tool, which currently exists as a
fully funct... |
cs/0609071 | A kernel method for canonical correlation analysis | cs.LG cs.CV | Canonical correlation analysis is a technique to extract common features from
a pair of multivariate data. In complex situations, however, it does not
extract useful features because of its linearity. On the other hand, kernel
method used in support vector machine is an efficient approach to improve such
a linear met... |
cs/0609073 | Optimal power allocation for downlink cooperative cellular networks | cs.IT math.IT | This paper has been withdrawn by the author
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.