id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0903.3995 | Gradient-based adaptive interpolation in super-resolution image
restoration | cs.MM cs.CV | This paper presents a super-resolution method based on gradient-based
adaptive interpolation. In this method, in addition to considering the distance
between the interpolated pixel and the neighboring valid pixel, the
interpolation coefficients take the local gradient of the original image into
account. The smaller t... |
0903.4014 | Construction of Codes for Wiretap Channel and Secret Key Agreement from
Correlated Source Outputs by Using Sparse Matrices | cs.IT cs.CR math.IT | The aim of this paper is to prove coding theorems for the wiretap channel
coding problem and secret key agreement problem based on the the notion of a
hash property for an ensemble of functions. These theorems imply that codes
using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate
universal codin... |
0903.4035 | BLOGRANK: Ranking Weblogs Based On Connectivity And Similarity Features | cs.IR | A large part of the hidden web resides in weblog servers. New content is
produced in a daily basis and the work of traditional search engines turns to
be insufficient due to the nature of weblogs. This work summarizes the
structure of the blogosphere and highlights the special features of weblogs. In
this paper we pr... |
0903.4036 | Feedback control logic synthesis for non safe Petri nets | cs.IT math.IT | This paper addresses the problem of forbidden states of non safe Petri Net
(PN) modelling discrete events systems. To prevent the forbidden states, it is
possible to use conditions or predicates associated with transitions.
Generally, there are many forbidden states, thus many complex conditions are
associated with t... |
0903.4101 | Polylog space compression, pushdown compression, and Lempel-Ziv are
incomparable | cs.CC cs.IR | The pressing need for efficient compression schemes for XML documents has
recently been focused on stack computation, and in particular calls for a
formulation of information-lossless stack or pushdown compressors that allows a
formal analysis of their performance and a more ambitious use of the stack in
XML compress... |
0903.4128 | Rate Adaptation via Link-Layer Feedback for Goodput Maximization over a
Time-Varying Channel | cs.IT cs.NI math.IT math.OC | We consider adapting the transmission rate to maximize the goodput, i.e., the
amount of data transmitted without error, over a continuous Markov flat-fading
wireless channel. In particular, we consider schemes in which transmitter
channel state is inferred from degraded causal error-rate feedback, such as
packet-leve... |
0903.4132 | Switcher-random-walks: a cognitive-inspired mechanism for network
exploration | cs.AI cond-mat.dis-nn physics.soc-ph | Semantic memory is the subsystem of human memory that stores knowledge of
concepts or meanings, as opposed to life specific experiences. The organization
of concepts within semantic memory can be understood as a semantic network,
where the concepts (nodes) are associated (linked) to others depending on
perceptions, s... |
0903.4207 | MacWilliams Identities for Codes on Graphs | cs.IT math.IT | The MacWilliams identity for linear time-invariant convolutional codes that
has recently been found by Gluesing-Luerssen and Schneider is proved concisely,
and generalized to arbitrary group codes on graphs. A similar development
yields a short, transparent proof of the dual sum-product update rule.
|
0903.4217 | Conditional Probability Tree Estimation Analysis and Algorithms | cs.LG cs.AI | We consider the problem of estimating the conditional probability of a label
in time $O(\log n)$, where $n$ is the number of possible labels. We analyze a
natural reduction of this problem to a set of binary regression problems
organized in a tree structure, proving a regret bound that scales with the
depth of the tr... |
0903.4237 | Projection-Forcing Multisets of Weight Changes | math.CO cs.IT math.IT | Let $F$ be a finite field. A multiset $S$ of integers is projection-forcing
if for every linear function $\phi : F^n \to F^m$ whose multiset of weight
changes is $S$, $\phi$ is a coordinate projection up to permutation and scaling
of entries. The MacWilliams Extension Theorem from coding theory says that $S =
\{0, 0,... |
0903.4298 | Design of Log-Map / Max-Log-Map Decoder | cs.IT math.IT | The process of turbo-code decoding starts with the formation of a posteriori
probabilities (APPs) for each data bit, which is followed by choosing the
data-bit value that corresponds to the maximum a posteriori (MAP) probability
for that data bit. Upon reception of a corrupted code-bit sequence, the process
of decisi... |
0903.4305 | Evaluation d'une requete en SQL | cs.DB | The objective of this paper is to show how the interrogation processor
responds to SQL interrogation. The interrogation processor is split into two
parts. The first, called the interrogation compiler translates an SQL query
into a plan of physical execution. The second, called evaluation query runs the
execution plan... |
0903.4386 | Error-and-Erasure Decoding for Block Codes with Feedback | cs.IT math.IT | Inner and outer bounds are derived on the optimal performance of fixed length
block codes on discrete memoryless channels with feedback and
errors-and-erasures decoding. First an inner bound is derived using a two phase
encoding scheme with communication and control phases together with the optimal
decoding rule for ... |
0903.4426 | Capacity Scaling Laws for Underwater Networks | cs.IT math.IT | The underwater acoustic channel is characterized by a path loss that depends
not only on the transmission distance, but also on the signal frequency.
Signals transmitted from one user to another over a distance $l$ are subject to
a power loss of $l^{-\alpha}{a(f)}^{-l}$. Although a terrestrial radio channel
can be mo... |
0903.4434 | Random Linear Network Coding for Time-Division Duplexing: Queueing
Analysis | cs.IT math.IT | We study the performance of random linear network coding for time division
duplexing channels with Poisson arrivals. We model the system as a bulk-service
queue with variable bulk size. A full characterization for random linear
network coding is provided for time division duplexing channels [1] by means of
the moment... |
0903.4443 | Broadcasting in Time-Division Duplexing: A Random Linear Network Coding
Approach | cs.IT math.IT | We study random linear network coding for broadcasting in time division
duplexing channels. We assume a packet erasure channel with nodes that cannot
transmit and receive information simultaneously. The sender transmits coded
data packets back-to-back before stopping to wait for the receivers to
acknowledge the numbe... |
0903.4513 | Building the information kernel and the problem of recognition | cs.CV cs.AI | At this point in time there is a need for a new representation of different
information, to identify and organize descending its characteristics. Today,
science is a powerful tool for the description of reality - the numbers. Why
the most important property of numbers. Suppose we have a number 0.2351734, it
is clear ... |
0903.4526 | On the Achievable Rate of the Fading Dirty Paper Channel with Imperfect
CSIT | cs.IT math.IT | The problem of dirty paper coding (DPC) over the (multi-antenna) fading dirty
paper channel (FDPC) Y = H(X + S) + Z is considered when there is imperfect
knowledge of the channel state information H at the transmitter (CSIT). The
case of FDPC with positive definite (p.d.) input covariance matrix was studied
by the au... |
0903.4527 | Graph polynomials and approximation of partition functions with Loopy
Belief Propagation | cs.DM cs.LG | The Bethe approximation, or loopy belief propagation algorithm is a
successful method for approximating partition functions of probabilistic models
associated with a graph. Chertkov and Chernyak derived an interesting formula
called Loop Series Expansion, which is an expansion of the partition function.
The main term... |
0903.4530 | Nonnegative approximations of nonnegative tensors | cs.NA cs.IR | We study the decomposition of a nonnegative tensor into a minimal sum of
outer product of nonnegative vectors and the associated parsimonious naive
Bayes probabilistic model. We show that the corresponding approximation
problem, which is central to nonnegative PARAFAC, will always have optimal
solutions. The result h... |
0903.4545 | Computer- and robot-assisted Medical Intervention | cs.RO | Medical robotics includes assistive devices used by the physician in order to
make his/her diagnostic or therapeutic practices easier and more efficient.
This chapter focuses on such systems. It introduces the general field of
Computer-Assisted Medical Interventions, its aims, its different components and
describes t... |
0903.4554 | Fountain Codes and Invertible Matrices | cs.IT math.IT | This paper deals with Fountain codes, and especially with their encoding
matrices, which are required here to be invertible. A result is stated that an
encoding matrix induces a permutation. Also, a result is that encoding matrices
form a group with multiplication operation. An encoding is a transformation,
which red... |
0903.4582 | On the Achievable Diversity-Multiplexing Tradeoff in MIMO Fading
Channels with Imperfect CSIT | cs.IT math.IT | In this paper, we analyze the fundamental tradeoff of diversity and
multiplexing in multi-input multi-output (MIMO) channels with imperfect channel
state information at the transmitter (CSIT). We show that with imperfect CSIT,
a higher diversity gain as well as a more efficient diversity-multiplexing
tradeoff (DMT) c... |
0903.4594 | Dynamic Control of Tunable Sub-optimal Algorithms for Scheduling of
Time-varying Wireless Networks | cs.IT math.IT | It is well known that for ergodic channel processes the Generalized
Max-Weight Matching (GMWM) scheduling policy stabilizes the network for any
supportable arrival rate vector within the network capacity region. This
policy, however, often requires the solution of an NP-hard optimization
problem. This has motivated m... |
0903.4696 | Multidimensional Online Robot Motion | cs.CG cs.RO | We consider three related problems of robot movement in arbitrary dimensions:
coverage, search, and navigation. For each problem, a spherical robot is asked
to accomplish a motion-related task in an unknown environment whose geometry is
learned by the robot during navigation. The robot is assumed to have tactile
and ... |
0903.4738 | Constellation Precoded Beamforming | cs.IT math.IT | We present and analyze the performance of constellation precoded beamforming.
This multi-input multi-output transmission technique is based on the singular
value decomposition of a channel matrix. In this work, the beamformer is
precoded to improve its diversity performance. It was shown previously that
while single ... |
0903.4742 | Guaranteed Minimum Rank Approximation from Linear Observations by
Nuclear Norm Minimization with an Ellipsoidal Constraint | cs.IT math.IT | The rank minimization problem is to find the lowest-rank matrix in a given
set. Nuclear norm minimization has been proposed as an convex relaxation of
rank minimization. Recht, Fazel, and Parrilo have shown that nuclear norm
minimization subject to an affine constraint is equivalent to rank minimization
under a certa... |
0903.4817 | An Exponential Lower Bound on the Complexity of Regularization Paths | cs.LG cs.CG cs.CV math.OC stat.ML | For a variety of regularized optimization problems in machine learning,
algorithms computing the entire solution path have been developed recently.
Most of these methods are quadratic programs that are parameterized by a single
parameter, as for example the Support Vector Machine (SVM). Solution path
algorithms do no... |
0903.4826 | New Linear Codes from Matrix-Product Codes with Polynomial Units | cs.IT math.IT | A new construction of codes from old ones is considered, it is an extension
of the matrix-product construction. Several linear codes that improve the
parameters of the known ones are presented.
|
0903.4856 | A Combinatorial Algorithm to Compute Regularization Paths | cs.LG cs.AI cs.CV | For a wide variety of regularization methods, algorithms computing the entire
solution path have been developed recently. Solution path algorithms do not
only compute the solution for one particular value of the regularization
parameter but the entire path of solutions, making the selection of an optimal
parameter mu... |
0903.4860 | Learning Multiple Belief Propagation Fixed Points for Real Time
Inference | cs.LG cond-mat.dis-nn physics.data-an | In the context of inference with expectation constraints, we propose an
approach based on the "loopy belief propagation" algorithm LBP, as a surrogate
to an exact Markov Random Field MRF modelling. A prior information composed of
correlations among a large set of N variables, is encoded into a graphical
model; this e... |
0903.4930 | Time manipulation technique for speeding up reinforcement learning in
simulations | cs.AI cs.LG cs.RO | A technique for speeding up reinforcement learning algorithms by using time
manipulation is proposed. It is applicable to failure-avoidance control
problems running in a computer simulation. Turning the time of the simulation
backwards on failure events is shown to speed up the learning by 260% and
improve the state ... |
0903.4939 | A Novel Algorithm for Compressive Sensing: Iteratively Reweighed
Operator Algorithm (IROA) | cs.IT math.IT | Compressive sensing claims that the sparse signals can be reconstructed
exactly from many fewer measurements than traditionally believed necessary. One
of issues ensuring the successful compressive sensing is to deal with the
sparsity-constraint optimization. Up to now, many excellent theories,
algorithms and softwar... |
0903.5045 | Digital Restoration of Ancient Papyri | cs.CV | Image processing can be used for digital restoration of ancient papyri, that
is, for a restoration performed on their digital images. The digital
manipulation allows reducing the background signals and enhancing the
readability of texts. In the case of very old and damaged documents, this is
fundamental for identific... |
0903.5049 | SQS-graphs of extended 1-perfect codes | math.CO cs.IT math.IT | A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the
Steiner quadruple systems associated with its codewords. The resulting folding,
proposed as a graph invariant for $\mathcal C$, distinguishes among the 361
nonlinear codes $\mathcal C$ of kernel dimension $\kappa$ with $9\geq\kappa\geq
5$ obt... |
0903.5054 | Flow of Activity in the Ouroboros Model | cs.AI | The Ouroboros Model is a new conceptual proposal for an algorithmic structure
for efficient data processing in living beings as well as for artificial
agents. Its central feature is a general repetitive loop where one iteration
cycle sets the stage for the next. Sensory input activates data structures
(schemata) with... |
0903.5066 | Modified-CS: Modifying Compressive Sensing for Problems with Partially
Known Support | cs.IT math.IT math.ST stat.ME stat.TH | We study the problem of reconstructing a sparse signal from a limited number
of its linear projections when a part of its support is known, although the
known part may contain some errors. The ``known" part of the support, denoted
T, may be available from prior knowledge. Alternatively, in a problem of
recursively re... |
0903.5074 | Analyzing Least Squares and Kalman Filtered Compressed Sensing | cs.IT math.IT | In recent work, we studied the problem of causally reconstructing time
sequences of spatially sparse signals, with unknown and slow time-varying
sparsity patterns, from a limited number of linear "incoherent" measurements.
We proposed a solution called Kalman Filtered Compressed Sensing (KF-CS). The
key idea is to ru... |
0903.5108 | Multi-mode Transmission for the MIMO Broadcast Channel with Imperfect
Channel State Information | cs.IT math.IT | This paper proposes an adaptive multi-mode transmission strategy to improve
the spectral efficiency achieved in the multiple-input multiple-output (MIMO)
broadcast channel with delayed and quantized channel state information. The
adaptive strategy adjusts the number of active users, denoted as the
transmission mode, ... |
0903.5122 | A Constructive Generalization of Nash Equilibrium for Better Payoffs and
Stability | cs.GT cs.MA | In a society of completely selfish individuals where everybody is only
interested in maximizing his own payoff, does any equilibrium exist for the
society? John Nash proved more than 50 years ago that an equilibrium always
exists such that nobody would benefit from unilaterally changing his strategy.
Nash Equilibrium... |
0903.5168 | Mathematical Model for Transformation of Sentences from Active Voice to
Passive Voice | cs.CL | Formal work in linguistics has both produced and used important mathematical
tools. Motivated by a survey of models for context and word meaning, syntactic
categories, phrase structure rules and trees, an attempt is being made in the
present paper to present a mathematical model for structuring of sentences from
acti... |
0903.5172 | Delocalization transition for the Google matrix | cs.IR cond-mat.dis-nn nlin.AO | We study the localization properties of eigenvectors of the Google matrix,
generated both from the World Wide Web and from the Albert-Barabasi model of
networks. We establish the emergence of a delocalization phase for the PageRank
vector when network parameters are changed. In the phase of localized PageRank,
a delo... |
0903.5188 | Quantum decision theory as quantum theory of measurement | quant-ph cs.AI | We present a general theory of quantum information processing devices, that
can be applied to human decision makers, to atomic multimode registers, or to
molecular high-spin registers. Our quantum decision theory is a generalization
of the quantum theory of measurement, endowed with an action ring, a prospect
lattice... |
0903.5254 | Comparing Bibliometric Statistics Obtained from the Web of Science and
Scopus | cs.IR cs.DL | For more than 40 years, the Institute for Scientific Information (ISI, now
part of Thomson Reuters) produced the only available bibliographic databases
from which bibliometricians could compile large-scale bibliometric indicators.
ISI's citation indexes, now regrouped under the Web of Science (WoS), were the
major so... |
0903.5267 | Equitable Partitioning Policies for Mobile Robotic Networks | cs.RO | The most widely applied strategy for workload sharing is to equalize the
workload assigned to each resource. In mobile multi-agent systems, this
principle directly leads to equitable partitioning policies in which (i) the
workspace is divided into subregions of equal measure, (ii) there is a
bijective correspondence ... |
0903.5282 | Multi-agent Q-Learning of Channel Selection in Multi-user Cognitive
Radio Systems: A Two by Two Case | cs.IT math.IT | Resource allocation is an important issue in cognitive radio systems. It can
be done by carrying out negotiation among secondary users. However, significant
overhead may be incurred by the negotiation since the negotiation needs to be
done frequently due to the rapid change of primary users' activity. In this
paper, ... |
0903.5289 | Heterogeneous knowledge representation using a finite automaton and
first order logic: a case study in electromyography | cs.AI | In a certain number of situations, human cognitive functioning is difficult
to represent with classical artificial intelligence structures. Such a
difficulty arises in the polyneuropathy diagnosis which is based on the spatial
distribution, along the nerve fibres, of lesions, together with the synthesis
of several pa... |
0903.5328 | A Stochastic View of Optimal Regret through Minimax Duality | cs.LG stat.ML | We study the regret of optimal strategies for online convex optimization
games. Using von Neumann's minimax theorem, we show that the optimal regret in
this adversarial setting is closely related to the behavior of the empirical
minimization algorithm in a stochastic process setting: it is equal to the
maximum, over ... |
0903.5341 | Unspecified distribution in single disorder problem | math.PR cs.IT math.IT math.ST stat.TH | We register a stochastic sequence affected by one disorder. Monitoring of the
sequence is made in the circumstances when not full information about
distributions before and after the change is available. The initial problem of
disorder detection is transformed to optimal stopping of observed sequence.
Formula for opt... |
0903.5342 | Exact Non-Parametric Bayesian Inference on Infinite Trees | math.PR cs.LG math.ST stat.TH | Given i.i.d. data from an unknown distribution, we consider the problem of
predicting future items. An adaptive way to estimate the probability density is
to recursively subdivide the domain to an appropriate data-dependent
granularity. A Bayesian would assign a data-independent prior probability to
"subdivide", whic... |
0903.5346 | Cooperative Update Exchange in the Youtopia System | cs.DB | Youtopia is a platform for collaborative management and integration of
relational data. At the heart of Youtopia is an update exchange abstraction:
changes to the data propagate through the system to satisfy user-specified
mappings. We present a novel change propagation model that combines a
deterministic chase with ... |
0903.5372 | A game theory approach for self-coexistence analysis among IEEE 802.22
networks | cs.IT cs.GT math.IT | This paper has been withdrawn by the author due to some errors
|
0903.5399 | Regret and Jeffreys Integrals in Exp. Families | cs.IT math.IT | The problem of whether minimax redundancy, minimax regret and Jeffreys
integrals are finite or infinite are discussed.
|
0903.5426 | Testing Goodness-of-Fit via Rate Distortion | cs.IT math.IT math.ST stat.TH | A framework is developed using techniques from rate distortion theory in
statistical testing. The idea is first to do optimal compression according to a
certain distortion function and then use information divergence from the
compressed empirical distribution to the compressed null hypothesis as
statistic. Only very ... |
0904.0016 | Stochastic Models of User-Contributory Web Sites | cs.CY cs.IR | We describe a general stochastic processes-based approach to modeling
user-contributory web sites, where users create, rate and share content. These
models describe aggregate measures of activity and how they arise from simple
models of individual users. This approach provides a tractable method to
understand user ac... |
0904.0019 | On Solving Boolean Multilevel Optimization Problems | cs.LO cs.AI | Many combinatorial optimization problems entail a number of hierarchically
dependent optimization problems. An often used solution is to associate a
suitably large cost with each individual optimization problem, such that the
solution of the resulting aggregated optimization problem solves the original
set of hierarc... |
0904.0027 | Faith in the Algorithm, Part 2: Computational Eudaemonics | cs.CY cs.AI | Eudaemonics is the study of the nature, causes, and conditions of human
well-being. According to the ethical theory of eudaemonia, reaping satisfaction
and fulfillment from life is not only a desirable end, but a moral
responsibility. However, in modern society, many individuals struggle to meet
this responsibility. ... |
0904.0029 | Learning for Dynamic subsumption | cs.AI | In this paper a new dynamic subsumption technique for Boolean CNF formulae is
proposed. It exploits simple and sufficient conditions to detect during
conflict analysis, clauses from the original formula that can be reduced by
subsumption. During the learnt clause derivation, and at each step of the
resolution process... |
0904.0037 | Deterministic Capacity of MIMO Relay Networks | cs.IT math.IT | The deterministic capacity of a relay network is the capacity of a network
when relays are restricted to transmitting \emph{reliable} information, that
is, (asymptotically) deterministic function of the source message. In this
paper it is shown that the deterministic capacity of a number of MIMO relay
networks can be... |
0904.0052 | Stiffness Analysis of Overconstrained Parallel Manipulators | cs.RO | The paper presents a new stiffness modeling method for overconstrained
parallel manipulators with flexible links and compliant actuating joints. It is
based on a multidimensional lumped-parameter model that replaces the link
flexibility by localized 6-dof virtual springs that describe both
translational/rotational co... |
0904.0058 | Kinematics of A 3-PRP planar parallel robot | cs.RO | Recursive modelling for the kinematics of a 3-PRP planar parallel robot is
presented in this paper. Three planar chains connecting to the moving platform
of the manipulator are located in a vertical plane. Knowing the motion of the
platform, we develop the inverse kinematics and determine the positions,
velocities an... |
0904.0145 | Kinematic and Dynamic Analysis of the 2-DOF Spherical Wrist of
Orthoglide 5-axis | cs.RO physics.class-ph | This paper deals with the kinematics and dynamics of a two degree of freedom
spherical manipulator, the wrist of Orthoglide 5-axis. The latter is a parallel
kinematics machine composed of two manipulators: i) the Orthoglide 3-axis; a
three-dof translational parallel manipulator that belongs to the family of
Delta rob... |
0904.0226 | Coding Versus ARQ in Fading Channels: How reliable should the PHY be? | cs.IT math.IT | This paper studies the tradeoff between channel coding and ARQ (automatic
repeat request) in Rayleigh block-fading channels. A heavily coded system
corresponds to a low transmission rate with few ARQ re-transmissions, whereas
lighter coding corresponds to a higher transmitted rate but more
re-transmissions. The optim... |
0904.0228 | Safe Reasoning Over Ontologies | cs.AI cs.DS | As ontologies proliferate and automatic reasoners become more powerful, the
problem of protecting sensitive information becomes more serious. In
particular, as facts can be inferred from other facts, it becomes increasingly
likely that information included in an ontology, while not itself deemed
sensitive, may be abl... |
0904.0274 | Interference Alignment with Asymmetric Complex Signaling - Settling the
Host-Madsen-Nosratinia Conjecture | cs.IT math.IT | It has been conjectured by Host-Madsen and Nosratinia that complex Gaussian
interference channels with constant channel coefficients have only one
degree-of-freedom regardless of the number of users. While several examples are
known of constant channels that achieve more than 1 degree of freedom, these
special cases ... |
0904.0300 | Design, development and implementation of a tool for construction of
declarative functional descriptions of semantic web services based on WSMO
methodology | cs.AI cs.LO | Semantic web services (SWS) are self-contained, self-describing, semantically
marked-up software resources that can be published, discovered, composed and
executed across the Web in a semi-automatic way. They are a key component of
the future Semantic Web, in which networked computer programs become providers
and use... |
0904.0308 | Exponential decreasing rate of leaked information in universal random
privacy amplification | cs.IT cs.CR math.AC math.IT | We derive a new upper bound for Eve's information in secret key generation
from a common random number without communication. This bound improves on
Bennett et al(1995)'s bound based on the R\'enyi entropy of order 2 because the
bound obtained here uses the R\'enyi entropy of order $1+s$ for $s \in [0,1]$.
This bound... |
0904.0313 | Visual approach for data mining on medical information databases using
Fastmap algorithm | cs.IR cs.DB | The rapid development of tools for acquisition and storage of information has
lead to the formation of enormous medical databases. The large quantity of data
definitely surpasses the abilities of humans for efficient usage without
specialized tools for analysis. The situation is described as rich in data, but
poor in... |
0904.0477 | Message Passing for Optimization and Control of Power Grid: Model of
Distribution System with Redundancy | cond-mat.stat-mech cs.CE cs.NI | We use a power grid model with $M$ generators and $N$ consumption units to
optimize the grid and its control. Each consumer demand is drawn from a
predefined finite-size-support distribution, thus simulating the instantaneous
load fluctuations. Each generator has a maximum power capability. A generator
is not overloa... |
0904.0494 | Average Case Analysis of Multichannel Sparse Recovery Using Convex
Relaxation | cs.IT math.IT | In this paper, we consider recovery of jointly sparse multichannel signals
from incomplete measurements. Several approaches have been developed to recover
the unknown sparse vectors from the given observations, including thresholding,
simultaneous orthogonal matching pursuit (SOMP), and convex relaxation based on
a m... |
0904.0525 | The Minimal Polynomial over F_q of Linear Recurring Sequence over
F_{q^m} | cs.IT cs.CR math.IT | Recently, motivated by the study of vectorized stream cipher systems, the
joint linear complexity and joint minimal polynomial of multisequences have
been investigated. Let S be a linear recurring sequence over finite field
F_{q^m} with minimal polynomial h(x) over F_{q^m}. Since F_{q^m} and F_{q}^m
are isomorphic ve... |
0904.0544 | Mission-Aware Medium Access Control in Random Access Networks | cs.NI cs.GT cs.IT math.IT | We study mission-critical networking in wireless communication networks,
where network users are subject to critical events such as emergencies and
crises. If a critical event occurs to a user, the user needs to send necessary
information for help as early as possible. However, most existing medium access
control (MA... |
0904.0545 | Time Hopping technique for faster reinforcement learning in simulations | cs.AI cs.LG cs.RO | This preprint has been withdrawn by the author for revision
|
0904.0546 | Eligibility Propagation to Speed up Time Hopping for Reinforcement
Learning | cs.AI cs.LG cs.RO | A mechanism called Eligibility Propagation is proposed to speed up the Time
Hopping technique used for faster Reinforcement Learning in simulations.
Eligibility Propagation provides for Time Hopping similar abilities to what
eligibility traces provide for conventional Reinforcement Learning. It
propagates values from... |
0904.0570 | The Derivational Complexity Induced by the Dependency Pair Method | cs.LO cs.AI cs.CC cs.PL | We study the derivational complexity induced by the dependency pair method,
enhanced with standard refinements. We obtain upper bounds on the derivational
complexity induced by the dependency pair method in terms of the derivational
complexity of the base techniques employed. In particular we show that the
derivation... |
0904.0585 | Controller synthesis with very simplified linear constraints in PN model | cs.IT math.IT | This paper addresses the problem of forbidden states for safe Petri net
modeling discrete event systems. We present an efficient method to construct a
controller. A set of linear constraints allow forbidding the reachability of
specific states. The number of these so-called forbidden states and
consequently the numbe... |
0904.0586 | Optimal Supervisory Control Synthesis | cs.IT math.IT | The place invariant method is well known as an elegant way to construct a
Petri net controller. It is possible to use the constraint for preventing
forbidden states. But in general case, the number forbidden states can be very
large giving a great number of control places. In this paper is presented a
systematic meth... |
0904.0643 | Performing Nonlinear Blind Source Separation with Signal Invariants | cs.AI cs.LG | Given a time series of multicomponent measurements x(t), the usual objective
of nonlinear blind source separation (BSS) is to find a "source" time series
s(t), comprised of statistically independent combinations of the measured
components. In this paper, the source time series is required to have a density
function i... |
0904.0648 | Evolvability need not imply learnability | cs.LG cs.CC | We show that Boolean functions expressible as monotone disjunctive normal
forms are PAC-evolvable under a uniform distribution on the Boolean cube if the
hypothesis size is allowed to remain fixed. We further show that this result is
insufficient to prove the PAC-learnability of monotone Boolean functions,
thereby de... |
0904.0682 | Privacy in Search Logs | cs.DB cs.IR | Search engine companies collect the "database of intentions", the histories
of their users' search queries. These search logs are a gold mine for
researchers. Search engine companies, however, are wary of publishing search
logs in order not to disclose sensitive information. In this paper we analyze
algorithms for pu... |
0904.0721 | Optimal Tableau Decision Procedures for PDL | cs.LO cs.AI cs.CC | We reformulate Pratt's tableau decision procedure of checking satisfiability
of a set of formulas in PDL. Our formulation is simpler and more direct for
implementation. Extending the method we give the first EXPTIME (optimal)
tableau decision procedure not based on transformation for checking consistency
of an ABox w... |
0904.0747 | Bethe Free Energy Approach to LDPC Decoding on Memory Channels | cs.IT math.IT | We address the problem of the joint sequence detection in partial-response
(PR) channels and decoding of low-density parity-check (LDPC) codes. We model
the PR channel and the LDPC code as a combined inference problem. We present
for the first time the derivation of the belief propagation (BP) equations that
allow th... |
0904.0751 | Distributed Source Coding of Correlated Gaussian Remote Sources | cs.IT math.IT | We consider the distributed source coding system for $L$ correlated Gaussian
observations $Y_i, i=1,2, ..., L$. Let $X_i,i=1,2, ..., L$ be $L$ correlated
Gaussian random variables and $N_i,$ $i=1,2,... L$ be independent additive
Gaussian noises also independent of $X_i, i=1,2,..., L$. We consider the case
where for e... |
0904.0768 | Codes on Planar Graphs | cs.IT math.IT | Codes defined on graphs and their properties have been subjects of intense
recent research. On the practical side, constructions for capacity-approaching
codes are graphical. On the theoretical side, codes on graphs provide several
intriguing problems in the intersection of coding theory and graph theory. In
this pap... |
0904.0776 | Induction of High-level Behaviors from Problem-solving Traces using
Machine Learning Tools | stat.ML cs.LG | This paper applies machine learning techniques to student modeling. It
presents a method for discovering high-level student behaviors from a very
large set of low-level traces corresponding to problem-solving actions in a
learning environment. Basic actions are encoded into sets of domain-dependent
attribute-value pa... |
0904.0811 | The density of weights of Generalized Reed--Muller codes | cs.IT math.IT | We study the density of the weights of Generalized Reed--Muller codes. Let
$RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$
variables of total degree at most $r$. We consider the case of fixed degree
$r$, when we let the number of variables $m$ tend to infinity. We prove that
the set of rela... |
0904.0813 | Projective Space Codes for the Injection Metric | cs.IT math.IT | In the context of error control in random linear network coding, it is useful
to construct codes that comprise well-separated collections of subspaces of a
vector space over a finite field. In this paper, the metric used is the
so-called "injection distance", introduced by Silva and Kschischang. A
Gilbert-Varshamov b... |
0904.0814 | Stability Analysis and Learning Bounds for Transductive Regression
Algorithms | cs.LG | This paper uses the notion of algorithmic stability to derive novel
generalization bounds for several families of transductive regression
algorithms, both by using convexity and closed-form solutions. Our analysis
helps compare the stability of these algorithms. It also shows that a number of
widely used transductive... |
0904.0821 | Imaging of moving targets with multi-static SAR using an overcomplete
dictionary | cs.IT math.IT | This paper presents a method for imaging of moving targets using multi-static
SAR by treating the problem as one of spatial reflectivity signal inversion
over an overcomplete dictionary of target velocities. Since SAR sensor returns
can be related to the spatial frequency domain projections of the scattering
field, w... |
0904.0828 | On approximating Gaussian relay networks by deterministic networks | cs.IT math.IT | We examine the extent to which Gaussian relay networks can be approximated by
deterministic networks, and present two results, one negative and one positive.
The gap between the capacities of a Gaussian relay network and a
corresponding linear deterministic network can be unbounded. The key reasons
are that the lin... |
0904.0879 | On Superposition Coding for the Wyner-Ziv Problem | cs.IT math.IT | In problems of lossy source/noisy channel coding with side information, the
theoretical bounds are achieved using "good" source/channel codes that can be
partitioned into "good" channel/source codes. A scheme that achieves optimality
in channel coding with side information at the encoder using independent
channel and... |
0904.0942 | Boosting the Accuracy of Differentially-Private Histograms Through
Consistency | cs.DB cs.CR | We show that it is possible to significantly improve the accuracy of a
general class of histogram queries while satisfying differential privacy. Our
approach carefully chooses a set of queries to evaluate, and then exploits
consistency constraints that should hold over the noisy output. In a
post-processing phase, we... |
0904.0962 | Color Dipole Moments for Edge Detection | cs.CV | Dipole and higher moments are physical quantities used to describe a charge
distribution. In analogy with electromagnetism, it is possible to define the
dipole moments for a gray-scale image, according to the single aspect of a
gray-tone map. In this paper we define the color dipole moments for color
images. For colo... |
0904.0973 | A statistical mechanical interpretation of algorithmic information
theory III: Composite systems and fixed points | cs.IT cs.CC math.IT math.PR | The statistical mechanical interpretation of algorithmic information theory
(AIT, for short) was introduced and developed by our former works [K. Tadaki,
Local Proceedings of CiE 2008, pp.425-434, 2008] and [K. Tadaki, Proceedings of
LFCS'09, Springer's LNCS, vol.5407, pp.422-440, 2009], where we introduced the
notio... |
0904.0981 | Dependency Pairs and Polynomial Path Orders | cs.LO cs.AI cs.CC cs.SC | We show how polynomial path orders can be employed efficiently in conjunction
with weak innermost dependency pairs to automatically certify polynomial
runtime complexity of term rewrite systems and the polytime computability of
the functions computed. The established techniques have been implemented and we
provide am... |
0904.0986 | Approche conceptuelle par un processus d'annotation pour la
repr\'esentation et la valorisation de contenus informationnels en
intelligence \'economique (IE) | 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... |
0904.0994 | Breaking through the Thresholds: an Analysis for Iterative Reweighted
$\ell_1$ Minimization via the Grassmann Angle Framework | math.PR cs.IT math.IT | It is now well understood that $\ell_1$ minimization algorithm is able to
recover sparse signals from incomplete measurements [2], [1], [3] and sharp
recoverable sparsity thresholds have also been obtained for the $\ell_1$
minimization algorithm. However, even though iterative reweighted $\ell_1$
minimization algorit... |
0904.1144 | Alternative evaluation of statistical indicators in atoms: the
non-relativistic and relativistic cases | nlin.AO cs.IT math.IT physics.atom-ph | In this work, the calculation of a statistical measure of complexity and the
Fisher-Shannon information is performed for all the atoms in the periodic
table. Non-relativistic and relativistic cases are considered. We follow the
method suggested in [C.P. Panos, N.S. Nikolaidis, K. Ch. Chatzisavvas, C.C.
Tsouros, arXiv... |
0904.1149 | Chaitin \Omega numbers and halting problems | math.LO cs.CC cs.IT math.IT | Chaitin [G. J. Chaitin, J. Assoc. Comput. Mach., vol.22, pp.329-340, 1975]
introduced \Omega number as a concrete example of random real. The real \Omega
is defined as the probability that an optimal computer halts, where the optimal
computer is a universal decoding algorithm used to define the notion of
program-size... |
0904.1150 | Upper Bounds on the Capacities of Noncontrollable Finite-State Channels
with/without Feedback | cs.IT cs.SY math.IT math.OC | Noncontrollable finite-state channels (FSCs) are FSCs in which the channel
inputs have no influence on the channel states, i.e., the channel states evolve
freely. Since single-letter formulae for the channel capacities are rarely
available for general noncontrollable FSCs, computable bounds are usually
utilized to nu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.