id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1005.5412 | On Cooperative Beamforming Based on Second-Order Statistics of Channel
State Information | cs.IT math.IT | Cooperative beamforming in relay networks is considered, in which a source
transmits to its destination with the help of a set of cooperating nodes. The
source first transmits locally. The cooperating nodes that receive the source
signal retransmit a weighted version of it in an amplify-and-forward (AF)
fashion. Assu... |
1005.5432 | Attribute oriented induction with star schema | cs.DB | This paper will propose a novel star schema attribute induction as a new
attribute induction paradigm and as improving from current attribute oriented
induction. A novel star schema attribute induction will be examined with
current attribute oriented induction based on characteristic rule and using non
rule based con... |
1005.5433 | A Data Warehouse Assistant Design System Based on Clover Model | cs.DB | Nowadays, Data Warehouse (DW) plays a crucial role in the process of decision
making. However, their design remains a very delicate and difficult task either
for expert or users. The goal of this paper is to propose a new approach based
on the clover model, destined to assist users to design a DW. The proposed
approa... |
1005.5434 | Efficient Support Coupled Frequent Pattern Mining Over Progressive
Databases | cs.DB | There have been many recent studies on sequential pattern mining. The
sequential pattern mining on progressive databases is relatively very new, in
which we progressively discover the sequential patterns in period of interest.
Period of interest is a sliding window continuously advancing as the time goes
by. As the f... |
1005.5437 | Content Based Image Retrieval Using Exact Legendre Moments and Support
Vector Machine | cs.CV | Content Based Image Retrieval (CBIR) systems based on shape using invariant
image moments, viz., Moment Invariants (MI) and Zernike Moments (ZM) are
available in the literature. MI and ZM are good at representing the shape
features of an image. However, non-orthogonality of MI and poor reconstruction
of ZM restrict t... |
1005.5438 | Query Routing and Processing in Peer-To-Peer Data Sharing Systems | cs.DB | Sharing musical files via the Internet was the essential motivation of early
P2P systems. Despite of the great success of the P2P file sharing systems,
these systems support only "simple" queries. The focus in such systems is how
to carry out an efficient query routing in order to find the nodes storing a
desired fil... |
1005.5439 | Detection of Bleeding in Wireless Capsule Endoscopy Images Using Range
Ratio Color | cs.CV | Wireless Capsule Endoscopy (WCE) is device to detect abnormalities in
colon,esophagus,small intestinal and stomach, to distinguish bleeding in WCE
images from non bleeding is a hard job by human reviewing and very time
consuming. Consequently, automation for classifying bleeding frames not only
will expedite the proc... |
1005.5448 | Failover in cellular automata | cs.AI nlin.CG | A cellular automata (CA) configuration is constructed that exhibits emergent
failover. The configuration is based on standard Game of Life rules. Gliders
and glider-guns form the core messaging structure in the configuration. The
blinker is represented as the basic computational unit, and it is shown how it
can be re... |
1005.5462 | On the clustering aspect of nonnegative matrix factorization | cs.LG | This paper provides a theoretical explanation on the clustering aspect of
nonnegative matrix factorization (NMF). We prove that even without imposing
orthogonality nor sparsity constraint on the basis and/or coefficient matrix,
NMF still can give clustering results, thus providing a theoretical support for
many works... |
1005.5466 | Quantitative parametrization of texts written by Ivan Franko: An attempt
of the project | cs.CL | In the article, the project of quantitative parametrization of all texts by
Ivan Franko is manifested. It can be made only by using modern computer
techniques after the frequency dictionaries for all Franko's works are
compiled. The paper describes the application spheres, methodology, stages,
principles and peculiar... |
1005.5514 | Managing Semantic Loss during Query Reformulation in Peer Data
Management Systems | cs.DB | In this paper we deal with the notion of semantic loss in Peer Data
Management Systems (PDMS) queries. We define such a notion and we give a
mechanism that discovers semantic loss in a PDMS network. Next, we propose an
algorithm that addresses the problem of restoring such a loss. Further
evaluation of our proposed a... |
1005.5516 | On the Fly Query Entity Decomposition Using Snippets | cs.IR | One of the most important issues in Information Retrieval is inferring the
intents underlying users' queries. Thus, any tool to enrich or to better
contextualized queries can proof extremely valuable. Entity extraction,
provided it is done fast, can be one of such tools. Such techniques usually
rely on a prior traini... |
1005.5543 | Provenance Views for Module Privacy | cs.DB cs.DS | Scientific workflow systems increasingly store provenance information about
the module executions used to produce a data item, as well as the parameter
settings and intermediate data items passed between module executions. However,
authors/owners of workflows may wish to keep some of this information
confidential. In... |
1005.5556 | Empirical learning aided by weak domain knowledge in the form of feature
importance | cs.LG cs.AI cs.NE | Standard hybrid learners that use domain knowledge require stronger knowledge
that is hard and expensive to acquire. However, weaker domain knowledge can
benefit from prior knowledge while being cost effective. Weak knowledge in the
form of feature relative importance (FRI) is presented and explained. Feature
relativ... |
1005.5574 | Robust Beamforming for Amplify-and-Forward MIMO Relay Systems Based on
Quadratic Matrix Programming | cs.IT math.IT | In this paper, robust transceiver design based on minimum-mean-square-error
(MMSE) criterion for dual-hop amplify-and-forward MIMO relay systems is
investigated. The channel estimation errors are modeled as Gaussian random
variables, and then the effect are incorporated into the robust transceiver
based on the Bayesi... |
1005.5577 | Transceiver Design for Dual-Hop Non-regenerative MIMO-OFDM Relay Systems
Under Channel Uncertainties | cs.IT math.IT | In this paper, linear transceiver design for dual-hop non-regenerative
(amplify-and-forward (AF)) MIMO-OFDM systems under channel estimation errors is
investigated. Second order moments of channel estimation errors in the two hops
are first deduced. Then based on the Bayesian framework, joint design of linear
forward... |
1005.5581 | Multi-View Active Learning in the Non-Realizable Case | cs.LG | The sample complexity of active learning under the realizability assumption
has been well-studied. The realizability assumption, however, rarely holds in
practice. In this paper, we theoretically characterize the sample complexity of
active learning in the non-realizable case under multi-view setting. We prove
that, ... |
1005.5582 | A First-order Augmented Lagrangian Method for Compressed Sensing | math.OC cs.SY | We propose a first-order augmented Lagrangian algorithm (FAL) for solving the
basis pursuit problem. FAL computes a solution to this problem by inexactly
solving a sequence of L1-regularized least squares sub-problems. These
sub-problems are solved using an infinite memory proximal gradient algorithm
wherein each upd... |
1005.5591 | On the minimum weight problem of permutation codes under Chebyshev
distance | cs.IT math.IT | Permutation codes of length $n$ and distance $d$ is a set of permutations on
$n$ symbols, where the distance between any two elements in the set is at least
$d$. Subgroup permutation codes are permutation codes with the property that
the elements are closed under the operation of composition. In this paper,
under the... |
1005.5596 | A generic tool to generate a lexicon for NLP from Lexicon-Grammar tables | cs.CL | Lexicon-Grammar tables constitute a large-coverage syntactic lexicon but they
cannot be directly used in Natural Language Processing (NLP) applications
because they sometimes rely on implicit information. In this paper, we
introduce LGExtract, a generic tool for generating a syntactic lexicon for NLP
from the Lexicon... |
1005.5603 | On the Relation between Realizable and Nonrealizable Cases of the
Sequence Prediction Problem | cs.LG cs.IT math.IT math.ST stat.TH | A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated
according to some unknown probabilistic law (measure) $\mu$. After observing
each outcome, one is required to give conditional probabilities of the next
observation. The realizable case is when the measure $\mu$ belongs to an
arbitrary but ... |
1005.5638 | Distributed source identification for wave equations: an observer-based
approach (full paper) | math.OC cs.SY math.AP | In this paper, we consider the 1D wave equation where the spatial domain is a
bounded interval. Assuming the initial conditions to be known, we are here
interested in identifying an unknown source term, while we take the Neumann
derivative of the solution on one of the boundaries as the measurement output.
Applying a... |
1005.5697 | Unbiased Estimation of a Sparse Vector in White Gaussian Noise | math.ST cs.IT math.IT stat.TH | We consider unbiased estimation of a sparse nonrandom vector corrupted by
additive white Gaussian noise. We show that while there are infinitely many
unbiased estimators for this problem, none of them has uniformly minimum
variance. Therefore, we focus on locally minimum variance unbiased (LMVU)
estimators. We derive... |
1005.5718 | Agent-based Social Psychology: from Neurocognitive Processes to Social
Data | physics.soc-ph cs.SI q-bio.NC | Moral Foundation Theory states that groups of different observers may rely on
partially dissimilar sets of moral foundations, thereby reaching different
moral valuations. The use of functional imaging techniques has revealed a
spectrum of cognitive styles with respect to the differential handling of novel
or corrobor... |
1005.5732 | A New Framework for Join Product Skew | cs.DB | Different types of data skew can result in load imbalance in the context of
parallel joins under the shared nothing architecture. We study one important
type of skew, join product skew (JPS). A static approach based on frequency
classes is proposed which takes for granted the data distribution of join
attribute value... |
1005.5734 | The Re-Encoding Transformation in Algebraic List-Decoding of
Reed-Solomon Codes | cs.IT math.IT | The main computational steps in algebraic soft-decoding, as well as
Sudan-type list-decoding, of Reed-Solomon codes are bivariate polynomial
interpolation and factorization. We introduce a computational technique, based
upon re-encoding and coordinate transformation, that significantly reduces the
complexity of the b... |
1006.0051 | Image Characterization and Classification by Physical Complexity | cs.CC cs.IT math.IT | We present a method for estimating the complexity of an image based on
Bennett's concept of logical depth. Bennett identified logical depth as the
appropriate measure of organized complexity, and hence as being better suited
to the evaluation of the complexity of objects in the physical world. Its use
results in a di... |
1006.0054 | Anti-measurement Matrix Uncertainty Sparse Signal Recovery for
Compressive Sensing | cs.IT math.IT math.NA stat.AP | Compressive sensing (CS) is a technique for estimating a sparse signal from
the random measurements and the measurement matrix. Traditional sparse signal
recovery methods have seriously degeneration with the measurement matrix
uncertainty (MMU). Here the MMU is modeled as a bounded additive error. An
anti-uncertainty... |
1006.0056 | Inter-atom Interference Mitigation for Sparse Signal Reconstruction
Using Semi-blindly Weighted Minimum Variance Distortionless Response | cs.IT math.IT math.NA | The feasibility of sparse signal reconstruction depends heavily on the
inter-atom interference of redundant dictionary. In this paper, a semi-blindly
weighted minimum variance distortionless response (SBWMVDR) is proposed to
mitigate the inter-atom interference. Examples of direction of arrival
estimation are present... |
1006.0109 | Results on Binary Linear Codes With Minimum Distance 8 and 10 | cs.IT math.IT | All codes with minimum distance 8 and codimension up to 14 and all codes with
minimum distance 10 and codimension up to 18 are classified. Nonexistence of
codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new
exact bounds for binary linear codes. Primarily two algorithms considering the
dual c... |
1006.0153 | Ivan Franko's novel Dlja domashnjoho ohnyshcha (For the Hearth) in the
light of the frequency dictionary | cs.CL | In the article, the methodology and the principles of the compilation of the
Frequency dictionary for Ivan Franko's novel Dlja domashnjoho ohnyshcha (For
the Hearth) are described. The following statistical parameters of the novel
vocabulary are obtained: variety, exclusiveness, concentration indexes,
correlation bet... |
1006.0168 | Perfusion Linearity and Its Applications | cs.CE | Perfusion analysis computes blood flow parameters (blood volume, blood flow,
mean transit time) from the observed flow of contrast agent, passing through
the patient's vascular system. Perfusion deconvolution has been widely accepted
as the principal numerical tool for perfusion analysis, and is used routinely
in cli... |
1006.0170 | A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based
on the Extended Euclidean Algorithm | cs.IT math.IT | This paper presents a method to determine a set of basis polynomials from the
extended Euclidean algorithm that allows Generalized Minimum Distance decoding
of Reed-Solomon codes with a complexity of O(nd).
|
1006.0234 | Inferring Networks of Diffusion and Influence | cs.DS cs.SI physics.soc-ph stat.ML | Information diffusion and virus propagation are fundamental processes taking
place in networks. While it is often possible to directly observe when nodes
become infected with a virus or adopt the information, observing individual
transmissions (i.e., who infects whom, or who influences whom) is typically
very difficu... |
1006.0245 | Improved compression of network coding vectors using erasure decoding
and list decoding | cs.IT math.IT | Practical random network coding based schemes for multicast include a header
in each packet that records the transformation between the sources and the
terminal. The header introduces an overhead that can be significant in certain
scenarios. In previous work, parity check matrices of error control codes along
with er... |
1006.0259 | Methods for the Reconstruction of Parallel Turbo Codes | cs.IT math.IT | We present two new algorithms for the reconstruction of turbo codes from a
noisy intercepted bitstream. With these algorithms, we were able to reconstruct
various turbo codes with realistic parameter sizes. To the best of our
knowledge, these are the first algorithms able to recover the whole permutation
of a turbo c... |
1006.0271 | The Quality of Oscillations in Overdamped Networks | cond-mat.stat-mech cs.SI math-ph math.MP math.SP nlin.PS physics.bio-ph q-bio.MN | The second law of thermodynamics implies that no macroscopic system may
oscillate indefinitely without consuming energy. The question of the number of
possible oscillations and the coherent quality of these oscillations remain
unanswered. This paper proves the upper-bounds on the number and quality of
such oscillatio... |
1006.0274 | Learning Probabilistic Hierarchical Task Networks to Capture User
Preferences | cs.AI | We propose automatically learning probabilistic Hierarchical Task Networks
(pHTNs) in order to capture a user's preferences on plans, by observing only
the user's behavior. HTNs are a common choice of representation for a variety
of purposes in planning, including work on learning in planning. Our
contributions are (... |
1006.0277 | The Limits of Error Correction with lp Decoding | cs.IT math.IT | An unknown vector f in R^n can be recovered from corrupted measurements y =
Af + e where A^(m*n)(m>n) is the coding matrix if the unknown error vector e is
sparse. We investigate the relationship of the fraction of errors and the
recovering ability of lp-minimization (0 < p <= 1) which returns a vector x
minimizing t... |
1006.0284 | Asymptotic Optimality of Antidictionary Codes | cs.IT math.IT | An antidictionary code is a lossless compression algorithm using an
antidictionary which is a set of minimal words that do not occur as substrings
in an input string. The code was proposed by Crochemore et al. in 2000, and its
asymptotic optimality has been proved with respect to only a specific
information source, c... |
1006.0289 | M\'{e}todos para la Selecci\'{o}n y el Ajuste de Caracter\'{i}sticas en
el Problema de la Detecci\'{o}n de Spam | cs.IR cs.AI | The email is used daily by millions of people to communicate around the globe
and it is a mission-critical application for many businesses. Over the last
decade, unsolicited bulk email has become a major problem for email users. An
overwhelming amount of spam is flowing into users' mailboxes daily. In 2004, an
estima... |
1006.0304 | On the stable recovery of the sparsest overcomplete representations in
presence of noise | cs.IT math.IT | Let x be a signal to be sparsely decomposed over a redundant dictionary A,
i.e., a sparse coefficient vector s has to be found such that x=As. It is known
that this problem is inherently unstable against noise, and to overcome this
instability, the authors of [Stable Recovery; Donoho et.al., 2006] have
proposed to us... |
1006.0312 | Markov Lemma for Countable Alphabets | cs.IT math.IT | Strong typicality and the Markov lemma have been used in the proofs of
several multiterminal source coding theorems. Since these two tools can be
applied to finite alphabets only, the results proved by them are subject to the
same limitation. Recently, a new notion of typicality, namely unified
typicality, has been d... |
1006.0330 | Soft-Output Sphere Decoder for Multiple-Symbol Differential Detection of
Impulse-Radio Ultra-Wideband | cs.IT math.IT | Power efficiency of noncoherent receivers for impulse-radio ultra-wideband
(IR-UWB) transmission systems can significantly be improved, on the one hand,
by employing multiple-symbol differential detection (MSDD), and, on the other
hand, by providing reliability information to the subsequent channel decoder.
In this p... |
1006.0334 | One-Shot Capacity of Discrete Channels | cs.IT math.IT | Shannon defined channel capacity as the highest rate at which there exists a
sequence of codes of block length $n$ such that the error probability goes to
zero as $n$ goes to infinity. In this definition, it is implicit that the block
length, which can be viewed as the number of available channel uses, is
unlimited. ... |
1006.0355 | An algebraic approach to information theory | cs.IT math.IT | This work proposes an algebraic model for classical information theory. We
first give an algebraic model of probability theory. Information theoretic
constructs are based on this model. In addition to theoretical insights
provided by our model one obtains new computational and analytical tools.
Several important theo... |
1006.0375 | Information theoretic model validation for clustering | cs.IT cs.LG math.IT stat.ML | Model selection in clustering requires (i) to specify a suitable clustering
principle and (ii) to control the model order complexity by choosing an
appropriate number of clusters depending on the noise level in the data. We
advocate an information theoretic perspective where the uncertainty in the
measurements quanti... |
1006.0379 | Adaptive Demodulation in Differentially Coherent Phase Systems: Design
and Performance Analysis | cs.IT math.IT | Adaptive Demodulation (ADM) is a newly proposed rate-adaptive system which
operates without requiring Channel State Information (CSI) at the transmitter
(unlike adaptive modulation) by using adaptive decision region boundaries at
the receiver and encoding the data with a rateless code. This paper addresses
the design... |
1006.0385 | Brain-Like Stochastic Search: A Research Challenge and Funding
Opportunity | cs.AI | Brain-Like Stochastic Search (BLiSS) refers to this task: given a family of
utility functions U(u,A), where u is a vector of parameters or task
descriptors, maximize or minimize U with respect to u, using networks (Option
Nets) which input A and learn to generate good options u stochastically. This
paper discusses wh... |
1006.0386 | A Smart Approach for GPT Cryptosystem Based on Rank Codes | cs.IT cs.CR math.IT | The concept of Public- key cryptosystem was innovated by McEliece's
cryptosystem. The public key cryptosystem based on rank codes was presented in
1991 by Gabidulin -Paramonov-Trejtakov(GPT). The use of rank codes in
cryptographic applications is advantageous since it is practically impossible
to utilize combinatoric... |
1006.0392 | Computing the speed of convergence of ergodic averages and pseudorandom
points in computable dynamical systems | cs.NA cs.CE cs.LO | A pseudorandom point in an ergodic dynamical system over a computable metric
space is a point which is computable but its dynamics has the same statistical
behavior as a typical point of the system.
It was proved in [Avigad et al. 2010, Local stability of ergodic averages]
that in a system whose dynamics is computa... |
1006.0397 | Effective Capacity and Randomness of Closed Sets | cs.LO cs.IT math.IT math.LO | We investigate the connection between measure and capacity for the space of
nonempty closed subsets of {0,1}*. For any computable measure, a computable
capacity T may be defined by letting T(Q) be the measure of the family of
closed sets which have nonempty intersection with Q. We prove an effective
version of Choque... |
1006.0408 | A Mathematical Framework for Agent Based Models of Complex Biological
Networks | q-bio.QM cs.MA physics.bio-ph | Agent-based modeling and simulation is a useful method to study biological
phenomena in a wide range of fields, from molecular biology to ecology. Since
there is currently no agreed-upon standard way to specify such models it is not
always easy to use published models. Also, since model descriptions are not
usually g... |
1006.0448 | Emergence of Complex-Like Cells in a Temporal Product Network with Local
Receptive Fields | cs.NE | We introduce a new neural architecture and an unsupervised algorithm for
learning invariant representations from temporal sequence of images. The system
uses two groups of complex cells whose outputs are combined multiplicatively:
one that represents the content of the image, constrained to be constant over
several c... |
1006.0475 | Prediction with Advice of Unknown Number of Experts | cs.LG | In the framework of prediction with expert advice, we consider a recently
introduced kind of regret bounds: the bounds that depend on the effective
instead of nominal number of experts. In contrast to the NormalHedge bound,
which mainly depends on the effective number of experts and also weakly depends
on the nominal... |
1006.0496 | The diversity-multiplexing tradeoff of the MIMO Z interference channel | cs.IT math.IT | The fundamental generalized diversity-multiplexing tradeoff (GDMT) of the
quasi-static fading MIMO Z interference channel (Z-IC) is established for the
general Z-IC with an arbitrary number of antennas at each node under the
assumptions of full channel state information at the transmitters (CSIT) and a
short-term ave... |
1006.0542 | Multicast Capacity Scaling of Wireless Networks with Multicast Outage | cs.IT math.IT | Multicast transmission has several distinctive traits as opposed to more
commonly studied unicast networks. Specially, these include (i) identical
packets must be delivered successfully to several nodes, (ii) outage could
simultaneously happen at different receivers, and (iii) the multicast rate is
dominated by the r... |
1006.0544 | Capacity scaling law by multiuser diversity in cognitive radio systems | cs.IT math.IT | This paper analyzes the multiuser diversity gain in a cognitive radio (CR)
system where secondary transmitters opportunistically utilize the spectrum
licensed to primary users only when it is not occupied by the primary users. To
protect the primary users from the interference caused by the missed detection
of primar... |
1006.0575 | XQ2P: Efficient XQuery P2P Time Series Processing | cs.DB | In this demonstration, we propose a model for the management of XML time
series (TS), using the new XQuery 1.1 window operator. We argue that
centralized computation is slow, and demonstrate XQ2P, our prototype of
efficient XQuery P2P TS computation in the context of financial analysis of
large data sets (>1M values)... |
1006.0576 | Gestion efficace de s\'eries temporelles en P2P: Application \`a
l'analyse technique et l'\'etude des objets mobiles | cs.DB | In this paper, we propose a simple generic model to manage time series. A
time series is composed of a calendar with a typed value for each calendar
entry. Although the model could support any kind of XML typed values, in this
paper we focus on real numbers, which are the usual application. We define
basic vector spa... |
1006.0619 | Spectrum Sharing in Cognitive Radio with Quantized Channel Information | cs.IT math.IT math.OC | We consider a wideband spectrum sharing system where a secondary user can
share a number of orthogonal frequency bands where each band is licensed to an
individual primary user. We address the problem of optimum secondary transmit
power allocation for its ergodic capacity maximization subject to an average
sum (acros... |
1006.0644 | The Achievable Distortion Region of Bivariate Gaussian Source on
Gaussian Broadcast Channel | cs.IT math.IT | We provide a complete characterization of the achievable distortion region
for the problem of sending a bivariate Gaussian source over bandwidth-matched
Gaussian broadcast channels, where each receiver is interested in only one
component of the source. This setting naturally generalizes the simple single
Gaussian sou... |
1006.0646 | Irregular Turbo Codes in Block-Fading Channels | cs.IT math.IT | We study irregular binary turbo codes over non-ergodic block-fading channels.
We first propose an extension of channel multiplexers initially designed for
regular turbo codes. We then show that, using these multiplexers, irregular
turbo codes that exhibit a small decoding threshold over the ergodic
Gaussian-noise cha... |
1006.0659 | EXIT Chart Approximations using the Role Model Approach | cs.IT math.IT | Extrinsic Information Transfer (EXIT) functions can be measured by
statistical methods if the message alphabet size is moderate or if messages are
true a-posteriori distributions. We propose an approximation we call mixed
information that constitutes a lower bound for the true EXIT function and can
be estimated by st... |
1006.0719 | Why Gabor Frames? Two Fundamental Measures of Coherence and Their Role
in Model Selection | math.ST cs.IT math.IT stat.ML stat.TH | This paper studies non-asymptotic model selection for the general case of
arbitrary design matrices and arbitrary nonzero entries of the signal. In this
regard, it generalizes the notion of incoherence in the existing literature on
model selection and introduces two fundamental measures of coherence---termed
as the w... |
1006.0741 | Analysis of Collectivism and Egoism Phenomena within the Context of
Social Welfare | cs.MA cs.SI math.OC | Comparative benefits provided by the basic social strategies including
collectivism and egoism are investigated within the framework of democratic
decision-making. In particular, we study the mechanism of growing "snowball" of
cooperation.
|
1006.0763 | Good Codes From Generalised Algebraic Geometry Codes | cs.IT math.IT | Algebraic geometry codes or Goppa codes are defined with places of degree
one. In constructing generalised algebraic geometry codes places of higher
degree are used. In this paper we present 41 new codes over GF(16) which
improve on the best known codes of the same length and rate. The construction
method uses places... |
1006.0778 | The Two-Way Wiretap Channel: Achievable Regions and Experimental Results | cs.IT math.IT | This work considers the two-way wiretap channel in which two legitimate
users, Alice and Bob, wish to exchange messages securely in the presence of a
passive eavesdropper Eve. In the full-duplex scenario, where each node can
transmit and receive simultaneously, we obtain new achievable secrecy rate
regions based on t... |
1006.0795 | Channel Decoding with a Bayesian Equalizer | cs.IT math.IT | Low-density parity-check (LPDC) decoders assume the channel estate
information (CSI) is known and they have the true a posteriori probability
(APP) for each transmitted bit. But in most cases of interest, the CSI needs to
be estimated with the help of a short training sequence and the LDPC decoder
has to decode the r... |
1006.0871 | Capacity for Half-Duplex Line Networks with Two Sources | cs.IT math.IT | The focus is on noise-free half-duplex line networks with two sources where
the first node and either the second node or the second-last node in the
cascade act as sources. In both cases, we establish the capacity region of
rates at which both sources can transmit independent information to a common
sink. The achieva... |
1006.0876 | Building a Data Warehouse for National Social Security Fund of the
Republic of Tunisia | cs.DB | The amounts of data available to decision makers are increasingly important,
given the network availability, low cost storage and diversity of applications.
To maximize the potential of these data within the National Social Security
Fund (NSSF) in Tunisia, we have built a data warehouse as a multidimensional
database... |
1006.0888 | Fundamental Limits of Wideband Localization - Part I: A General
Framework | cs.IT cs.NI math.IT | The availability of positional information is of great importance in many
commercial, public safety, and military applications. The coming years will see
the emergence of location-aware networks with sub-meter accuracy, relying on
accurate range measurements provided by wide bandwidth transmissions. In this
two-part ... |
1006.0890 | Fundamental Limits of Wideband Localization - Part II: Cooperative
Networks | cs.IT cs.NI math.IT | The availability of positional information is of great importance in many
commercial, governmental, and military applications. Localization is commonly
accomplished through the use of radio communication between mobile devices
(agents) and fixed infrastructure (anchors). However, precise determination of
agent positi... |
1006.0964 | On Achievable Rate Regions for Half-Duplex Causal Cognitive Radio
Channels | cs.IT math.IT | Coding for the causal cognitive radio channel, with the cognitive source
subjected to a half-duplex constraint, is studied. A discrete memoryless
channel model incorporating the half-duplex constraint is presented, and a new
achievable rate region is derived for this channel. It is proved that this rate
region contai... |
1006.0991 | Variational Program Inference | cs.AI | We introduce a framework for representing a variety of interesting problems
as inference over the execution of probabilistic model programs. We represent a
"solution" to such a problem as a guide program which runs alongside the model
program and influences the model program's random choices, leading the model
progra... |
1006.1024 | A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary
LDPC-Coded Modulation Systems | cs.IT math.IT | In this paper, we present a low-complexity joint detection-decoding algorithm
for nonbinary LDPC codedmodulation systems. The algorithm combines
hard-decision decoding using the message-passing strategy with the signal
detector in an iterative manner. It requires low computational complexity,
offers good system perfo... |
1006.1029 | Chi-square-based scoring function for categorization of MEDLINE
citations | cs.IR stat.AP stat.ML | Objectives: Text categorization has been used in biomedical informatics for
identifying documents containing relevant topics of interest. We developed a
simple method that uses a chi-square-based scoring function to determine the
likelihood of MEDLINE citations containing genetic relevant topic. Methods: Our
procedur... |
1006.1030 | Rasch-based high-dimensionality data reduction and class prediction with
applications to microarray gene expression data | cs.AI stat.AP stat.ME stat.ML | Class prediction is an important application of microarray gene expression
data analysis. The high-dimensionality of microarray data, where number of
genes (variables) is very large compared to the number of samples (obser-
vations), makes the application of many prediction techniques (e.g., logistic
regression, disc... |
1006.1055 | Shannon Revisited: Considering a More Tractable Expression to Measure
and Manage Intractability, Uncertainty, Risk, Ignorance, and Entropy | cs.IT math.IT | Building on Shannon's lead, let's consider a more malleable expression for
tracking uncertainty, and states of "knowledge available" vs. "knowledge
missing," to better practice innovation, improve risk management, and
successfully measure progress of intractable undertakings. Shannon's formula,
and its common replace... |
1006.1057 | On improving security of GPT cryptosystems | cs.CR cs.IT math.IT | The public key cryptosystem based on rank error correcting codes (the GPT
cryptosystem) was proposed in 1991. Use of rank codes in cryptographic
applications is advantageous since it is practically impossible to utilize
combinatoric decoding. This enabled using public keys of a smaller size.
Several attacks against t... |
1006.1080 | The Dilated Triple | cs.AI | The basic unit of meaning on the Semantic Web is the RDF statement, or
triple, which combines a distinct subject, predicate and object to make a
definite assertion about the world. A set of triples constitutes a graph, to
which they give a collective meaning. It is upon this simple foundation that
the rich, complex k... |
1006.1129 | Predictive PAC learnability: a paradigm for learning from exchangeable
input data | cs.LG | Exchangeable random variables form an important and well-studied
generalization of i.i.d. variables, however simple examples show that no
nontrivial concept or function classes are PAC learnable under general
exchangeable data inputs $X_1,X_2,\ldots$. Inspired by the work of Berti and
Rigo on a Glivenko--Cantelli the... |
1006.1138 | Online Learning via Sequential Complexities | cs.LG stat.ML | We consider the problem of sequential prediction and provide tools to study
the minimax value of the associated game. Classical statistical learning theory
provides several useful complexity measures to study learning with i.i.d. data.
Our proposed sequential complexities can be seen as extensions of these
measures t... |
1006.1149 | The diversity-multiplexing tradeoff of the symmetric MIMO 2-user
interference channel | cs.IT math.IT | The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static
fading, symmetric $2$-user MIMO interference channel (IC) with channel state
information at the transmitters (CSIT) and a short term average power
constraint is obtained. The general case is considered where the
interference-to-noise ratio (INR... |
1006.1162 | MIMO ARQ with Multi-bit Feedback: Outage Analysis | cs.IT math.IT | We study the asymptotic outage performance of incremental redundancy
automatic repeat request (INR-ARQ) transmission over the multiple-input
multiple-output (MIMO) block-fading channels with discrete input
constellations. We first show that transmission with random codes using a
discrete signal constellation across a... |
1006.1172 | Distributed Rateless Codes with UEP Property | cs.IT math.IT | When multiple sources of data need to transmit their rateless coded symbols
through a single relay to a common destination, a distributed rateless code
instead of several separate conventional rateless codes can be employed to
encode the input symbols to increase the transmission efficiency and
flexibility.
In this... |
1006.1184 | An Algorithm to Self-Extract Secondary Keywords and Their Combinations
Based on Abstracts Collected using Primary Keywords from Online Digital
Libraries | cs.IR | The high-level contribution of this paper is the development and
implementation of an algorithm to selfextract secondary keywords and their
combinations (combo words) based on abstracts collected using standard primary
keywords for research areas from reputed online digital libraries like IEEE
Explore, PubMed Central... |
1006.1187 | Biometric Authentication using Nonparametric Methods | cs.CV | The physiological and behavioral trait is employed to develop biometric
authentication systems. The proposed work deals with the authentication of iris
and signature based on minimum variance criteria. The iris patterns are
preprocessed based on area of the connected components. The segmented image
used for authentic... |
1006.1190 | Game Information System | cs.AI | In this Information system age many organizations consider information system
as their weapon to compete or gain competitive advantage or give the best
services for non profit organizations. Game Information System as combining
Information System and game is breakthrough to achieve organizations'
performance. The Gam... |
1006.1210 | Full vectoring optimal power allocation in xDSL channels under per-modem
power constraints and spectral mask constraints | cs.IT math.IT | In xDSL systems, crosstalk can be separated into two categories, namely
in-domain crosstalk and out-of-domain crosstalk. In-domain crosstalk is also
refered to as self crosstalk. Out-of-domain crosstalk is crosstalk originating
from outside the multi-pair system and is also denoted as external noise (alien
crosstalk,... |
1006.1213 | Optimal power allocation for downstream xDSL with per-modem total power
constraints : Broadcast Channel Optimal Spectrum Balancing (BC-OSB) | cs.IT math.IT | Recently, the duality between Multiple Input Multiple Output (MIMO) Multiple
Access Channels (MAC) and MIMO Broadcast Channels (BC) has been established
under a total power constraint. The same set of rates for MAC can be achieved
in BC exploiting the MAC-BC duality formulas while preserving the total power
constrain... |
1006.1288 | Regression on fixed-rank positive semidefinite matrices: a Riemannian
approach | cs.LG | The paper addresses the problem of learning a regression model parameterized
by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear
nature of the search space and on scalability to high-dimensional problems. The
mathematical developments rely on the theory of gradient descent algorithms
adapted t... |
1006.1309 | Using Grid Files for a Relational Database Management System | cs.DB | This paper describes our experience with using Grid files as the main storage
organization for a relational database management system. We primarily focus on
the following two aspects. (i) Strategies for implementing grid files
efficiently. (ii) Methods for efficiency evaluating queries posed to a database
organized ... |
1006.1328 | Uncovering the Riffled Independence Structure of Rankings | cs.LG cs.AI stat.AP stat.ML | Representing distributions over permutations can be a daunting task due to
the fact that the number of permutations of $n$ objects scales factorially in
$n$. One recent way that has been used to reduce storage complexity has been to
exploit probabilistic independence, but as we argue, full independence
assumptions im... |
1006.1343 | Segmentation and Nodal Points in Narrative: Study of Multiple Variations
of a Ballad | cs.CL stat.ML | The Lady Maisry ballads afford us a framework within which to segment a
storyline into its major components. Segments and as a consequence nodal points
are discussed for nine different variants of the Lady Maisry story of a (young)
woman being burnt to death by her family, on account of her becoming pregnant
by a for... |
1006.1346 | C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework | stat.ML cs.CV | Sparse modeling is a powerful framework for data analysis and processing.
Traditionally, encoding in this framework is performed by solving an
L1-regularized linear regression problem, commonly referred to as Lasso or
Basis Pursuit. In this work we combine the sparsity-inducing property of the
Lasso model at the indi... |
1006.1377 | Joint Bandwidth and Power Allocation with Admission Control in Wireless
Multi-User Networks With and Without Relaying | cs.IT math.IT | Equal allocation of bandwidth and/or power may not be efficient for wireless
multi-user networks with limited bandwidth and power resources. Joint bandwidth
and power allocation strategies for wireless multi-user networks with and
without relaying are proposed in this paper for (i) the maximization of the sum
capacit... |
1006.1380 | Pareto Region Characterization for Rate Control in Multi-User Systems
and Nash Bargaining | cs.GT cs.IT math.IT | The problem of rate control in multi-user multiple-input multiple-output
(MIMO) interference systems is formulated as a multicriteria optimization (MCO)
problem. The Pareto rate region of the MCO problem is characterized. It is
shown that for the convexity of the Pareto rate region it is sufficient that
the interfere... |
1006.1382 | On Regret of Parametric Mismatch in Minimum Mean Square Error Estimation | cs.IT math.IT | This paper studies the effect of parametric mismatch in minimum mean square
error (MMSE) estimation. In particular, we consider the problem of estimating
the input signal from the output of an additive white Gaussian channel whose
gain is fixed, but unknown. The input distribution is known, and the estimation
process... |
1006.1383 | Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes | cs.IT math.IT | LT codes are modern and efficient rateless forward error correction (FEC)
codes with close to channel capacity performance. Nevertheless, in intermediate
range where the number of received encoded symbols is less than the number of
source symbols, LT codes have very low recovery rates.
In this paper, we propose a n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.