id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0907.2393 | Multiscale Network Reduction Methodologies: Bistochastic and Disparity
Filtering of Human Migration Flows between 3,000+ U. S. Counties | physics.soc-ph cs.SI physics.data-an stat.AP | To control for multiscale effects in networks, one can transform the matrix
of (in general) weighted, directed internodal flows to bistochastic
(doubly-stochastic) form, using the iterative proportional fitting
(Sinkhorn-Knopp) procedure, which alternatively scales row and column sums to
all equal 1. The dominant ent... |
0907.2412 | Design of Pulse Shapes Based on Sampling with Gaussian Prefilter | cs.IT math.IT | Two new pulse shapes for communications are presented. The first pulse shape
generates a set of pulses without intersymbol interferenc (ISI) or is ISI-free
for short. In the neighbourhood of the origin it is similar in shape to the
classical cardinal sine function but is of exponential decay at infinity. This
pulse s... |
0907.2452 | Pattern Based Term Extraction Using ACABIT System | cs.CL | In this paper, we propose a pattern-based term extraction approach for
Japanese, applying ACABIT system originally developed for French. The proposed
approach evaluates termhood using morphological patterns of basic terms and
term variants. After extracting term candidates, ACABIT system filters out
non-terms from th... |
0907.2455 | Parallel Opportunistic Routing in Wireless Networks | cs.IT math.IT | We study benefits of opportunistic routing in a large wireless ad hoc network
by examining how the power, delay, and total throughput scale as the number of
source- destination pairs increases up to the operating maximum. Our
opportunistic routing is novel in a sense that it is massively parallel, i.e.,
it is perform... |
0907.2465 | The Transactional Nature of Quantum Information | quant-ph cs.IT math.IT | Information, in its communications sense, is a transactional property. If the
received signals communicate choices made by the sender of the signals, then
information has been transmitter by the sender to the receiver. Given this
reality, the potential information in an unknown pure quantum state should be
non-zero. ... |
0907.2471 | Benchmarking Declarative Approximate Selection Predicates | cs.DB cs.IR | Declarative data quality has been an active research topic. The fundamental
principle behind a declarative approach to data quality is the use of
declarative statements to realize data quality primitives on top of any
relational data source. A primary advantage of such an approach is the ease of
use and integration w... |
0907.2510 | Capacity of a Class of Linear Binary Field Multi-source Relay Networks | cs.IT math.IT | Characterizing the capacity region of multi-source wireless relay networks is
one of the fundamental issues in network information theory. The problem is,
however, quite challenging due to inter-user interference when there exist
multiple source--destination (S--D) pairs in the network. By focusing on a
special class... |
0907.2599 | Multiple-Input Multiple-Output Gaussian Broadcast Channels with Common
and Confidential Messages | cs.IT math.IT | This paper considers the problem of the multiple-input multiple-output (MIMO)
Gaussian broadcast channel with two receivers (receivers 1 and 2) and two
messages: a common message intended for both receivers and a confidential
message intended only for receiver 1 but needing to be kept asymptotically
perfectly secure ... |
0907.2601 | Decompounding on compact Lie groups | cs.IT math.IT math.ST stat.TH | Noncommutative harmonic analysis is used to solve a nonparametric estimation
problem stated in terms of compound Poisson processes on compact Lie groups.
This problem of decompounding is a generalization of a similar classical
problem. The proposed solution is based on a char- acteristic function method.
The treated ... |
0907.2682 | Permutation Arrays Under the Chebyshev Distance | cs.IT math.IT | An (n,d) permutation array (PA) is a set of permutations of length n with the
property that the distance (under some metric) between any two permutations in
the array is at least d. They became popular recently for communication over
power lines. Motivated by an application to flash memories, in this paper the
metric... |
0907.2702 | Interference Channels with Destination Cooperation | cs.IT math.IT | Interference is a fundamental feature of the wireless channel. To better
understand the role of cooperation in interference management, the two-user
Gaussian interference channel where the destination nodes can cooperate by
virtue of being able to both transmit and receive is studied. The sum-capacity
of this channel... |
0907.2759 | On Cyclic and Nearly Cyclic Multiagent Interactions in the Plane | cs.MA cs.RO | We discuss certain types of cyclic and nearly cyclic interactions among N
"point"-agents in the plane, leading to formations of interesting limiting
geometric configurations. Cyclic pursuit and local averaging interactions have
been analyzed in the context of multi-agent gathering. In this paper, we
consider some nea... |
0907.2775 | Modelling Concurrent Behaviors in the Process Specification Language | cs.AI | In this paper, we propose a first-order ontology for generalized stratified
order structure. We then classify the models of the theory using
model-theoretic techniques. An ontology mapping from this ontology to the core
theory of Process Specification Language is also discussed.
|
0907.2859 | General Spectrum Sensing in Cognitive Radio Networks | cs.IT math.IT | The successful operation of cognitive radio (CR) between CR transmitter and
CR receiver (CR link) relies on reliable spectrum sensing. To network CRs
requires spectrum sensing at CR transmitter and further information regarding
the spectrum availability at CR receiver. Redefining the spectrum sensing along
with stati... |
0907.2868 | Scalable Probabilistic Similarity Ranking in Uncertain Databases
(Technical Report) | cs.DB cs.IR | This paper introduces a scalable approach for probabilistic top-k similarity
ranking on uncertain vector data. Each uncertain object is represented by a set
of vector instances that are assumed to be mutually-exclusive. The objective is
to rank the uncertain data according to their distance to a reference object.
We ... |
0907.2896 | Decentralized Admission Control for Power-Controlled Wireless Links | cs.IT math.IT | This paper deals with the problem of admission control/channel access in
power-controlled decentralized wireless networks, in which the
quality-of-service (QoS) is expressed in terms of the signal-to-interference
ratio (SIR). We analyze a previously proposed admission control algorithm,
which was designed to maintain... |
0907.2951 | Untangling the Braid: Finding Outliers in a Set of Streams | cs.DB cs.DS | Monitoring the performance of large shared computing systems such as the
cloud computing infrastructure raises many challenging algorithmic problems.
One common problem is to track users with the largest deviation from the norm
(outliers), for some measure of performance. Taking a stream-computing
perspective, we can... |
0907.2955 | General Deviants: An Analysis of Perturbations in Compressed Sensing | cs.IT math.IT | We analyze the Basis Pursuit recovery of signals with general perturbations.
Previous studies have only considered partially perturbed observations Ax + e.
Here, x is a signal which we wish to recover, A is a full-rank matrix with more
columns than rows, and e is simple additive noise. Our model also incorporates
per... |
0907.2984 | Fountain Communication using Concatenated Codes | cs.IT math.IT | This paper extends linear-complexity concatenated coding schemes to fountain
communication over the discrete-time memoryless channel. Achievable fountain
error exponents for one-level and multi-level concatenated fountain codes are
derived. It is also shown that concatenated coding schemes possess interesting
propert... |
0907.2990 | The Single Machine Total Weighted Tardiness Problem - Is it (for
Metaheuristics) a Solved Problem ? | cs.AI | The article presents a study of rather simple local search heuristics for the
single machine total weighted tardiness problem (SMTWTP), namely hillclimbing
and Variable Neighborhood Search. In particular, we revisit these approaches
for the SMTWTP as there appears to be a lack of appropriate/challenging
benchmark ins... |
0907.2993 | Improvements for multi-objective flow shop scheduling by Pareto Iterated
Local Search | cs.AI | The article describes the proposition and application of a local search
metaheuristic for multi-objective optimization problems. It is based on two
main principles of heuristic search, intensification through variable
neighborhoods, and diversification through perturbations and successive
iterations in favorable regi... |
0907.3099 | Graph Theory and Optimization Problems for Very Large Networks | cs.NI cs.AI | Graph theory provides a primary tool for analyzing and designing computer
communication networks. In the past few decades, Graph theory has been used to
study various types of networks, including the Internet, wide Area Networks,
Local Area Networks, and networking protocols such as border Gateway Protocol,
Open shor... |
0907.3183 | Why Did My Query Slow Down? | cs.DB | Many enterprise environments have databases running on network-attached
server-storage infrastructure (referred to as Storage Area Networks or SANs).
Both the database and the SAN are complex systems that need their own separate
administrative teams. This paper puts forth the vision of an innovative
management framew... |
0907.3200 | A Mathematical Unification of Geometric Crossovers Defined on Phenotype
Space | cs.NE cs.DM | Geometric crossover is a representation-independent definition of crossover
based on the distance of the search space interpreted as a metric space. It
generalizes the traditional crossover for binary strings and other important
recombination operators for the most frequently used representations. Using a
distance ta... |
0907.3202 | Mathematical Interpretation between Genotype and Phenotype Spaces and
Induced Geometric Crossovers | cs.NE cs.DM | In this paper, we present that genotype-phenotype mapping can be
theoretically interpreted using the concept of quotient space in mathematics.
Quotient space can be considered as mathematically-defined phenotype space in
the evolutionary computation theory. The quotient geometric crossover has the
effect of reducing ... |
0907.3209 | Registration of Standardized Histological Images in Feature Space | cs.CV | In this paper, we propose three novel and important methods for the
registration of histological images for 3D reconstruction. First, possible
intensity variations and nonstandardness in images are corrected by an
intensity standardization process which maps the image scale into a standard
scale where the similar int... |
0907.3215 | Fully Automatic 3D Reconstruction of Histological Images | cs.CV | In this paper, we propose a computational framework for 3D volume
reconstruction from 2D histological slices using registration algorithms in
feature space. To improve the quality of reconstructed 3D volume, first,
intensity variations in images are corrected by an intensity standardization
process which maps image i... |
0907.3218 | Parallel AdaBoost Algorithm for Gabor Wavelet Selection in Face
Recognition | cs.CV | In this paper, the problem of automatic Gabor wavelet selection for face
recognition is tackled by introducing an automatic algorithm based on Parallel
AdaBoosting method. Incorporating mutual information into the algorithm leads
to the selection procedure not only based on classification accuracy but also
on efficie... |
0907.3220 | Inter Genre Similarity Modelling For Automatic Music Genre
Classification | cs.SD cs.AI stat.ML | Music genre classification is an essential tool for music information
retrieval systems and it has been finding critical applications in various
media platforms. Two important problems of the automatic music genre
classification are feature extraction and classifier design. This paper
investigates inter-genre similar... |
0907.3291 | The Compound Capacity of Polar Codes | cs.IT math.IT | We consider the compound capacity of polar codes under successive
cancellation decoding for a collection of binary-input memoryless
output-symmetric channels. By deriving a sequence of upper and lower bounds, we
show that in general the compound capacity under successive decoding is
strictly smaller than the unrestri... |
0907.3315 | Effective Personalized Recommendation in Collaborative Tagging Systems | cs.IR | Recently, collaborative tagging systems have attracted more and more
attention and have been widely applied in web systems. Tags provide highly
abstracted information about personal preferences and item content, and are
therefore potential to help in improving better personalized recommendations.
In this paper, we pr... |
0907.3340 | A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for
Compressed Sensing | cs.NA cs.IT math.IT | Problems in signal processing and medical imaging often lead to calculating
sparse solutions to under-determined linear systems. Methodologies for solving
this problem are presented as background to the method used in this work where
the problem is reformulated as an unconstrained convex optimization problem.
The lea... |
0907.3341 | Opportunistic Secrecy with a Strict Delay Constraint | cs.IT math.IT | We investigate the delay limited secrecy capacity of the flat fading channel
under two different assumptions on the available transmitter channel state
information (CSI). The first scenario assumes perfect prior knowledge of both
the main and eavesdropper channel gains. Here, upper and lower bounds on the
delay limit... |
0907.3342 | Neural Modeling and Control of Diesel Engine with Pollution Constraints | cs.LG cs.NE | The paper describes a neural approach for modelling and control of a
turbocharged Diesel engine. A neural model, whose structure is mainly based on
some physical equations describing the engine behaviour, is built for the
rotation speed and the exhaust gas opacity. The model is composed of three
interconnected neural... |
0907.3387 | Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme | cs.IT math.IT | We study error-correcting codes for permutations under the infinity norm,
motivated by a novel storage scheme for flash memories call rank modulation. In
this scheme, a set of $n$ flash cells are combined to create a single virtual
multi-level cell. Information is stored in the permutation induced by the cell
charge ... |
0907.3397 | The Gray Image of Codes over Finite Chain Rings | math.RA cs.IT math.IT | The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over
finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic
codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map
is introduced for this type of rings. We prove that the Gray image of a linear
$(1 - \g... |
0907.3445 | Investigating the Change of Web Pages' Titles Over Time | cs.IR cs.DL | Inaccessible web pages are part of the browsing experience. The content of
these pages however is often not completely lost but rather missing. Lexical
signatures (LS) generated from the web pages' textual content have been shown
to be suitable as search engine queries when trying to discover a (missing) web
page. Si... |
0907.3493 | Secure Network Coding for Wiretap Networks of Type II | cs.IT math.IT | We consider the problem of securing a multicast network against a wiretapper
that can intercept the packets on a limited number of arbitrary network edges
of its choice. We assume that the network employs the network coding technique
to simultaneously deliver the packets available at the source to all the
receivers.
... |
0907.3574 | Message Passing Algorithms for Compressed Sensing | cs.IT cond-mat.dis-nn math.IT stat.CO | Compressed sensing aims to undersample certain high-dimensional signals, yet
accurately reconstruct them by exploiting signal characteristics. Accurate
reconstruction is possible when the object to be recovered is sufficiently
sparse in a known basis. Currently, the best known sparsity-undersampling
tradeoff is achie... |
0907.3576 | Recovering Signals from Lowpass Data | cs.IT math.IT | The problem of recovering a signal from its low frequency components occurs
often in practical applications due to the lowpass behavior of many physical
systems. Here we study in detail conditions under which a signal can be
determined from its low-frequency content. We focus on signals in
shift-invariant spaces gene... |
0907.3604 | Image Sampling with Quasicrystals | cs.CV cs.GR | We investigate the use of quasicrystals in image sampling. Quasicrystals
produce space-filling, non-periodic point sets that are uniformly discrete and
relatively dense, thereby ensuring the sample sites are evenly spread out
throughout the sampled image. Their self-similar structure can be attractive
for creating sa... |
0907.3616 | Optimal Routing and Power Control for a Single Cell, Dense, Ad Hoc
Wireless Network | cs.NI cs.IT math.IT | We consider a dense, ad hoc wireless network, confined to a small region. The
wireless network is operated as a single cell, i.e., only one successful
transmission is supported at a time. Data packets are sent between
sourcedestination pairs by multihop relaying. We assume that nodes
self-organise into a multihop net... |
0907.3654 | Optimization of Synthesis Oversampled Complex Filter Banks | cs.IT cs.SY eess.SY math.IT math.OC | An important issue with oversampled FIR analysis filter banks (FBs) is to
determine inverse synthesis FBs, when they exist. Given any complex oversampled
FIR analysis FB, we first provide an algorithm to determine whether there
exists an inverse FIR synthesis system. We also provide a method to ensure the
Hermitian s... |
0907.3666 | Various thresholds for $\ell_1$-optimization in compressed sensing | cs.IT math.IT | Recently, \cite{CRT,DonohoPol} theoretically analyzed the success of a
polynomial $\ell_1$-optimization algorithm in solving an under-determined
system of linear equations. In a large dimensional and statistical context
\cite{CRT,DonohoPol} proved that if the number of equations (measurements in
the compressed sensin... |
0907.3679 | Block-length dependent thresholds in block-sparse compressed sensing | cs.IT math.IT | One of the most basic problems in compressed sensing is solving an
under-determined system of linear equations. Although this problem seems rather
hard certain $\ell_1$-optimization algorithm appears to be very successful in
solving it. The recent work of \cite{CRT,DonohoPol} rigorously proved (in a
large dimensional... |
0907.3781 | Un syst\`eme modulaire d'acquisition automatique de traductions \`a
partir du Web | cs.CL | We present a method of automatic translation (French/English) of Complex
Lexical Units (CLU) for aiming at extracting a bilingual lexicon. Our modular
system is based on linguistic properties (compositionality, polysemy, etc.).
Different aspects of the multilingual Web are used to validate candidate
translations and ... |
0907.3819 | Self-adaptive web intrusion detection system | cs.NI cs.AI cs.MA | The evolution of the web server contents and the emergence of new kinds of
intrusions make necessary the adaptation of the intrusion detection systems
(IDS). Nowadays, the adaptation of the IDS requires manual -- tedious and
unreactive -- actions from system administrators. In this paper, we present a
self-adaptive i... |
0907.3823 | USUM: Update Summary Generation System | cs.IR | Huge amount of information is present in the World Wide Web and a large
amount is being added to it frequently. A query-specific summary of multiple
documents is very helpful to the user in this context. Currently, few systems
have been proposed for query-specific, extractive multi-document summarization.
If a summar... |
0907.3867 | Artificial Dendritic Cells: Multi-faceted Perspectives | cs.AI cs.CR cs.MA | Dendritic cells are the crime scene investigators of the human immune system.
Their function is to correlate potentially anomalous invading entities with
observed damage to the body. The detection of such invaders by dendritic cells
results in the activation of the adaptive immune system, eventually leading to
the re... |
0907.3970 | Infinite Families of Recursive Formulas Generating Power Moments of
Kloosterman Sums: Symplectic Case | math.NT cs.IT math.IT | In this paper, we construct two infinite families of binary linear codes
associated with double cosets with respect to certain maximal parabolic
subgroup of the symplectic group Sp(2n,q) Here q is a power of two. Then we
obtain an infinite family of recursive formulas for the power moments of
Kloosterman sums and tho... |
0907.3972 | Infinite Families of Recursive Formulas Generating Power Moments of
Kloosterman Sums: O\^{+}(2n, 2\^{r}) Case | math.NT cs.IT math.IT | In this paper, we construct four infinite families of binary linear codes
associated with double cosets with respect to certain maximal parabolic
subgroup of the orthogonal group O^+(2n,2^r). Here q is a power of two. Then we
obtain two infinite families of recursive formulas for the power moments of
Kloosterman sums... |
0907.3974 | Simple Recursive Formulas Generating Power Moments of Kloosterman Sums | math.NT cs.IT math.IT | In this paper, we construct four binary linear codes closely connected with
certain exponential sums over the finite field F_q and F_q-{0,1}. Here q is a
power of two. Then we obtain four recursive formulas for the power moments of
Kloosterman sums in terms of the frequencies of weights in the codes. This is
done via... |
0907.3986 | Contextual Bandits with Similarity Information | cs.DS cs.LG | In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence
of choices. In each round it chooses from a time-invariant set of alternatives
and receives the payoff associated with this alternative. While the case of
small strategy sets is by now well-understood, a lot of recent work has focused
on MAB ... |
0907.4031 | Cognitive MAC Protocols for General Primary Network Models | cs.NI cs.IT math.IT | We consider the design of cognitive Medium Access Control (MAC) protocols
enabling a secondary (unlicensed) transmitter-receiver pair to communicate over
the idle periods of a set of primary (licensed) channels. More specifically, we
propose cognitive MAC protocols optimized for both slotted and un-slotted
primary ne... |
0907.4100 | Beyond Turing Machines | cs.AI | This paper discusses "computational" systems capable of "computing" functions
not computable by predefined Turing machines if the systems are not isolated
from their environment. Roughly speaking, these systems can change their finite
descriptions by interacting with their environment.
|
0907.4128 | Relativized hyperequivalence of logic programs for modular programming | cs.AI cs.LO | A recent framework of relativized hyperequivalence of programs offers a
unifying generalization of strong and uniform equivalence. It seems to be
especially well suited for applications in program optimization and modular
programming due to its flexibility that allows us to restrict, independently of
each other, the ... |
0907.4354 | Learning Object Location Predictors with Boosting and Grammar-Guided
Feature Extraction | cs.CV | We present BEAMER: a new spatially exploitative approach to learning object
detectors which shows excellent results when applied to the task of detecting
objects in greyscale aerial imagery in the presence of ambiguous and noisy
data. There are four main contributions used to produce these results. First,
we introduc... |
0907.4385 | The Cost of Stability in Coalitional Games | cs.GT cs.AI cs.CC | A key question in cooperative game theory is that of coalitional stability,
usually captured by the notion of the \emph{core}--the set of outcomes such
that no subgroup of players has an incentive to deviate. However, some
coalitional games have empty cores, and any outcome in such a game is unstable.
In this paper... |
0907.4426 | Evolution of Digital Logic Functionality via a Genetic Algorithm | cs.NE | Digital logic forms the functional basics of most modern electronic equipment
and as such the creation of novel digital logic circuits is an active area of
computer engineering research. This study demonstrates that genetic algorithms
can be used to evolve functionally useful sets of logic gate interconnections
to cr... |
0907.4447 | Graphical Probabilistic Routing Model for OBS Networks with Realistic
Traffic Scenario | cs.NI cs.AI | Burst contention is a well-known challenging problem in Optical Burst
Switching (OBS) networks. Contention resolution approaches are always reactive
and attempt to minimize the BLR based on local information available at the
core node. On the other hand, a proactive approach that avoids burst losses
before they occur... |
0907.4471 | Strategies and performances of Soft Input Decryption | cs.IT cs.CR math.IT | This paper analyzes performance aspects of Soft Input Decryption and L
values. Soft Input Decryption is a novel method which uses L values (soft
output) of a SISO channel decoder for the correction of input of Soft Input
Decryption (SID blocks) which have been modified during the transmission over a
noisy channel. Th... |
0907.4509 | Pattern Recognition Theory of Mind | cs.AI | I propose that pattern recognition, memorization and processing are key
concepts that can be a principle set for the theoretical modeling of the mind
function. Most of the questions about the mind functioning can be answered by a
descriptive modeling and definitions from these principles. An understandable
consciousn... |
0907.4521 | Grassmannian Beamforming for MIMO-OFDM Systems with Frequency and
Spatially Correlated Channels Using Huffman Coding | cs.IT math.IT | Multiple input multiple output (MIMO) precoding is an efficient scheme that
may significantly enhance the communication link. However, this enhancement
comes with a cost. Many precoding schemes require channel knowledge at the
transmitter that is obtained through feedback from the receiver. Focusing on
the natural co... |
0907.4561 | Fact Sheet on Semantic Web | cs.AI | The report gives an overview about activities on the topic Semantic Web. It
has been released as technical report for the project "KTweb -- Connecting
Knowledge Technologies Communities" in 2003.
|
0907.4622 | Aneka: A Software Platform for .NET-based Cloud Computing | cs.DC cs.CE cs.NI cs.OS cs.PL cs.SE | Aneka is a platform for deploying Clouds developing applications on top of
it. It provides a runtime environment and a set of APIs that allow developers
to build .NET applications that leverage their computation on either public or
private clouds. One of the key features of Aneka is the ability of supporting
multiple... |
0907.4653 | Distributed MIMO radar using compressive sampling | cs.IT math.IT | A distributed MIMO radar is considered, in which the transmit and receive
antennas belong to nodes of a small scale wireless network. The transmit
waveforms could be uncorrelated, or correlated in order to achieve a desirable
beampattern. The concept of compressive sampling is employed at the receive
nodes in order t... |
0907.4697 | Unsupervised and Non Parametric Iterative Soft Bit Error Rate Estimation
for Any Communications System | cs.IT math.IT | This paper addresses the problem of unsupervised soft bit error rate (BER)
estimation for any communications system, where no prior knowledge either about
transmitted information bits, or the transceiver scheme is available. We show
that the problem of BER estimation is equivalent to estimating the conditional
probab... |
0907.4705 | Compressive Sensing for MIMO Radar | cs.IT math.IT | Multiple-input multiple-output (MIMO) radar systems have been shown to
achieve superior resolution as compared to traditional radar systems with the
same number of transmit and receive antennas. This paper considers a
distributed MIMO radar scenario, in which each transmit element is a node in a
wireless network, and... |
0907.4885 | Growth Rate of the Weight Distribution of Doubly-Generalized LDPC Codes:
General Case and Efficient Evaluation | cs.IT math.IT | The growth rate of the weight distribution of irregular doubly-generalized
LDPC (D-GLDPC) codes is developed and in the process, a new efficient numerical
technique for its evaluation is presented. The solution involves simultaneous
solution of a 4 x 4 system of polynomial equations. This represents the first
efficie... |
0907.4960 | Ezhil: A Tamil Programming Language | cs.PL cs.CL | Ezhil is a Tamil language based interpreted procedural programming language.
Tamil keywords and grammar are chosen to make the native Tamil speaker write
programs in the Ezhil system. Ezhil allows easy representation of computer
program closer to the Tamil language logical constructs equivalent to the
conditional, br... |
0907.4984 | Automatic local Gabor Features extraction for face recognition | cs.CV | We present in this paper a biometric system of face detection and recognition
in color images. The face detection technique is based on skin color
information and fuzzy classification. A new algorithm is proposed in order to
detect automatically face features (eyes, mouth and nose) and extract their
correspondent geo... |
0907.4996 | Cooperative Jamming for Wireless Physical Layer Security | cs.IT math.IT | Cooperative jamming is an approach that has been recently proposed for
improving physical layer based security for wireless networks in the presence
of an eavesdropper. While the source transmits its message to its destination,
a relay node transmits a jamming signal to create interference at the
eavesdropper. In thi... |
0907.5024 | Living at the Edge: A Large Deviations Approach to the Outage MIMO
Capacity | cs.IT cond-mat.stat-mech math.IT stat.AP | Using a large deviations approach we calculate the probability distribution
of the mutual information of MIMO channels in the limit of large antenna
numbers. In contrast to previous methods that only focused at the distribution
close to its mean (thus obtaining an asymptotically Gaussian distribution), we
calculate t... |
0907.5030 | Existence of new inequalities for representable polymatroids | cs.IT math.IT | An Ingletonian polymatroid satisfies, in addition to the polymatroid axioms,
the inequalities of Ingleton (Combin. Math. Appln., 1971). These inequalities
are required for a polymatroid to be representable. It is has been an open
question as to whether these inequalities are also sufficient. Representable
polymatroid... |
0907.5032 | Restart Strategy Selection using Machine Learning Techniques | cs.AI | Restart strategies are an important factor in the performance of
conflict-driven Davis Putnam style SAT solvers. Selecting a good restart
strategy for a problem instance can enhance the performance of a solver.
Inspired by recent success applying machine learning techniques to predict the
runtime of SAT solvers, we p... |
0907.5033 | Online Search Cost Estimation for SAT Solvers | cs.AI | We present two different methods for estimating the cost of solving SAT
problems. The methods focus on the online behaviour of the backtracking solver,
as well as the structure of the problem. Modern SAT solvers present several
challenges to estimate search cost including coping with nonchronological
backtracking, le... |
0907.5043 | Online-offline activities and game-playing behaviors of avatars in a
massive multiplayer online role-playing game | physics.pop-ph cs.MA physics.soc-ph | Massive multiplayer online role-playing games (MMORPGs) are very popular in
China, which provides a potential platform for scientific research. We study
the online-offline activities of avatars in an MMORPG to understand their
game-playing behavior. The statistical analysis unveils that the active avatars
can be clas... |
0907.5063 | On Measuring Non-Recursive Trade-Offs | cs.FL cs.IT math.IT | We investigate the phenomenon of non-recursive trade-offs between
descriptional systems in an abstract fashion. We aim at categorizing
non-recursive trade-offs by bounds on their growth rate, and show how to deduce
such bounds in general. We also identify criteria which, in the spirit of
abstract language theory, all... |
0907.5083 | Serializing the Parallelism in Parallel Communicating Pushdown Automata
Systems | cs.FL cs.CL cs.DC | We consider parallel communicating pushdown automata systems (PCPA) and
define a property called known communication for it. We use this property to
prove that the power of a variant of PCPA, called returning centralized
parallel communicating pushdown automata (RCPCPA), is equivalent to that of
multi-head pushdown a... |
0907.5119 | On the Size Complexity of Non-Returning Context-Free PC Grammar Systems | cs.FL cs.DC cs.MA | Improving the previously known best bound, we show that any recursively
enumerable language can be generated with a non-returning parallel
communicating (PC) grammar system having six context-free components. We also
present a non-returning universal PC grammar system generating unary languages,
that is, a system whe... |
0907.5141 | Cooperative Training for Attribute-Distributed Data: Trade-off Between
Data Transmission and Performance | cs.DC cs.MA | This paper introduces a modeling framework for distributed regression with
agents/experts observing attribute-distributed data (heterogeneous data). Under
this model, a new algorithm, the iterative covariance optimization algorithm
(ICOA), is designed to reshape the covariance matrix of the training residuals
of indi... |
0907.5155 | On Classification from Outlier View | cs.AI | Classification is the basis of cognition. Unlike other solutions, this study
approaches it from the view of outliers. We present an expanding algorithm to
detect outliers in univariate datasets, together with the underlying
foundation. The expanding algorithm runs in a holistic way, making it a rather
robust solution... |
0907.5165 | Interference alignment-based sum capacity bounds for random dense
Gaussian interference networks | cs.IT math.IT | We consider a dense $K$ user Gaussian interference network formed by paired
transmitters and receivers placed independently at random in a fixed spatial
region. Under natural conditions on the node position distributions and signal
attenuation, we prove convergence in probability of the average per-user
capacity $\cs... |
0907.5168 | Collaborative Training in Sensor Networks: A graphical model approach | cs.DC cs.MA | Graphical models have been widely applied in solving distributed inference
problems in sensor networks. In this paper, the problem of coordinating a
network of sensors to train a unique ensemble estimator under communication
constraints is discussed. The information structure of graphical models with
specific potenti... |
0907.5287 | Propelinear structure of Z_{2k}-linear codes | cs.IT math.IT | Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a
Gray map $\Phi:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $\Phi(\codi)$ is
a binary propelinear code and, hence, a Hamming-compatible group code.
Moreover, $\Phi$ is the unique Gray map such that $\Phi(C)$ is
Hamming-compatible group code... |
0907.5321 | Multiple pattern classification by sparse subspace decomposition | cs.CV | A robust classification method is developed on the basis of sparse subspace
decomposition. This method tries to decompose a mixture of subspaces of
unlabeled data (queries) into class subspaces as few as possible. Each query is
classified into the class whose subspace significantly contributes to the
decomposed subsp... |
0907.5388 | Providing Secrecy With Structured Codes: Tools and Applications to
Two-User Gaussian Channels | cs.IT math.IT | Recent results have shown that structured codes can be used to construct good
channel codes, source codes and physical layer network codes for Gaussian
channels. For Gaussian channels with secrecy constraints, however, efforts to
date rely on random codes. In this work, we advocate that structured codes are
useful fo... |
0907.5397 | Telescoping Recursive Representations and Estimation of Gauss-Markov
Random Fields | cs.IT math.IT math.ST stat.TH | We present \emph{telescoping} recursive representations for both continuous
and discrete indexed noncausal Gauss-Markov random fields. Our recursions start
at the boundary (a hypersurface in $\R^d$, $d \ge 1$) and telescope inwards.
For example, for images, the telescoping representation reduce recursions from
$d = 2... |
0907.5433 | Efficient Web Log Mining using Doubly Linked Tree | cs.IR cs.IT math.IT | World Wide Web is a huge data repository and is growing with the explosive
rate of about 1 million pages a day. As the information available on World Wide
Web is growing the usage of the web sites is also growing. Web log records each
access of the web page and number of entries in the web logs is increasing
rapidly.... |
0907.5442 | On Computing Compression Trees for Data Collection in Sensor Networks | cs.NI cs.IT math.IT | We address the problem of efficiently gathering correlated data from a wired
or a wireless sensor network, with the aim of designing algorithms with
provable optimality guarantees, and understanding how close we can get to the
known theoretical lower bounds. Our proposed approach is based on finding an
optimal or a n... |
0907.5538 | A preliminary XML-based search system for planetary data | cs.IR astro-ph.EP cs.DB physics.geo-ph | Planetary sciences can benefit from several different sources of information,
i.e. ground-based or near Earth-based observations, space missions and
laboratory experiments. The data collected from these sources, however, are
spread over a number of smaller, separate communities and stored through
different facilities... |
0907.5598 | Convergence of Expected Utility for Universal AI | cs.AI | We consider a sequence of repeated interactions between an agent and an
environment. Uncertainty about the environment is captured by a probability
distribution over a space of hypotheses, which includes all computable
functions. Given a utility function, we can evaluate the expected utility of
any computational poli... |
0908.0014 | Keys through ARQ | cs.IT cs.CR math.IT | This paper develops a novel framework for sharing secret keys using the
well-known Automatic Repeat reQuest (ARQ) protocol. The proposed key sharing
protocol does not assume any prior knowledge about the channel state
information (CSI), but, harnesses the available opportunistic secrecy gains
using only the one bit f... |
0908.0045 | On Random Construction of a Bipolar Sensing Matrix with Compact
Representation | cs.IT math.IT | A random construction of bipolar sensing matrices based on binary linear
codes is introduced and its RIP (Restricted Isometry Property) is analyzed
based on an argument on the ensemble average of the weight distribution of
binary linear codes.
|
0908.0050 | Online Learning for Matrix Factorization and Sparse Coding | stat.ML cs.LG math.OC | Sparse coding--that is, modelling data vectors as sparse linear combinations
of basis elements--is widely used in machine learning, neuroscience, signal
processing, and statistics. This paper focuses on the large-scale matrix
factorization problem that consists of learning the basis set, adapting it to
specific data.... |
0908.0051 | High-Rate, Distributed Training-Embedded Complex Orthogonal Designs for
Relay Networks | cs.IT math.IT | Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs
(CODs) (both square and non-square CODs other than the Alamouti design) are
known to lose their single-symbol ML decodable (SSD) property when used in
two-hop wireless relay networks using amplify and forward protocol. For such a
network, in ... |
0908.0078 | On Algebraic Traceback in Dynamic Networks | cs.IT cs.NI math.IT | This paper introduces the concept of incremental traceback for determining
changes in the trace of a network as it evolves with time. A distributed
algorithm, based on the methodology of algebraic traceback developed by Dean et
al, is proposed which can completely determine a path of d nodes/routers using
O(d) marked... |
0908.0089 | Knowledge Discovery of Hydrocyclone s Circuit Based on SONFIS and SORST | cs.AI | This study describes application of some approximate reasoning methods to
analysis of hydrocyclone performance. In this manner, using a combining of Self
Organizing Map (SOM), Neuro-Fuzzy Inference System (NFIS)-SONFIS- and Rough Set
Theory (RST)-SORST-crisp and fuzzy granules are obtained. Balancing of crisp
granule... |
0908.0100 | A Class of DSm Conditional Rules | cs.AI | In this paper we introduce two new DSm fusion conditioning rules with
example, and as a generalization of them a class of DSm fusion conditioning
rules, and then extend them to a class of DSm conditioning rules.
|
0908.0163 | An Improvement of Cover/El Gamal's Compress-and-Forward Relay Scheme | cs.IT math.IT | The compress-and-forward relay scheme developed by (Cover and El Gamal, 1979)
is improved with a modification on the decoding process. The improvement
follows as a result of realizing that it is not necessary for the destination
to decode the compressed observation of the relay; and even if the compressed
observation... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.