id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1006.3021 | A General Framework for Equivalences in Answer-Set Programming by
Countermodels in the Logic of Here-and-There | cs.AI | Different notions of equivalence, such as the prominent notions of strong and
uniform equivalence, have been studied in Answer-Set Programming, mainly for
the purpose of identifying programs that can serve as substitutes without
altering the semantics, for instance in program optimization. Such semantic
comparisons a... |
1006.3033 | Extension of Wirtinger's Calculus to Reproducing Kernel Hilbert Spaces
and the Complex Kernel LMS | cs.LG | Over the last decade, kernel methods for nonlinear processing have
successfully been used in the machine learning community. The primary
mathematical tool employed in these methods is the notion of the Reproducing
Kernel Hilbert Space. However, so far, the emphasis has been on batch
techniques. It is only recently, t... |
1006.3035 | Products of Weighted Logic Programs | cs.AI cs.PL | Weighted logic programming, a generalization of bottom-up logic programming,
is a well-suited framework for specifying dynamic programming algorithms. In
this setting, proofs correspond to the algorithm's output space, such as a path
through a graph or a grammatical derivation, and are given a real-valued score
(ofte... |
1006.3056 | Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian
Mixture Models to Structured Sparsity | cs.CV | A general framework for solving image inverse problems is introduced in this
paper. The approach is based on Gaussian mixture models, estimated via a
computationally efficient MAP-EM algorithm. A dual mathematical interpretation
of the proposed framework with structured sparse estimation is described, which
shows tha... |
1006.3128 | The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in
Compressed Sensing | cs.IT math.IT | Recovery of the sparsity pattern (or support) of an unknown sparse vector
from a limited number of noisy linear measurements is an important problem in
compressed sensing. In the high-dimensional setting, it is known that recovery
with a vanishing fraction of errors is impossible if the measurement rate and
the per-s... |
1006.3151 | Channel Tracking for Relay Networks via Adaptive Particle MCMC | cs.IT math.IT | This paper presents a new approach for channel tracking and parameter
estimation in cooperative wireless relay networks. We consider a system with
multiple relay nodes operating under an amplify and forward relay function. We
develop a novel algorithm to efficiently solve the challenging problem of joint
channel trac... |
1006.3154 | Spectrum Sensing in Cooperative Cognitive Radio Networks with Partial
CSI | cs.IT math.IT | We develop an efficient algorithm for cooperative spectrum sensing in a relay
based cognitive radio network. We consider a stochastic model where data is
sent from the Base Station (BS) of the Primary User (PU). The data is relayed
by the Secondary Users (SU) to the SU BS. The SU BS has only partial CSI
knowledge of ... |
1006.3155 | Blind Spectrum Sensing in Cognitive Radio over Fading Channels and
Frequency Offsets | cs.IT math.IT | This paper deals with the challenging problem of spectrum sensing in
cognitive radio. We consider a stochastic system model where the the Primary
User (PU) transmits a periodic signal over fading channels. The effect of
frequency offsets due to oscillator mismatch, and Doppler offset is studied. We
show that for this... |
1006.3156 | Decoding of Convolutional Codes over the Erasure Channel | cs.IT math.IT | In this paper we study the decoding capabilities of convolutional codes over
the erasure channel. Of special interest will be maximum distance profile (MDP)
convolutional codes. These are codes which have a maximum possible column
distance increase. We show how this strong minimum distance condition of MDP
convolutio... |
1006.3180 | H2O: An Autonomic, Resource-Aware Distributed Database System | cs.DB cs.DC | This paper presents the design of an autonomic, resource-aware distributed
database which enables data to be backed up and shared without complex manual
administration. The database, H2O, is designed to make use of unused resources
on workstation machines. Creating and maintaining highly-available, replicated
databas... |
1006.3215 | Solving Functional Constraints by Variable Substitution | cs.AI cs.LO cs.PL | Functional constraints and bi-functional constraints are an important
constraint class in Constraint Programming (CP) systems, in particular for
Constraint Logic Programming (CLP) systems. CP systems with finite domain
constraints usually employ CSP-based solvers which use local consistency, for
example, arc consiste... |
1006.3222 | MIMO Detection Algorithms for High Data Rate Wireless Transmission | cs.OH cs.IT math.IT | Motivated by MIMO broad-band fading channel model, in this section a
comparative study is presented regarding various uncoded adaptive and
non-adaptive MIMO detection algorithms with respect to BER/PER performance, and
hardware complexity. All the simulations are conducted within MIMO-OFDM
framework and with a packet... |
1006.3271 | The probabilistic analysis of language acquisition: Theoretical,
computational, and experimental analysis | cs.CL physics.data-an q-bio.NC | There is much debate over the degree to which language learning is governed
by innate language-specific biases, or acquired through cognition-general
principles. Here we examine the probabilistic language acquisition hypothesis
on three levels: We outline a novel theoretical result showing that it is
possible to lear... |
1006.3275 | Normalized Information Distance is Not Semicomputable | cs.CC cs.CV physics.data-an | Normalized information distance (NID) uses the theoretical notion of
Kolmogorov complexity, which for practical purposes is approximated by the
length of the compressed version of the file involved, using a real-world
compression program. This practical application is called 'normalized
compression distance' and it i... |
1006.3301 | Codebook-Based SDMA for Coexistence with Fixed Wireless Service | cs.IT cs.NI math.IT | A portion of frequency band for International Mobile Telecommunications
(IMT)-Advanced is currently allocated to Fixed Wireless Service (FWS) such as
Fixed Service (FS), Fixed Satellite Service (FSS), or Fixed Wireless Access
(FWA), which requires frequency sharing between both the systems. SDMA, due to
its high thro... |
1006.3360 | Base station cooperation on the downlink: Large system analysis | cs.IT math.IT | This paper considers maximizing the network-wide minimum supported rate in
the downlink of a two-cell system, where each base station (BS) is endowed with
multiple antennas. This is done for different levels of cell cooperation. At
one extreme, we consider single cell processing where the BS is oblivious to
the inter... |
1006.3385 | A Fixed Precoding Approach to Achieve the Degrees of Freedom in X
channel | cs.IT math.IT | This paper aims to provide a fixed precoding scheme to achieve the Degrees of
Freedom DoF of the generalized ergodic X channel. This is achieved through
using the notion of ergodic interference alignment technique. Accordingly, in
the proposed method the transmitters do not require to know the full channel
state info... |
1006.3403 | Image processing of a spectrogram produced by Spectrometer Airglow
Temperature Imager | physics.comp-ph cs.CV physics.ins-det | The Spectral Airglow Temperature Imager is an instrument, specially designed
for investigation of the wave processes in the Mesosphere-Lower Thermosphere.
In order to determine the kinematics parameters of a wave, the values of a
physical quantity in different space points and their changes in the time
should be know... |
1006.3417 | Fictitious Play with Time-Invariant Frequency Update for Network
Security | cs.GT cs.CR cs.LG | We study two-player security games which can be viewed as sequences of
nonzero-sum matrix games played by an Attacker and a Defender. The evolution of
the game is based on a stochastic fictitious play process, where players do not
have access to each other's payoff matrix. Each has to observe the other's
actions up t... |
1006.3424 | Porting Decision Tree Algorithms to Multicore using FastFlow | cs.DC cs.DB | The whole computer hardware industry embraced multicores. For these machines,
the extreme optimisation of sequential algorithms is no longer sufficient to
squeeze the real machine power, which can be only exploited via thread-level
parallelism. Decision tree algorithms exhibit natural concurrency that makes
them suit... |
1006.3425 | Power law in website ratings | cs.IR cs.IT math.IT physics.soc-ph | In the practical work of websites popularization, analysis of their
efficiency and downloading it is of key importance to take into account
web-ratings data. The main indicators of website traffic include the number of
unique hosts from which the analyzed website was addressed and the number of
granted web pages (hit... |
1006.3448 | Orthogonal Persistence Revisited | cs.PL cs.DB | The social and economic importance of large bodies of programs and data that
are potentially long-lived has attracted much attention in the commercial and
research communities. Here we concentrate on a set of methodologies and
technologies called persistent programming. In particular we review programming
language su... |
1006.3455 | An External Description for MIMO Systems Sampled in an Aperiodic Way | cs.DM cs.IT math.IT | An external description for aperiodically sampled MIMO linear systems has
been developed. Emphasis is on the sampling period sequence, included among the
variables to be handled. The computational procedure is simple and no use of
polynomial matrix theory is required. This input/output description is believed
to be a... |
1006.3468 | Algorithm for Sector Spectra Calculation from Images Registered by the
Spectral Airglow Temperature Imager | physics.data-an cs.CV | The Spectral Airglow Temperature Imager is an instrument, specially designed
for investigation of the wave processes in the Mesosphere-Lower Thermosphere.
In order to determine the kinematic parameters of a wave, the values of a
physical quantity in different space points and their changes in the time
should be known... |
1006.3498 | Fast and accurate annotation of short texts with Wikipedia pages | cs.IR | We address the problem of cross-referencing text fragments with Wikipedia
pages, in a way that synonymy and polysemy issues are resolved accurately and
efficiently. We take inspiration from a recent flow of work [Cucerzan 2007,
Mihalcea and Csomai 2007, Milne and Witten 2008, Chakrabarti et al 2009], and
extend their... |
1006.3506 | Action Recognition in Videos: from Motion Capture Labs to the Web | cs.CV | This paper presents a survey of human action recognition approaches based on
visual data recorded from a single video camera. We propose an organizing
framework which puts in evidence the evolution of the area, with techniques
moving from heavily constrained motion capture scenarios towards more
challenging, realisti... |
1006.3514 | Similarity Search and Locality Sensitive Hashing using TCAMs | cs.DB cs.IR | Similarity search methods are widely used as kernels in various machine
learning applications. Nearest neighbor search (NNS) algorithms are often used
to retrieve similar entries, given a query. While there exist efficient
techniques for exact query lookup using hashing, similarity search using exact
nearest neighbor... |
1006.3520 | Information Distance | cs.IT math.IT math.PR physics.data-an | While Kolmogorov complexity is the accepted absolute measure of information
content in an individual finite object, a similarly absolute notion is needed
for the information distance between two individual objects, for example, two
pictures. We give several natural definitions of a universal information
metric, based... |
1006.3537 | Fastest Distributed Consensus Averaging Problem on Chain of Rhombus
Networks | cs.IT cs.DC cs.DM math.IT | Distributed consensus has appeared as one of the most important and primary
problems in the context of distributed computation and it has received renewed
interest in the field of sensor networks (due to recent advances in wireless
communications), where solving fastest distributed consensus averaging problem
over ne... |
1006.3573 | Nested Polar Codes for Wiretap and Relay Channels | cs.IT math.IT | We show that polar codes asymptotically achieve the whole
capacity-equivocation region for the wiretap channel when the wiretapper's
channel is degraded with respect to the main channel, and the weak secrecy
notion is used. Our coding scheme also achieves the capacity of the physically
degraded receiver-orthogonal re... |
1006.3650 | The Use of Probabilistic Systems to Mimic the Behaviour of Idiotypic AIS
Robot Controllers | cs.AI cs.NE cs.RO | Previous work has shown that robot navigation systems that employ an
architecture based upon the idiotypic network theory of the immune system have
an advantage over control techniques that rely on reinforcement learning only.
This is thought to be a result of intelligent behaviour selection on the part
of the idioty... |
1006.3652 | Modelling Reactive and Proactive Behaviour in Simulation | cs.AI cs.CE cs.MA | This research investigated the simulation model behaviour of a traditional
and combined discrete event as well as agent based simulation models when
modelling human reactive and proactive behaviour in human centric complex
systems. A departmental store was chosen as human centric complex case study
where the operatio... |
1006.3654 | Detecting Anomalous Process Behaviour using Second Generation Artificial
Immune Systems | cs.AI cs.CR cs.NE | Artificial Immune Systems have been successfully applied to a number of
problem domains including fault tolerance and data mining, but have been shown
to scale poorly when applied to computer intrusion detec- tion despite the fact
that the biological immune system is a very effective anomaly detector. This
may be bec... |
1006.3678 | Functional Answer Set Programming | cs.LO cs.AI | In this paper we propose an extension of Answer Set Programming (ASP), and in
particular, of its most general logical counterpart, Quantified Equilibrium
Logic (QEL), to deal with partial functions. Although the treatment of equality
in QEL can be established in different ways, we first analyse the choice of
decidabl... |
1006.3679 | Segmentation of Natural Images by Texture and Boundary Compression | cs.CV cs.IT cs.LG math.IT | We present a novel algorithm for segmentation of natural images that
harnesses the principle of minimum description length (MDL). Our method is
based on observations that a homogeneously textured region of a natural image
can be well modeled by a Gaussian distribution and the region boundary can be
effectively coded ... |
1006.3726 | Diamond Dicing | cs.DB | In OLAP, analysts often select an interesting sample of the data. For
example, an analyst might focus on products bringing revenues of at least 100
000 dollars, or on shops having sales greater than 400 000 dollars. However,
current systems do not allow the application of both of these thresholds
simultaneously, sele... |
1006.3780 | Least Squares Superposition Codes of Moderate Dictionary Size, Reliable
at Rates up to Capacity | cs.IT cs.LG math.IT math.ST stat.TH | For the additive white Gaussian noise channel with average codeword power
constraint, new coding methods are devised in which the codewords are sparse
superpositions, that is, linear combinations of subsets of vectors from a given
design, with the possible messages indexed by the choice of subset. Decoding is
by leas... |
1006.3782 | Near-Optimal Deviation-Proof Medium Access Control Designs in Wireless
Networks | cs.NI cs.IT math.IT | Distributed medium access control (MAC) protocols are essential for the
proliferation of low cost, decentralized wireless local area networks (WLANs).
Most MAC protocols are designed with the presumption that nodes comply with
prescribed rules. However, selfish nodes have natural motives to manipulate
protocols in or... |
1006.3787 | Complete Complementary Results Report of the MARF's NLP Approach to the
DEFT 2010 Competition | cs.CL | This companion paper complements the main DEFT'10 article describing the MARF
approach (arXiv:0905.1235) to the DEFT'10 NLP challenge (described at
http://www.groupes.polymtl.ca/taln2010/deft.php in French). This paper is aimed
to present the complete result sets of all the conducted experiments and their
settings in... |
1006.3855 | Impact of Channel Asymmetry on Performance of Channel Estimation and
Precoding for Downlink Base Station Cooperative Transmission | cs.IT math.IT | Base station (BS) cooperative transmission can improve the spectrum
efficiency of cellular systems, whereas using which the channels will become
asymmetry. In this paper, we study the impact of the asymmetry on the
performance of channel estimation and precoding in downlink BS cooperative
multiple-antenna multiple-ca... |
1006.3870 | Toward Fast Reliable Communication at Rates Near Capacity with Gaussian
Noise | cs.IT cs.LG math.IT math.ST stat.TH | For the additive Gaussian noise channel with average codeword power
constraint, sparse superposition codes and adaptive successive decoding is
developed. Codewords are linear combinations of subsets of vectors, with the
message indexed by the choice of subset. A feasible decoding algorithm is
presented. Communication... |
1006.3959 | Molecular Communication Using Brownian Motion with Drift | physics.bio-ph cond-mat.mes-hall cond-mat.soft cs.IT math.IT | Inspired by biological communication systems, molecular communication has
been proposed as a viable scheme to communicate between nano-sized devices
separated by a very short distance. Here, molecules are released by the
transmitter into the medium, which are then sensed by the receiver. This paper
develops a prelimi... |
1006.4026 | A proof of two conjectures on APN functions | math.NT cs.IT math.IT | Dobbertin, Mills, M\"uller, Pott and Willems conjecture that two families of
power mapping are families of APN functions. Here we prove those two
conjectures.
|
1006.4030 | A Novel VLSI Architecture of Fixed-complexity Sphere Decoder | cs.IT math.IT | Fixed-complexity Sphere Decoder (FSD) is a recently proposed technique for
Multiple-Input Multiple-Output (MIMO) detection. It has several outstanding
features such as constant throughput and large potential parallelism, which
makes it suitable for efficient VLSI implementation. However, to our best
knowledge, no VLS... |
1006.4035 | Towards the Development of a Simulator for Investigating the Impact of
People Management Practices on Retail Performance | cs.AI cs.CE cs.MA | Often models for understanding the impact of management practices on retail
performance are developed under the assumption of stability, equilibrium and
linearity, whereas retail operations are considered in reality to be dynamic,
non-linear and complex. Alternatively, discrete event and agent-based modelling
are app... |
1006.4039 | Distributed Autonomous Online Learning: Regrets and Intrinsic
Privacy-Preserving Properties | cs.LG cs.AI | Online learning has become increasingly popular on handling massive data. The
sequential nature of online learning, however, requires a centralized learner
to store data and update parameters. In this paper, we consider online learning
with {\em distributed} data sources. The autonomous learners update local
paramete... |
1006.4046 | Online Identification and Tracking of Subspaces from Highly Incomplete
Information | cs.IT cs.SY math.IT math.OC stat.ML | This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation),
an efficient online algorithm for tracking subspaces from highly incomplete
observations. GROUSE requires only basic linear algebraic manipulations at each
iteration, and each subspace update can be performed in linear time in the
dimension ... |
1006.4088 | The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular
Value View | cs.IT math.IT | The stability of low-rank matrix reconstruction with respect to noise is
investigated in this paper. The $\ell_*$-constrained minimal singular value
($\ell_*$-CMSV) of the measurement operator is shown to determine the recovery
performance of nuclear norm minimization based algorithms. Compared with the
stability res... |
1006.4114 | How to build a DNA search engine like Google? | q-bio.GN cs.ET cs.IR | This paper proposed a new method to build the large scale DNA sequences
search system based on web search engine technology. We give a very brief
introduction for the methods used in search engine first. Then how to build a
DNA search system like Google is illustrated in detail. Since there is no local
alignment proc... |
1006.4173 | Better size estimation for sparse matrix products | cs.DS cs.DB | We consider the problem of doing fast and reliable estimation of the number
of non-zero entries in a sparse boolean matrix product. This problem has
applications in databases and computer algebra. Let n denote the total number
of non-zero entries in the input matrices. We show how to compute a 1 +-
epsilon approximat... |
1006.4175 | Optimization of Weighted Curvature for Image Segmentation | cs.CV | Minimization of boundary curvature is a classic regularization technique for
image segmentation in the presence of noisy image data. Techniques for
minimizing curvature have historically been derived from descent methods which
could be trapped in a local minimum and therefore required a good
initialization. Recently,... |
1006.4255 | Polar codes for the two-user multiple-access channel | cs.IT math.IT | Arikan's polar coding method is extended to two-user multiple-access
channels. It is shown that if the two users of the channel use the Arikan
construction, the resulting channels will polarize to one of five possible
extremals, on each of which uncoded transmission is optimal. The sum rate
achieved by this coding te... |
1006.4270 | Two-dimensional ranking of Wikipedia articles | cs.IR physics.soc-ph | The Library of Babel, described by Jorge Luis Borges, stores an enormous
amount of information. The Library exists {\it ab aeterno}. Wikipedia, a free
online encyclopaedia, becomes a modern analogue of such a Library. Information
retrieval and ranking of Wikipedia articles become the challenge of modern
society. Whil... |
1006.4330 | Large gaps imputation in remote sensed imagery of the environment | stat.AP cs.CV | Imputation of missing data in large regions of satellite imagery is necessary
when the acquired image has been damaged by shadows due to clouds, or
information gaps produced by sensor failure.
The general approach for imputation of missing data, that could not be
considered missed at random, suggests the use of oth... |
1006.4358 | Combining Channel Output Feedback and CSI Feedback for MIMO Wireless
Systems | cs.IT math.IT | The use of channel output feedback to improve the reliability of fading
channels has received scant attention in the literature. In most work on
feedback for fading channels, only channel state information (CSI) feedback has
been exploited for coding at the transmitter. In this work, the design of a
coding scheme for... |
1006.4386 | Collaborative Relay Beamforming for Secrecy | cs.IT math.IT | In this paper, collaborative use of relays to form a beamforming system and
provide physical-layer security is investigated. In particular,
decode-and-forward (DF) and amplify-and-forward (AF) relay beamforming designs
under total and individual relay power constraints are studied with the goal of
maximizing the secr... |
1006.4425 | On-the-fly Uniformization of Time-Inhomogeneous Infinite Markov
Population Models | math.PR cs.CE cs.NA | This paper presents an on-the-fly uniformization technique for the analysis
of time-inhomogeneous Markov population models. This technique is applicable to
models with infinite state spaces and unbounded rates, which are, for instance,
encountered in the realm of biochemical reaction networks. To deal with the
infini... |
1006.4442 | On the Implementation of the Probabilistic Logic Programming Language
ProbLog | cs.PL cs.LG cs.LO | The past few years have seen a surge of interest in the field of
probabilistic logic learning and statistical relational learning. In this
endeavor, many probabilistic logics have been developed. ProbLog is a recent
probabilistic extension of Prolog motivated by the mining of large biological
networks. In ProbLog, fa... |
1006.4458 | Few Algorithms for ascertaining merit of a document and their
applications | cs.IR | Existing models for ranking documents(mostly in world wide web) are prestige
based. In this article, three algorithms to objectively judge the merit of a
document are proposed - 1) Citation graph maxflow 2) Recursive Gloss Overlap
based intrinsic merit scoring and 3) Interview algorithm. A short discussion on
generic... |
1006.4474 | sTeX+ - a System for Flexible Formalization of Linked Data | cs.SE cs.AI | We present the sTeX+ system, a user-driven advancement of sTeX - a semantic
extension of LaTeX that allows for producing high-quality PDF documents for
(proof)reading and printing, as well as semantic XML/OMDoc documents for the
Web or further processing. Originally sTeX had been created as an invasive,
semantic fron... |
1006.4484 | Interactive Reconciliation with Low-Density Parity-Check Codes | cs.IT math.IT | Efficient information reconciliation is crucial in several scenarios, being
quantum key distribution a remarkable example. However, efficiency is not the
only requirement for determining the quality of the information reconciliation
process. In some of these scenarios we find other relevant parameters such as
the int... |
1006.4509 | Receive Diversity and Ergodic Performance of Interference Alignment on
the MIMO Gaussian Interference Channel | cs.IT math.IT | We consider interference alignment (IA) over K-user Gaussian MIMO
interference channel (MIMO-IC) when the SNR is not asymptotically high. We
introduce a generalization of IA which enables receive diversity inside the
interference-free subspace. We generalize the existence criterion of an IA
solution proposed by Yetis... |
1006.4524 | Fundamental Rate-Reliability-Complexity Limits in Outage Limited MIMO
Communications | cs.IT cs.CC math.IT math.ST stat.TH | The work establishes fundamental limits with respect to rate, reliability and
computational complexity, for a general setting of outage-limited MIMO
communications. In the high-SNR regime, the limits are optimized over all
encoders, all decoders, and all complexity regulating policies. The work then
proceeds to expli... |
1006.4535 | Studies on Relevance, Ranking and Results Display | cs.IR | This study considers the extent to which users with the same query agree as
to what is relevant, and how what is considered relevant may translate into a
retrieval algorithm and results display. To combine user perceptions of
relevance with algorithm rank and to present results, we created a prototype
digital library... |
1006.4540 | A Novel Rough Set Reduct Algorithm for Medical Domain Based on Bee
Colony Optimization | cs.LG cs.AI cs.NE | Feature selection refers to the problem of selecting relevant features which
produce the most predictive outcome. In particular, feature selection task is
involved in datasets containing huge number of features. Rough set theory has
been one of the most successful methods used for feature selection. However,
this met... |
1006.4544 | Human Disease Diagnosis Using a Fuzzy Expert System | cs.AI | Human disease diagnosis is a complicated process and requires high level of
expertise. Any attempt of developing a web-based expert system dealing with
human disease diagnosis has to overcome various difficulties. This paper
describes a project work aiming to develop a web-based fuzzy expert system for
diagnosing hum... |
1006.4551 | Vagueness of Linguistic variable | cs.AI | In the area of computer science focusing on creating machines that can engage
on behaviors that humans consider intelligent. The ability to create
intelligent machines has intrigued humans since ancient times and today with
the advent of the computer and 50 years of research into various programming
techniques, the d... |
1006.4553 | Evolution of Biped Walking Using Neural Oscillators Controller and
Harmony Search Algorithm Optimizer | cs.RO | In this paper, a simple Neural controller has been used to achieve stable
walking in a NAO biped robot, with 22 degrees of freedom that implemented in a
virtual physics-based simulation environment of Robocup soccer simulation
environment. The algorithm uses a Matsuoka base neural oscillator to generate
control signa... |
1006.4561 | An Efficient Technique for Similarity Identification between Ontologies | cs.AI | Ontologies usually suffer from the semantic heterogeneity when simultaneously
used in information sharing, merging, integrating and querying processes.
Therefore, the similarity identification between ontologies being used becomes
a mandatory task for all these processes to handle the problem of semantic
heterogeneit... |
1006.4563 | The State of the Art: Ontology Web-Based Languages: XML Based | cs.AI | Many formal languages have been proposed to express or represent Ontologies,
including RDF, RDFS, DAML+OIL and OWL. Most of these languages are based on XML
syntax, but with various terminologies and expressiveness. Therefore, choosing
a language for building an Ontology is the main step. The main point of
choosing l... |
1006.4567 | Understanding Semantic Web and Ontologies: Theory and Applications | cs.AI | Semantic Web is actually an extension of the current one in that it
represents information more meaningfully for humans and computers alike. It
enables the description of contents and services in machine-readable form, and
enables annotating, discovering, publishing, advertising and composing services
to be automated... |
1006.4568 | Approaches, Challenges and Future Direction of Image Retrieval | cs.IR | This paper attempts to discuss the evolution of the retrieval approaches
focusing on development, challenges and future direction of the image
retrieval. It highlights both the already addressed and outstanding issues. The
explosive growth of image data leads to the need of research and development of
Image Retrieval... |
1006.4588 | Efficient Region-Based Image Querying | cs.CV | Retrieving images from large and varied repositories using visual contents
has been one of major research items, but a challenging task in the image
management community. In this paper we present an efficient approach for
region-based image classification and retrieval using a fast multi-level neural
network model. T... |
1006.4645 | SPOT: An R Package For Automatic and Interactive Tuning of Optimization
Algorithms by Sequential Parameter Optimization | cs.NE cs.AI math.OC stat.AP | The sequential parameter optimization (SPOT) package for R is a toolbox for
tuning and understanding simulation and optimization algorithms. Model-based
investigations are common approaches in simulation and optimization. Sequential
parameter optimization has been developed, because there is a strong need for
sound s... |
1006.4703 | A construction of universal secure network coding | cs.IT cs.CR math.IT | We construct a universal secure network coding. Our construction just
modifies the transmission scheme at the source node and works with every linear
coding at an intermediate node. We relax the security criterion such that the
mutual information between the message and the eavesdropped signal is
sufficiently small i... |
1006.4754 | Active Sites model for the B-Matrix Approach | cs.NE | This paper continues on the work of the B-Matrix approach in hebbian learning
proposed by Dr. Kak. It reports the results on methods of improving the memory
retrieval capacity of the hebbian neural network which implements the B-Matrix
approach. Previously, the approach to retrieving the memories from the network
was... |
1006.4786 | Compressive Direction Finding Based on Amplitude Comparison | cs.IT math.IT | This paper exploits recent developments in compressive sensing (CS) to
efficiently perform the direction finding via amplitude comprarison. The new
method is proposed based on unimodal characteristic of antenna pattern and
sparse property of received data. Unlike the conventional methods based
peak-searching and symm... |
1006.4801 | Noise Invalidation Denoising | stat.ME cs.CV math.ST stat.TH | A denoising technique based on noise invalidation is proposed. The adaptive
approach derives a noise signature from the noise order statistics and utilizes
the signature to denoise the data. The novelty of this approach is in
presenting a general-purpose denoising in the sense that it does not need to
employ any part... |
1006.4804 | The General Solutions of Linear ODE and Riccati Equation | math.CA cs.SY math-ph math.AP math.MP math.OC nlin.SI | This paper gives out the general solutions of variable coefficients ODE and
Riccati equation by way of integral series E(X) and F(X). Such kinds of
integral series are the generalized form of exponential function, and keep the
properties of convergent and reversible.
|
1006.4818 | Stability (over time) of Modified-CS and LS-CS for Recursive Causal
Sparse Reconstruction | cs.IT math.IT stat.ME | In this work, we obtain sufficient conditions for the ``stability" of our
recently proposed algorithms, modified-CS (for noisy measurements) and Least
Squares CS-residual (LS-CS), designed for recursive reconstruction of sparse
signal sequences from noisy measurements. By ``stability" we mean that the
number of misse... |
1006.4832 | MINLIP for the Identification of Monotone Wiener Systems | cs.LG | This paper studies the MINLIP estimator for the identification of Wiener
systems consisting of a sequence of a linear FIR dynamical model, and a
monotonically increasing (or decreasing) static function. Given $T$
observations, this algorithm boils down to solving a convex quadratic program
with $O(T)$ variables and i... |
1006.4833 | A Generic Storage API | cs.DB | We present a generic API suitable for provision of highly generic storage
facilities that can be tailored to produce various individually customised
storage infrastructures. The paper identifies a candidate set of minimal
storage system building blocks, which are sufficiently simple to avoid
encapsulating policy wher... |
1006.4910 | Kalman Filters and Homography: Utilizing the Matrix $A$ | cs.CV | Many problems in Computer Vision can be reduced to either working around a
known transform, or given a model for the transform computing the inverse
problem of the transform itself. We will look at two ways of working with the
matrix $A$ and see how transforms are at the root of image processing and
vision problems.
|
1006.4925 | Simulating information creation in social Semantic Web applications | cs.CE | Appropriate ranking algorithms and incentive mechanisms are essential to the
creation of high-quality information by users of a social network. However,
evaluating such mechanisms in a quantifiable way is a difficult problem.
Studies of live social networks of limited utility, due to the subjective
nature of ranking ... |
1006.4948 | Automatic Music Composition using Answer Set Programming | cs.LO cs.AI | Music composition used to be a pen and paper activity. These these days music
is often composed with the aid of computer software, even to the point where
the computer compose parts of the score autonomously. The composition of most
styles of music is governed by rules. We show that by approaching the
automation, ana... |
1006.4949 | Artificial Immune Systems (2010) | cs.AI cs.MA cs.NE | The human immune system has numerous properties that make it ripe for
exploitation in the computational domain, such as robustness and fault
tolerance, and many different algorithms, collectively termed Artificial Immune
Systems (AIS), have been inspired by it. Two generations of AIS are currently
in use, with the fi... |
1006.4953 | Large scale link based latent Dirichlet allocation for web document
classification | cs.IR | In this paper we demonstrate the applicability of latent Dirichlet allocation
(LDA) for classifying large Web document collections. One of our main results
is a novel influence model that gives a fully generative model of the document
content taking linkage into account. In our setup, topics propagate along links
in ... |
1006.4959 | Open-Ended Evolutionary Robotics: an Information Theoretic Approach | cs.RO | This paper is concerned with designing self-driven fitness functions for
Embedded Evolutionary Robotics. The proposed approach considers the entropy of
the sensori-motor stream generated by the robot controller. This entropy is
computed using unsupervised learning; its maximization, achieved by an on-board
evolutiona... |
1006.4990 | GraphLab: A New Framework for Parallel Machine Learning | cs.LG cs.DC | Designing and implementing efficient, provably correct parallel machine
learning (ML) algorithms is challenging. Existing high-level parallel
abstractions like MapReduce are insufficiently expressive while low-level tools
like MPI and Pthreads leave ML experts repeatedly solving the same design
challenges. By targeti... |
1006.5008 | Detecting Danger: The Dendritic Cell Algorithm | cs.AI cs.CR cs.NE | The Dendritic Cell Algorithm (DCA) is inspired by the function of the
dendritic cells of the human immune system. In nature, dendritic cells are the
intrusion detection agents of the human body, policing the tissue and organs
for potential invaders in the form of pathogens. In this research, and abstract
model of DC ... |
1006.5036 | Performance evaluation for ML sequence detection in ISI channels with
Gauss Markov Noise | cs.IT math.IT | Inter-symbol interference (ISI) channels with data dependent Gauss Markov
noise have been used to model read channels in magnetic recording and other
data storage systems. The Viterbi algorithm can be adapted for performing
maximum likelihood sequence detection in such channels. However, the problem of
finding an ana... |
1006.5040 | The comparison of Wiktionary thesauri transformed into the
machine-readable format | cs.IR | Wiktionary is a unique, peculiar, valuable and original resource for natural
language processing (NLP). The paper describes an open-source Wiktionary
parser: its architecture and requirements followed by a description of
Wiktionary features to be taken into account, some open problems of Wiktionary
and the parser. Th... |
1006.5041 | GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables | cs.AI | Finding the structure of a graphical model has been received much attention
in many fields. Recently, it is reported that the non-Gaussianity of data
enables us to identify the structure of a directed acyclic graph without any
prior knowledge on the structure. In this paper, we propose a novel
non-Gaussianity based a... |
1006.5051 | Fast ABC-Boost for Multi-Class Classification | cs.LG stat.ML | Abc-boost is a new line of boosting algorithms for multi-class
classification, by utilizing the commonly used sum-to-zero constraint. To
implement abc-boost, a base class must be identified at each boosting step.
Prior studies used a very expensive procedure based on exhaustive search for
determining the base class a... |
1006.5059 | Capacity Planning for Vertical Search Engines | cs.IR | Vertical search engines focus on specific slices of content, such as the Web
of a single country or the document collection of a large corporation. Despite
this, like general open web search engines, they are expensive to maintain,
expensive to operate, and hard to design. Because of this, predicting the
response tim... |
1006.5060 | Learning sparse gradients for variable selection and dimension reduction | stat.ML cs.LG stat.ME | Variable selection and dimension reduction are two commonly adopted
approaches for high-dimensional data analysis, but have traditionally been
treated separately. Here we propose an integrated approach, called sparse
gradient learning (SGL), for variable selection and dimension reduction via
learning the gradients of... |
1006.5061 | Optimal Bandwidth and Power Allocation for Sum Ergodic Capacity under
Fading Channels in Cognitive Radio Networks | cs.IT math.IT | This paper studies optimal bandwidth and power allocation in a cognitive
radio network where multiple secondary users (SUs) share the licensed spectrum
of a primary user (PU) under fading channels using the frequency division
multiple access scheme. The sum ergodic capacity of all the SUs is taken as the
performance ... |
1006.5066 | Power Allocation Strategies across N Orthogonal Channels at Both Source
and Relay | cs.IT math.IT | We consider a wireless relay network with one source, one relay and one
destination, where communications between nodes are preformed via N orthogonal
channels. This, for example, is the case when orthogonal frequency division
multiplexing is employed for data communications. Since the power available at
the source a... |
1006.5086 | Split Bregman method for large scale fused Lasso | stat.CO cs.LG math.OC | rdering of regression or classification coefficients occurs in many
real-world applications. Fused Lasso exploits this ordering by explicitly
regularizing the differences between neighboring coefficients through an
$\ell_1$ norm regularizer. However, due to nonseparability and nonsmoothness of
the regularization term... |
1006.5087 | Gaussian Z-Interference Channel with a Relay Link: Achievability Region
and Asymptotic Sum Capacity | cs.IT math.IT | This paper studies a Gaussian Z-interference channel with a rate-limited
digital relay link from one receiver to another. Achievable rate regions are
derived based on a combination of Han-Kobayashi common-private information
splitting technique and several different relay strategies including
compress-and-forward and... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.