id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0805.0197 | Flatness of the Energy Landscape for Horn Clauses | cond-mat.dis-nn cs.NE | The Little-Hopfield neural network programmed with Horn clauses is studied.
We argue that the energy landscape of the system, corresponding to the
inconsistency function for logical interpretations of the sets of Horn clauses,
has minimal ruggedness. This is supported by computer simulations.
|
0805.0202 | A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem | cs.AI cs.LO | Determining the evolutionary history of a given biological data is an
important task in biological sciences. Given a set of quartet topologies over a
set of taxa, the Maximum Quartet Consistency (MQC) problem consists of
computing a global phylogeny that satisfies the maximum number of quartets. A
number of solutions... |
0805.0231 | CMA-ES with Two-Point Step-Size Adaptation | cs.NE | We combine a refined version of two-point step-size adaptation with the
covariance matrix adaptation evolution strategy (CMA-ES). Additionally, we
suggest polished formulae for the learning rate of the covariance matrix and
the recombination weights. In contrast to cumulative step-size adaptation or to
the 1/5-th suc... |
0805.0241 | Asymptotically Good LDPC Convolutional Codes Based on Protographs | cs.IT math.IT | LDPC convolutional codes have been shown to be capable of achieving the same
capacity-approaching performance as LDPC block codes with iterative
message-passing decoding. In this paper, asymptotic methods are used to
calculate a lower bound on the free distance for several ensembles of
asymptotically good protograph-... |
0805.0268 | Towards Exploring Fundamental Limits of System-Specific Cryptanalysis
Within Limited Attack Classes: Application to ABSG | cs.CR cs.IT math.IT | A new approach on cryptanalysis is proposed where the goal is to explore the
fundamental limits of a specific class of attacks against a particular
cryptosystem. As a first step, the approach is applied on ABSG, which is an
LFSR-based stream cipher where irregular decimation techniques are utilized.
Consequently, und... |
0805.0272 | Capacity of The Discrete-Time Non-Coherent Memoryless Gaussian Channels
at Low SNR | cs.IT math.IT | We address the capacity of a discrete-time memoryless Gaussian channel, where
the channel state information (CSI) is neither available at the transmitter nor
at the receiver. The optimal capacity-achieving input distribution at low
signal-to-noise ratio (SNR) is precisely characterized, and the exact capacity
of a no... |
0805.0330 | Alternating Automata on Data Trees and XPath Satisfiability | cs.LO cs.DB cs.FL | A data tree is an unranked ordered tree whose every node is labelled by a
letter from a finite alphabet and an element ("datum") from an infinite set,
where the latter can only be compared for equality. The article considers
alternating automata on data trees that can move downward and rightward, and
have one registe... |
0805.0337 | On Distributed Function Computation in Structure-Free Random Networks | cs.IT math.IT | We consider in-network computation of MAX in a structure-free random multihop
wireless network. Nodes do not know their relative or absolute locations and
use the Aloha MAC protocol. For one-shot computation, we describe a protocol in
which the MAX value becomes available at the origin in $O(\sqrt{n/\log n})$
slots w... |
0805.0360 | Prediction and Mitigation of Crush Conditions in Emergency Evacuations | cs.CE cs.MA | Several simulation environments exist for the simulation of large-scale
evacuations of buildings, ships, or other enclosed spaces. These offer
sophisticated tools for the study of human behaviour, the recreation of
environmental factors such as fire or smoke, and the inclusion of architectural
or structural features,... |
0805.0375 | Wireless Secrecy in Cellular Systems with Infrastructure--Aided
Cooperation | cs.IT cs.CR math.IT | In cellular systems, confidentiality of uplink transmission with respect to
eavesdropping terminals can be ensured by creating intentional inteference via
scheduling of concurrent downlink transmissions. In this paper, this basic idea
is explored from an information-theoretic standpoint by focusing on a two-cell
scen... |
0805.0438 | Network-based consensus averaging with general noisy channels | cs.IT math.IT | This paper focuses on the consensus averaging problem on graphs under general
noisy channels. We study a particular class of distributed consensus algorithms
based on damped updates, and using the ordinary differential equation method,
we prove that the updates converge almost surely to exact consensus for finite
var... |
0805.0459 | Phase transition in SONFIS&SORST | cs.AI | In this study, we introduce general frame of MAny Connected Intelligent
Particles Systems (MACIPS). Connections and interconnections between particles
get a complex behavior of such merely simple system (system in
system).Contribution of natural computing, under information granulation
theory, are the main topics of ... |
0805.0501 | Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon
Codes | cs.IT math.IT | Generalized Concatenated codes are a code construction consisting of a number
of outer codes whose code symbols are protected by an inner code. As outer
codes, we assume the most frequently used Reed-Solomon codes; as inner code, we
assume some linear block code which can be decoded up to half its minimum
distance. D... |
0805.0507 | Spread Codes and Spread Decoding in Network Coding | cs.IT math.IT | In this paper we introduce the class of Spread Codes for the use in random
network coding. Spread Codes are based on the construction of spreads in finite
projective geometry. The major contribution of the paper is an efficient
decoding algorithm of spread codes up to half the minimum distance.
|
0805.0510 | Iterative Hard Thresholding for Compressed Sensing | cs.IT cs.NA math.IT math.NA | Compressed sensing is a technique to sample compressible signals below the
Nyquist rate, whilst still allowing near optimal reconstruction of the signal.
In this paper we present a theoretical analysis of the iterative hard
thresholding algorithm when applied to the compressed sensing recovery problem.
We show that t... |
0805.0514 | Efficient recovering of operation tables of black box groups and rings | cs.IT cs.DM math.GR math.IT | People have been studying the following problem: Given a finite set S with a
hidden (black box) binary operation * on S which might come from a group law,
and suppose you have access to an oracle that you can ask for the operation x*y
of single pairs (x,y) you choose. What is the minimal number of queries to the
orac... |
0805.0516 | The Gaussian MAC with Conferencing Encoders | cs.IT math.IT | We derive the capacity region of the Gaussian version of Willems's two-user
MAC with conferencing encoders. This setting differs from the classical MAC in
that, prior to each transmission block, the two transmitters can communicate
with each other over noise-free bit-pipes of given capacities. The derivation
requires... |
0805.0521 | On the Capacity of Free-Space Optical Intensity Channels | cs.IT math.IT | New upper and lower bounds are presented on the capacity of the free-space
optical intensity channel. This channel is characterized by inputs that are
nonnegative (representing the transmitted optical intensity) and by outputs
that are corrupted by additive white Gaussian noise (because in free space the
disturbances... |
0805.0577 | Infinity-Norm Sphere-Decoding | cs.IT math.IT | The most promising approaches for efficient detection in multiple-input
multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The
conventional (and optimum) norm that is used to conduct the tree traversal step
in SD is the l-2 norm. It was, however, recently observed that using the
l-infinity nor... |
0805.0589 | Cascaded Orthogonal Space-Time Block Codes for Wireless Multi-Hop Relay
Networks | cs.IT math.IT | Distributed space-time block coding is a diversity technique to mitigate the
effects of fading in multi-hop wireless networks, where multiple relay stages
are used by a source to communicate with its destination. This paper proposes a
new distributed space-time block code called the cascaded orthogonal space-time
blo... |
0805.0615 | On Expanded Cyclic Codes | cs.IT cs.CC math.IT math.RA | The paper has a threefold purpose. The first purpose is to present an
explicit description of expanded cyclic codes defined in $\GF(q^m)$. The
proposed explicit construction of expanded generator matrix and expanded parity
check matrix maintains the symbol-wise algebraic structure and thus keeps many
important origin... |
0805.0642 | Order to Disorder Transitions in Hybrid Intelligent Systems: a Hatch to
the Interactions of Nations -Governments | cs.AI cs.IT math.IT | In this study, under general frame of MAny Connected Intelligent Particles
Systems (MACIPS), we reproduce two new simple subsets of such intelligent
complex network, namely hybrid intelligent systems, involved a few prominent
intelligent computing and approximate reasoning methods: self organizing
feature map (SOM), ... |
0805.0697 | Stochastic Optimization Approaches for Solving Sudoku | cs.NE | In this paper the Sudoku problem is solved using stochastic search techniques
and these are: Cultural Genetic Algorithm (CGA), Repulsive Particle Swarm
Optimization (RPSO), Quantum Simulated Annealing (QSA) and the Hybrid method
that combines Genetic Algorithm with Simulated Annealing (HGASA). The results
obtained sh... |
0805.0740 | Diversity-Integration Trade-offs in MIMO Detection | cs.OH cs.IT math.IT | In this work, a MIMO detection problem is considered. At first, we derive the
Generalized Likelihood Ratio Test (GLRT) for arbitrary transmitted signals and
arbitrary time-correlation of the disturbance. Then, we investigate design
criteria for the transmitted waveforms in both power-unlimited and
power-limited syste... |
0805.0747 | Pruning Attribute Values From Data Cubes with Diamond Dicing | cs.DB cs.DS | Data stored in a data warehouse are inherently multidimensional, but most
data-pruning techniques (such as iceberg and top-k queries) are unidimensional.
However, analysts need to issue multidimensional queries. For example, an
analyst may need to select not just the most profitable stores
or--separately--the most pr... |
0805.0785 | AGNOSCO - Identification of Infected Nodes with artificial Ant Colonies | cs.AI cs.MA | If a computer node is infected by a virus, worm or a backdoor, then this is a
security risk for the complete network structure where the node is associated.
Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of
support for the identification of such infected nodes but suffer from the need
of... |
0805.0802 | An Information-Theoretical View of Network-Aware Malware Attacks | cs.CR cs.IT cs.NI math.IT | This work investigates three aspects: (a) a network vulnerability as the
non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent
malwares that exploit such a vulnerability, and (c) defense, i.e., challenges
for fighting the threats. We first study five large data sets and observe
consistent clustered... |
0805.0849 | SANA - Network Protection through artificial Immunity | cs.CR cs.MA | Current network protection systems use a collection of intelligent components
- e.g. classifiers or rule-based firewall systems to detect intrusions and
anomalies and to secure a network against viruses, worms, or trojans. However,
these network systems rely on individuality and support an architecture with
less coll... |
0805.0909 | SANA - Security Analysis in Internet Traffic through Artificial Immune
Systems | cs.CR cs.MA | The Attacks done by Viruses, Worms, Hackers, etc. are a Network
Security-Problem in many Organisations. Current Intrusion Detection Systems
have significant Disadvantages, e.g. the need of plenty of Computational Power
or the Local Installation. Therefore, we introduce a novel Framework for
Network Security which is ... |
0805.0963 | Correlated Anarchy in Overlapping Wireless Networks | cs.GT cs.IT math.IT physics.soc-ph | We investigate the behavior of a large number of selfish users that are able
to switch dynamically between multiple wireless access-points (possibly
belonging to different standards) by introducing an iterated non-cooperative
game. Users start out completely uneducated and naive but, by using a fixed set
of strategie... |
0805.0990 | The pre-log of Gaussian broadcast with feedback can be two | cs.IT math.IT | A generic intuition says that the pre-log, or multiplexing gain, cannot be
larger than the minimum of the number of transmit and receive dimensions. This
suggests that for the scalar broadcast channel, the pre-log cannot exceed one.
By contrast, in this note, we show that when the noises are anti-correlated and
feedb... |
0805.1030 | Decomposition Techniques for Subgraph Matching | cs.CC cs.CL | In the constraint programming framework, state-of-the-art static and dynamic
decomposition techniques are hard to apply to problems with complete initial
constraint graphs. For such problems, we propose a hybrid approach of these
techniques in the presence of global constraints. In particular, we solve the
subgraph i... |
0805.1088 | Network Coding for Speedup in Switches | cs.NI cs.IT math.IT | We present a graph theoretic upper bound on speedup needed to achieve 100%
throughput in a multicast switch using network coding. By bounding speedup, we
show the equivalence between network coding and speedup in multicast switches -
i.e. network coding, which is usually implemented using software, can in many
cases ... |
0805.1096 | Adaptive Affinity Propagation Clustering | cs.AI | Affinity propagation clustering (AP) has two limitations: it is hard to know
what value of parameter 'preference' can yield an optimal clustering solution,
and oscillations cannot be eliminated automatically if occur. The adaptive AP
method is proposed to overcome these limitations, including adaptive scanning
of pre... |
0805.1153 | Contact state analysis using NFIS and SOM | cs.NE cs.AI | This paper reports application of neuro- fuzzy inference system (NFIS) and
self organizing feature map neural networks (SOM) on detection of contact state
in a block system. In this manner, on a simple system, the evolution of contact
states, by parallelization of DDA, has been investigated. So, a comparison
between ... |
0805.1154 | Clustering of scientific citations in Wikipedia | cs.DL cs.NE | The instances of templates in Wikipedia form an interesting data set of
structured information. Here I focus on the cite journal template that is
primarily used for citation to articles in scientific journals. These citations
can be extracted and analyzed: Non-negative matrix factorization is performed
on a (article ... |
0805.1209 | Scaling Laws for Overlaid Wireless Networks: A Cognitive Radio Network
vs. a Primary Network | cs.IT cs.NI math.IT | We study the scaling laws for the throughputs and delays of two coexisting
wireless networks that operate in the same geographic region. The primary
network consists of Poisson distributed legacy users of density n, and the
secondary network consists of Poisson distributed cognitive users of density m,
with m>n. The ... |
0805.1262 | Optimal Node Density for Two-Dimensional Sensor Arrays | cs.IT math.IT | The problem of optimal node density for ad hoc sensor networks deployed for
making inferences about two dimensional correlated random fields is considered.
Using a symmetric first order conditional autoregressive Gauss-Markov random
field model, large deviations results are used to characterize the asymptotic
per-nod... |
0805.1288 | Assessment of effective parameters on dilution using approximate
reasoning methods in longwall mining method, Iran coal mines | cs.AI | Approximately more than 90% of all coal production in Iranian underground
mines is derived directly longwall mining method. Out of seam dilution is one
of the essential problems in these mines. Therefore the dilution can impose the
additional cost of mining and milling. As a result, recognition of the
effective param... |
0805.1296 | A Simple Dynamic Mind-map Framework To Discover Associative
Relationships in Transactional Data Streams | cs.NE cs.SC | In this paper, we informally introduce dynamic mind-maps that represent a new
approach on the basis of a dynamic construction of connectionist structures
during the processing of a data stream. This allows the representation and
processing of recursively defined structures and avoids the problem of a more
traditional... |
0805.1319 | Emergence, Competition and Dynamical Stabilization of Dissipative
Rotating Spiral Waves in an Excitable Medium: A Computational Model Based on
Cellular Automata | nlin.CG cs.NE nlin.AO | We report some qualitatively new features of emergence, competition and
dynamical stabilization of dissipative rotating spiral waves (RSWs) in the
cellular-automaton model of laser-like excitable media proposed in
arXiv:cond-mat/0410460v2 ; arXiv:cond-mat/0602345 . Part of the observed
features are caused by unusual ... |
0805.1327 | Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding
Perspective | cs.IT math.IT | We revisit the information-theoretic analysis of bit-interleaved coded
modulation (BICM) by modeling the BICM decoder as a mismatched decoder. The
mismatched decoding model is well-defined for finite, yet arbitrary, block
lengths, and naturally captures the channel memory among the bits belonging to
the same symbol. ... |
0805.1340 | On the Secure Degrees of Freedom in the K-User Gaussian Interference
Channel | cs.IT math.IT | This paper studies the K-user Gaussian interference channel with secrecy
constraints. Two distinct network models, namely the interference channel with
confidential messages and the one with an external eavesdropper, are analyzed.
Using interference alignment along with secrecy pre-coding at each transmitter,
it is s... |
0805.1437 | On the Spectrum of Large Random Hermitian Finite-Band Matrices | cs.IT math.IT | The open problem of calculating the limiting spectrum (or its Shannon
transform) of increasingly large random Hermitian finite-band matrices is
described. In general, these matrices include a finite number of non-zero
diagonals around their main diagonal regardless of their size. Two different
communication setups wh... |
0805.1442 | How Many Users should be Turned On in a Multi-Antenna Broadcast Channel? | cs.IT math.IT | This paper considers broadcast channels with L antennas at the base station
and m single-antenna users, where L and m are typically of the same order. We
assume that only partial channel state information is available at the base
station through a finite rate feedback. Our key observation is that the optimal
number o... |
0805.1473 | A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning | cs.AI cs.LO | We introduce a new tractable temporal constraint language, which strictly
contains the Ord-Horn language of Buerkert and Nebel and the class of AND/OR
precedence constraints. The algorithm we present for this language decides
whether a given set of constraints is consistent in time that is quadratic in
the input size... |
0805.1480 | On-line Learning of an Unlearnable True Teacher through Mobile Ensemble
Teachers | cond-mat.dis-nn cs.LG | On-line learning of a hierarchical learning model is studied by a method from
statistical mechanics. In our model a student of a simple perceptron learns
from not a true teacher directly, but ensemble teachers who learn from the true
teacher with a perceptron learning rule. Since the true teacher and the
ensemble tea... |
0805.1485 | Distributed MIMO Systems with Oblivious Antennas | cs.IT math.IT | A scenario in which a single source communicates with a single destination
via a distributed MIMO transceiver is considered. The source operates each of
the transmit antennas via finite-capacity links, and likewise the destination
is connected to the receiving antennas through capacity-constrained channels.
Targeting... |
0805.1487 | A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval | cs.DB cs.DS | The paper is concerned with the time efficient processing of spatiotemporal
predicates, i.e. spatial predicates associated with an exact temporal
constraint. A set of such predicates forms a buffer query or a Spatio-temporal
Pattern (STP) Query with time. In the more general case of an STP query, the
temporal dimensi... |
0805.1593 | On the Probability Distribution of Superimposed Random Codes | cs.DB cs.DM cs.IT math.IT | A systematic study of the probability distribution of superimposed random
codes is presented through the use of generating functions. Special attention
is paid to the cases of either uniformly distributed but not necessarily
independent or non uniform but independent bit structures. Recommendations for
optimal coding... |
0805.1662 | Eliminating Trapping Sets in Low-Density Parity Check Codes by using
Tanner Graph Covers | cs.IT math.IT | We discuss error floor asympotics and present a method for improving the
performance of low-density parity check (LDPC) codes in the high SNR (error
floor) region.
The method is based on Tanner graph covers that do not have trapping sets
from the original code. The advantages of the method are that it is universal,... |
0805.1696 | Grammatical Evolution with Restarts for Fast Fractal Generation | cs.NE cs.SC | In a previous work, the authors proposed a Grammatical Evolution algorithm to
automatically generate Lindenmayer Systems which represent fractal curves with
a pre-determined fractal dimension. This paper gives strong statistical
evidence that the probability distributions of the execution time of that
algorithm exhib... |
0805.1715 | Isotropy, entropy, and energy scaling | cs.IT math.IT nlin.AO | Two principles explain emergence. First, in the Receipt's reference frame,
Deg(S) = 4/3 Deg(R), where Supply S is an isotropic radiative energy source,
Receipt R receives S's energy, and Deg is a system's degrees of freedom based
on its mean path length. S's 1/3 more degrees of freedom relative to R enables
R's growt... |
0805.1727 | Swarm-Based Spatial Sorting | cs.AI cs.MA | Purpose: To present an algorithm for spatially sorting objects into an
annular structure. Design/Methodology/Approach: A swarm-based model that
requires only stochastic agent behaviour coupled with a pheromone-inspired
"attraction-repulsion" mechanism. Findings: The algorithm consistently
generates high-quality annul... |
0805.1785 | Distributed Self Management for Distributed Security Systems | cs.MA cs.AI | Distributed system as e.g. artificial immune systems, complex adaptive
systems, or multi-agent systems are widely used in Computer Science, e.g. for
network security, optimisations, or simulations. In these systems, small
entities move through the network and perform certain tasks. At some time, the
entities move to ... |
0805.1786 | Next Challenges in Bringing Artificial Immune Systems to Production in
Network Security | cs.MA cs.AI | The human immune system protects the human body against various pathogens
like e.g. biological viruses and bacteria. Artificial immune systems reuse the
architecture, organization, and workflows of the human immune system for
various problems in computer science. In the network security, the artificial
immune system ... |
0805.1787 | A Network Protection Framework through Artificial Immunity | cs.MA cs.CR | Current network protection systems use a collection of intelligent components
- e.g. classifiers or rule-based firewall systems to detect intrusions and
anomalies and to secure a network against viruses, worms, or trojans. However,
these network systems rely on individuality and support an architecture with
less coll... |
0805.1788 | Pedestrian Flow at Bottlenecks - Validation and Calibration of Vissim's
Social Force Model of Pedestrian Traffic and its Empirical Foundations | cs.MA physics.soc-ph | In this contribution first results of experiments on pedestrian flow through
bottlenecks are presented and then compared to simulation results obtained with
the Social Force Model in the Vissim simulation framework. Concerning the
experiments it is argued that the basic dependence between flow and bottleneck
width is... |
0805.1806 | Tuplix Calculus Specifications of Financial Transfer Networks | cs.CE cs.LO | We study the application of Tuplix Calculus in modular financial budget
design. We formalize organizational structure using financial transfer
networks. We consider the notion of flux of money over a network, and a way to
enforce the matching of influx and outflux for parts of a network. We exploit
so-called signed a... |
0805.1827 | Parallel Pricing Algorithms for Multi--Dimensional Bermudan/American
Options using Monte Carlo methods | cs.DC cs.CE | In this paper we present two parallel Monte Carlo based algorithms for
pricing multi--dimensional Bermudan/American options. First approach relies on
computation of the optimal exercise boundary while the second relies on
classification of continuation and exercise values. We also evaluate the
performance of both the... |
0805.1844 | Practical recipes for the model order reduction, dynamical simulation,
and compressive sampling of large-scale open quantum systems | quant-ph cs.IT math.IT math.NA | This article presents numerical recipes for simulating high-temperature and
non-equilibrium quantum spin systems that are continuously measured and
controlled. The notion of a spin system is broadly conceived, in order to
encompass macroscopic test masses as the limiting case of large-j spins. The
simulation techniqu... |
0805.1854 | A New Algorithm for Interactive Structural Image Segmentation | cs.CV | This paper proposes a novel algorithm for the problem of structural image
segmentation through an interactive model-based approach. Interaction is
expressed in the model creation, which is done according to user traces drawn
over a given input image. Both model and input are then represented by means of
attributed re... |
0805.1857 | The Gaussian Many-Help-One Distributed Source Coding Problem | cs.IT math.IT | Jointly Gaussian memoryless sources are observed at N distinct terminals. The
goal is to efficiently encode the observations in a distributed fashion so as
to enable reconstruction of any one of the observations, say the first one, at
the decoder subject to a quadratic fidelity criterion. Our main result is a
precise... |
0805.2027 | Rollout Sampling Approximate Policy Iteration | cs.LG cs.AI cs.CC | Several researchers have recently investigated the connection between
reinforcement learning and classification. We are motivated by proposals of
approximate policy iteration schemes without value functions which focus on
policy representation using classifiers and address policy learning as a
supervised learning pro... |
0805.2045 | Semantic Analysis of Tag Similarity Measures in Collaborative Tagging
Systems | cs.DL cs.IR | Social bookmarking systems allow users to organise collections of resources
on the Web in a collaborative fashion. The increasing popularity of these
systems as well as first insights into their emergent semantics have made them
relevant to disciplines like knowledge extraction and ontology learning. The
problem of d... |
0805.2105 | On Emergence of Dominating Cliques in Random Graphs | math.CO cs.IT math.IT | Emergence of dominating cliques in Erd\"os-R\'enyi random graph model
${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon
possesses a phase transition. Namely, we have argued that, given a constant
probability $p$, an $n$-node random graph $G$ from ${\bbbg(n,p)}$ and for $r= c
\log_{1/p} n$ with... |
0805.2185 | Path Diversity over Packet Switched Networks: Performance Analysis and
Rate Allocation | cs.NI cs.IT math.IT | Path diversity works by setting up multiple parallel connections between the
end points using the topological path redundancy of the network. In this paper,
\textit{Forward Error Correction} (FEC) is applied across multiple independent
paths to enhance the end-to-end reliability. Network paths are modeled as
erasure ... |
0805.2199 | Constraint Complexity of Realizations of Linear Codes on Arbitrary
Graphs | cs.DM cs.IT math.IT | A graphical realization of a linear code C consists of an assignment of the
coordinates of C to the vertices of a graph, along with a specification of
linear state spaces and linear ``local constraint'' codes to be associated with
the edges and vertices, respectively, of the graph. The $\k$-complexity of a
graphical ... |
0805.2303 | Graph Algorithms for Improving Type-Logical Proof Search | cs.CL | Proof nets are a graph theoretical representation of proofs in various
fragments of type-logical grammar. In spite of this basis in graph theory,
there has been relatively little attention to the use of graph theoretic
algorithms for type-logical proof search. In this paper we will look at several
ways in which stand... |
0805.2308 | Toward Fuzzy block theory | cs.AI | This study, fundamentals of fuzzy block theory, and its application in
assessment of stability in underground openings, has surveyed. Using fuzzy
topics and inserting them in to key block theory, in two ways, fundamentals of
fuzzy block theory has been presented. In indirect combining, by coupling of
adaptive Neuro F... |
0805.2324 | A multilateral filtering method applied to airplane runway image | cs.CV | By considering the features of the airport runway image filtering, an
improved bilateral filtering method was proposed which can remove noise with
edge preserving. Firstly the steerable filtering decomposition is used to
calculate the sub-band parameters of 4 orients, and the texture feature matrix
is then obtained f... |
0805.2362 | An optimization problem on the sphere | cs.LG cs.CG | We prove existence and uniqueness of the minimizer for the average geodesic
distance to the points of a geodesically convex set on the sphere. This implies
a corresponding existence and uniqueness result for an optimal algorithm for
halfspace learning, when data and target functions are drawn from the uniform
distrib... |
0805.2368 | A Kernel Method for the Two-Sample Problem | cs.LG cs.AI | We propose a framework for analyzing and comparing distributions, allowing us
to design statistical tests to determine if two samples are drawn from
different distributions. Our test statistic is the largest difference in
expectations over functions in the unit ball of a reproducing kernel Hilbert
space (RKHS). We pr... |
0805.2379 | Linear code-based vector quantization for independent random variables | cs.IT math.IT | In this paper we analyze the rate-distortion function R(D) achievable using
linear codes over GF(q), where q is a prime number.
|
0805.2422 | Transceiver Pair Designs for Multiple Access Channels under Fixed Sum
Mutual Information using MMSE Decision Feedback Detection | cs.IT math.IT | In this paper, we consider the joint design of the transceivers for a
multiple access Multiple Input and Multiple Output (MIMO) system having
Inter-Symbol Interference (ISI) channels. The system we consider is equipped
with the Minimum Mean Square Error (MMSE) Decision-Feedback (DF) detector.
Traditionally, transmitt... |
0805.2423 | Green Codes: Energy-Efficient Short-Range Communication | cs.IT math.IT | A green code attempts to minimize the total energy per-bit required to
communicate across a noisy channel. The classical information-theoretic
approach neglects the energy expended in processing the data at the encoder and
the decoder and only minimizes the energy required for transmissions. Since
there is no cost as... |
0805.2427 | On Trapping Sets and Guaranteed Error Correction Capability of LDPC
Codes and GLDPC Codes | cs.IT math.IT | The relation between the girth and the guaranteed error correction capability
of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial
and parallel) algorithms is investigated. A lower bound on the size of variable
node sets which expand by a factor of at least $3 \gamma/4$ is found based on
th... |
0805.2440 | Analysis of hydrocyclone performance based on information granulation
theory | cs.AI | This paper describes application of information granulation theory, on the
analysis of hydrocyclone perforamance. In this manner, using a combining of
Self Organizing Map (SOM) and Neuro-Fuzzy Inference System (NFIS), crisp and
fuzzy granules are obtained(briefly called SONFIS). Balancing of crisp granules
and sub fu... |
0805.2537 | A toolkit for a generative lexicon | cs.CL | In this paper we describe the conception of a software toolkit designed for
the construction, maintenance and collaborative use of a Generative Lexicon. In
order to ease its portability and spreading use, this tool was built with free
and open source products. We eventually tested the toolkit and showed it
filters th... |
0805.2629 | On Full Diversity Space-Time Block Codes with Partial Interference
Cancellation Group Decoding | cs.IT math.IT | In this paper, we propose a partial interference cancellation (PIC) group
decoding for linear dispersive space-time block codes (STBC) and a design
criterion for the codes to achieve full diversity when the PIC group decoding
is used at the receiver. A PIC group decoding decodes the symbols embedded in
an STBC by div... |
0805.2641 | On the Capacity of the Diamond Half-Duplex Relay Channel | cs.IT math.IT | We consider a diamond-shaped dual-hop communication system consisting a
source, two parallel half-duplex relays and a destination. In a single antenna
configuration, it has been previously shown that a two-phase node-scheduling
algorithm, along with the decode and forward strategy can achieve the capacity
of the diam... |
0805.2671 | Finger Indexed Sets: New Approaches | cs.DS cs.DB | In the particular case we have insertions/deletions at the tail of a given
set S of $n$ one-dimensional elements, we present a simpler and more concrete
algorithm than that presented in [Anderson, 2007] achieving the same (but also
amortized) upper bound of $O(\sqrt{logd/loglogd})$ for finger searching
queries, where... |
0805.2690 | Increasing Linear Dynamic Range of Commercial Digital Photocamera Used
in Imaging Systems with Optical Coding | cs.CV | Methods of increasing linear optical dynamic range of commercial photocamera
for optical-digital imaging systems are described. Use of such methods allows
to use commercial photocameras for optical measurements. Experimental results
are reported.
|
0805.2691 | Equivalent characterizations of partial randomness for a recursively
enumerable real | cs.IT cs.CC math.IT math.LO | A real number \alpha is called recursively enumerable if there exists a
computable, increasing sequence of rational numbers which converges to \alpha.
The randomness of a recursively enumerable real \alpha can be characterized in
various ways using each of the notions; program-size complexity, Martin-L\"{o}f
test, Ch... |
0805.2752 | The Margitron: A Generalised Perceptron with Margin | cs.LG | We identify the classical Perceptron algorithm with margin as a member of a
broader family of large margin classifiers which we collectively call the
Margitron. The Margitron, (despite its) sharing the same update rule with the
Perceptron, is shown in an incremental setting to converge in a finite number
of updates t... |
0805.2775 | Sample Selection Bias Correction Theory | cs.LG | This paper presents a theoretical analysis of sample selection bias
correction. The sample bias correction technique commonly used in machine
learning consists of reweighting the cost of an error on each training point of
a biased sample to more closely reflect the unbiased distribution. This relies
on weights derive... |
0805.2812 | Codeword-Independent Performance of Nonbinary Linear Codes Under
Linear-Programming and Sum-Product Decoding | cs.IT math.IT | A coded modulation system is considered in which nonbinary coded symbols are
mapped directly to nonbinary modulation signals. It is proved that if the
modulator-channel combination satisfies a particular symmetry condition, the
codeword error rate performance is independent of the transmitted codeword. It
is shown th... |
0805.2855 | LCSH, SKOS and Linked Data | cs.DL cs.IR | A technique for converting Library of Congress Subject Headings MARCXML to
Simple Knowledge Organization System (SKOS) RDF is described. Strengths of the
SKOS vocabulary are highlighted, as well as possible points for extension, and
the integration of other semantic web vocabularies such as Dublin Core. An
applicatio... |
0805.2891 | Learning Low-Density Separators | cs.LG cs.AI | We define a novel, basic, unsupervised learning problem - learning the lowest
density homogeneous hyperplane separator of an unknown probability
distribution. This task is relevant to several problems in machine learning,
such as semi-supervised learning and clustering stability. We investigate the
question of existe... |
0805.2949 | Performability Aspects of the Atlas Vo; Using Lmbench Suite | cs.PF cs.CE cs.DC | The ATLAS Virtual Organization is grid's largest Virtual Organization which
is currently in full production stage. Hereby a case is being made that a user
working within that VO is going to face a wide spectrum of different systems,
whose heterogeneity is enough to count as "orders of magnitude" according to a
number... |
0805.2995 | Lossless Compression with Security Constraints | cs.IT math.IT | Secure distributed data compression in the presence of an eavesdropper is
explored. Two correlated sources that need to be reliably transmitted to a
legitimate receiver are available at separate encoders. Noise-free, limited
rate links from the encoders to the legitimate receiver, one of which can also
be perfectly o... |
0805.2996 | Lossy Source Transmission over the Relay Channel | cs.IT math.IT | Lossy transmission over a relay channel in which the relay has access to
correlated side information is considered. First, a joint source-channel
decode-and-forward scheme is proposed for general discrete memoryless sources
and channels. Then the Gaussian relay channel where the source and the side
information are jo... |
0805.3005 | High-dimensional subset recovery in noise: Sparsified measurements
without loss of statistical efficiency | stat.ML cs.IT math.IT | We consider the problem of estimating the support of a vector $\beta^* \in
\mathbb{R}^{p}$ based on observations contaminated by noise. A significant body
of work has studied behavior of $\ell_1$-relaxations when applied to
measurement matrices drawn from standard dense ensembles (e.g., Gaussian,
Bernoulli). In this ... |
0805.3082 | Weakly Convergent Nonparametric Forecasting of Stationary Time Series | math.ST cs.IT math.IT stat.TH | The conditional distribution of the next outcome given the infinite past of a
stationary process can be inferred from finite but growing segments of the
past. Several schemes are known for constructing pointwise consistent
estimates, but they all demand prohibitive amounts of input data. In this paper
we consider rea... |
0805.3091 | A simple randomized algorithm for sequential prediction of ergodic time
series | math.ST cs.IT math.IT stat.TH | We present a simple randomized procedure for the prediction of a binary
sequence. The algorithm uses ideas from recent developments of the theory of
the prediction of individual sequences. We show that if the sequence is a
realization of a stationary and ergodic random process then the average number
of mistakes conv... |
0805.3118 | Full Diversity Blind Signal Designs for Unique Identification of
Frequency Selective Channels | cs.IT math.IT | In this paper, we develop two kinds of novel closed-form decompositions on
phase shift keying (PSK) constellations by exploiting linear congruence
equation theory: the one for factorizing a $pq$-PSK constellation into a
product of a $p$-PSK constellation and a $q$-PSK constellation, and the other
for decomposing a sp... |
0805.3126 | Cognitive Architecture for Direction of Attention Founded on Subliminal
Memory Searches, Pseudorandom and Nonstop | cs.AI cs.NE | By way of explaining how a brain works logically, human associative memory is
modeled with logical and memory neurons, corresponding to standard digital
circuits. The resulting cognitive architecture incorporates basic psychological
elements such as short term and long term memory. Novel to the architecture are
memor... |
0805.3164 | To Code or Not To Code in Multi-Hop Relay Channels | cs.IT math.IT | Multi-hop relay channels use multiple relay stages, each with multiple relay
nodes, to facilitate communication between a source and destination.
Previously, distributed space-time coding was used to maximize diversity gain.
Assuming a low-rate feedback link from the destination to each relay stage and
the source, th... |
0805.3200 | On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of
Multiple Terminals | cs.IT cs.CR math.CO math.IT math.PR | Csiszar and Narayan[3] defined the notion of secret key capacity for multiple
terminals, characterized it as a linear program with Slepian-Wolf constraints
of the related source coding problem of communication for omniscience, and
upper bounded it by some information divergence expression from the joint to
the produc... |
0805.3206 | Sociological Inequality and the Second Law | cs.IT math.IT | There are two fair ways to distribute particles in boxes. The first way is to
divide the particles equally between the boxes. The second way, which is
calculated here, is to score fairly the particles between the boxes. The
obtained power law distribution function yields an uneven distribution of
particles in boxes. ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.