id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1005.2815 | Evolving Genes to Balance a Pole | cs.AI | We discuss how to use a Genetic Regulatory Network as an evolutionary
representation to solve a typical GP reinforcement problem, the pole balancing.
The network is a modified version of an Artificial Regulatory Network proposed
a few years ago, and the task could be solved only by finding a proper way of
connecting ... |
1005.2819 | SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks | cs.CE cs.MS q-bio.MN | The importance of stochasticity within biological systems has been shown
repeatedly during the last years and has raised the need for efficient
stochastic tools. We present SABRE, a tool for stochastic analysis of
biochemical reaction networks. SABRE implements fast adaptive uniformization
(FAU), a direct numerical a... |
1005.2839 | Construction of Codes for Network Coding | cs.IT math.IT | Based on ideas of K\"otter and Kschischang we use constant dimension
subspaces as codewords in a network. We show a connection to the theory of
q-analogues of a combinatorial designs, which has been studied in Braun, Kerber
and Laue as a purely combinatorial object. For the construction of network
codes we successful... |
1005.2880 | General Classes of Lower Bounds on the Probability of Error in Multiple
Hypothesis Testing | cs.IT math.IT | In this paper, two new classes of lower bounds on the probability of error
for $m$-ary hypothesis testing are proposed. Computation of the minimum
probability of error which is attained by the maximum a-posteriori probability
(MAP) criterion is usually not tractable. The new classes are derived using
Holder's inequal... |
1005.2898 | Saturation Throughput - Delay Analysis of IEEE 802.11 DCF in Fading
Channel | cs.NI cs.IT cs.PF math.IT | In this paper, we analytically analyzed the impact of an error-prone channel
over all performance measures in a trafficsaturated IEEE 802.11 WLAN. We
calculated station's transmission probability by using the modified Markov
chain model of the backoff window size that considers the frame-error rates and
maximal allow... |
1005.2949 | Filter Bank Fusion Frames | cs.IT math.IT math.RT | In this paper we characterize and construct novel oversampled filter banks
implementing fusion frames. A fusion frame is a sequence of orthogonal
projection operators whose sum can be inverted in a numerically stable way.
When properly designed, fusion frames can provide redundant encodings of
signals which are optim... |
1005.2967 | Controlled Hopwise Averaging: Bandwidth/Energy-Efficient Asynchronous
Distributed Averaging for Wireless Networks | math.OC cs.DC cs.SY | This paper addresses the problem of averaging numbers across a wireless
network from an important, but largely neglected, viewpoint: bandwidth/energy
efficiency. We show that existing distributed averaging schemes have several
drawbacks and are inefficient, producing networked dynamical systems that
evolve with waste... |
1005.3004 | Observable dynamics and coordinate systems for automotive target
tracking | cs.RO | We investigate several coordinate systems and dynamical vector fields for
target tracking to be used in driver assistance systems. We show how to express
the discrete dynamics of maneuvering target vehicles in arbitrary coordinates
starting from the target's and the own (ego) vehicle's assumed dynamical model
in glob... |
1005.3093 | A remark about orthogonal matching pursuit algorithm | cs.IT math.IT math.NA | In this note, we investigate the theoretical properties of Orthogonal
Matching Pursuit (OMP), a class of decoder to recover sparse signal in
compressed sensing. In particular, we show that the OMP decoder can give
$(p,q)$ instance optimality for a large class of encoders with $1\leq p\leq q
\leq 2$ and $(p,q)\neq (2,... |
1005.3124 | An improved HeatS+ProbS hybrid recommendation algorithm based on
heterogeneous initial resource configurations | physics.soc-ph cs.IR | Network-based recommendation algorithms for user-object link predictions have
achieved significant developments in recent years. For bipartite graphs, the
reallocation of resource in such algorithms is analogous to heat spreading
(HeatS) or probability spreading (ProbS) processes. The best algorithm to date
is a hybr... |
1005.3184 | Key Distribution Protocols Based on Extractors Under the Condition of
Noisy Channels in the Presence of an Active Adversary | cs.IT math.IT | We consider in this paper the information-theoretic secure key distribution
problem over main and wire-tap noise channels with a public discussion in
presence of an active adversary. In contrast to the solution proposed by
ourselves for a similar problem using hashing for privacy amplification, in the
current paper w... |
1005.3185 | Dynamical issues in interactive representation of physical objects | cs.GR cs.HC cs.RO | The quality of a simulator equipped with a haptic interface is given by the
dynamical properties of its components: haptic interface, simulator and control
system. Some application areas of such kind of simulator like musical
synthesis, animation or more general, instrumental art have specific
requirements as for the... |
1005.3238 | Power Control and Performance Analysis of Outage-Limited Cellular
Network with MUD-SIC and Macro-Diversity | cs.IT math.IT | In this paper, we analyze the uplink goodput (bits/sec/Hz successfully
decoded) and per-user packet outage in a cellular network using multi-user
detection with successive interference cancellation (MUD-SIC). We consider
non-ergodic fading channels where microscopic fading channel information is not
available at the ... |
1005.3290 | Minimax state estimation for linear continuous differential-algebraic
equations | math.OC cs.SY | This paper describes a minimax state estimation approach for linear
Differential-Algebraic Equations (DAE) with uncertain parameters. The approach
addresses continuous-time DAE with non-stationary rectangular matrices and
uncertain bounded deterministic input. An observation's noise is supposed to be
random with zero... |
1005.3338 | Feedback Capacity of the Gaussian Interference Channel to within 2 Bits | cs.IT math.IT | We characterize the capacity region to within 2 bits/s/Hz and the symmetric
capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel
(IC) with feedback. We develop achievable schemes and derive a new outer bound
to arrive at this conclusion. One consequence of the result is that feedback
provides ... |
1005.3350 | Minimum Variance Multi-Frequency Distortionless Restriction for Digital
Wideband Beamformer | cs.IT math.IT | This paper proposes a digital amplitude-phase weighting array based a minimum
variance multi-frequency distortionless restriction (MVMFDR) to aviod the
frequency band signal distortion in digital beamformer and too short time delay
line (TDL) requirement in analoge wideband TDL array.
|
1005.3358 | The Role of Provenance Management in Accelerating the Rate of
Astronomical Research | astro-ph.IM cs.IR | The availability of vast quantities of data through electronic archives has
transformed astronomical research. It has also enabled the creation of new
products, models and simulations, often from distributed input data and models,
that are themselves made electronically available. These products will only
provide max... |
1005.3390 | Critical control of a genetic algorithm | cs.NE cond-mat.stat-mech | Based on speculations coming from statistical mechanics and the conjectured
existence of critical states, I propose a simple heuristic in order to control
the mutation probability and the population size of a genetic algorithm.
|
1005.3439 | Small World Property of a Rock Joint(Complexity of Frictional
Interfaces: A Complex Network Perspective) | physics.geo-ph cond-mat.dis-nn cs.CE nlin.AO | The shear strength and stick-slip behavior of a rough rock joint are analyzed
using the complex network approach. We develop a network approach on
correlation patterns of void spaces of an evolvable rough fracture (crack type
II). Correlation among networks properties with the hydro -mechanical
attributes (obtained f... |
1005.3486 | Exploration of AWGNC and BSC Pseudocodeword Redundancy | cs.IT math.IT | The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is
defined as the smallest number of rows in a parity-check matrix such that the
corresponding minimum pseudoweight is equal to the minimum Hamming distance of
the code. This paper provides new results on the AWGNC, BSC, and max-fractional
pseudoc... |
1005.3502 | Using machine learning to make constraint solver implementation
decisions | cs.AI | Programs to solve so-called constraint problems are complex pieces of
software which require many design decisions to be made more or less
arbitrarily by the implementer. These decisions affect the performance of the
finished solver significantly. Once a design decision has been made, it cannot
easily be reversed, al... |
1005.3529 | Network Synchronization in a Noisy Environment with Time Delays:
Fundamental Limits and Trade-Offs | cond-mat.stat-mech cond-mat.dis-nn cs.MA | We study the effects of nonzero time delays in stochastic synchronization
problems with linear couplings in an arbitrary network. Using the known exact
threshold value from the theory of differential equations with delays, we
provide the synchronizability threshold for an arbitrary network. Further, by
constructing t... |
1005.3561 | Two-Way Writing on Dirty Paper | cs.IT math.IT | In this paper, the Two-Way Channel (TWC) with Cannel State Information (CSI)
is investigated. First, an achievable rate region is derived for the discrete
memoryless channel. Then by extending the result to the Gaussian TWC with
additive interference noise, it is shown that the capacity region of the later
channel is... |
1005.3566 | Evolution with Drifting Targets | cs.LG | We consider the question of the stability of evolutionary algorithms to
gradual changes, or drift, in the target concept. We define an algorithm to be
resistant to drift if, for some inverse polynomial drift rate in the target
function, it converges to accuracy 1 -- \epsilon , with polynomial resources,
and then stay... |
1005.3579 | Graph-Structured Multi-task Regression and an Efficient Optimization
Method for General Fused Lasso | stat.ML cs.LG math.OC | We consider the problem of learning a structured multi-task regression, where
the output consists of multiple responses that are related by a graph and the
correlated response variables are dependent on the common inputs in a sparse
but synergistic manner. Previous methods such as l1/l2-regularized multi-task
regress... |
1005.3620 | Threshold effects in parameter estimation as phase transitions in
statistical mechanics | cs.IT cond-mat.dis-nn cond-mat.stat-mech math.IT | Threshold effects in the estimation of parameters of non-linearly modulated,
continuous-time, wide-band waveforms, are examined from a statistical physics
perspective. These threshold effects are shown to be analogous to phase
transitions of certain disordered physical systems in thermal equilibrium. The
main message... |
1005.3681 | Learning Kernel-Based Halfspaces with the Zero-One Loss | cs.LG | We describe and analyze a new algorithm for agnostically learning
kernel-based halfspaces with respect to the \emph{zero-one} loss function.
Unlike most previous formulations which rely on surrogate convex loss functions
(e.g. hinge-loss in SVM and log-loss in logistic regression), we provide finite
time/sample guara... |
1005.3729 | Compressive Sensing over the Grassmann Manifold: a Unified Geometric
Framework | cs.IT cs.DM math.IT | $\ell_1$ minimization is often used for finding the sparse solutions of an
under-determined linear system. In this paper we focus on finding sharp
performance bounds on recovering approximately sparse signals using $\ell_1$
minimization, possibly under noisy measurements. While the restricted isometry
property is pow... |
1005.3773 | Behavioral Simulations in MapReduce | cs.DB cs.DC | In many scientific domains, researchers are turning to large-scale behavioral
simulations to better understand important real-world phenomena. While there
has been a great deal of work on simulation tools from the high-performance
computing community, behavioral simulations remain challenging to program and
automatic... |
1005.3818 | Public and private resource trade-offs for a quantum channel | quant-ph cs.IT math.IT | Collins and Popescu realized a powerful analogy between several resources in
classical and quantum information theory. The Collins-Popescu analogy states
that public classical communication, private classical communication, and
secret key interact with one another somewhat similarly to the way that
classical communic... |
1005.3873 | Improved OMP Approach to Sparse Multi-path Channel Estimation via
Adaptive Inter-atom Interference Mitigation | cs.IT math.IT | Since most components of sparse multi-path channel (SMPC) are zero, impulse
response of SMPC can be recovered from a short training sequence. Though the
ordinary orthogonal matching pursuit (OMP) algorithm provides a very fast
implementation of SMPC estimation, it suffers from inter-atom interference
(IAI), especiall... |
1005.3889 | Capacity and Modulations with Peak Power Constraint | cs.IT math.IT | A practical communication channel often suffers from constraints on input
other than the average power, such as the peak power constraint. In order to
compare achievable rates with different constellations as well as the channel
capacity under such constraints, it is crucial to take these constraints into
considerati... |
1005.3902 | Morphonette: a morphological network of French | cs.CL | This paper describes in details the first version of Morphonette, a new
French morphological resource and a new radically lexeme-based method of
morphological analysis. This research is grounded in a paradigmatic conception
of derivational morphology where the morphological structure is a structure of
the entire lexi... |
1005.3968 | A Scheme of Concatenated Quantum Code to Protect against both
Computational Error and an Erasure | cs.IT math.IT quant-ph | We present a description of encoding/decoding for a concatenated quantum code
that enables both protection against quantum computational errors and the
occurrence of one quantum erasure. For this, it is presented how encoding and
decoding for quantum graph codes are done, which will provide the protection
against the... |
1005.4005 | Optical phase extraction algorithm based on the continuous wavelet and
the Hilbert transforms | cs.CE | In this paper we present an algorithm for optical phase evaluation based on
the wavelet transform technique. The main advantage of this method is that it
requires only one fringe pattern. This algorithm is based on the use of a
second {\pi}/2 phase shifted fringe pattern where it is calculated via the
Hilbert transfo... |
1005.4020 | Image Segmentation by Using Threshold Techniques | cs.CV | This paper attempts to undertake the study of segmentation image techniques
by using five threshold methods as Mean method, P-tile method, Histogram
Dependent Technique (HDT), Edge Maximization Technique (EMT) and visual
Technique and they are compared with one another so as to choose the best
technique for threshold... |
1005.4025 | A Soft Computing Model for Physicians' Decision Process | cs.AI | In this paper the author presents a kind of Soft Computing Technique, mainly
an application of fuzzy set theory of Prof. Zadeh [16], on a problem of Medical
Experts Systems. The choosen problem is on design of a physician's decision
model which can take crisp as well as fuzzy data as input, unlike the
traditional mod... |
1005.4032 | Combining Multiple Feature Extraction Techniques for Handwritten
Devnagari Character Recognition | cs.CV cs.AI | In this paper we present an OCR for Handwritten Devnagari Characters. Basic
symbols are recognized by neural classifier. We have used four feature
extraction techniques namely, intersection, shadow feature, chain code
histogram and straight line fitting features. Shadow features are computed
globally for character im... |
1005.4034 | Face Synthesis (FASY) System for Generation of a Face Image from Human
Description | cs.CV | This paper aims at generating a new face based on the human like description
using a new concept. The FASY (FAce SYnthesis) System is a Face Database
Retrieval and new Face generation System that is under development. One of its
main features is the generation of the requested face when it is not found in
the existin... |
1005.4035 | Classification of Polar-Thermal Eigenfaces using Multilayer Perceptron
for Human Face Recognition | cs.CV | This paper presents a novel approach to handle the challenges of face
recognition. In this work thermal face images are considered, which minimizes
the affect of illumination changes and occlusion due to moustache, beards,
adornments etc. The proposed approach registers the training and testing
thermal face images in... |
1005.4044 | Reduction of Feature Vectors Using Rough Set Theory for Human Face
Recognition | cs.CV | In this paper we describe a procedure to reduce the size of the input feature
vector. A complex pattern recognition problem like face recognition involves
huge dimension of input feature vector. To reduce that dimension here we have
used eigenspace projection (also called as Principal Component Analysis), which
is ba... |
1005.4103 | LACBoost and FisherBoost: Optimally Building Cascade Classifiers | cs.CV | Object detection is one of the key tasks in computer vision. The cascade
framework of Viola and Jones has become the de facto standard. A classifier in
each node of the cascade is required to achieve extremely high detection rates,
instead of low overall classification error. Although there are a few reported
methods... |
1005.4115 | Bucklin Voting is Broadly Resistant to Control | cs.CC cs.MA | Electoral control models ways of changing the outcome of an election via such
actions as adding/deleting/partitioning either candidates or voters. These
actions modify an election's participation structure and aim at either making a
favorite candidate win ("constructive control") or prevent a despised candidate
from ... |
1005.4118 | Incremental Training of a Detector Using Online Sparse
Eigen-decomposition | cs.CV | The ability to efficiently and accurately detect objects plays a very crucial
role for many computer vision tasks. Recently, offline object detectors have
shown a tremendous success. However, one major drawback of offline techniques
is that a complete set of training data has to be collected beforehand. In
addition, ... |
1005.4159 | The Complexity of Manipulating $k$-Approval Elections | cs.AI | An important problem in computational social choice theory is the complexity
of undesirable behavior among agents, such as control, manipulation, and
bribery in election systems. These kinds of voting strategies are often
tempting at the individual level but disastrous for the agents as a whole.
Creating election sys... |
1005.4178 | Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and
MBR Points via a Product-Matrix Construction | cs.IT cs.DC cs.NI math.IT | Regenerating codes are a class of distributed storage codes that optimally
trade the bandwidth needed for repair of a failed node with the amount of data
stored per node of the network. Minimum Storage Regenerating (MSR) codes
minimize first, the amount of data stored per node, and then the repair
bandwidth, while Mi... |
1005.4200 | A Robust Beamformer Based on Weighted Sparse Constraint | cs.IT math.IT | Applying a sparse constraint on the beam pattern has been suggested to
suppress the sidelobe level of a minimum variance distortionless response
(MVDR) beamformer. In this letter, we introduce a weighted sparse constraint in
the beamformer design to provide a lower sidelobe level and deeper nulls for
interference avo... |
1005.4216 | Classification of LULC Change Detection using Remotely Sensed Data for
Coimbatore City, Tamilnadu, India | cs.CV | Maps are used to describe far-off places . It is an aid for navigation and
military strategies. Mapping of the lands are important and the mapping work is
based on (i). Natural resource management & development (ii). Information
technology ,(iii). Environmental development ,(iv). Facility management and
(v). e-govern... |
1005.4263 | Facial Recognition Technology: An analysis with scope in India | cs.MA | A facial recognition system is a computer application for automatically
identifying or verifying a person from a digital image or a video frame from a
video source. One of the way is to do this is by comparing selected facial
features from the image and a facial database.It is typically used in security
systems and c... |
1005.4267 | Content Base Image Retrieval Using Phong Shading | cs.MM cs.IR | The digital image data is rapidly expanding in quantity and heterogeneity.
The traditional information retrieval techniques does not meet the user's
demand, so there is need to develop an efficient system for content based image
retrieval. Content based image retrieval means retrieval of images from
database on the b... |
1005.4270 | Clustering Time Series Data Stream - A Literature Survey | cs.IR | Mining Time Series data has a tremendous growth of interest in today's world.
To provide an indication various implementations are studied and summarized to
identify the different problems in existing applications. Clustering time
series is a trouble that has applications in an extensive assortment of fields
and has ... |
1005.4272 | Inaccuracy Minimization by Partioning Fuzzy Data Sets - Validation of
Analystical Methodology | cs.AI | In the last two decades, a number of methods have been proposed for
forecasting based on fuzzy time series. Most of the fuzzy time series methods
are presented for forecasting of car road accidents. However, the forecasting
accuracy rates of the existing methods are not good enough. In this paper, we
compared our pro... |
1005.4285 | Local Minima of a Quadratic Binary Functional with Quasi-Hebbian
Connection Matrix | cond-mat.dis-nn cs.NE | The local minima of a quadratic functional depending on binary variables are
discussed. An arbitrary connection matrix can be presented in the form of
quasi-Hebbian expansion where each pattern is supplied with its own individual
weight. For such matrices statistical physics methods allow one to derive an
equation de... |
1005.4292 | Application Of Fuzzy System In Segmentation Of MRI Brain Tumor | cs.CV | Segmentation of images holds an important position in the area of image
processing. It becomes more important whi le typically dealing with medical
images where presurgery and post surgery decisions are required for the purpose
of initiating and speeding up the recovery process. Segmentation of 3-D tumor
structures f... |
1005.4298 | Distantly Labeling Data for Large Scale Cross-Document Coreference | cs.AI cs.IR cs.LG | Cross-document coreference, the problem of resolving entity mentions across
multi-document collections, is crucial to automated knowledge base construction
and data mining tasks. However, the scarcity of large labeled data sets has
hindered supervised machine learning research for this task. In this paper we
develop ... |
1005.4316 | Bayesian Cram\'{e}r-Rao Bound for Noisy Non-Blind and Blind Compressed
Sensing | cs.IT math.IT | In this paper, we address the theoretical limitations in reconstructing
sparse signals (in a known complete basis) using compressed sensing framework.
We also divide the CS to non-blind and blind cases. Then, we compute the
Bayesian Cramer-Rao bound for estimating the sparse coefficients while the
measurement matrix ... |
1005.4344 | Max-stable sketches: estimation of Lp-norms, dominance norms and point
queries for non-negative signals | cs.DS cs.DB | Max-stable random sketches can be computed efficiently on fast streaming
positive data sets by using only sequential access to the data. They can be
used to answer point and Lp-norm queries for the signal. There is an intriguing
connection between the so-called p-stable (or sum-stable) and the max-stable
sketches. Ri... |
1005.4376 | Characterizing the community structure of complex networks | physics.soc-ph cs.IR | Community structure is one of the key properties of complex networks and
plays a crucial role in their topology and function. While an impressive amount
of work has been done on the issue of community detection, very little
attention has been so far devoted to the investigation of communities in real
networks. We pre... |
1005.4446 | Genetic algorithms and the art of Zen | cs.NE cs.AI | In this paper we present a novel genetic algorithm (GA) solution to a simple
yet challenging commercial puzzle game known as the Zen Puzzle Garden (ZPG). We
describe the game in detail, before presenting a suitable encoding scheme and
fitness function for candidate solutions. We then compare the performance of
the ge... |
1005.4447 | Evidence Algorithm and System for Automated Deduction: A Retrospective
View | cs.AI cs.LO | A research project aimed at the development of an automated theorem proving
system was started in Kiev (Ukraine) in early 1960s. The mastermind of the
project, Academician V.Glushkov, baptized it "Evidence Algorithm", EA. The work
on the project lasted, off and on, more than 40 years. In the framework of the
project,... |
1005.4457 | Pipeline-Centric Provenance Model | astro-ph.IM cs.IR | In this paper we propose a new provenance model which is tailored to a class
of workflow-based applications. We motivate the approach with use cases from
the astronomy community. We generalize the class of applications the approach
is relevant to and propose a pipeline-centric provenance model. Finally, we
evaluate t... |
1005.4461 | On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion
Approach | cs.IT math.IT | One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is
based on using multiple trials of a simple RS decoding algorithm in combination
with erasing or flipping a set of symbols or bits in each trial. This paper
presents a framework based on rate-distortion (RD) theory to analyze these
multiple-d... |
1005.4472 | Distributive Power Control Algorithm for Multicarrier Interference
Network over Time-Varying Fading Channels - Tracking Performance Analysis and
Optimization | cs.IT math.IT | Distributed power control over interference limited network has received an
increasing intensity of interest over the past few years. Distributed solutions
(like the iterative water-filling, gradient projection, etc.) have been
intensively investigated under \emph{quasi-static} channels. However, as such
distributed ... |
1005.4496 | Combining Naive Bayes and Decision Tree for Adaptive Intrusion Detection | cs.AI | In this paper, a new learning algorithm for adaptive network intrusion
detection using naive Bayesian classifier and decision tree is presented, which
performs balance detections and keeps false positives at acceptable level for
different types of network attacks, and eliminates redundant attributes as well
as contra... |
1005.4592 | Automated Reasoning and Presentation Support for Formalizing Mathematics
in Mizar | cs.AI | This paper presents a combination of several automated reasoning and proof
presentation tools with the Mizar system for formalization of mathematics. The
combination forms an online service called MizAR, similar to the SystemOnTPTP
service for first-order automated reasoning. The main differences to
SystemOnTPTP are ... |
1005.4695 | Providing Scalable Data Services in Ubiquitous Networks | cs.DB cs.NI | Topology is a fundamental part of a network that governs connectivity between
nodes, the amount of data flow and the efficiency of data flow between nodes.
In traditional networks, due to physical limitations, topology remains static
for the course of the network operation. Ubiquitous data networks (UDNs),
alternativ... |
1005.4697 | The Lambek-Grishin calculus is NP-complete | cs.CL | The Lambek-Grishin calculus LG is the symmetric extension of the
non-associative Lambek calculus NL. In this paper we prove that the
derivability problem for LG is NP-complete.
|
1005.4714 | Defining and Mining Functional Dependencies in Probabilistic Databases | cs.DB | Functional dependencies -- traditional, approximate and conditional are of
critical importance in relational databases, as they inform us about the
relationships between attributes. They are useful in schema normalization, data
rectification and source selection. Most of these were however developed in the
context of... |
1005.4717 | Smoothing proximal gradient method for general structured sparse
regression | stat.ML cs.LG math.OC stat.AP stat.CO | We study the problem of estimating high-dimensional regression models
regularized by a structured sparsity-inducing penalty that encodes prior
structural information on either the input or output variables. We consider two
widely adopted types of penalties of this kind as motivating examples: (1) the
general overlapp... |
1005.4752 | A database approach to information retrieval: The remarkable
relationship between language models and region models | cs.IR cs.DB | In this report, we unify two quite distinct approaches to information
retrieval: region models and language models. Region models were developed for
structured document retrieval. They provide a well-defined behaviour as well as
a simple query language that allows application developers to rapidly develop
application... |
1005.4769 | A Network Coding Approach to Loss Tomography | cs.IT cs.NI math.IT | Network tomography aims at inferring internal network characteristics based
on measurements at the edge of the network. In loss tomography, in particular,
the characteristic of interest is the loss rate of individual links and
multicast and/or unicast end-to-end probes are typically used. Independently,
recent advanc... |
1005.4774 | Fairness in Combinatorial Auctions | cs.GT cs.MA | The market economy deals with many interacting agents such as buyers and
sellers who are autonomous intelligent agents pursuing their own interests. One
such multi-agent system (MAS) that plays an important role in auctions is the
combinatorial auctioning system (CAS). We use this framework to define our
concept of f... |
1005.4815 | A Formal Specification of Dynamic Protocols for Open Agent Systems | cs.MA | Multi-agent systems where the agents are developed by parties with competing
interests, and where there is no access to an agent's internal state, are often
classified as `open'. The member agents of such systems may inadvertently fail
to, or even deliberately choose not to, conform to the system specification.
Conse... |
1005.4834 | Spectral Shape of Check-Hybrid GLDPC Codes | cs.IT math.IT | This paper analyzes the asymptotic exponent of both the weight spectrum and
the stopping set size spectrum for a class of generalized low-density
parity-check (GLDPC) codes. Specifically, all variable nodes (VNs) are assumed
to have the same degree (regular VN set), while the check node (CN) set is
assumed to be comp... |
1005.4853 | Analog Matching of Colored Sources to Colored Channels | cs.IT math.IT | Analog (uncoded) transmission provides a simple and robust scheme for
communicating a Gaussian source over a Gaussian channel under the mean squared
error (MSE) distortion measure. Unfortunately, its performance is usually
inferior to the all-digital, separation-based source-channel coding solution,
which requires ex... |
1005.4877 | Set-Monotonicity Implies Kelly-Strategyproofness | cs.MA | This paper studies the strategic manipulation of set-valued social choice
functions according to Kelly's preference extension, which prescribes that one
set of alternatives is preferred to another if and only if all elements of the
former are preferred to all elements of the latter. It is shown that
set-monotonicity-... |
1005.4895 | Parallel QR decomposition in LTE-A systems | cs.OH cs.IT math.IT | The QR Decomposition (QRD) of communication channel matrices is a fundamental
prerequisite to several detection schemes in Multiple-Input Multiple-Output
(MIMO) communication systems. Herein, the main feature of the QRD is to
transform the non-causal system into a causal system, where consequently
efficient detection... |
1005.4951 | The diversity-multiplexing tradeoff of the symmetric MIMO half-duplex
relay channel | cs.IT math.IT | This paper has been withdrawn due to an error in one of the equations in the
extended portion.
|
1005.4963 | Integrating Structured Metadata with Relational Affinity Propagation | cs.AI | Structured and semi-structured data describing entities, taxonomies and
ontologies appears in many domains. There is a huge interest in integrating
structured information from multiple sources; however integrating structured
data to infer complex common structures is a difficult task because the
integration must aggr... |
1005.4985 | User Scheduling for Cooperative Base Station Transmission Exploiting
Channel Asymmetry | cs.IT math.IT | We study low-signalling overhead scheduling for downlink coordinated
multi-point (CoMP) transmission with multi-antenna base stations (BSs) and
single-antenna users. By exploiting the asymmetric channel feature, i.e., the
pathloss differences towards different BSs, we derive a metric to judge
orthogonality among user... |
1005.4989 | A Formalization of the Turing Test | cs.AI | The paper offers a mathematical formalization of the Turing test. This
formalization makes it possible to establish the conditions under which some
Turing machine will pass the Turing test and the conditions under which every
Turing machine (or every Turing machine of the special class) will fail the
Turing test.
|
1005.4997 | Network analysis of a corpus of undeciphered Indus civilization
inscriptions indicates syntactic organization | cs.CL physics.data-an physics.soc-ph | Archaeological excavations in the sites of the Indus Valley civilization
(2500-1900 BCE) in Pakistan and northwestern India have unearthed a large
number of artifacts with inscriptions made up of hundreds of distinct signs. To
date there is no generally accepted decipherment of these sign sequences and
there have bee... |
1005.5035 | Dynamic Motion Modelling for Legged Robots | cs.RO | An accurate motion model is an important component in modern-day robotic
systems, but building such a model for a complex system often requires an
appreciable amount of manual effort. In this paper we present a motion model
representation, the Dynamic Gaussian Mixture Model (DGMM), that alleviates the
need to manuall... |
1005.5054 | Coordinated transmit and receive processing with adaptive multi-stream
selection | cs.IT math.IT | In this paper, we propose an adaptive coordinated Tx-Rx beamforming scheme
for inter-user interference cancellation, when a base station (BS) communicates
with multiple users that each has multiple receive antennas. The conventional
coordinated Tx-Rx beamforming scheme transmits a fixed number of data streams
for eac... |
1005.5063 | Keys through ARQ: Theory and Practice | cs.IT cs.CR math.IT | This paper develops a novel framework for sharing secret keys using the
Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying
information theoretic limits, under different assumptions on the channel
spatial and temporal correlation function. Our analysis reveals a novel role of
"dumb antennas"... |
1005.5065 | Upper-lower bounded-complexity QRD-M for spatial multiplexing MIMO-OFDM
systems | cs.IT math.IT | Multiple-input multiple-output (MIMO) technology applied with orthogonal
frequency division multiplexing (OFDM) is considered as the ultimate solution
to increase channel capacity without any additional spectral resources. At the
receiver side, the challenge resides in designing low complexity detection
algorithms ca... |
1005.5114 | Growing a Tree in the Forest: Constructing Folksonomies by Integrating
Structured Metadata | cs.AI | Many social Web sites allow users to annotate the content with descriptive
metadata, such as tags, and more recently to organize content hierarchically.
These types of structured metadata provide valuable evidence for learning how a
community organizes knowledge. For instance, we can aggregate many personal
hierarchi... |
1005.5115 | Improving GPS/INS Integration through Neural Networks | cs.NE | The Global Positioning Systems (GPS) and Inertial Navigation System (INS)
technology have attracted a considerable importance recently because of its
large number of solutions serving both military as well as civilian
applications. This paper aims to develop a more efficient and especially a
faster method for process... |
1005.5124 | Proofs, proofs, proofs, and proofs | cs.AI cs.LO math.HO | In logic there is a clear concept of what constitutes a proof and what not. A
proof is essentially defined as a finite sequence of formulae which are either
axioms or derived by proof rules from formulae earlier in the sequence.
Sociologically, however, it is more difficult to say what should constitute a
proof and w... |
1005.5141 | On Recursive Edit Distance Kernels with Application to Time Series
Classification | cs.LG cs.IR | This paper proposes some extensions to the work on kernels dedicated to
string or time series global alignment based on the aggregation of scores
obtained by local alignments. The extensions we propose allow to construct,
from classical recursive definition of elastic distances, recursive edit
distance (or time-warp)... |
1005.5170 | Wirtinger's Calculus in general Hilbert Spaces | cs.LG math.CV | The present report, has been inspired by the need of the author and its
colleagues to understand the underlying theory of Wirtinger's Calculus and to
further extend it to include the kernel case. The aim of the present manuscript
is twofold: a) it endeavors to provide a more rigorous presentation of the
related mater... |
1005.5181 | Compression Rate Method for Empirical Science and Application to
Computer Vision | cs.CV | This philosophical paper proposes a modified version of the scientific
method, in which large databases are used instead of experimental observations
as the necessary empirical ingredient. This change in the source of the
empirical data allows the scientific method to be applied to several aspects of
physical reality... |
1005.5197 | Ranked bandits in metric spaces: learning optimally diverse rankings
over large document collections | cs.LG cs.DS | Most learning to rank research has assumed that the utility of different
documents is independent, which results in learned ranking functions that
return redundant results. The few approaches that avoid this have rather
unsatisfyingly lacked theoretical foundations, or do not scale. We present a
learning-to-rank form... |
1005.5253 | Using Soft Constraints To Learn Semantic Models Of Descriptions Of
Shapes | cs.CL cs.AI cs.HC cs.LG | The contribution of this paper is to provide a semantic model (using soft
constraints) of the words used by web-users to describe objects in a language
game; a game in which one user describes a selected object of those composing
the scene, and another user has to guess which object has been described. The
given desc... |
1005.5268 | An Empirical Study of the Manipulability of Single Transferable Voting | cs.AI cs.GT cs.MA | Voting is a simple mechanism to combine together the preferences of multiple
agents. Agents may try to manipulate the result of voting by mis-reporting
their preferences. One barrier that might exist to such manipulation is
computational complexity. In particular, it has been shown that it is NP-hard
to compute how t... |
1005.5270 | Symmetries of Symmetry Breaking Constraints | cs.AI | Symmetry is an important feature of many constraint programs. We show that
any problem symmetry acting on a set of symmetry breaking constraints can be
used to break symmetry. Different symmetries pick out different solutions in
each symmetry class. This simple but powerful idea can be used in a number of
different w... |
1005.5271 | A Restful Approach for Managing Citizen profiles Using A Semantic
Support | cs.IR | Several steps are missing in the current high-speed race towards the holistic
support of citizen needs in the domain of eGovernment. This paper is focused on
how to provide support for the citizen profile. This profile, in a wide sense,
includes personal information as well documents in possession of the citizen.
Thi... |
1005.5337 | Using a Kernel Adatron for Object Classification with RCS Data | cs.LG stat.ML | Rapid identification of object from radar cross section (RCS) signals is
important for many space and military applications. This identification is a
problem in pattern recognition which either neural networks or support vector
machines should prove to be high-speed. Bayesian networks would also provide
value but req... |
1005.5348 | Error Analysis of Approximated PCRLBs for Nonlinear Dynamics | stat.AP cs.IT math.IT math.NA | In practical nonlinear filtering, the assessment of achievable filtering
performance is important. In this paper, we focus on the problem of efficiently
approximate the posterior Cramer-Rao lower bound (CRLB) in a recursive manner.
By using Gaussian assumptions, two types of approximations for calculating the
CRLB ar... |
1005.5361 | VHDL Implementation of different Turbo Encoder using Log-MAP Decoder | cs.IT math.IT | Turbo code is a great achievement in the field of communication system. It
can be created by connecting a turbo encoder and a decoder serially. A Turbo
encoder is build with parallel concatenation of two simple convolutional codes.
By varying the number of memory element (encoder configuration), code rate (1/2
or 1/3... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.