id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1202.5187
|
Rakshith Rajashekar
|
Rakshith Rajashekar and K.V.S. Hari
|
Sphere Decoding for Spatial Modulation Systems with Arbitrary Nt
|
This paper has been withdrawn by the authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, three Sphere Decoding (SD) algorithms were proposed for Spatial
Modulation (SM) scheme which focus on reducing the transmit-, receive-, and
both transmit and receive-search spaces at the receiver and were termed as
Receiver-centric SD (Rx-SD), Transmitter-centric SD (Tx-SD), and Combined SD
(C-SD) detectors, respectively. The Tx-SD detector was proposed for systems
with Nt \leq Nr, where Nt and Nr are the number of transmit and receive
antennas of the system. In this paper, we show that the existing Tx-SD detector
is not limited to systems with Nt \leq Nr but can be used with systems Nr < Nt
\leq 2Nr - 1 as well. We refer to this detector as the Extended Tx-SD (E-Tx-SD)
detector. Further, we propose an E- Tx-SD based detection scheme for SM systems
with arbitrary Nt by exploiting the Inter-Channel Interference (ICI) free
property of the SM systems. We show with our simulation results that the
proposed detectors are ML-optimal and offer significantly reduced complexity.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2012 14:15:53 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Jan 2013 16:36:40 GMT"
}
] | 2013-01-17T00:00:00 |
[
[
"Rajashekar",
"Rakshith",
""
],
[
"Hari",
"K. V. S.",
""
]
] |
new_dataset
| 0.991711 |
1211.1482
|
Sajid Ali
|
Sajid Ali
|
Gender Recognition in Walk Gait through 3D Motion by Quadratic Bezier
Curve and Statistical Techniques
|
wrongly uploaded
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion capture is the process of recording the movement of objects or people.
It is used in military, entertainment, sports, and medical applications, and
for validation of computer vision[2] and robotics. In filmmaking and video game
development, it refers to recording actions of human actors, and using that
information to animate digital character models in 2D or 3D computer animation.
When it includes face and fingers or captures subtle
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 08:19:04 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jan 2013 02:50:52 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Jan 2013 04:05:00 GMT"
},
{
"version": "v4",
"created": "Wed, 16 Jan 2013 03:05:42 GMT"
}
] | 2013-01-17T00:00:00 |
[
[
"Ali",
"Sajid",
""
]
] |
new_dataset
| 0.994797 |
1301.3644
|
Kye-Hyeon Kim
|
Kye-Hyeon Kim, Rui Cai, Lei Zhang, Seungjin Choi
|
Regularized Discriminant Embedding for Visual Descriptor Learning
|
3 pages + 1 additional page containing only cited references; The
full version of this manuscript is currently under review in an international
journal
| null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Images can vary according to changes in viewpoint, resolution, noise, and
illumination. In this paper, we aim to learn representations for an image,
which are robust to wide changes in such environmental conditions, using
training pairs of matching and non-matching local image patches that are
collected under various environmental conditions. We present a regularized
discriminant analysis that emphasizes two challenging categories among the
given training pairs: (1) matching, but far apart pairs and (2) non-matching,
but close pairs in the original feature space (e.g., SIFT feature space).
Compared to existing work on metric learning and discriminant analysis, our
method can better distinguish relevant images from irrelevant, but look-alike
images.
|
[
{
"version": "v1",
"created": "Wed, 16 Jan 2013 10:12:37 GMT"
}
] | 2013-01-17T00:00:00 |
[
[
"Kim",
"Kye-Hyeon",
""
],
[
"Cai",
"Rui",
""
],
[
"Zhang",
"Lei",
""
],
[
"Choi",
"Seungjin",
""
]
] |
new_dataset
| 0.954776 |
1301.3791
|
Maheswaran Sathiamoorthy
|
Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris
Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba
Borthakur
|
XORing Elephants: Novel Erasure Codes for Big Data
|
Technical report, paper to appear in Proceedings of VLDB, 2013
| null | null | null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems for large clusters typically use replication to
provide reliability. Recently, erasure codes have been used to reduce the large
storage overhead of three-replicated systems. Reed-Solomon codes are the
standard design choice and their high repair cost is often considered an
unavoidable price to pay for high storage efficiency and high reliability.
This paper shows how to overcome this limitation. We present a novel family
of erasure codes that are efficiently repairable and offer higher reliability
compared to Reed-Solomon codes. We show analytically that our codes are optimal
on a recently identified tradeoff between locality and minimum distance.
We implement our new codes in Hadoop HDFS and compare to a currently deployed
HDFS module that uses Reed-Solomon codes. Our modified HDFS implementation
shows a reduction of approximately 2x on the repair disk I/O and repair network
traffic. The disadvantage of the new coding scheme is that it requires 14% more
storage compared to Reed-Solomon codes, an overhead shown to be information
theoretically optimal to obtain locality. Because the new codes repair failures
faster, this provides higher reliability, which is orders of magnitude higher
compared to replication.
|
[
{
"version": "v1",
"created": "Wed, 16 Jan 2013 18:51:15 GMT"
}
] | 2013-01-17T00:00:00 |
[
[
"Sathiamoorthy",
"Maheswaran",
""
],
[
"Asteris",
"Megasthenis",
""
],
[
"Papailiopoulos",
"Dimitris",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Vadali",
"Ramkumar",
""
],
[
"Chen",
"Scott",
""
],
[
"Borthakur",
"Dhruba",
""
]
] |
new_dataset
| 0.999031 |
1301.3220
|
Tang Li
|
Qin Huang, Li Tang, Zulin Wang, Zixiang Xiong and Shanbao He
|
A Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier
Transform
|
8 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The encoding complexity of a general (en,ek) quasi-cyclic code is
O[(e^2)(n-k)k]. This paper presents a novel low-complexity encoding algorithm
for quasi-cyclic (QC) codes based on matrix transformation. First, a message
vector is encoded into a transformed codeword in the transform domain. Then,
the transmitted codeword is obtained from the transformed codeword by the
inverse Galois Fourier transform. For binary QC codes, a simple and fast
mapping is required to post-process the transformed codeword such that the
transmitted codeword is binary as well. The complexity of our proposed encoding
algorithm is O[e(n-k)k] symbol operations for non-binary codes and
O[ek(n-k)(log_2 e)] bit operations for binary codes. These complexities are
much lower than their traditional counterpart O[(e^2)(n-k)k]. For example, our
complexity of encoding a 64-ary (4095,2160) QC code is only 1.59% of that of
traditional encoding, and our complexities of encoding the binary (4095, 2160)
and (8176, 7154) QC codes are respectively 9.52% and 1.77% of those of
traditional encoding. We also study the application of our low-complexity
encoding algorithm to one of the most important subclasses of QC codes, namely
QC-LDPC codes, especially when their parity-check matrices are rank deficient.
|
[
{
"version": "v1",
"created": "Tue, 15 Jan 2013 04:18:52 GMT"
}
] | 2013-01-16T00:00:00 |
[
[
"Huang",
"Qin",
""
],
[
"Tang",
"Li",
""
],
[
"Wang",
"Zulin",
""
],
[
"Xiong",
"Zixiang",
""
],
[
"He",
"Shanbao",
""
]
] |
new_dataset
| 0.994275 |
1301.3258
|
Omar Khadir
|
Omar Khadir
|
New variant of ElGamal signature scheme
| null |
Int. Contemp. Math. Sciences, Vol. 5, 2010, no 34, pp.1653-1662
| null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new variant of ElGamal signature scheme is presented and its
security analyzed. We also give, for its theoretical interest, a general form
of the signature equation.
|
[
{
"version": "v1",
"created": "Tue, 15 Jan 2013 08:32:55 GMT"
}
] | 2013-01-16T00:00:00 |
[
[
"Khadir",
"Omar",
""
]
] |
new_dataset
| 0.996496 |
1212.4930
|
Anatolii Leukhin Nikolaevich
|
Anatolii Leukhin, Egor Potehin
|
Binary Sequences with Minimum Peak Sidelobe Level up to Length 68
|
10 pages, 3figures,2 tables, submitting to International Worksho on
Coding and Crypography, WCC 2013, April 15-19, 2013, Bergen, Norway
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Results of an exhaustive search for minimum peak sidelobe level binary
sequences are presented. Several techniques for efficiency implementation of
search algorithm are described. A table of number of non-equivalent optimal
binary sequences with minimum peak sidelobe (MPS) level up to length 68 is
given. This number can be used in prediction of the longest length for a given
sidelobe level of binary sequences. The examples of optimal binary MPS
sequences having high merit factor are shown.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 05:58:39 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Leukhin",
"Anatolii",
""
],
[
"Potehin",
"Egor",
""
]
] |
new_dataset
| 0.994831 |
1301.2626
|
Damien Woods
|
Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik
Winfree, Peng Yin
|
Active Self-Assembly of Algorithmic Shapes and Patterns in
Polylogarithmic Time
| null | null | null | null |
cs.DS cs.CC cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a computational model for studying the complexity of
self-assembled structures with active molecular components. Our model captures
notions of growth and movement ubiquitous in biological systems. The model is
inspired by biology's fantastic ability to assemble biomolecules that form
systems with complicated structure and dynamics, from molecular motors that
walk on rigid tracks and proteins that dynamically alter the structure of the
cell during mitosis, to embryonic development where large-scale complicated
organisms efficiently grow from a single cell. Using this active self-assembly
model, we show how to efficiently self-assemble shapes and patterns from simple
monomers. For example, we show how to grow a line of monomers in time and
number of monomer states that is merely logarithmic in the length of the line.
Our main results show how to grow arbitrary connected two-dimensional
geometric shapes and patterns in expected time that is polylogarithmic in the
size of the shape, plus roughly the time required to run a Turing machine
deciding whether or not a given pixel is in the shape. We do this while keeping
the number of monomer types logarithmic in shape size, plus those monomers
required by the Kolmogorov complexity of the shape or pattern. This work thus
highlights the efficiency advantages of active self-assembly over passive
self-assembly and motivates experimental effort to construct general-purpose
active molecular self-assembly systems.
|
[
{
"version": "v1",
"created": "Fri, 11 Jan 2013 23:01:15 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Woods",
"Damien",
""
],
[
"Chen",
"Ho-Lin",
""
],
[
"Goodfriend",
"Scott",
""
],
[
"Dabby",
"Nadine",
""
],
[
"Winfree",
"Erik",
""
],
[
"Yin",
"Peng",
""
]
] |
new_dataset
| 0.980156 |
1301.2711
|
Ahmed Rhif
|
Ahmed Rhif, Zohra Kardous, Naceur BenHadj Braiek
|
A Sliding Mode Multimodel Control for a Sensorless Photovoltaic System
| null | null | null | null |
cs.SY hep-ex
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we will talk about a new control test using the sliding mode
control with a nonlinear sliding mode observer, which are very solicited in
tracking problems, for a sensorless photovoltaic panel. In this case, the panel
system will has as a set point the sun position at every second during the day
for a period of five years; then the tracker, using sliding mode multimodel
controller and a sliding mode observer, will track these positions to make the
sunrays orthogonal to the photovoltaic cell that produces more energy. After
sunset, the tracker goes back to the initial position (which of sunrise).
Experimental measurements show that this autonomic dual axis Sun Tracker
increases the power production by over 40%.
|
[
{
"version": "v1",
"created": "Sat, 12 Jan 2013 19:49:11 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Rhif",
"Ahmed",
""
],
[
"Kardous",
"Zohra",
""
],
[
"Braiek",
"Naceur BenHadj",
""
]
] |
new_dataset
| 0.997496 |
1301.2780
|
Joydeep Basu
|
Joydeep Basu and Tarun Kanti Bhattacharyya
|
Microelectromechanical Resonators for Radio Frequency Communication
Applications
| null |
Microsystem Technologies, Oct 2011, vol. 17(10-11), pp. 1557-1580
|
10.1007/s00542-011-1332-9
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past few years, microelectromechanical system (MEMS) based on-chip
resonators have shown significant potential for sensing and high frequency
signal processing applications. This is due to their excellent features like
small size, large frequency-quality factor product, low power consumption, low
cost batch fabrication, and integrability with CMOS IC technology. Radio
frequency communication circuits like reference oscillators, filters, and
mixers based on such MEMS resonators can be utilized for meeting the increasing
count of RF components likely to be demanded by the next generation
multi-band/multi-mode wireless devices. MEMS resonators can provide a feasible
alternative to the present day well established quartz crystal technology that
is riddled with major drawbacks like relatively large size, high cost, and low
compatibility with IC chips. This article presents a survey of the developments
in this field of resonant MEMS structures with detailed enumeration on the
various micromechanical resonator types, modes of vibration, equivalent
mechanical and electrical models, materials and technologies used for
fabrication, and the application of the resonators for implementing oscillators
and filters. These are followed by a discussion on the challenges for RF MEMS
technology in comparison to quartz crystal technology; like high precision,
stability, reliability, need for hermetic packaging etc. which remain to be
addressed for enabling the inclusion of micromechanical resonators into
tomorrow's highly integrated communication systems.
|
[
{
"version": "v1",
"created": "Sun, 13 Jan 2013 14:38:35 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Basu",
"Joydeep",
""
],
[
"Bhattacharyya",
"Tarun Kanti",
""
]
] |
new_dataset
| 0.996142 |
1301.2857
|
Rami Al-Rfou'
|
Rami Al-Rfou' and Steven Skiena
|
SpeedRead: A Fast Named Entity Recognition Pipeline
|
Long paper at COLING 2012
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online content analysis employs algorithmic methods to identify entities in
unstructured text. Both machine learning and knowledge-base approaches lie at
the foundation of contemporary named entities extraction systems. However, the
progress in deploying these approaches on web-scale has been been hampered by
the computational cost of NLP over massive text corpora. We present SpeedRead
(SR), a named entity recognition pipeline that runs at least 10 times faster
than Stanford NLP pipeline. This pipeline consists of a high performance Penn
Treebank- compliant tokenizer, close to state-of-art part-of-speech (POS)
tagger and knowledge-based named entity recognizer.
|
[
{
"version": "v1",
"created": "Mon, 14 Jan 2013 04:01:25 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Al-Rfou'",
"Rami",
""
],
[
"Skiena",
"Steven",
""
]
] |
new_dataset
| 0.957267 |
1301.2884
|
Anh Cat Le Ngo
|
Anh Cat Le Ngo, Kenneth Li-Minn Ang, Jasmine Kah-Phooi Seng, Guoping
Qiu
|
Wavelet-based Scale Saliency
|
Partly published in ACIIDS 2013 - Kuala Lumpur Malaysia
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Both pixel-based scale saliency (PSS) and basis project methods focus on
multiscale analysis of data content and structure. Their theoretical relations
and practical combination are previously discussed. However, no models have
ever been proposed for calculating scale saliency on basis-projected
descriptors since then. This paper extend those ideas into mathematical models
and implement them in the wavelet-based scale saliency (WSS). While PSS uses
pixel-value descriptors, WSS treats wavelet sub-bands as basis descriptors. The
paper discusses different wavelet descriptors: discrete wavelet transform
(DWT), wavelet packet transform (DWPT), quaternion wavelet transform (QWT) and
best basis quaternion wavelet packet transform (QWPTBB). WSS saliency maps of
different descriptors are generated and compared against other saliency methods
by both quantitative and quanlitative methods. Quantitative results, ROC
curves, AUC values and NSS values are collected from simulations on Bruce and
Kootstra image databases with human eye-tracking data as ground-truth.
Furthermore, qualitative visual results of saliency maps are analyzed and
compared against each other as well as eye-tracking data inclusive in the
databases.
|
[
{
"version": "v1",
"created": "Mon, 14 Jan 2013 08:36:00 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Ngo",
"Anh Cat Le",
""
],
[
"Ang",
"Kenneth Li-Minn",
""
],
[
"Seng",
"Jasmine Kah-Phooi",
""
],
[
"Qiu",
"Guoping",
""
]
] |
new_dataset
| 0.999514 |
1301.3047
|
Jan Blech
|
Jan Olaf Blech and Sidi Ould Biha
|
On Formal Reasoning on the Semantics of PLC using Coq
|
arXiv admin note: text overlap with arXiv:1102.3529
| null | null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Programmable Logic Controllers (PLC) and its programming standard IEC 61131-3
are widely used in embedded systems for the industrial automation domain. We
propose a framework for the formal treatment of PLC based on the IEC 61131-3
standard. A PLC system description typically combines code written in different
languages that are defined in IEC 61131-3. For the top-level specification we
regard the Sequential Function Charts (SFC) language, a graphical high-level
language that allows to describe the main control-flow of the system. In
addition to this, we describe the Instruction List (IL) language -- an assembly
like language -- and two other graphical languages: Ladder Diagrams (LD) and
Function Block Diagrams (FBD). IL, LD, and FBD are used to describe more low
level structures of a PLC. We formalize the semantics of these languages and
describe and prove relations between them. Formalization and associated proofs
are carried out using the proof assistant Coq. In addition to this, we present
work on a tool for automatically generating SFC representations from a
graphical description -- the IL and LD languages can be handled in Coq directly
-- and its usage for verification purposes. We sketch possible usages of our
formal framework, and present an example application for a PLC in a project
demonstrator and prove safety properties.
|
[
{
"version": "v1",
"created": "Mon, 14 Jan 2013 16:40:31 GMT"
}
] | 2013-01-15T00:00:00 |
[
[
"Blech",
"Jan Olaf",
""
],
[
"Biha",
"Sidi Ould",
""
]
] |
new_dataset
| 0.994703 |
1301.2506
|
Yngve Villanger
|
Jan Arne Telle and Yngve Villanger
|
Connecting Terminals and 2-Disjoint Connected Subgraphs
|
13 pages, 1 figure
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph $G=(V,E)$ and a set of terminal vertices $T$ we say that a
superset $S$ of $T$ is $T$-connecting if $S$ induces a connected graph, and $S$
is minimal if no strict subset of $S$ is $T$-connecting. In this paper we prove
that there are at most ${|V \setminus T| \choose |T|-2} \cdot 3^{\frac{|V
\setminus T|}{3}}$ minimal $T$-connecting sets when $|T| \leq n/3$ and that
these can be enumerated within a polynomial factor of this bound. This
generalizes the algorithm for enumerating all induced paths between a pair of
vertices, corresponding to the case $|T|=2$. We apply our enumeration algorithm
to solve the {\sc 2-Disjoint Connected Subgraphs} problem in time
$O^*(1.7804^n)$, improving on the recent $O^*(1.933^n)$ algorithm of Cygan et
al. 2012 LATIN paper.
|
[
{
"version": "v1",
"created": "Fri, 11 Jan 2013 14:27:13 GMT"
}
] | 2013-01-14T00:00:00 |
[
[
"Telle",
"Jan Arne",
""
],
[
"Villanger",
"Yngve",
""
]
] |
new_dataset
| 0.99775 |
1006.2498
|
Sirin Nitinawarat
|
Sirin Nitinawarat
|
On the Deterministic Code Capacity Region of an Arbitrarily Varying
Multiple-Access Channel Under List Decoding
|
Accepted to the IEEE Transactions on Information Theory, January 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the capacity region $C_L$ of an arbitrarily varying multiple-access
channel (AVMAC) for deterministic codes with decoding into a list of a fixed
size $L$ and for the average error probability criterion. Motivated by known
results in the study of fixed size list decoding for a point-to-point
arbitrarily varying channel, we define for every AVMAC whose capacity region
for random codes has a nonempty interior, a nonnegative integer $\Omega$ called
its symmetrizability. It is shown that for every $L \leq \Omega$, $C_L$ has an
empty interior, and for every $L \geq (\Omega+1)^2$, $C_L$ equals the
nondegenerate capacity region of the AVMAC for random codes with a known
single-letter characterization. For a binary AVMAC with a nondegenerate random
code capacity region, it is shown that the symmetrizability is always finite.
|
[
{
"version": "v1",
"created": "Sat, 12 Jun 2010 22:36:12 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Jan 2013 16:30:36 GMT"
}
] | 2013-01-11T00:00:00 |
[
[
"Nitinawarat",
"Sirin",
""
]
] |
new_dataset
| 0.98458 |
1301.2010
|
Maheswara Rao Valluri
|
Maheswara Rao Valluri (School of Mathematical and Computing Sciences,
Fiji National University, Derrick Campus, Suva, Fiji)
|
Authentication Schemes Using Polynomials Over Non-Commutative Rings
|
International Journal on Cryptography and Information Security
(IJCIS),Vol.2, No.4, December 2012
| null |
10.5121/ijcis.2012.2406
| null |
cs.CR math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Authentication is a process by which an entity,which could be a person or
intended computer,establishes its identity to another entity.In private and
public computer networks including the Internet,authentication is commonly done
through the use of logon passwords. Knowledge of the password is assumed to
guarantee that the user is authentic.Internet business and many other
transactions require a more stringent authentication process. The aim of this
paper is to propose two authentication schemes based on general non-commutative
rings. The key idea of the schemes is that for a given non-commutative ring;
one can build polynomials on additive structure and takes them as underlying
work structure. By doing so, one can implement authentication schemes, one of
them being zero-knowledge interactive proofs of knowledge, on multiplicative
structure of the ring. The security of the schemes is based on the
intractability of the polynomial symmetrical decomposition problem over the
given non-commutative ring.
|
[
{
"version": "v1",
"created": "Thu, 10 Jan 2013 00:23:35 GMT"
}
] | 2013-01-11T00:00:00 |
[
[
"Valluri",
"Maheswara Rao",
"",
"School of Mathematical and Computing Sciences,\n Fiji National University, Derrick Campus, Suva, Fiji"
]
] |
new_dataset
| 0.998877 |
1301.2092
|
Marek Szyku{\l}a
|
Jakub Kowalski, Marek Szyku{\l}a
|
The \v{C}ern\'{y} conjecture for small automata: experimental report
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a report from a series of experiments involving computation of the
shortest reset words for automata with small number of states. We confirm that
the \v{C}ern\'{y} conjecture is true for all automata with at most 11 states on
2 letters. Also some new interesting results were obtained, including the third
gap in the distribution of the shortest reset words and new slowly
synchronizing classes of automata.
|
[
{
"version": "v1",
"created": "Thu, 10 Jan 2013 11:38:28 GMT"
}
] | 2013-01-11T00:00:00 |
[
[
"Kowalski",
"Jakub",
""
],
[
"Szykuła",
"Marek",
""
]
] |
new_dataset
| 0.999695 |
1301.2146
|
Xiaowang Zhang
|
Xiaowang Zhang and Guohui Xiao and Zuoquan Lin
|
A Paraconsistent Tableau Algorithm Based on Sign Transformation in
Semantic Web
|
11 pages, in Chinese; the 4th Chinese Semantic Web Symposium (CSWS
2010), Beijing, China
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an open, constantly changing and collaborative environment like the
forthcoming Semantic Web, it is reasonable to expect that knowledge sources
will contain noise and inaccuracies. It is well known, as the logical
foundation of the Semantic Web, description logic is lack of the ability of
tolerating inconsistent or incomplete data. Recently, the ability of
paraconsistent approaches in Semantic Web is weaker in this paper, we present a
tableau algorithm based on sign transformation in Semantic Web which holds the
stronger ability of reasoning. We prove that the tableau algorithm is decidable
which hold the same function of classical tableau algorithm for consistent
knowledge bases.
|
[
{
"version": "v1",
"created": "Thu, 10 Jan 2013 15:07:22 GMT"
}
] | 2013-01-11T00:00:00 |
[
[
"Zhang",
"Xiaowang",
""
],
[
"Xiao",
"Guohui",
""
],
[
"Lin",
"Zuoquan",
""
]
] |
new_dataset
| 0.998845 |
1208.3390
|
Chengwen Xing
|
Chengwen Xing, Zesong Fei, Shaodan Ma, Jingming Kuang, and Yik-Chung
Wu
|
A Unified Linear MSE Minimization MIMO Beamforming Design Based on
Quadratic Matrix Programming
|
6 Pages WCSP 2012 Final Version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate a unified linear transceiver design with
mean-square-error (MSE) as the objective function for a wide range of wireless
systems. The unified design is based on an elegant mathematical programming
technology namely quadratic matrix programming (QMP). It is revealed that for
different wireless systems such as multi-cell coordination systems, multi-user
MIMO systems, MIMO cognitive radio systems, amplify-and-forward MIMO relaying
systems, the MSE minimization beamforming design problems can always be solved
by solving a number of QMP problems. A comprehensive framework on how to solve
QMP problems is also given.
|
[
{
"version": "v1",
"created": "Thu, 16 Aug 2012 15:08:01 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Sep 2012 03:38:59 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Jan 2013 11:11:41 GMT"
}
] | 2013-01-10T00:00:00 |
[
[
"Xing",
"Chengwen",
""
],
[
"Fei",
"Zesong",
""
],
[
"Ma",
"Shaodan",
""
],
[
"Kuang",
"Jingming",
""
],
[
"Wu",
"Yik-Chung",
""
]
] |
new_dataset
| 0.950392 |
1301.1722
|
Andrea Montanari
|
Yash Deshpande and Andrea Montanari
|
Linear Bandits in High Dimension and Recommendation Systems
|
21 pages, 4 figures
| null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A large number of online services provide automated recommendations to help
users to navigate through a large collection of items. New items (products,
videos, songs, advertisements) are suggested on the basis of the user's past
history and --when available-- her demographic profile. Recommendations have to
satisfy the dual goal of helping the user to explore the space of available
items, while allowing the system to probe the user's preferences.
We model this trade-off using linearly parametrized multi-armed bandits,
propose a policy and prove upper and lower bounds on the cumulative "reward"
that coincide up to constants in the data poor (high-dimensional) regime. Prior
work on linear bandits has focused on the data rich (low-dimensional) regime
and used cumulative "risk" as the figure of merit. For this data rich regime,
we provide a simple modification for our policy that achieves near-optimal risk
performance under more restrictive assumptions on the geometry of the problem.
We test (a variation of) the scheme used for establishing achievability on the
Netflix and MovieLens datasets and obtain good agreement with the qualitative
predictions of the theory we develop.
|
[
{
"version": "v1",
"created": "Tue, 8 Jan 2013 23:45:06 GMT"
}
] | 2013-01-10T00:00:00 |
[
[
"Deshpande",
"Yash",
""
],
[
"Montanari",
"Andrea",
""
]
] |
new_dataset
| 0.963682 |
1301.1746
|
Yulong Shen
|
Yulong Shen, Xiaohong Jiang and Jianfeng Ma
|
Generalized Secure Transmission Protocol for Flexible Load-Balance
Control with Cooperative Relays in Two-Hop Wireless Networks
|
15 pages, 2 figures. arXiv admin note: substantial text overlap with
arXiv:1212.0287, arXiv:1212.6627, arXiv:1211.7075
| null | null | null |
cs.CR cs.IT cs.NI math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
This work considers secure transmission protocol for flexible load-balance
control in two-hop relay wireless networks without the information of both
eavesdropper channels and locations. The available secure transmission
protocols via relay cooperation in physical layer secrecy framework cannot
provide a flexible load-balance control, which may significantly limit their
application scopes. This paper extends the conventional works and proposes a
general transmission protocol with considering load-balance control, in which
the relay is randomly selected from the first $k$ preferable assistant relays
located in the circle area with the radius $r$ and the center at the middle
between source and destination (2HR-($r,k$) for short). This protocol covers
the available works as special cases, like ones with the optimal relay
selection ($r=\infty$, $k=1$) and with the random relay selection ($r=\infty$,
$k = n$ i.e. the number of system nodes) in the case of equal path-loss, ones
with relay selected from relay selection region ($r \in (0, \infty), k = 1$) in
the case of distance-dependent path-loss. The theoretic analysis is further
provided to determine the maximum number of eavesdroppers one network can
tolerate to ensure a desired performance in terms of the secrecy outage
probability and transmission outage probability. The analysis results also show
the proposed protocol can balance load distributed among the relays by a proper
setting of $r$ and $k$ under the premise of specified secure and reliable
requirements.
|
[
{
"version": "v1",
"created": "Wed, 9 Jan 2013 03:21:23 GMT"
}
] | 2013-01-10T00:00:00 |
[
[
"Shen",
"Yulong",
""
],
[
"Jiang",
"Xiaohong",
""
],
[
"Ma",
"Jianfeng",
""
]
] |
new_dataset
| 0.980133 |
1203.3282
|
Harshan Jagadeesh
|
J. Harshan, Emanuele Viterbo, Jean-Claude Belfiore
|
Practical Encoders and Decoders for Euclidean Codes from Barnes-Wall
Lattices
|
30 pages with 10 figures and 1 table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the design of high spectral-efficiency Barnes-Wall
(BW) lattice codes which are amenable to low-complexity decoding in additive
white Gaussian noise (AWGN) channels. We propose a new method of constructing
complex BW lattice codes from linear codes over polynomial rings, and show that
the proposed construction provides an explicit method of bit-labeling complex
BW lattice codes. To decode the code, we adapt the low-complexity sequential BW
lattice decoder (SBWD) recently proposed by Micciancio and Nicolosi. First, we
study the error performance of SBWD in decoding the infinite lattice, wherein
we analyze the noise statistics in the algorithm, and propose a new upper bound
on its error performance. We show that the SBWD is powerful in making correct
decisions well beyond the packing radius. Subsequently, we use the SBWD to
decode lattice codes through a novel noise-trimming technique. This is the
first work that showcases the error performance of SBWD in decoding BW lattice
codes of large block lengths.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2012 07:24:46 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Mar 2012 07:03:33 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Jan 2013 01:12:23 GMT"
}
] | 2013-01-09T00:00:00 |
[
[
"Harshan",
"J.",
""
],
[
"Viterbo",
"Emanuele",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.997571 |
1301.1374
|
Rituparna Sarkar
|
R. Sarkar, S. Das and N. Vaswani
|
PaFiMoCS: Particle Filtered Modified-CS and Applications in Visual
Tracking across Illumination Change
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of tracking (causally estimating) a time sequence of
sparse spatial signals with changing sparsity patterns, as well as other
unknown states, from a sequence of nonlinear observations corrupted by
(possibly) non-Gaussian noise. In many applications, particularly those in
visual tracking, the unknown state can be split into a small dimensional part,
e.g. global motion, and a spatial signal, e.g. illumination or shape
deformation. The spatial signal is often well modeled as being sparse in some
domain. For a long sequence, its sparsity pattern can change over time,
although the changes are usually slow. To address the above problem, we propose
a novel solution approach called Particle Filtered Modified-CS (PaFiMoCS). The
key idea of PaFiMoCS is to importance sample for the small dimensional state
vector, while replacing importance sampling by slow sparsity pattern change
constrained posterior mode tracking for recovering the sparse spatial signal.
We show that the problem of tracking moving objects across spatially varying
illumination change is an example of the above problem and explain how to
design PaFiMoCS for it. Experiments on both simulated data as well as on real
videos with significant illumination changes demonstrate the superiority of the
proposed algorithm as compared with existing particle filter based tracking
algorithms.
|
[
{
"version": "v1",
"created": "Tue, 8 Jan 2013 01:18:21 GMT"
}
] | 2013-01-09T00:00:00 |
[
[
"Sarkar",
"R.",
""
],
[
"Das",
"S.",
""
],
[
"Vaswani",
"N.",
""
]
] |
new_dataset
| 0.950445 |
0812.4346
|
Marcin Kami\'nski
|
Marcin Kaminski, Paul Medvedev, Martin Milanic
|
The Plane-Width of Graphs
| null |
Journal of Graph Theory 68 (2011) 229-245
|
10.1002/jgt.20554
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Map vertices of a graph to (not necessarily distinct) points of the plane so
that two adjacent vertices are mapped at least a unit distance apart. The
plane-width of a graph is the minimum diameter of the image of the vertex set
over all such mappings. We establish a relation between the plane-width of a
graph and its chromatic number, and connect it to other well-known areas,
including the circular chromatic number and the problem of packing unit discs
in the plane. We also investigate how plane-width behaves under various
operations, such as homomorphism, disjoint union, complement, and the Cartesian
product.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2008 07:49:12 GMT"
}
] | 2013-01-08T00:00:00 |
[
[
"Kaminski",
"Marcin",
""
],
[
"Medvedev",
"Paul",
""
],
[
"Milanic",
"Martin",
""
]
] |
new_dataset
| 0.99974 |
1102.2413
|
Gadiel Seroussi
|
Fr\'ed\'erique Bassino, Julien Cl\'ement, Gadiel Seroussi, Alfredo
Viola
|
Optimal prefix codes for pairs of geometrically-distributed random
variables
|
To appear in IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optimal prefix codes are studied for pairs of independent, integer-valued
symbols emitted by a source with a geometric probability distribution of
parameter $q$, $0{<}q{<}1$. By encoding pairs of symbols, it is possible to
reduce the redundancy penalty of symbol-by-symbol encoding, while preserving
the simplicity of the encoding and decoding procedures typical of Golomb codes
and their variants. It is shown that optimal codes for these so-called
two-dimensional geometric distributions are \emph{singular}, in the sense that
a prefix code that is optimal for one value of the parameter $q$ cannot be
optimal for any other value of $q$. This is in sharp contrast to the
one-dimensional case, where codes are optimal for positive-length intervals of
the parameter $q$. Thus, in the two-dimensional case, it is infeasible to give
a compact characterization of optimal codes for all values of the parameter
$q$, as was done in the one-dimensional case. Instead, optimal codes are
characterized for a discrete sequence of values of $q$ that provide good
coverage of the unit interval. Specifically, optimal prefix codes are described
for $q=2^{-1/k}$ ($k\ge 1$), covering the range $q\ge 1/2$, and $q=2^{-k}$
($k>1$), covering the range $q<1/2$. The described codes produce the expected
reduction in redundancy with respect to the one-dimensional case, while
maintaining low complexity coding operations.
|
[
{
"version": "v1",
"created": "Fri, 11 Feb 2011 19:01:58 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Jan 2013 19:24:33 GMT"
}
] | 2013-01-08T00:00:00 |
[
[
"Bassino",
"Frédérique",
""
],
[
"Clément",
"Julien",
""
],
[
"Seroussi",
"Gadiel",
""
],
[
"Viola",
"Alfredo",
""
]
] |
new_dataset
| 0.999663 |
1104.4874
|
Jan Treibig
|
Jan Treibig, Georg Hager, and Gerhard Wellein
|
LIKWID: Lightweight Performance Tools
|
12 pages
| null |
10.1109/ICPPW.2010.38
| null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exploiting the performance of today's microprocessors requires intimate
knowledge of the microarchitecture as well as an awareness of the ever-growing
complexity in thread and cache topology. LIKWID is a set of command line
utilities that addresses four key problems: Probing the thread and cache
topology of a shared-memory node, enforcing thread-core affinity on a program,
measuring performance counter metrics, and microbenchmarking for reliable upper
performance bounds. Moreover, it includes a mpirun wrapper allowing for
portable thread-core affinity in MPI and hybrid MPI/threaded applications. To
demonstrate the capabilities of the tool set we show the influence of thread
affinity on performance using the well-known OpenMP STREAM triad benchmark, use
hardware counter tools to study the performance of a stencil code, and finally
show how to detect bandwidth problems on ccNUMA-based compute nodes.
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2011 09:43:46 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Jan 2013 09:03:29 GMT"
}
] | 2013-01-08T00:00:00 |
[
[
"Treibig",
"Jan",
""
],
[
"Hager",
"Georg",
""
],
[
"Wellein",
"Gerhard",
""
]
] |
new_dataset
| 0.990847 |
1301.0997
|
Perrot K\'evin
|
K\'evin Perrot and Eric R\'emila
|
Kadanoff Sand Piles, following the snowball
|
Research report. 26 pages, 9 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is about cubic sand grains moving around on nicely packed columns
in one dimension (the physical sand pile is two dimensional, but the support of
sand columns is one dimensional). The Kadanoff Sand Pile Model is a discrete
dynamical system describing the evolution of a finite number of stacked grains
--as they would fall from an hourglass-- to a stable configuration. Grains move
according to the repeated application of a simple local rule until reaching a
stable configuration from which no rule can be applied, namely a fixed point.
The main interest of the model relies in the difficulty of understanding its
behavior, despite the simplicity of the rule. We are interested in describing
the shape of fixed point configurations according to the number of initially
stacked sand grains. In this paper, we prove the emergence of a wavy shape on
fixed points, i.e., a regular pattern is (nearly) periodically repeated on
fixed points. Interestingly, the regular pattern does not cover the entire
fixed point, but eventually emerges from a seemingly highly disordered segment.
Fortunately, the relative size of the part of fixed points non-covered by the
pattern repetition is asymptotically null.
|
[
{
"version": "v1",
"created": "Sun, 6 Jan 2013 11:57:32 GMT"
}
] | 2013-01-08T00:00:00 |
[
[
"Perrot",
"Kévin",
""
],
[
"Rémila",
"Eric",
""
]
] |
new_dataset
| 0.998962 |
1301.0669
|
Guanghui Zhang
|
Guanghui Zhang, Bocong Chen
|
Constacyclic Codes over $F_p+vF_p$
|
12 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study constacyclic codes over $F_p+vF_p$, where $p$ is an
odd prime and $v^2=v$. The polynomial generators of all constacyclic codes over
$F_p+vF_p$ are characterized and their dual codes are also determined.
|
[
{
"version": "v1",
"created": "Fri, 4 Jan 2013 04:02:13 GMT"
}
] | 2013-01-07T00:00:00 |
[
[
"Zhang",
"Guanghui",
""
],
[
"Chen",
"Bocong",
""
]
] |
new_dataset
| 0.999647 |
1301.0725
|
Mathieu Senelle
|
Mathieu Senelle, Silvia Garcia-Diez, Amin Mantrach, Masashi Shimbo,
Marco Saerens, Fran\c{c}ois Fouss
|
The Sum-over-Forests density index: identifying dense regions in a graph
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work introduces a novel nonparametric density index defined on graphs,
the Sum-over-Forests (SoF) density index. It is based on a clear and intuitive
idea: high-density regions in a graph are characterized by the fact that they
contain a large amount of low-cost trees with high outdegrees while low-density
regions contain few ones. Therefore, a Boltzmann probability distribution on
the countable set of forests in the graph is defined so that large (high-cost)
forests occur with a low probability while short (low-cost) forests occur with
a high probability. Then, the SoF density index of a node is defined as the
expected outdegree of this node in a non-trivial tree of the forest, thus
providing a measure of density around that node. Following the matrix-forest
theorem, and a statistical physics framework, it is shown that the SoF density
index can be easily computed in closed form through a simple matrix inversion.
Experiments on artificial and real data sets show that the proposed index
performs well on finding dense regions, for graphs of various origins.
|
[
{
"version": "v1",
"created": "Fri, 4 Jan 2013 13:56:25 GMT"
}
] | 2013-01-07T00:00:00 |
[
[
"Senelle",
"Mathieu",
""
],
[
"Garcia-Diez",
"Silvia",
""
],
[
"Mantrach",
"Amin",
""
],
[
"Shimbo",
"Masashi",
""
],
[
"Saerens",
"Marco",
""
],
[
"Fouss",
"François",
""
]
] |
new_dataset
| 0.954045 |
1301.0748
|
Dominik Charousset
|
Dominik Charousset, Thomas C. Schmidt
|
libcppa - Designing an Actor Semantic for C++11
|
10 pages
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parallel hardware makes concurrency mandatory for efficient program
execution. However, writing concurrent software is both challenging and
error-prone. C++11 provides standard facilities for multiprogramming, such as
atomic operations with acquire/release semantics and RAII mutex locking, but
these primitives remain too low-level. Using them both correctly and
efficiently still requires expert knowledge and hand-crafting. The actor model
replaces implicit communication by sharing with an explicit message passing
mechanism. It applies to concurrency as well as distribution, and a lightweight
actor model implementation that schedules all actors in a properly
pre-dimensioned thread pool can outperform equivalent thread-based
applications. However, the actor model did not enter the domain of native
programming languages yet besides vendor-specific island solutions. With the
open source library libcppa, we want to combine the ability to build reliable
and distributed systems provided by the actor model with the performance and
resource-efficiency of C++11.
|
[
{
"version": "v1",
"created": "Fri, 4 Jan 2013 15:23:43 GMT"
}
] | 2013-01-07T00:00:00 |
[
[
"Charousset",
"Dominik",
""
],
[
"Schmidt",
"Thomas C.",
""
]
] |
new_dataset
| 0.959527 |
1301.0759
|
Paul Poncet
|
Paul Poncet
|
Pruning a poset with veins
|
8 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We recall some abstract connectivity concepts, and apply them to special
chains in partially ordered sets, called veins, that are defined as
order-convex chains that are contained in every maximal chain they meet. Veins
enable us to define a new partial order on the same underlying set, called the
pruning order. The associated pruned poset is simpler than the initial poset,
but irreducible, coirreducible, and doubly-irreducible elements are preserved
by the operation of pruning.
|
[
{
"version": "v1",
"created": "Fri, 4 Jan 2013 17:02:41 GMT"
}
] | 2013-01-07T00:00:00 |
[
[
"Poncet",
"Paul",
""
]
] |
new_dataset
| 0.994671 |
1209.1260
|
Loet Leydesdorff
|
Fred Y. Ye, Susan S. Yu, Loet Leydesdorff
|
The Triple Helix of University-Industry-Government Relations at the
Country Level, and Its Dynamic Evolution under the Pressures of Globalization
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using data from the Web of Science (WoS), we analyze the mutual information
among university, industrial, and governmental addresses (U-I-G) at the country
level for a number of countries. The dynamic evolution of the Triple Helix can
thus be compared among developed and developing nations in terms of
cross-sectorial co-authorship relations. The results show that the Triple-Helix
interactions among the three subsystems U-I-G become less intensive over time,
but unequally for different countries. We suggest that globalization erodes
local Triple-Helix relations and thus can be expected to increase
differentiation in national systems since the mid-1990s. This effect of
globalization is more pronounced in developed countries than in developing
ones. In the dynamic analysis, we focus on a more detailed comparison between
China and the USA. The Chinese Academy of the (Social) Sciences changes
increasingly from a public research institute to an academic one, and this has
a measurable effect on China's position in the globalization.
|
[
{
"version": "v1",
"created": "Thu, 6 Sep 2012 11:47:50 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Nov 2012 07:00:06 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Jan 2013 07:35:26 GMT"
}
] | 2013-01-04T00:00:00 |
[
[
"Ye",
"Fred Y.",
""
],
[
"Yu",
"Susan S.",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.987612 |
1301.0369
|
Bocong Chen
|
Bocong Chen, Yun Fan, Liren Lin, Hongwei Liu
|
Constacyclic Codes over Finite Fields
| null |
Finite Fields and Their Applications 18(2012) 1217-1231
|
10.1016/j.ffa.2012.10.001
| null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An equivalence relation called isometry is introduced to classify
constacyclic codes over a finite field; the polynomial generators of
constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the
characteristic of the finite field and $\ell$ is a prime different from $p$.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2013 02:58:10 GMT"
}
] | 2013-01-04T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Fan",
"Yun",
""
],
[
"Lin",
"Liren",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.999049 |
1301.0503
|
Charles Sutton
|
Quim Castella and Charles Sutton
|
Word Storms: Multiples of Word Clouds for Visual Comparison of Documents
| null | null | null | null |
cs.IR cs.DL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Word clouds are a popular tool for visualizing documents, but they are not a
good tool for comparing documents, because identical words are not presented
consistently across different clouds. We introduce the concept of word storms,
a visualization tool for analysing corpora of documents. A word storm is a
group of word clouds, in which each cloud represents a single document,
juxtaposed to allow the viewer to compare and contrast the documents. We
present a novel algorithm that creates a coordinated word storm, in which words
that appear in multiple documents are placed in the same location, using the
same color and orientation, in all of the corresponding clouds. In this way,
similar documents are represented by similar-looking word clouds, making them
easier to compare and contrast visually. We evaluate the algorithm in two ways:
first, an automatic evaluation based on document classification; and second, a
user study. The results confirm that unlike standard word clouds, a coordinated
word storm better allows for visual comparison of documents.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2013 17:02:56 GMT"
}
] | 2013-01-04T00:00:00 |
[
[
"Castella",
"Quim",
""
],
[
"Sutton",
"Charles",
""
]
] |
new_dataset
| 0.98129 |
1005.1694
|
Rani Hod
|
Ohad N. Feldheim and Rani Hod
|
3/2 Firefighters are not enough
|
8 pages
|
Discrete Applied Mathematics 161 (2013) 301-306
|
10.1016/j.dam.2012.08.005
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The firefighter problem is a monotone dynamic process in graphs that can be
viewed as modeling the use of a limited supply of vaccinations to stop the
spread of an epidemic. In more detail, a fire spreads through a graph, from
burning vertices to their unprotected neighbors. In every round, a small amount
of unburnt vertices can be protected by firefighters. How many firefighters per
turn, on average, are needed to stop the fire from advancing? We prove tight
lower and upper bounds on the amount of firefighters needed to control a fire
in the Cartesian planar grid and in the strong planar grid, resolving two
conjectures of Ng and Raff.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 00:12:28 GMT"
}
] | 2013-01-03T00:00:00 |
[
[
"Feldheim",
"Ohad N.",
""
],
[
"Hod",
"Rani",
""
]
] |
new_dataset
| 0.998923 |
1301.0045
|
EPTCS
|
Mengying Wang (ECNU), Yang Lu (SJTU)
|
A Timed Calculus for Mobile Ad Hoc Networks
|
In Proceedings FTSCS 2012, arXiv:1212.6574
|
EPTCS 105, 2012, pp. 118-134
|
10.4204/EPTCS.105.9
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a timed calculus for Mobile Ad Hoc Networks embodying the
peculiarities of local broadcast, node mobility and communication interference.
We present a Reduction Semantics and a Labelled Transition Semantics and prove
the equivalence between them. We then apply our calculus to model and study
some MAC-layer protocols with special emphasis on node mobility and
communication interference.
A main purpose of the semantics is to describe the various forms of
interference while nodes change their locations in the network. Such
interference only occurs when a node is simultaneously reached by more than one
ongoing transmission over the same channel.
|
[
{
"version": "v1",
"created": "Tue, 1 Jan 2013 01:55:04 GMT"
}
] | 2013-01-03T00:00:00 |
[
[
"Wang",
"Mengying",
"",
"ECNU"
],
[
"Lu",
"Yang",
"",
"SJTU"
]
] |
new_dataset
| 0.995136 |
1301.0046
|
EPTCS
|
Zheng Wang (East China Normal University), Geguang Pu (East China
Normal University), Jianwen Li (East China Normal University), Jifeng He
(East China Normal University), Shengchao Qin (University of Teesside), Kim
G. Larsen (Aalborg University of Denmark), Jan Madsen (Technical University
of Denmark), Bin Gu (Beijing Institute of Control Engineering)
|
MDM: A Mode Diagram Modeling Framework
|
In Proceedings FTSCS 2012, arXiv:1212.6574
|
EPTCS 105, 2012, pp. 135-149
|
10.4204/EPTCS.105.10
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Periodic control systems used in spacecrafts and automotives are usually
period-driven and can be decomposed into different modes with each mode
representing a system state observed from outside. Such systems may also
involve intensive computing in their modes. Despite the fact that such control
systems are widely used in the above-mentioned safety-critical embedded
domains, there is lack of domain-specific formal modelling languages for such
systems in the relevant industry. To address this problem, we propose a formal
visual modeling framework called mode diagram as a concise and precise way to
specify and analyze such systems. To capture the temporal properties of
periodic control systems, we provide, along with mode diagram, a property
specification language based on interval logic for the description of concrete
temporal requirements the engineers are concerned with. The statistical model
checking technique can then be used to verify the mode diagram models against
desired properties. To demonstrate the viability of our approach, we have
applied our modelling framework to some real life case studies from industry
and helped detect two design defects for some spacecraft control systems.
|
[
{
"version": "v1",
"created": "Tue, 1 Jan 2013 01:55:16 GMT"
}
] | 2013-01-03T00:00:00 |
[
[
"Wang",
"Zheng",
"",
"East China Normal University"
],
[
"Pu",
"Geguang",
"",
"East China\n Normal University"
],
[
"Li",
"Jianwen",
"",
"East China Normal University"
],
[
"He",
"Jifeng",
"",
"East China Normal University"
],
[
"Qin",
"Shengchao",
"",
"University of Teesside"
],
[
"Larsen",
"Kim G.",
"",
"Aalborg University of Denmark"
],
[
"Madsen",
"Jan",
"",
"Technical University\n of Denmark"
],
[
"Gu",
"Bin",
"",
"Beijing Institute of Control Engineering"
]
] |
new_dataset
| 0.999369 |
1301.0103
|
Shoshana Marcus
|
Shoshana Marcus and Dina Sokol
|
2D Lyndon Words and Applications
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Lyndon word is a primitive string which is lexicographically smallest among
cyclic permutations of its characters. Lyndon words are used for constructing
bases in free Lie algebras, constructing de Bruijn sequences, finding the
lexicographically smallest or largest substring in a string, and succinct
suffix-prefix matching of highly periodic strings. In this paper, we extend the
concept of the Lyndon word to two dimensions. We introduce the 2D Lyndon word
and use it to capture 2D horizontal periodicity of a matrix in which each row
is highly periodic, and to efficiently solve 2D horizontal suffix-prefix
matching among a set of patterns. This yields a succinct and efficient
algorithm for 2D dictionary matching.
We present several algorithms that compute the 2D Lyndon word that represents
a matrix. The final algorithm achieves linear time complexity even when the
least common multiple of the periods of the rows is exponential in the matrix
width.
|
[
{
"version": "v1",
"created": "Tue, 1 Jan 2013 16:24:46 GMT"
}
] | 2013-01-03T00:00:00 |
[
[
"Marcus",
"Shoshana",
""
],
[
"Sokol",
"Dina",
""
]
] |
new_dataset
| 0.999764 |
1301.0297
|
Mojtaba Vaezi
|
Mojtaba Vaezi and Fabrice Labeau
|
Wyner-Ziv Coding in the Real Field Based on BCH-DFT Codes
|
23 pages, 7 figures, submitted to IEEE Transactions on Signal
Processing. arXiv admin note: text overlap with arXiv:1111.0654
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how real-number codes can be used to compress correlated sources and
establish a new framework for distributed lossy source coding, in which we
quantize compressed sources instead of compressing quantized sources. This
change in the order of binning and quantization blocks makes it possible to
model correlation between continuous-valued sources more realistically and
compensate for the quantization error when the sources are completely
correlated. We focus on the asymmetric case, i.e., lossy source coding with
side information at the decoder, also known as Wyner-Ziv coding. The encoding
and decoding procedures are described in detail for discrete Fourier transform
(DFT) codes, both for syndrome- and parity-based approaches. We also extend the
parity-based approach to the case where the transmission channel is noisy and
perform distributed joint source-channel coding in this context. The proposed
system is well suited for low-delay communications. Furthermore, the
mean-squared reconstruction error (MSE) is shown to be less than or close to
the quantization error level, the ideal case in coding based on binary codes.
|
[
{
"version": "v1",
"created": "Wed, 2 Jan 2013 19:50:27 GMT"
}
] | 2013-01-03T00:00:00 |
[
[
"Vaezi",
"Mojtaba",
""
],
[
"Labeau",
"Fabrice",
""
]
] |
new_dataset
| 0.986374 |
1205.4463
|
Salah A. Aly
|
Salah A. Aly
|
Pilgrims Face Recognition Dataset -- HUFRD
|
5 pages, 13 images, 1 table of a new HUFRD work
| null | null | null |
cs.CV cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we define a new pilgrims face recognition dataset, called HUFRD
dataset. The new developed dataset presents various pilgrims' images taken from
outside the Holy Masjid El-Harram in Makkah during the 2011-2012 Hajj and Umrah
seasons. Such dataset will be used to test our developed facial recognition and
detection algorithms, as well as assess in the missing and found recognition
system \cite{crowdsensing}.
|
[
{
"version": "v1",
"created": "Sun, 20 May 2012 22:07:27 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Dec 2012 00:58:09 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Aly",
"Salah A.",
""
]
] |
new_dataset
| 0.999825 |
1212.5663
|
Morgan Barbier
|
Morgan Barbier (GREYC), Cl\'ement Pernet (INRIA Grenoble Rh\^one-Alpes
/ LIG Laboratoire d'Informatique de Grenoble), Guillaume Quintin (LIX)
|
On the decoding of quasi-BCH codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate the structure of quasi-BCH codes. In the first
part of this paper we show that quasi-BCH codes can be derived from
Reed-Solomon codes over square matrices extending the known relation about
classical BCH and Reed-Solomon codes. This allows us to adapt the
Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper
we show that quasi-BCH codes can be seen as subcodes of interleaved
Reed-Solomon codes over finite fields. This provides another approach for
decoding quasi-BCH codes.
|
[
{
"version": "v1",
"created": "Sat, 22 Dec 2012 07:38:34 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Barbier",
"Morgan",
"",
"GREYC"
],
[
"Pernet",
"Clément",
"",
"INRIA Grenoble Rhône-Alpes\n / LIG Laboratoire d'Informatique de Grenoble"
],
[
"Quintin",
"Guillaume",
"",
"LIX"
]
] |
new_dataset
| 0.978877 |
1212.6273
|
John-John Cabibihan
|
John-John Cabibihan, Wing-Chee So, and Soumo Pramanik
|
Human-Recognizable Robotic Gestures
|
21 pages, 5 figures
|
Autonomous Mental Development, IEEE Transactions, 2012, 4(4),
305-314
|
10.1109/TAMD.2012.2208962
| null |
cs.RO cs.AI cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
For robots to be accommodated in human spaces and in humans daily activities,
robots should be able to understand messages from the human conversation
partner. In the same light, humans must also understand the messages that are
being communicated by robots, including the non-verbal ones. We conducted a
web-based video study wherein participants gave interpretations on the iconic
gestures and emblems that were produced by an anthropomorphic robot. Out of the
15 gestures presented, we found 6 robotic gestures that can be accurately
recognized by the human observer. These were nodding, clapping, hugging,
expressing anger, walking, and flying. We reviewed these gestures for their
meaning from literatures in human and animal behavior. We conclude by
discussing the possible implications of these gestures for the design of social
robots that are aimed to have engaging interactions with humans.
|
[
{
"version": "v1",
"created": "Wed, 26 Dec 2012 22:10:14 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Cabibihan",
"John-John",
""
],
[
"So",
"Wing-Chee",
""
],
[
"Pramanik",
"Soumo",
""
]
] |
new_dataset
| 0.99896 |
1212.6296
|
Achmad Benny Mutiara
|
A. B. Mutiara, A. Muslim, T. Oswari, R. A. Miharja
|
A Model of OpenEHR Based Electronic Medical Record In Indonesia
|
10 pages, 5 figures; European Journal of Scientific Research (EJSR),
Vol. 90 Issues 3, 2012
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the realization of the vision and mission of Healthy Indonesia 2015, we
need a health service with a broad and comprehensive scope.To provide health
services, it can be realized by creating an integrated information system
applications such as creating an electronic medical record that has the ability
to process and store patient medical data. The specifications used medical
record is an open specification contained in OpenEHR that includes information
and service model for electronic medical records, demographics, and the
archetype which allows software developers taking the logical structure as a
universal functional interface, so it can facilitate the process of information
by the recipient. It is because of using the interface with
appropriate-purposed data presentation and data on computer screen of the same
users. The purpose of this paper is to create an electronic website for the
medical record by using OpenEHR specifications for easy accessing, processing
and storing the medical records by the actors that play a role in the data
processing of medical records. With this application it is expected to be
useful for data processing and health information gathering, thus to improve
the quality of services that will impact the improved performance of the
hospital management. The improved performance of the hospital management will
become a supporter of the vision and mission Healthy Indonesia 2015.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2012 04:00:55 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Mutiara",
"A. B.",
""
],
[
"Muslim",
"A.",
""
],
[
"Oswari",
"T.",
""
],
[
"Miharja",
"R. A.",
""
]
] |
new_dataset
| 0.975596 |
1212.6298
|
Achmad Benny Mutiara
|
R. Refianti, A. B. Mutiara, H. Gunawan
|
Design of Intelligent Agents Based System for Commodity Market
Simulation with JADE
|
13 pages, 11 figures; European Journal of Scientific Research (EJSR),
Vol. 92 Issue 3, Desember 2012
| null | null | null |
cs.MA cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A market of potato commodity for industry scale usage is engaging several
types of actors. They are farmers, middlemen, and industries. A multi-agent
system has been built to simulate these actors into agent entities, based on
manually given parameters within a simulation scenario file. Each type of
agents has its own fuzzy logic representing actual actors' knowledge, to be
used to interpreting values and take appropriated decision of it while on
simulation. The system will simulate market activities with programmed
behaviors then produce the results as spreadsheet and chart graph files. These
results consist of each agent's yearly finance and commodity data. The system
will also predict each of next value from these outputs.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2012 04:07:01 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Refianti",
"R.",
""
],
[
"Mutiara",
"A. B.",
""
],
[
"Gunawan",
"H.",
""
]
] |
new_dataset
| 0.958842 |
1212.6299
|
Achmad Benny Mutiara
|
Y. Fitriyani, A. B. Mutiara, R. Refianti
|
YAGI Antenna Design for Signal Phone Jammer
|
6 pages, 10 figures; Journal of Theoretical and Applied Information
Technology (JATIT), Vol.43 No.1, 2012
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile phone is one of the most widely used today in mobile communications.
This technology is very useful for communication but this raises several
problems in a situation where silence is required such as in libraries, places
of worship, classrooms and others. Mobile phone jammer is a device that used to
block the incoming signal to a mobile phone from the base station. If the
mobile phone jammer is turned on then it can not form the incoming or outgoing
calls even sms. In this research, we designed a Yagi antenna (900MHz) to expand
the range of jamming because Yagi has a great gain. Results of impedance by
gamma match are 50.16 Om. Obtained the value of VSWR Yagi is 1.46:1 and jamming
distance that can be taken approximately 16 meters, It is different from the
jamming distance of helical antenna on a mobile phone jammer itself is about 4
meters.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2012 04:21:52 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Fitriyani",
"Y.",
""
],
[
"Mutiara",
"A. B.",
""
],
[
"Refianti",
"R.",
""
]
] |
new_dataset
| 0.999844 |
1212.6350
|
Sebasti\'an Basterrech
|
Sebasti\'an Basterrech and Gerardo Rubino and Mart\'in Varela
|
Single-sided Real-time PESQ Score Estimation
|
In Proceeding of Measurement of Speech, Audio and Video Quality in
Networks (MESAQIN'09), Prague, Czech Republic, June 2009, pp. 94-99
| null | null | null |
cs.SD cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For several years now, the ITU-T's Perceptual Evaluation of Speech Quality
(PESQ) has been the reference for objective speech quality assessment. It is
widely deployed in commercial QoE measurement products, and it has been well
studied in the literature. While PESQ does provide reasonably good correlation
with subjective scores for VoIP applications, the algorithm itself is not
usable in a real-time context, since it requires a reference signal, which is
usually not available in normal conditions. In this paper we provide an
alternative technique for estimating PESQ scores in a single-sided fashion,
based on the Pseudo Subjective Quality Assessment (PSQA) technique.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2012 11:31:16 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Basterrech",
"Sebastián",
""
],
[
"Rubino",
"Gerardo",
""
],
[
"Varela",
"Martín",
""
]
] |
new_dataset
| 0.966137 |
1212.6923
|
John Allison
|
John Allison, Laurent Garnier, Akinori Kimura and Joseph Perl
|
The Geant4 Visualisation System - a multi-driver graphics system
|
22 pages, 15 figures. Submitted to the International Journal of
Modeling, Simulation, and Scientific Computing
| null | null |
MAN/HEP/2012/19
|
cs.GR hep-ex
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From the beginning the Geant4 Visualisation System was designed to support
several simultaneous graphics systems written to common abstract interfaces.
Today it has matured into a powerful diagnostic and presentational tool. It
comes with a library of models that may be added to the current scene and which
include the representation of the Geant4 geometry hierarchy, simulated
trajectories and user-written hits and digitisations. The workhorse is the
OpenGL suite of drivers for X, Xm, Qt and Win32. There is an Open Inventor
driver. Scenes can be exported in special graphics formats for offline viewing
in the DAWN, VRML, HepRApp and gMocren browsers. PostScript can be generated
through OpenGL, Open Inventor, DAWN and HepRApp. Geant4's own tracking
algorithms are used by the Ray Tracer. Not all drivers support all features but
all drivers bring added functionality of some sort. This paper describes the
interfaces and details the individual drivers.
|
[
{
"version": "v1",
"created": "Mon, 31 Dec 2012 16:41:07 GMT"
}
] | 2013-01-01T00:00:00 |
[
[
"Allison",
"John",
""
],
[
"Garnier",
"Laurent",
""
],
[
"Kimura",
"Akinori",
""
],
[
"Perl",
"Joseph",
""
]
] |
new_dataset
| 0.986283 |
1202.2089
|
Jiaming Xu
|
Jiaming Xu and Bruce Hajek
|
The Supermarket Game
|
Submitted to Stochastic Systems
| null | null | null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A supermarket game is considered with $N$ FCFS queues with unit exponential
service rate and global Poisson arrival rate $N \lambda$. Upon arrival each
customer chooses a number of queues to be sampled uniformly at random and joins
the least loaded sampled queue. Customers are assumed to have cost for both
waiting and sampling, and they want to minimize their own expected total cost.
We study the supermarket game in a mean field model that corresponds to the
limit as $N$ converges to infinity in the sense that (i) for a fixed symmetric
customer strategy, the joint equilibrium distribution of any fixed number of
queues converges as $N \to \infty$ to a product distribution determined by the
mean field model and (ii) a Nash equilibrium for the mean field model is an
$\epsilon$-Nash equilibrium for the finite $N$ model with $N$ sufficiently
large. It is shown that there always exists a Nash equilibrium for $\lambda <1$
and the Nash equilibrium is unique with homogeneous waiting cost for $\lambda^2
\le 1/2$. Furthermore, we find that the action of sampling more queues by some
customers has a positive externality on the other customers in the mean field
model, but can have a negative externality for finite $N$.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2012 19:42:28 GMT"
},
{
"version": "v2",
"created": "Sat, 22 Dec 2012 15:29:24 GMT"
}
] | 2012-12-27T00:00:00 |
[
[
"Xu",
"Jiaming",
""
],
[
"Hajek",
"Bruce",
""
]
] |
new_dataset
| 0.960681 |
1202.3641
|
Michael Erhard
|
Michael Erhard and Hans Strauch
|
Control of Towing Kites for Seagoing Vessels
|
12 pages, 18 figures; submitted to IEEE Trans. on Control Systems
Technology; revision: Fig. 15 corrected, minor text changes
| null |
10.1109/TCST.2012.2221093
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the basic features of the flight control of the
SkySails towing kite system. After introduction of coordinate definitions and
basic system dynamics we introduce a novel model used for controller design and
justify its main dynamics with results from system identification based on
numerous sea trials. We then present the controller design which we
successfully use for operational flights for several years. Finally we explain
the generation of dynamical flight patterns.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2012 16:45:45 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jul 2012 17:41:03 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Oct 2012 14:28:51 GMT"
}
] | 2012-12-27T00:00:00 |
[
[
"Erhard",
"Michael",
""
],
[
"Strauch",
"Hans",
""
]
] |
new_dataset
| 0.950873 |
1212.5589
|
Harry Boyer
|
Harry Boyer (PIMENT), Alain Bastide (PIMENT), Alfred Jean Philippe
Lauret (PIMENT)
|
CODYRUN, outil de simulation et d'aide \`a la conception
thermo-a\'eraulique de b\^atiments
|
in French
|
Journ\'ee th\'ematique SFT-IBPSA 2005, La Rochelle : France (2005)
| null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents the CODYRUN software developped by University of La
R\'eunion. It is a multizone thermal software, with detailled airflow and
humidity transfer calculations. One of its specific aspects is that it
constitutes a research tool, a design tool used by the lab and professionnals
and also a teaching tool. After a presentation of the multiple model aspect,
some details of the tree modules associated to physical phenomenons are given.
Elements of validation are exposed in next paraghaph, and then a few details of
the front end.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 21:21:41 GMT"
}
] | 2012-12-27T00:00:00 |
[
[
"Boyer",
"Harry",
"",
"PIMENT"
],
[
"Bastide",
"Alain",
"",
"PIMENT"
],
[
"Lauret",
"Alfred Jean Philippe",
"",
"PIMENT"
]
] |
new_dataset
| 0.988945 |
1212.5679
|
Yun Fan
|
Yun Fan, San Ling, Hongwei Liu, Jing Shen, Chaoping Xing
|
Cumulative Distance Enumerators of Random Codes and their Thresholds
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cumulative weight enumerators of random linear codes are introduced, their
asymptotic properties are studied, and very sharp thresholds are exhibited; as
a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a
very sharp threshold point for the density of the linear codes whose relative
distance is greater than a given positive number. For arbitrary random codes,
similar settings and results are exhibited; in particular, the very sharp
threshold point for the density of the codes whose relative distance is greater
than a given positive number is located at half the asymptotic
Gilbert-Varshamov bound.
|
[
{
"version": "v1",
"created": "Sat, 22 Dec 2012 10:30:50 GMT"
}
] | 2012-12-27T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Ling",
"San",
""
],
[
"Liu",
"Hongwei",
""
],
[
"Shen",
"Jing",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.99755 |
1212.6046
|
Seifedine Kadry Seifedine Kadry
|
Seifedine Kadry, Chibli Joumaa
|
Green WSUS
|
International Journal of Applied Science and Technology, 2012
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The new era of information and communication technology (ICT) calls for a
greater understanding of the environmental impacts of recent technology. With
increasing energy cost and growing environmental concerns, green IT is
receiving more and more attention. Network and system design play a crucial
role in both computing and telecommunication systems. Significant part of this
energy cost goes to system update by downloading regularly patches and bug
fixes to solve security problems and to assure that the operating system and
other systems function properly. This paper describes a new design of Windows
Server Update Services (WSUS), system responsible of downloads of the mentioned
patches and updates from Microsoft Update website and then distributes them to
computers on a network. The general idea behind our proposed design is simple.
Instead of the periodical check done by the WSUS servers to ensure update form
Microsoft main servers, we rather propose to reverse the scenario in order to
reduce energy consumption. In the proposed design, the Microsoft main server(s)
sends signal to all WSUS servers to inform them about new updates. Once the
signal received, WSUS can contact the main server to start downloading.
|
[
{
"version": "v1",
"created": "Tue, 25 Dec 2012 13:20:25 GMT"
}
] | 2012-12-27T00:00:00 |
[
[
"Kadry",
"Seifedine",
""
],
[
"Joumaa",
"Chibli",
""
]
] |
new_dataset
| 0.999348 |
1212.6059
|
Sugata Sanyal
|
Priyanka Naik, Sugata Sanyal
|
Prover and Verifier Based Password Protection: PVBPP
|
8 pages, 1 figure, 1 table
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In today's world password are mostly used for authentication. This makes them
prone to various kinds of attacks like dictionary attacks. A dictionary attack
is a method of breaking the password by systematically entering every word in a
dictionary as a password. This attack leads to an overload on the server
leading to denial of service attack. This paper presents a protocol to reduce
the rate of dictionary attack by using a prover and a verifier system. This
system makes it difficult for the attacker to prove it as a valid user by
becoming computationally intensive. The rate of attempts is also reduced and
thus restricting the Denial of Service attack.
|
[
{
"version": "v1",
"created": "Tue, 25 Dec 2012 14:30:04 GMT"
}
] | 2012-12-27T00:00:00 |
[
[
"Naik",
"Priyanka",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.999574 |
1210.2164
|
Yuheng Hu
|
Yuheng Hu, Ajita John, Fei Wang, Doree Duncan Seligmann, Subbarao
Kambhampati
|
ET-LDA: Joint Topic Modeling For Aligning, Analyzing and Sensemaking of
Public Events and Their Twitter Feeds
|
errors in reference, delete for now
| null | null | null |
cs.LG cs.AI cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media channels such as Twitter have emerged as popular platforms for
crowds to respond to public events such as speeches, sports and debates. While
this promises tremendous opportunities to understand and make sense of the
reception of an event from the social media, the promises come entwined with
significant technical challenges. In particular, given an event and an
associated large scale collection of tweets, we need approaches to effectively
align tweets and the parts of the event they refer to. This in turn raises
questions about how to segment the event into smaller yet meaningful parts, and
how to figure out whether a tweet is a general one about the entire event or
specific one aimed at a particular segment of the event. In this work, we
present ET-LDA, an effective method for aligning an event and its tweets
through joint statistical modeling of topical influences from the events and
their associated tweets. The model enables the automatic segmentation of the
events and the characterization of tweets into two categories: (1) episodic
tweets that respond specifically to the content in the segments of the events,
and (2) steady tweets that respond generally about the events. We present an
efficient inference method for this model, and a comprehensive evaluation of
its effectiveness over existing methods. In particular, through a user study,
we demonstrate that users find the topics, the segments, the alignment, and the
episodic tweets discovered by ET-LDA to be of higher quality and more
interesting as compared to the state-of-the-art, with improvements in the range
of 18-41%.
|
[
{
"version": "v1",
"created": "Mon, 8 Oct 2012 07:24:38 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Oct 2012 08:57:20 GMT"
},
{
"version": "v3",
"created": "Fri, 21 Dec 2012 05:48:55 GMT"
}
] | 2012-12-24T00:00:00 |
[
[
"Hu",
"Yuheng",
""
],
[
"John",
"Ajita",
""
],
[
"Wang",
"Fei",
""
],
[
"Seligmann",
"Doree Duncan",
""
],
[
"Kambhampati",
"Subbarao",
""
]
] |
new_dataset
| 0.99248 |
1211.3089
|
Yuheng Hu
|
Yuheng Hu, Ajita John, Fei Wang, Subbarao Kambhampati
|
ET-LDA: Joint Topic Modeling for Aligning Events and their Twitter
Feedback
|
reference error, delete for now
| null | null | null |
cs.SI cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During broadcast events such as the Superbowl, the U.S. Presidential and
Primary debates, etc., Twitter has become the de facto platform for crowds to
share perspectives and commentaries about them. Given an event and an
associated large-scale collection of tweets, there are two fundamental research
problems that have been receiving increasing attention in recent years. One is
to extract the topics covered by the event and the tweets; the other is to
segment the event. So far these problems have been viewed separately and
studied in isolation. In this work, we argue that these problems are in fact
inter-dependent and should be addressed together. We develop a joint Bayesian
model that performs topic modeling and event segmentation in one unified
framework. We evaluate the proposed model both quantitatively and qualitatively
on two large-scale tweet datasets associated with two events from different
domains to show that it improves significantly over baseline models.
|
[
{
"version": "v1",
"created": "Tue, 13 Nov 2012 19:46:51 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Dec 2012 05:50:15 GMT"
}
] | 2012-12-24T00:00:00 |
[
[
"Hu",
"Yuheng",
""
],
[
"John",
"Ajita",
""
],
[
"Wang",
"Fei",
""
],
[
"Kambhampati",
"Subbarao",
""
]
] |
new_dataset
| 0.991441 |
1212.4915
|
Yifeng Zhong
|
Ke Xu, Yifeng Zhong, Huan He
|
Can P2P Technology Benefit Eyeball ISPs? A Cooperative Profit
Distribution Answer
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Peer-to-Peer (P2P) technology has been regarded as a promising way to help
Content Providers (CPs) cost-effectively distribute content. However, under the
traditional Internet pricing mechanism, the fact that most P2P traffic flows
among peers can dramatically decrease the profit of ISPs, who may take actions
against P2P and impede the progress of P2P technology. In this paper, we
develop a mathematical framework to analyze such economic issues. Inspired by
the idea from cooperative game theory, we propose a cooperative
profit-distribution model based on Nash Bargaining Solution (NBS), in which
eyeball ISPs and Peer-assisted CPs (PCPs) form two coalitions respectively and
then compute a fair Pareto point to determine profit distribution. Moreover, we
design a fair and feasible mechanism for profit distribution within each
coalition. We show that such a cooperative method not only guarantees the fair
profit distribution among network participators, but also helps to improve the
economic efficiency of the overall network system. To our knowledge, this is
the first work that systematically studies solutions for P2P caused unbalanced
profit distribution and gives a feasible cooperative method to increase and
fairly share profit.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 03:58:43 GMT"
}
] | 2012-12-24T00:00:00 |
[
[
"Xu",
"Ke",
""
],
[
"Zhong",
"Yifeng",
""
],
[
"He",
"Huan",
""
]
] |
new_dataset
| 0.994027 |
1212.5276
|
Marc Schoenauer
|
Mostepha Redouane Khouadjia (INRIA Saclay - Ile de France), Marc
Schoenauer (INRIA Saclay - Ile de France, LRI), Vincent Vidal (DCSD), Johann
Dr\'eo (TRT), Pierre Sav\'eant (TRT)
|
Multi-Objective AI Planning: Evaluating DAE-YAHSP on a Tunable Benchmark
|
7th International Conference on Evolutionary Multi-Criterion
Optimization (2013) To appearr. arXiv admin note: text overlap with
arXiv:0804.3965 by other authors
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
All standard AI planners to-date can only handle a single objective, and the
only way for them to take into account multiple objectives is by aggregation of
the objectives. Furthermore, and in deep contrast with the single objective
case, there exists no benchmark problems on which to test the algorithms for
multi-objective planning. Divide and Evolve (DAE) is an evolutionary planner
that won the (single-objective) deterministic temporal satisficing track in the
last International Planning Competition. Even though it uses intensively the
classical (and hence single-objective) planner YAHSP, it is possible to turn
DAE-YAHSP into a multi-objective evolutionary planner. A tunable benchmark
suite for multi-objective planning is first proposed, and the performances of
several variants of multi-objective DAE-YAHSP are compared on different
instances of this benchmark, hopefully paving the road to further
multi-objective competitions in AI planning.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 21:26:17 GMT"
}
] | 2012-12-24T00:00:00 |
[
[
"Khouadjia",
"Mostepha Redouane",
"",
"INRIA Saclay - Ile de France"
],
[
"Schoenauer",
"Marc",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Vidal",
"Vincent",
"",
"DCSD"
],
[
"Dréo",
"Johann",
"",
"TRT"
],
[
"Savéant",
"Pierre",
"",
"TRT"
]
] |
new_dataset
| 0.992735 |
1212.5473
|
Raymond Aschheim
|
Raymond Aschheim
|
Spin foam with topologically encoded tetrad on trivalent spin networks
|
4 pages, 17 figures, based on a contributed talk given at LOOPS'11,
Madrid, Spain
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore discrete approaches in LQG where all fields, the gravitational
tetrad, and the matter and energy fields, are encoded implicitly in a graph
instead of being additional data. Our graph should therefore be richer than a
simple simplicial decomposition. It has to embed geometrical information and
the standard model. We start from Lisi's model. We build a trivalent graph
which is an F4 lattice of 48-valent supernodes, reduced as trivalent subgraphs,
and topologically encoding data. We show it is a solution for EFE with no
matter. We define bosons and half-fermions in two dual basis. They are encoded
by bit exchange in supernodes, operated by Pachner 2-2 move, and rest state can
be restored thanks to information redundancy. Despite its 4 dimensional nature,
our graph is a trivalent spin network, and its history is a pentavalent spin
foam.
|
[
{
"version": "v1",
"created": "Fri, 21 Dec 2012 15:01:58 GMT"
}
] | 2012-12-24T00:00:00 |
[
[
"Aschheim",
"Raymond",
""
]
] |
new_dataset
| 0.986325 |
1112.0945
|
Marco Baldi
|
Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce
|
Interleaved Product LDPC Codes
|
11 pages, 5 figures, accepted for publication in IEEE Transactions on
Communications
|
IEEE Transactions on Communications, Vol. 60, No. 4, pp. 895-901,
Apr. 2012
|
10.1109/TCOMM.2012.030712.100173
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Product LDPC codes take advantage of LDPC decoding algorithms and the high
minimum distance of product codes. We propose to add suitable interleavers to
improve the waterfall performance of LDPC decoding. Interleaving also reduces
the number of low weight codewords, that gives a further advantage in the error
floor region.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2011 14:44:02 GMT"
}
] | 2012-12-21T00:00:00 |
[
[
"Baldi",
"Marco",
""
],
[
"Cancellieri",
"Giovanni",
""
],
[
"Chiaraluce",
"Franco",
""
]
] |
new_dataset
| 0.979851 |
1209.4414
|
Guenda Kenza
|
Kenza Guenda and T. Aaron Gulliver
|
On Cyclic DNA Codes
|
there is an error in Lemma 3.4
| null | null | null |
cs.IT math.IT q-bio.OT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper considers cyclic DNA codes of arbitrary length over the ring
$R=\F_2[u]/u^4-1$. A mapping is given between the elements of $R$ and the
alphabet $\{A,C,G,T\}$ which allows the additive stem distance to be extended
to this ring. Cyclic codes over $R$ are designed such that their images under
the mapping are also cyclic or quasi-cyclic of index 2. The additive distance
and hybridization energy are functions of the neighborhood energy.
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 03:31:46 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Sep 2012 03:58:39 GMT"
},
{
"version": "v3",
"created": "Thu, 20 Dec 2012 19:30:29 GMT"
}
] | 2012-12-21T00:00:00 |
[
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.96904 |
1212.4931
|
Anatolii Leukhin Nikolaevich
|
Anatolii Leukhin, Oscar Moreno and Andrew Tirkel
|
Secure CDMA Sequences
|
10 pages, 8 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single sequences like Legendre have high linear complexity. Known CDMA
families of sequences all have low complexities. We present a new method of
constructing CDMA sequence sets with the complexity of the Legendre from new
frequency hop patterns, and compare them with known sequences. These are the
first families whose normalized linear complexities do not asymptote to 0,
verified for lengths up to 6x108. The new constructions in array format are
also useful in watermarking images. We present a conjecture regarding the
recursion polynomials. We also have a method to reverse the process, and from
small Kasami/No-Kumar sequences we obtain a new family of 2n doubly periodic
(2n+1)x(2n-1) frequency hop patterns with correlation 2.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 06:04:04 GMT"
}
] | 2012-12-21T00:00:00 |
[
[
"Leukhin",
"Anatolii",
""
],
[
"Moreno",
"Oscar",
""
],
[
"Tirkel",
"Andrew",
""
]
] |
new_dataset
| 0.998344 |
1212.5170
|
Lin Zhong
|
Zhen Wang, Felix Xiaozhu Lin, Lin Zhong, and Mansoor Chishtie
|
Guadalupe: a browser design for heterogeneous hardware
| null | null | null |
Rice University ECE Technical Report 2012-12-19
|
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile systems are embracing heterogeneous architectures by getting more
types of cores and more specialized cores, which allows applications to be
faster and more efficient. We aim at exploiting the hardware heterogeneity from
the browser without requiring any changes to either the OS or the web
applications. Our design, Guadalupe, can use hardware processing units with
different degrees of capability for matched browser services. It starts with a
weak hardware unit, determines if and when a strong unit is needed, and
seamlessly migrates to the strong one when necessary. Guadalupe not only makes
more computing resources available to mobile web browsing but also improves its
energy proportionality. Based on Chrome for Android and TI OMAP4, We provide a
prototype browser implementation for resource loading and rendering. Compared
to Chrome for Android, we show that Guadalupe browser for rendering can
increase other 3D application's frame rate by up to 767% and save 4.7% of the
entire system's energy consumption. More importantly, by using the two cases,
we demonstrate that Guadalupe creates the great opportunity for many browser
services to get better resource utilization and energy proportionality by
exploiting hardware heterogeneity.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2012 18:28:59 GMT"
}
] | 2012-12-21T00:00:00 |
[
[
"Wang",
"Zhen",
""
],
[
"Lin",
"Felix Xiaozhu",
""
],
[
"Zhong",
"Lin",
""
],
[
"Chishtie",
"Mansoor",
""
]
] |
new_dataset
| 0.987801 |
1212.4489
|
Jie Dong
|
Jie Dong and David Smith
|
Opportunistic Relaying in Wireless Body Area Networks: Coexistence
Performance
|
6 pages, 9 figures, ICC 2013
| null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a cooperative two-hop communication scheme, together with
opportunistic relaying (OR), is applied within a mobile wireless body area
network (WBAN). Its effectiveness in interference mitigation is investigated in
a scenario where there are multiple closely-located networks. Due to a typical
WBAN's nature, no coordination is used among different WBANs. A suitable
time-division-multiple-access (TDMA) is adopted as both an intra-network and
also an inter-network access scheme. Extensive on-body and off-body channel
gain measurements are employed to gauge performance, which are overlaid to
simulate a realistic WBAN working environment. It is found that opportunistic
relaying is able to improve the signal-to-interference-and-noise ratio (SINR)
threshold value at outage probability of 10% by an average of 5 dB, and it is
also shown that it can reduce level crossing rate (LCR) significantly at a low
SINR threshold value. Furthermore, this scheme is more efficient when on-body
channels fade less slowly.
|
[
{
"version": "v1",
"created": "Tue, 18 Dec 2012 05:23:49 GMT"
}
] | 2012-12-20T00:00:00 |
[
[
"Dong",
"Jie",
""
],
[
"Smith",
"David",
""
]
] |
new_dataset
| 0.998455 |
1212.4804
|
Fawzi Nashashibi
|
S\'ebastien Glaser (LIVIC), Maurice Cour, Lydie Nouveliere (IBISC),
Alain Lambert (IEF), Fawzi Nashashibi (INRIA Rocquencourt), Jean-Christophe
Popieul (LAMIH), Benjamin Mourllion (MIPS)
|
Low Speed Automation, a French Initiative
|
TRA (2012)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, vehicle safety is constantly increasing thanks to the improvement
of vehicle passive and active safety. However, on a daily usage of the car,
traffic jams remains a problem. With limited space for road infrastructure,
automation of the driving task on specific situation seems to be a possible
solution. The French project ABV, which stands for low speed automation, tries
to demonstrate the feasibility of the concept and to prove the benefits. In
this article, we describe the scientific background of the project and expected
outputs.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2012 19:42:33 GMT"
}
] | 2012-12-20T00:00:00 |
[
[
"Glaser",
"Sébastien",
"",
"LIVIC"
],
[
"Cour",
"Maurice",
"",
"IBISC"
],
[
"Nouveliere",
"Lydie",
"",
"IBISC"
],
[
"Lambert",
"Alain",
"",
"IEF"
],
[
"Nashashibi",
"Fawzi",
"",
"INRIA Rocquencourt"
],
[
"Popieul",
"Jean-Christophe",
"",
"LAMIH"
],
[
"Mourllion",
"Benjamin",
"",
"MIPS"
]
] |
new_dataset
| 0.991829 |
1210.3548
|
Julie De Pril
|
Thomas Brihaye, Julie De Pril, Sven Schewe
|
Multiplayer Cost Games with Simple Nash Equilibria
|
23 pages
| null | null | null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiplayer games with selfish agents naturally occur in the design of
distributed and embedded systems. As the goals of selfish agents are usually
neither equivalent nor antagonistic to each other, such games are non zero-sum
games. We study such games and show that a large class of these games,
including games where the individual objectives are mean- or discounted-payoff,
or quantitative reachability, and show that they do not only have a solution,
but a simple solution. We establish the existence of Nash equilibria that are
composed of k memoryless strategies for each agent in a setting with k agents,
one main and k-1 minor strategies. The main strategy describes what happens
when all agents comply, whereas the minor strategies ensure that all other
agents immediately start to co-operate against the agent who first deviates
from the plan. This simplicity is important, as rational agents are an
idealisation. Realistically, agents have to decide on their moves with very
limited resources, and complicated strategies that require exponential--or even
non-elementary--implementations cannot realistically be implemented. The
existence of simple strategies that we prove in this paper therefore holds a
promise of implementability.
|
[
{
"version": "v1",
"created": "Fri, 12 Oct 2012 15:19:29 GMT"
}
] | 2012-12-19T00:00:00 |
[
[
"Brihaye",
"Thomas",
""
],
[
"De Pril",
"Julie",
""
],
[
"Schewe",
"Sven",
""
]
] |
new_dataset
| 0.998374 |
1212.3557
|
Saeed Hajizadeh
|
Mostafa Monemizadeh, Saeed Hajizadeh, Seyed Alireza Seyedin, and
Ghosheh Abed Hodtani
|
Compound Multiple Access Channel with Common Message and Intersymbol
Interference
|
5 pages, 2 figures, This paper is presented at the International
Symposium on Telecommunications (IST)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we characterize the capacity region for the two-user linear
Gaussian compound Multiple Access Channel with common message (MACC) and with
intersymbol interference (ISI) under an input power constraint. The region is
obtained by converting the channel to its equivalent memoryless one by defining
an n-block memoryless circular Gaussian compound MACC model and applying the
discrete Fourier transform (DFT) to decompose the n-block channel into a set of
independent parallel channels whose capacities can be found easily. Indeed, the
capacity region of the original Gaussian compound MACC equals that of the
n-block circular Gaussian compound MACC in the limit of infinite block length.
Then by using the obtained capacity region, we derive the capacity region of
the strong interference channel with common message and ISI.
|
[
{
"version": "v1",
"created": "Fri, 14 Dec 2012 18:19:20 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Dec 2012 14:09:21 GMT"
}
] | 2012-12-19T00:00:00 |
[
[
"Monemizadeh",
"Mostafa",
""
],
[
"Hajizadeh",
"Saeed",
""
],
[
"Seyedin",
"Seyed Alireza",
""
],
[
"Hodtani",
"Ghosheh Abed",
""
]
] |
new_dataset
| 0.981681 |
1212.4334
|
Prakash Chaki
|
Prakash Chaki, Gouri Nawathe, Aaqib Patel, S.N. Merchant, U.B. Desai
|
Symbiotic Cognitive Relaying with mobile Secondary nodes in Cognitive
Radio Networks
|
Ongoing work, will be updated when finished
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a Symbiotic Cognitive Relaying (SCR) scenario, the Secondary users(SU)
nodes can act as multihop relays to assist the communication between Primary
User(PU) nodes in the case of a weak direct link. In return, the SU nodes are
incentivised with the right to carry out SU-SU communication using licensed PU
band for a fixed amount of time, referred to as the 'Time Incentive'. Existing
work on SCR is constrained to a fixed ad-hoc SU network. In this paper, we
introduce mobility in SCR by considering mobile SU nodes while keeping the PU
nodes fixed. This paper uses a specific mobility pattern and routing strategy
for the SU nodes to propose theoretical bounds on the throughput and delay of
PU-PU transmission. We derive analytically the least throughput and maximum
delay possible in our model.
|
[
{
"version": "v1",
"created": "Tue, 18 Dec 2012 12:41:01 GMT"
}
] | 2012-12-19T00:00:00 |
[
[
"Chaki",
"Prakash",
""
],
[
"Nawathe",
"Gouri",
""
],
[
"Patel",
"Aaqib",
""
],
[
"Merchant",
"S. N.",
""
],
[
"Desai",
"U. B.",
""
]
] |
new_dataset
| 0.993425 |
1212.4373
|
Djedid Mohammed Nadir
|
Mohammed Nadir Djedid
|
A trust-based security mechanism for nomadic users in pervasive systems
|
7 pages, 1 figure, 2 tables
|
International Journal of Computer Science Issues IJCSI Journal,
Volume 9, Issue 5, No 1, September 2012
| null | null |
cs.CR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emergence of network technologies and the appearance of new varied
applications in terms of services and resources, has created new security
problems for which existing solutions and mechanisms are inadequate, especially
problems of identification and authentication. In a highly distributed and
pervasive system, a uniform and centralized security management is not an
option. It then becomes necessary to give more autonomy to security systems by
providing them with mechanisms that allows a dynamic and flexible cooperation
and collaboration between the actors in the system.
|
[
{
"version": "v1",
"created": "Tue, 18 Dec 2012 14:53:32 GMT"
}
] | 2012-12-19T00:00:00 |
[
[
"Djedid",
"Mohammed Nadir",
""
]
] |
new_dataset
| 0.972314 |
1212.3704
|
Guenda Kenza
|
Aicha Batoul, Kenza Guenda and T. Aaron Gulliver
|
Some Constacyclic Codes over Finite Chain Rings
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that
$\lambda$-constacyclic repeated-root codes over some finite chain rings are
equivalent to cyclic codes. This allows us to simplify the structure of some
constacylic codes. We also study the $\alpha +p \beta$-constacyclic codes of
length $p^s$ over the Galois ring $GR(p^e,r)$.
|
[
{
"version": "v1",
"created": "Sat, 15 Dec 2012 17:03:44 GMT"
}
] | 2012-12-18T00:00:00 |
[
[
"Batoul",
"Aicha",
""
],
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.999688 |
1212.3765
|
Mohammad Bavandpour
|
Hamid Soleimani, Arash Ahmadi and Mohammad Bavandpour
|
Biologically Inspired Spiking Neurons : Piecewise Linear Models and
Digital Implementation
|
14 pages, 16 figures
|
IEEE Transactions On Circuits And Systems I: Regular Papers, Vol.
59, NO. 12, December 2012
|
10.1109/TCSI.2012.2206463
| null |
cs.LG cs.NE q-bio.NC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
There has been a strong push recently to examine biological scale simulations
of neuromorphic algorithms to achieve stronger inference capabilities. This
paper presents a set of piecewise linear spiking neuron models, which can
reproduce different behaviors, similar to the biological neuron, both for a
single neuron as well as a network of neurons. The proposed models are
investigated, in terms of digital implementation feasibility and costs,
targeting large scale hardware implementation. Hardware synthesis and physical
implementations on FPGA show that the proposed models can produce precise
neural behaviors with higher performance and considerably lower implementation
costs compared with the original model. Accordingly, a compact structure of the
models which can be trained with supervised and unsupervised learning
algorithms has been developed. Using this structure and based on a spike rate
coding, a character recognition case study has been implemented and tested.
|
[
{
"version": "v1",
"created": "Sun, 16 Dec 2012 09:05:02 GMT"
}
] | 2012-12-18T00:00:00 |
[
[
"Soleimani",
"Hamid",
""
],
[
"Ahmadi",
"Arash",
""
],
[
"Bavandpour",
"Mohammad",
""
]
] |
new_dataset
| 0.987253 |
1212.3777
|
Benedikt Kristinsson
|
Benedikt Kristinsson
|
The Arduino as a Hardware Random-Number Generator
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Cheap micro-controllers, such as the Arduino or other controllers based on
the Atmel AVR CPUs are being deployed in a wide variety of projects, ranging
from sensors networks to robotic submarines. In this paper, we investigate the
feasibility of using the Arduino as a true random number generator (TRNG). The
Arduino Reference Manual recommends using it to seed a pseudo random number
generator (PRNG) due to its ability to read random atmospheric noise from its
analog pins. This is an enticing application since true bits of entropy are
hard to come by. Unfortunately, we show by statistical methods that the
atmospheric noise of an Arduino is largely predictable in a variety of
settings, and is thus a weak source of entropy. We explore various methods to
extract true randomness from the micro-controller and conclude that it should
not be used to produce randomness from its analog pins.
|
[
{
"version": "v1",
"created": "Sun, 16 Dec 2012 11:36:07 GMT"
}
] | 2012-12-18T00:00:00 |
[
[
"Kristinsson",
"Benedikt",
""
]
] |
new_dataset
| 0.998597 |
1212.3425
|
Andrew Adamatzky
|
Victor Erokhin, Gerard David Howard, Andrew Adamatzky
|
Organic Memristor Devices for Logic Elements with Memory
| null |
Int J Bifurcation Chaos 22 (2012) 1250283
|
10.1142/S0218127412502835
| null |
cs.ET physics.chem-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memristors are promising next-generation memory candidates that are
nonvolatile, possess low power requirements and are capable of nanoscale
fabrication. In this article we physically realise and describe the use of
organic memristors in designing statefull boolean logic gates for the AND OR
and NOT operations. The output of these gates is analog and dependent on the
length of time that suitable charge is applied to the inputs, displaying a
learning property. Results may be also interpreted in a traditional binary
manner through use of a suitable thresholding function at the output. The
memristive property of the gate allows the for the production of analog outputs
that vary based on the charge-dependent nonvolatile state of the memristor. We
provide experimental results of physical fabrication of three types of logic
gate. A simulation of a one-bit full adder comprised of memristive logic gates
is also included, displaying varying response to two distinct input patterns.
|
[
{
"version": "v1",
"created": "Fri, 14 Dec 2012 09:59:35 GMT"
}
] | 2012-12-17T00:00:00 |
[
[
"Erokhin",
"Victor",
""
],
[
"Howard",
"Gerard David",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999738 |
1207.0350
|
Humza Qadir Raja
|
Humza Qadir Raja and Oliver Scholz
|
Dynamic Power Distribution and Energy Management in a Reconfigurable
Multi-Robotic Organism
|
This paper has been withdrawn by the author for further improvements
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several design parameters in collective robotic systems have been
investigated and developed in order to explore the cooperation among the
autonomous robotic individuals in a variety of robotic swarms in the presence
of different internal and external system constraints. In particular, the
dynamic power management and distribution in a multi-robotic organism is of
very high importance that depends not only on the electronic design but also on
the mechanical structure of the robots. It further defines the true nature of
the collaboration among the modules of a self-reconfigurable multi-robotic
organism. This article describes the essential features and design of a dynamic
power distribution and management system for a dynamically reconfigurable
multi-robotic system. It further presents the empirical results of the proposed
dynamic power management system collected with the real robotic platform. In
the later half of the article, it presents a simulation framework that was
especially developed to explore the collective system behavior and complexities
involved in the operations of a multi-robotic organism. At the end, summary and
conclusion follows the detailed discussion on the obtained simulation results.
|
[
{
"version": "v1",
"created": "Mon, 2 Jul 2012 11:55:40 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Jul 2012 15:21:13 GMT"
},
{
"version": "v3",
"created": "Wed, 12 Dec 2012 21:10:27 GMT"
}
] | 2012-12-14T00:00:00 |
[
[
"Raja",
"Humza Qadir",
""
],
[
"Scholz",
"Oliver",
""
]
] |
new_dataset
| 0.976297 |
1212.2963
|
Andrew Adamatzky
|
Ramon Alonso-Sanz and Andrew Adamatzky
|
On beta-skeleton automata with memory
| null |
Journal of Computational Science 2 (2011) 1, 57--66
|
10.1016/j.jocs.2010.12.001
| null |
cs.ET cs.FL nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A \beta-skeleton is a proximity undirected graph whose connectivity is
determined by the parameter \beta. We study \beta-skeleton automata where every
node is a finite state machine taking two states, and updating its states
depending on the states of adjacent automata-nodes. We allow automata-nodes to
remember their previous states. In computational experiments we study how
memory affects the global space-time dynamics on \beta-skeleton automata.
|
[
{
"version": "v1",
"created": "Wed, 12 Dec 2012 16:02:52 GMT"
}
] | 2012-12-14T00:00:00 |
[
[
"Alonso-Sanz",
"Ramon",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999623 |
1212.3034
|
Rastislav Telgarsky
|
Rastislav Telgarsky
|
Multi-target tracking algorithms in 3D
|
7 pages, 2 figures, conference proceedings
|
Scientific Issues, MATHEMATICA IV, Ruzomberok 2012
| null | null |
cs.CV cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ladars provide a unique capability for identification of objects and motions
in scenes with fixed 3D field of view (FOV). This paper describes algorithms
for multi-target tracking in 3D scenes including the preprocessing
(mathematical morphology and Parzen windows), labeling of connected components,
sorting of targets by selectable attributes (size, length of track, velocity),
and handling of target states (acquired, coasting, re-acquired and tracked) in
order to assemble the target trajectories. This paper is derived from working
algorithms coded in Matlab, which were tested and reviewed by others, and does
not speculate about usage of general formulas or frameworks.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2012 01:55:15 GMT"
}
] | 2012-12-14T00:00:00 |
[
[
"Telgarsky",
"Rastislav",
""
]
] |
new_dataset
| 0.970463 |
1212.3257
|
Timo Hanke
|
Ilja Gerhardt and Timo Hanke
|
Homomorphic Payment Addresses and the Pay-to-Contract Protocol
|
11 pages, 5 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an electronic payment protocol for typical customer-merchant
relations which does not require a trusted (signed) payment descriptor to be
sent from the merchant to the customer. Instead, the destination "account"
number for the payment is solely created on the customer side. This eliminates
the need for any encrypted or authenticated communication in the protocol and
is secure even if the merchant's online infrastructure is compromised.
Moreover, the payment transaction itself serves as a timestamped receipt for
the customer. It proves what has been paid for and who received the funds,
again without relying on any merchant signatures. In particular, funds and
receipt are exchanged in a single atomic action. The asymmetric nature of the
customer-merchant relation is crucial.
The protocol is specifically designed with bitcoin in mind as the underlying
payment system. Thereby, it has the useful benefit that all transactions are
public. However, the only essential requirement on the payment system is that
"accounts" are arbitrary user-created keypairs of a cryptosystem whose keypairs
enjoy a homomorphic property. All ElGamal-type cryptosystems have this feature.
For use with bitcoin we propose the design of a deterministic bitcoin wallet
whose addresses can be indexed by clear text strings.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2012 18:28:43 GMT"
}
] | 2012-12-14T00:00:00 |
[
[
"Gerhardt",
"Ilja",
""
],
[
"Hanke",
"Timo",
""
]
] |
new_dataset
| 0.999449 |
1211.3148
|
Rayed AlGhamdi
|
Rayed AlGhamdi and Steve Drew
|
Seven Key Drivers to Online Retailing Growth in KSA
|
IADIS International Conference e-Society 2011. arXiv admin note:
substantial text overlap with arXiv:1211.2398, arXiv:1211.2404,
arXiv:1211.2799
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
Retailers in Saudi Arabia have been reserved in their adoption of
electronically delivered aspects of their business. This paper reports research
that identifies and explores key issues to enhance the diffusion of online
retailing in Saudi Arabia. Despite the fact that Saudi Arabia has the largest
and fastest growth of ICT marketplaces in the Arab region, e-commerce
activities are not progressing at the same speed. Only very few Saudi
companies, mostly medium and large companies from the manufacturing sector, are
involved in e-commerce implementation. Based on qualitative data collected by
conducting interviews with 16 retailers and 16 potential customers in Saudi
Arabia, 7 key drivers to online retailing diffusion in Saudi Arabia are
identified. These key drivers are government support, providing trustworthy and
secure online payments options, provision of individual house mailboxes,
providing high speed Internet connection at low cost, providing educational
programs, the success of bricks-and-clicks model, and competitive prices.
|
[
{
"version": "v1",
"created": "Sun, 11 Nov 2012 12:14:56 GMT"
}
] | 2012-12-13T00:00:00 |
[
[
"AlGhamdi",
"Rayed",
""
],
[
"Drew",
"Steve",
""
]
] |
new_dataset
| 0.993829 |
1212.2654
|
Ozan Tonguz
|
M. Kas, S. Appala, C. Wang, C. Carley, L. R. Carley, O. K. Tonguz
|
What if Routers Were Social? Analyzing Wireless Mesh Networks from a
Social Networks Perspective
|
IEEE Wireless Communications, vol. 19, no. 6, December 2012
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Mesh Networks (WMNs) consist of radio nodes organized in a mesh
topology for serving wireless mesh clients to communicate with one another or
to connect to the Internet. Nodes in a mesh network can communicate with each
other either directly or through one or more intermediate nodes, similar to
social networks. WMNs share many common properties with social networks. We
first identify the differences and similarities between social networks and
WMNs and then use metrics that are typically used for social network analysis
(SNA) to assess real WMNs. Analyzing real WMN data collected from the UCSB
MeshNet and MIT Roofnet testbeds reveals that using SNA metrics are helpful in
designing WMNs with better performance. We demonstrate the validity of our
conclusions and this new approach by focusing on two sample applications of
social networks: network reliability assessment and channel access scheduling.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2012 21:33:13 GMT"
}
] | 2012-12-13T00:00:00 |
[
[
"Kas",
"M.",
""
],
[
"Appala",
"S.",
""
],
[
"Wang",
"C.",
""
],
[
"Carley",
"C.",
""
],
[
"Carley",
"L. R.",
""
],
[
"Tonguz",
"O. K.",
""
]
] |
new_dataset
| 0.992846 |
1212.2860
|
Jan Egger
|
Jan Egger, Tina Kapur, Christopher Nimsky, Ron Kikinis
|
Pituitary Adenoma Volumetry with 3D Slicer
|
7 pages, 5 figures, 2 tables, 30 references
|
(2012) PLoS ONE 7(12): e51788
|
10.1371/journal.pone.0051788
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this study, we present pituitary adenoma volumetry using the free and open
source medical image computing platform for biomedical research: (3D) Slicer.
Volumetric changes in cerebral pathologies like pituitary adenomas are a
critical factor in treatment decisions by physicians and in general the volume
is acquired manually. Therefore, manual slice-by-slice segmentations in
magnetic resonance imaging (MRI) data, which have been obtained at regular
intervals, are performed. In contrast to this manual time consuming
slice-by-slice segmentation process Slicer is an alternative which can be
significantly faster and less user intensive. In this contribution, we compare
pure manual segmentations of ten pituitary adenomas with semi-automatic
segmentations under Slicer. Thus, physicians drew the boundaries completely
manually on a slice-by-slice basis and performed a Slicer-enhanced segmentation
using the competitive region-growing based module of Slicer named GrowCut.
Results showed that the time and user effort required for GrowCut-based
segmentations were on average about thirty percent less than the pure manual
segmentations. Furthermore, we calculated the Dice Similarity Coefficient (DSC)
between the manual and the Slicer-based segmentations to proof that the two are
comparable yielding an average DSC of 81.97\pm3.39%.
|
[
{
"version": "v1",
"created": "Wed, 12 Dec 2012 16:12:32 GMT"
}
] | 2012-12-13T00:00:00 |
[
[
"Egger",
"Jan",
""
],
[
"Kapur",
"Tina",
""
],
[
"Nimsky",
"Christopher",
""
],
[
"Kikinis",
"Ron",
""
]
] |
new_dataset
| 0.999298 |
1212.2874
|
Prasun Ghosal PhD
|
Prasun Ghosal, Sankar Karmakar
|
Diametrical Mesh Of Tree (D2D-MoT) Architecture: A Novel Routing
Solution For NoC
|
5 pages
|
International Journal of Advanced Engineering Technology (IJAET),
Vol.III, Issue I, 2012, pp. 243-247
| null | null |
cs.ET cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network-on-chip (NoC) is a new aspect for designing of future System-On-Chips
(SoC) where a vast number of IP cores are connected through interconnection
network. The communication between the nodes occurred by routing packets rather
than wires. It supports high degree of scalability, reusability and parallelism
in communication. In this paper, we present a Mesh routing architecture, which
is called Diametrical 2D Mesh of Tree, based on Mesh-of-Tree (MoT) routing and
Diametrical 2D Mesh. It has the advantage of having small diameter as well as
large bisection width and small node degree clubbed with being the fastest
network in terms of speed. The routing algorithm ensures that the packets will
always reach from source to sink through shortest path and is deadlock free.
|
[
{
"version": "v1",
"created": "Wed, 12 Dec 2012 16:37:23 GMT"
}
] | 2012-12-13T00:00:00 |
[
[
"Ghosal",
"Prasun",
""
],
[
"Karmakar",
"Sankar",
""
]
] |
new_dataset
| 0.993151 |
1212.2908
|
Youssef Bassil
|
Youssef Bassil
|
A Text Steganography Method Using Pangram and Image Mediums
|
LACSC - Lebanese Association for Computational Sciences -
http://www.lacsc.org; International Journal of Scientific & Engineering
Research (IJSER), vol. 3, no. 12, December 2012. arXiv admin note: text
overlap with arXiv:1212.2067
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Steganography is the art and science of writing hidden messages in such a way
that no one apart from the sender and the receiver would realize that a secret
communicating is taking place. Unlike cryptography which only scrambles secret
data keeping them overt, steganography covers secret data into medium files
such as image files and transmits them in total secrecy avoiding drawing
eavesdroppers suspicions. However, considering that the public channel is
monitored by eavesdroppers, it is vulnerable to stego-attacks which refer to
randomly trying to break the medium file and recover the secret data out of it.
That is often true because steganalysts assume that the secret data are encoded
into a single medium file and not into multiple ones that complement each
other. This paper proposes a text steganography method for hiding secret
textual data using two mediums; a Pangram sentence containing all the
characters of the alphabet, and an uncompressed image file. The algorithm tries
to search for every character of the secret message into the Pangram text. The
search starts from a random index called seed and ends up on the index of the
first occurrence of the character being searched for. As a result, two indexes
are obtained, the seed and the offset indexes. Together they are embedded into
the three LSBs of the color channels of the image medium. Ultimately, both
mediums mainly the Pangram and the image are sent to the receiver. The
advantage of the proposed method is that it makes the covert data hard to be
recovered by unauthorized parties as it uses two mediums, instead of one, to
deliver the secret data. Experiments conducted, illustrated an example that
explained how to encode and decode a secret text message using the Pangram and
the image mediums.
|
[
{
"version": "v1",
"created": "Wed, 12 Dec 2012 18:10:53 GMT"
}
] | 2012-12-13T00:00:00 |
[
[
"Bassil",
"Youssef",
""
]
] |
new_dataset
| 0.968897 |
1209.2166
|
David Pritchard
|
David Pritchard and Troy Vasiga
|
CS Circles: An In-Browser Python Course for Beginners
|
To appear in SIGCSE 2013
| null | null | null |
cs.CY cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Computer Science Circles is a free programming website for beginners that is
designed to be fun, easy to use, and accessible to the broadest possible
audience. We teach Python since it is simple yet powerful, and the course
content is well-structured but written in plain language. The website has over
one hundred exercises in thirty lesson pages, plus special features to help
teachers support their students. It is available in both English and French. We
discuss the philosophy behind the course and its design, we describe how it was
implemented, and we give statistics on its use.
|
[
{
"version": "v1",
"created": "Mon, 10 Sep 2012 22:12:53 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Dec 2012 04:36:15 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Pritchard",
"David",
""
],
[
"Vasiga",
"Troy",
""
]
] |
new_dataset
| 0.999195 |
1212.2236
|
Gerhard Woeginger
|
Gerhard J. Woeginger
|
Core stability in hedonic coalition formation
|
18 pages
| null | null | null |
cs.GT cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many economic, social and political situations individuals carry out
activities in groups (coalitions) rather than alone and on their own. Examples
range from households and sport clubs to research networks, political parties
and trade unions. The underlying game theoretic framework is known as coalition
formation.
This survey discusses the notion of core stability in hedonic coalition
formation (where each player's happiness only depends on the other members of
his coalition but not on how the remaining players outside his coalition are
grouped). We present the central concepts and algorithmic approaches in the
area, provide many examples, and pose a number of open problems.
|
[
{
"version": "v1",
"created": "Mon, 10 Dec 2012 22:23:19 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Woeginger",
"Gerhard J.",
""
]
] |
new_dataset
| 0.999196 |
1212.2257
|
Yan Zhang
|
Yan Zhang, Zhaohui Zhu, Jinjin Zhang, Yong Zhou
|
A Process Calculus with Logical Operators
|
52 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to combine operational and logical styles of specifications in one
unified framework, the notion of logic labelled transition systems (Logic LTS,
for short) has been presented and explored by L\"{u}ttgen and Vogler in [TCS
373(1-2):19-40; Inform. & Comput. 208:845-867]. In contrast with usual LTS, two
logical constructors $\wedge$ and $\vee$ over Logic LTSs are introduced to
describe logical combinations of specifications. Hitherto such framework has
been dealt with in considerable depth, however, process algebraic style way has
not yet been involved and the axiomatization of constructors over Logic LTSs is
absent. This paper tries to develop L\"{u}ttgen and Vogler's work along this
direction. We will present a process calculus for Logic LTSs (CLL, for short).
The language CLL is explored in detail from two different but equivalent views.
Based on behavioral view, the notion of ready simulation is adopted to
formalize the refinement relation, and the behavioral theory is developed.
Based on proof-theoretic view, a sound and ground-complete axiomatic system for
CLL is provided, which captures operators in CLL through (in)equational laws.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2012 00:21:51 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Zhang",
"Yan",
""
],
[
"Zhu",
"Zhaohui",
""
],
[
"Zhang",
"Jinjin",
""
],
[
"Zhou",
"Yong",
""
]
] |
new_dataset
| 0.968704 |
1212.2346
|
Jean Cardinal
|
Jean Cardinal and Kolja Knauer and Piotr Micek and Torsten Ueckerdt
|
Making Triangles Colorful
|
6 pages
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that for any point set P in the plane, a triangle T, and a positive
integer k, there exists a coloring of P with k colors such that any homothetic
copy of T containing at least ck^8 points of P, for some constant c, contains
at least one of each color. This is the first polynomial bound for range spaces
induced by homothetic polygons. The only previously known bound for this
problem applies to the more general case of octants in R^3, but is doubly
exponential.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2012 09:19:35 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Knauer",
"Kolja",
""
],
[
"Micek",
"Piotr",
""
],
[
"Ueckerdt",
"Torsten",
""
]
] |
new_dataset
| 0.993729 |
1212.2464
|
Denver Dash
|
Denver Dash, Marek J. Druzdzel
|
A Robust Independence Test for Constraint-Based Learning of Causal
Structure
|
Appears in Proceedings of the Nineteenth Conference on Uncertainty in
Artificial Intelligence (UAI2003)
| null | null |
UAI-P-2003-PG-167-174
|
cs.AI cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constraint-based (CB) learning is a formalism for learning a causal network
with a database D by performing a series of conditional-independence tests to
infer structural information. This paper considers a new test of independence
that combines ideas from Bayesian learning, Bayesian network inference, and
classical hypothesis testing to produce a more reliable and robust test. The
new test can be calculated in the same asymptotic time and space required for
the standard tests such as the chi-squared test, but it allows the
specification of a prior distribution over parameters and can be used when the
database is incomplete. We prove that the test is correct, and we demonstrate
empirically that, when used with a CB causal discovery algorithm with
noninformative priors, it recovers structural features more reliably and it
produces networks with smaller KL-Divergence, especially as the number of nodes
increases or the number of records decreases. Another benefit is the dramatic
reduction in the probability that a CB algorithm will stall during the search,
providing a remedy for an annoying problem plaguing CB learning when the
database is small.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 15:04:44 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Dash",
"Denver",
""
],
[
"Druzdzel",
"Marek J.",
""
]
] |
new_dataset
| 0.991738 |
1212.2479
|
Mark Hopkins
|
Mark Hopkins
|
LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs
|
Appears in Proceedings of the Nineteenth Conference on Uncertainty in
Artificial Intelligence (UAI2003)
| null | null |
UAI-P-2003-PG-321-328
|
cs.DS cs.AI cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze a new property of directed acyclic graphs (DAGs), called
layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz.
This class of DAGs permits certain problems of structural model-based causality
and explanation to be tractably solved. In this paper, we first address an open
question raised by Eiter and Lukasiewicz - the computational complexity of
deciding whether a given graph has a bounded layerwidth. After proving that
this problem is NP-complete, we proceed by proving numerous important
properties of layerwidth that are helpful in efficiently computing the optimal
layerwidth. Finally, we compare this new DAG property to two other important
DAG properties: treewidth and bandwidth.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 15:06:04 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Hopkins",
"Mark",
""
]
] |
new_dataset
| 0.99936 |
1212.2519
|
Vitor Santos Costa
|
Vitor Santos Costa, David Page, Maleeha Qazi, James Cussens
|
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
|
Appears in Proceedings of the Nineteenth Conference on Uncertainty in
Artificial Intelligence (UAI2003)
| null | null |
UAI-P-2003-PG-517-524
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present CLP(BN), a novel approach that aims at expressing Bayesian
networks through the constraint logic programming framework. Arguably, an
important limitation of traditional Bayesian networks is that they are
propositional, and thus cannot represent relations between multiple similar
objects in multiple contexts. Several researchers have thus proposed
first-order languages to describe such networks. Namely, one very successful
example of this approach are the Probabilistic Relational Models (PRMs), that
combine Bayesian networks with relational database technology. The key
difficulty that we had to address when designing CLP(cal{BN}) is that logic
based representations use ground terms to denote objects. With probabilitic
data, we need to be able to uniquely represent an object whose value we are not
sure about. We use {sl Skolem functions} as unique new symbols that uniquely
represent objects with unknown value. The semantics of CLP(cal{BN}) programs
then naturally follow from the general framework of constraint logic
programming, as applied to a specific domain where we have probabilistic data.
This paper introduces and defines CLP(cal{BN}), and it describes an
implementation and initial experiments. The paper also shows how CLP(cal{BN})
relates to Probabilistic Relational Models (PRMs), Ngo and Haddawys
Probabilistic Logic Programs, AND Kersting AND De Raedts Bayesian Logic
Programs.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 15:08:01 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Costa",
"Vitor Santos",
""
],
[
"Page",
"David",
""
],
[
"Qazi",
"Maleeha",
""
],
[
"Cussens",
"James",
""
]
] |
new_dataset
| 0.998251 |
1212.2563
|
Krishna Prakash K
|
Balachandra Muniyal, Krishna Prakash and Shashank Sharma
|
Wireless Public key Infrastructure for Mobile Phones
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile devices play an important role in the wireless network environment for
providing different services over internet. The business transactions over
wireless electronic devices are not secure and hence the messages are prone to
be intercepted and modified by an intruder. So, devices supporting wireless
internet must be guaranteed at the same level of security as the wired network.
PKI (Public Key Infrastructure) used in the wired environment is not suitable
for wireless environment because of the less powerful processor and small
memory. This arises a need for the development of a Wireless Public Key
Infrastructure (WPKI) that provides the similar security level as the wired PKI
suitable for mobile phone. In this paper, a discussion of public key
infrastructure and an experimental set up for Wireless Public key
Infrastructure for mobile phones are made.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2012 17:59:48 GMT"
}
] | 2012-12-12T00:00:00 |
[
[
"Muniyal",
"Balachandra",
""
],
[
"Prakash",
"Krishna",
""
],
[
"Sharma",
"Shashank",
""
]
] |
new_dataset
| 0.99923 |
1212.0286
|
I-Hong Hou
|
I-Hong Hou, Yao Liu, Alex Sprintson
|
A Non-Monetary Protocol for Peer-to-Peer Content Distribution in
Wireless Broadcast Networks with Network Coding
|
Under submission to WiOpt
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the problem of content distribution in wireless
peer-to-peer networks where all nodes are selfish and non-cooperative. We
propose a model that considers both the broadcast nature of wireless channels
and the incentives of nodes, where each node aims to increase its own download
rate and reduces its upload rate through the course of content distribution. We
then propose a protocol for these selfish nodes to exchange contents. Our
protocol is distributed and does not require the exchange of money, reputation,
etc., and hence can be easily implemented without additional infrastructure.
Moreover, we show that our protocol can be easily modified to employ network
coding.
The performance of our protocol is studied. We derive a closed-form
expression of Nash Equilibriums when there are only two files in the system.
The prices of anarchy, both from each node's perspective and the whole system's
perspective, are also characterized. Moreover, we propose a distributed
mechanism where each node adjusts its strategies only based on local
information and show that the mechanism converges to a Nash Equilibrium. We
also introduce an approach for calculating Nash Equilibriums for systems that
incorporate network coding when there are more than two files.
|
[
{
"version": "v1",
"created": "Mon, 3 Dec 2012 05:21:58 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Dec 2012 02:13:08 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Hou",
"I-Hong",
""
],
[
"Liu",
"Yao",
""
],
[
"Sprintson",
"Alex",
""
]
] |
new_dataset
| 0.997711 |
1212.1787
|
Rohan Garg
|
Rohan Garg, Komal Sodha and Gene Cooperman
|
A Generic Checkpoint-Restart Mechanism for Virtual Machines
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is common today to deploy complex software inside a virtual machine (VM).
Snapshots provide rapid deployment, migration between hosts, dependability
(fault tolerance), and security (insulating a guest VM from the host). Yet, for
each virtual machine, the code for snapshots is laboriously developed on a
per-VM basis. This work demonstrates a generic checkpoint-restart mechanism for
virtual machines. The mechanism is based on a plugin on top of an unmodified
user-space checkpoint-restart package, DMTCP. Checkpoint-restart is
demonstrated for three virtual machines: Lguest, user-space QEMU, and KVM/QEMU.
The plugins for Lguest and KVM/QEMU require just 200 lines of code. The Lguest
kernel driver API is augmented by 40 lines of code. DMTCP checkpoints
user-space QEMU without any new code. KVM/QEMU, user-space QEMU, and DMTCP need
no modification. The design benefits from other DMTCP features and plugins.
Experiments demonstrate checkpoint and restart in 0.2 seconds using forked
checkpointing, mmap-based fast-restart, and incremental Btrfs-based snapshots.
|
[
{
"version": "v1",
"created": "Sat, 8 Dec 2012 12:56:49 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Garg",
"Rohan",
""
],
[
"Sodha",
"Komal",
""
],
[
"Cooperman",
"Gene",
""
]
] |
new_dataset
| 0.998966 |
1212.1914
|
Sugata Sanyal
|
Manoj Rameshchandra Thakur and Sugata Sanyal
|
A Heuristic Reputation Based System to Detect Spam activities in a
Social Networking Platform, HRSSSNP
|
5 Pages, 1 Figure
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of the social networking platform has drastically affected
the way individuals interact. Even though most of the effects have been
positive, there exist some serious threats associated with the interactions on
a social networking website. A considerable proportion of the crimes that occur
are initiated through a social networking platform [5]. Almost 33% of the
crimes on the internet are initiated through a social networking website [5].
Moreover activities like spam messages create unnecessary traffic and might
affect the user base of a social networking platform. As a result preventing
interactions with malicious intent and spam activities becomes crucial. This
work attempts to detect the same in a social networking platform by considering
a social network as a weighted graph wherein each node, which represents an
individual in the social network, stores activities of other nodes with respect
to itself in an optimized format which is referred to as localized data-set.
The weights associated with the edges in the graph represent the trust
relationship between profiles. The weights of the edges along with the
localized data-set is used to infer whether nodes in the social network are
compromised and are performing spam or malicious activities.
|
[
{
"version": "v1",
"created": "Sun, 9 Dec 2012 20:01:32 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Thakur",
"Manoj Rameshchandra",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.98311 |
1212.1918
|
Juan Manuel Torres Moreno
|
Juan-Manuel Torres-Moreno, Patricia Vel\'azquez-Morales, Jean-Guy
Meunier
|
Condens\'es de textes par des m\'ethodes num\'eriques
|
Conf\'erence JADT 2002, Saint-Malo/France. 12 pages, 7 figures
| null | null | null |
cs.IR cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
Since information in electronic form is already a standard, and that the
variety and the quantity of information become increasingly large, the methods
of summarizing or automatic condensation of texts is a critical phase of the
analysis of texts. This article describes CORTEX a system based on numerical
methods, which allows obtaining a condensation of a text, which is independent
of the topic and of the length of the text. The structure of the system enables
it to find the abstracts in French or Spanish in very short times.
|
[
{
"version": "v1",
"created": "Sun, 9 Dec 2012 20:55:52 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Torres-Moreno",
"Juan-Manuel",
""
],
[
"Velázquez-Morales",
"Patricia",
""
],
[
"Meunier",
"Jean-Guy",
""
]
] |
new_dataset
| 0.987868 |
1212.1929
|
MinJi Kim
|
MinJi Kim, Ali ParandehGheibi, Leonardo Urbina, Muriel Meedard
|
CTCP: Coded TCP using Multiple Paths
|
Manuscript (written in June 2012)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce CTCP, a novel multi-path transport protocol using network
coding. CTCP is designed to incorporate TCP's good features, such as congestion
control and reliability, while improving on TCP's performance in lossy and/or
dynamic networks. CTCP builds upon the ideas of TCP/NC introduced by
Sundararajan et al. and uses network coding to provide robustness against
losses. We introduce the use of multiple paths to provide robustness against
mobility and network failures. We provide an implementation of CTCP (in
userspace) to demonstrate its performance.
|
[
{
"version": "v1",
"created": "Sun, 9 Dec 2012 22:46:37 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Kim",
"MinJi",
""
],
[
"ParandehGheibi",
"Ali",
""
],
[
"Urbina",
"Leonardo",
""
],
[
"Meedard",
"Muriel",
""
]
] |
new_dataset
| 0.999482 |
1212.1986
|
Lee Worden
|
Lee Worden
|
WorkingWiki: a MediaWiki-based platform for collaborative research
|
11 pages, 3 figures. Presented at ITP 2011 Workshop on Mathematical
Wikis. Source code archived with revision history at
<http://lalashan.mcmaster.ca/theobio/projects/index.php/Paper_for_MathWikis-2011>
| null | null | null |
cs.HC cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
WorkingWiki is a software extension for the popular MediaWiki platform that
makes a wiki into a powerful environment for collaborating on
publication-quality manuscripts and software projects. Developed in Jonathan
Dushoff's theoretical biology lab at McMaster University and available as free
software, it allows wiki users to work together on anything that can be done by
using UNIX commands to transform textual "source code" into output. Researchers
can use it to collaborate on programs written in R, python, C, or any other
language, and there are special features to support easy work on LaTeX
documents. It develops the potential of the wiki medium to serve as a
combination collaborative text editor, development environment, revision
control system, and publishing platform. Its potential uses are open-ended -
its processing is controlled by makefiles that are straightforward to customize
- and its modular design is intended to allow parts of it to be adapted to
other purposes.
|
[
{
"version": "v1",
"created": "Mon, 10 Dec 2012 07:10:51 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Worden",
"Lee",
""
]
] |
new_dataset
| 0.999189 |
1212.2056
|
Giacoma Monreale
|
Giacoma Valentina Monreale, Ugo Montanari and Nicklas Hoch
|
Soft Constraint Logic Programming for Electric Vehicle Travel
Optimization
|
17 pages; 26th Workshop on Logic Programming - 2012
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Soft Constraint Logic Programming is a natural and flexible declarative
programming formalism, which allows to model and solve real-life problems
involving constraints of different types.
In this paper, after providing a slightly more general and elegant
presentation of the framework, we show how we can apply it to the e-mobility
problem of coordinating electric vehicles in order to overcome both energetic
and temporal constraints and so to reduce their running cost. In particular, we
focus on the journey optimization sub-problem, considering sequences of trips
from a user's appointment to another one. Solutions provide the best
alternatives in terms of time and energy consumption, including route sequences
and possible charging events.
|
[
{
"version": "v1",
"created": "Mon, 10 Dec 2012 13:30:23 GMT"
}
] | 2012-12-11T00:00:00 |
[
[
"Monreale",
"Giacoma Valentina",
""
],
[
"Montanari",
"Ugo",
""
],
[
"Hoch",
"Nicklas",
""
]
] |
new_dataset
| 0.970153 |
1212.1621
|
Luca De Cicco
|
Luca De Cicco, Saverio Mascolo
|
TCP Congestion Control over HSDPA: an Experimental Evaluation
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we focus on the experimental evaluation of TCP over the High
Speed Downlink Packet Access (HSDPA), an upgrade of UMTS that is getting
worldwide deployment. Today, this is particularly important in view of the
"liberalization" brought in by the Linux OS which offers several variants of
TCP congestion control. In particular, we consider four TCP variants: 1) TCP
NewReno, which is the only congestion control standardized by the IETF; 2) TCP
BIC, that was, and 3) TCP Cubic that is the default algorithm in the Linux OS;
4) Westwood+ TCP that has been shown to be particularly effective over wireless
links. Main results are that all the TCP variants provide comparable goodputs
but with significant larger round trip times and number of retransmissions and
timeouts in the case of TCP BIC/Cubic, which is a consequence of their more
aggressive probing phases. On the other hand, TCP Westwood+ provides the
shortest round trip delays, which is an effect of its unique way of setting
control windows after congestion episode based on bandwidth measurements.
|
[
{
"version": "v1",
"created": "Fri, 7 Dec 2012 14:50:43 GMT"
}
] | 2012-12-10T00:00:00 |
[
[
"De Cicco",
"Luca",
""
],
[
"Mascolo",
"Saverio",
""
]
] |
new_dataset
| 0.999415 |
1104.5643
|
Lucas Gerin
|
Marie Albenque (LIX), Lucas Gerin (MODAL'X)
|
On the algebraic numbers computable by some generalized Ehrenfest urns
| null |
Discrete Mathematics and Theoretical Computer Science 14, 2 (2012)
271-284
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article deals with some stochastic population protocols, motivated by
theoretical aspects of distributed computing. We modelize the problem by a
large urn of black and white balls from which at every time unit a fixed number
of balls are drawn and their colors are changed according to the number of
black balls among them. When the time and the number of balls both tend to
infinity the proportion of black balls converges to an algebraic number. We
prove that, surprisingly enough, not every algebraic number can be "computed"
this way.
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2011 15:00:08 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Dec 2012 08:50:18 GMT"
}
] | 2012-12-07T00:00:00 |
[
[
"Albenque",
"Marie",
"",
"LIX"
],
[
"Gerin",
"Lucas",
"",
"MODAL'X"
]
] |
new_dataset
| 0.994269 |
1112.4626
|
Martin N\"ollenburg
|
Jan-Hinrich K\"amper, Stephen G. Kobourov, Martin N\"ollenburg
|
Circular-Arc Cartograms
|
10 pages, 14 figures, extended version of proceedings paper in
PacificVis 2013
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new circular-arc cartogram model in which countries are drawn as
polygons with circular arcs instead of straight-line segments. Given a
political map and values associated with each country in the map, a cartogram
is a distorted map in which the areas of the countries are proportional to the
corresponding values. In the circular-arc cartogram model straight-line
segments can be replaced by circular arcs in order to modify the areas of the
polygons, while the corners of the polygons remain fixed. The countries in
circular-arc cartograms have the aesthetically pleasing appearance of clouds or
snowflakes, depending on whether their edges are bent outwards or inwards. This
makes it easy to determine whether a country has grown or shrunk, just by its
overall shape. We show that determining whether a given map and given
area-values can be realized as a circular-arc cartogram is an NP-hard problem.
Next we describe a heuristic method for constructing circular-arc cartograms,
which uses a max-flow computation on the dual graph of the map, along with a
computation of the straight skeleton of the underlying polygonal decomposition.
Our method is implemented and produces cartograms that, while not yet perfectly
accurate, achieve many of the desired areas in our real-world examples.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2011 09:47:17 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Dec 2012 14:12:29 GMT"
}
] | 2012-12-07T00:00:00 |
[
[
"Kämper",
"Jan-Hinrich",
""
],
[
"Kobourov",
"Stephen G.",
""
],
[
"Nöllenburg",
"Martin",
""
]
] |
new_dataset
| 0.999003 |
1212.1329
|
Asha V
|
V. Asha, N. U. Bhajantri, and P. Nagabhushan
|
Automatic Detection of Texture Defects Using Texture-Periodicity and
Gabor Wavelets
|
06 Pages, 04 Figures, ICIP 2011
|
CCIS 157, Computer Networks and Intelligent Computing, Part 9, pp.
548-553, Springer-Verlag, Berlin Heidelberg, 2011
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a machine vision algorithm for automatically
detecting defects in textures belonging to 16 out of 17 wallpaper groups using
texture-periodicity and a family of Gabor wavelets. Input defective images are
subjected to Gabor wavelet transformation in multi-scales and
multi-orientations and a resultant image is obtained in L2 norm. The resultant
image is split into several periodic blocks and energy of each block is used as
a feature space to automatically identify defective and defect-free blocks
using Ward's hierarchical clustering. Experiments on defective fabric images of
three major wallpaper groups, namely, pmm, p2 and p4m, show that the proposed
method is robust in finding fabric defects without human intervention and can
be used for automatic defect detection in fabric industries.
|
[
{
"version": "v1",
"created": "Thu, 6 Dec 2012 14:17:21 GMT"
}
] | 2012-12-07T00:00:00 |
[
[
"Asha",
"V.",
""
],
[
"Bhajantri",
"N. U.",
""
],
[
"Nagabhushan",
"P.",
""
]
] |
new_dataset
| 0.982827 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.