id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0906.3149 | Semi-Myopic Sensing Plans for Value Optimization | cs.AI | We consider the following sequential decision problem. Given a set of items
of unknown utility, we need to select one of as high a utility as possible
(``the selection problem''). Measurements (possibly noisy) of item values prior
to selection are allowed, at a known cost. The goal is to optimize the overall
sequenti... |
0906.3173 | Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and
Efficient Recovery | cs.IT math.IT | We consider compressed sensing of block-sparse signals, i.e., sparse signals
that have nonzero coefficients occurring in clusters. An uncertainty relation
for block-sparse signals is derived, based on a block-coherence measure, which
we introduce. We then show that a block-version of the orthogonal matching
pursuit a... |
0906.3183 | Approximate Characterizations for the Gaussian Source Broadcast
Distortion Region | cs.IT math.IT | We consider the joint source-channel coding problem of sending a Gaussian
source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new
outer bound to the achievable distortion region is derived using the technique
of introducing more than one additional auxiliary random variable, which was
previously ... |
0906.3192 | Secured Communication over Frequency-Selective Fading Channels: a
practical Vandermonde precoding | cs.IT math.IT | In this paper, we study the frequency-selective broadcast channel with
confidential messages (BCC) in which the transmitter sends a confidential
message to receiver 1 and a common message to receivers 1 and 2. In the case of
a block transmission of N symbols followed by a guard interval of L symbols,
the frequency-se... |
0906.3200 | On the Compound MIMO Broadcast Channels with Confidential Messages | cs.IT math.IT | We study the compound multi-input multi-output (MIMO) broadcast channel with
confidential messages (BCC), where one transmitter sends a common message to
two receivers and two confidential messages respectively to each receiver. The
channel state may take one of a finite set of states, and the transmitter knows
the s... |
0906.3234 | Asymptotic Analysis of MAP Estimation via the Replica Method and
Applications to Compressed Sensing | cs.IT math.IT | The replica method is a non-rigorous but well-known technique from
statistical physics used in the asymptotic analysis of large, random, nonlinear
problems. This paper applies the replica method, under the assumption of
replica symmetry, to study estimators that are maximum a posteriori (MAP) under
a postulated prior... |
0906.3235 | Simplicity via Provability for Universal Prefix-free Turing Machines | cs.IT cs.LO math.IT | Universality is one of the most important ideas in computability theory.
There are various criteria of simplicity for universal Turing machines.
Probably the most popular one is to count the number of states/symbols. This
criterion is more complex than it may appear at a first glance. In this note we
review recent re... |
0906.3282 | Maximum Error Modeling for Fault-Tolerant Computation using Maximum a
posteriori (MAP) Hypothesis | cs.IT math.IT | The application of current generation computing machines in safety-centric
applications like implantable biomedical chips and automobile safety has
immensely increased the need for reviewing the worst-case error behavior of
computing devices for fault-tolerant computation. In this work, we propose an
exact probabilis... |
0906.3313 | Efficient And Portable SDR Waveform Development: The Nucleus Concept | cs.IT cs.NI math.IT | Future wireless communication systems should be flexible to support different
waveforms (WFs) and be cognitive to sense the environment and tune themselves.
This has lead to tremendous interest in software defined radios (SDRs).
Constraints like throughput, latency and low energy demand high implementation
efficiency... |
0906.3323 | Adaptive Regularization of Ill-Posed Problems: Application to Non-rigid
Image Registration | cs.CV | We introduce an adaptive regularization approach. In contrast to conventional
Tikhonov regularization, which specifies a fixed regularization operator, we
estimate it simultaneously with parameters. From a Bayesian perspective we
estimate the prior distribution on parameters assuming that it is close to some
given mo... |
0906.3352 | Spreading Code and Widely-Linear Receiver Design: Non-Cooperative Games
for Wireless CDMA Networks | cs.IT cs.GT math.IT | The issue of non-cooperative transceiver optimization in the uplink of a
multiuser wireless code division multiple access data network with
widely-linear detection at the receiver is considered. While previous work in
this area has focused on a simple real signal model, in this paper a baseband
complex representation... |
0906.3410 | Quasi-cyclic LDPC codes with high girth | cs.IT math.IT | We study a class of quasi-cyclic LDPC codes. We provide precise conditions
guaranteeing high girth in their Tanner graph. Experimentally, the codes we
propose perform no worse than random LDPC codes with their same parameters,
which is a significant achievement for algebraic codes.
|
0906.3421 | Q-system Cluster Algebras, Paths and Total Positivity | q-fin.EC cs.SI physics.soc-ph | We review the solution of the $A_r$ Q-systems in terms of the partition
function of paths on a weighted graph, and show that it is possible to modify
the graphs and transfer matrices so as to provide an explicit connection to the
theory of planar networks introduced in the context of totally positive
matrices by Fomi... |
0906.3461 | AIS for Misbehavior Detection in Wireless Sensor Networks: Performance
and Design Principles | cs.NI cs.AI cs.CR cs.PF | A sensor network is a collection of wireless devices that are able to monitor
physical or environmental conditions. These devices (nodes) are expected to
operate autonomously, be battery powered and have very limited computational
capabilities. This makes the task of protecting a sensor network against
misbehavior or... |
0906.3499 | Convergence of fixed-point continuation algorithms for matrix rank
minimization | math.OC cs.IT math.IT | The matrix rank minimization problem has applications in many fields such as
system identification, optimal control, low-dimensional embedding, etc. As this
problem is NP-hard in general, its convex relaxation, the nuclear norm
minimization problem, is often solved instead. Recently, Ma, Goldfarb and Chen
proposed a ... |
0906.3554 | On the Algorithmic Nature of the World | cs.CC cs.IT math.IT | We propose a test based on the theory of algorithmic complexity and an
experimental evaluation of Levin's universal distribution to identify evidence
in support of or in contravention of the claim that the world is algorithmic in
nature. To this end we have undertaken a statistical comparison of the
frequency distrib... |
0906.3585 | Finding Significant Subregions in Large Image Databases | cs.DB cs.CV cs.IR | Images have become an important data source in many scientific and commercial
domains. Analysis and exploration of image collections often requires the
retrieval of the best subregions matching a given query. The support of such
content-based retrieval requires not only the formulation of an appropriate
scoring funct... |
0906.3667 | A Deterministic Equivalent for the Analysis of Correlated MIMO Multiple
Access Channels | cs.IT math.IT | In this article, novel deterministic equivalents for the Stieltjes transform
and the Shannon transform of a class of large dimensional random matrices are
provided. These results are used to characterise the ergodic rate region of
multiple antenna multiple access channels, when each point-to-point propagation
channel... |
0906.3682 | Large System Analysis of Linear Precoding in Correlated MISO Broadcast
Channels under Limited Feedback | cs.IT math.IT | In this paper, we study the sum rate performance of zero-forcing (ZF) and
regularized ZF (RZF) precoding in large MISO broadcast systems under the
assumptions of imperfect channel state information at the transmitter and
per-user channel transmit correlation. Our analysis assumes that the number of
transmit antennas ... |
0906.3722 | Two-Dimensional ARMA Modeling for Breast Cancer Detection and
Classification | cs.AI cs.CV physics.med-ph | We propose a new model-based computer-aided diagnosis (CAD) system for tumor
detection and classification (cancerous v.s. benign) in breast images.
Specifically, we show that (x-ray, ultrasound and MRI) images can be accurately
modeled by two-dimensional autoregressive-moving average (ARMA) random fields.
We derive a... |
0906.3736 | Weight Optimization for Consensus Algorithms with Correlated Switching
Topology | cs.IT math.IT | We design the weights in consensus algorithms with spatially correlated
random topologies. These arise with: 1) networks with spatially correlated
random link failures and 2) networks with randomized averaging protocols. We
show that the weight optimization problem is convex for both symmetric and
asymmetric random g... |
0906.3737 | On the Beamforming Design for Efficient Interference Alignment | cs.IT math.IT | An efficient interference alignment (IA) scheme is developed for $K$-user
single-input single-output frequency selective fading interference channels.
The main idea is to steer the transmit beamforming matrices such that at each
receiver the subspace dimensions occupied by interference-free desired streams
are asympt... |
0906.3741 | How opinions are received by online communities: A case study on
Amazon.com helpfulness votes | cs.CL cs.IR physics.data-an physics.soc-ph | There are many on-line settings in which users publicly express opinions. A
number of these offer mechanisms for other users to evaluate these opinions; a
canonical example is Amazon.com, where reviews come with annotations like "26
of 32 people found the following review helpful." Opinion evaluation appears in
many ... |
0906.3770 | Automatic Defect Detection and Classification Technique from Image: A
Special Case Using Ceramic Tiles | cs.CV | Quality control is an important issue in the ceramic tile industry. On the
other hand maintaining the rate of production with respect to time is also a
major issue in ceramic tile manufacturing. Again, price of ceramic tiles also
depends on purity of texture, accuracy of color, shape etc. Considering this
criteria, a... |
0906.3778 | Modified Euclidean Algorithms for Decoding Reed-Solomon Codes | cs.IT math.IT | The extended Euclidean algorithm (EEA) for polynomial greatest common
divisors is commonly used in solving the key equation in the decoding of
Reed-Solomon (RS) codes, and more generally in BCH decoding. For this
particular application, the iterations in the EEA are stopped when the degree
of the remainder polynomial... |
0906.3782 | On some sufficient conditions for distributed Quality-of-Service support
in wireless networks | cs.IT math.IT | Given a wireless network where some pairs of communication links interfere
with each other, we study sufficient conditions for determining whether a given
set of minimum bandwidth Quality of Service (QoS) requirements can be
satisfied. We are especially interested in algorithms which have low
communication overhead a... |
0906.3815 | Hybrid Rules with Well-Founded Semantics | cs.LO cs.AI cs.PL | A general framework is proposed for integration of rules and external first
order theories. It is based on the well-founded semantics of normal logic
programs and inspired by ideas of Constraint Logic Programming (CLP) and
constructive negation for logic programs. Hybrid rules are normal clauses
extended with constra... |
0906.3816 | A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft
Multiuser and Channel Parameter Estimation | cs.IT math.IT | An efficient, joint transmission delay and channel parameter estimation
algorithm is proposed for uplink asynchronous direct-sequence code-division
multiple access (DS-CDMA) systems based on the space-alternating generalized
expectation maximization (SAGE) framework. The marginal likelihood of the
unknown parameters,... |
0906.3821 | Relaying Simultaneous Multicast Messages | cs.IT math.IT | The problem of multicasting multiple messages with the help of a relay, which
may also have an independent message of its own to multicast, is considered. As
a first step to address this general model, referred to as the compound
multiple access channel with a relay (cMACr), the capacity region of the
multiple access... |
0906.3849 | Squeezing the Arimoto-Blahut algorithm for faster convergence | cs.IT math.IT stat.CO | The Arimoto--Blahut algorithm for computing the capacity of a discrete
memoryless channel is revisited. A so-called ``squeezing'' strategy is used to
design algorithms that preserve its simplicity and monotonic convergence
properties, but have provably better rates of convergence.
|
0906.3864 | The Two-Tap Input-Erasure Gaussian Channel and its Application to
Cellular Communications | cs.IT math.IT | This paper considers the input-erasure Gaussian channel. In contrast to the
output-erasure channel where erasures are applied to the output of a linear
time-invariant (LTI) system, here erasures, known to the receiver, are applied
to the inputs of the LTI system. Focusing on the case where the input symbols
are indep... |
0906.3883 | Diversity Analysis of Peaky FSK Signaling in Fading Channels | cs.IT math.IT | Error performance of noncoherent detection of on-off frequency shift keying
(OOFSK) modulation over fading channels is analyzed when the receiver is
equipped with multiple antennas. The analysis is conducted for two cases: 1)
the case in which the receiver has the channel distribution knowledge only; and
2) the case ... |
0906.3887 | Energy-Efficient Modulation Design for Reliable Communication in
Wireless Networks | cs.IT math.IT | In this paper, we have considered the optimization of the $M$-ary quadrature
amplitude modulation (MQAM) constellation size to minimize the bit energy
consumption under average bit error rate (BER) constraints. In the computation
of the energy expenditure, the circuit, transmission, and retransmission
energies are ta... |
0906.3888 | Effective Capacity Analysis of Cognitive Radio Channels for Quality of
Service Provisioning | cs.IT math.IT | In this paper, cognitive transmission under quality of service (QoS)
constraints is studied. In the cognitive radio channel model, it is assumed
that the secondary transmitter sends the data at two different average power
levels, depending on the activity of the primary users, which is determined by
channel sensing p... |
0906.3889 | Energy Efficiency in the Low-SNR Regime under Queueing Constraints and
Channel Uncertainty | cs.IT math.IT | Energy efficiency of fixed-rate transmissions is studied in the presence of
queueing constraints and channel uncertainty. It is assumed that neither the
transmitter nor the receiver has channel side information prior to
transmission. The channel coefficients are estimated at the receiver via
minimum mean-square-error... |
0906.3923 | Bayesian Forecasting of WWW Traffic on the Time Varying Poisson Model | cs.NI cs.LG | Traffic forecasting from past observed traffic data with small calculation
complexity is one of important problems for planning of servers and networks.
Focusing on World Wide Web (WWW) traffic as fundamental investigation, this
paper would deal with Bayesian forecasting of network traffic on the time
varying Poisson... |
0906.3926 | Soft Constraints for Quality Aspects in Service Oriented Architectures | cs.AI cs.PL | We propose the use of Soft Constraints as a natural way to model Service
Oriented Architecture. In the framework, constraints are used to model
components and connectors and constraint aggregation is used to represent their
interactions. The "quality of a service" is measured and considered when
performing queries to... |
0906.3988 | Theoretical Limits on Time Delay Estimation for Ultra-Wideband Cognitive
Radios | cs.IT math.IT | In this paper, theoretical limits on time delay estimation are studied for
ultra-wideband (UWB) cognitive radio systems. For a generic UWB spectrum with
dispersed bands, the Cramer-Rao lower bound (CRLB) is derived for unknown
channel coefficients and carrier-frequency offsets (CFOs). Then, the effects of
unknown cha... |
0906.4008 | Two generalizations on the minimum Hamming distance of repeated-root
constacyclic codes | cs.IT math.IT | We study constacyclic codes, of length $np^s$ and $2np^s$, that are generated
by the polynomials $(x^n + \gamma)^{\ell}$ and $(x^n - \xi)^i(x^n + \xi)^j$\
respectively, where $x^n + \gamma$, $x^n - \xi$ and $x^n + \xi$ are irreducible
over the alphabet $\F_{p^a}$. We generalize the results of [5], [6] and [7] by
comp... |
0906.4012 | Reduced-Feedback Opportunistic Scheduling and Beamforming with GMD for
MIMO-OFDMA | cs.IT math.IT | Opportunistic scheduling and beamforming schemes have been proposed
previously by the authors for reduced-feedback MIMO-OFDMA downlink systems
where the MIMO channel of each subcarrier is decomposed into layered spatial
subchannels. It has been demonstrated that significant feedback reduction can
be achieved by retur... |
0906.4026 | A Quantum-based Model for Interactive Information Retrieval (extended
version) | cs.IR cs.DL | Even the best information retrieval model cannot always identify the most
useful answers to a user query. This is in particular the case with web search
systems, where it is known that users tend to minimise their effort to access
relevant information. It is, however, believed that the interaction between
users and a... |
0906.4032 | Bayesian two-sample tests | cs.LG | In this paper, we present two classes of Bayesian approaches to the
two-sample problem. Our first class of methods extends the Bayesian t-test to
include all parametric models in the exponential family and their conjugate
priors. Our second class of methods uses Dirichlet process mixtures (DPM) of
such conjugate-expo... |
0906.4036 | Physical Modeling Techniques in Active Contours for Image Segmentation | cs.CV cs.GR | Physical modeling method, represented by simulation and visualization of the
principles in physics, is introduced in the shape extraction of the active
contours. The objectives of adopting this concept are to address the several
major difficulties in the application of Active Contours. Primarily, a
technique is devel... |
0906.4044 | Recommender Systems for the Conference Paper Assignment Problem | cs.IR cs.AI | Conference paper assignment, i.e., the task of assigning paper submissions to
reviewers, presents multi-faceted issues for recommender systems research.
Besides the traditional goal of predicting `who likes what?', a conference
management system must take into account aspects such as: reviewer capacity
constraints, a... |
0906.4096 | An Event Based Approach To Situational Representation | cs.DB cs.AI | Many application domains require representing interrelated real-world
activities and/or evolving physical phenomena. In the crisis response domain,
for instance, one may be interested in representing the state of the unfolding
crisis (e.g., forest fire), the progress of the response activities such as
evacuation and ... |
0906.4131 | Automatic Spatially-Adaptive Balancing of Energy Terms for Image
Segmentation | cs.CV | Image segmentation techniques are predominately based on parameter-laden
optimization. The objective function typically involves weights for balancing
competing image fidelity and segmentation regularization cost terms. Setting
these weights suitably has been a painstaking, empirical process. Even if such
ideal weigh... |
0906.4154 | Distributed Fault Detection in Sensor Networks using a Recurrent Neural
Network | cs.NE cs.DC | In long-term deployments of sensor networks, monitoring the quality of
gathered data is a critical issue. Over the time of deployment, sensors are
exposed to harsh conditions, causing some of them to fail or to deliver less
accurate data. If such a degradation remains undetected, the usefulness of a
sensor network ca... |
0906.4162 | A Divergence Formula for Randomness and Dimension (Short Version) | cs.CC cs.IT math.IT | If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is
a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with
respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of
Billingsley dimension that coincides with the (constructive Hausdorff)
dimension $\dim(S)$ wh... |
0906.4172 | Rough Set Model for Discovering Hybrid Association Rules | cs.DB cs.LG | In this paper, the mining of hybrid association rules with rough set approach
is investigated as the algorithm RSHAR.The RSHAR algorithm is constituted of
two steps mainly. At first, to join the participant tables into a general table
to generate the rules which is expressing the relationship between two or more
doma... |
0906.4228 | On Chase Termination Beyond Stratification | cs.DB cs.AI | We study the termination problem of the chase algorithm, a central tool in
various database problems such as the constraint implication problem,
Conjunctive Query optimization, rewriting queries using views, data exchange,
and data integration. The basic idea of the chase is, given a database instance
and a set of co... |
0906.4316 | Constructive Decision Theory | cs.GT cs.AI econ.TH | In most contemporary approaches to decision making, a decision problem is
described by a sets of states and set of outcomes, and a rich set of acts,
which are functions from states to outcomes over which the decision maker (DM)
has preferences. Most interesting decision problems, however, do not come with
a state spa... |
0906.4321 | Reasoning About Knowledge of Unawareness Revisited | cs.AI cs.GT cs.LO | In earlier work, we proposed a logic that extends the Logic of General
Awareness of Fagin and Halpern [1988] by allowing quantification over primitive
propositions. This makes it possible to express the fact that an agent knows
that there are some facts of which he is unaware. In that logic, it is not
possible to mod... |
0906.4326 | A Logical Characterization of Iterated Admissibility | cs.AI cs.GT cs.LO | Brandenburger, Friedenberg, and Keisler provide an epistemic characterization
of iterated admissibility (i.e., iterated deletion of weakly dominated
strategies) where uncertainty is represented using LPSs (lexicographic
probability sequences). Their characterization holds in a rich structure called
a complete structu... |
0906.4327 | A Rough Sets Partitioning Model for Mining Sequential Patterns with Time
Constraint | cs.DB | Now a days, data mining and knowledge discovery methods are applied to a
variety of enterprise and engineering disciplines to uncover interesting
patterns from databases. The study of Sequential patterns is an important data
mining problem due to its wide applications to real world time dependent
databases. Sequentia... |
0906.4332 | Updating Sets of Probabilities | cs.AI | There are several well-known justifications for conditioning as the
appropriate method for updating a single probability measure, given an
observation. However, there is a significant body of work arguing for sets of
probability measures, rather than single measures, as a more realistic model of
uncertainty. Conditio... |
0906.4415 | Robust Watermarking in Multiresolution Walsh-Hadamard Transform | cs.CR cs.IT cs.MM math.IT | In this paper, a newer version of Walsh-Hadamard Transform namely
multiresolution Walsh-Hadamard Transform (MR-WHT) is proposed for images.
Further, a robust watermarking scheme is proposed for copyright protection
using MRWHT and singular value decomposition. The core idea of the proposed
scheme is to decompose an i... |
0906.4454 | Activatability for simulation tractability of NP problems: Application
to Ecology | q-bio.QM cs.CE | Dynamics of biological-ecological systems is strongly depending on spatial
dimensions. Most of powerful simulators in ecology take into account for system
spatiality thus embedding stochastic processes. Due to the difficulty of
researching particular trajectories, biologists and computer scientists aim at
predicting ... |
0906.4539 | Learning with Spectral Kernels and Heavy-Tailed Data | cs.LG cs.DS | Two ubiquitous aspects of large-scale data analysis are that the data often
have heavy-tailed properties and that diffusion-based or spectral-based methods
are often used to identify and extract structure of interest. Perhaps
surprisingly, popular distribution-independent methods such as those based on
the VC dimensi... |
0906.4560 | Coordinated Weighted Sampling for Estimating Aggregates Over Multiple
Weight Assignments | cs.DB cs.NI | Many data sources are naturally modeled by multiple weight assignments over a
set of keys: snapshots of an evolving database at multiple points in time,
measurements collected over multiple time periods, requests for resources
served at multiple locations, and records with multiple numeric attributes.
Over such vecto... |
0906.4582 | On landmark selection and sampling in high-dimensional data analysis | stat.ML cs.CV cs.LG | In recent years, the spectral analysis of appropriately defined kernel
matrices has emerged as a principled way to extract the low-dimensional
structure often prevalent in high-dimensional data. Here we provide an
introduction to spectral methods for linear and nonlinear dimension reduction,
emphasizing ways to overc... |
0906.4589 | Further Analysis on Resource Allocation in Wireless Communications Under
Imperfect Channel State Information | cs.IT math.IT | This paper has been withdrawn by the author due to some errors.
|
0906.4597 | Large deviations sum-queue optimality of a radial sum-rate monotone
opportunistic scheduler | cs.IT math.IT | A centralized wireless system is considered that is serving a fixed set of
users with time varying channel capacities. An opportunistic scheduling rule in
this context selects a user (or users) to serve based on the current channel
state and user queues. Unless the user traffic is symmetric and/or the
underlying capa... |
0906.4602 | Minimal Gr\"obner bases and the predictable leading monomial property | cs.IT math.IT | We focus on Gr\"obner bases for modules of univariate polynomial vectors over
a ring. We identify a useful property, the "predictable leading monomial (PLM)
property" that is shared by minimal Gr\"{o}bner bases of modules in F[x]^q, no
matter what positional term order is used. The PLM property is useful in a
range o... |
0906.4615 | Diversity-Multiplexing Tradeoff for the Multiple-Antenna Wire-tap
Channel | cs.IT math.IT | In this paper the fading multiple antenna (MIMO) wire-tap channel is
investigated under short term power constraints. The secret diversity gain and
the secret multiplexing gain are defined. Using these definitions, the secret
diversitymultiplexing tradeoff (DMT) is calculated analytically for no
transmitter side chan... |
0906.4643 | The Poisson Channel with Side Information | cs.IT math.IT | The continuous-time, peak-limited, infinite-bandwidth Poisson channel with
spurious counts is considered. It is shown that if the times at which the
spurious counts occur are known noncausally to the transmitter but not to the
receiver, then the capacity is equal to that of the Poisson channel with no
spurious counts... |
0906.4663 | Acquiring Knowledge for Evaluation of Teachers Performance in Higher
Education using a Questionnaire | cs.LG | In this paper, we present the step by step knowledge acquisition process by
choosing a structured method through using a questionnaire as a knowledge
acquisition tool. Here we want to depict the problem domain as, how to evaluate
teachers performance in higher education through the use of expert system
technology. Th... |
0906.4675 | Competition for Popularity in Bipartite Networks | physics.soc-ph cs.SI physics.data-an | We present a dynamical model for rewiring and attachment in bipartite
networks in which edges are added between nodes that belong to catalogs that
can either be fixed in size or growing in size. The model is motivated by an
empirical study of data from the video rental service Netflix, which invites
its users to give... |
0906.4690 | Fuzzy Logic Based Method for Improving Text Summarization | cs.IR | Text summarization can be classified into two approaches: extraction and
abstraction. This paper focuses on extraction approach. The goal of text
summarization based on extraction approach is sentence selection. One of the
methods to obtain the suitable sentences is to assign some numerical measure of
a sentence for ... |
0906.4692 | On optimally partitioning a text to improve its compression | cs.DS cs.IT math.IT | In this paper we investigate the problem of partitioning an input string T in
such a way that compressing individually its parts via a base-compressor C gets
a compressed output that is shorter than applying C over the entire T at once.
This problem was introduced in the context of table compression, and then
further... |
0906.4764 | A Novel Bid Optimizer for Sponsored Search Auctions based on Cooperative
Game Theory | cs.GT cs.MA | In this paper, we propose a bid optimizer for sponsored keyword search
auctions which leads to better retention of advertisers by yielding attractive
utilities to the advertisers without decreasing the revenue to the search
engine. The bid optimizer is positioned as a key value added tool the search
engine provides t... |
0906.4779 | Minimum Probability Flow Learning | cs.LG physics.data-an stat.ML | Fitting probabilistic models to data is often difficult, due to the general
intractability of the partition function and its derivatives. Here we propose a
new parameter estimation technique that does not require computing an
intractable normalization factor or sampling from the equilibrium distribution
of the model.... |
0906.4789 | Efficient IRIS Recognition through Improvement of Feature Extraction and
subset Selection | cs.CV | The selection of the optimal feature subset and the classification has become
an important issue in the field of iris recognition. In this paper we propose
several methods for iris feature subset selection and vector creation. The
deterministic feature sequence is extracted from the iris image by using the
contourlet... |
0906.4805 | A Trivial Observation related to Sparse Recovery | cs.IT math.IT | We make a trivial modification to the elegant analysis of Garg and Khandekar
(\emph{Gradient Descent with Sparsification} ICML 2009) that replaces the
standard Restricted Isometry Property (RIP), with another RIP-type property
(which could be simpler than the RIP, but we are not sure; it could be as hard
as the RIP... |
0906.4827 | Physical Layer Security: Coalitional Games for Distributed Cooperation | cs.IT cs.GT math.IT | Cooperation between wireless network nodes is a promising technique for
improving the physical layer security of wireless transmission, in terms of
secrecy capacity, in the presence of multiple eavesdroppers. While existing
physical layer security literature answered the question "what are the
link-level secrecy capa... |
0906.4838 | Forecasting Model for Crude Oil Price Using Artificial Neural Networks
and Commodity Futures Prices | cs.NE q-fin.PM | This paper presents a model based on multilayer feedforward neural network to
forecast crude oil spot price direction in the short-term, up to three days
ahead. A great deal of attention was paid on finding the optimal ANN model
structure. In addition, several methods of data pre-processing were tested. Our
approach ... |
0906.4846 | A genetic algorithm for structure-activity relationships: software
implementation | cs.NE | The design and the implementation of a genetic algorithm are described. The
applicability domain is on structure-activity relationships expressed as
multiple linear regressions and predictor variables are from families of
structure-based molecular descriptors. An experiment to compare different
selection and survival... |
0906.4913 | Explicit Construction of Optimal Exact Regenerating Codes for
Distributed Storage | cs.IT math.IT | Erasure coding techniques are used to increase the reliability of distributed
storage systems while minimizing storage overhead. Also of interest is
minimization of the bandwidth required to repair the system following a node
failure. In a recent paper, Wu et al. characterize the tradeoff between the
repair bandwidth... |
0906.4927 | Fast Probabilistic Ranking under x-Relation Model | cs.DB | The probabilistic top-k queries based on the interplay of score and
probability, under the possible worlds semantic, become an important research
issue that considers both score and uncertainty on the same basis. In the
literature, many different probabilistic top-k queries are proposed. Almost all
of them need to co... |
0906.4973 | Vision Based Navigation for a Mobile Robot with Different Field of Views | cs.RO | The basic idea behind evolutionary robotics is to evolve a set of neural
controllers for a particular task at hand. It involves use of various input
parameters such as infrared sensors, light sensors and vision based methods.
This paper aims to explore the evolution of vision based navigation in a mobile
robot. It di... |
0906.4982 | Concept-based Recommendations for Internet Advertisement | cs.AI cs.CY cs.IR stat.ML | The problem of detecting terms that can be interesting to the advertiser is
considered. If a company has already bought some advertising terms which
describe certain services, it is reasonable to find out the terms bought by
competing companies. A part of them can be recommended as future advertising
terms to the com... |
0906.5007 | Spread of Misinformation in Social Networks | cs.IT cs.DC math.IT math.PR | We provide a model to investigate the tension between information aggregation
and spread of misinformation in large societies (conceptualized as networks of
agents communicating with each other). Each individual holds a belief
represented by a scalar. Individuals meet pairwise and exchange information,
which is model... |
0906.5017 | Collaborative filtering with diffusion-based similarity on tripartite
graphs | cs.IR | Collaborative tags are playing more and more important role for the
organization of information systems. In this paper, we study a personalized
recommendation model making use of the ternary relations among users, objects
and tags. We propose a measure of user similarity based on his preference and
tagging informatio... |
0906.5022 | Chemical Power for Microscopic Robots in Capillaries | cs.RO physics.bio-ph | The power available to microscopic robots (nanorobots) that oxidize
bloodstream glucose while aggregated in circumferential rings on capillary
walls is evaluated with a numerical model using axial symmetry and
time-averaged release of oxygen from passing red blood cells. Robots about one
micron in size can produce up... |
0906.5023 | An Upper Bound on the Minimum Weight of Type II $\ZZ_{2k}$-Codes | math.CO cs.IT math.IT | In this paper, we give a new upper bound on the minimum Euclidean weight of
Type II $\ZZ_{2k}$-codes and the concept of extremality for the Euclidean
weights when $k=3,4,5,6$. Together with the known result, we demonstrate that
there is an extremal Type II $\ZZ_{2k}$-code of length $8m$ $(m \le 8)$ when
$k=3,4,5,6$.
|
0906.5034 | Effective Focused Crawling Based on Content and Link Structure Analysis | cs.IR | A focused crawler traverses the web selecting out relevant pages to a
predefined topic and neglecting those out of concern. While surfing the
internet it is difficult to deal with irrelevant pages and to predict which
links lead to quality pages. In this paper a technique of effective focused
crawling is implemented ... |
0906.5038 | A Novel Two-Stage Dynamic Decision Support based Optimal Threat
Evaluation and Defensive Resource Scheduling Algorithm for Multi Air-borne
threats | cs.AI | This paper presents a novel two-stage flexible dynamic decision support based
optimal threat evaluation and defensive resource scheduling algorithm for
multi-target air-borne threats. The algorithm provides flexibility and
optimality by swapping between two objective functions, i.e. the preferential
and subtractive d... |
0906.5039 | A new approach for digit recognition based on hand gesture analysis | cs.CV | We present in this paper a new approach for hand gesture analysis that allows
digit recognition. The analysis is based on extracting a set of features from a
hand image and then combining them by using an induction graph. The most
important features we extract from each image are the fingers locations, their
heights ... |
0906.5040 | Towards the Patterns of Hard CSPs with Association Rule Mining | cs.DB cs.AI | The hardness of finite domain Constraint Satisfaction Problems (CSPs) is a
very important research area in Constraint Programming (CP) community. However,
this problem has not yet attracted much attention from the researchers in the
association rule mining community. As a popular data mining technique,
association ru... |
0906.5110 | Statistical Analysis of Privacy and Anonymity Guarantees in Randomized
Security Protocol Implementations | cs.CR cs.LG | Security protocols often use randomization to achieve probabilistic
non-determinism. This non-determinism, in turn, is used in obfuscating the
dependence of observable values on secret data. Since the correctness of
security protocols is very important, formal analysis of security protocols has
been widely studied in... |
0906.5114 | Non-Parametric Bayesian Areal Linguistics | cs.CL | We describe a statistical model over linguistic areas and phylogeny.
Our model recovers known areas and identifies a plausible hierarchy of areal
features. The use of areas improves genetic reconstruction of languages both
qualitatively and quantitatively according to a variety of metrics. We model
linguistic areas... |
0906.5119 | General combination rules for qualitative and quantitative beliefs | cs.AI | Martin and Osswald \cite{Martin07} have recently proposed many
generalizations of combination rules on quantitative beliefs in order to manage
the conflict and to consider the specificity of the responses of the experts.
Since the experts express themselves usually in natural language with
linguistic labels, Smaranda... |
0906.5120 | Comments on "A new combination of evidence based on compromise" by K.
Yamada | cs.CV cs.AI | Comments on ``A new combination of evidence based on compromise'' by K.
Yamada
|
0906.5131 | A Comment on Nonextensive Statistical Mechanics | cs.IT math.IT | There is a conception that Boltzmann-Gibbs statistics cannot yield the long
tail distribution. This is the justification for the intensive research of
nonextensive entropies (i.e. Tsallis entropy and others). Here the error that
caused this misconception is explained and it is shown that a long tail
distribution exis... |
0906.5148 | Explicit probabilistic models for databases and networks | cs.AI cs.DB cs.IT math.IT | Recent work in data mining and related areas has highlighted the importance
of the statistical assessment of data mining results. Crucial to this endeavour
is the choice of a non-trivial null model for the data, to which the found
patterns can be contrasted. The most influential null models proposed so far
are define... |
0906.5151 | Unsupervised Search-based Structured Prediction | cs.LG | We describe an adaptation and application of a search-based structured
prediction algorithm "Searn" to unsupervised learning problems. We show that it
is possible to reduce unsupervised learning to supervised learning and
demonstrate a high-quality unsupervised shift-reduce parsing model. We
additionally show a close... |
0906.5233 | Restricted Global Grammar Constraints | cs.AI cs.FL | We investigate the global GRAMMAR constraint over restricted classes of
context free grammars like deterministic and unambiguous context-free grammars.
We show that detecting disentailment for the GRAMMAR constraint in these cases
is as hard as parsing an unrestricted context free grammar.We also consider the
class o... |
0906.5278 | Spectrum of Fractal Interpolation Functions | cs.IT math.IT | In this paper we compute the Fourier spectrum of the Fractal Interpolation
Functions FIFs as introduced by Michael Barnsley. We show that there is an
analytical way to compute them. In this paper we attempt to solve the inverse
problem of FIF by using the spectrum
|
0906.5286 | Putting Recommendations on the Map -- Visualizing Clusters and Relations | cs.IR | For users, recommendations can sometimes seem odd or counterintuitive.
Visualizing recommendations can remove some of this mystery, showing how a
recommendation is grouped with other choices. A drawing can also lead a user's
eye to other options. Traditional 2D-embeddings of points can be used to create
a basic layou... |
0906.5289 | Green Cellular - Optimizing the Cellular Network for Minimal Emission
from Mobile Stations | cs.IT math.IT | Wireless systems, which include cellular phones, have become an essential
part of the modern life. However the mounting evidence that cellular radiation
might adversely affect the health of its users, leads to a growing concern
among authorities and the general public. Radiating antennas in the proximity
of the user,... |
0906.5325 | Online Reinforcement Learning for Dynamic Multimedia Systems | cs.LG cs.MM | In our previous work, we proposed a systematic cross-layer framework for
dynamic multimedia systems, which allows each layer to make autonomous and
foresighted decisions that maximize the system's long-term performance, while
meeting the application's real-time delay constraints. The proposed solution
solved the cros... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.