id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1002.0485 | Morphological study of Albanian words, and processing with NooJ | cs.CL | We are developing electronic dictionaries and transducers for the automatic
processing of the Albanian Language. We will analyze the words inside a linear
segment of text. We will also study the relationship between units of sense and
units of form. The composition of words takes different forms in Albanian. We
have ... |
1002.0577 | Recherche de relations spatio-temporelles : une m\'ethode bas\'ee sur
l'analyse de corpus textuels | cs.IR | This paper presents a work package realized for the G\'eOnto project. A new
method is proposed for an enrichment of a first geographical ontology developed
beforehand. This method relies on text analysis by lexico-syntactic patterns.
From the retrieve of n-ary relations the method automatically detect those
involve... |
1002.0672 | The Gelfand widths of $\ell_p$-balls for $0<p\leq 1$ | math.FA cs.IT math.IT | We provide sharp lower and upper bounds for the Gelfand widths of
$\ell_p$-balls in the $N$-dimensional $\ell_q^N$-space for $0<p\leq 1$ and $p<q
\leq 2$. Such estimates are highly relevant to the novel theory of compressive
sensing, and our proofs rely on methods from this area.
|
1002.0680 | Some Relations between Divergence Derivatives and Estimation in Gaussian
channels | cs.IT math.IT | The minimum mean square error of the estimation of a non Gaussian signal
where observed from an additive white Gaussian noise channel's output, is
analyzed. First, a quite general time-continuous channel model is assumed for
which the behavior of the non-Gaussianess of the channel's output for small
signal to noise r... |
1002.0696 | Detecting Danger: Applying a Novel Immunological Concept to Intrusion
Detection Systems | cs.AI cs.CR cs.NE | In recent years computer systems have become increasingly complex and
consequently the challenge of protecting these systems has become increasingly
difficult. Various techniques have been implemented to counteract the misuse of
computer systems in the form of firewalls, anti-virus software and intrusion
detection sy... |
1002.0709 | Aggregating Algorithm competing with Banach lattices | cs.LG | The paper deals with on-line regression settings with signals belonging to a
Banach lattice. Our algorithms work in a semi-online setting where all the
inputs are known in advance and outcomes are unknown and given step by step. We
apply the Aggregating Algorithm to construct a prediction method whose
cumulative loss... |
1002.0722 | Fastest Distributed Consensus on Path Network | cs.IT cs.DC math.CO math.IT | Providing an analytical solution for the problem of finding Fastest
Distributed Consensus (FDC) is one of the challenging problems in the field of
sensor networks. Most of the methods proposed so far deal with the FDC
averaging algorithm problem by numerical convex optimization methods and in
general no closed-form s... |
1002.0745 | Using CODEQ to Train Feed-forward Neural Networks | cs.NE cs.AI | CODEQ is a new, population-based meta-heuristic algorithm that is a hybrid of
concepts from chaotic search, opposition-based learning, differential evolution
and quantum mechanics. CODEQ has successfully been used to solve different
types of problems (e.g. constrained, integer-programming, engineering) with
excellent... |
1002.0747 | Efficient Bayesian Learning in Social Networks with Gaussian Estimators | stat.AP cs.LG stat.ML | We consider a group of Bayesian agents who try to estimate a state of the
world $\theta$ through interaction on a social network. Each agent $v$
initially receives a private measurement of $\theta$: a number $S_v$ picked
from a Gaussian distribution with mean $\theta$ and standard deviation one.
Then, in each discret... |
1002.0757 | Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if
the Model is Wrong | cs.IT cs.LG math.IT math.ST stat.TH | We analyse the prequential plug-in codes relative to one-parameter
exponential families M. We show that if data are sampled i.i.d. from some
distribution outside M, then the redundancy of any plug-in prequential code
grows at rate larger than 1/2 ln(n) in the worst case. This means that plug-in
codes, such as the Ris... |
1002.0773 | Approximations to the MMI criterion and their effect on lattice-based
MMI | cs.CL | Maximum mutual information (MMI) is a model selection criterion used for
hidden Markov model (HMM) parameter estimation that was developed more than
twenty years ago as a discriminative alternative to the maximum likelihood
criterion for HMM-based speech recognition. It has been shown in the speech
recognition litera... |
1002.0777 | Polar Codes for the m-User MAC | cs.IT cs.DM math.CO math.IT | In this paper, polar codes for the $m$-user multiple access channel (MAC)
with binary inputs are constructed. It is shown that Ar{\i}kan's polarization
technique applied individually to each user transforms independent uses of a
$m$-user binary input MAC into successive uses of extremal MACs. This
transformation has ... |
1002.0852 | High-Dimensional Matched Subspace Detection When Data are Missing | cs.IT math.IT | We consider the problem of deciding whether a highly incomplete signal lies
within a given subspace. This problem, Matched Subspace Detection, is a
classical, well-studied problem when the signal is completely observed. High-
dimensional testing problems in which it may be prohibitive or impossible to
obtain a comple... |
1002.0904 | On Event Structure in the Torn Dress | cs.CL | Using Pustejovsky's "The Syntax of Event Structure" and Fong's "On Mending a
Torn Dress" we give a glimpse of a Pustejovsky-like analysis to some example
sentences in Fong. We attempt to give a framework for semantics to the noun
phrases and adverbs as appropriate as well as the lexical entries for all words
in the e... |
1002.0908 | Homomorphisms between fuzzy information systems revisited | cs.AI | Recently, Wang et al. discussed the properties of fuzzy information systems
under homomorphisms in the paper [C. Wang, D. Chen, L. Zhu, Homomorphisms
between fuzzy information systems, Applied Mathematics Letters 22 (2009)
1045-1050], where homomorphisms are based upon the concepts of consistent
functions and fuzzy r... |
1002.0963 | Discovery of Convoys in Trajectory Databases | cs.DB cs.CG | As mobile devices with positioning capabilities continue to proliferate, data
management for so-called trajectory databases that capture the historical
movements of populations of moving objects becomes important. This paper
considers the querying of such databases for convoys, a convoy being a group of
objects that ... |
1002.0968 | Quantale Modules and their Operators, with Applications | math.LO cs.IT math.IT | The central topic of this work is the categories of modules over unital
quantales. The main categorical properties are established and a special class
of operators, called Q-module transforms, is defined. Such operators - that
turn out to be precisely the homomorphisms between free objects in those
categories - find ... |
1002.0971 | The WebStand Project | cs.DB | In this paper we present the state of advancement of the French ANR WebStand
project. The objective of this project is to construct a customizable XML based
warehouse platform to acquire, transform, analyze, store, query and export data
from the web, in particular mailing lists, with the final intension of using
this... |
1002.0982 | A Unified Algebraic Framework for Fuzzy Image Compression and
Mathematical Morphology | cs.IT math.IT | In this paper we show how certain techniques of image processing, having
different scopes, can be joined together under a common "algebraic roof".
|
1002.1060 | Statistics for Ranking Program Committees and Editorial Boards | cs.IT cs.IR math.IT physics.soc-ph | Ranking groups of researchers is important in several contexts and can serve
many purposes such as the fair distribution of grants based on the scientist's
publication output, concession of research projects, classification of journal
editorial boards and many other applications in a social context. In this
paper, we... |
1002.1095 | Towards a Heuristic Categorization of Prepositional Phrases in English
with WordNet | cs.CL | This document discusses an approach and its rudimentary realization towards
automatic classification of PPs; the topic, that has not received as much
attention in NLP as NPs and VPs. The approach is a rule-based heuristics
outlined in several levels of our research. There are 7 semantic categories of
PPs considered i... |
1002.1099 | The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based
on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a
Prototype Game | cs.HC cs.DC cs.MA cs.NI cs.PF | In this work, we discuss multiplayer pervasive games that rely on the use of
ad hoc mobile sensor networks. The unique feature in such games is that players
interact with each other and their surrounding environment by using movement
and presence as a means of performing game-related actions, utilizing sensor
devices... |
1002.1104 | An Efficient Rigorous Approach for Identifying Statistically Significant
Frequent Itemsets | cs.DB cs.DS | As advances in technology allow for the collection, storage, and analysis of
vast amounts of data, the task of screening and assessing the significance of
discovered patterns is becoming a major challenge in data mining applications.
In this work, we address significance in the context of frequent itemset
mining. Spe... |
1002.1143 | A Logical Temporal Relational Data Model | cs.DB | Time is one of the most difficult aspects to handle in real world
applications such as database systems. Relational database management systems
proposed by Codd offer very little built-in query language support for temporal
data management. The model itself incorporates neither the concept of time nor
any theory of t... |
1002.1144 | A CHAID Based Performance Prediction Model in Educational Data Mining | cs.LG | The performance in higher secondary school education in India is a turning
point in the academic lives of all students. As this academic performance is
influenced by many factors, it is essential to develop predictive data mining
model for students' performance so as to identify the slow learners and study
the influe... |
1002.1148 | A Comparative Study of Removal Noise from Remote Sensing Image | cs.CV | This paper attempts to undertake the study of three types of noise such as
Salt and Pepper (SPN), Random variation Impulse Noise (RVIN), Speckle (SPKN).
Different noise densities have been removed between 10% to 60% by using five
types of filters as Mean Filter (MF), Adaptive Wiener Filter (AWF), Gaussian
Filter (GF)... |
1002.1150 | Finding Sequential Patterns from Large Sequence Data | cs.DB | Data mining is the task of discovering interesting patterns from large
amounts of data. There are many data mining tasks, such as classification,
clustering, association rule mining, and sequential pattern mining. Sequential
pattern mining finds sets of data items that occur together frequently in some
sequences. Seq... |
1002.1156 | Dimensionality Reduction: An Empirical Study on the Usability of IFE-CF
(Independent Feature Elimination- by C-Correlation and F-Correlation)
Measures | cs.LG | The recent increase in dimensionality of data has thrown a great challenge to
the existing dimensionality reduction methods in terms of their effectiveness.
Dimensionality reduction has emerged as one of the significant preprocessing
steps in machine learning applications and has been effective in removing
inappropri... |
1002.1157 | Establishment of Relationships between Material Design and Product
Design Domains by Hybrid FEM-ANN Technique | cs.AI | In this paper, research on AI based modeling technique to optimize
development of new alloys with necessitated improvements in properties and
chemical mixture over existing alloys as per functional requirements of product
is done. The current research work novels AI in lieu of predictions to
establish association bet... |
1002.1159 | Mining The Successful Binary Combinations: Methodology and A Simple Case
Study | cs.DB | The importance of finding the characteristics leading to either a success or
a failure is one of the driving forces of data mining. The various application
areas of finding success/failure factors cover vast variety of areas such as
credit risk evaluation and granting loans, micro array analysis, health factors
and h... |
1002.1164 | Existence and Global Logarithmic Stability of Impulsive Neural Networks
with Time Delay | cs.NE | The stability and convergence of the neural networks are the fundamental
characteristics in the Hopfield type networks. Since time delay is ubiquitous
in most physical and biological systems, more attention is being made for the
delayed neural networks. The inclusion of time delay into a neural model is
natural due t... |
1002.1176 | Phase-Only Planar Antenna Array Synthesis with Fuzzy Genetic Algorithms | cs.NE | This paper describes a new method for the synthesis of planar antenna arrays
using fuzzy genetic algorithms (FGAs) by optimizing phase excitation
coefficients to best meet a desired radiation pattern. We present the
application of a rigorous optimization technique based on fuzzy genetic
algorithms (FGAs), the optimiz... |
1002.1184 | Implementation of an Innovative Bio Inspired GA and PSO Algorithm for
Controller design considering Steam GT Dynamics | cs.NE | The Application of Bio Inspired Algorithms to complicated Power System
Stability Problems has recently attracted the researchers in the field of
Artificial Intelligence. Low frequency oscillations after a disturbance in a
Power system, if not sufficiently damped, can drive the system unstable. This
paper provides a s... |
1002.1185 | Significant Interval and Frequent Pattern Discovery in Web Log Data | cs.DB | There is a considerable body of work on sequence mining of Web Log Data. We
are using One Pass frequent Episode discovery (or FED) algorithm, takes a
different approach than the traditional apriori class of pattern detection
algorithms. In this approach significant intervals for each Website are
computed first (indep... |
1002.1191 | Unidirectional Error Correcting Codes for Memory Systems: A Comparative
Study | cs.IT math.IT | In order to achieve fault tolerance, highly reliable system often require the
ability to detect errors as soon as they occur and prevent the speared of
erroneous information throughout the system. Thus, the need for codes capable
of detecting and correcting byte errors are extremely important since many
memory system... |
1002.1200 | Detecting Bots Based on Keylogging Activities | cs.CR cs.AI cs.NE | A bot is a piece of software that is usually installed on an infected machine
without the user's knowledge. A bot is controlled remotely by the attacker
under a Command and Control structure. Recent statistics show that bots
represent one of the fastest growing threats to our network by performing
malicious activitie... |
1002.1285 | The Influence of Intensity Standardization on Medical Image Registration | cs.CV | Acquisition-to-acquisition signal intensity variations (non-standardness) are
inherent in MR images. Standardization is a post processing method for
correcting inter-subject intensity variations through transforming all images
from the given image gray scale into a standard gray scale wherein similar
intensities achi... |
1002.1288 | Ball-Scale Based Hierarchical Multi-Object Recognition in 3D Medical
Images | cs.CV | This paper investigates, using prior shape models and the concept of ball
scale (b-scale), ways of automatically recognizing objects in 3D images without
performing elaborate searches or optimization. That is, the goal is to place
the model in a single shot close to the right pose (position, orientation, and
scale) i... |
1002.1290 | Bounds on Threshold of Regular Random $k$-SAT | cs.IT cs.CC math.CO math.IT | We consider the regular model of formula generation in conjunctive normal
form (CNF) introduced by Boufkhad et. al. We derive an upper bound on the
satisfiability threshold and NAE-satisfiability threshold for regular random
$k$-SAT for any $k \geq 3$. We show that these bounds matches with the
corresponding bound fo... |
1002.1300 | Architecture for communication with a fidelity criterion in unknown
networks | cs.IT math.IT | We prove that in order to communicate independent sources (this is the
unicast problem) between various users over an unknown medium to within various
distortion levels, it is sufficient to consider source-channel separation based
architectures: architectures which first compress the sources to within the
correspondi... |
1002.1313 | Half-Duplex Active Eavesdropping in Fast Fading Channels: A Block-Markov
Wyner Secrecy Encoding Scheme | cs.IT cs.CR math.IT | In this paper we study the problem of half-duplex active eavesdropping in
fast fading channels. The active eavesdropper is a more powerful adversary than
the classical eavesdropper. It can choose between two functional modes:
eavesdropping the transmission between the legitimate parties (Ex mode), and
jamming it (Jx ... |
1002.1337 | Capacity Scaling of Wireless Ad Hoc Networks: Shannon Meets Maxwell | cs.IT math.IT | In this paper, we characterize the information-theoretic capacity scaling of
wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact
channel model from Maxwell's equations, we successfully resolve the conflict in
the literature between the linear capacity scaling by \"{O}zg\"{u}r et al. and
th... |
1002.1347 | Utility and Privacy of Data Sources: Can Shannon Help Conceal and Reveal
Information? | cs.IT math.IT | The problem of private information "leakage" (inadvertently or by malicious
design) from the myriad large centralized searchable data repositories drives
the need for an analytical framework that quantifies unequivocally how safe
private data can be (privacy) while still providing useful benefit (utility) to
multiple... |
1002.1406 | Collecting Coded Coupons over Generations | cs.IT math.IT | To reduce computational complexity and delay in randomized network coded
content distribution (and for some other practical reasons), coding is not
performed simultaneously over all content blocks but over much smaller subsets
known as generations. A penalty is throughput reduction. We model coding over
generations a... |
1002.1407 | Collecting Coded Coupons over Overlapping Generations | cs.IT math.IT | Coding over subsets (known as generations) rather than over all content
blocks in P2P distribution networks and other applications is necessary for a
number of practical reasons such as computational complexity. A penalty for
coding only within generations is an overall throughput reduction. It has been
previously sh... |
1002.1436 | Constant-Weight Gray Codes for Local Rank Modulation | cs.IT math.IT | We consider the local rank-modulation scheme in which a sliding window going
over a sequence of real-valued variables induces a sequence of permutations.
The local rank-modulation, as a generalization of the rank-modulation scheme,
has been recently suggested as a way of storing information in flash memory.
We stud... |
1002.1446 | On directed information theory and Granger causality graphs | cs.IT math.IT | Directed information theory deals with communication channels with feedback.
When applied to networks, a natural extension based on causal conditioning is
needed. We show here that measures built from directed information theory in
networks can be used to assess Granger causality graphs of stochastic
processes. We sh... |
1002.1447 | PAPR reduction of space-time and space-frequency coded OFDM systems
using active constellation extension | cs.IT math.IT | Active Constellation Extension (ACE) is one of techniques introduced for Peak
to Average Power Ratio (PAPR) reduction for OFDM systems. In this technique,
the constellation points are extended such that the PAPR is minimized but the
minimum distance of the constellation points does not decrease. In this paper,
an ite... |
1002.1465 | On Coding for Cooperative Data Exchange | cs.IT math.IT | We consider the problem of data exchange by a group of closely-located
wireless nodes. In this problem each node holds a set of packets and needs to
obtain all the packets held by other nodes. Each of the nodes can broadcast the
packets in its possession (or a combination thereof) via a noiseless broadcast
channel of... |
1002.1480 | A Minimum Relative Entropy Controller for Undiscounted Markov Decision
Processes | cs.AI cs.LG cs.RO | Adaptive control problems are notoriously difficult to solve even in the
presence of plant-specific controllers. One way to by-pass the intractable
computation of the optimal policy is to restate the adaptive control as the
minimization of the relative entropy of a controller that ignores the true
plant dynamics from... |
1002.1530 | The Degrees of Freedom Region of the MIMO Cognitive Interference Channel
with No CSIT | cs.IT math.IT | This paper has been withdrawn by the author(s) for revision.
|
1002.1531 | A Large-System Analysis of the Imperfect-CSIT Gaussian Broadcast Channel
with a DPC-based Transmission Strategy | cs.IT math.IT | The Gaussian broadcast channel (GBC) with $K$ transmit antennas and $K$
single-antenna users is considered for the case in which the channel state
information is obtained at the transmitter via a finite-rate feedback link of
capacity $r$ bits per user. The throughput (i.e., the sum-rate normalized by
$K$) of the GBC ... |
1002.1532 | On the scaling of feedback bits to achieve the full multiplexing gain
over the Gaussian broadcast channel using DPC | cs.IT math.IT | This paper has been withdrawn by the author(s) for revision.
|
1002.1559 | Computational limits to nonparametric estimation for ergodic processes | cs.IT math.IT | A new negative result for nonparametric estimation of binary ergodic
processes is shown. I The problem of estimation of distribution with any degree
of accuracy is studied. Then it is shown that for any countable class of
estimators there is a zero-entropy binary ergodic process that is inconsistent
with the class of... |
1002.1584 | Power Control for Maximum Throughput in Spectrum Underlay Cognitive
Radio Networks | cs.IT cs.NI math.IT math.OC | We investigate power allocation for users in a spectrum underlay cognitive
network. Our objective is to find a power control scheme that allocates
transmit power for both primary and secondary users so that the overall network
throughput is maximized while maintaining the quality of service (QoS) of the
primary users... |
1002.1727 | An Improved DC Recovery Method from AC Coefficients of DCT-Transformed
Images | cs.MM cs.CV | Motivated by the work of Uehara et al. [1], an improved method to recover DC
coefficients from AC coefficients of DCT-transformed images is investigated in
this work, which finds applications in cryptanalysis of selective multimedia
encryption. The proposed under/over-flow rate minimization (FRM) method employs
an op... |
1002.1744 | On some invariants in numerical semigroups and estimations of the order
bound | cs.IT cs.DM math.AC math.IT | We study suitable parameters and relations in a numerical semigroup S. When S
is the Weierstrass semigroup at a rational point P of a projective curve C, we
evaluate the Feng-Rao order bound of the associated family of Goppa codes.
Further we conjecture that the order bound is always greater than a fixed value
easily... |
1002.1773 | Cuspidal and Noncuspidal Robot Manipulators | cs.RO | This article synthezises the most important results on the kinematics of
cuspidal manipulators i.e. nonredundant manipulators that can change posture
without meeting a singularity. The characteristic surfaces, the uniqueness
domains and the regions of feasible paths in the workspace are defined. Then,
several suffici... |
1002.1774 | Position Analysis of the RRP-3(SS) Multi-Loop Spatial Structure | cs.RO | The paper presents the position analysis of a spatial structure composed of
two platforms mutually connected by one RRP and three SS serial kinematic
chains, where R, P, and S stand for revolute, prismatic, and spherical
kinematic pair respectively. A set of three compatibility equations is laid
down that, following ... |
1002.1781 | Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback | cs.IT math.IT | The capacity region of the N-sender Gaussian multiple access channel with
feedback is not known in general. This paper studies the class of
linear-feedback codes that includes (nonlinear) nonfeedback codes at one
extreme and the linear-feedback codes by Schalkwijk and Kailath, Ozarow, and
Kramer at the other extreme.... |
1002.1782 | Online Distributed Sensor Selection | cs.LG | A key problem in sensor networks is to decide which sensors to query when, in
order to obtain the most useful information (e.g., for performing accurate
prediction), subject to constraints (e.g., on power and bandwidth). In many
applications the utility function is not known a priori, must be learned from
data, and c... |
1002.1896 | When group level is different from the population level: an adaptive
network with the Deffuant model | physics.soc-ph cs.MA | We propose a model coupling the classical opinion dynamics of the bounded
confidence model, proposed by Deffuant et al., with an adaptive network forming
a community or group structure. At each step, an individual can decide if it
changes groups or interact on its opinion with one of its internal or external
neighbou... |
1002.1916 | Assisted Common Information with Applications to Secure Two-Party
Computation | cs.IT cs.CR math.IT | Secure multi-party computation is a central problem in modern cryptography.
An important sub-class of this are problems of the following form: Alice and
Bob desire to produce sample(s) of a pair of jointly distributed random
variables. Each party must learn nothing more about the other party's output
than what its ow... |
1002.1919 | Thai Rhetorical Structure Analysis | cs.CL | Rhetorical structure analysis (RSA) explores discourse relations among
elementary discourse units (EDUs) in a text. It is very useful in many text
processing tasks employing relationships among EDUs such as text understanding,
summarization, and question-answering. Thai language with its distinctive
linguistic charac... |
1002.1951 | Image Retrieval Techniques based on Image Features, A State of Art
approach for CBIR | cs.MM cs.IR | The purpose of this Paper is to describe our research on different feature
extraction and matching techniques in designing a Content Based Image Retrieval
(CBIR) system. Due to the enormous increase in image database sizes, as well as
its vast deployment in various applications, the need for CBIR development
arose. F... |
1002.2012 | Implementing Genetic Algorithms on Arduino Micro-Controllers | cs.NE | Since their conception in 1975, Genetic Algorithms have been an extremely
popular approach to find exact or approximate solutions to optimization and
search problems. Over the last years there has been an enhanced interest in the
field with related techniques, such as grammatical evolution, being developed.
Unfortuna... |
1002.2034 | Dire n'est pas concevoir | cs.AI cs.CL | The conceptual modelling built from text is rarely an ontology. As a matter
of fact, such a conceptualization is corpus-dependent and does not offer the
main properties we expect from ontology. Furthermore, ontology extracted from
text in general does not match ontology defined by expert using a formal
language. It i... |
1002.2044 | On the Stability of Empirical Risk Minimization in the Presence of
Multiple Risk Minimizers | cs.LG | Recently Kutin and Niyogi investigated several notions of algorithmic
stability--a property of a learning map conceptually similar to
continuity--showing that training-stability is sufficient for consistency of
Empirical Risk Minimization while distribution-free CV-stability is necessary
and sufficient for having fin... |
1002.2050 | Intrinsic dimension estimation of data by principal component analysis | cs.CV cs.LG | Estimating intrinsic dimensionality of data is a classic problem in pattern
recognition and statistics. Principal Component Analysis (PCA) is a powerful
tool in discovering dimensionality of data sets with a linear structure; it,
however, becomes ineffective when data have a nonlinear structure. In this
paper, we pro... |
1002.2164 | Efficient LLR Calculation for Non-Binary Modulations over Fading
Channels | cs.IT math.IT | Log-likelihood ratio (LLR) computation for non-binary modulations over fading
channels is complicated. A measure of LLR accuracy on asymmetric binary
channels is introduced to facilitate good LLR approximations for non-binary
modulations. Considering piecewise linear LLR approximations, we prove
convexity of optimizi... |
1002.2171 | Reverse Engineering Financial Markets with Majority and Minority Games
using Genetic Algorithms | q-fin.TR cs.LG cs.MA | Using virtual stock markets with artificial interacting software investors,
aka agent-based models (ABMs), we present a method to reverse engineer
real-world financial time series. We model financial markets as made of a large
number of interacting boundedly rational agents. By optimizing the similarity
between the a... |
1002.2182 | Detection of Microcalcification in Mammograms Using Wavelet Transform
and Fuzzy Shell Clustering | cs.CV | Microcalcifications in mammogram have been mainly targeted as a reliable
earliest sign of breast cancer and their early detection is vital to improve
its prognosis. Since their size is very small and may be easily overlooked by
the examining radiologist, computer-based detection output can assist the
radiologist to i... |
1002.2184 | The Fast Haar Wavelet Transform for Signal & Image Processing | cs.MM cs.CV | A method for the design of Fast Haar wavelet for signal processing and image
processing has been proposed. In the proposed work, the analysis bank and
synthesis bank of Haar wavelet is modified by using polyphase structure.
Finally, the Fast Haar wavelet was designed and it satisfies alias free and
perfect reconstruc... |
1002.2191 | Vision Based Game Development Using Human Computer Interaction | cs.HC cs.CV cs.MM | A Human Computer Interface (HCI) System for playing games is designed here
for more natural communication with the machines. The system presented here is
a vision-based system for detection of long voluntary eye blinks and
interpretation of blink patterns for communication between man and machine.
This system replace... |
1002.2193 | Using Statistical Moment Invariants and Entropy in Image Retrieval | cs.MM cs.IR | Although content-based image retrieval (CBIR) is not a new subject, it keeps
attracting more and more attention, as the amount of images grow tremendously
due to internet, inexpensive hardware and automation of image acquisition. One
of the applications of CBIR is fetching images from a database. This paper
presents ... |
1002.2195 | Multi Product Inventory Optimization using Uniform Crossover Genetic
Algorithm | cs.NE | Inventory management is considered to be an important field in Supply Chain
Management because the cost of inventories in a supply chain accounts for about
30 percent of the value of the product. The service provided to the customer
eventually gets enhanced once the efficient and effective management of
inventory is ... |
1002.2196 | Efficient Inventory Optimization of Multi Product, Multiple Suppliers
with Lead Time using PSO | cs.NE | With information revolution, increased globalization and competition, supply
chain has become longer and more complicated than ever before. These
developments bring supply chain management to the forefront of the managements
attention. Inventories are very important in a supply chain. The total
investment in inventor... |
1002.2202 | Modeling of Human Criminal Behavior using Probabilistic Networks | cs.AI | Currently, criminals profile (CP) is obtained from investigators or forensic
psychologists interpretation, linking crime scene characteristics and an
offenders behavior to his or her characteristics and psychological profile.
This paper seeks an efficient and systematic discovery of nonobvious and
valuable patterns b... |
1002.2240 | A Generalization of the Chow-Liu Algorithm and its Application to
Statistical Learning | cs.IT cs.AI cs.LG math.IT | We extend the Chow-Liu algorithm for general random variables while the
previous versions only considered finite cases. In particular, this paper
applies the generalization to Suzuki's learning algorithm that generates from
data forests rather than trees based on the minimum description length by
balancing the fitnes... |
1002.2244 | Improved Constructions for Non-adaptive Threshold Group Testing | cs.DM cs.IT math.IT | The basic goal in combinatorial group testing is to identify a set of up to
$d$ defective items within a large population of size $n \gg d$ using a pooling
strategy. Namely, the items can be grouped together in pools, and a single
measurement would reveal whether there are one or more defectives in the pool.
The thre... |
1002.2271 | A Coordinate System for Gaussian Networks | cs.IT math.IT | This paper studies network information theory problems where the external
noise is Gaussian distributed. In particular, the Gaussian broadcast channel
with coherent fading and the Gaussian interference channel are investigated. It
is shown that in these problems, non-Gaussian code ensembles can achieve higher
rates t... |
1002.2283 | Gossip Algorithms for Convex Consensus Optimization over Networks | math.OC cs.DC cs.SY | In many applications, nodes in a network desire not only a consensus, but an
optimal one. To date, a family of subgradient algorithms have been proposed to
solve this problem under general convexity assumptions. This paper shows that,
for the scalar case and by assuming a bit more, novel non-gradient-based
algorithms... |
1002.2293 | On Linear Operator Channels over Finite Fields | cs.IT math.IT | Motivated by linear network coding, communication channels perform linear
operation over finite fields, namely linear operator channels (LOCs), are
studied in this paper. For such a channel, its output vector is a linear
transform of its input vector, and the transformation matrix is randomly and
independently genera... |
1002.2321 | Exploiting Grids for applications in Condensed Matter Physics | cond-mat.mes-hall cond-mat.other cs.CE physics.comp-ph | Grids - the collection of heterogeneous computers spread across the globe -
present a new paradigm for the large scale problems in variety of fields. We
discuss two representative cases in the area of condensed matter physics
outlining the widespread applications of the Grids. Both the problems involve
calculations b... |
1002.2408 | Automatic diagnosis of retinal diseases from color retinal images | cs.CV | Teleophthalmology holds a great potential to improve the quality, access, and
affordability in health care. For patients, it can reduce the need for travel
and provide the access to a superspecialist. Ophthalmology lends itself easily
to telemedicine as it is a largely image based diagnosis. The main goal of the
prop... |
1002.2412 | A Probabilistic Model For Sequence Analysis | q-bio.QM cs.CE | This paper presents a probabilistic approach for DNA sequence analysis. A DNA
sequence consists of an arrangement of the four nucleotides A, C, T and G and
different representation schemes are presented according to a probability
measure associated with them. There are different ways that probability can be
associate... |
1002.2418 | Medical Image Compression using Wavelet Decomposition for Prediction
Method | cs.CV | In this paper offers a simple and lossless compression method for compression
of medical images. Method is based on wavelet decomposition of the medical
images followed by the correlation analysis of coefficients. The correlation
analyses are the basis of prediction equation for each sub band. Predictor
variable sele... |
1002.2425 | Application of k Means Clustering algorithm for prediction of Students
Academic Performance | cs.LG cs.CY | The ability to monitor the progress of students academic performance is a
critical issue to the academic community of higher learning. A system for
analyzing students results based on cluster analysis and uses standard
statistical algorithms to arrange their scores data according to the level of
their performance is ... |
1002.2439 | Using Web Page Titles to Rediscover Lost Web Pages | cs.IR | Titles are denoted by the TITLE element within a web page. We queried the
title against the the Yahoo search engine to determine the page's status
(found, not found). We conducted several tests based on elements of the title.
These tests were used to discern whether we could predict a pages status based
on the title.... |
1002.2450 | Modeling the Probability of Failure on LDAP Binding Operations in
Iplanet Web Proxy 3.6 Server | cs.PF cs.DB | This paper is devoted to the theoretical analysis of a problem derived from
interaction between two Iplanet products: Web Proxy Server and the Directory
Server. In particular, a probabilistic and stochastic-approximation model is
proposed to minimize the occurrence of LDAP connection failures in Iplanet Web
Proxy 3.6... |
1002.2456 | The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic
Codes | cs.IT math.GR math.IT | We give the class of finite groups which arise as the permutation groups of
cyclic codes over finite fields. Furthermore, we extend the results of Brand
and Huffman et al. and we find the properties of the set of permutations by
which two cyclic codes of length p^r can be equivalent. We also find the set of
permutati... |
1002.2488 | Entanglement-assisted zero-error capacity is upper bounded by the Lovasz
theta function | quant-ph cs.IT math.IT | The zero-error capacity of a classical channel is expressed in terms of the
independence number of some graph and its tensor powers. This quantity is hard
to compute even for small graphs such as the cycle of length seven, so upper
bounds such as the Lovasz theta function play an important role in zero-error
communic... |
1002.2514 | Zero-error communication via quantum channels, non-commutative graphs
and a quantum Lovasz theta function | quant-ph cs.IT math.IT math.OA | We study the quantum channel version of Shannon's zero-error capacity
problem. Motivated by recent progress on this question, we propose to consider
a certain operator space as the quantum generalisation of the adjacency matrix,
in terms of which the plain, quantum and entanglement-assisted capacity can be
formulated... |
1002.2523 | Feature Level Fusion of Face and Fingerprint Biometrics | cs.CV cs.AI | The aim of this paper is to study the fusion at feature extraction level for
face and fingerprint biometrics. The proposed approach is based on the fusion
of the two traits by extracting independent feature pointsets from the two
modalities, and making the two pointsets compatible for concatenation.
Moreover, to hand... |
1002.2586 | Blind Compressed Sensing | cs.IT math.IT | The fundamental principle underlying compressed sensing is that a signal,
which is sparse under some basis representation, can be recovered from a small
number of linear measurements. However, prior knowledge of the sparsity basis
is essential for the recovery process. This work introduces the concept of
blind compre... |
1002.2654 | Assessment Of The Wind Farm Impact On The Radar | cs.CV cs.MS | This study shows the means to evaluate the wind farm impact on the radar. It
proposes the set of tools, which can be used to realise this objective. The big
part of report covers the study of complex pattern propagation factor as the
critical issue of the Advanced Propagation Model (APM). Finally, the reader can
find... |
1002.2655 | Multicast Outage Probability and Transmission Capacity of Multihop
Wireless Networks | cs.IT math.IT | Multicast transmission, wherein the same packet must be delivered to multiple
receivers, is an important aspect of sensor and tactical networks and has
several distinctive traits as opposed to more commonly studied unicast
networks. Specially, these include (i) identical packets must be delivered
successfully to seve... |
1002.2677 | Compressed Sensing for Sparse Underwater Channel Estimation: Some
Practical Considerations | stat.AP cs.IT math.IT | We examine the use of a structured thresholding algorithm for sparse
underwater channel estimation using compressed sensing. This method shows some
improvements over standard algorithms for sparse channel estimation such as
matching pursuit, iterative detection and least squares.
|
1002.2720 | Aiming Perfectly in the Dark - Blind Interference Alignment through
Staggered Antenna Switching | cs.IT math.IT | We propose a blind interference alignment scheme for the vector broadcast
channel where the transmitter is equipped with M antennas and there are K
receivers, each equipped with a reconfigurable antenna capable of switching
among M preset modes. Without any knowledge of the channel coefficient values
at the transmitt... |
1002.2755 | Multibiometrics Belief Fusion | cs.CV cs.AI | This paper proposes a multimodal biometric system through Gaussian Mixture
Model (GMM) for face and ear biometrics with belief fusion of the estimated
scores characterized by Gabor responses and the proposed fusion is accomplished
by Dempster-Shafer (DS) decision theory. Face and ear images are convolved with
Gabor w... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.