id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0807.3396 | Universal Denoising of Discrete-time Continuous-Amplitude Signals | cs.IT cs.LG math.IT math.ST stat.TH | We consider the problem of reconstructing a discrete-time signal (sequence)
with continuous-valued components corrupted by a known memoryless channel. When
performance is measured using a per-symbol loss function satisfying mild
regularity conditions, we develop a sequence of denoisers that, although
independent of t... |
0807.3483 | Implementing general belief function framework with a practical
codification for low complexity | cs.AI | In this chapter, we propose a new practical codification of the elements of
the Venn diagram in order to easily manipulate the focal elements. In order to
reduce the complexity, the eventual constraints must be integrated in the
codification at the beginning. Hence, we only consider a reduced hyper power
set $D_r^\Th... |
0807.3566 | Stabilizer Quantum Codes: A Unified View based on Forney-style Factor
Graphs | quant-ph cs.IT math.IT | Quantum error-correction codes (QECCs) are a vital ingredient of quantum
computation and communication systems. In that context it is highly desirable
to design QECCs that can be represented by graphical models which possess a
structure that enables efficient and close-to-optimal iterative decoding. In
this paper we ... |
0807.3574 | Mode Switching for MIMO Communication Based on Delay and Channel
Quantization | cs.IT math.IT | This paper has been withdrawn by the author as a major revision is made and a
new version is uploaded at arXiv:0812.3120
|
0807.3582 | Error Correction Capability of Column-Weight-Three LDPC Codes: Part II | cs.IT math.IT | The relation between the girth and the error correction capability of
column-weight-three LDPC codes is investigated. Specifically, it is shown that
the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a
Tanner graph of girth $g \geq 10$.
|
0807.3590 | Counting the Faces of Randomly-Projected Hypercubes and Orthants, with
Applications | math.MG cs.IT math.IT math.OC math.PR | Let $A$ be an $n$ by $N$ real valued random matrix, and $\h$ denote the
$N$-dimensional hypercube. For numerous random matrix ensembles, the expected
number of $k$-dimensional faces of the random $n$-dimensional zonotope $A\h$
obeys the formula $E f_k(A\h) /f_k(\h) = 1-P_{N-n,N-k}$, where $P_{N-n,N-k}$ is
a fair-coin... |
0807.3593 | An outer bound for 2-receiver discrete memoryless broadcast channels | cs.IT math.IT | An outer bound to the two-receiver discrete memoryless broadcast channel is
presented. We compare it to the known outer bounds and show that the outer
bound presented is at least as tight as the existing bounds.
|
0807.3622 | TuLiPA: Towards a Multi-Formalism Parsing Environment for Grammar
Engineering | cs.CL | In this paper, we present an open-source parsing environment (Tuebingen
Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar
(RCG) as a pivot formalism, thus opening the way to the parsing of several
mildly context-sensitive formalisms. This environment currently supports
tree-based grammar... |
0807.3669 | A new probabilistic transformation of belief mass assignment | cs.AI | In this paper, we propose in Dezert-Smarandache Theory (DSmT) framework, a
new probabilistic transformation, called DSmP, in order to build a subjective
probability measure from any basic belief assignment defined on any model of
the frame of discernment. Several examples are given to show how the DSmP
transformation... |
0807.3755 | Approximating Document Frequency with Term Count Values | cs.IR cs.DL | For bounded datasets such as the TREC Web Track (WT10g) the computation of
term frequency (TF) and inverse document frequency (IDF) is not difficult.
However, when the corpus is the entire web, direct IDF calculation is
impossible and values must instead be estimated. Most available datasets
provide values for term c... |
0807.3795 | Relational Lattice Axioms | cs.DB | Relational lattice is a formal mathematical model for Relational algebra. It
reduces the set of six classic relational algebra operators to two: natural
join and inner union. We continue to investigate Relational lattice properties
with emphasis onto axiomatic definition. New results include additional axioms,
equati... |
0807.3803 | Quantum Convolutional Coding with Shared Entanglement: General Structure | quant-ph cs.IT math.IT | We present a general theory of entanglement-assisted quantum convolutional
coding. The codes have a convolutional or memory structure, they assume that
the sender and receiver share noiseless entanglement prior to quantum
communication, and they are not restricted to possess the
Calderbank-Shor-Steane structure as in... |
0807.3806 | On the Rate of Channel Polarization | cs.IT math.IT | It is shown that for any binary-input discrete memoryless channel $W$ with
symmetric capacity $I(W)$ and any rate $R <I(W)$, the probability of block
decoding error for polar coding under successive cancellation decoding
satisfies $P_e \le 2^{-N^\beta}$ for any $\beta<\frac12$ when the block-length
$N$ is large enoug... |
0807.3845 | Formal semantics of language and the Richard-Berry paradox | cs.CL cs.CC cs.LO | The classical logical antinomy known as Richard-Berry paradox is combined
with plausible assumptions about the size i.e. the descriptional complexity of
Turing machines formalizing certain sentences, to show that formalization of
language leads to contradiction.
|
0807.3908 | A Distributed Process Infrastructure for a Distributed Data Structure | cs.AI cs.DL | The Resource Description Framework (RDF) is continuing to grow outside the
bounds of its initial function as a metadata framework and into the domain of
general-purpose data modeling. This expansion has been facilitated by the
continued increase in the capacity and speed of RDF database repositories known
as triple-s... |
0807.3913 | DMT of weighted Parallel Channels: Application to Broadcast Channel | cs.IT math.IT | In a broadcast channel with random packet arrival and transmission queues,
the stability of the system is achieved by maximizing a weighted sum rate
capacity with suitable weights that depend on the queue size. The weighted sum
rate capacity using Dirty Paper Coding (DPC) and Zero Forcing (ZF) is
asymptotically equiv... |
0807.3917 | Channel polarization: A method for constructing capacity-achieving codes
for symmetric binary-input memoryless channels | cs.IT math.IT | A method is proposed, called channel polarization, to construct code
sequences that achieve the symmetric capacity $I(W)$ of any given binary-input
discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest
rate achievable subject to using the input letters of the channel with equal
probability. C... |
0807.3991 | Codes Associated with Special Linear Groups and Power Moments of
Multi-dimensional Kloosterman Sums | math.NT cs.IT math.IT | In this paper, we construct the binary linear codes $C(SL(n,q))$ associated
with finite special linear groups $SL(n,q)$, with both \emph{n,q} powers of
two. Then, via Pless power moment identity and utilizing our previous result on
the explicit expression of the Gauss sum for $SL(n,q)$, we obtain a recursive
formula ... |
0807.4009 | Statistical mechanics of lossy compression for non-monotonic multilayer
perceptrons | cond-mat.stat-mech cond-mat.dis-nn cs.IT math.IT | A lossy data compression scheme for uniformly biased Boolean messages is
investigated via statistical mechanics techniques. We utilize tree-like
committee machine (committee tree) and tree-like parity machine (parity tree)
whose transfer functions are non-monotonic. The scheme performance at the
infinite code length ... |
0807.4074 | Low-delay, Low-PAPR, High-rate Non-square Complex Orthogonal Designs | cs.IT math.IT | The maximal rate for non-square Complex Orthogonal Designs (CODs) with $n$
transmit antennas is ${1/2}+\frac{1}{n}$ if $n$ is even and
${1/2}+\frac{1}{n+1}$ if $n$ is odd, which are close to 1/2 for large values of
$n.$ A class of maximal rate non-square CODs have been constructed by Liang
(IEEE Trans. Inform. Theory... |
0807.4128 | Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity | cs.IT math.IT | Space-Time Block Codes from square complex orthogonal designs (SCOD) have
been extensively studied and most of the existing SCODs contain large number of
zero. The zeros in the designs result in high peak-to-average power ratio
(PAPR) and also impose a severe constraint on hardware implementation of the
code when tur... |
0807.4198 | Positive factor networks: A graphical framework for modeling
non-negative sequential data | cs.LG | We present a novel graphical framework for modeling non-negative sequential
data with hierarchical structure. Our model corresponds to a network of coupled
non-negative matrix factorization (NMF) modules, which we refer to as a
positive factor network (PFN). The data model is linear, subject to
non-negativity constra... |
0807.4247 | Z2Z4-linear codes: rank and kernel | cs.IT cs.DM math.IT | A code C is Z2Z4-additive if the set of coordinates can be partitioned into
two subsets X and Y such that the punctured code of C by deleting the
coordinates outside X (respectively, Y) is a binary linear code (respectively,
a quaternary linear code). In this paper, the rank and dimension of the kernel
for Z2Z4-linea... |
0807.4322 | Carnot in the Information Age: Discrete Symmetric Channels | cond-mat.stat-mech cs.IT math.IT | Modeling communication channels as thermal systems results in Hamiltonians
which are an explicit function of the temperature. The first two authors have
recently generalized the second thermodynamic law to encompass systems with
temperature-dependent energy levels, $dQ=TdS+<d\mathcal{E}/dT>dT$, where
{$<\cdot>$} deno... |
0807.4325 | Schroedinger-like PageRank equation and localization in the WWW | physics.soc-ph cond-mat.stat-mech cs.IR physics.data-an | The WorldWide Web is one of the most important communication systems we use
in our everyday life. Despite its central role, the growth and the development
of the WWW is not controlled by any central authority. This situation has
created a huge ensemble of connections whose complexity can be fruitfully
described and q... |
0807.4345 | Avoider robot design to dim the fire with dt basic mini system | cs.RO | Avoider robot is mean robot who is designed to avoid the block in around.
Except that, this robot is also added by an addition application to dim the
fire. This robot is made with ultrasonic sensor PING. This sensor is set on the
front, right and left from robot. This sensor is used robot to look for the
right street... |
0807.4417 | On Introspection, Metacognitive Control and Augmented Data Mining Live
Cycles | cs.AI | We discuss metacognitive modelling as an enhancement to cognitive modelling
and computing. Metacognitive control mechanisms should enable AI systems to
self-reflect, reason about their actions, and to adapt to new situations. In
this respect, we propose implementation details of a knowledge taxonomy and an
augmented ... |
0807.4478 | An Image-Based Sensor System for Autonomous Rendez-Vous with
Uncooperative Satellites | cs.CV cs.AI | In this paper are described the image processing algorithms developed by
SENER, Ingenieria y Sistemas to cope with the problem of image-based,
autonomous rendez-vous (RV) with an orbiting satellite. The methods developed
have a direct application in the OLEV (Orbital Life Extension Extension
Vehicle) mission. OLEV is... |
0807.4494 | Fast, exact (but unstable) spin spherical harmonic transforms | astro-ph cs.IT math.IT | In many applications data are measured or defined on a spherical manifold;
spherical harmonic transforms are then required to access the frequency content
of the data. We derive algorithms to perform forward and inverse spin spherical
harmonic transforms for functions of arbitrary spin number. These algorithms
involv... |
0807.4548 | Compound Multiple Access Channels with Partial Cooperation | cs.IT math.IT | A two-user discrete memoryless compound multiple access channel with a common
message and conferencing decoders is considered. The capacity region is
characterized in the special cases of physically degraded channels and
unidirectional cooperation, and achievable rate regions are provided for the
general case. The re... |
0807.4580 | A Logical Model and Data Placement Strategies for MEMS Storage Devices | cs.DB | MEMS storage devices are new non-volatile secondary storages that have
outstanding advantages over magnetic disks. MEMS storage devices, however, are
much different from magnetic disks in the structure and access characteristics.
They have thousands of heads called probe tips and provide the following two
major acces... |
0807.4581 | Robust Recovery of Signals From a Structured Union of Subspaces | nlin.CG cs.IT math.IT nlin.SI | Traditional sampling theories consider the problem of reconstructing an
unknown signal $x$ from a series of samples. A prevalent assumption which often
guarantees recovery from the given measurements is that $x$ lies in a known
subspace. Recently, there has been growing interest in nonlinear but structured
signal mod... |
0807.4618 | AceWiki: A Natural and Expressive Semantic Wiki | cs.HC cs.AI | We present AceWiki, a prototype of a new kind of semantic wiki using the
controlled natural language Attempto Controlled English (ACE) for representing
its content. ACE is a subset of English with a restricted grammar and a formal
semantics. The use of ACE has two important advantages over existing semantic
wikis. Fi... |
0807.4619 | Guaranteed Cost LQG Control of Uncertain Linear Quantum Stochastic
Systems | quant-ph cs.SY math.OC | In this paper, we formulate and solve a guaranteed cost control problem for a
class of uncertain linear stochastic quantum systems. For these quantum
systems, a connection with an associated classical (non-quantum) system is
first established. Using this connection, the desired guaranteed cost results
are established... |
0807.4620 | A Compositional Query Algebra for Second-Order Logic and Uncertain
Databases | cs.DB cs.LO | World-set algebra is a variable-free query language for uncertain databases.
It constitutes the core of the query language implemented in MayBMS, an
uncertain database system. This paper shows that world-set algebra captures
exactly second-order logic over finite structures, or equivalently, the
polynomial hierarchy.... |
0807.4623 | AceWiki: Collaborative Ontology Management in Controlled Natural
Language | cs.HC cs.AI | AceWiki is a prototype that shows how a semantic wiki using controlled
natural language - Attempto Controlled English (ACE) in our case - can make
ontology management easy for everybody. Sentences in ACE can automatically be
translated into first-order logic, OWL, or SWRL. AceWiki integrates the OWL
reasoner Pellet a... |
0807.4671 | Codes Associated with $O^+(2n,2^r)$ and Power Moments of Kloosterman
Sums | math.NT cs.IT math.IT | In this paper, we construct three binary linear codes $C(SO^+(2,q))$,
$C(O^+(2,q))$, $C(SO^+(4,q))$, respectively associated with the orthogonal
groups $SO^+(2,q)$, $O^+(2,q)$, $SO^+(4,q)$, with $q$ powers of two. Then we
obtain recursive formulas for the power moments of Kloosterman and
2-dimensional Kloosterman sum... |
0807.4680 | Hacia una teoria de unificacion para los comportamientos cognitivos | cs.AI | Each cognitive science tries to understand a set of cognitive behaviors. The
structuring of knowledge of this nature's aspect is far from what it can be
expected about a science. Until now universal standard consistently describing
the set of cognitive behaviors has not been found, and there are many questions
about ... |
0807.4701 | An image processing analysis of skin textures | cs.CV | Colour and coarseness of skin are visually different. When image processing
is involved in the skin analysis, it is important to quantitatively evaluate
such differences using texture features. In this paper, we discuss a texture
analysis and measurements based on a statistical approach to the pattern
recognition. Gr... |
0807.4753 | Counterexamples to the maximal p-norm multiplicativity conjecture for
all p > 1 | quant-ph cs.IT math-ph math.IT math.MP | For all p > 1, we demonstrate the existence of quantum channels with
non-multiplicative maximal output p-norms. Equivalently, for all p >1, the
minimum output Renyi entropy of order p of a quantum channel is not additive.
The violations found are large; in all cases, the minimum output Renyi entropy
of order p for a ... |
0807.4770 | Channel Coding and Decoding in a Relay System Operated with Physical
layer Network Coding | cs.NI cs.IT math.IT | Physical-layer Network Coding (PNC) can significantly improve the throughput
of wireless two way relay channel (TWRC) by allowing the two end nodes to
transmit messages to the relay simultaneously. To achieve reliable
communication, channel coding could be applied on top of PNC. This paper
investigates link-by-link c... |
0807.4846 | Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and
Ferrers Diagrams | cs.IT math.IT | Coding in the projective space has received recently a lot of attention due
to its application in network coding. Reduced row echelon form of the linear
subspaces and Ferrers diagram can play a key role for solving coding problems
in the projective space. In this paper we propose a method to design
error-correcting c... |
0807.4881 | Capacity and Performance of Adaptive MIMO System Based on Beam-Nulling | cs.IT math.IT | In this paper, we propose a scheme called "beam-nulling" for MIMO adaptation.
In the beam-nulling scheme, the eigenvector of the weakest subchannel is fed
back and then signals are sent over a generated subspace orthogonal to the
weakest subchannel. Theoretical analysis and numerical results show that the
capacity of... |
0807.4995 | Algebraic Soft-Decision Decoding of Hermitian Codes | cs.IT math.IT | An algebraic soft-decision decoder for Hermitian codes is presented. We apply
Koetter and Vardy's soft-decision decoding framework, now well established for
Reed-Solomon codes, to Hermitian codes. First we provide an algebraic
foundation for soft-decision decoding. Then we present an interpolation
algorithm finding t... |
0807.5091 | Message-passing for Maximum Weight Independent Set | cs.AI cs.IT math.IT | We investigate the use of message-passing algorithms for the problem of
finding the max-weight independent set (MWIS) in a graph. First, we study the
performance of the classical loopy max-product belief propagation. We show that
each fixed point estimate of max-product can be mapped in a natural way to an
extreme po... |
0807.5120 | Accelerated Option Pricing in Multiple Scenarios | cs.CE | This paper covers a massive acceleration of Monte-Carlo based pricing method
for financial products and financial derivatives. The method is applicable in
risk management settings, where a financial product has to be priced under a
number of potential future scenarios. Instead of starting a separate nested
Monte Carl... |
0808.0012 | Lectures on Probability, Entropy, and Statistical Physics | physics.data-an cond-mat.stat-mech cs.IT math.IT math.ST physics.gen-ph stat.TH | These lectures deal with the problem of inductive inference, that is, the
problem of reasoning under conditions of incomplete information. Is there a
general method for handling uncertainty? Or, at least, are there rules that
could in principle be followed by an ideally rational mind when discussing
scientific matter... |
0808.0036 | Why Does a Kronecker Model Result in Misleading Capacity Estimates? | cs.IT math.IT | Many recent works that study the performance of multi-input multi-output
(MIMO) systems in practice assume a Kronecker model where the variances of the
channel entries, upon decomposition on to the transmit and the receive
eigen-bases, admit a separable form. Measurement campaigns, however, show that
the Kronecker mo... |
0808.0037 | An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO
Networks | cs.IT math.IT | This paper considers the problem of selecting either routes that consist of
long hops or routes that consist of short hops in a network of multiple-antenna
nodes, where each transmitting node employs spatial multiplexing. This
distance-dependent route selection problem is approached from the viewpoint of
energy effic... |
0808.0056 | I'm sorry to say, but your understanding of image processing
fundamentals is absolutely wrong | cs.AI cs.CV cs.IR cs.RO q-bio.NC | The ongoing discussion whether modern vision systems have to be viewed as
visually-enabled cognitive systems or cognitively-enabled vision systems is
groundless, because perceptual and cognitive faculties of vision are separate
components of human (and consequently, artificial) information processing
system modeling.... |
0808.0075 | Optimal Beamforming for Two-Way Multi-Antenna Relay Channel with
Analogue Network Coding | cs.IT math.IT | This paper studies the wireless two-way relay channel (TWRC), where two
source nodes, S1 and S2, exchange information through an assisting relay node,
R. It is assumed that R receives the sum signal from S1 and S2 in one
time-slot, and then amplifies and forwards the received signal to both S1 and
S2 in the next time... |
0808.0112 | Mathematical Structure of Quantum Decision Theory | cs.AI math-ph math.MP quant-ph | One of the most complex systems is the human brain whose formalized
functioning is characterized by decision theory. We present a "Quantum Decision
Theory" of decision making, based on the mathematical theory of separable
Hilbert spaces. This mathematical structure captures the effect of
superposition of composite pr... |
0808.0234 | DMT of Multi-hop Cooperative Networks - Part I: Basic Results | cs.IT math.IT | In this two-part paper, the DMT of cooperative multi-hop networks is
examined. The focus is on single-source single-sink (ss-ss) multi-hop relay
networks having slow-fading links and relays that potentially possess multiple
antennas. The present paper examines the two end-points of the DMT of
full-duplex networks. In... |
0808.0235 | DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks
with Full-Duplex Performance | cs.IT math.IT | We consider single-source single-sink (ss-ss) multi-hop relay networks, with
slow-fading links and single-antenna half-duplex relay nodes. In a companion
paper, we established some basic results which laid the foundation for the
results presented here. In the present paper, we consider two families of
networks of hal... |
0808.0272 | Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for
Error-Performances of LDPC and LT Codes over Binary Erasure Channels | cs.IT cs.DM math.CO math.IT | We present Kovalenko's full-rank limit as a tight lower bound for decoding
error probability of LDPC codes and LT codes over BEC. From the limit, we
derive a full-rank overhead as a lower bound for stable overheads for
successful maximum-likelihood decoding of the codes.
|
0808.0291 | One shot schemes for decentralized quickest change detection | cs.IT math.IT | This work considers the problem of quickest detection with N distributed
sensors that receive continuous sequential observations from the environment.
These sensors employ cumulative sum (CUSUM) strategies and communicate to a
central fusion center by one shot schemes. One shot schemes are schemes in
which the sensor... |
0808.0374 | A 8 bits Pipeline Analog to Digital Converter Design for High Speed
Camera Application | cs.RO cs.CV | - This paper describes a pipeline analog-to-digital converter is implemented
for high speed camera. In the pipeline ADC design, prime factor is designing
operational amplifier with high gain so ADC have been high speed. The other
advantage of pipeline is simple on concept, easy to implement in layout and
have flexibi... |
0808.0387 | Design and Implementation a 8 bits Pipeline Analog to Digital Converter
in the Technology 0.6 \mu m CMOS Process | cs.RO cs.CV | This paper describes a 8 bits, 20 Msamples/s pipeline analog-to-digital
converter implemented in 0.6 \mu m CMOS technology with a total power
dissipation of 75.47 mW. Circuit techniques used include a precise comparator,
operational amplifier and clock management. A switched capacitor is used to
sample and multiplyin... |
0808.0518 | Building a terminology network for search: the KoMoHe project | cs.DL cs.DB | The paper reports about results on the GESIS-IZ project "Competence Center
Modeling and Treatment of Semantic Heterogeneity" (KoMoHe). KoMoHe supervised a
terminology mapping effort, in which 'cross-concordances' between major
controlled vocabularies were organized, created and managed. In this paper we
describe the ... |
0808.0521 | Logics for the Relational Syllogistic | cs.LO cs.CC cs.CL | The Aristotelian syllogistic cannot account for the validity of many
inferences involving relational facts. In this paper, we investigate the
prospects for providing a relational syllogistic. We identify several fragments
based on (a) whether negation is permitted on all nouns, including those in the
subject of a sen... |
0808.0544 | Generalized Cross-correlation Properties of Chu Sequences | cs.IT math.IT | In this paper, we analyze the cross-correlation properties for Chu sequences,
which provide information on the distribution of the maximum magnitudes of the
cross-correlation function. Furthermore, we can obtain the number of available
sequences for a given maximum magnitude of the cross-correlation function and
the ... |
0808.0548 | How could the replica method improve accuracy of performance assessment
of channel coding? | cs.IT math.IT | We explore the relation between the techniques of statistical mechanics and
information theory for assessing the performance of channel coding. We base our
study on a framework developed by Gallager in {\em IEEE Trans. Inform. Theory}
{\bf 11}, 3 (1965), where the minimum decoding error probability is
upper-bounded b... |
0808.0549 | Resource Allocation of MU-OFDM Based Cognitive Radio Systems Under
Partial Channel State Information | cs.IT cs.NE math.CO math.IT | This paper has been withdrawn by the author due to some errors.
|
0808.0556 | Logic Engines as Interactors | cs.PL cs.MA | We introduce a new programming language construct, Interactors, supporting
the agent-oriented view that programming is a dialog between simple,
self-contained, autonomous building blocks.
We define Interactors as an abstraction of answer generation and refinement
in Logic Engines resulting in expressive language ex... |
0808.0558 | Communication Through Jamming over a Slotted ALOHA Channel | cs.IT math.IT | This work derives bounds on the jamming capacity of a slotted ALOHA system. A
system with n legitimate users, each with a Bernoulli arrival process is
considered. Packets are temporarily stored at the corresponding user queues,
and a slotted ALOHA strategy is used for packet transmissions over the shared
channel. The... |
0808.0596 | On row-by-row coding for 2-D constraints | cs.IT math.IT | A constant-rate encoder--decoder pair is presented for a fairly large family
of two-dimensional (2-D) constraints. Encoding and decoding is done in a
row-by-row manner, and is sliding-block decodable.
Essentially, the 2-D constraint is turned into a set of independent and
relatively simple one-dimensional (1-D) con... |
0808.0684 | 9-variable Boolean Functions with Nonlinearity 242 in the Generalized
Rotation Class | cs.CR cs.IT math.IT | In 2006, 9-variable Boolean functions having nonlinearity 241, which is
strictly greater than the bent concatenation bound of 240, have been discovered
in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra
and Yucel. To improve this nonlinearity result, we have firstly defined some
subsets of ... |
0808.0745 | Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ | cs.IT math.IT | This paper studies the problem of relay-assisted user scheduling for downlink
wireless transmission. The base station or access point employs hybrid
automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to
serve a set of mobile users. By minimizing a cost function of the queue lengths
at the ba... |
0808.0768 | Foundations of Information Theory | cs.IT math.IT | Information is the basic concept of information theory. However, there is no
definition of this concept that can encompass all uses of the term information
in information theories and beyond. Many question a possibility of such a
definition. However, foundations of information theory developed in the context
of the g... |
0808.0845 | Mutual information is copula entropy | cs.IT cs.LG math.IT math.ST stat.TH | We prove that mutual information is actually negative copula entropy, based
on which a method for mutual information estimation is proposed.
|
0808.0876 | Capacity Regions and Bounds for a Class of Z-interference Channels | cs.IT math.IT | We define a class of Z-interference channels for which we obtain a new upper
bound on the capacity region. The bound exploits a technique first introduced
by Korner and Marton. A channel in this class has the property that, for the
transmitter-receiver pair that suffers from interference, the conditional
output entro... |
0808.0948 | Capacity of a Class of Diamond Channels | cs.IT math.IT | We study a special class of diamond channels which was introduced by Schein
in 2001. In this special class, each diamond channel consists of a transmitter,
a noisy relay, a noiseless relay and a receiver. We prove the capacity of this
class of diamond channels by providing an achievable scheme and a converse. The
cap... |
0808.0954 | Achievable rate regions for bi-directional relaying | cs.IT math.IT | In a bi-directional relay channel, two nodes wish to exchange independent
messages over a shared wireless half-duplex channel with the help of a relay.
In this paper, we derive achievable rate regions for four new half-duplex
protocols and compare these to four existing half-duplex protocols and outer
bounds. In time... |
0808.0973 | Text Modeling using Unsupervised Topic Models and Concept Hierarchies | cs.AI cs.IR | Statistical topic models provide a general data-driven framework for
automated discovery of high-level knowledge from large collections of text
documents. While topic models can potentially discover a broad range of themes
in a data set, the interpretability of the learned topics is not always ideal.
Human-defined co... |
0808.0978 | Cognitive MIMO Radio: A Competitive Optimality Design Based on Subspace
Projections | cs.IT cs.GT math.IT | Cognitive MIMO Radio: A Competitive Optimality Design Based on Subspace
Projections
|
0808.0987 | A new graph perspective on max-min fairness in Gaussian parallel
channels | cs.IT cs.DM math.CO math.IT | In this work we are concerned with the problem of achieving max-min fairness
in Gaussian parallel channels with respect to a general performance function,
including channel capacity or decoding reliability as special cases. As our
central results, we characterize the laws which determine the value of the
achievable m... |
0808.1000 | Fitness Landscape Analysis for Dynamic Resource Allocation in Multiuser
OFDM Based Cognitive Radio Systems | cs.IT cs.NE math.CO math.IT | This paper has been withdrawn.
|
0808.1007 | On Quantum Capacity of Compound Channels | quant-ph cs.IT math-ph math.IT math.MP | In this paper we address the issue of universal or robust communication over
quantum channels. Specifically, we consider memoryless communication scenario
with channel uncertainty which is an analog of compound channel in classical
information theory. We determine the quantum capacity of finite compound
channels and ... |
0808.1125 | Verified Null-Move Pruning | cs.AI | In this article we review standard null-move pruning and introduce our
extended version of it, which we call verified null-move pruning. In verified
null-move pruning, whenever the shallow null-move search indicates a fail-high,
instead of cutting off the search from the current node, the search is
continued with red... |
0808.1211 | Commonsense Knowledge, Ontology and Ordinary Language | cs.AI cs.CL | Over two decades ago a "quite revolution" overwhelmingly replaced
knowledgebased approaches in natural language processing (NLP) by quantitative
(e.g., statistical, corpus-based, machine learning) methods. Although it is our
firm belief that purely quantitative approaches cannot be the only paradigm for
NLP, dissatis... |
0808.1247 | Self-Motions of General 3-RPR Planar Parallel Robots | cs.RO | This paper studies the kinematic geometry of general 3-RPR planar parallel
robots with actuated base joints. These robots, while largely overlooked, have
simple direct kinematics and large singularity-free workspace. Furthermore,
their kinematic geometry is the same as that of a newly developed parallel
robot with SC... |
0808.1368 | On some deterministic dictionaries supporting sparsity | cs.IT math.IT | We describe a new construction of an incoherent dictionary, referred to as
the oscillator dictionary, which is based on considerations in the
representation theory of finite groups. The oscillator dictionary consists of
order of p^5 unit vectors in a Hilbert space of dimension p, where p is an odd
prime, whose pairwi... |
0808.1378 | A Novel Symbolic Type Neural Network Model- Application to River Flow
Forecasting | cs.NE cs.SC | In this paper we introduce a new symbolic type neural tree network called
symbolic function network (SFN) that is based on using elementary functions to
model systems in a symbolic form. The proposed formulation permits feature
selection, functional selection, and flexible structure. We applied this model
on the Rive... |
0808.1400 | A Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs | cs.IT math.IT | Space-time block codes (STBCs) from non-square complex orthogonal designs are
bandwidth efficient when compared with those from square real/complex
orthogonal designs. Though there exists rate-1 ROD for any number of transmit
antennas, rate-1 complex orthogonal designs (COD) does not exist for more than
2 transmit an... |
0808.1417 | The finite harmonic oscillator and its associated sequences | cs.IT cs.CR cs.DM math-ph math.GR math.IT math.MP math.NT math.PR math.QA math.RT math.SG quant-ph | A system of functions (signals) on the finite line, called the oscillator
system, is described and studied. Applications of this system for discrete
radar and digital communication theory are explained.
Keywords: Weil representation, commutative subgroups, eigenfunctions, random
behavior, deterministic construction... |
0808.1455 | Personal Semantic Web Through A Space Based Computing Environment | cs.NI cs.MA | The Semantic Web through technologies such to support the canonical
representation information and presenting it to users in a method by which its
meaning can be understood or at least communi- cated and interpreted by all
parties. As the Semantic Web evolves into more of a computing platform rather
than an informati... |
0808.1495 | The finite harmonic oscillator and its applications to sequences,
communication and radar | cs.IT math.IT | A novel system, called the oscillator system, consisting of order of p^3
functions (signals) on the finite field F_p; with p an odd prime, is described
and studied. The new functions are proved to satisfy good auto-correlation,
cross-correlation and low peak-to-average power ratio properties. Moreover, the
oscillator... |
0808.1508 | Comparison between CPBPV, ESC/Java, CBMC, Blast, EUREKA and Why for
Bounded Program Verification | cs.SE cs.AI cs.LO | This report describes experimental results for a set of benchmarks on program
verification. It compares the capabilities of CPBVP "Constraint Programming
framework for Bounded Program Verification" [4] with the following frameworks:
ESC/Java, CBMC, Blast, EUREKA and Why.
|
0808.1661 | Medical robotics: where we come from, where we are and where we could go | cs.RO | This short note presents a viewpoint about medical robotics.
|
0808.1721 | Initial Results on the F-logic to OWL Bi-directional Translation on a
Tabled Prolog Engine | cs.AI cs.SE | In this paper, we show our results on the bi-directional data exchange
between the F-logic language supported by the Flora2 system and the OWL
language. Most of the TBox and ABox axioms are translated preserving the
semantics between the two representations, such as: proper inclusion,
individual definition, functiona... |
0808.1753 | Index wiki database: design and experiments | cs.IR cs.CL | With the fantastic growth of Internet usage, information search in documents
of a special type called a "wiki page" that is written using a simple markup
language, has become an important problem. This paper describes the software
architectural model for indexing wiki texts in three languages (Russian,
English, and G... |
0808.2059 | Diversity-Multiplexing Tradeoffs in MIMO Relay Channels | cs.IT math.IT | A multi-hop relay channel with multiple antenna terminals in a quasi-static
slow fading environment is considered. For both full-duplex and half-duplex
relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is
shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in
the ful... |
0808.2073 | Lower Bounds on the Rate-Distortion Function of LDGM Codes | cs.IT math.IT | A recent line of work has focused on the use of low-density generator matrix
(LDGM) codes for lossy source coding. In this paper, wedevelop a generic
technique for deriving lower bounds on the rate-distortion functions of binary
linear codes, with particular interest on the effect of bounded degrees. The
underlying i... |
0808.2083 | Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap
Indexes | cs.DB | Bitmap indexes must be compressed to reduce input/output costs and minimize
CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use
techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid
(WAH) compression. These techniques are sensitive to the order of the rows: a
simple le... |
0808.2089 | Capacity-achieving Feedback Scheme for Gaussian Finite-State Markov
Channels with Channel State Information | cs.IT math.IT | In this paper, we propose capacity-achieving communication schemes for
Gaussian finite-state Markov channels (FSMCs) subject to an average channel
input power constraint, under the assumption that the transmitters can have
access to delayed noiseless output feedback as well as instantaneous or delayed
channel state i... |
0808.2092 | On zero-rate error exponent for BSC with noisy feedback | cs.IT math.IT | For the information transmission a binary symmetric channel is used. There is
also another noisy binary symmetric channel (feedback channel), and the
transmitter observes without delay all the outputs of the forward channel via
that feedback channel. The transmission of a nonexponential number of messages
(i.e. the t... |
0808.2181 | Spectrum Sharing Between Cellular and Mobile Ad Hoc Networks:
Transmission-Capacity Trade-Off | cs.IT math.IT | Spectrum sharing between wireless networks improves the efficiency of
spectrum usage, and thereby alleviates spectrum scarcity due to growing demands
for wireless broadband access. To improve the usual underutilization of the
cellular uplink spectrum, this paper studies spectrum sharing between a
cellular uplink and ... |
0808.2227 | Higher Order Moments Generation by Mellin Transform for Compound Models
of Clutter | cs.CV | The compound models of clutter statistics are found suitable to describe the
nonstationary nature of radar backscattering from high-resolution observations.
In this letter, we show that the properties of Mellin transform can be utilized
to generate higher order moments of simple and compound models of clutter
statist... |
0808.2314 | Capacity of Symmetric K-User Gaussian Very Strong Interference Channels | cs.IT math.IT | This paper studies a symmetric K user Gaussian interference channel with K
transmitters and K receivers. A "very strong" interference regime is derived
for this channel setup. A "very strong" interference regime is one where the
capacity region of the interference channel is the same as the capacity region
of the cha... |
0808.2486 | Wet Paper Coding for Watermarking of Binary Images | cs.IT cs.CR math.IT | We propose a new method to embed data in binary images, including scanned
text, figures, and signatures. Our method relies on the concept of wet paper
codes. The shuffling before embedding is used in order to equalize irregular
embedding capacity from diverse areas in the image. The hidden data can be
extracted witho... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.