id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0912.1016 | Refactoring of a Database | cs.DB | The technique of database refactoring is all about applying disciplined and
controlled techniques to change an existing database schema. The problem is to
successfully create a Database Refactoring Framework for databases. This paper
concentrates on the feasibility of adapting this concept to work as a generic
templa... |
0912.1017 | Genetic Programming Framework for Fingerprint Matching | cs.CR cs.CV cs.MM | A fingerprint matching is a very difficult problem. Minutiae based matching
is the most popular and widely used technique for fingerprint matching. The
minutiae points considered in automatic identification systems are based
normally on termination and bifurcation points. In this paper we propose a new
technique for ... |
0912.1023 | Efficient Relay Beamforming Design with SIC Detection for Dual-Hop MIMO
Relay Networks | cs.NI cs.IT math.IT | In this paper, we consider a dual-hop Multiple Input Multiple Output (MIMO)
relay wireless network, in which a source-destination pair both equipped with
multiple antennas communicates through a large number of half-duplex
amplify-and-forward (AF) relay terminals. Two novel linear beamforming schemes
based on the mat... |
0912.1059 | Reduced Complexity Angle-Doppler-Range Estimation for MIMO Radar That
Employs Compressive Sensing | cs.IT math.IT | The authors recently proposed a MIMO radar system that is implemented by a
small wireless network. By applying compressive sensing (CS) at the receive
nodes, the MIMO radar super-resolution can be achieved with far fewer
observations than conventional approaches. This previous work considered the
estimation of direct... |
0912.1110 | XML Multidimensional Modelling and Querying | cs.DB | As XML becomes ubiquitous and XML storage and processing becomes more
efficient, the range of use cases for these technologies widens daily. One
promising area is the integration of XML and data warehouses, where an
XML-native database stores multidimensional data and processes OLAP queries
written in the XQuery inte... |
0912.1128 | How to Explain Individual Classification Decisions | stat.ML cs.LG | After building a classifier with modern tools of machine learning we
typically have a black box at hand that is able to predict well for unseen
data. Thus, we get an answer to the question what is the most likely label of a
given unseen data point. However, most methods will provide no answer why the
model predicted ... |
0912.1155 | A Learning-Based Approach to Reactive Security | cs.CR cs.GT cs.LG | Despite the conventional wisdom that proactive security is superior to
reactive security, we show that reactive security can be competitive with
proactive security as long as the reactive defender learns from past attacks
instead of myopically overreacting to the last attack. Our game-theoretic model
follows common p... |
0912.1198 | Delay-Optimal Power and Subcarrier Allocation for OFDMA Systems via
Stochastic Approximation | cs.LG | In this paper, we consider delay-optimal power and subcarrier allocation
design for OFDMA systems with $N_F$ subcarriers, $K$ mobiles and one base
station. There are $K$ queues at the base station for the downlink traffic to
the $K$ mobiles with heterogeneous packet arrivals and delay requirements. We
shall model the... |
0912.1216 | Distributive Subband Allocation, Power and Rate Control for
Relay-Assisted OFDMA Cellular System with Imperfect System State Knowledge | cs.NI cs.IT math.IT | In this paper, we consider distributive subband, power and rate allocation
for a two-hop transmission in an orthogonal frequency-division multiple-access
(OFDMA) cellular system with fixed relays which operate in decode-and-forward
strategy. We take into account of system fairness by considering weighted sum
goodput ... |
0912.1224 | The university-industry knowledge relationship: Analyzing patents and
the science base of technologies | cs.DL cs.CY cs.IR physics.soc-ph | Via the Internet, information scientists can obtain cost-free access to large
databases in the hidden or deep web. These databases are often structured far
more than the Internet domains themselves. The patent database of the U.S.
Patent and Trade Office is used in this study to examine the science base of
patents in... |
0912.1294 | Conception d'un outil d'aide \`a l'indexation de ressources
p\'edagogiques - Extraction automatique des th\'ematiques et des mots-clefs
de documents UNIT | cs.IR | Indexing learning documents using the Learning Object Metadata (LOM) is often
carried out manually by archivists. Filling out the LOM fields is a long and
difficult task, requiring a complete reading and a full knowledge on the topic
dealt within the document. In this paper, we present an innovative model and
method ... |
0912.1310 | Automatic creation of urban velocity fields from aerial video | cs.CV | In this paper, we present a system for modelling vehicle motion in an urban
scene from low frame-rate aerial video. In particular, the scene is modelled as
a probability distribution over velocities at every pixel in the image.
We describe the complete system for acquiring this model. The video is
captured from a h... |
0912.1333 | Spectral Efficiency Optimization for an Interfering Cognitive Radio with
Adaptive Modulation and Coding | cs.IT math.IT | In this paper, we consider a primary and a cognitive user transmitting over a
wireless fading interference channel. The primary user transmits with a
constant power and utilizes an adaptive modulation and coding (AMC) scheme
satisfying a bit error rate requirement. We propose a link adaptation scheme to
maximize the ... |
0912.1412 | Topological Properties of an Exponential Random Geometric Graph Process | cs.IT cs.DM math.IT math.PR | In this paper, we consider a one-dimensional random geometric graph process
with the inter-nodal gaps evolving according to an exponential AR(1) process,
which may serve as a mobile wireless network model. The transition probability
matrix and stationary distribution are derived for the Markov chains in terms
of netw... |
0912.1420 | Nonlinear Effects in Stiffness Modeling of Robotic Manipulators | cs.RO | The paper focuses on the enhanced stiffness modeling of robotic manipulators
by taking into account influence of the external force/torque acting upon the
end point. It implements the virtual joint technique that describes the
compliance of manipulator elements by a set of localized six-dimensional
springs separated ... |
0912.1421 | Context and Keyword Extraction in Plain Text Using a Graph
Representation | cs.IR | Document indexation is an essential task achieved by archivists or automatic
indexing tools. To retrieve relevant documents to a query, keywords describing
this document have to be carefully chosen. Archivists have to find out the
right topic of a document before starting to extract the keywords. For an
archivist ind... |
0912.1440 | Comment on "New Results on Frame-Proof Codes and Traceability Schemes" | cs.IT math.IT | In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by
Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no.
7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of
codewords in binary frame-proof codes and decoders in traceability schemes.
There a... |
0912.1534 | Evolutionary multi-stage financial scenario tree generation | cs.NE q-fin.CP q-fin.PM | Multi-stage financial decision optimization under uncertainty depends on a
careful numerical approximation of the underlying stochastic process, which
describes the future returns of the selected assets or asset categories.
Various approaches towards an optimal generation of discrete-time,
discrete-state approximatio... |
0912.1588 | Self-organizing urban transportation systems | nlin.AO cs.MA | Urban transportation is a complex phenomenon. Since many agents are
constantly interacting in parallel, it is difficult to predict the future state
of a transportation system. Because of this, optimization techniques tend to
give obsolete solutions, as the problem changes before it can be optimized. An
alternative li... |
0912.1628 | KF-CS: Compressive Sensing on Kalman Filtered Residual | cs.IT math.IT stat.ME | We consider the problem of recursively reconstructing time sequences of
sparse signals (with unknown and time-varying sparsity patterns) from a limited
number of linear incoherent measurements with additive noise. The idea of our
proposed solution, KF CS-residual (KF-CS) is to replace compressed sensing (CS)
on the o... |
0912.1655 | Maximum-likelihood co-channel interference cancellation with power
control for cellular OFDM networks | cs.IT math.IT | In cellular Orthogonal Frequency Division Multiplexing (OFDM) networks,
Co-Channel Interference (CCI) leads to severe degradation in the BER
performance. To solve this problem, Maximum-Likelihood Estimation (MLE) CCI
cancellation scheme has been proposed in the literature. MLE CCI cancellation
scheme generates weight... |
0912.1658 | On the achievable improvement by the linear minimum mean square error
detector | cs.IT math.IT | Linear minimum mean square error (MMSE) detector has been shown to alleviate
the noise amplification problem, resulting in the conventional zero-forcing
(ZF) detector. In this paper, we analyze the performance improvement by the
MMSE detector in terms of the condition number of its filtering matrix, and in
terms of t... |
0912.1661 | Fixed-complexity vector perturbation with Block diagonalization for
MU-MIMO systems | cs.IT math.IT | Block diagonalization (BD) is an attractive technique that transforms the
multi-user multiple-input multiple-output (MU-MIMO) channel into parallel
single-user MIMO (SU-MIMO) channels with zero inter-user interference (IUI). In
this paper, we combine the BD technique with two deterministic vector
perturbation (VP) al... |
0912.1767 | An evaluation of Flickrs distributed classification system, from the
perspective of its members, and as an image retrieval tool in comparison with
a controlled vocabulary | cs.DL cs.IT math.IT | The profusion of online digital images presents new challenges for image
indexing. Images have always been problematic to describe and catalogue due to
lack of inherent textual data and ambiguity of meaning. An alternative to
time-consuming professionally-applied metadata has been sought in the form of
tags, simple k... |
0912.1768 | Frequency of Occurrence and Information Entropy of American Sign
Language | cs.IT math.IT | American Sign Language (ASL) uses a series of hand based gestures as a
replacement for words to allow the deaf to communicate. Previous work has shown
that although it takes longer to make signs than to say the equivalent words,
on average sentences can be completed in about the same time. This leaves
unresolved, how... |
0912.1790 | A Note on the Injection Distance | cs.IT math.IT | Koetter and Kschischang showed in [R. Koetter and F.R. Kschischang, "Coding
for Errors and Erasures in Random Network Coding," IEEE Trans. Inform. Theory,
{54(8), 2008] that the network coding counterpart of Gabidulin codes performs
asymptotically optimal with respect to the subspace distance. Recently, Silva
and Ksc... |
0912.1815 | Detection of Denial of Service Attacks against Domain Name System Using
Neural Networks | cs.CR cs.NE | In this paper we introduce an intrusion detection system for Denial of
Service (DoS) attacks against Domain Name System (DNS). Our system architecture
consists of two most important parts: a statistical preprocessor and a neural
network classifier. The preprocessor extracts required statistical features in
a shorttim... |
0912.1820 | Parsing of part-of-speech tagged Assamese Texts | cs.CL | A natural language (or ordinary language) is a language that is spoken,
written, or signed by humans for general-purpose communication, as
distinguished from formal languages (such as computer-programming languages or
the "languages" used in the study of formal logic). The computational
activities required for enabli... |
0912.1822 | Association Rule Pruning based on Interestingness Measures with
Clustering | cs.LG | Association rule mining plays vital part in knowledge mining. The difficult
task is discovering knowledge or useful rules from the large number of rules
generated for reduced support. For pruning or grouping rules, several
techniques are used such as rule structure cover methods, informative cover
methods, rule clust... |
0912.1826 | Robust Video Watermarking using Multi-Band Wavelet Transform | cs.IT math.IT | This paper addresses copyright protection as a major security demand in
digital marketplaces. Two watermarking techniques are proposed and compared for
compressed and uncompressed video with the intention to show the advantages and
the possible weaknesses in the schemes working in the frequency domain and in
the spat... |
0912.1828 | Using social annotation and web log to enhance search engine | cs.IR cs.CY | Search services have been developed rapidly in social Internet. It can help
web users easily to find their documents. So that, finding a best method search
is always an imagine. This paper would like introduce hybrid method of
LPageRank algorithm and Social Sim Rank algorithm. LPageRank is the method
using link struc... |
0912.1829 | Document Searching System based on Natural Language Query Processing for
Vietnam Open Courseware Library | cs.IR cs.CL | The necessary of buiding the searching system being able to support users
expressing their searching by natural language queries is very important and
opens the researching direction with many potential. It combines the
traditional methods of information retrieval and the researching of Question
Answering (QA). In th... |
0912.1830 | Gesture Recognition with a Focus on Important Actions by Using a Path
Searching Method in Weighted Graph | cs.CV cs.LG | This paper proposes a method of gesture recognition with a focus on important
actions for distinguishing similar gestures. The method generates a partial
action sequence by using optical flow images, expresses the sequence in the
eigenspace, and checks the feature vector sequence by applying an optimum
path-searching... |
0912.1883 | The Bellman equation for power utility maximization with semimartingales | q-fin.PM cs.SY math.OC math.PR q-fin.CP | We study utility maximization for power utility random fields with and
without intermediate consumption in a general semimartingale model with closed
portfolio constraints. We show that any optimal strategy leads to a solution of
the corresponding Bellman equation. The optimal strategies are described
pointwise in te... |
0912.1909 | MIMO Precoding with X- and Y-Codes | cs.IT math.IT | We consider a time division duplex (TDD) $n_t \times n_r$ multiple-input
multiple-output (MIMO) system with channel state information (CSI) at both the
transmitter and receiver. We propose X- and Y-Codes to achieve high
multiplexing and diversity gains at low complexity. The proposed precoding
schemes are based upon ... |
0912.1987 | Training and Feedback Optimization for Multiuser MIMO Downlink | cs.IT math.IT | We consider a MIMO fading broadcast channel where the fading channel
coefficients are constant over time-frequency blocks that span a coherent time
$\times$ a coherence bandwidth. In closed-loop systems, channel state
information at transmitter (CSIT) is acquired by the downlink training sent by
the base station and ... |
0912.2134 | Enterprise Multi-Branch Database Synchronization with MSMQ | cs.DB cs.NI | When we talk about databases there have always been problems concerning data
synchronization. The latter is a technique for maintaining consistency among
different copies of data (often called replicas). In general, there is no
universal solution to this problem and often a particular situation requires a
particular ... |
0912.2282 | Design of Intelligent layer for flexible querying in databases | cs.DB cs.AI | Computer-based information technologies have been extensively used to help
many organizations, private companies, and academic and education institutions
manage their processes and information systems hereby become their nervous
centre. The explosion of massive data sets created by businesses, science and
governments... |
0912.2302 | Synthesis of supervised classification algorithm using intelligent and
statistical tools | cs.CV cs.LG | A fundamental task in detecting foreground objects in both static and dynamic
scenes is to take the best choice of color system representation and the
efficient technique for background modeling. We propose in this paper a
non-parametric algorithm dedicated to segment and to detect objects in color
images issued from... |
0912.2307 | Rank Based Clustering For Document Retrieval From Biomedical Databases | cs.IR cs.DB | Now a day's, search engines are been most widely used for extracting
information's from various resources throughout the world. Where, majority of
searches lies in the field of biomedical for retrieving related documents from
various biomedical databases. Currently search engines lacks in document
clustering and repr... |
0912.2310 | NeuralNetwork Based 3D Surface Reconstruction | cs.NE | This paper proposes a novel neural-network-based adaptive hybrid-reflectance
three-dimensional (3-D) surface reconstruction model. The neural network
combines the diffuse and specular components into a hybrid model. The proposed
model considers the characteristics of each point and the variant albedo to
prevent the r... |
0912.2311 | VirusPKT: A Search Tool For Assimilating Assorted Acquaintance For
Viruses | cs.IR q-bio.OT | Viruses utilize various means to circumvent the immune detection in the
biological systems. Several mathematical models have been investigated for the
description of viral dynamics in the biological system of human and various
other species. One common strategy for evasion and recognition of viruses is,
through acqua... |
0912.2314 | Early Detection of Breast Cancer using SVM Classifier Technique | cs.LG | This paper presents a tumor detection algorithm from mammogram. The proposed
system focuses on the solution of two problems. One is how to detect tumors as
suspicious regions with a very weak contrast to their background and another is
how to extract features which categorize tumors. The tumor detection method
follow... |
0912.2316 | Heart Rate Variability Analysis Using Threshold of Wavelet Package
Coefficients | cs.CV physics.data-an physics.med-ph | In this paper, a new efficient feature extraction method based on the
adaptive threshold of wavelet package coefficients is presented. This paper
especially deals with the assessment of autonomic nervous system using the
background variation of the signal Heart Rate Variability HRV extracted from
the wavelet package ... |
0912.2378 | Limited Feedback for Temporally Correlated MIMO Channels with Other Cell
Interference | cs.IT math.IT | Limited feedback improves link reliability with a small amount of feedback
from the receiver back to the transmitter. In cellular systems, the performance
of limited feedback will be degraded in the presence of other cell
interference, when the base stations have limited or no coordination. This
paper establishes the... |
0912.2381 | LAGOVirtual: A Collaborative Environment for the Large Aperture GRB
Observatory | cs.CE astro-ph.HE astro-ph.IM hep-ex | We present the LAGOVirtual Project: an ongoing project to develop platform to
collaborate in the Large Aperture GRB Observatory (LAGO). This continental-wide
observatory is devised to detect high energy (around 100 GeV) component of
Gamma Ray Bursts, by using the single particle technique in arrays of Water
Cherenkov... |
0912.2385 | Closing the Learning-Planning Loop with Predictive State Representations | cs.LG cs.AI | A central problem in artificial intelligence is that of planning to maximize
future reward under uncertainty in a partially observable environment. In this
paper we propose and demonstrate a novel algorithm which accurately learns a
model of such an environment directly from sequences of action-observation
pairs. We ... |
0912.2404 | Succinct Coverage Oracles | cs.DS cs.DB | In this paper, we identify a fundamental algorithmic problem that we term
succinct dynamic covering (SDC), arising in many modern-day web applications,
including ad-serving and online recommendation systems in eBay and Netflix.
Roughly speaking, SDC applies two restrictions to the well-studied Max-Coverage
problem: G... |
0912.2415 | Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms | cs.NE cs.AI | The art of solving the Mastermind puzzle was initiated by Donald Knuth and is
already more than 30 years old; despite that, it still receives much attention
in operational research and computer games journals, not to mention the
nature-inspired stochastic algorithm literature. In this paper we try to
suggest a strate... |
0912.2425 | Consensus and synchronization in discrete-time networks of multi-agents
with stochastically switching topologies and time delays | math.DS cs.SY math.OC | We analyze stability of consensus algorithms in networks of multi-agents with
time-varying topologies and delays. The topology and delays are modeled as
induced by an adapted process and are rather general, including i.i.d.\
topology processes, asynchronous consensus algorithms, and Markovian jumping
switching. In ca... |
0912.2492 | Learning an Interactive Segmentation System | stat.ML cs.CV stat.ME | Many successful applications of computer vision to image or video
manipulation are interactive by nature. However, parameters of such systems are
often trained neglecting the user. Traditionally, interactive systems have been
treated in the same manner as their fully automatic counterparts. Their
performance is evalu... |
0912.2548 | Towards Utility-driven Anonymization of Transactions | cs.DB cs.CR | Publishing person-specific transactions in an anonymous form is increasingly
required by organizations. Recent approaches ensure that potentially
identifying information (e.g., a set of diagnosis codes) cannot be used to link
published transactions to persons' identities, but all are limited in
application because th... |
0912.2551 | Efficient Parallel Statistical Model Checking of Biochemical Networks | cs.CE cs.DC cs.LO q-bio.QM | We consider the problem of verifying stochastic models of biochemical
networks against behavioral properties expressed in temporal logic terms. Exact
probabilistic verification approaches such as, for example, CSL/PCTL model
checking, are undermined by a huge computational demand which rule them out for
most real cas... |
0912.2563 | A Model-Based Approach to Predicting Predator-Prey & Friend-Foe
Relationships in Ant Colonies | cs.AI cs.CV q-bio.PE | Understanding predator-prey relationships among insects is a challenging task
in the domain of insect-colony research. This is due to several factors
involved, such as determining whether a particular behavior is the result of a
predator-prey interaction, a friend-foe interaction or another kind of
interaction. In th... |
0912.2630 | Transmission Capacity of Ad-hoc Networks with Multiple Antennas using
Transmit Stream Adaptation and Interference Cancelation | cs.IT math.IT | The transmission capacity of an ad-hoc network is the maximum density of
active transmitters per unit area, given an outage constraint at each receiver
for a fixed rate of transmission. Assuming that the transmitter locations are
distributed as a Poisson point process, this paper derives upper and lower
bounds on the... |
0912.2709 | The Gaussian Surface Area and Noise Sensitivity of Degree-$d$
Polynomials | cs.CC cs.LG | We provide asymptotically sharp bounds for the Gaussian surface area and the
Gaussian noise sensitivity of polynomial threshold functions. In particular we
show that if $f$ is a degree-$d$ polynomial threshold function, then its
Gaussian sensitivity at noise rate $\epsilon$ is less than some quantity
asymptotic to $\... |
0912.2737 | An Extreme form of Superactivation for Quantum Zero-Error Capacities | quant-ph cs.IT math.IT | The zero-error capacity of a channel is the rate at which it can send
information perfectly, with zero probability of error, and has long been
studied in classical information theory. We show that the zero-error capacity
of quantum channels exhibits an extreme form of non-additivity, one which is
not possible for cla... |
0912.2820 | Network Coding for Computing: Cut-Set Bounds | cs.IT math.IT | The following \textit{network computing} problem is considered. Source nodes
in a directed acyclic network generate independent messages and a single
receiver node computes a target function $f$ of the messages. The objective is
to maximize the average number of times $f$ can be computed per network usage,
i.e., the ... |
0912.2822 | Data management in Systems biology II - Outlook towards the semantic web | cs.DB q-bio.OT | The benefit of using ontologies, defined by the respective data standards, is
shown. It is presented how ontologies can be used for the semantic enrichment
of data and how this can contribute to the vision of the semantic web to become
true. The problems existing today on the way to a true semantic web are
pinpointed... |
0912.2826 | An iterative approach for generating statistically realistic populations
of households | cs.MA cs.CY | Background: Many different simulation frameworks, in different topics, need
to treat realistic datasets to initialize and calibrate the system. A precise
reproduction of initial states is extremely important to obtain reliable
forecast from the model. Methodology/Principal Findings: This paper proposes an
algorithm t... |
0912.2828 | Pulse Shaping, Localization and the Approximate Eigenstructure of LTV
Channels | cs.IT math.IT | In this article we show the relation between the theory of pulse shaping for
WSSUS channels and the notion of approximate eigenstructure for time-varying
channels. We consider pulse shaping for a general signaling scheme, called
Weyl-Heisenberg signaling, which includes OFDM with cyclic prefix and
OFDM/OQAM. The puls... |
0912.2843 | Intrusion Detection In Mobile Ad Hoc Networks Using GA Based Feature
Selection | cs.NE cs.CR cs.LG | Mobile ad hoc networking (MANET) has become an exciting and important
technology in recent years because of the rapid proliferation of wireless
devices. MANETs are highly vulnerable to attacks due to the open medium,
dynamically changing network topology and lack of centralized monitoring point.
It is important to se... |
0912.2846 | Multi-valued Action Languages in CLP(FD) | cs.AI cs.LO cs.PL | Action description languages, such as A and B, are expressive instruments
introduced for formalizing planning domains and planning problem instances. The
paper starts by proposing a methodology to encode an action language (with
conditional effects and static causal laws), a slight variation of B, using
Constraint Lo... |
0912.2881 | Representing human and machine dictionaries in Markup languages | cs.CL | In this chapter we present the main issues in representing machine readable
dictionaries in XML, and in particular according to the Text Encoding
Dictionary (TEI) guidelines.
|
0912.3029 | Interference Alignment and a Noisy Interference Regime for Many-to-One
Interference Channels | cs.IT math.IT | We study the capacity of discrete memoryless many-to-one interference
channels, i.e., K user interference channels where only one receiver faces
interference. For a class of many-to-one interference channels, we identify a
noisy interference regime, i.e., a regime where random coding and treating
interference as nois... |
0912.3036 | Proceedings 8th International Workshop on Parallel and Distributed
Methods in verifiCation | cs.LO cs.CE cs.DC cs.SE | The 8th International Workshop on Parallel and Distributed Methods in
verifiCation (PDMC 2009) took place on November 4, 2009 at the Eindhoven
University of Technology, in conjunction with Formal Methods 2009 and other
related events for the first time under the heading of Formal Methods Week.
This volume contains th... |
0912.3067 | A Recursive Formula for Power Moments of 2-Dimensional Kloosterman Sums
Assiciated with General Linear Groups | math.NT cs.IT math.IT | In this paper, we construct a binary linear code connected with the
Kloosterman sum for $GL(2,q)$. Here $q$ is a power of two. Then we obtain a
recursive formula generating the power moments 2-dimensional Kloosterman sum,
equivalently that generating the even power moments of Kloosterman sum in terms
of the frequenci... |
0912.3134 | Complexity of Propositional Abduction for Restricted Sets of Boolean
Functions | cs.CC cs.AI cs.LO | Abduction is a fundamental and important form of non-monotonic reasoning.
Given a knowledge base explaining how the world behaves it aims at finding an
explanation for some observed manifestation. In this paper we focus on
propositional abduction, where the knowledge base and the manifestation are
represented by prop... |
0912.3228 | On Backtracking in Real-time Heuristic Search | cs.AI | Real-time heuristic search algorithms are suitable for situated agents that
need to make their decisions in constant time. Since the original work by Korf
nearly two decades ago, numerous extensions have been suggested. One of the
most intriguing extensions is the idea of backtracking wherein the agent
decides to ret... |
0912.3245 | Structured Error Recovery for Codeword-Stabilized Quantum Codes | quant-ph cs.IT math.IT | Codeword stabilized (CWS) codes are, in general, non-additive quantum codes
that can correct errors by an exhaustive search of different error patterns,
similar to the way that we decode classical non-linear codes. For an n-qubit
quantum code correcting errors on up to t qubits, this brute-force approach
consecutivel... |
0912.3264 | Random Access: An Information-Theoretic Perspective | cs.IT math.IT | This paper considers a random access system where each sender can be in two
modes of operation, active or not active, and where the set of active users is
available to a common receiver only. Active transmitters encode data into
independent streams of information, a subset of which are decoded by the
receiver, depend... |
0912.3275 | A Formal Framework for Mobile Robot Patrolling in Arbitrary Environments
with Adversaries | cs.GT cs.MA | Using mobile robots for autonomous patrolling of environments to prevent
intrusions is a topic of increasing practical relevance. One of the most
challenging scientific issues is the problem of finding effective patrolling
strategies that, at each time point, determine the next moves of the patrollers
in order to max... |
0912.3309 | New Generalization Bounds for Learning Kernels | cs.AI | This paper presents several novel generalization bounds for the problem of
learning kernels based on the analysis of the Rademacher complexity of the
corresponding hypothesis sets. Our bound for learning kernels with a convex
combination of p base kernels has only a log(p) dependency on the number of
kernels, p, whic... |
0912.3323 | Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power
Allocations | cs.IT math.IT | In the multiuser downlink, power allocation for linear precoders that
minimize the sum of mean squared errors under a sum power constraint is a
non-convex problem. Many existing algorithms solve an equivalent convex problem
in the virtual uplink and apply a transformation based on uplink-downlink
duality to find a do... |
0912.3419 | Application Driven Joint Uplink-Downlink Optimization in Wireless
Communications | cs.IT math.IT | This paper introduces a new mathematical framework, which is used to derive
joint uplink/downlink achievable rate regions for multi-user spatial
multiplexing between one base station and multiple terminals. The framework
consists of two models: the first one is a simple transmission model for uplink
and downlink, whi... |
0912.3441 | On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks | cs.NI cs.IT math.IT | We investigate the fundamental capacity limits of space-time journeys of
information in mobile and Delay Tolerant Networks (DTNs), where information is
either transmitted or carried by mobile nodes, using store-carry-forward
routing. We define the capacity of a journey (i.e., a path in space and time,
from a source t... |
0912.3461 | Application of Graph Coloring to Biological Networks | cs.CE q-bio.QM | We explore the application of graph coloring to biological networks,
specifically protein-protein interaction (PPI) networks. First, we find that
given similar conditions (i.e. number of nodes, number of links, degree
distribution and clustering), fewer colors are needed to color disassortative
(high degree nodes ten... |
0912.3503 | Absolutely Secure Communications by Johnson-like Noise and Kirchhoff's
Laws | physics.gen-ph cond-mat.stat-mech cs.IT math.IT quant-ph | We survey the most important results and some recent developments about the
secure key exchange protocol where the security is based on the Second Law of
Thermodynamics and the robustness of classical physical information. We
conclude that a classical physical system offers a higher level of control and
security duri... |
0912.3541 | Spectrum Sharing as Network Congestion Games | cs.IT cs.GT math.IT math.OC | This paper has been withdrawn by the first author due to incomplete
bibliography and incorporation of multiple formats in the same file.
|
0912.3589 | Matching 2-D Ellipses to 3-D Circles with Application to Vehicle Pose
Estimation | cs.CV | Finding the three-dimensional representation of all or a part of a scene from
a single two dimensional image is a challenging task. In this paper we propose
a method for identifying the pose and location of objects with circular
protrusions in three dimensions from a single image and a 3d representation or
model of t... |
0912.3599 | Robust Principal Component Analysis? | cs.IT math.IT | This paper is about a curious phenomenon. Suppose we have a data matrix,
which is the superposition of a low-rank component and a sparse component. Can
we recover each component individually? We prove that under some suitable
assumptions, it is possible to recover both the low-rank and the sparse
components exactly b... |
0912.3747 | A Survey of Paraphrasing and Textual Entailment Methods | cs.CL cs.AI | Paraphrasing methods recognize, generate, or extract phrases, sentences, or
longer natural language expressions that convey almost the same information.
Textual entailment methods, on the other hand, recognize, generate, or extract
pairs of natural language expressions, such that a human who reads (and trusts)
the fi... |
0912.3848 | Wavelets on Graphs via Spectral Graph Theory | math.FA cs.IT math.IT | We propose a novel method for constructing wavelet transforms of functions
defined on the vertices of an arbitrary finite weighted graph. Our approach is
based on defining scaling using the the graph analogue of the Fourier domain,
namely the spectral decomposition of the discrete graph Laplacian $\L$. Given a
wavele... |
0912.3882 | Science overlay maps: a new tool for research policy and library
management | cs.DL cs.IR physics.soc-ph | We present a novel approach to visually locate bodies of research within the
sciences, both at each moment of time and dynamically. This article describes
how this approach fits with other efforts to locally and globally map
scientific outputs. We then show how these science overlay maps help benchmark,
explore colla... |
0912.3907 | Efficient Linear Programming Decoding of HDPC Codes | cs.IT math.IT | We propose several improvements for Linear Programming (LP) decoding
algorithms for High Density Parity Check (HDPC) codes. First, we use the
automorphism groups of a code to create parity check matrix diversity and to
generate valid cuts from redundant parity checks. Second, we propose an
efficient mixed integer dec... |
0912.3917 | Speech Recognition Oriented Vowel Classification Using Temporal Radial
Basis Functions | cs.CL cs.MM | The recent resurgence of interest in spatio-temporal neural network as speech
recognition tool motivates the present investigation. In this paper an approach
was developed based on temporal radial basis function "TRBF" looking to many
advantages: few parameters, speed convergence and time invariance. This
application... |
0912.3924 | A Study on Feature Selection Techniques in Educational Data Mining | cs.DB | Educational data mining (EDM) is a new growing research area and the essence
of data mining concepts are used in the educational field for the purpose of
extracting useful information on the behaviors of students in the learning
process. In this EDM, feature selection is to be made for the generation of
subset of can... |
0912.3956 | Modeling and Application of Series Elastic Actuators for Force Control
Multi Legged Robots | cs.RO | Series Elastic Actuators provide many benefits in force control of robots in
unconstrained environments. These benefits include high force fidelity,
extremely low impedance, low friction, and good force control bandwidth. Series
Elastic Actuators employ a novel mechanical design architecture which goes
against the co... |
0912.3957 | Realization of Semantic Atom Blog | cs.IR | Web blog is used as a collaborative platform to publish and share
information. The information accumulated in the blog intrinsically contains the
knowledge. The knowledge shared by the community of people has intangible value
proposition. The blog is viewed as a multimedia information resource available
on the Intern... |
0912.3960 | Optimal Design of Fuzzy Based Power System Stabilizer Self Tuned by
Robust Search Algorithm | cs.NE | In the interconnected power system network, instability problems are caused
mainly by the low frequency oscillations of 0.2 to 2.5 Hz. The supplementary
control signal in addition with AVR and high gain excitation systems are
provided by means of Power System Stabilizer (PSS). Conventional power system
stabilizers pr... |
0912.3961 | Enhancing Multi-Agent Based Simulation with Human-Agents Interactive
Spatial Behaviour | cs.MA | We are exploring the enhancement of models of agent behaviour with more
"human-like" decision making strategies than are presently available. Our
motivation is to developed with a view to as the decision analysis and support
for electric taxi company under the mission of energy saving and reduction of
CO2, in particu... |
0912.3964 | A Novel Channel Coding for Progressive Transmission of Medical Images | cs.IT math.IT | A novel channel coding scheme for progressive transmission of large images is
proposed. The transmission time, low distortion reconstructed image and low
complexity are most concerned in this paper. In the case of medical data
transmission, it is vital to keep the distortion level under control as in most
of the case... |
0912.3973 | A Novel Feature Extraction for Robust EMG Pattern Recognition | cs.CV | Varieties of noises are major problem in recognition of Electromyography
(EMG) signal. Hence, methods to remove noise become most significant in EMG
signal analysis. White Gaussian noise (WGN) is used to represent interference
in this paper. Generally, WGN is difficult to be removed using typical
filtering and soluti... |
0912.3978 | Diversity-Multiplexing Tradeoff in Multi-Antenna Multi-Relay Networks:
Improvements and Some Optimality Results | cs.IT math.IT | This paper investigates the benefits of Amplify-and-Forward (AF) relaying in
the setup of multi-antenna wireless networks. The concept of Random Sequential
(RS) relaying is previously introduced in the literature and showed that it
achieves the maximum diversity gain in a general multi-antenna network. Here,
we show ... |
0912.3981 | Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna
Relay Networks | cs.IT math.IT | This paper studies the general multi-antenna multiple-relay network. Every
two nodes of the network are either connected together through a Rayleigh
fading channel or disconnected. We study the ergodic capacity of the network in
the high SNR regime. We prove that the traditional amplify-forward relaying
achieves the ... |
0912.3983 | Performance Analysis of AIM-K-means & K-means in Quality Cluster
Generation | cs.LG | Among all the partition based clustering algorithms K-means is the most
popular and well known method. It generally shows impressive results even in
considerably large data sets. The computational complexity of K-means does not
suffer from the size of the data set. The main disadvantage faced in performing
this clust... |
0912.3984 | Multi-Agent Model using Secure Multi-Party Computing in e-Governance | cs.MA | Information management and retrieval of all the citizen occurs in almost all
the public service functions. Electronic Government system is an emerging trend
in India through which efforts are made to strive maximum safety and security.
Various solutions for this have been proposed like Shibboleth, Public Key
Infrastr... |
0912.3995 | Gaussian Process Optimization in the Bandit Setting: No Regret and
Experimental Design | cs.LG | Many applications require optimizing an unknown, noisy function that is
expensive to evaluate. We formalize this task as a multi-armed bandit problem,
where the payoff function is either sampled from a Gaussian process (GP) or has
low RKHS norm. We resolve the important open problem of deriving regret bounds
for this... |
0912.4012 | Balancing Traffic in Networks: Redundancy, Learning and the Effect of
Stochastic Fluctuations | math.PR cs.GT cs.IT cs.NI math.IT | We study the distribution of traffic in networks whose users try to minimise
their delays by adhering to a simple learning scheme inspired by the replicator
dynamics of evolutionary game theory. The stable steady states of these
dynamics coincide with the network's Wardrop equilibria and form a convex
polytope whose ... |
0912.4107 | New [48,16,16] Optimal Linear Binary Block Code | cs.IT math.IT | A new [48,16,16] optimal linear binary block code is given. To get this code
a general construction is used which is also described in this paper. The
construction of this new code settles an conjecture mentioned in a 2008 paper
by Janosov et al. where the authors found an new optimal [47,15,16]-code, which
is releva... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.