id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1003.2259 | Bit Allocation Laws for Multi-Antenna Channel Feedback Quantization:
Multi-User Case | cs.IT math.IT | This paper addresses the optimal design of limited-feedback downlink
multi-user spatial multiplexing systems. A multiple-antenna base-station is
assumed to serve multiple single-antenna users, who quantize and feed back
their channel state information (CSI) through a shared rate-limited feedback
channel. The optimiza... |
1003.2372 | On Ergodic Secrecy Capacity for Gaussian MISO Wiretap Channels | cs.IT math.IT | A Gaussian multiple-input single-output (MISO) wiretap channel model is
considered, where there exists a transmitter equipped with multiple antennas, a
legitimate receiver and an eavesdropper each equipped with a single antenna. We
study the problem of finding the optimal input covariance that achieves ergodic
secrec... |
1003.2429 | Predicting Positive and Negative Links in Online Social Networks | physics.soc-ph cs.AI cs.CY | We study online social networks in which relationships can be either positive
(indicating relations such as friendship) or negative (indicating relations
such as opposition or antagonism). Such a mix of positive and negative links
arise in a variety of online settings; we study datasets from Epinions,
Slashdot and Wi... |
1003.2454 | Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels | cs.IT math.IT | An irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with
some randomly \emph{punctured} output-bits. It is shown that the LDGM-LDPC
codes achieve rates arbitrarily close to the channel-capacity of the
binary-input symmetric-output memoryless (BISOM) channel with bounded
\emph{complexity}. The measure... |
1003.2458 | Revisiting the Examination Hypothesis with Query Specific Position Bias | cs.IR | Click through rates (CTR) offer useful user feedback that can be used to
infer the relevance of search results for queries. However it is not very
meaningful to look at the raw click through rate of a search result because the
likelihood of a result being clicked depends not only on its relevance but also
the positio... |
1003.2471 | Structure-Aware Stochastic Control for Transmission Scheduling | cs.LG cs.IT cs.MM math.IT | In this paper, we consider the problem of real-time transmission scheduling
over time-varying channels. We first formulate the transmission scheduling
problem as a Markov decision process (MDP) and systematically unravel the
structural properties (e.g. concavity in the state-value function and
monotonicity in the opt... |
1003.2586 | Inductive Logic Programming in Databases: from Datalog to DL+log | cs.LO cs.AI cs.DB cs.LG | In this paper we address an issue that has been brought to the attention of
the database community with the advent of the Semantic Web, i.e. the issue of
how ontologies (and semantics conveyed by them) can help solving typical
database problems, through a better understanding of KR aspects related to
databases. In pa... |
1003.2606 | Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs | cs.IT math.IT | For a family/sequence of STBCs $\mathcal{C}_1,\mathcal{C}_2,\dots$, with
increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols
per channel use (cspcu), the asymptotic normalized rate is defined as $\lim_{i
\to \infty}{\frac{R_i}{N_i}}$. A family of STBCs is said to be
asymptotically-good if t... |
1003.2641 | Release ZERO.0.1 of package RefereeToolbox | cs.AI | RefereeToolbox is a java package implementing combination operators for
fusing evidences. It is downloadable from:
http://refereefunction.fredericdambreville.com/releases RefereeToolbox is based
on an interpretation of the fusion rules by means of Referee Functions. This
approach implies a dissociation between the de... |
1003.2675 | Exploiting Channel Memory for Multi-User Wireless Scheduling without
Channel Measurement: Capacity Regions and Algorithms | cs.IT cs.NI math.DS math.IT math.OC | We study the fundamental network capacity of a multi-user wireless downlink
under two assumptions: (1) Channels are not explicitly measured and thus
instantaneous states are unknown, (2) Channels are modeled as ON/OFF Markov
chains. This is an important network model to explore because channel probing
may be costly o... |
1003.2677 | Classified Ads Harvesting Agent and Notification System | cs.IR | The shift from an information society to a knowledge society require rapid
information harvesting, reliable search and instantaneous on demand delivery.
Information extraction agents are used to explore and collect data available
from Web, in order to effectively exploit such data for business purposes, such
as autom... |
1003.2681 | A Systematic Framework for the Construction of Optimal Complete
Complementary Codes | cs.IT math.IT | The complete complementary code (CCC) is a sequence family with ideal
correlation sums which was proposed by Suehiro and Hatori. Numerous literatures
show its applications to direct-spread code-division multiple access (DS-CDMA)
systems for inter-channel interference (ICI)-free communication with improved
spectral ef... |
1003.2682 | Table manipulation in simplicial databases | cs.DB cs.IR | In \cite{Spi}, we developed a category of databases in which the schema of a
database is represented as a simplicial set. Each simplex corresponds to a
table in the database. There, our main concern was to find a categorical
formulation of databases; the simplicial nature of the schemas was to some
degree unexpected ... |
1003.2700 | The role of semantics in mining frequent patterns from knowledge bases
in description logics with rules | cs.LO cs.AI | We propose a new method for mining frequent patterns in a language that
combines both Semantic Web ontologies and rules. In particular we consider the
setting of using a language that combines description logics with DL-safe
rules. This setting is important for the practical application of data mining
to the Semantic... |
1003.2724 | Particle Swarm Optimization Based Diophantine Equation Solver | cs.NE cs.NA | The paper introduces particle swarm optimization as a viable strategy to find
numerical solution of Diophantine equation, for which there exists no general
method of finding solutions. The proposed methodology uses a population of
integer particles. The candidate solutions in the feasible space are optimized
to have ... |
1003.2749 | Efficient Queue-based CSMA with Collisions | cs.IT cs.NI math.IT math.PR | Recently there has been considerable interest in the design of efficient
carrier sense multiple access(CSMA) protocol for wireless network. The basic
assumption underlying recent results is availability of perfect carrier sense
information. This allows for design of continuous time algorithm under which
collisions ar... |
1003.2751 | Near-Optimal Evasion of Convex-Inducing Classifiers | cs.LG cs.CR | Classifiers are often used to detect miscreant activities. We study how an
adversary can efficiently query a classifier to elicit information that allows
the adversary to evade detection at near-minimal cost. We generalize results of
Lowd and Meek (2005) to convex-inducing classifiers. We present algorithms that
cons... |
1003.2760 | On the monotonicity, log-concavity and tight bounds of the generalized
Marcum and Nuttall Q-functions | cs.IT math.IT math.PR | In this paper, we present a comprehensive study of the monotonicity and
log-concavity of the generalized Marcum and Nuttall Q-functions. More
precisely, a simple probabilistic method is firstly given to prove the
monotonicity of these two functions. Then, the log-concavity of the generalized
Marcum Q-function and its... |
1003.2782 | Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit
Antenna Systems | cs.IT math.IT | For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$
system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} =
min(n_t,n_r)$ complex symbols per channel use and in general, has an
ML-decoding complexity of the order of $M^{n_tn_{min}}$ (considering square
designs), where $M$ is th... |
1003.2822 | Innovation Rate Sampling of Pulse Streams with Application to Ultrasound
Imaging | cs.IT math.IT | Signals comprised of a stream of short pulses appear in many applications
including bio-imaging and radar. The recent finite rate of innovation
framework, has paved the way to low rate sampling of such pulses by noticing
that only a small number of parameters per unit time are needed to fully
describe these signals. ... |
1003.2836 | Fishing in Poisson streams: focusing on the whales, ignoring the minnows | cs.IT math.IT | This paper describes a low-complexity approach for reconstructing average
packet arrival rates and instantaneous packet counts at a router in a
communication network, where the arrivals of packets in each flow follow a
Poisson process. Assuming that the rate vector of this Poisson process is
sparse or approximately s... |
1003.2880 | Regularized sampling of multiband signals | cs.IT math.IT | This paper presents a regularized sampling method for multiband signals, that
makes it possible to approach the Landau limit, while keeping the sensitivity
to noise at a low level. The method is based on band-limited windowing,
followed by trigonometric approximation in consecutive time intervals. The key
point is th... |
1003.2883 | Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular
Networks | cs.IT math.IT | In this paper, we propose a resource allocation algorithm for the downlink of
sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical
Channel State Information (CSI) and fractional frequency reuse. The proposed
algorithm can be implemented in a distributed fashion without the need to any
central... |
1003.2914 | High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov
Processes | cs.IT math.IT | This paper investigates the decentralized detection of Hidden Markov
Processes using the Neyman-Pearson test. We consider a network formed by a
large number of distributed sensors. Sensors' observations are noisy snapshots
of a Markov process to be detected. Each (real) observation is quantized on
log2(N) bits before... |
1003.2941 | Universal Regularizers For Robust Sparse Coding and Modeling | cs.IT math.IT stat.ML | Sparse data models, where data is assumed to be well represented as a linear
combination of a few elements from a dictionary, have gained considerable
attention in recent years, and their use has led to state-of-the-art results in
many signal and image processing tasks. It is now well understood that the
choice of th... |
1003.3056 | Spatial multiplexing with MMSE receivers: Single-stream optimality in ad
hoc networks | cs.IT math.IT | The performance of spatial multiplexing systems with linear
minimum-mean-squared-error receivers is investigated in ad hoc networks. It is
shown that single-stream transmission is preferable over multi-stream
transmission, due to the weaker interference powers from the strongest
interferers remaining after interferen... |
1003.3080 | An Algorithm for Index Multimedia Data (Video) using the Movement
Oriented Method for Real-time Online Services | cs.MM cs.IR | Multimedia data is a form of data that can represent all types of data
(images, sound and text). The use of multimedia data for the online application
requires a more comprehensive database in the use of storage media, Sorting /
indexing, search and system / data searching. This is necessary in order to
help provider... |
1003.3082 | Agreement Maintenance Based on Schema and Ontology Change in P2P
Environment | cs.AI cs.DB | This paper is concern about developing a semantic agreement maintenance
method based on semantic distance by calculating the change of local schema or
ontology. This approach is important in dynamic and autonomous environment, in
which the current approach assumed that agreement or mapping in static
environment. The ... |
1003.3131 | Strategic Cooperation in Cost Sharing Games | cs.GT cs.DS cs.MA | In this paper we consider strategic cost sharing games with so-called
arbitrary sharing based on various combinatorial optimization problems, such as
vertex and set cover, facility location, and network design problems. We
concentrate on the existence and computational complexity of strong equilibria,
in which no coa... |
1003.3139 | Querying Incomplete Data over Extended ER Schemata | cs.DB cs.LO | Since Chen's Entity-Relationship (ER) model, conceptual modeling has been
playing a fundamental role in relational data design. In this paper we consider
an extended ER (EER) model enriched with cardinality constraints, disjointness
assertions, and is-a relations among both entities and relationships. In this
setting... |
1003.3195 | Zero-error channel capacity and simulation assisted by non-local
correlations | quant-ph cs.IT math.IT | Shannon's theory of zero-error communication is re-examined in the broader
setting of using one classical channel to simulate another exactly, and in the
presence of various resources that are all classes of non-signalling
correlations: Shared randomness, shared entanglement and arbitrary
non-signalling correlations.... |
1003.3266 | Pattern recognition using inverse resonance filtration | cs.CV | An approach to textures pattern recognition based on inverse resonance
filtration (IRF) is considered. A set of principal resonance harmonics of
textured image signal fluctuations eigen harmonic decomposition (EHD) is used
for the IRF design. It was shown that EHD is invariant to textured image linear
shift. The reco... |
1003.3279 | A New Heuristic for Feature Selection by Consistent Biclustering | cs.LG cs.DM math.CO | Given a set of data, biclustering aims at finding simultaneous partitions in
biclusters of its samples and of the features which are used for representing
the samples. Consistent biclusterings allow to obtain correct classifications
of the samples from the known classification of the features, and vice versa,
and the... |
1003.3299 | Improved Bounds on Restricted Isometry Constants for Gaussian Matrices | cs.IT math.CO math.IT math.NA | The Restricted Isometry Constants (RIC) of a matrix $A$ measures how close to
an isometry is the action of $A$ on vectors with few nonzero entries, measured
in the $\ell^2$ norm. Specifically, the upper and lower RIC of a matrix $A$ of
size $n\times N$ is the maximum and the minimum deviation from unity (one) of
the ... |
1003.3370 | Adding HL7 version 3 data types to PostgreSQL | cs.DB | The HL7 standard is widely used to exchange medical information
electronically. As a part of the standard, HL7 defines scalar communication
data types like physical quantity, point in time and concept descriptor but
also complex types such as interval types, collection types and probabilistic
types. Typical HL7 appli... |
1003.3384 | Scaling limits for continuous opinion dynamics systems | math.PR cs.SI math.AP math.DS | Scaling limits are analyzed for stochastic continuous opinion dynamics
systems, also known as gossip models. In such models, agents update their
vector-valued opinion to a convex combination (possibly agent- and
opinion-dependent) of their current value and that of another observed agent.
It is shown that, in the lim... |
1003.3386 | Monomial-like codes | cs.IT math.IT | As a generalization of cyclic codes of length p^s over F_{p^a}, we study
n-dimensional cyclic codes of length p^{s_1} X ... X p^{s_n} over F_{p^a}
generated by a single "monomial". Namely, we study multi-variable cyclic codes
of the form <(x_1 - 1)^{i_1} ... (x_n - 1)^{i_n}> in F_{p^a}[x_1...x_n] / <
x_1^{p^{s_1}}-1,... |
1003.3492 | Generalized Maiorana-McFarland Constructions for Almost Optimal
Resilient Functions | cs.CR cs.IT math.CO math.IT | In a recent paper \cite{Zhang-Xiao}, Zhang and Xiao describe a technique on
constructing almost optimal resilient functions on even number of variables. In
this paper, we will present an extensive study of the constructions of almost
optimal resilient functions by using the generalized Maiorana-McFarland (GMM)
constr... |
1003.3501 | Generalized Distributed Network Coding Based on Nonbinary Linear Block
Codes for Multi-User Cooperative Communications | cs.IT math.IT | In this work, we propose and analyze a generalized construction of
distributed network codes for a network consisting of M users sending different
information to a common base station through independent block fading channels.
The aim is to increase the diversity order of the system without reducing its
code rate. Th... |
1003.3507 | On the Degrees of Freedom Regions of Two-User MIMO Z and Full
Interference Channels with Reconfigurable Antennas | cs.IT math.IT | We study the degrees of freedom (DoF) regions of two-user multiple-input
multiple-output (MIMO) Z and full interference channels in this paper. We
assume that the receivers always have perfect channel state information. We
derive the DoF region of Z interference channel with channel state information
at transmitter (... |
1003.3530 | Topic Map: An Ontology Framework for Information Retrieval | cs.DL cs.IR | The basic classification techniques for organizing information are thesauri,
taxonomy and faceted classification. Topic map is relatively a new entrant to
this information space. Topic map standard describes how complex relationships
between abstract concepts and real world resources can be represented using XML
synt... |
1003.3533 | Towards Automated Lecture Capture, Navigation and Delivery System for
Web-Lecture on Demand | cs.MM cs.IR | Institutions all over the world are continuously exploring ways to use ICT in
improving teaching and learning effectiveness. The use of course web pages,
discussion groups, bulletin boards, and e-mails have shown considerable impact
on teaching and learning in significant ways, across all disciplines. ELearning
has e... |
1003.3536 | Computing the Fewest-turn Map Directions based on the Connectivity of
Natural Roads | cs.CG cs.DB cs.DS | In this paper, we introduced a novel approach to computing the fewest-turn
map directions or routes based on the concept of natural roads. Natural roads
are joined road segments that perceptually constitute good continuity. This
approach relies on the connectivity of natural roads rather than that of road
segments fo... |
1003.3543 | Fastest Distributed Consensus Problem on Fusion of Two Star Networks | cs.IT cs.DC math.IT | Finding optimal weights for the problem of Fastest Distributed Consensus on
networks with different topologies has been an active area of research for a
number of years. Here in this work we present an analytical solution for the
problem of Fastest Distributed Consensus for a network formed from fusion of
two differe... |
1003.3619 | Using Information Theory to Study the Efficiency and Capacity of
Computers and Similar Devices | cs.IT cs.CC math.IT | We address the problems of estimating the computer efficiency and the
computer capacity. We define the computer efficiency and capacity and suggest a
method for their estimation, based on the analysis of processor instructions
and kinds of accessible memory. It is shown how the suggested method can be
applied to esti... |
1003.3654 | Sliding window approach based Text Binarisation from Complex Textual
images | cs.CV | Text binarisation process classifies individual pixels as text or background
in the textual images. Binarization is necessary to bridge the gap between
localization and recognition by OCR. This paper presents Sliding window method
to binarise text from textual images with textured background. Suitable
preprocessing t... |
1003.3661 | An HTTP-Based Versioning Mechanism for Linked Data | cs.DL cs.IR | Dereferencing a URI returns a representation of the current state of the
resource identified by that URI. But, on the Web representations of prior
states of a resource are also available, for example, as resource versions in
Content Management Systems or archival resources in Web Archives such as the
Internet Archive... |
1003.3676 | Simple heuristics for the assembly line worker assignment and balancing
problem | cs.DS cs.NE | We propose simple heuristics for the assembly line worker assignment and
balancing problem. This problem typically occurs in assembly lines in sheltered
work centers for the disabled. Different from the classical simple assembly
line balancing problem, the task execution times vary according to the assigned
worker. W... |
1003.3707 | Downlink Interference Alignment | cs.IT math.IT | We develop an interference alignment (IA) technique for a downlink cellular
system. In the uplink, IA schemes need channel-state-information exchange
across base-stations of different cells, but our downlink IA technique requires
feedback only within a cell. As a result, the proposed scheme can be
implemented with a ... |
1003.3754 | Quantum codes from codes over Gaussian integers with respect to the
Mannheim metric | cs.IT math.IT | In this paper, some nonbinary quantum codes using classical codes over
Gaussian integers are obtained. Also, some of our quantum codes are better than
or comparable with those known before, (for instance [[8; 2; 5]]4+i).
|
1003.3765 | Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay
Channel | cs.IT math.IT | A three terminal relay system with binary erasure channel (BEC) was
considered, in which a source forwarded information to a destination with a
relay's "assistance". The nested LDGM (Low-density generator-matrix) -LDPC
(low-density parity-check) was designed to realize Compress-and-forward (CF) at
the relay. LDGM cod... |
1003.3766 | Modelling and simulating retail management practices: a first approach | cs.AI cs.CE cs.MA | Multi-agent systems offer a new and exciting way of understanding the world
of work. We apply agent-based modeling and simulation to investigate a set of
problems in a retail context. Specifically, we are working to understand the
relationship between people management practices on the shop-floor and retail
performan... |
1003.3767 | Multi-Agent Simulation and Management Practices | cs.AI cs.CE cs.MA | Intelligent agents offer a new and exciting way of understanding the world of
work. Agent-Based Simulation (ABS), one way of using intelligent agents,
carries great potential for progressing our understanding of management
practices and how they link to retail performance. We have developed simulation
models based on... |
1003.3775 | Optimisation of a Crossdocking Distribution Centre Simulation Model | cs.AI cs.CE | This paper reports on continuing research into the modelling of an order
picking process within a Crossdocking distribution centre using Simulation
Optimisation. The aim of this project is to optimise a discrete event
simulation model and to understand factors that affect finding its optimal
performance. Our initial ... |
1003.3784 | Simulating Customer Experience and Word Of Mouth in Retail - A Case
Study | cs.MA cs.CE | Agents offer a new and exciting way of understanding the world of work. In
this paper we describe the development of agent-based simulation models,
designed to help to understand the relationship between people management
practices and retail performance. We report on the current development of our
simulation models ... |
1003.3792 | On Complexity, Energy- and Implementation-Efficiency of Channel Decoders | cs.IT cs.AR math.IT | Future wireless communication systems require efficient and flexible baseband
receivers. Meaningful efficiency metrics are key for design space exploration
to quantify the algorithmic and the implementation complexity of a receiver.
Most of the current established efficiency metrics are based on counting
operations, ... |
1003.3821 | A Formal Approach to Modeling the Memory of a Living Organism | cs.AI cs.DS cs.LG q-bio.NC | We consider a living organism as an observer of the evolution of its
environment recording sensory information about the state space X of the
environment in real time. Sensory information is sampled and then processed on
two levels. On the biological level, the organism serves as an evaluation
mechanism of the subjec... |
1003.3908 | Full Diversity Space-Time Block Codes with Low-Complexity Partial
Interference Cancellation Group Decoding | cs.IT math.IT | Partial interference cancellation (PIC) group decoding proposed by Guo and
Xia is an attractive low-complexity alternative to the optimal processing for
multiple-input multiple-output (MIMO) wireless communications. It can well deal
with the tradeoff among rate, diversity and complexity of space-time block
codes (STB... |
1003.3967 | Adaptive Submodularity: Theory and Applications in Active Learning and
Stochastic Optimization | cs.LG cs.AI cs.DS | Solving stochastic optimization problems under partial observability, where
one needs to adaptively make decisions with uncertain outcomes, is a
fundamental but notoriously difficult challenge. In this paper, we introduce
the concept of adaptive submodularity, generalizing submodular set functions to
adaptive policie... |
1003.3984 | On MMSE and MAP Denoising Under Sparse Representation Modeling Over a
Unitary Dictionary | cs.CV stat.AP | Among the many ways to model signals, a recent approach that draws
considerable attention is sparse representation modeling. In this model, the
signal is assumed to be generated as a random linear combination of a few atoms
from a pre-specified dictionary. In this work we analyze two Bayesian denoising
algorithms -- ... |
1003.3985 | The Projected GSURE for Automatic Parameter Tuning in Iterative
Shrinkage Methods | cs.CV stat.AP | Linear inverse problems are very common in signal and image processing. Many
algorithms that aim at solving such problems include unknown parameters that
need tuning. In this work we focus on optimally selecting such parameters in
iterative shrinkage methods for image deblurring and image zooming. Our work
uses the p... |
1003.4021 | System-theoretic approach to image interest point detection | cs.CV | Interest point detection is a common task in various computer vision
applications. Although a big variety of detector are developed so far
computational efficiency of interest point based image analysis remains to be
the problem. Current paper proposes a system-theoretic approach to interest
point detection. Starting... |
1003.4042 | MINRES-QLP: a Krylov subspace method for indefinite or singular
symmetric systems | math.NA cs.CE cs.NA stat.CO | CG, SYMMLQ, and MINRES are Krylov subspace methods for solving symmetric
systems of linear equations. When these methods are applied to an incompatible
system (that is, a singular symmetric least-squares problem), CG could break
down and SYMMLQ's solution could explode, while MINRES would give a
least-squares solutio... |
1003.4053 | A Comprehensive Review of Image Enhancement Techniques | cs.CV | Principle objective of Image enhancement is to process an image so that
result is more suitable than original image for specific application. Digital
image enhancement techniques provide a multitude of choices for improving the
visual quality of images. Appropriate choice of such techniques is greatly
influenced by t... |
1003.4057 | Construction of optimal codes in deletion and insertion metric | cs.IT math.IT | We improve Levenshtein's upper bound for the cardinality of a code of length
four that is capable of correcting single deletions over an alphabet of even
size. We also illustrate that the new upper bound is sharp. Furthermore we
construct an optimal perfect code that is capable of correcting single
deletions for the ... |
1003.4065 | Plagiarism Detection using ROUGE and WordNet | cs.OH cs.CL | With the arrival of digital era and Internet, the lack of information control
provides an incentive for people to freely use any content available to them.
Plagiarism occurs when users fail to credit the original owner for the content
referred to, and such behavior leads to violation of intellectual property. Two
mai... |
1003.4066 | A Security Based Data Mining Approach in Data Grid | cs.DC cs.DB | Grid computing is the next logical step to distributed computing. Main
objective of grid computing is an innovative approach to share resources such
as CPU usage; memory sharing and software sharing. Data Grids provide
transparent access to semantically related data resources in a heterogeneous
system. The system inc... |
1003.4067 | Computation of Reducts Using Topology and Measure of Significance of
Attributes | cs.IR | Data generated in the fields of science, technology, business and in many
other fields of research are increasing in an exponential rate. The way to
extract knowledge from a huge set of data is a challenging task. This paper
aims to propose a hybrid and viable method to deal with an information system
in data mining,... |
1003.4068 | A Novel Approach For Discovery Multi Level Fuzzy Association Rule Mining | cs.DB | Finding multilevel association rules in transaction databases is most
commonly seen in is widely used in data mining. In this paper, we present a
model of mining multilevel association rules which satisfies the different
minimum support at each level, we have employed fuzzy set concepts, multi-level
taxonomy and diff... |
1003.4075 | A Neuro-Fuzzy Multi Swarm FastSLAM Framework | cs.RO | FastSLAM is a framework for simultaneous localization using a
Rao-Blackwellized particle filter. In FastSLAM, particle filter is used for the
mobile robot pose (position and orientation) estimation, and an Extended Kalman
Filter (EKF) is used for the feature location's estimation. However, FastSLAM
degenerates over t... |
1003.4076 | Similarity Data Item Set Approach: An Encoded Temporal Data Base
Technique | cs.DB | Data mining has been widely recognized as a powerful tool to explore added
value from large-scale databases. Finding frequent item sets in databases is a
crucial in data mining process of extracting association rules. Many algorithms
were developed to find the frequent item sets. This paper presents a summary
and a c... |
1003.4079 | Gene Expression Data Knowledge Discovery using Global and Local
Clustering | cs.CE cs.LG q-bio.GN | To understand complex biological systems, the research community has produced
huge corpus of gene expression data. A large number of clustering approaches
have been proposed for the analysis of gene expression data. However,
extracting important biological knowledge is still harder. To address this
task, clustering t... |
1003.4081 | Fuzzy-based Navigation and Control of a Non-Holonomic Mobile Robot | cs.NE cs.RO | In recent years, the use of non-analytical methods of computing such as fuzzy
logic, evolutionary computation, and neural networks has demonstrated the
utility and potential of these paradigms for intelligent control of mobile
robot navigation. In this paper, a theoretical model of a fuzzy based
controller for an aut... |
1003.4087 | Land-cover Classification and Mapping for Eastern Himalayan State Sikkim | cs.CV | Area of classifying satellite imagery has become a challenging task in
current era where there is tremendous growth in settlement i.e. construction of
buildings, roads, bridges, dam etc. This paper suggests an improvised k-means
and Artificial Neural Network (ANN) classifier for land-cover mapping of
Eastern Himalaya... |
1003.4140 | Integrating Real-Time Analysis With The Dendritic Cell Algorithm Through
Segmentation | cs.NE cs.AI cs.CR | As an immune inspired algorithm, the Dendritic Cell Algorithm (DCA) has been
applied to a range of problems, particularly in the area of intrusion
detection. Ideally, the intrusion detection should be performed in real-time,
to continuously detect misuses as soon as they occur. Consequently, the
analysis process perf... |
1003.4141 | Investigating Output Accuracy for a Discrete Event Simulation Model and
an Agent Based Simulation Model | cs.AI cs.CE cs.MA | In this paper, we investigate output accuracy for a Discrete Event Simulation
(DES) model and Agent Based Simulation (ABS) model. The purpose of this
investigation is to find out which of these simulation techniques is the best
one for modelling human reactive behaviour in the retail sector. In order to
study the out... |
1003.4142 | Malicious Code Execution Detection and Response Immune System inspired
by the Danger Theory | cs.AI cs.CR cs.NE | The analysis of system calls is one method employed by anomaly detection
systems to recognise malicious code execution. Similarities can be drawn
between this process and the behaviour of certain cells belonging to the human
immune system, and can be applied to construct an artificial immune system. A
recently develo... |
1003.4145 | Mimicking the Behaviour of Idiotypic AIS Robot Controllers Using
Probabilistic Systems | 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... |
1003.4146 | A Mathematical Approach to the Study of the United States Code | cs.IR cs.CY cs.DL physics.soc-ph | The United States Code (Code) is a document containing over 22 million words
that represents a large and important source of Federal statutory law. Scholars
and policy advocates often discuss the direction and magnitude of changes in
various aspects of the Code. However, few have mathematically formalized the
notions... |
1003.4149 | Les Entit\'es Nomm\'ees : usage et degr\'es de pr\'ecision et de
d\'esambigu\"isation | cs.CL | The recognition and classification of Named Entities (NER) are regarded as an
important component for many Natural Language Processing (NLP) applications.
The classification is usually made by taking into account the immediate context
in which the NE appears. In some cases, this immediate context does not allow
getti... |
1003.4196 | Development of a Cargo Screening Process Simulator: A First Approach | cs.AI cs.CE cs.MA | The efficiency of current cargo screening processes at sea and air ports is
largely unknown as few benchmarks exists against which they could be measured.
Some manufacturers provide benchmarks for individual sensors but we found no
benchmarks that take a holistic view of the overall screening procedures and no
benchm... |
1003.4216 | Minimizing the Probability of Lifetime Ruin under Stochastic Volatility | q-fin.PM cs.SY math.OC math.PR | We assume that an individual invests in a financial market with one riskless
and one risky asset, with the latter's price following a diffusion with
stochastic volatility. In the current financial market especially, it is
important to include stochastic volatility in the risky asset's price process.
Given the rate of... |
1003.4270 | Wireless Network Coding with Imperfect Overhearing | cs.IT math.IT | Not only is network coding essential to achieve the capacity of a
single-session multicast network, it can also help to improve the throughput of
wireless networks with multiple unicast sessions when overheard information is
available. Most previous research aimed at realizing such improvement by using
perfectly over... |
1003.4274 | Unbeatable Imitation | cs.GT cs.LG | We show that for many classes of symmetric two-player games, the simple
decision rule "imitate-the-best" can hardly be beaten by any other decision
rule. We provide necessary and sufficient conditions for imitation to be
unbeatable and show that it can only be beaten by much in games that are of the
rock-scissors-pap... |
1003.4287 | Towards automated high-throughput screening of C. elegans on agar | cs.CV q-bio.GN | High-throughput screening (HTS) using model organisms is a promising method
to identify a small number of genes or drugs potentially relevant to human
biology or disease. In HTS experiments, robots and computers do a significant
portion of the experimental work. However, one remaining major bottleneck is
the manual a... |
1003.4302 | Optimal Unitary Linear Processing for Amplify-and-Forward Cooperative
OFDM systems | cs.IT math.IT math.OC | In this paper, we consider the amplified-and-forward relaying in an OFDM
system with unitary linear processing at the relay. We proposed a general
analytical framework to find the unitary linear processing matrix that
maximizes the system achievable rate. We show that the optimal processing
matrix is a permutation ma... |
1003.4328 | New inner and outer bounds for the discrete memoryless cognitive
interference channel and some capacity results | cs.IT math.IT | The cognitive interference channel is an interference channel in which one
transmitter is non-causally provided with the message of the other transmitter.
This channel model has been extensively studied in the past years and capacity
results for certain classes of channels have been proved. In this paper we
present n... |
1003.4353 | XPath Whole Query Optimization | cs.DB | Previous work reports about SXSI, a fast XPath engine which executes tree
automata over compressed XML indexes. Here, reasons are investigated why SXSI
is so fast. It is shown that tree automata can be used as a general framework
for fine grained XML query optimization. We define the "relevant nodes" of a
query as th... |
1003.4355 | Closed-Form Expressions for Secrecy Capacity over Correlated Rayleigh
Fading Channels | cs.IT cs.CR math.IT | We investigate the secure communications over correlated wiretap Rayleigh
fading channels assuming the full channel state information (CSI) available.
Based on the information theoretic formulation, we derive closed-form
expressions for the average secrecy capacity and the outage probability.
Simulation results confi... |
1003.4394 | Mathematical Foundations for a Compositional Distributional Model of
Meaning | cs.CL cs.LO math.CT | We propose a mathematical framework for a unification of the distributional
theory of meaning in terms of vector space models, and a compositional theory
for grammatical types, for which we rely on the algebra of Pregroups,
introduced by Lambek. This mathematical framework enables us to compute the
meaning of a well-... |
1003.4418 | Evaluation of Query Generators for Entity Search Engines | cs.DB cs.IR | Dynamic web applications such as mashups need efficient access to web data
that is only accessible via entity search engines (e.g. product or publication
search engines). However, most current mashup systems and applications only
support simple keyword searches for retrieving data from search engines. We
propose the ... |
1003.4539 | Linear tail-biting trellises: Characteristic generators and the
BCJR-construction | cs.IT math.IT | We investigate the constructions of tail-biting trellises for linear block
codes introduced by Koetter/Vardy (2003) and Nori/Shankar (2006). For a given
code we will define the sets of characteristic generators more generally than
by Koetter/Vardy and we will investigate how the choice of characteristic
generators af... |
1003.4627 | Unique and Minimum Distance Decoding of Linear Codes with Reduced
Complexity | cs.IT math.IT | We show that for (systematic) linear codes the time complexity of unique
decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum
distance decoding is O(n^{2}q^{nRH(delta/R)}). The proposed algorithm inspects
all error patterns in the information set of the received message of weight
less than d/2 or... |
1003.4657 | Identification of Convection Heat Transfer Coefficient of Secondary
Cooling Zone of CCM based on Least Squares Method and Stochastic
Approximation Method | math.OC cs.CE | The detailed mathematical model of heat and mass transfer of steel ingot of
curvilinear continuous casting machine is proposed. The process of heat and
mass transfer is described by nonlinear partial differential equations of
parabolic type. Position of phase boundary is determined by Stefan conditions.
The temperatu... |
1003.4712 | Game interpretation of Kolmogorov complexity | math.LO cs.GT cs.IT math.IT | The Kolmogorov complexity function K can be relativized using any oracle A,
and most properties of K remain true for relativized versions. In section 1 we
provide an explanation for this observation by giving a game-theoretic
interpretation and showing that all "natural" properties are either true for
all sufficientl... |
1003.4764 | Adaptive Beamforming in Interference Networks via Bi-Directional
Training | cs.IT math.IT | We study distributed algorithms for adjusting beamforming vectors and
receiver filters in multiple-input multiple-output (MIMO) interference
networks, with the assumption that each user uses a single beam and a linear
filter at the receiver. In such a setting there have been several distributed
algorithms studied for... |
1003.4778 | A Unique "Nonnegative" Solution to an Underdetermined System: from
Vectors to Matrices | cs.IT math.IT | This paper investigates the uniqueness of a nonnegative vector solution and
the uniqueness of a positive semidefinite matrix solution to underdetermined
linear systems. A vector solution is the unique solution to an underdetermined
linear system only if the measurement matrix has a row-span intersecting the
positive ... |
1003.4781 | Large Margin Boltzmann Machines and Large Margin Sigmoid Belief Networks | cs.LG cs.AI cs.CV | Current statistical models for structured prediction make simplifying
assumptions about the underlying output graph structure, such as assuming a
low-order Markov chain, because exact inference becomes intractable as the
tree-width of the underlying graph increases. Approximate inference algorithms,
on the other hand... |
1003.4827 | Tuple-based abstract data types: full parallelism | cs.DB | Commutativity has the same inherent limitations as compatibility. Then, it is
worth conceiving simple concurrency control techniques. We propose a restricted
form of commutativity which increases parallelism without incurring a higher
overhead than compatibility. Advantages of our proposition are: (1)
commutativity o... |
1003.4828 | A framework for designing concurrent and recoverable abstract data types
based on commutativity | cs.DB | In this paper, we try to focus the reader's interest on the problems that
transactional systems have to resolve for taking advantage of commutativity in
a serializable and recoverable way. Our framework is, (as others), based on the
use of conditional commutativity on abstract date types. We present new
features that... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.