id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0811.4200 | Two Models for Noisy Feedback in MIMO Channels | cs.IT math.IT | Two distinct models of feedback, suited for FDD (Frequency Division Duplex)
and TDD (Frequency Division Duplex) systems respectively, have been widely
studied in the literature. In this paper, we compare these two models of
feedback in terms of the diversity multiplexing tradeoff for varying amount of
channel state i... |
0811.4227 | Entanglement-assisted communication of classical and quantum information | quant-ph cs.IT math.IT | We consider the problem of transmitting classical and quantum information
reliably over an entanglement-assisted quantum channel. Our main result is a
capacity theorem that gives a three-dimensional achievable rate region. Points
in the region are rate triples, consisting of the classical communication rate,
the quan... |
0811.4339 | Finite Lattice-Size Effects in MIMO Detection | cs.IT math.IT | Many powerful data detection algorithms employed in multiple-input
multiple-output (MIMO) communication systems, such as sphere decoding (SD) and
lattice-reduction (LR)-aided detection, were initially designed for infinite
lattices. Detection in MIMO systems is, however, based on finite lattices. In
this paper, we sy... |
0811.4346 | Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional
Range Queries | cs.DS cs.DB | The B-tree is a fundamental secondary index structure that is widely used for
answering one-dimensional range reporting queries. Given a set of $N$ keys, a
range query can be answered in $O(\log_B \nm + \frac{K}{B})$ I/Os, where $B$ is
the disk block size, $K$ the output size, and $M$ the size of the main memory
buff... |
0811.4349 | Anti Plagiarism Application with Algorithm Karp-Rabin at Thesis in
Gunadarma University | cs.IT cs.DL math.IT | Plagiarism that is plagiarizing or composition retrieval, opinion, etcetera
from other people and makes it is likely composition and opinion him-self.
Plagiarism can be considered to be crime because stealing others copyrights.
Like action a student copying some part of writings without valid permission
from the orig... |
0811.4354 | Soft-Input Soft-Output Sphere Decoding | cs.IT math.IT | Soft-input soft-output (SISO) detection algorithms form the basis for
iterative decoding. The associated computational complexity often poses
significant challenges for practical receiver implementations, in particular in
the context of multiple-input multiple-output wireless systems. In this paper,
we present a low-... |
0811.4391 | Cross-Layer Link Adaptation Design for Relay Channels with Cooperative
ARQ Protocol | cs.IT math.IT | The cooperative automatic repeat request (C-ARQ) is a link layer relaying
protocol which exploits the spatial diversity and allows the relay node to
retransmit the source data packet to the destination, when the latter is unable
to decode the source data correctly. This paper presents a cross-layer link
adaptation de... |
0811.4395 | List Decoding Tensor Products and Interleaved Codes | cs.IT math.IT | We design the first efficient algorithms and prove new combinatorial bounds
for list decoding tensor products of codes and interleaved codes. We show that
for {\em every} code, the ratio of its list decoding radius to its minimum
distance stays unchanged under the tensor product operation (rather than
squaring, as on... |
0811.4397 | Joint Adaptive Modulation-Coding and Cooperative ARQ for Wireless Relay
Networks | cs.IT math.IT | This paper presents a cross-layer approach to jointly design adaptive
modulation and coding (AMC) at the physical layer and cooperative truncated
automatic repeat request (ARQ) protocol at the data link layer. We first derive
an exact closed form expression for the spectral efficiency of the proposed
joint AMC-cooper... |
0811.4403 | Joint Adaptive Modulation Coding and Cooperative ARQ over Relay
Channels-Applications to Land Mobile Satellite Communications | cs.IT math.IT | In a cooperative relay network, a relay node (R) facilitates data
transmission to the destination node (D), when the latter is unable to decode
the source node (S) data correctly. This paper considers such a system model
and presents a cross-layer approach to jointly design adaptive modulation and
coding (AMC) at the... |
0811.4413 | A Spectral Algorithm for Learning Hidden Markov Models | cs.LG cs.AI | Hidden Markov Models (HMMs) are one of the most fundamental and widely used
statistical tools for modeling discrete time series. In general, learning HMMs
from data is computationally hard (under cryptographic assumptions), and
practitioners typically resort to search heuristics which suffer from the usual
local opti... |
0811.4458 | Learning Class-Level Bayes Nets for Relational Data | cs.LG cs.AI | Many databases store data in relational format, with different types of
entities and information about links between the entities. The field of
statistical-relational learning (SRL) has developed a number of new statistical
models for such data. In this paper we focus on learning class-level or
first-order dependenci... |
0811.4483 | Wide spread spectrum watermarking with side information and interference
cancellation | cs.MM cs.IT math.IT | Nowadays, a popular method used for additive watermarking is wide spread
spectrum. It consists in adding a spread signal into the host document. This
signal is obtained by the sum of a set of carrier vectors, which are modulated
by the bits to be embedded. To extract these embedded bits, weighted
correlations between... |
0811.4489 | Automatic Generation of the Axial Lines of Urban Environments to Capture
What We Perceive | cs.CG cs.CV | Based on the concepts of isovists and medial axes, we developed a set of
algorithms that can automatically generate axial lines for representing
individual linearly stretched parts of open space of an urban environment. Open
space is the space between buildings, where people can freely move around. The
generation of ... |
0811.4565 | Ergodic Capacity Analysis of Amplify-and-Forward MIMO Dual-Hop Systems | cs.IT math.IT | This paper presents an analytical characterization of the ergodic capacity of
amplify-and-forward (AF) MIMO dual-hop relay channels, assuming that the
channel state information is available at the destination terminal only. In
contrast to prior results, our expressions apply for arbitrary numbers of
antennas and arbi... |
0811.4603 | Frozen Footprints | cs.DL cs.IR | Bibliometrics has the ambitious goal of measuring science. To this end, it
exploits the way science is disseminated trough scientific publications and the
resulting citation network of scientific papers. We survey the main historical
contributions to the field, the most interesting bibliometric indicators, and
the mo... |
0811.4630 | Channel State Prediction, Feedback and Scheduling for a Multiuser
MIMO-OFDM Downlink | cs.IT math.IT | We consider the downlink of a MIMO-OFDM wireless systems where the
base-station (BS) has M antennas and serves K single-antenna user terminals
(UT) with K larger than or equal to M. Users estimate their channel vectors
from common downlink pilot symbols and feed back a prediction, which is used by
the BS to compute t... |
0811.4697 | Informed stego-systems in active warden context: statistical
undetectability and capacity | cs.IT cs.MM math.IT | Several authors have studied stego-systems based on Costa scheme, but just a
few ones gave both theoretical and experimental justifications of these schemes
performance in an active warden context. We provide in this paper a
steganographic and comparative study of three informed stego-systems in active
warden context... |
0811.4699 | Mapping Images with the Coherence Length Diagrams | cs.CV | Statistical pattern recognition methods based on the Coherence Length Diagram
(CLD) have been proposed for medical image analyses, such as quantitative
characterisation of human skin textures, and for polarized light microscopy of
liquid crystal textures. Further investigations are made on image maps
originated from ... |
0811.4700 | Trellis-coded quantization for public-key steganography | cs.MM cs.IT math.IT | This paper deals with public-key steganography in the presence of a passive
warden. The aim is to hide secret messages within cover-documents without
making the warden suspicious, and without any preliminar secret key sharing.
Whereas a practical attempt has been already done to provide a solution to this
problem, it... |
0811.4702 | Information-theoretic resolution of perceptual WSS watermarking of non
i.i.d. Gaussian signals | cs.IT cs.MM math.IT | The theoretical foundations of data hiding have been revealed by formulating
the problem as message communication over a noisy channel. We revisit the
problem in light of a more general characterization of the watermark channel
and of weighted distortion measures. Considering spread spectrum based
information hiding,... |
0811.4706 | Comparing Measures of Sparsity | cs.IT math.IT | Sparsity of representations of signals has been shown to be a key concept of
fundamental importance in fields such as blind source separation, compression,
sampling and signal analysis. The aim of this paper is to compare several
commonlyused sparsity measures based on intuitive attributes. Intuitively, a
sparse repr... |
0811.4717 | Prospective Study for Semantic Inter-Media Fusion in Content-Based
Medical Image Retrieval | cs.IR cs.CL | One important challenge in modern Content-Based Medical Image Retrieval
(CBMIR) approaches is represented by the semantic gap, related to the
complexity of the medical knowledge. Among the methods that are able to close
this gap in CBMIR, the use of medical thesauri/ontologies has interesting
perspectives due to the ... |
0811.4718 | On the Fourier Spectra of the Infinite Families of Quadratic APN
Functions | cs.IT cs.CR cs.DM math.IT | It is well known that a quadratic function defined on a finite field of odd
degree is almost bent (AB) if and only if it is almost perfect nonlinear (APN).
For the even degree case there is no apparent relationship between the values
in the Fourier spectrum of a function and the APN property. In this article we
compu... |
0811.4733 | Kinematic Analysis of a Serial - Parallel Machine Tool: the VERNE
machine | cs.RO | The paper derives the inverse and the forward kinematic equations of a serial
- parallel 5-axis machine tool: the VERNE machine. This machine is composed of
a three-degree-of-freedom (DOF) parallel module and a two-DOF serial tilting
table. The parallel module consists of a moving platform that is connected to a
fixe... |
0811.4773 | Two-way source coding with a helper | cs.IT math.IT | Consider the two-way rate-distortion problem in which a helper sends a common
limited-rate message to both users based on side information at its disposal.
We characterize the region of achievable rates and distortions where a Markov
form (Helper)-(User 1)-(User 2) holds. The main insight of the result is that
in ord... |
0812.0038 | Omnidirectional Relay in Wireless Networks | cs.IT math.IT | For wireless networks with multiple sources, an omnidirectional relay scheme
is developed, where each node can simultaneously relay different messages in
different directions. This is accomplished by the decode-and-forward relay
strategy, with each relay binning the multiple messages to be transmitted, in
the same sp... |
0812.0070 | An Integrated Software-based Solution for Modular and Self-independent
Networked Robot | cs.RO | An integrated software-based solution for a modular and self-independent
networked robot is introduced. The wirelessly operatable robot has been
developed mainly for autonomous monitoring works with full control over web.
The integrated software solution covers three components : a) the digital
signal processing unit... |
0812.0319 | Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper | cs.IT math.IT | We study the security of communication between a single transmitter and
multiple receivers in a broadcast channel in the presence of an eavesdropper.
We consider several special classes of channels. As the first model, we
consider the degraded multi-receiver wiretap channel where the legitimate
receivers exhibit a de... |
0812.0329 | Block-Sparsity: Coherence and Efficient Recovery | cs.IT math.IT | We consider compressed sensing of block-sparse signals, i.e., sparse signals
that have nonzero coefficients occuring in clusters. Based on an uncertainty
relation for block-sparse signals, we define a block-coherence measure and we
show that a block-version of the orthogonal matching pursuit algorithm recovers
block ... |
0812.0340 | A Matlab Implementation of a Flat Norm Motivated Polygonal Edge Matching
Method using a Decomposition of Boundary into Four 1-Dimensional Currents | cs.CV cs.CG | We describe and provide code and examples for a polygonal edge matching
method.
|
0812.0382 | k-means requires exponentially many iterations even in the plane | cs.CG cs.DS cs.LG | The k-means algorithm is a well-known method for partitioning n points that
lie in the d-dimensional space into k clusters. Its main features are
simplicity and speed in practice. Theoretically, however, the best known upper
bound on its running time (i.e. O(n^{kd})) can be exponential in the number of
points. Recent... |
0812.0389 | Approximation Algorithms for Bregman Co-clustering and Tensor Clustering | cs.DS cs.LG | In the past few years powerful generalizations to the Euclidean k-means
problem have been made, such as Bregman clustering [7], co-clustering (i.e.,
simultaneous clustering of rows and columns of an input matrix) [9,18], and
tensor clustering [8,34]. Like k-means, these more general problems also suffer
from the NP-h... |
0812.0438 | An Introduction to Knowledge Management | cs.DB cs.CR | Knowledge has been lately recognized as one of the most important assets of
organizations. Managing knowledge has grown to be imperative for the success of
a company. This paper presents an overview of Knowledge Management and various
aspects of secure knowledge management. A case study of knowledge management
activi... |
0812.0564 | Provenance Traces | cs.PL cs.DB | Provenance is information about the origin, derivation, ownership, or history
of an object. It has recently been studied extensively in scientific databases
and other settings due to its importance in helping scientists judge data
validity, quality and integrity. However, most models of provenance have been
stated as... |
0812.0617 | The Capacity Region of the Cognitive Z-interference Channel with One
Noiseless Component | cs.IT math.IT | We study the discrete memoryless Z-interference channel (ZIC) where the
transmitter of the pair that suffers from interference is cognitive. We first
provide upper and lower bounds on the capacity of this channel. We then show
that, when the channel of the transmitter-receiver pair that does not face
interference is ... |
0812.0621 | Channel Estimation and Linear Precoding in Multiuser Multiple-Antenna
TDD Systems | cs.IT math.IT | Traditional approaches in the analysis of downlink systems decouple the
precoding and the channel estimation problems. However, in cellular systems
with mobile users, these two problems are in fact tightly coupled. In this
paper, this coupling is explicitly studied by accounting for channel training
overhead and esti... |
0812.0659 | Probabilistic reasoning with answer sets | cs.AI cs.LO | This paper develops a declarative language, P-log, that combines logical and
probabilistic arguments in its reasoning. Answer Set Prolog is used as the
logical foundation, while causal Bayes nets serve as a probabilistic
foundation. We give several non-trivial examples and illustrate the use of
P-log for knowledge re... |
0812.0698 | Emergent Community Structure in Social Tagging Systems | cs.IR cs.CY cs.HC | A distributed classification paradigm known as collaborative tagging has been
widely adopted in new Web applications designed to manage and share online
resources. Users of these applications organize resources (Web pages, digital
photographs, academic papers) by associating with them freely chosen text
labels, or ta... |
0812.0743 | A Novel Clustering Algorithm Based on Quantum Games | cs.LG cs.AI cs.CV cs.GT cs.MA cs.NE quant-ph | Enormous successes have been made by quantum algorithms during the last
decade. In this paper, we combine the quantum game with the problem of data
clustering, and then develop a quantum-game-based clustering algorithm, in
which data points in a dataset are considered as players who can make decisions
and implement q... |
0812.0759 | A new Contrast Based Image Fusion using Wavelet Packets | cs.IT cs.MM math.IT | Image Fusion, a technique which combines complimentary information from
different images of the same scene so that the fused image is more suitable for
segmentation, feature extraction, object recognition and Human Visual System.
In this paper, a simple yet efficient algorithm is presented based on contrast
using wav... |
0812.0790 | Justifications for Logic Programs under Answer Set Semantics | cs.AI cs.PL | The paper introduces the notion of off-line justification for Answer Set
Programming (ASP). Justifications provide a graph-based explanation of the
truth value of an atom w.r.t. a given answer set. The paper extends also this
notion to provide justification of atoms during the computation of an answer
set (on-line ju... |
0812.0874 | Stroke Fragmentation based on Geometry Features and HMM | cs.HC cs.CV | Stroke fragmentation is one of the key steps in pen-based interaction. In
this letter, we present a unified HMM-based stroke fragmentation technique that
can do segment point location and primitive type determination simultaneously.
The geometry features included are used to evaluate local features, and the HMM
model... |
0812.0882 | Elagage d'un perceptron multicouches : utilisation de l'analyse de la
variance de la sensibilit\'e des param\`etres | cs.NE | The stucture determination of a neural network for the modelisation of a
system remain the core of the problem. Within this framework, we propose a
pruning algorithm of the network based on the use of the analysis of the
sensitivity of the variance of all the parameters of the network. This
algorithm will be tested o... |
0812.0885 | Elementary epistemological features of machine intelligence | cs.AI | Theoretical analysis of machine intelligence (MI) is useful for defining a
common platform in both theoretical and applied artificial intelligence (AI).
The goal of this paper is to set canonical definitions that can assist
pragmatic research in both strong and weak AI. Described epistemological
features of machine i... |
0812.0933 | Decision trees are PAC-learnable from most product distributions: a
smoothed analysis | cs.LG cs.CC | We consider the problem of PAC-learning decision trees, i.e., learning a
decision tree over the n-dimensional hypercube from independent random labeled
examples. Despite significant effort, no polynomial-time algorithm is known for
learning polynomial-sized decision trees (even trees of any super-constant
size), even... |
0812.0972 | Network Protection Codes: Providing Self-healing in Autonomic Networks
Using Network Coding | cs.NI cs.IT math.IT | Agile recovery from link failures in autonomic communication networks is
essential to increase robustness, accessibility, and reliability of data
transmission. However, this must be done with the least amount of protection
resources, while using simple management plane functionality. Recently, network
coding has been... |
0812.1014 | Adaptive Spam Detection Inspired by a Cross-Regulation Model of Immune
Dynamics: A Study of Concept Drift | cs.AI cs.IR nlin.AO | This paper proposes a novel solution to spam detection inspired by a model of
the adaptive immune system known as the crossregulation model. We report on the
testing of a preliminary algorithm on six e-mail corpora. We also compare our
results statically and dynamically with those obtained by the Naive Bayes
classifi... |
0812.1029 | Uncovering protein interaction in abstracts and text using a novel
linear model and word proximity networks | cs.IR cs.LG | We participated in three of the protein-protein interaction subtasks of the
Second BioCreative Challenge: classification of abstracts relevant for
protein-protein interaction (IAS), discovery of protein pairs (IPS) and text
passages characterizing protein interaction (ISS) in full text documents. We
approached the ab... |
0812.1091 | Communicating the Difference of Correlated Gaussian Sources Over a MAC | cs.IT math.IT | This paper considers the problem of transmitting the difference of two
jointly Gaussian sources over a two-user additive Gaussian noise multiple
access channel (MAC). The goal is to recover this difference within an average
mean squared error distortion criterion. Each transmitter has access to only
one of the two Ga... |
0812.1094 | S\'election de la structure d'un perceptron multicouches pour la
r\'eduction dun mod\`ele de simulation d'une scierie | cs.NE | Simulation is often used to evaluate the relevance of a Directing Program of
Production (PDP) or to evaluate its impact on detailed sc\'enarii of
scheduling. Within this framework, we propose to reduce the complexity of a
model of simulation by exploiting a multilayer perceptron. A main phase of the
modeling of one s... |
0812.1119 | An analysis of a random algorithm for estimating all the matchings | cs.GR cs.AI | Counting the number of all the matchings on a bipartite graph has been
transformed into calculating the permanent of a matrix obtained from the
extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach
(RM) to approximate the permanent, which just yields a critical ratio
O($n\omega(n)$) for almost... |
0812.1126 | Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators | cs.AI cs.DS | In this paper we examine sorting on the assumption that we do not know in
advance which way to sort a sequence of numbers and we set at work simple local
comparison and swap operators whose repeating application ends up in sorted
sequences. These are the basic elements of Emerge-Sort, our approach to
self-organizing ... |
0812.1155 | Complex Agent Networks explaining the HIV epidemic among homosexual men
in Amsterdam | cs.MA q-bio.PE | Simulating the evolution of the Human Immunodeficiency Virus (HIV) epidemic
requires a detailed description of the population network, especially for small
populations in which individuals can be represented in detail and accuracy. In
this paper, we introduce the concept of a Complex Agent Network(CAN) to model
the H... |
0812.1203 | An Efficient Adaptive Distributed Space-Time Coding Scheme for
Cooperative Relaying | cs.IT math.IT | A non-regenerative dual-hop wireless system based on a distributed space-time
coding strategy is considered. It is assumed that each relay retransmits an
appropriately scaled space-time coded version of its received signal. The main
goal of this paper is to investigate a power allocation strategy in relay
stations, w... |
0812.1244 | Decomposition Principles and Online Learning in Cross-Layer Optimization
for Delay-Sensitive Applications | cs.MM cs.LG | In this paper, we propose a general cross-layer optimization framework in
which we explicitly consider both the heterogeneous and dynamically changing
characteristics of delay-sensitive applications and the underlying time-varying
network conditions. We consider both the independently decodable data units
(DUs, e.g. ... |
0812.1340 | Obtaining Depth Maps From Color Images By Region Based Stereo Matching
Algorithms | cs.CV | In the paper, region based stereo matching algorithms are developed for
extraction depth information from two color stereo image pair. A filter
eliminating unreliable disparity estimation was used for increasing reliability
of the disparity map. Obtained results by algorithms were represented and
compared.
|
0812.1357 | A Novel Clustering Algorithm Based on Quantum Random Walk | cs.LG | The enormous successes have been made by quantum algorithms during the last
decade. In this paper, we combine the quantum random walk (QRW) with the
problem of data clustering, and develop two clustering algorithms based on the
one dimensional QRW. Then, the probability distributions on the positions
induced by QRW i... |
0812.1394 | Conceptual approach through an annotation process for the representation
and the information contents enhancement in economic intelligence (EI) | cs.IR | In the era of the information society, the impact of the information systems
on the economy of material and immaterial is certainly perceptible. With
regards to the information resources of an organization, the annotation
involved to enrich informational content, to track the intellectual activities
on a document and... |
0812.1405 | Cognitive Coexistence between Infrastructure and Ad-hoc Systems | cs.IT math.IT | The rapid proliferation of wireless systems makes interference management
more and more important. This paper presents a novel cognitive coexistence
framework, which enables an infrastructure system to reduce interference to
ad-hoc or peer-to-peer communication links in close proximity. Motivated by the
superior reso... |
0812.1462 | Logic programs with propositional connectives and aggregates | cs.AI | Answer set programming (ASP) is a logic programming paradigm that can be used
to solve complex combinatorial search problems. Aggregates are an ASP construct
that plays an important role in many applications. Defining a satisfactory
semantics of aggregates turned out to be a difficult problem, and in this paper
we pr... |
0812.1553 | Analysis of Energy Efficiency in Fading Channels under QoS Constraints | cs.IT math.IT | Energy efficiency in fading channels in the presence of Quality of Service
(QoS) constraints is studied. Effective capacity, which provides the maximum
arrival rate that a wireless channel can sustain while satisfying statistical
QoS constraints, is considered. Spectral efficiency--bit energy tradeoff is
analyzed in ... |
0812.1554 | Molecular communication: Physically realistic models and achievable
information rates | cs.IT math.IT | Molecular communication is a biologically-inspired method of communication
with attractive properties for microscale and nanoscale devices. In molecular
communication, messages are transmitted by releasing a pattern of molecules at
a transmitter, which propagate through a fluid medium towards a receiver. In
this pape... |
0812.1557 | To Cooperate, or Not to Cooperate in Imperfectly-Known Fading Channels | cs.IT math.IT | In this paper, communication over imperfectly-known fading channels with
different degrees of cooperation is studied. The three-node relay channel is
considered. It is assumed that communication starts with the network training
phase in which the receivers estimate the fading coefficients of their
respective channels... |
0812.1558 | Pilot-Symbol-Assisted Communications with Noncausal and Causal Wiener
Filters | cs.IT math.IT | In this paper, pilot-assisted transmission over time-selective flat fading
channels is studied. It is assumed that noncausal and causal Wiener filters are
employed at the receiver to perform channel estimation with the aid of training
symbols sent periodically by the transmitter. For both filters, the variances
of es... |
0812.1560 | Achievable Rates and Training Optimization for Fading Relay Channels
with Memory | cs.IT math.IT | In this paper, transmission over time-selective, flat fading relay channels
is studied. It is assumed that channel fading coefficients are not known a
priori. Transmission takes place in two phases: network training phase and data
transmission phase. In the training phase, pilot symbols are sent and the
receivers emp... |
0812.1597 | Transmission Techniques for Relay-Interference Networks | cs.IT math.IT | In this paper we study the relay-interference wireless network, in which
relay (helper) nodes are to facilitate competing information flows over a
wireless network. We examine this in the context of a deterministic wireless
interaction model, which eliminates the channel noise and focuses on the signal
interactions. ... |
0812.1599 | Multi-Agent Reinforcement Learning and Genetic Policy Sharing | cs.MA cs.AI | The effects of policy sharing between agents in a multi-agent dynamical
system has not been studied extensively. I simulate a system of agents
optimizing the same task using reinforcement learning, to study the effects of
different population densities and policy sharing. I demonstrate that sharing
policies decreases... |
0812.1629 | An application of the O'Nan-Scott theorem to the group generated by the
round functions of an AES-like cipher | math.GR cs.IT math.IT | In a previous paper, we had proved that the permutation group generated by
the round functions of an AES-like cipher is primitive. Here we apply the O'Nan
Scott classification of primitive groups to prove that this group is the
alternating group.
|
0812.1713 | Secret Communication with Feedback | cs.IT math.IT | Secure communication with feedback is studied. An achievability scheme in
which the backward channel is used to generate a shared secret key is proposed.
The scenario of binary symmetric forward and backward channels is considered,
and a combination of the proposed scheme and Maurer's coding scheme is shown to
achiev... |
0812.1778 | The Impact of QoS Constraints on the Energy Efficiency of Fixed-Rate
Wireless Transmissions | cs.IT math.IT | Transmission over wireless fading channels under quality of service (QoS)
constraints is studied when only the receiver has channel side information.
Being unaware of the channel conditions, transmitter is assumed to send the
information at a fixed rate. Under these assumptions, a two-state (ON-OFF)
transmission mode... |
0812.1780 | On the Energy Efficiency of Orthogonal Signaling | cs.IT math.IT | In this paper, transmission over the additive white Gaussian noise (AWGN)
channel, and coherent and noncoherent fading channels using M-ary orthogonal
frequency-shift keying (FSK) or on-off frequency-shift keying (OOFSK) is
considered. The receiver is assumed to perform hard-decision detection. In this
setting, energ... |
0812.1811 | Stability of graph communities across time scales | physics.soc-ph cs.IR physics.data-an | The complexity of biological, social and engineering networks makes it
desirable to find natural partitions into communities that can act as
simplified descriptions and provide insight into the structure and function of
the overall system. Although community detection methods abound, there is a
lack of consensus on h... |
0812.1843 | Identification of parameters underlying emotions and a classification of
emotions | cs.AI | The standard classification of emotions involves categorizing the expression
of emotions. In this paper, parameters underlying some emotions are identified
and a new classification based on these parameters is suggested.
|
0812.1857 | Dependence Balance Based Outer Bounds for Gaussian Networks with
Cooperation and Feedback | cs.IT math.IT | We obtain new outer bounds on the capacity regions of the two-user multiple
access channel with generalized feedback (MAC-GF) and the two-user interference
channel with generalized feedback (IC-GF). These outer bounds are based on the
idea of dependence balance which was proposed by Hekstra and Willems [1]. To
illust... |
0812.1869 | Convex Sparse Matrix Factorizations | cs.LG | We present a convex formulation of dictionary learning for sparse signal
decomposition. Convexity is obtained by replacing the usual explicit upper
bound on the dictionary size by a convex rank-reducing term similar to the
trace norm. In particular, our formulation introduces an explicit trade-off
between size and sp... |
0812.2049 | Consensus Answers for Queries over Probabilistic Databases | cs.DB | We address the problem of finding a "best" deterministic query answer to a
query over a probabilistic database. For this purpose, we propose the notion of
a consensus world (or a consensus answer) which is a deterministic world
(answer) that minimizes the expected distance to the possible worlds (answers).
This probl... |
0812.2195 | Equivalence of SQL Queries in Presence of Embedded Dependencies | cs.DB | We consider the problem of finding equivalent minimal-size reformulations of
SQL queries in presence of embedded dependencies [1]. Our focus is on
select-project-join (SPJ) queries with equality comparisons, also known as safe
conjunctive (CQ) queries, possibly with grouping and aggregation. For SPJ
queries, the sema... |
0812.2202 | Greedy Signal Recovery Review | math.NA cs.IT math.IT | The two major approaches to sparse recovery are L1-minimization and greedy
methods. Recently, Needell and Vershynin developed Regularized Orthogonal
Matching Pursuit (ROMP) that has bridged the gap between these two approaches.
ROMP is the first stable greedy algorithm providing uniform guarantees.
Even more recent... |
0812.2275 | Secrecy capacity of a class of orthogonal relay eavesdropper channels | cs.IT math.IT | The secrecy capacity of relay channels with orthogonal components is studied
in the presence of an additional passive eavesdropper node. The relay and
destination receive signals from the source on two orthogonal channels such
that the destination also receives transmissions from the relay on its channel.
The eavesdr... |
0812.2291 | Characterizing Truthful Multi-Armed Bandit Mechanisms | cs.DS cs.GT cs.LG | We consider a multi-round auction setting motivated by pay-per-click auctions
for Internet advertising. In each round the auctioneer selects an advertiser
and shows her ad, which is then either clicked or not. An advertiser derives
value from clicks; the value of a click is her private information. Initially,
neither... |
0812.2301 | Cooperative Hybrid ARQ Protocols: Unified Frameworks for Protocol
Analysis | cs.IT math.IT | Cooperative hybrid-ARQ (HARQ) protocols, which can exploit the spatial and
temporal diversities, have been widely studied. The efficiency of cooperative
HARQ protocols is higher than that of cooperative protocols, because
retransmissions are only performed when necessary. We classify cooperative HARQ
protocols as thr... |
0812.2309 | Classification of Cell Images Using MPEG-7-influenced Descriptors and
Support Vector Machines in Cell Morphology | stat.AP cs.CV stat.ML | Counting and classifying blood cells is an important diagnostic tool in
medicine. Support Vector Machines are increasingly popular and efficient and
could replace artificial neural network systems. Here a method to classify
blood cells is proposed using SVM. A set of statistics on images are
implemented in C++. The M... |
0812.2313 | Urologic robots and future directions | cs.RO | PURPOSE OF REVIEW: Robot-assisted laparoscopic surgery in urology has gained
immense popularity with the daVinci system, but a lot of research teams are
working on new robots. The purpose of this study is to review current urologic
robots and present future development directions. RECENT FINDINGS: Future
systems are ... |
0812.2324 | The MIMO Iterative Waterfilling Algorithm | cs.IT cs.GT math.IT | This paper considers the non-cooperative maximization of mutual information
in the vector Gaussian interference channel in a fully distributed fashion via
game theory. This problem has been widely studied in a number of works during
the past decade for frequency-selective channels, and recently for the more
general M... |
0812.2379 | On the Decoder Error Probability of Rank Metric Codes and
Constant-Dimension Codes | cs.IT math.IT | Rank metric codes and constant-dimension codes (CDCs) have been considered
for error control in random network coding. Since decoder errors are more
detrimental to system performance than decoder failures, in this paper we
investigate the decoder error probability (DEP) of bounded distance decoders
(BDDs) for rank me... |
0812.2388 | Physics of risk and uncertainty in quantum decision making | physics.soc-ph cs.AI quant-ph | The Quantum Decision Theory, developed recently by the authors, is applied to
clarify the role of risk and uncertainty in decision making and in particular
in relation to the phenomenon of dynamic inconsistency. By formulating this
notion in precise mathematical terms, we distinguish three types of
inconsistency: tim... |
0812.2405 | A New Trend in Optimization on Multi Overcomplete Dictionary toward
Inpainting | cs.MM cs.AI | Recently, great attention was intended toward overcomplete dictionaries and
the sparse representations they can provide. In a wide variety of signal
processing problems, sparsity serves a crucial property leading to high
performance. Inpainting, the process of reconstructing lost or deteriorated
parts of images or vi... |
0812.2409 | Sensing Models and Its Impact on Network Coverage in Wireless Sensor
Network | cs.IT math.IT | Network coverage of wireless sensor network (WSN) means how well an area of
interest is being monitored by the deployed network. It depends mainly on
sensing model of nodes. In this paper, we present three types of sensing models
viz. Boolean sensing model, shadow-fading sensing model and Elfes sensing
model. We inve... |
0812.2411 | Probabilistic SVM/GMM Classifier for Speaker-Independent Vowel
Recognition in Continues Speech | cs.MM cs.AI | In this paper, we discuss the issues in automatic recognition of vowels in
Persian language. The present work focuses on new statistical method of
recognition of vowels as a basic unit of syllables. First we describe a vowel
detection system then briefly discuss how the detected vowels can feed to
recognition unit. A... |
0812.2454 | On the statistical physics of directed polymers in a random medium and
their relation to tree codes | cs.IT math.IT | Using well-known results from statistical physics, concerning the almost-sure
behavior of the free energy of directed polymers in a random medium, we prove
that random tree codes achieve the distortion-rate function almost surely under
a certain symmetry condition.
|
0812.2458 | Square Complex Orthogonal Designs with no Zero Entry for any $2^m$
Antennas | 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
zeros. The zeros in the designs result in high peak-to-average power ratio and
also impose a severe constraint on hardware implementation of the code while
turning ... |
0812.2535 | Pattern Recognition and Memory Mapping using Mirroring Neural Networks | cs.AI cs.NE | In this paper, we present a new kind of learning implementation to recognize
the patterns using the concept of Mirroring Neural Network (MNN) which can
extract information from distinct sensory input patterns and perform pattern
recognition tasks. It is also capable of being used as an advanced associative
memory whe... |
0812.2559 | A Separation Algorithm for Improved LP-Decoding of Linear Block Codes | cs.IT math.IT | Maximum Likelihood (ML) decoding is the optimal decoding algorithm for
arbitrary linear block codes and can be written as an Integer Programming (IP)
problem. Feldman et al. relaxed this IP problem and presented Linear
Programming (LP) based decoding algorithm for linear block codes. In this
paper, we propose a new I... |
0812.2574 | Feature Selection By KDDA For SVM-Based MultiView Face Recognition | cs.CV cs.LG | Applications such as face recognition that deal with high-dimensional data
need a mapping technique that introduces representation of low-dimensional
features with enhanced discriminatory power and a proper classifier, able to
classify those complex features. Most of traditional Linear Discriminant
Analysis suffer fr... |
0812.2575 | Face Detection Using Adaboosted SVM-Based Component Classifier | cs.CV cs.LG | Recently, Adaboost has been widely used to improve the accuracy of any given
learning algorithm. In this paper we focus on designing an algorithm to employ
combination of Adaboost with Support Vector Machine as weak component
classifiers to be used in Face Detection Task. To obtain a set of effective
SVM-weaklearner ... |
0812.2602 | The statistical restricted isometry property and the Wigner semicircle
distribution of incoherent dictionaries | cs.IT cs.DM math.IT math.PR | In this article we present a statistical version of the Candes-Tao restricted
isometry property (SRIP for short) which holds in general for any incoherent
dictionary which is a disjoint union of orthonormal bases. In addition, we show
that, under appropriate normalization, the eigenvalues of the associated Gram
matri... |
0812.2702 | Standard Logics Are Valuation-Nonmonotonic | cs.LO cs.AI quant-ph | It has recently been discovered that both quantum and classical propositional
logics can be modelled by classes of non-orthomodular and thus non-distributive
lattices that properly contain standard orthomodular and Boolean classes,
respectively. In this paper we prove that these logics are complete even for
those cla... |
0812.2709 | Variations on a theme by Schalkwijk and Kailath | cs.IT math.IT | Schalkwijk and Kailath (1966) developed a class of block codes for Gaussian
channels with ideal feedback for which the probability of decoding error
decreases as a second-order exponent in block length for rates below capacity.
This well-known but surprising result is explained and simply derived here in
terms of a r... |
0812.2719 | Secret Sharing over Fast-Fading MIMO Wiretap Channels | cs.IT math.IT | Secret sharing over the fast-fading MIMO wiretap channel is considered. A
source and a destination try to share secret information over a fast-fading
MIMO channel in the presence of a wiretapper who also makes channel
observations that are different from but correlated to those made by the
destination. An interactive... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.