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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1302.5662
|
Ivana Maric
|
Ivana Maric
|
Low Latency Communications
|
Presented at the Information Theory and Applications Workshop (ITA
2013), Feb 10-15, 2013, San Diego, CA
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Numerous applications demand communication schemes that minimize the
transmission delay while achieving a given level of reliability. An extreme
case is high-frequency trading whereby saving a fraction of millisecond over a
route between Chicago and New York can be a game-changer. While such
communications are often carried by fiber, microwave links can reduce
transmission delays over large distances due to more direct routes and faster
wave propagation. In order to bridge large distances, information is sent over
a multihop relay network.
Motivated by these applications, this papers present an information-theoretic
approach to the design of optimal multihop microwave networks that minimizes
end-to-end transmission delay. To characterize the delay introduced by coding,
we derive error exponents achievable in multihop networks. We formulate and
solve an optimization problem that determines optimal selection of
amplify-and-forward and decode-and-forward relays. We present the optimal
solution for several examples of networks. We prove that in high SNR the
optimum transmission scheme is for all relays to perform amplify-and-forward.
We then analyze the impact of deploying noisy feedback
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 17:48:38 GMT"
}
] | 2013-02-25T00:00:00 |
[
[
"Maric",
"Ivana",
""
]
] |
new_dataset
| 0.991544 |
1302.5130
|
Mohammed El-Dosuky
|
A. S. Tolba, M. Z. Rashad, M. A. El-Dosuky
|
Quantum-inspired Huffman Coding
| null | null | null | null |
cs.IT cs.ET math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Huffman Compression, also known as Huffman Coding, is one of many compression
techniques in use today. The two important features of Huffman coding are
instantaneousness that is the codes can be interpreted as soon as they are
received and variable length that is a most frequent symbol has length smaller
than a less frequent symbol. The traditional Huffman coding has two procedures:
constructing a tree in O(n^2) and then traversing it in O(n). Quantum computing
is a promising approach of computation that is based on equations from Quantum
Mechanics. Instantaneousness and variable length features are difficult to
generalize to the quantum case. The quantum coding field is pioneered by
Schumacher works on block coding scheme. To encode N signals sequentially, it
requires O(N3) computational steps. The encoding and decoding processes are far
from instantaneous. Moreover, the lengths of all the codewords are the same. A
Huffman-coding-inspired scheme for the storage of quantum information takes
O(N(log N)a) computational steps for a sequential implementation on
non-parallel machines.
|
[
{
"version": "v1",
"created": "Wed, 20 Feb 2013 21:33:23 GMT"
}
] | 2013-02-22T00:00:00 |
[
[
"Tolba",
"A. S.",
""
],
[
"Rashad",
"M. Z.",
""
],
[
"El-Dosuky",
"M. A.",
""
]
] |
new_dataset
| 0.999744 |
1302.5166
|
Aria Nosratinia
|
Thuy Van Nguyen, Aria Nosratinia, and Dariush Divsalar
|
Rate-Compatible Short-Length Protograph LDPC Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper produces a rate-compatible protograph LDPC code at 1k information
blocklength with superior performance in both waterfall and error floor
regions. The design of such codes has proved difficult in the past because the
constraints imposed by structured design (protographs), rate-compatibility, as
well as small block length, are not easily satisfied together. For example, as
the block length decreases, the predominance of decoding threshold as the main
parameter in coding design is reduced, thus complicating the search for good
codes. Our rate-compatible protograph codes have rates ranging from 1/3 to 4/5
and show no error floor down to $10^{-6}$ FER.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2013 03:08:33 GMT"
}
] | 2013-02-22T00:00:00 |
[
[
"Van Nguyen",
"Thuy",
""
],
[
"Nosratinia",
"Aria",
""
],
[
"Divsalar",
"Dariush",
""
]
] |
new_dataset
| 0.983309 |
1302.5199
|
Arunasalam Sambhanthan
|
Arunasalam Sambhanthan, Alice Good
|
A Virtual World Model to Enhance Tourism Destination Accessibility in
Developing Countries
|
Conference paper
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of destination accessibility is a vital concern in the
sustainable tourism development in the emerging regions due to the increasing
numbers of tourism business growth in the recent times. Tourism is one of the
potential foreign exchange earning sectors, which place sustainability as one
of the main success metrics for benchmarking the industry's overall
development. On the other hand, there are several destinations, which are
inaccessible to tourists due to several reasons. Underutilization of potential
destinations in both pre purchase and consumption stages is a strategic
disadvantage for emerging countries on leading their tourism industry towards
sustainability. A virtual world model to increase the destination accessibility
of tourism products has been proposed. The model has to be designed with visual
and auditory experience to tourists. The model is expected to enhance the
accessibility of destinations for users of different categories. Elderly users,
users with panic disorders, users with mobility impairments also will be able
to enjoy traveling experience just same as other, through the proposed model.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2013 06:39:37 GMT"
}
] | 2013-02-22T00:00:00 |
[
[
"Sambhanthan",
"Arunasalam",
""
],
[
"Good",
"Alice",
""
]
] |
new_dataset
| 0.998642 |
1302.1848
|
Delgado Lopez-Cozar emilio
|
Emilio Delgado Lopez-Cozar, Manuel Ramirez Sanchez
|
H Index of History journals published in Spain according to Google
Scholar Metrics (2007-2011)
|
7 pages, 2 tables
| null | null |
EC3 Working Papers 10
|
cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
Google Scholar Metrics (GSM), which was recently launched in April 2012,
features new bibliometric systems for gauging scientific journals by counting
the number of citations obtained in Google Scholar. This way, it opens new
possibilities for measuring journal impacts in the field of Humanities. The
present article intends to evaluate the scope of this tool through analysing
GSM searches, from the 5th through 6th of December 2012, of History journals
published in Spain. In sum, 69 journals were identified, accounting for only
24% of the History journals published in Spain. The ranges of H index values
for this field are so small that the ranking can no longer be said to show a
discriminating potential. In the light of this, we would like to propose a
change in the way Google Scholar Metrics is designed so that it could also
accommodate production and citation patterns in the particular field of
History, and, in a broader scope, in the area of Humanities as well.
|
[
{
"version": "v1",
"created": "Thu, 7 Feb 2013 20:16:17 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Feb 2013 09:16:17 GMT"
}
] | 2013-02-21T00:00:00 |
[
[
"Lopez-Cozar",
"Emilio Delgado",
""
],
[
"Sanchez",
"Manuel Ramirez",
""
]
] |
new_dataset
| 0.997814 |
1302.4870
|
Shaheena Sultana
|
Shaheena Sultana and Md. Saidur Rahman and Arpita Roy and Suraiya
Tairin
|
Bar 1-Visibility Drawings of 1-Planar Graphs
|
15 pages, 9 figures
| null | null | null |
cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each
vertex is drawn as a horizontal line segment called a bar, each edge is drawn
as a vertical line segment where the vertical line segment representing an edge
must connect the horizontal line segments representing the end vertices and a
vertical line segment corresponding to an edge intersects at most one bar which
is not an end point of the edge. A graph $G$ is bar 1-visible if $G$ has a bar
1-visibility drawing. A graph $G$ is 1-planar if $G$ has a drawing in a
2-dimensional plane such that an edge crosses at most one other edge. In this
paper we give linear-time algorithms to find bar 1-visibility drawings of
diagonal grid graphs and maximal outer 1-planar graphs. We also show that
recursive quadrangle 1-planar graphs and pseudo double wheel 1-planar graphs
are bar 1-visible graphs.
|
[
{
"version": "v1",
"created": "Wed, 20 Feb 2013 11:00:29 GMT"
}
] | 2013-02-21T00:00:00 |
[
[
"Sultana",
"Shaheena",
""
],
[
"Rahman",
"Md. Saidur",
""
],
[
"Roy",
"Arpita",
""
],
[
"Tairin",
"Suraiya",
""
]
] |
new_dataset
| 0.999516 |
1302.4989
|
Nic Wilson
|
Nic Wilson
|
An Order of Magnitude Calculus
|
Appears in Proceedings of the Eleventh Conference on Uncertainty in
Artificial Intelligence (UAI1995)
| null | null |
UAI-P-1995-PG-548-555
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper develops a simple calculus for order of magnitude reasoning. A
semantics is given with soundness and completeness results. Order of magnitude
probability functions are easily defined and turn out to be equivalent to kappa
functions, which are slight generalizations of Spohn's Natural Conditional
Functions. The calculus also gives rise to an order of magnitude decision
theory, which can be used to justify an amended version of Pearl's decision
theory for kappa functions, although the latter is weaker and less expressive.
|
[
{
"version": "v1",
"created": "Wed, 20 Feb 2013 15:24:11 GMT"
}
] | 2013-02-21T00:00:00 |
[
[
"Wilson",
"Nic",
""
]
] |
new_dataset
| 0.993377 |
1209.0263
|
Rahul Jain
|
Rahul Jain, Penghui Yao
|
A strong direct product theorem in terms of the smooth rectangle bound
|
12 pages, version 3, improved parameters in the main result
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A strong direct product theorem states that, in order to solve k instances of
a problem, if we provide less than k times the resource required to compute one
instance, then the probability of overall success is exponentially small in k.
In this paper, we consider the model of two-way public-coin communication
complexity and show a strong direct product theorem for all relations in terms
of the smooth rectangle bound, introduced by Jain and Klauck as a generic lower
bound method in this model. Our result therefore uniformly implies a strong
direct product theorem for all relations for which an (asymptotically) optimal
lower bound can be provided using the smooth rectangle bound, for example Inner
Product, Greater-Than, Set-Disjointness, Gap-Hamming Distance etc. Our result
also implies near optimal direct product results for several important
functions and relations used to show exponential separations between classical
and quantum communication complexity, for which near optimal lower bounds are
provided using the rectangle bound, for example by Raz [1999], Gavinsky [2008]
and Klartag and Regev [2011]. In fact we are not aware of any relation for
which it is known that the smooth rectangle bound does not provide an optimal
lower bound. This lower bound subsumes many of the other lower bound methods,
for example the rectangle bound (a.k.a the corruption bound), the smooth
discrepancy bound (a.k.a the \gamma_2 bound) which in turn subsumes the
discrepancy bound, the subdistribution bound and the conditional min-entropy
bound.
We show our result using information theoretic arguments. A key tool we use
is a sampling protocol due to Braverman [2012], in fact a modification of it
used by Kerenidis, Laplante, Lerays, Roland and Xiao [2012].
|
[
{
"version": "v1",
"created": "Mon, 3 Sep 2012 08:02:29 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Sep 2012 05:48:28 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Feb 2013 08:24:25 GMT"
}
] | 2013-02-20T00:00:00 |
[
[
"Jain",
"Rahul",
""
],
[
"Yao",
"Penghui",
""
]
] |
new_dataset
| 0.964327 |
1302.4464
|
Hooman Jarollahi
|
Hooman Jarollahi (EIT) (Student Member IEEE) and Richard F. Hobson
|
Dynamic Power Reduction in a Novel CMOS 5T-SRAM for Low-Power SoC
|
7 pages, CDES'10 - The 2010 International Conference on Computer
Design
| null | null | null |
cs.AR cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses a novel five-transistor (5T) CMOS SRAM design with high
performance and reliability in 65nm CMOS, and illustrates how it reduces the
dynamic power consumption in comparison with the conventional and low-power 6T
SRAM counterparts. This design can be used as cache memory in processors and
low-power portable devices. The proposed SRAM cell features ~13% area reduction
compared to a conventional 6T cell, and features a unique bit-line and negative
supply voltage biasing methodology and ground control architecture to enhance
performance, and suppress standby leakage power.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2013 21:24:22 GMT"
}
] | 2013-02-20T00:00:00 |
[
[
"Jarollahi",
"Hooman",
"",
"EIT"
],
[
"Hobson",
"Richard F.",
""
]
] |
new_dataset
| 0.995979 |
1302.4619
|
Dmitry Lande
|
D.V. Lande, A.A.Snarskii
|
Compactified Horizontal Visibility Graph for the Language Network
|
9 pages, 3 figures, 2 appendix tables
| null | null | null |
cs.CL cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A compactified horizontal visibility graph for the language network is
proposed. It was found that the networks constructed in such way are scale
free, and have a property that among the nodes with largest degrees there are
words that determine not only a text structure communication, but also its
informational structure.
|
[
{
"version": "v1",
"created": "Tue, 19 Feb 2013 14:32:17 GMT"
}
] | 2013-02-20T00:00:00 |
[
[
"Lande",
"D. V.",
""
],
[
"Snarskii",
"A. A.",
""
]
] |
new_dataset
| 0.99907 |
1302.4720
|
Maurizio Bocca Ph.D.
|
Maurizio Bocca, Ossi Kaltiokallio, Neal Patwari, Suresh
Venkatasubramanian
|
Multiple Target Tracking with RF Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RF sensor networks are wireless networks that can localize and track people
(or targets) without needing them to carry or wear any electronic device. They
use the change in the received signal strength (RSS) of the links due to the
movements of people to infer their locations. In this paper, we consider
real-time multiple target tracking with RF sensor networks. We perform radio
tomographic imaging (RTI), which generates images of the change in the
propagation field, as if they were frames of a video. Our RTI method uses RSS
measurements on multiple frequency channels on each link, combining them with a
fade level-based weighted average. We describe methods to adapt machine vision
methods to the peculiarities of RTI to enable real time multiple target
tracking. Several tests are performed in an open environment, a one-bedroom
apartment, and a cluttered office environment. The results demonstrate that the
system is capable of accurately tracking in real-time up to 4 targets in
cluttered indoor environments, even when their trajectories intersect multiple
times, without mis-estimating the number of targets found in the monitored
area. The highest average tracking error measured in the tests is 0.45 m with
two targets, 0.46 m with three targets, and 0.55 m with four targets.
|
[
{
"version": "v1",
"created": "Mon, 11 Feb 2013 17:16:30 GMT"
}
] | 2013-02-20T00:00:00 |
[
[
"Bocca",
"Maurizio",
""
],
[
"Kaltiokallio",
"Ossi",
""
],
[
"Patwari",
"Neal",
""
],
[
"Venkatasubramanian",
"Suresh",
""
]
] |
new_dataset
| 0.987622 |
1207.4474
|
Igor Melatti
|
Vadim Alimguzhin, Federico Mari, Igor Melatti, Ivano Salvo, Enrico
Tronci
|
On Model Based Synthesis of Embedded Control Software
|
Accepted for publication by EMSOFT 2012. arXiv admin note:
substantial text overlap with arXiv:1107.5638,arXiv:1207.4098
| null | null | null |
cs.SE cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many Embedded Systems are indeed Software Based Control Systems (SBCSs), that
is control systems whose controller consists of control software running on a
microcontroller device. This motivates investigation on Formal Model Based
Design approaches for control software. Given the formal model of a plant as a
Discrete Time Linear Hybrid System and the implementation specifications (that
is, number of bits in the Analog-to-Digital (AD) conversion)
correct-by-construction control software can be automatically generated from
System Level Formal Specifications of the closed loop system (that is, safety
and liveness requirements), by computing a suitable finite abstraction of the
plant.
With respect to given implementation specifications, the automatically
generated code implements a time optimal control strategy (in terms of set-up
time), has a Worst Case Execution Time linear in the number of AD bits $b$, but
unfortunately, its size grows exponentially with respect to $b$. In many
embedded systems, there are severe restrictions on the computational resources
(such as memory or computational power) available to microcontroller devices.
This paper addresses model based synthesis of control software by trading
system level non-functional requirements (such us optimal set-up time, ripple)
with software non-functional requirements (its footprint). Our experimental
results show the effectiveness of our approach: for the inverted pendulum
benchmark, by using a quantization schema with 12 bits, the size of the small
controller is less than 6% of the size of the time optimal one.
|
[
{
"version": "v1",
"created": "Tue, 17 Jul 2012 05:00:55 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Feb 2013 15:36:59 GMT"
}
] | 2013-02-19T00:00:00 |
[
[
"Alimguzhin",
"Vadim",
""
],
[
"Mari",
"Federico",
""
],
[
"Melatti",
"Igor",
""
],
[
"Salvo",
"Ivano",
""
],
[
"Tronci",
"Enrico",
""
]
] |
new_dataset
| 0.955542 |
1209.0516
|
Paul Hunter
|
Paul Hunter and Jo\"el Ouaknine and James Worrell
|
When is Metric Temporal Logic Expressively Complete?
|
Submitted to ICALP 2013
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL)
has the same expressive power as first-order logic with binary order relation <
and monadic predicates. A key question is whether there exists an analogue of
Kamp's theorem for Metric Temporal Logic (MTL) -- a generalization of LTL in
which the Until and Since modalities are annotated with intervals that express
metric constraints. Hirshfeld and Rabinovich gave a negative answer, showing
that first-order logic with binary order relation < and unary function +1 is
strictly more expressive than MTL with integer constants. However, a recent
result of Hunter, Ouaknine and Worrell shows that with rational timing
constants, MTL has the same expressive power as first-order logic, giving a
positive answer. In this paper we generalize these results by giving a precise
characterization of those sets of constants for which MTL and first-order logic
have the same expressive power. We also show that full first-order
expressiveness can be recovered with the addition of counting modalities,
strongly supporting the assertion of Hirshfeld and Rabinovich that Q2MLO is one
of the most expressive decidable fragments of FO(<,+1).
|
[
{
"version": "v1",
"created": "Tue, 4 Sep 2012 02:30:35 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Feb 2013 03:26:10 GMT"
}
] | 2013-02-19T00:00:00 |
[
[
"Hunter",
"Paul",
""
],
[
"Ouaknine",
"Joël",
""
],
[
"Worrell",
"James",
""
]
] |
new_dataset
| 0.958522 |
1302.3160
|
Xiuli Wang
|
Xiuli Wang
|
A New Construction of Multi-receiver Authentication Codes from
Pseudo-Symplectic Geometry over Finite Fields
|
9 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-receiver authentication codes allow one sender to construct an
authenticated message for a group of receivers such that each receiver can
verify authenticity of the received message. In this paper, we constructed one
multi-receiver authentication codes from pseudo-symplectic geometry over finite
fields. The parameters and the probabilities of deceptions of this codes are
also computed.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2013 16:40:02 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Feb 2013 03:26:01 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Feb 2013 05:43:44 GMT"
}
] | 2013-02-19T00:00:00 |
[
[
"Wang",
"Xiuli",
""
]
] |
new_dataset
| 0.987089 |
1302.4010
|
Di Ma
|
Haoyu Li, Di Ma, Nitesh Saxena, Babins Shrestha, and Yan Zhu
|
Tap-Wave-Rub: Lightweight Malware Prevention for Smartphones Using
Intuitive Human Gestures
|
13 pages, 4 figures, 2 tables, partial of this extended technical
report appears as a short paper in ACM WiSec'13
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a lightweight permission enforcement approach -
Tap-Wave-Rub (TWR) - for smartphone malware prevention. TWR is based on simple
human gestures that are very quick and intuitive but less likely to be
exhibited in users' daily activities. Presence or absence of such gestures,
prior to accessing an application, can effectively inform the OS whether the
access request is benign or malicious. Specifically, we present the design of
two mechanisms: (1) accelerometer based phone tapping detection; and (2)
proximity sensor based finger tapping, rubbing or hand waving detection. The
first mechanism is geared for NFC applications, which usually require the user
to tap her phone with another device. The second mechanism involves very simple
gestures, i.e., tapping or rubbing a finger near the top of phone's screen or
waving a hand close to the phone, and broadly appeals to many applications
(e.g., SMS). In addition, we present the TWR-enhanced Android permission model,
the prototypes implementing the underlying gesture recognition mechanisms, and
a variety of novel experiments to evaluate these mechanisms. Our results
suggest the proposed approach could be very effective for malware detection and
prevention, with quite low false positives and false negatives, while imposing
little to no additional burden on the users.
|
[
{
"version": "v1",
"created": "Sat, 16 Feb 2013 22:56:20 GMT"
}
] | 2013-02-19T00:00:00 |
[
[
"Li",
"Haoyu",
""
],
[
"Ma",
"Di",
""
],
[
"Saxena",
"Nitesh",
""
],
[
"Shrestha",
"Babins",
""
],
[
"Zhu",
"Yan",
""
]
] |
new_dataset
| 0.998784 |
1302.4129
|
Eyal En Gad
|
Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot and
Zvonimir Bandic
|
Repair-Optimal MDS Array Codes over GF(2)
|
5 pages, submitted to ISIT 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Maximum-distance separable (MDS) array codes with high rate and an optimal
repair property were introduced recently. These codes could be applied in
distributed storage systems, where they minimize the communication and disk
access required for the recovery of failed nodes. However, the encoding and
decoding algorithms of the proposed codes use arithmetic over finite fields of
order greater than 2, which could result in a complex implementation.
In this work, we present a construction of 2-parity MDS array codes, that
allow for optimal repair of a failed information node using XOR operations
only. The reduction of the field order is achieved by allowing more parity bits
to be updated when a single information bit is being changed by the user.
|
[
{
"version": "v1",
"created": "Sun, 17 Feb 2013 22:43:20 GMT"
}
] | 2013-02-19T00:00:00 |
[
[
"Gad",
"Eyal En",
""
],
[
"Mateescu",
"Robert",
""
],
[
"Blagojevic",
"Filip",
""
],
[
"Guyot",
"Cyril",
""
],
[
"Bandic",
"Zvonimir",
""
]
] |
new_dataset
| 0.997694 |
1302.4133
|
Viet Hung Nguyen
|
Viet Hung Nguyen and Fabio Massacci
|
The (Un)Reliability of NVD Vulnerable Versions Data: an Empirical
Experiment on Google Chrome Vulnerabilities
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NVD is one of the most popular databases used by researchers to conduct
empirical research on data sets of vulnerabilities. Our recent analysis on
Chrome vulnerability data reported by NVD has revealed an abnormally phenomenon
in the data where almost vulnerabilities were originated from the first
versions. This inspires our experiment to validate the reliability of the NVD
vulnerable version data. In this experiment, we verify for each version of
Chrome that NVD claims vulnerable is actually vulnerable. The experiment
revealed several errors in the vulnerability data of Chrome. Furthermore, we
have also analyzed how these errors might impact the conclusions of an
empirical study on foundational vulnerability. Our results show that different
conclusions could be obtained due to the data errors.
|
[
{
"version": "v1",
"created": "Sun, 17 Feb 2013 23:19:52 GMT"
}
] | 2013-02-19T00:00:00 |
[
[
"Nguyen",
"Viet Hung",
""
],
[
"Massacci",
"Fabio",
""
]
] |
new_dataset
| 0.985815 |
1302.3562
|
Craig Boutilier
|
Craig Boutilier, Nir Friedman, Moises Goldszmidt, Daphne Koller
|
Context-Specific Independence in Bayesian Networks
|
Appears in Proceedings of the Twelfth Conference on Uncertainty in
Artificial Intelligence (UAI1996)
| null | null |
UAI-P-1996-PG-115-123
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bayesian networks provide a language for qualitatively representing the
conditional independence properties of a distribution. This allows a natural
and compact representation of the distribution, eases knowledge acquisition,
and supports effective inference algorithms. It is well-known, however, that
there are certain independencies that we cannot capture qualitatively within
the Bayesian network structure: independencies that hold only in certain
contexts, i.e., given a specific assignment of values to certain variables. In
this paper, we propose a formal notion of context-specific independence (CSI),
based on regularities in the conditional probability tables (CPTs) at a node.
We present a technique, analogous to (and based on) d-separation, for
determining when such independence holds in a given network. We then focus on a
particular qualitative representation scheme - tree-structured CPTs - for
capturing CSI. We suggest ways in which this representation can be used to
support effective inference algorithms. In particular, we present a structural
decomposition of the resulting network which can improve the performance of
clustering algorithms, and an alternative algorithm based on cutset
conditioning.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2013 14:12:34 GMT"
}
] | 2013-02-18T00:00:00 |
[
[
"Boutilier",
"Craig",
""
],
[
"Friedman",
"Nir",
""
],
[
"Goldszmidt",
"Moises",
""
],
[
"Koller",
"Daphne",
""
]
] |
new_dataset
| 0.99829 |
1302.3681
|
Manish Gupta
|
Manish K Gupta and Anupam Agrawal and Deepak Yadav
|
On Weak Dress Codes for Cloud Storage
|
6 pages, 7 figures, submitted to NetCod 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a distributed storage network, reliability and bandwidth optimization can
be provided by regenerating codes. Recently table based regenerating codes viz.
DRESS (Distributed Replication-based Exact Simple Storage) codes has been
proposed which also optimizes the disk I/O. Dress codes consists of an outer
MDS code with an inner fractional repetition (FR) code with replication degree
$\rho$. Several constructions of FR codes based on regular graphs, resolvable
designs and bipartite graphs are known. This paper presents a simple modular
construction of FR codes. We also generalize the concept of FR codes to weak
fractional repetition (WFR) codes where each node has different number of
packets. We present a construction of WFR codes based on partial regular graph.
Finally we present a simple generalized ring construction of both strong and
weak fractional repetition codes.
|
[
{
"version": "v1",
"created": "Fri, 15 Feb 2013 06:12:26 GMT"
}
] | 2013-02-18T00:00:00 |
[
[
"Gupta",
"Manish K",
""
],
[
"Agrawal",
"Anupam",
""
],
[
"Yadav",
"Deepak",
""
]
] |
new_dataset
| 0.999625 |
1302.3862
|
Luis Filipe Teofilo
|
Lu\'is Filipe Te\'ofilo, Pedro Alves Nogueira, Pedro Brand\~ao Silva
|
GEMINI: A Generic Multi-Modal Natural Interface Framework for Videogames
|
WorldCIST'13 Internacional Conference
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years videogame companies have recognized the role of player
engagement as a major factor in user experience and enjoyment. This encouraged
a greater investment in new types of game controllers such as the WiiMote, Rock
Band instruments and the Kinect. However, the native software of these
controllers was not originally designed to be used in other game applications.
This work addresses this issue by building a middleware framework, which maps
body poses or voice commands to actions in any game. This not only warrants a
more natural and customized user-experience but it also defines an
interoperable virtual controller. In this version of the framework, body poses
and voice commands are respectively recognized through the Kinect's built-in
cameras and microphones. The acquired data is then translated into the native
interaction scheme in real time using a lightweight method based on spatial
restrictions. The system is also prepared to use Nintendo's Wiimote as an
auxiliary and unobtrusive gamepad for physically or verbally impractical
commands. System validation was performed by analyzing the performance of
certain tasks and examining user reports. Both confirmed this approach as a
practical and alluring alternative to the game's native interaction scheme. In
sum, this framework provides a game-controlling tool that is totally
customizable and very flexible, thus expanding the market of game consumers.
|
[
{
"version": "v1",
"created": "Fri, 15 Feb 2013 20:18:30 GMT"
}
] | 2013-02-18T00:00:00 |
[
[
"Teófilo",
"Luís Filipe",
""
],
[
"Nogueira",
"Pedro Alves",
""
],
[
"Silva",
"Pedro Brandão",
""
]
] |
new_dataset
| 0.999615 |
1102.3413
|
Reza Khosravi-Farsani
|
Ali Haghi, Reza K. Farsani, Mohammad Reza Aref, and Farokh Marvasti
|
The Capacity Region of p-Transmitter/q-Receiver Multiple-Access Channels
with Common Information
|
29 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the capacity problem for some multiple-access
scenarios with cooperative transmitters. First, a general Multiple-Access
Channel (MAC) with common information, i.e., a scenario where p transmitters
send private messages and also a common message to q receivers and each
receiver decodes all of the messages, is considered. The capacity region of the
discrete memoryless channel is characterized. Then, the general Gaussian fading
MAC with common information wherein partial Channel State Information (CSI) is
available at the transmitters (CSIT) and perfect CSI is available at the
receivers (CSIR) is investigated. A coding theorem is proved for this model
that yields an exact characterization of the throughput capacity region.
Finally, a two-transmitter/one-receiver Gaussian fading MAC with conferencing
encoders with partial CSIT and perfect CSIR is studied and its capacity region
is determined. For the Gaussian fading models with CSIR only (transmitters have
no access to CSIT), some numerical examples and simulation results are provided
for Rayleigh fading.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 19:56:41 GMT"
}
] | 2013-02-17T00:00:00 |
[
[
"Haghi",
"Ali",
""
],
[
"Farsani",
"Reza K.",
""
],
[
"Aref",
"Mohammad Reza",
""
],
[
"Marvasti",
"Farokh",
""
]
] |
new_dataset
| 0.996305 |
1203.6233
|
Seyed Abolfazl Motahari
|
Abolfazl Motahari, Guy Bresler and David Tse
|
Information Theory of DNA Shotgun Sequencing
|
Revised Version
| null | null | null |
cs.IT math.IT q-bio.GN q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DNA sequencing is the basic workhorse of modern day biology and medicine.
Shotgun sequencing is the dominant technique used: many randomly located short
fragments called reads are extracted from the DNA sequence, and these reads are
assembled to reconstruct the original sequence. A basic question is: given a
sequencing technology and the statistics of the DNA sequence, what is the
minimum number of reads required for reliable reconstruction? This number
provides a fundamental limit to the performance of {\em any} assembly
algorithm. For a simple statistical model of the DNA sequence and the read
process, we show that the answer admits a critical phenomena in the asymptotic
limit of long DNA sequences: if the read length is below a threshold,
reconstruction is impossible no matter how many reads are observed, and if the
read length is above the threshold, having enough reads to cover the DNA
sequence is sufficient to reconstruct. The threshold is computed in terms of
the Renyi entropy rate of the DNA sequence. We also study the impact of noise
in the read process on the performance.
|
[
{
"version": "v1",
"created": "Wed, 28 Mar 2012 11:27:54 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Mar 2012 07:00:38 GMT"
},
{
"version": "v3",
"created": "Mon, 9 Jul 2012 16:24:56 GMT"
},
{
"version": "v4",
"created": "Thu, 14 Feb 2013 18:03:49 GMT"
}
] | 2013-02-15T00:00:00 |
[
[
"Motahari",
"Abolfazl",
""
],
[
"Bresler",
"Guy",
""
],
[
"Tse",
"David",
""
]
] |
new_dataset
| 0.971138 |
1301.5765
|
Du Ho Kang Mr.
|
Du Ho Kang, Ki Won Sung, and Jens Zander
|
High Capacity Indoor & Hotspot Wireless System in Shared Spectrum - A
Techno-Economic Analysis
|
This paper has been withdrawn by the author's own decision for future
update for publishing
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Predictions for wireless and mobile Internet access suggest exponential
traffic increase particularly in inbuilding environments. Non-traditional
actors such as facility owners have a growing interest in deploying and
operating their own indoor networks to fulfill the capacity demand. Such local
operators will need spectrum sharing with neighboring networks because they are
not likely to have their own dedicated spectrum. Management of inter-network
interference then becomes a key issue for high capacity provision. Tight
operator-wise cooperation provides superior performance, but at the expense of
high infrastructure cost and business-related barriers. Limited coordination on
the other hand causes harmful interference between operators which in turn will
require even denser networks. In this paper, we propose a techno-economic
analysis framework for investigating and comparing the strategies of the indoor
operators. We refine a traditional network cost model by introducing new
inter-operator cost factors. Then, we present a numerical example to
demonstrate how the proposed framework can help us comparing different operator
strategies. Finally, we suggest areas for future research.
|
[
{
"version": "v1",
"created": "Thu, 24 Jan 2013 12:11:22 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Feb 2013 08:07:31 GMT"
}
] | 2013-02-15T00:00:00 |
[
[
"Kang",
"Du Ho",
""
],
[
"Sung",
"Ki Won",
""
],
[
"Zander",
"Jens",
""
]
] |
new_dataset
| 0.996804 |
1302.1836
|
Reza Khosravi-Farsani
|
Reza K. Farsani
|
The Capacity Region of the Wireless Ergodic Fading Interference Channel
with Partial CSIT to Within One Bit
|
21 pages. A shorter version was also submitted for conference
publication. In this second version, only the reference [29] was edited
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fundamental capacity limits are studied for the two-user wireless ergodic
fading IC with partial Channel State Information at the Transmitters (CSIT)
where each transmitter is equipped with an arbitrary deterministic function of
the channel state (this model yields a full control over how much state
information is available). One of the main challenges in the analysis of fading
networks, specifically multi-receiver networks including fading ICs, is to
obtain efficient capacity outer bounds. In this paper, a novel capacity outer
bound is established for the two-user ergodic fading IC. For this purpose, by a
subtle combination of broadcast channel techniques (i.e., manipulating mutual
information functions composed of vector random variables by Csiszar-Korner
identity) and genie-aided techniques, first a single-letter outer bound
characterized by mutual information functions including some auxiliary random
variables is derived. Then, by novel arguments the derived bound is optimized
over its auxiliaries only using the entropy power inequality. Besides being
well-described, our outer bound is efficient from several aspects.
Specifically, it is optimal for the fading IC with uniformly strong
interference. Also, it is sum-rate optimal for the channel with uniformly mixed
interference. More importantly, it is proved that when each transmitter has
access to any amount of CSIT that includes the interference to noise ratio of
its non-corresponding receiver, the outer bound differs by no more than one bit
from the achievable rate region given by Han-Kobayashi scheme. This result is
viewed as a natural generalization of the ETW to within one bit capacity result
for the static channel to the wireless ergodic fading case.
|
[
{
"version": "v1",
"created": "Thu, 7 Feb 2013 19:32:18 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Feb 2013 20:44:55 GMT"
}
] | 2013-02-15T00:00:00 |
[
[
"Farsani",
"Reza K.",
""
]
] |
new_dataset
| 0.994026 |
1302.3486
|
Nicolas Bousquet
|
Marthe Bonamy and Nicolas Bousquet
|
Recoloring bounded treewidth graphs
|
11 pages, 5 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $k$ be an integer. Two vertex $k$-colorings of a graph are
\emph{adjacent} if they differ on exactly one vertex. A graph is
\emph{$k$-mixing} if any proper $k$-coloring can be transformed into any other
through a sequence of adjacent proper $k$-colorings. Any graph is
$(tw+2)$-mixing, where $tw$ is the treewidth of the graph (Cereceda 2006). We
prove that the shortest sequence between any two $(tw+2)$-colorings is at most
quadratic, a problem left open in Bonamy et al. (2012).
Jerrum proved that any graph is $k$-mixing if $k$ is at least the maximum
degree plus two. We improve Jerrum's bound using the grundy number, which is
the worst number of colors in a greedy coloring.
|
[
{
"version": "v1",
"created": "Thu, 14 Feb 2013 17:43:07 GMT"
}
] | 2013-02-15T00:00:00 |
[
[
"Bonamy",
"Marthe",
""
],
[
"Bousquet",
"Nicolas",
""
]
] |
new_dataset
| 0.970363 |
1302.3545
|
Todd Davies
|
Todd Davies, Benjamin Newman, Brendan O'Connor, Aaron Tam and Leo
Perry
|
Displaying Asynchronous Reactions to a Document: Two Goals and a Design
|
Appeared as a Poster Paper, Conference on Computer Supported
Cooperative Work, 20th Anniversary - Conference Supplement (CSCW 2006, Banff,
November 4-8, 2006), pp. 169-170; Modified as "Document Centered Discussion:
A Design Pattern for Online Deliberation", in D. Schuler, Liberating Voices:
A Pattern Language for Communication Revolution, MIT Press, 2008, pp.
384-386; 2 pages, 1 figure, 1 table
| null | null | null |
cs.HC
|
http://creativecommons.org/licenses/by/3.0/
|
We describe and motivate three goals for the screen display of asynchronous
text deliberation pertaining to a document: (1) visibility of relationships
between comments and the text they reference, between different comments, and
between group members and the document and discussion, and (2)
distinguishability of boundaries between contextually related and unrelated
text and comments and between individual authors of documents and comments.
Interfaces for document-centered discussion generally fail to fulfill one or
both of these goals as well as they could. We describe the design of the new
version of Deme, a Web-based platform for online deliberation, and argue that
it achieves the two goals better than other recent designs.
|
[
{
"version": "v1",
"created": "Thu, 14 Feb 2013 20:45:32 GMT"
}
] | 2013-02-15T00:00:00 |
[
[
"Davies",
"Todd",
""
],
[
"Newman",
"Benjamin",
""
],
[
"O'Connor",
"Brendan",
""
],
[
"Tam",
"Aaron",
""
],
[
"Perry",
"Leo",
""
]
] |
new_dataset
| 0.999168 |
1302.3155
|
Anirban Mukhopadhyay
|
Anirban Mukhopadhyay, Zhen Qian, Suchendra M. Bhandarkar, Tianming
Liu, Sarah Rinehart, Szilard Voros
|
Morphological Analusis Of The Left Ventricular Eendocardial Surface
Using A Bag-Of-Features Descriptor
|
Submitted to Medical Image Analysis
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The limitations of conventional imaging techniques have hitherto precluded a
thorough and formal investigation of the complex morphology of the left
ventricular (LV) endocardial surface and its relation to the severity of
Coronary Artery Disease (CAD). Recent developments in high-resolution
Multirow-Detector Computed Tomography (MDCT) scanner technology have enabled
the imaging of LV endocardial surface morphology in a single heart beat.
Analysis of high-resolution Computed Tomography (CT) images from a 320-MDCT
scanner allows the study of the relationship between percent Diameter Stenosis
(DS) of the major coronary arteries and localization of the cardiac segments
affected by coronary arterial stenosis. In this paper a novel approach for the
analysis using a combination of rigid transformation-invariant shape
descriptors and a more generalized isometry-invariant Bag-of-Features (BoF)
descriptor, is proposed and implemented. The proposed approach is shown to be
successful in identifying, localizing and quantifying the incidence and extent
of CAD and thus, is seen to have a potentially significant clinical impact.
Specifically, the association between the incidence and extent of CAD,
determined via the percent DS measurements of the major coronary arteries, and
the alterations in the endocardial surface morphology is formally quantified. A
multivariate regression test performed on a strict leave-one-out basis are
shown to exhibit a distinct pattern in terms of the correlation coefficient
within the cardiac segments where the incidence of coronary arterial stenosis
is localized.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2013 16:25:19 GMT"
}
] | 2013-02-14T00:00:00 |
[
[
"Mukhopadhyay",
"Anirban",
""
],
[
"Qian",
"Zhen",
""
],
[
"Bhandarkar",
"Suchendra M.",
""
],
[
"Liu",
"Tianming",
""
],
[
"Rinehart",
"Sarah",
""
],
[
"Voros",
"Szilard",
""
]
] |
new_dataset
| 0.998506 |
1302.2840
|
Amirhossein Simjour
|
Lila Kari, Steffen Kopecki, Amirhossein Simjour
|
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly
|
25 pages
| null | null | null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Patterned self-assembly is a process whereby coloured tiles self-assemble to
build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph
automata as an automata-theoretic model for patterned self-assembly. We
investigate the computational power of SA-hypergraph automata and show that for
every recognizable picture language, there exists an SA-hypergraph automaton
that accepts this language. Conversely, we prove that for any restricted
SA-hypergraph automaton, there exists a Wang Tile System, a model for
recognizable picture languages, that accepts the same language. The advantage
of SA-hypergraph automata over Wang automata, acceptors for the class of
recognizable picture languages, is that they do not rely on an a priori defined
scanning strategy
|
[
{
"version": "v1",
"created": "Tue, 12 Feb 2013 16:14:27 GMT"
}
] | 2013-02-13T00:00:00 |
[
[
"Kari",
"Lila",
""
],
[
"Kopecki",
"Steffen",
""
],
[
"Simjour",
"Amirhossein",
""
]
] |
new_dataset
| 0.999477 |
1302.2855
|
Mathis Seidl
|
Mathis Seidl, Andreas Schenk, Clemens Stierstorfer, Johannes B. Huber
|
Polar-Coded Modulaton
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A framework is proposed that allows for a joint description and optimization
of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation
(PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded
modulation (BICM). The conceptual equivalence of polar coding and multilevel
coding is pointed out in detail. Based on a novel characterization of the
channel polarization phenomenon, rules for the optimal choice of the labeling
in coded modulation schemes employing polar codes are developed. Simulation
results regarding the error performance of the proposed schemes on the AWGN
channel are included.
|
[
{
"version": "v1",
"created": "Tue, 12 Feb 2013 16:41:13 GMT"
}
] | 2013-02-13T00:00:00 |
[
[
"Seidl",
"Mathis",
""
],
[
"Schenk",
"Andreas",
""
],
[
"Stierstorfer",
"Clemens",
""
],
[
"Huber",
"Johannes B.",
""
]
] |
new_dataset
| 0.9995 |
1302.2246
|
Patrick Sol\'e
|
Hugues Randriam, Lin Sok, and Patrick Sol\'e
|
Lower bounds on the minimum distance of long codes in the Lee metric
| null | null | null |
13 pages, 7 figures
|
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Gilbert type bound for codes in the title is reviewed, both for small and
large alphabets. Constructive lower bounds better than these existential bounds
are derived from geometric codes, either over Fp or Fp2 ; or over even degree
extensions of Fp: In the latter case the approach is concatena- tion with a
good code for the Hamming metric as outer code and a short code for the Lee
metric as an inner code. In the former case lower bounds on the minimum Lee
distance are derived by algebraic geometric arguments inspired by results of
Wu, Kuijper, Udaya (2007).
|
[
{
"version": "v1",
"created": "Sat, 9 Feb 2013 17:13:10 GMT"
}
] | 2013-02-12T00:00:00 |
[
[
"Randriam",
"Hugues",
""
],
[
"Sok",
"Lin",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.987139 |
1209.6580
|
Jo\~ao Eugenio Marynowski
|
Jo\~ao Eugenio Marynowski, Michel Albonico, Eduardo Cunha de Almeida,
Gerson Suny\'e
|
Testing MapReduce-Based Systems
| null | null | null | null |
cs.DC cs.DB cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MapReduce (MR) is the most popular solution to build applications for
large-scale data processing. These applications are often deployed on large
clusters of commodity machines, where failures happen constantly due to bugs,
hardware problems, and outages. Testing MR-based systems is hard, since it is
needed a great effort of test harness to execute distributed test cases upon
failures. In this paper, we present a novel testing solution to tackle this
issue called HadoopTest. This solution is based on a scalable harness approach,
where distributed tester components are hung around each map and reduce worker
(i.e., node). Testers are allowed to stimulate each worker to inject failures
on them, monitor their behavior, and validate testing results. HadoopTest was
used to test two applications bundled into Hadoop, the Apache open source
MapReduce implementation. Our initial implementation demonstrates promising
results, with HadoopTest coordinating test cases across distributed MapReduce
workers, and finding bugs.
|
[
{
"version": "v1",
"created": "Fri, 28 Sep 2012 17:47:31 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Feb 2013 02:35:01 GMT"
}
] | 2013-02-11T00:00:00 |
[
[
"Marynowski",
"João Eugenio",
""
],
[
"Albonico",
"Michel",
""
],
[
"de Almeida",
"Eduardo Cunha",
""
],
[
"Sunyé",
"Gerson",
""
]
] |
new_dataset
| 0.973054 |
1302.1939
|
R. J. Sobie
|
R.Sobie, A. Agarwal, I. Gable, C. Leavett-Brown, M. Paterson, R.
Taylor, A. Charbonneau, R. Impey, W. Podiama
|
HTC Scientific Computing in a Distributed Cloud Environment
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the use of a distributed cloud computing system for
high-throughput computing (HTC) scientific applications. The distributed cloud
computing system is composed of a number of separate
Infrastructure-as-a-Service (IaaS) clouds that are utilized in a unified
infrastructure. The distributed cloud has been in production-quality operation
for two years with approximately 500,000 completed jobs where a typical
workload has 500 simultaneous embarrassingly-parallel jobs that run for
approximately 12 hours. We review the design and implementation of the system
which is based on pre-existing components and a number of custom components. We
discuss the operation of the system, and describe our plans for the expansion
to more sites and increased computing capacity.
|
[
{
"version": "v1",
"created": "Fri, 8 Feb 2013 04:29:16 GMT"
}
] | 2013-02-11T00:00:00 |
[
[
"Sobie",
"R.",
""
],
[
"Agarwal",
"A.",
""
],
[
"Gable",
"I.",
""
],
[
"Leavett-Brown",
"C.",
""
],
[
"Paterson",
"M.",
""
],
[
"Taylor",
"R.",
""
],
[
"Charbonneau",
"A.",
""
],
[
"Impey",
"R.",
""
],
[
"Podiama",
"W.",
""
]
] |
new_dataset
| 0.999559 |
1302.2017
|
Takeshi Hatanaka
|
Takeshi Hatanaka, Yasuaki Wasa and Masayuki Fujita
|
Cooperative Environmental Monitoring for PTZ Visual Sensor Networks: A
Payoff-based Learning Approach
|
34 pages, 27 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates cooperative environmental monitoring for
Pan-Tilt-Zoom (PTZ) visual sensor networks. We first present a novel
formulation of the optimal environmental monitoring problem, whose objective
function is intertwined with the uncertain state of the environment. In
addition, due to the large volume of vision data, it is desired for each sensor
to execute processing through local computation and communication. To address
the issues, we present a distributed solution to the problem based on game
theoretic cooperative control and payoff-based learning. At the first stage, a
utility function is designed so that the resulting game constitutes a potential
game with potential function equal to the group objective function, where the
designed utility is shown to be computable through local image processing and
communication. Then, we present a payoff-based learning algorithm so that the
sensors are led to the global objective function maximizers without using any
prior information on the environmental state. Finally, we run experiments to
demonstrate the effectiveness of the present approach.
|
[
{
"version": "v1",
"created": "Fri, 8 Feb 2013 12:47:56 GMT"
}
] | 2013-02-11T00:00:00 |
[
[
"Hatanaka",
"Takeshi",
""
],
[
"Wasa",
"Yasuaki",
""
],
[
"Fujita",
"Masayuki",
""
]
] |
new_dataset
| 0.957086 |
1009.4828
|
Slavcho Shtrakov
|
Sl. Shtrakov and J. Koppitz
|
Finite symmetric functions with non-trivial arity gap
|
12 pages
| null | null | null |
cs.DM
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Given an $n$-ary
$k-$valued function $f$, $gap(f)$ denotes the essential arity gap of $f$
which is the minimal number of essential variables in $f$ which become fictive
when identifying any two distinct essential variables in $f$. In the present
paper we study the properties of the symmetric function with non-trivial arity
gap ($2\leq gap(f)$). We prove several results concerning decomposition of the
symmetric functions with non-trivial arity gap with its minors or subfunctions.
We show that all non-empty sets of essential variables in symmetric functions
with non-trivial arity gap are separable.
|
[
{
"version": "v1",
"created": "Fri, 24 Sep 2010 13:01:30 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Oct 2011 14:24:05 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Feb 2013 13:51:03 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Shtrakov",
"Sl.",
""
],
[
"Koppitz",
"J.",
""
]
] |
new_dataset
| 0.976838 |
1302.1402
|
Fabio Protti
|
Andreas Brandst\"adt, Simone Esposito, Loana Tito Nogueira, F\'abio
Protti
|
Clique cycle-transversals in distance-hereditary graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cycle-transversal of a graph G is a subset T of V(G) such that T intersects
every cycle of G. A clique cycle-transversal, or cct for short, is a
cycle-transversal which is a clique. Recognizing graphs which admit a cct can
be done in polynomial time; however, no structural characterization of such
graphs is known. We characterize distance-hereditary graphs admitting a cct in
terms of forbidden induced subgraphs. This extends similar results for chordal
graphs and cographs.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2013 15:16:59 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Feb 2013 12:32:00 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Brandstädt",
"Andreas",
""
],
[
"Esposito",
"Simone",
""
],
[
"Nogueira",
"Loana Tito",
""
],
[
"Protti",
"Fábio",
""
]
] |
new_dataset
| 0.991574 |
1302.1568
|
Yoav Shoham
|
Yoav Shoham
|
Conditional Utility, Utility Independence, and Utility Networks
|
Appears in Proceedings of the Thirteenth Conference on Uncertainty in
Artificial Intelligence (UAI1997)
| null | null |
UAI-P-1997-PG-429-436
|
cs.GT cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new interpretation of two related notions - conditional
utility and utility independence. Unlike the traditional interpretation, the
new interpretation renders the notions the direct analogues of their
probabilistic counterparts. To capture these notions formally, we appeal to the
notion of utility distribution, introduced in previous paper. We show that
utility distributions, which have a structure that is identical to that of
probability distributions, can be viewed as a special case of an additive
multiattribute utility functions, and show how this special case permits us to
capture the novel senses of conditional utility and utility independence.
Finally, we present the notion of utility networks, which do for utilities what
Bayesian networks do for probabilities. Specifically, utility networks exploit
the new interpretation of conditional utility and utility independence to
compactly represent a utility distribution.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2013 15:59:02 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Shoham",
"Yoav",
""
]
] |
new_dataset
| 0.982683 |
1302.1649
|
Rommel Anacan
|
Rommel Anacan, James Greggory Alcayde, Retchel Antegra and Leah Luna
|
Eye-GUIDE (Eye-Gaze User Interface Design) Messaging for
Physically-Impaired People
| null | null |
10.5121/ijdps.2013.4104
| null |
cs.HC cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Eye-GUIDE is an assistive communication tool designed for the paralyzed or
physically impaired people who were unable to move parts of their bodies
especially people whose communications are limited only to eye movements. The
prototype consists of a camera and a computer. Camera captures images then it
will be send to the computer, where the computer will be the one to interpret
the data. Thus, Eye-GUIDE focuses on camera-based gaze tracking. The proponent
designed the prototype to perform simple tasks and provides graphical user
interface in order the paralyzed or physically impaired person can easily use
it.
|
[
{
"version": "v1",
"created": "Thu, 7 Feb 2013 06:47:54 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Anacan",
"Rommel",
""
],
[
"Alcayde",
"James Greggory",
""
],
[
"Antegra",
"Retchel",
""
],
[
"Luna",
"Leah",
""
]
] |
new_dataset
| 0.987213 |
1302.1737
|
Damien Pous
|
Damien Pous (LIP)
|
Kleene Algebra with Tests and Coq Tools for While Programs
|
16+3 pages
| null | null | null |
cs.LO cs.MS cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a Coq library about Kleene algebra with tests, including a proof
of their completeness over the appropriate notion of languages, a decision
procedure for their equational theory, and tools for exploiting hypotheses of a
particular shape in such a theory. Kleene algebra with tests make it possible
to represent if-then-else statements and while loops in most imperative
programming languages. They were actually introduced by Kozen as an alternative
to propositional Hoare logic. We show how to exploit the corresponding Coq
tools in the context of program verification by proving equivalences of while
programs, correctness of some standard compiler optimisations, Hoare rules for
partial correctness, and a particularly challenging equivalence of flowchart
schemes.
|
[
{
"version": "v1",
"created": "Thu, 7 Feb 2013 13:15:45 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Pous",
"Damien",
"",
"LIP"
]
] |
new_dataset
| 0.956485 |
1302.1789
|
Hong Jiang
|
Gang Huang, Hong Jiang, Kim Matthews and Paul Wilford
|
Lensless Compressive Sensing Imaging
|
12 pages, 13 figures
| null | null | null |
cs.CV cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a lensless compressive sensing imaging
architecture. The architecture consists of two components, an aperture assembly
and a sensor. No lens is used. The aperture assembly consists of a two
dimensional array of aperture elements. The transmittance of each aperture
element is independently controllable. The sensor is a single detection
element, such as a single photo-conductive cell. Each aperture element together
with the sensor defines a cone of a bundle of rays, and the cones of the
aperture assembly define the pixels of an image. Each pixel value of an image
is the integration of the bundle of rays in a cone. The sensor is used for
taking compressive measurements. Each measurement is the integration of rays in
the cones modulated by the transmittance of the aperture elements. A
compressive sensing matrix is implemented by adjusting the transmittance of the
individual aperture elements according to the values of the sensing matrix. The
proposed architecture is simple and reliable because no lens is used.
Furthermore, the sharpness of an image from our device is only limited by the
resolution of the aperture assembly, but not affected by blurring due to
defocus. The architecture can be used for capturing images of visible lights,
and other spectra such as infrared, or millimeter waves. Such devices may be
used in surveillance applications for detecting anomalies or extracting
features such as speed of moving objects. Multiple sensors may be used with a
single aperture assembly to capture multi-view images simultaneously. A
prototype was built by using a LCD panel and a photoelectric sensor for
capturing images of visible spectrum.
|
[
{
"version": "v1",
"created": "Thu, 7 Feb 2013 16:00:35 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Huang",
"Gang",
""
],
[
"Jiang",
"Hong",
""
],
[
"Matthews",
"Kim",
""
],
[
"Wilford",
"Paul",
""
]
] |
new_dataset
| 0.998226 |
1302.1837
|
Reza Khosravi-Farsani
|
Reza K. Farsani
|
On the Capacity Region of the Two-User Interference Channel
|
12 pages. In this paper a noisy interference regime is identified for
any two-user interference channel (potentially non-Gaussian). For conference
publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the key open problems in network information theory is to obtain the
capacity region for the two-user Interference Channel (IC). In this paper, new
results are derived for this channel. As a first result, a noisy interference
regime is given for the general IC where the sum-rate capacity is achieved by
treating interference as noise at the receivers. To obtain this result, a
single-letter outer bound in terms of some auxiliary random variables is first
established for the sum-rate capacity of the general IC and then those
conditions under which this outer bound is reduced to the achievable sum-rate
given by the simple treating interference as noise strategy are specified. The
main benefit of this approach is that it is applicable for any two-user IC
(potentially non-Gaussian). For the special case of Gaussian channel, our
result is reduced to the noisy interference regime that was previously
obtained. Next, some results are given on the Han-Kobayashi (HK) achievable
rate region. The evaluation of this rate region is in general difficult. In
this paper, a simple characterization of the HK rate region is derived for some
special cases, specifically, for a novel very weak interference regime. As a
remarkable characteristic, it is shown that for this very weak interference
regime, the achievable sum-rate due to the HK region is identical to the one
given by the simple treating interference as noise strategy.
|
[
{
"version": "v1",
"created": "Thu, 7 Feb 2013 19:41:07 GMT"
}
] | 2013-02-08T00:00:00 |
[
[
"Farsani",
"Reza K.",
""
]
] |
new_dataset
| 0.960216 |
1302.1390
|
Raphael `kena' Poss
|
Mike Lankamp and Raphael Poss and Qiang Yang and Jian Fu and Irfan
Uddin and Chris R. Jesshope
|
MGSim - Simulation tools for multi-core processor architectures
|
33 pages, 22 figures, 4 listings, 2 tables
| null | null | null |
cs.AR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MGSim is an open source discrete event simulator for on-chip hardware
components, developed at the University of Amsterdam. It is intended to be a
research and teaching vehicle to study the fine-grained hardware/software
interactions on many-core and hardware multithreaded processors. It includes
support for core models with different instruction sets, a configurable
multi-core interconnect, multiple configurable cache and memory models, a
dedicated I/O subsystem, and comprehensive monitoring and interaction
facilities. The default model configuration shipped with MGSim implements
Microgrids, a many-core architecture with hardware concurrency management.
MGSim is furthermore written mostly in C++ and uses object classes to represent
chip components. It is optimized for architecture models that can be described
as process networks.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2013 15:00:35 GMT"
}
] | 2013-02-07T00:00:00 |
[
[
"Lankamp",
"Mike",
""
],
[
"Poss",
"Raphael",
""
],
[
"Yang",
"Qiang",
""
],
[
"Fu",
"Jian",
""
],
[
"Uddin",
"Irfan",
""
],
[
"Jesshope",
"Chris R.",
""
]
] |
new_dataset
| 0.999287 |
1302.0952
|
Zhengchun Zhou
|
Zhengchun Zhou, Cunsheng Ding, Jinquan Luo, and Aixian Zhang
|
A Family of Five-Weight Cyclic Codes and Their Weight Enumerators
|
14 Pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. In this paper, a family of $p$-ary
cyclic codes whose duals have three zeros are proposed. The weight distribution
of this family of cyclic codes is determined. It turns out that the proposed
cyclic codes have five nonzero weights.
|
[
{
"version": "v1",
"created": "Tue, 5 Feb 2013 07:46:59 GMT"
}
] | 2013-02-06T00:00:00 |
[
[
"Zhou",
"Zhengchun",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Luo",
"Jinquan",
""
],
[
"Zhang",
"Aixian",
""
]
] |
new_dataset
| 0.999359 |
1109.1041
|
Jianquan Liu
|
Jianquan Liu and Meixia Tao and Youyun Xu
|
Alternative Awaiting and Broadcast for Two-Way Relay Fading Channels
|
to appear in IEEE Transactions on Vehicular Technology, 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate a two-way relay (TWR) fading channel where two source nodes
wish to exchange information with the help of a relay node. Given traditional
TWR protocols, transmission rates in both directions are known to be limited by
the hop with lower capacity, i.e., the min operations between uplink and
downlink. In this paper, we propose a new transmission protocol, named as
alternative awaiting and broadcast (AAB), to cancel the min operations in the
TWR fading channels. The operational principles, new upper bound on ergodic
sum-capacity (ESC) and convergence behavior of average delay of signal
transmission (ST) (in relay buffer) for the proposed AAB protocol are analyzed.
Moreover, we propose a suboptimal encoding/decoding solution for the AAB
protocol and derive an achievable ergodic sum-rate (ESR) with corresponding
average delay of ST. Numerical results show that 1) the proposed AAB protocol
significantly improves the achievable ESR compared to the traditional TWR
protocols, 2) considering the average delay of system service (SS) (in source
buffer), the average delay of ST induced by the proposed AAB protocol is very
small and negligible.
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2011 01:55:56 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Feb 2012 03:55:22 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Jun 2012 06:55:33 GMT"
},
{
"version": "v4",
"created": "Sun, 3 Feb 2013 08:04:13 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"Liu",
"Jianquan",
""
],
[
"Tao",
"Meixia",
""
],
[
"Xu",
"Youyun",
""
]
] |
new_dataset
| 0.966443 |
1111.1823
|
Alessandro De Luca
|
Aldo de Luca, Alessandro De Luca
|
A generalized palindromization map in free monoids
|
Final version, accepted for publication on Theoret. Comput. Sci
|
Theoretical Computer Science 454 (2012) 109-128
|
10.1016/j.tcs.2012.01.029
| null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The palindromization map $\psi$ in a free monoid $A^*$ was introduced in 1997
by the first author in the case of a binary alphabet $A$, and later extended by
other authors to arbitrary alphabets. Acting on infinite words, $\psi$
generates the class of standard episturmian words, including standard
Arnoux-Rauzy words. In this paper we generalize the palindromization map,
starting with a given code $X$ over $A$. The new map $\psi_X$ maps $X^*$ to the
set $PAL$ of palindromes of $A^*$. In this way some properties of $\psi$ are
lost and some are saved in a weak form. When $X$ has a finite deciphering delay
one can extend $\psi_X$ to $X^{\omega}$, generating a class of infinite words
much wider than standard episturmian words. For a finite and maximal code $X$
over $A$, we give a suitable generalization of standard Arnoux-Rauzy words,
called $X$-AR words. We prove that any $X$-AR word is a morphic image of a
standard Arnoux-Rauzy word and we determine some suitable linear lower and
upper bounds to its factor complexity.
For any code $X$ we say that $\psi_X$ is conservative when
$\psi_X(X^{*})\subseteq X^{*}$. We study conservative maps $\psi_X$ and
conditions on $X$ assuring that $\psi_X$ is conservative. We also investigate
the special case of morphic-conservative maps $\psi_{X}$, i.e., maps such that
$\phi\circ \psi = \psi_X\circ \phi$ for an injective morphism $\phi$. Finally,
we generalize $\psi_X$ by replacing palindromic closure with
$\theta$-palindromic closure, where $\theta$ is any involutory antimorphism of
$A^*$. This yields an extension of the class of $\theta$-standard words
introduced by the authors in 2006.
|
[
{
"version": "v1",
"created": "Tue, 8 Nov 2011 08:26:50 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Nov 2011 07:00:45 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Nov 2011 00:58:40 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Jan 2012 15:29:16 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"de Luca",
"Aldo",
""
],
[
"De Luca",
"Alessandro",
""
]
] |
new_dataset
| 0.988757 |
1211.1932
|
V Lalitha
|
Govinda M. Kamath, N. Prakash, V. Lalitha and P. Vijay Kumar
|
Codes with Local Regeneration
|
44 pages, 7 figures. A class of codes termed as Uniform Rank
Accumulation (URA) codes is introduced and a minimum distance bound is
derived when the local codes are URA codes. Also, the results of our earlier
arXiv submssion(arXiv:1202:2414[cs.IT]) are included in Section 3 of this
version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regenerating codes and codes with locality are two schemes that have recently
been proposed to ensure data collection and reliability in a distributed
storage network. In a situation where one is attempting to repair a failed
node, regenerating codes seek to minimize the amount of data downloaded for
node repair, while codes with locality attempt to minimize the number of helper
nodes accessed. In this paper, we provide several constructions for a class of
vector codes with locality in which the local codes are regenerating codes,
that enjoy both advantages. We derive an upper bound on the minimum distance of
this class of codes and show that the proposed constructions achieve this
bound. The constructions include both the cases where the local regenerating
codes correspond to the MSR as well as the MBR point on the
storage-repair-bandwidth tradeoff curve of regenerating codes. Also included is
a performance comparison of various code constructions for fixed block length
and minimum distance.
|
[
{
"version": "v1",
"created": "Thu, 8 Nov 2012 18:28:10 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Dec 2012 17:48:45 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Feb 2013 17:15:39 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"Kamath",
"Govinda M.",
""
],
[
"Prakash",
"N.",
""
],
[
"Lalitha",
"V.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.998516 |
1212.3139
|
Aaron Gerow
|
Aaron Gerow and Mark Keane
|
Identifying Metaphoric Antonyms in a Corpus Analysis of Finance Articles
|
arXiv admin note: text overlap with arXiv:1212.3138
|
Proceedings of the 33rd Annual Meeting of the Cognitive Science
Society (CogSci '11), Boston, MA, USA, 20-23 July, 2011
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using a corpus of 17,000+ financial news reports (involving over 10M words),
we perform an analysis of the argument-distributions of the UP and DOWN verbs
used to describe movements of indices, stocks and shares. In Study 1
participants identified antonyms of these verbs in a free-response task and a
matching task from which the most commonly identified antonyms were compiled.
In Study 2, we determined whether the argument-distributions for the verbs in
these antonym-pairs were sufficiently similar to predict the most
frequently-identified antonym. Cosine similarity correlates moderately with the
proportions of antonym-pairs identified by people (r = 0.31). More
impressively, 87% of the time the most frequently-identified antonym is either
the first- or second-most similar pair in the set of alternatives. The
implications of these results for distributional approaches to determining
metaphoric knowledge are discussed.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2012 11:53:25 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Feb 2013 17:11:29 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"Gerow",
"Aaron",
""
],
[
"Keane",
"Mark",
""
]
] |
new_dataset
| 0.998903 |
1302.0304
|
Vida Dujmovic
|
Vida Dujmovic
|
Graph Layouts via Layered Separators
| null | null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A k-queue layout of a graph consists of a total order of the vertices, and a
partition of the edges into k sets such that no two edges that are in the same
set are nested with respect to the vertex ordering. A k-track layout of a graph
consists of a vertex k-colouring, and a total order of each vertex colour
class, such that between each pair of colour classes no two edges cross. The
queue-number (track-number) of a graph G, is the minimum k such that G has a
k-queue (k-track) layout.
This paper proves that every n-vertex planar graph has track number and queue
number at most O(log n). This improves the result of Di Battista, Frati and
Pach [Foundations of Computer Science, (FOCS '10), pp. 365--374] who proved the
first sub-polynomial bounds on the queue number and track number of planar
graphs. Specifically, they obtained O(log^2 n) queue number and O(log^8 n)
track number bounds for planar graphs.
The result also implies that every planar graph has a 3D crossing-free grid
drawing in O(n log n) volume. The proof uses a non-standard type of graph
separators.
|
[
{
"version": "v1",
"created": "Fri, 1 Feb 2013 22:13:42 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"Dujmovic",
"Vida",
""
]
] |
new_dataset
| 0.984473 |
1302.0394
|
Xiaogang Liu
|
Xiaogang Liu and Yuan Luo
|
The weight distributions of some cyclic codes with three or four
nonzeros over F3
|
22 pages, 3 tables
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Because of efficient encoding and decoding algorithms, cyclic codes are an
important family of linear block codes, and have applications in communica-
tion and storage systems. However, their weight distributions are known only
for a few cases mainly on the codes with one or two nonzeros. In this paper,
the weight distributions of two classes of cyclic codes with three or four
nonzeros are determined.
|
[
{
"version": "v1",
"created": "Sat, 2 Feb 2013 15:57:49 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"Liu",
"Xiaogang",
""
],
[
"Luo",
"Yuan",
""
]
] |
new_dataset
| 0.998784 |
1302.0749
|
Namyoon Lee
|
Namyoon Lee and Robert W. Heath Jr
|
Multi-Way Information Exchange Over Completely-Connected Interference
Networks with a Multi-Antenna Relay
|
Short version is submitted to ISIT 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a fully-connected interference network with a relay in
which multiple users equipped with a single antenna want to exchange multiple
unicast messages with other users in the network by sharing the relay equipped
with multiple antennas. For such a network, the degrees of freedom (DoF) are
derived by considering various message exchange scenarios: a multi-user
fully-connected Y channel, a two-pair two-way interference channel with the
relay, and a two-pair two-way X channel with the relay. Further, considering
distributed relays employing a single antenna in the two-way interference
channel and the three-user fully-connected Y channel, achievable sum-DoF are
also derived in the two-way interference channel and the three-user
fully-connected Y channel. A major implication of the derived DoF results is
that a relay with multiple antennas or multiple relays employing a single
antenna increases the capacity scaling law of the multi-user interference
network when multiple directional information flows are considered, even if the
networks are fully-connected and all nodes operate in half-duplex. These
results reveal that the relay is useful in the multi-way interference network
with practical considerations.
|
[
{
"version": "v1",
"created": "Mon, 4 Feb 2013 16:39:24 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"Lee",
"Namyoon",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.997775 |
1302.0820
|
Rayed AlGhamdi
|
Rayed AlGhamdi, Anne Nguyen and Vicki Jones
|
Wheel of B2C E-commerce Development in Saudi Arabia
|
Conference paper, First International Conference on Robot
Intelligence Technology and Applications (RiTA 2012)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online retailing (a model of B2C e-commerce) is growing world-wide, with
companies in many countries showing increased sales and productivity as a
result. It has great potential within the global economy. This paper looks at
the current status of online retailing in Saudi Arabia, with particular focus
on what inhibits or enables both the customers and retailers. It also analyses
the status of Government involvement and proposes a layered model, known as the
Wheel of Online Retailing which illustrates how Government intervention can
benefit the e-commerce in Saudi Arabia.
|
[
{
"version": "v1",
"created": "Mon, 4 Feb 2013 19:55:34 GMT"
}
] | 2013-02-05T00:00:00 |
[
[
"AlGhamdi",
"Rayed",
""
],
[
"Nguyen",
"Anne",
""
],
[
"Jones",
"Vicki",
""
]
] |
new_dataset
| 0.998864 |
1201.1656
|
Vedat \c{S}iap
|
Mehmet Ozen and Vedat \c{S}iap
|
A MacWilliams type identity for m-spotty generalized Lee weight
enumerators over $\mathbb{Z}_q$ q
|
Submitted to journal on Feb 27, 2011 to Applied Mathematics Letter
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Burst errors are very common in practice. There have been many designs in
order to control and correct such errors. Recently, a new class of byte error
control codes called spotty byte error control codes has been specifically
designed to fit the large capacity memory systems that use high-density random
access memory (RAM) chips with input/output data of 8, 16, and 32 bits. The
MacWilliams identity describes how the weight enumerator of a linear code and
the weight enumerator of its dual code are related. Also, Lee metric which has
attracted many researchers due to its applications. In this paper, we combine
these two interesting topics and introduce the m-spotty generalized Lee weights
and the m-spotty generalized Lee weight enumerators of a code over Z q and
prove a MacWilliams type identity. This generalization includes both the case
of the identity given in the paper [I. Siap, MacWilliams identity for m-spotty
Lee weight enumerators, Appl. Math. Lett. 23 (1) (2010) 13-16] and the identity
given in the paper [M. \"Ozen, V. \c{S}iap, The MacWilliams identity for
m-spotty weight enumerators of linear codes over finite fields, Comput. Math.
Appl. 61 (4) (2011) 1000-1004] over Z2 and Z3 as special cases.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2012 20:28:06 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Feb 2013 00:38:58 GMT"
}
] | 2013-02-04T00:00:00 |
[
[
"Ozen",
"Mehmet",
""
],
[
"Şiap",
"Vedat",
""
]
] |
new_dataset
| 0.999673 |
1301.0157
|
Charith Perera
|
Charith Perera, Arkady Zaslavsky, Peter Christen, Ali Salehi,
Dimitrios Georgakopoulos
|
Capturing Sensor Data from Mobile Phones using Global Sensor Network
Middleware
|
Proceedings of the IEEE 23rd International Symposium on Personal
Indoor and Mobile Radio Communications (PIMRC), Sydney, Australia, September,
2012
| null |
10.1109/PIMRC.2012.6362778
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile phones play increasingly bigger role in our everyday lives. Today,
most smart phones comprise a wide variety of sensors which can sense the
physical environment. The Internet of Things vision encompasses participatory
sensing which is enabled using mobile phones based sensing and reasoning. In
this research, we propose and demonstrate our DAM4GSN architecture to capture
sensor data using sensors built into the mobile phones. Specifically, we
combine an open source sensor data stream processing engine called 'Global
Sensor Network (GSN)' with the Android platform to capture sensor data. To
achieve this goal, we proposed and developed a prototype application that can
be installed on Android devices as well as a AndroidWrapper as a GSN middleware
component. The process and the difficulty of manually connecting sensor devices
to sensor data processing middleware systems are examined. We evaluated the
performance of the system based on power consumption of the mobile client.
|
[
{
"version": "v1",
"created": "Wed, 2 Jan 2013 02:46:44 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Feb 2013 11:11:05 GMT"
}
] | 2013-02-04T00:00:00 |
[
[
"Perera",
"Charith",
""
],
[
"Zaslavsky",
"Arkady",
""
],
[
"Christen",
"Peter",
""
],
[
"Salehi",
"Ali",
""
],
[
"Georgakopoulos",
"Dimitrios",
""
]
] |
new_dataset
| 0.99602 |
1302.0033
|
Javier De la Cruz
|
J. de la Cruz
|
On extremal self-dual codes of length 120
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the only primes which may divide the order of the automorphism
group of a putative binary self-dual doubly-even [120, 60, 24] code are 2, 3,
5, 7, 19, 23 and 29. Furthermore we prove that automorphisms of prime order $p
\geq 5$ have a unique cycle structure.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 23:02:36 GMT"
}
] | 2013-02-04T00:00:00 |
[
[
"de la Cruz",
"J.",
""
]
] |
new_dataset
| 0.972102 |
1302.0265
|
Hessam Mahdavifar
|
Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang
|
Compound Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A capacity-achieving scheme based on polar codes is proposed for reliable
communication over multi-channels which can be directly applied to
bit-interleaved coded modulation schemes. We start by reviewing the
ground-breaking work of polar codes and then discuss our proposed scheme.
Instead of encoding separately across the individual underlying channels, which
requires multiple encoders and decoders, we take advantage of the recursive
structure of polar codes to construct a unified scheme with a single encoder
and decoder that can be used over the multi-channels. We prove that the scheme
achieves the capacity over this multi-channel. Numerical analysis and
simulation results for BICM channels at finite block lengths shows a
considerable improvement in the probability of error comparing to a
conventional separated scheme.
|
[
{
"version": "v1",
"created": "Fri, 1 Feb 2013 20:05:36 GMT"
}
] | 2013-02-04T00:00:00 |
[
[
"Mahdavifar",
"Hessam",
""
],
[
"El-Khamy",
"Mostafa",
""
],
[
"Lee",
"Jungwon",
""
],
[
"Kang",
"Inyup",
""
]
] |
new_dataset
| 0.999811 |
1301.7386
|
Pablo H. Ibarguengoytia
|
Pablo H. Ibarguengoytia, Luis Enrique Sucar, Sunil Vadera
|
Any Time Probabilistic Reasoning for Sensor Validation
|
Appears in Proceedings of the Fourteenth Conference on Uncertainty in
Artificial Intelligence (UAI1998)
| null | null |
UAI-P-1998-PG-266-273
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For many real time applications, it is important to validate the information
received from the sensors before entering higher levels of reasoning. This
paper presents an any time probabilistic algorithm for validating the
information provided by sensors. The system consists of two Bayesian network
models. The first one is a model of the dependencies between sensors and it is
used to validate each sensor. It provides a list of potentially faulty sensors.
To isolate the real faults, a second Bayesian network is used, which relates
the potential faults with the real faults. This second model is also used to
make the validation algorithm any time, by validating first the sensors that
provide more information. To select the next sensor to validate, and measure
the quality of the results at each stage, an entropy function is used. This
function captures in a single quantity both the certainty and specificity
measures of any time algorithms. Together, both models constitute a mechanism
for validating sensors in an any time fashion, providing at each step the
probability of correct/faulty for each sensor, and the total quality of the
results. The algorithm has been tested in the validation of temperature sensors
of a power plant.
|
[
{
"version": "v1",
"created": "Wed, 30 Jan 2013 15:04:41 GMT"
}
] | 2013-02-01T00:00:00 |
[
[
"Ibarguengoytia",
"Pablo H.",
""
],
[
"Sucar",
"Luis Enrique",
""
],
[
"Vadera",
"Sunil",
""
]
] |
new_dataset
| 0.999058 |
1301.7406
|
David M Pennock
|
David M. Pennock
|
Logarithmic Time Parallel Bayesian Inference
|
Appears in Proceedings of the Fourteenth Conference on Uncertainty in
Artificial Intelligence (UAI1998)
| null | null |
UAI-P-1998-PG-431-438
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
I present a parallel algorithm for exact probabilistic inference in Bayesian
networks. For polytree networks with n variables, the worst-case time
complexity is O(log n) on a CREW PRAM (concurrent-read, exclusive-write
parallel random-access machine) with n processors, for any constant number of
evidence variables. For arbitrary networks, the time complexity is O(r^{3w}*log
n) for n processors, or O(w*log n) for r^{3w}*n processors, where r is the
maximum range of any variable, and w is the induced width (the maximum clique
size), after moralizing and triangulating the network.
|
[
{
"version": "v1",
"created": "Wed, 30 Jan 2013 15:06:20 GMT"
}
] | 2013-02-01T00:00:00 |
[
[
"Pennock",
"David M.",
""
]
] |
new_dataset
| 0.98969 |
1301.7491
|
Hessam Mahdavifar
|
Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang
|
On the Construction and Decoding of Concatenated Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A scheme for concatenating the recently invented polar codes with interleaved
block codes is considered. By concatenating binary polar codes with interleaved
Reed-Solomon codes, we prove that the proposed concatenation scheme captures
the capacity-achieving property of polar codes, while having a significantly
better error-decay rate. We show that for any $\epsilon > 0$, and total frame
length $N$, the parameters of the scheme can be set such that the frame error
probability is less than $2^{-N^{1-\epsilon}}$, while the scheme is still
capacity achieving. This improves upon $2^{-N^{0.5-\eps}}$, the frame error
probability of Arikan's polar codes. We also propose decoding algorithms for
concatenated polar codes, which significantly improve the error-rate
performance at finite block lengths while preserving the low decoding
complexity.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 02:14:02 GMT"
}
] | 2013-02-01T00:00:00 |
[
[
"Mahdavifar",
"Hessam",
""
],
[
"El-Khamy",
"Mostafa",
""
],
[
"Lee",
"Jungwon",
""
],
[
"Kang",
"Inyup",
""
]
] |
new_dataset
| 0.998467 |
1301.7564
|
Mladen Kova\v{c}evi\'c
|
Mladen Kova\v{c}evi\'c and Dejan Vukobratovi\'c
|
Multiset Codes for Permutation Channels
|
5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the notion of multiset codes as relevant to the problem
of reliable information transmission over permutation channels. The motivation
for studying permutation channels comes from the effect of out of order
delivery of packets in some types of packet networks. The proposed codes are a
generalization of the so-called subset codes, recently proposed by the authors.
Some of the basic properties of multiset codes are established, among which
their equivalence to integer codes under the Manhattan metric. The presented
coding-theoretic framework follows closely the one proposed by Koetter and
Kschischang for the operator channels. The two mathematical models are similar
in many respects, and the basic idea is presented in a way which admits a
unified view on coding for these types of channels.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 09:48:09 GMT"
}
] | 2013-02-01T00:00:00 |
[
[
"Kovačević",
"Mladen",
""
],
[
"Vukobratović",
"Dejan",
""
]
] |
new_dataset
| 0.999731 |
1301.7702
|
Nicos Angelopoulos
|
Emilio Jes\'us Gallego Arias and R\'emy Haemmerl\'e and Manuel V.
Hermenegildo and Jos\'e F. Morales
|
The Ciao clp(FD) Library. A Modular CLP Extension for Prolog
|
Appeared in CICLOPS 2012. 15 Pages, 5 Figures
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new free library for Constraint Logic Programming over Finite
Domains, included with the Ciao Prolog system. The library is entirely written
in Prolog, leveraging on Ciao's module system and code transformation
capabilities in order to achieve a highly modular design without compromising
performance. We describe the interface, implementation, and design rationale of
each modular component.
The library meets several design goals: a high level of modularity, allowing
the individual components to be replaced by different versions;
high-efficiency, being competitive with other FD implementations; a glass-box
approach, so the user can specify new constraints at different levels; and a
Prolog implementation, in order to ease the integration with Ciao's code
analysis components.
The core is built upon two small libraries which implement integer ranges and
closures. On top of that, a finite domain variable datatype is defined, taking
care of constraint reexecution depending on range changes. These three
libraries form what we call the FD kernel of the library.
This FD kernel is used in turn to implement several higher-level finite
domain constraints, specified using indexicals. Together with a labeling module
this layer forms what we name \emph{the FD solver}. A final level integrates
the clp(FD) paradigm with our FD solver. This is achieved using attributed
variables and a compiler from the clp(FD) language to the set of constraints
provided by the solver.
It should be noted that the user of the library is encouraged to work in any
of those levels as seen convenient: from writing a new range module to
enriching the set of FD constraints by writing new indexicals.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 17:49:20 GMT"
}
] | 2013-02-01T00:00:00 |
[
[
"Arias",
"Emilio Jesús Gallego",
""
],
[
"Haemmerlé",
"Rémy",
""
],
[
"Hermenegildo",
"Manuel V.",
""
],
[
"Morales",
"José F.",
""
]
] |
new_dataset
| 0.99392 |
1301.6362
|
Anirban Ghatak
|
Anirban Ghatak
|
Subspace Codes for Random Networks Based on Pl\"{u}cker Coordinates and
Schubert Cells
|
9 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Pl\"{u}cker coordinate description of subspaces has been recently
discussed in the context of constant dimension subspace codes for random
networks, as well as the Schubert cell description of certain code parameters.
In this paper this classical tool is used to reformulate some standard
constructions of constant dimension codes so as to give a unified framework. A
general method of constructing non-constant dimension subspace codes with
respect to a given minimum subspace distance or minimum injection distance
among subspaces is presented. These codes may be described as the union of
constant dimension subspace codes restricted to selected Schubert cells. The
selection of these Schubert cells is based on the subset distance of tuples
corresponding to the Pl\"{u}cker coordinate matrices associated with the
subspaces contained in the respective Schubert cells. In this context, it is
shown that a recent construction of non-constant dimension Ferrers-diagram
rank-metric subspace codes (Khaleghi and Kschischang) is subsumed in the
present framework.
|
[
{
"version": "v1",
"created": "Sun, 27 Jan 2013 14:53:46 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Jan 2013 08:53:19 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Ghatak",
"Anirban",
""
]
] |
new_dataset
| 0.998033 |
1301.6704
|
Jesse Hoey
|
Jesse Hoey, Robert St-Aubin, Alan Hu, Craig Boutilier
|
SPUDD: Stochastic Planning using Decision Diagrams
|
Appears in Proceedings of the Fifteenth Conference on Uncertainty in
Artificial Intelligence (UAI1999)
| null | null |
UAI-P-1999-PG-279-288
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Markov decisions processes (MDPs) are becoming increasing popular as models
of decision theoretic planning. While traditional dynamic programming methods
perform well for problems with small state spaces, structured methods are
needed for large problems. We propose and examine a value iteration algorithm
for MDPs that uses algebraic decision diagrams(ADDs) to represent value
functions and policies. An MDP is represented using Bayesian networks and ADDs
and dynamic programming is applied directly to these ADDs. We demonstrate our
method on large MDPs (up to 63 million states) and show that significant gains
can be had when compared to tree-structured representations (with up to a
thirty-fold reduction in the number of nodes required to represent optimal
value functions).
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 15:58:38 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Hoey",
"Jesse",
""
],
[
"St-Aubin",
"Robert",
""
],
[
"Hu",
"Alan",
""
],
[
"Boutilier",
"Craig",
""
]
] |
new_dataset
| 0.983173 |
1301.6748
|
Michael S. K. M. Wong
|
Michael S. K. M. Wong, C. J. Butz
|
Contextual Weak Independence in Bayesian Networks
|
Appears in Proceedings of the Fifteenth Conference on Uncertainty in
Artificial Intelligence (UAI1999)
| null | null |
UAI-P-1999-PG-670-679
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well-known that the notion of (strong) conditional independence (CI) is
too restrictive to capture independencies that only hold in certain contexts.
This kind of contextual independency, called context-strong independence (CSI),
can be used to facilitate the acquisition, representation, and inference of
probabilistic knowledge. In this paper, we suggest the use of contextual weak
independence (CWI) in Bayesian networks. It should be emphasized that the
notion of CWI is a more general form of contextual independence than CSI.
Furthermore, if the contextual strong independence holds for all contexts, then
the notion of CSI becomes strong CI. On the other hand, if the weak contextual
independence holds for all contexts, then the notion of CWI becomes weak
independence (WI) nwhich is a more general noncontextual independency than
strong CI. More importantly, complete axiomatizations are studied for both the
class of WI and the class of CI and WI together. Finally, the interesting
property of WI being a necessary and sufficient condition for ensuring
consistency in granular probabilistic networks is shown.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 16:01:33 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Wong",
"Michael S. K. M.",
""
],
[
"Butz",
"C. J.",
""
]
] |
new_dataset
| 0.994117 |
1301.6793
|
Fran\c{c}ois M\'eriaux
|
Fran\c{c}ois M\'eriaux, Vineeth Varma, Samson Lasaulce
|
Mean Field Energy Games in Wireless Networks
|
IEEE Proc. of Asilomar Conf. on Signals, Systems, and Computers, Nov.
2012, Pacific Grove, CA, USA
| null | null | null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work tackles the problem of energy-efficient distributed power control
in wireless networks with a large number of transmitters. The problem is
modeled by a dynamic game. Each transmitter-receiver communication is
characterized by a state given by the available energy and/or the individual
channel state and whose evolution is governed by certain dynamics. Since
equilibrium analysis in such a (stochastic) game is generally difficult and
even impossible, the problem is approximated by exploiting the large system
assumption. Under an appropriate exchangeability assumption, the corresponding
mean field game is well defined and studied in detail for special cases. The
main contribution of this work is to show how mean field games can be applied
to the problem under investigation and provide illustrative numerical results.
Our results indicate that this approach can lead to significant gains in terms
of energy-efficiency at the resulting equilibrium.
|
[
{
"version": "v1",
"created": "Mon, 28 Jan 2013 22:10:53 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Mériaux",
"François",
""
],
[
"Varma",
"Vineeth",
""
],
[
"Lasaulce",
"Samson",
""
]
] |
new_dataset
| 0.990153 |
1301.6843
|
Prateek Dewan
|
Prateek Dewan and Mayank Gupta and Ponnurangam Kumaraguru
|
ChaMAILeon: Simplified email sharing like never before!
|
6 pages, 4 images
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While passwords, by definition, are meant to be secret, recent trends in the
Internet usage have witnessed an increasing number of people sharing their
email passwords for both personal and professional purposes. As sharing
passwords increases the chances of your passwords being compromised, leading
websites like Google strongly advise their users not to share their passwords
with anyone. To cater to this conflict of usability versus security and
privacy, we introduce ChaMAILeon, an experimental service, which allows users
to share their email passwords while maintaining their privacy and not
compromising their security. In this report, we discuss the technical details
of the implementation of ChaMAILeon.
|
[
{
"version": "v1",
"created": "Tue, 29 Jan 2013 06:53:33 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Dewan",
"Prateek",
""
],
[
"Gupta",
"Mayank",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.997144 |
1301.6938
|
Roy Karasik
|
Roy Karasik, Osvaldo Simeone, Shlomo Shamai (Shitz)
|
Robust Uplink Communications over Fading Channels with Variable Backhaul
Connectivity
|
Submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two mobile users communicate with a central decoder via two base stations.
Communication between the mobile users and the base stations takes place over a
Gaussian interference channel with constant channel gains or quasi-static
fading. Instead, the base stations are connected to the central decoder through
orthogonal finite-capacity links, whose connectivity is subject to random
fluctuations. There is only receive-side channel state information, and hence
the mobile users are unaware of the channel state and of the backhaul
connectivity state, while the base stations know the fading coefficients but
are uncertain about the backhaul links' state. The base stations are oblivious
to the mobile users' codebooks and employ compress-and-forward to relay
information to the central decoder. Upper and lower bounds are derived on
average achievable throughput with respect to the prior distribution of the
fading coefficients and of the backhaul links' states. The lower bounds are
obtained by proposing strategies that combine the broadcast coding approach and
layered distributed compression techniques. The upper bound is obtained by
assuming that all the nodes know the channel state. Numerical results confirm
the advantages of the proposed approach with respect to conventional non-robust
strategies in both scenarios with and without fading.
|
[
{
"version": "v1",
"created": "Tue, 29 Jan 2013 14:59:06 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Karasik",
"Roy",
"",
"Shitz"
],
[
"Simeone",
"Osvaldo",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.998091 |
1301.6952
|
Yannick Schwartz
|
Yannick Schwartz (INRIA Saclay - Ile de France, LNAO), Alexis Barbot
(LNAO), Benjamin Thyreau (LNAO), Vincent Frouin (LNAO), Ga\"el Varoquaux
(INRIA Saclay - Ile de France, LNAO), Aditya Siram, Daniel Marcus,
Jean-Baptiste Poline (LNAO)
|
PyXNAT: XNAT in Python
| null |
Frontiers in Neuroinformatics 6, 12 (2012) 1-14
|
10.3389/fninf.2012.00012
| null |
cs.DB cs.CV q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As neuroimaging databases grow in size and complexity, the time researchers
spend investigating and managing the data increases to the expense of data
analysis. As a result, investigators rely more and more heavily on scripting
using high-level languages to automate data management and processing tasks.
For this, a structured and programmatic access to the data store is necessary.
Web services are a first step toward this goal. They however lack in
functionality and ease of use because they provide only low level interfaces to
databases. We introduce here PyXNAT, a Python module that interacts with The
Extensible Neuroimaging Archive Toolkit (XNAT) through native Python calls
across multiple operating systems. The choice of Python enables PyXNAT to
expose the XNAT Web Services and unify their features with a higher level and
more expressive language. PyXNAT provides XNAT users direct access to all the
scientific packages in Python. Finally PyXNAT aims to be efficient and easy to
use, both as a backend library to build XNAT clients and as an alternative
frontend from the command line.
|
[
{
"version": "v1",
"created": "Tue, 29 Jan 2013 15:42:18 GMT"
}
] | 2013-01-30T00:00:00 |
[
[
"Schwartz",
"Yannick",
"",
"INRIA Saclay - Ile de France, LNAO"
],
[
"Barbot",
"Alexis",
"",
"LNAO"
],
[
"Thyreau",
"Benjamin",
"",
"LNAO"
],
[
"Frouin",
"Vincent",
"",
"LNAO"
],
[
"Varoquaux",
"Gaël",
"",
"INRIA Saclay - Ile de France, LNAO"
],
[
"Siram",
"Aditya",
"",
"LNAO"
],
[
"Marcus",
"Daniel",
"",
"LNAO"
],
[
"Poline",
"Jean-Baptiste",
"",
"LNAO"
]
] |
new_dataset
| 0.987122 |
1112.4250
|
K. V. Krishna
|
Shubh Narayan Singh, K. V. Krishna
|
The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid
|
Contributed talk titled "On the rank of the intersection of two
submonoids of a free monoid" at A$^3$: Abstract Algebra and Algorithms
Conference, Eger, Hungary, August 14-17, 2011
|
Ann. Math. Inform., 40, 113-123, 2012
| null | null |
cs.FL math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work aims at further investigations on the work of Giambruno and Restivo
to find the rank of the intersection of two finitely generated submonoids of a
free monoid. In this connection, we obtain the rank of a finitely generated
submonoid of a free monoid that is accepted by semi-flower automaton with two
bpi's. Further, when the product automaton of two deterministic semi-flower
automata with a unique bpi is semi-flower with two bpi's, we obtain a
sufficient condition on the product automaton in order to satisfy the Hanna
Neumann property.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2011 07:11:41 GMT"
}
] | 2013-01-29T00:00:00 |
[
[
"Singh",
"Shubh Narayan",
""
],
[
"Krishna",
"K. V.",
""
]
] |
new_dataset
| 0.983075 |
1210.0137
|
Pierre Deville Pierre
|
Vincent D. Blondel, Markus Esch, Connie Chan, Fabrice Clerot, Pierre
Deville, Etienne Huens, Fr\'ed\'eric Morlot, Zbigniew Smoreda and Cezary
Ziemlicki
|
Data for Development: the D4D Challenge on Mobile Phone Data
|
10 pages, 3 figures
| null | null | null |
cs.CY cs.SI physics.soc-ph stat.CO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The Orange "Data for Development" (D4D) challenge is an open data challenge
on anonymous call patterns of Orange's mobile phone users in Ivory Coast. The
goal of the challenge is to help address society development questions in novel
ways by contributing to the socio-economic development and well-being of the
Ivory Coast population. Participants to the challenge are given access to four
mobile phone datasets and the purpose of this paper is to describe the four
datasets. The website http://www.d4d.orange.com contains more information about
the participation rules. The datasets are based on anonymized Call Detail
Records (CDR) of phone calls and SMS exchanges between five million of Orange's
customers in Ivory Coast between December 1, 2011 and April 28, 2012. The
datasets are: (a) antenna-to-antenna traffic on an hourly basis, (b) individual
trajectories for 50,000 customers for two week time windows with antenna
location information, (3) individual trajectories for 500,000 customers over
the entire observation period with sub-prefecture location information, and (4)
a sample of communication graphs for 5,000 customers
|
[
{
"version": "v1",
"created": "Sat, 29 Sep 2012 17:39:16 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Jan 2013 12:56:55 GMT"
}
] | 2013-01-29T00:00:00 |
[
[
"Blondel",
"Vincent D.",
""
],
[
"Esch",
"Markus",
""
],
[
"Chan",
"Connie",
""
],
[
"Clerot",
"Fabrice",
""
],
[
"Deville",
"Pierre",
""
],
[
"Huens",
"Etienne",
""
],
[
"Morlot",
"Frédéric",
""
],
[
"Smoreda",
"Zbigniew",
""
],
[
"Ziemlicki",
"Cezary",
""
]
] |
new_dataset
| 0.971467 |
1301.6277
|
Jeon-Hyung Kang
|
Jeon-Hyung Kang, Kristina Lerman, Lise Getoor
|
LA-LDA: A Limited Attention Topic Model for Social Recommendation
|
The 2013 International Conference on Social Computing,
Behavioral-Cultural Modeling, & Prediction (SBP 2013)
| null | null | null |
cs.SI cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media users have finite attention which limits the number of incoming
messages from friends they can process. Moreover, they pay more attention to
opinions and recommendations of some friends more than others. In this paper,
we propose LA-LDA, a latent topic model which incorporates limited,
non-uniformly divided attention in the diffusion process by which opinions and
information spread on the social network. We show that our proposed model is
able to learn more accurate user models from users' social network and item
adoption behavior than models which do not take limited attention into account.
We analyze voting on news items on the social news aggregator Digg and show
that our proposed model is better able to predict held out votes than
alternative models. Our study demonstrates that psycho-socially motivated
models have better ability to describe and predict observed behavior than
models which only consider topics.
|
[
{
"version": "v1",
"created": "Sat, 26 Jan 2013 18:26:36 GMT"
}
] | 2013-01-29T00:00:00 |
[
[
"Kang",
"Jeon-Hyung",
""
],
[
"Lerman",
"Kristina",
""
],
[
"Getoor",
"Lise",
""
]
] |
new_dataset
| 0.99947 |
1301.6319
|
Leon Abdillah
|
Muhamd Sobri and Leon Andretti Abdillah
|
Aplikasi belajar membaca iqro' berbasis mobile
|
Seminar Nasional Teknologi Informasi & Multimedia (Semnasteknomedia),
STMIK AMIKOM Yogyakarta, 2013. 5 pages. 11 figures
|
M. Sobri and L. A. Abdillah, "Aplikasi belajar membaca iqro'
berbasis mobile," in Seminar Nasional Teknologi Informasi & Multimedia
(Semnasteknomedia), STMIK AMIKOM Yogyakarta, 2013
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IPTEK and IMTAQ should be followed by knowledge of the ability in reading the
hijaiyah letters as Al Qur-an base. Current people are so busy with their
activities thats way authors develop this mobile application using pocket pc.
The development of this research using waterfall model. Authors use the
programming language of Microsoft Visual BASIC.Net. Authors also use Photoshop
to prepare the image of every letter. In Indonesia, there six level in reading
Al Qur-an, but for the purpose of thi research authors only use Iqro-1 until
Iqro-4. This mobile application also enriched with the voice for every letter
image.
|
[
{
"version": "v1",
"created": "Sun, 27 Jan 2013 05:30:43 GMT"
}
] | 2013-01-29T00:00:00 |
[
[
"Sobri",
"Muhamd",
""
],
[
"Abdillah",
"Leon Andretti",
""
]
] |
new_dataset
| 0.999407 |
1301.6331
|
Natalia Silberstein
|
Natalia Silberstein, Ankit Singh Rawat, O. Ozan Koyluoglu, and Sriram
Vishwanath
|
Optimal Locally Repairable Codes via Rank-Metric Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new explicit construction for locally repairable codes
(LRCs) for distributed storage systems which possess all-symbols locality and
maximal possible minimum distance, or equivalently, can tolerate the maximal
number of node failures. This construction, based on maximum rank distance
(MRD) Gabidulin codes, provides new optimal vector and scalar LRCs. In
addition, the paper also discusses mechanisms by which codes obtained using
this construction can be used to construct LRCs with efficient repair of failed
nodes by combination of LRC with regenerating codes.
|
[
{
"version": "v1",
"created": "Sun, 27 Jan 2013 07:50:58 GMT"
}
] | 2013-01-29T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
],
[
"Rawat",
"Ankit Singh",
""
],
[
"Koyluoglu",
"O. Ozan",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.993397 |
1301.6553
|
Thomas Couronne
|
Thomas Couronne, Zbigniew Smoreda, Ana-Maria Olteanu
|
Chatty Mobiles:Individual mobility and communication patterns
|
NetMob 2011, Boston
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human mobility analysis is an important issue in social sciences, and
mobility data are among the most sought-after sources of information in ur-
Data ban studies, geography, transportation and territory management. In
network sciences mobility studies have become popular in the past few years,
especially using mobile phone location data. For preserving the customer
privacy, datasets furnished by telecom operators are anonymized. At the same
time, the large size of datasets often makes the task of calculating all
observed trajectories very difficult and time-consuming. One solution could be
to sample users. However, the fact of not having information about the mobile
user makes the sampling delicate. Some researchers select randomly a sample of
users from their dataset. Others try to optimize this method, for example,
taking into account only users with a certain number or frequency of locations
recorded. At the first glance, the second choice seems to be more efficient:
having more individual traces makes the analysis more precise. However, the
most frequently used CDR data (Call Detail Records) have location generated
only at the moment of communication (call, SMS, data connection). Due to this
fact, users mobility patterns cannot be precisely built upon their
communication patterns. Hence, these data have evident short-comings both in
terms of spatial and temporal scale. In this paper we propose to estimate the
correlation between the users communication and mo- bility in order to better
assess the bias of frequency based sampling. Using technical GSM network data
(including communication but also independent mobility records), we will
analyze the relationship between communication and mobility patterns.
|
[
{
"version": "v1",
"created": "Mon, 28 Jan 2013 14:19:48 GMT"
}
] | 2013-01-29T00:00:00 |
[
[
"Couronne",
"Thomas",
""
],
[
"Smoreda",
"Zbigniew",
""
],
[
"Olteanu",
"Ana-Maria",
""
]
] |
new_dataset
| 0.961818 |
1301.5915
|
Rafael Lucas D'Oliveira
|
Rafael Gregorio Lucas D'Oliveira, Marcelo Firer
|
The Packing Radius of a Code and Partitioning Problems: the Case for
Poset Metrics
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Until this work, the packing radius of a poset code was only known in the
cases where the poset was a chain, a hierarchy, a union of disjoint chains of
the same size, and for some families of codes. Our objective is to approach the
general case of any poset. To do this, we will divide the problem into two
parts.
The first part consists in finding the packing radius of a single vector. We
will show that this is equivalent to a generalization of a famous NP-hard
problem known as "the partition problem". Then, we will review the main results
known about this problem giving special attention to the algorithms to solve
it. The main ingredient to these algorithms is what is known as the
differentiating method, and therefore, we will extend it to the general case.
The second part consists in finding the vector that determines the packing
radius of the code. For this, we will show how it is sometimes possible to
compare the packing radius of two vectors without calculating them explicitly.
|
[
{
"version": "v1",
"created": "Thu, 24 Jan 2013 21:39:33 GMT"
}
] | 2013-01-28T00:00:00 |
[
[
"D'Oliveira",
"Rafael Gregorio Lucas",
""
],
[
"Firer",
"Marcelo",
""
]
] |
new_dataset
| 0.998108 |
1301.5946
|
Lu\'is Filipe Te\'ofilo
|
Lu\'is Filipe Te\'ofilo, Lu\'is Paulo Reis, Henrique Lopes Cardoso,
Dinis F\'elix, Rui S\^eca, Jo\~ao Ferreira, Pedro Mendes, Nuno Cruz, Vitor
Pereira, Nuno Passos
|
Computer Poker Research at LIACC
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer Poker's unique characteristics present a well-suited challenge for
research in artificial intelligence. For that reason, and due to the Poker's
market increase in popularity in Portugal since 2008, several members of LIACC
have researched in this field. Several works were published as papers and
master theses and more recently a member of LIACC engaged on a research in this
area as a Ph.D. thesis in order to develop a more extensive and in-depth work.
This paper describes the existing research in LIACC about Computer Poker, with
special emphasis on the completed master's theses and plans for future work.
This paper means to present a summary of the lab's work to the research
community in order to encourage the exchange of ideas with other labs /
individuals. LIACC hopes this will improve research in this area so as to reach
the goal of creating an agent that surpasses the best human players.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2013 01:56:03 GMT"
}
] | 2013-01-28T00:00:00 |
[
[
"Teófilo",
"Luís Filipe",
""
],
[
"Reis",
"Luís Paulo",
""
],
[
"Cardoso",
"Henrique Lopes",
""
],
[
"Félix",
"Dinis",
""
],
[
"Sêca",
"Rui",
""
],
[
"Ferreira",
"João",
""
],
[
"Mendes",
"Pedro",
""
],
[
"Cruz",
"Nuno",
""
],
[
"Pereira",
"Vitor",
""
],
[
"Passos",
"Nuno",
""
]
] |
new_dataset
| 0.994605 |
1301.5953
|
Daniel Paulusma
|
Hajo Broersma, Ji\v{r}\'i Fiala, Petr A. Golovach, Tom\'a\v{s} Kaiser,
Dani\"el Paulusma, Andrzej Proskurowski
|
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hung and Chang showed that for all k>=1 an interval graph has a path cover of
size at most k if and only if its scattering number is at most k. They also
showed that an interval graph has a Hamilton cycle if and only if its
scattering number is at most 0. We complete this characterization by proving
that for all k<=-1 an interval graph is -(k+1)-Hamilton-connected if and only
if its scattering number is at most k. We also give an O(m+n) time algorithm
for computing the scattering number of an interval graph with n vertices an m
edges, which improves the O(n^4) time bound of Kratsch, Kloks and M\"uller. As
a consequence of our two results the maximum k for which an interval graph is
k-Hamilton-connected can be computed in O(m+n) time.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2013 02:24:26 GMT"
}
] | 2013-01-28T00:00:00 |
[
[
"Broersma",
"Hajo",
""
],
[
"Fiala",
"Jiří",
""
],
[
"Golovach",
"Petr A.",
""
],
[
"Kaiser",
"Tomáš",
""
],
[
"Paulusma",
"Daniël",
""
],
[
"Proskurowski",
"Andrzej",
""
]
] |
new_dataset
| 0.986572 |
1301.6125
|
Boris Leistedt
|
Boris Leistedt and Jason D. McEwen
|
Flaglets: Exact Wavelets on the Ball
|
1 page, 1 figure, Proceedings of International BASP Frontiers
Workshop 2013. Codes are publicly available at http://www.s2let.org and
http://www.flaglets.org
| null | null | null |
cs.IT astro-ph.IM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We summarise the construction of exact axisymmetric scale-discretised
wavelets on the sphere and on the ball. The wavelet transform on the ball
relies on a novel 3D harmonic transform called the Fourier-Laguerre transform
which combines the spherical harmonic transform with damped Laguerre
polynomials on the radial half-line. The resulting wavelets, called flaglets,
extract scale-dependent, spatially localised features in three-dimensions while
treating the tangential and radial structures separately. Both the
Fourier-Laguerre and the flaglet transforms are theoretically exact thanks to a
novel sampling theorem on the ball. Our implementation of these methods is
publicly available and achieves floating-point accuracy when applied to
band-limited signals.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2013 18:58:32 GMT"
}
] | 2013-01-28T00:00:00 |
[
[
"Leistedt",
"Boris",
""
],
[
"McEwen",
"Jason D.",
""
]
] |
new_dataset
| 0.999545 |
1003.4277
|
Burkhard Schipper
|
Peter Duersch, Joerg Oechssler, Burkhard C. Schipper
|
Pure Saddle Points and Symmetric Relative Payoff Games
| null | null |
10.1007/s00182-011-0302-x
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that the rock-paper-scissors game has no pure saddle point.
We show that this holds more generally: A symmetric two-player zero-sum game
has a pure saddle point if and only if it is not a generalized
rock-paper-scissors game. Moreover, we show that every finite symmetric
quasiconcave two-player zero-sum game has a pure saddle point. Further
sufficient conditions for existence are provided. We apply our theory to a rich
collection of examples by noting that the class of symmetric two-player
zero-sum games coincides with the class of relative payoff games associated
with symmetric two-player games. This allows us to derive results on the
existence of a finite population evolutionary stable strategies.
|
[
{
"version": "v1",
"created": "Mon, 22 Mar 2010 20:44:50 GMT"
}
] | 2013-01-25T00:00:00 |
[
[
"Duersch",
"Peter",
""
],
[
"Oechssler",
"Joerg",
""
],
[
"Schipper",
"Burkhard C.",
""
]
] |
new_dataset
| 0.976452 |
1109.2806
|
Damien Cassou
|
Damien Cassou (HPI), Serge Stinckwich (GREYC, UMMISCO), Pierrick Koch
(GREYC)
|
Using the DiaSpec design language and compiler to develop robotics
systems
|
DSLRob'11: Domain-Specific Languages and models for ROBotic systems
(2011)
| null | null |
DSLRob/2011/01
|
cs.RO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Sense/Compute/Control (SCC) application is one that interacts with the
physical environment. Such applications are pervasive in domains such as
building automation, assisted living, and autonomic computing. Developing an
SCC application is complex because: (1) the implementation must address both
the interaction with the environment and the application logic; (2) any
evolution in the environment must be reflected in the implementation of the
application; (3) correctness is essential, as effects on the physical
environment can have irreversible consequences. The SCC architectural pattern
and the DiaSpec domain-specific design language propose a framework to guide
the design of such applications. From a design description in DiaSpec, the
DiaSpec compiler is capable of generating a programming framework that guides
the developer in implementing the design and that provides runtime support. In
this paper, we report on an experiment using DiaSpec (both the design language
and compiler) to develop a standard robotics application. We discuss the
benefits and problems of using DiaSpec in a robotics setting and present some
changes that would make DiaSpec a better framework in this setting.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2011 14:49:30 GMT"
}
] | 2013-01-25T00:00:00 |
[
[
"Cassou",
"Damien",
"",
"HPI"
],
[
"Stinckwich",
"Serge",
"",
"GREYC, UMMISCO"
],
[
"Koch",
"Pierrick",
"",
"GREYC"
]
] |
new_dataset
| 0.996047 |
1301.4824
|
Zhengchun Zhou
|
Zhengchun Zhou, Aixian Zhang, Cunsheng Ding, Maosheng Xiong
|
The Weight Enumerator of Three Families of Cyclic Codes
|
13 Pages, 3 Tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are a subclass of linear codes and have wide applications in
consumer electronics, data storage systems, and communication systems due to
their efficient encoding and decoding algorithms. Cyclic codes with many zeros
and their dual codes have been a subject of study for many years. However,
their weight distributions are known only for a very small number of cases. In
general the calculation of the weight distribution of cyclic codes is heavily
based on the evaluation of some exponential sums over finite fields. Very
recently, Li, Hu, Feng and Ge studied a class of $p$-ary cyclic codes of length
$p^{2m}-1$, where $p$ is a prime and $m$ is odd. They determined the weight
distribution of this class of cyclic codes by establishing a connection between
the involved exponential sums with the spectrum of Hermitian forms graphs. In
this paper, this class of $p$-ary cyclic codes is generalized and the weight
distribution of the generalized cyclic codes is settled for both even $m$ and
odd $m$ alone with the idea of Li, Hu, Feng, and Ge. The weight distributions
of two related families of cyclic codes are also determined.
|
[
{
"version": "v1",
"created": "Mon, 21 Jan 2013 11:32:31 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Jan 2013 08:17:48 GMT"
}
] | 2013-01-25T00:00:00 |
[
[
"Zhou",
"Zhengchun",
""
],
[
"Zhang",
"Aixian",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Xiong",
"Maosheng",
""
]
] |
new_dataset
| 0.997847 |
1301.5046
|
Shaoshi Chen
|
Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li
|
On the Structure of Compatible Rational Functions
| null |
Proceedings of the 2011 International Symposium on Symbolic and
Algebraic Computation, pages 91--98, 2011, ACM
| null | null |
cs.SC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A finite number of rational functions are compatible if they satisfy the
compatibility conditions of a first-order linear functional system involving
differential, shift and q-shift operators. We present a theorem that describes
the structure of compatible rational functions. The theorem enables us to
decompose a solution of such a system as a product of a rational function,
several symbolic powers, a hyperexponential function, a hypergeometric term,
and a q-hypergeometric term. We outline an algorithm for computing this
product, and present an application.
|
[
{
"version": "v1",
"created": "Tue, 22 Jan 2013 00:37:06 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Jan 2013 01:24:01 GMT"
}
] | 2013-01-24T00:00:00 |
[
[
"Chen",
"Shaoshi",
""
],
[
"Feng",
"Ruyong",
""
],
[
"Fu",
"Guofeng",
""
],
[
"Li",
"Ziming",
""
]
] |
new_dataset
| 0.986741 |
1301.5375
|
Nur Jannatul Adnin Ms.
|
A. N. Zainab, K. W. U. Anyi, N. B. Anuar
|
A Single Journal Study : Malaysian Journal of Computer Science
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single journal studies are reviewed and measures used in the studies are
highlighted. The following quantitative measures are used to study 272 articles
published in Malaysian Journal of Computer Science, (1) the article
productivity of the journal from 1985 to 2007, (2) the observed and expected
authorship productivity tested using Lotka's Law of author productivity,
identification and listing of core authors; (3) the authorship, co-authorship
pattern by authors' country of origin and institutional affiliations; (4) the
subject areas of research; (5) the citation analysis of resources referenced as
well as the age and half-life of citations; the journals referenced and tested
for zonal distribution using Bradford's law of journal scattering; the extent
of web citations; and (6) the citations received by articles published in MJCS
and impact factor of the journal based on information obtained from Google
Scholar, the level of author and journal self-citation.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 01:40:30 GMT"
}
] | 2013-01-24T00:00:00 |
[
[
"Zainab",
"A. N.",
""
],
[
"Anyi",
"K. W. U.",
""
],
[
"Anuar",
"N. B.",
""
]
] |
new_dataset
| 0.978577 |
1301.5384
|
Nur Jannatul Adnin Ms.
|
H. Safahieh, S. A. Sanni, A. N. Zainab
|
International Contribution to Nipah Virus Research 1999-2010
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study examines 462 papers on Nipah virus research published from 1999 to
2010, identifying the active authors, institutions and citations received. Data
was extracted from SCI-Expanded database, (Web of Science) and analyzed using
descriptive figures and tables. The results show the growth of publication is
incremental up to 2010 even though the average citations received is
decreasing. The ratio of authors to articles is 1330: 426. The active
contributing countries are USA (41.0%), Australia (19.3%), Malaysia (16.0%),
England (6.5%) and France (5.6%). The productive authors are mainly affiliated
to the Centre for Disease Control and Prevention, USA and Commonwealth
Scientific and Industrial Research Organization (CSIRO) in Australia and
University of Malaya Medical Centre, Malaysia. A total of 10572 citations were
received and the ratio of articles to citation is 1: 24.8. Collaboration with
the bigger laboratories in USA and Australia is contributive to the sustained
growth of published literature and to access diverse expertise.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 02:15:09 GMT"
}
] | 2013-01-24T00:00:00 |
[
[
"Safahieh",
"H.",
""
],
[
"Sanni",
"S. A.",
""
],
[
"Zainab",
"A. N.",
""
]
] |
new_dataset
| 0.973957 |
1301.5387
|
Nur Jannatul Adnin Ms.
|
A. N. Zainab
|
Open Access repositories and journals for visibility: Implications for
Malaysian libraries
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the growth of Open Access (OA) repositories and journals
as reported by monitoring initiatives such as ROAR (Registry of Open Access
Repositories), Open DOAR (Open Directory of Open Access Repositories), DOAJ
(Directory of Open Access Journals), Directory of Web Ranking of World
Repositories by the Cybermetrics Laboratory in Spain and published literature.
The performance of Malaysian OA repositories and journals is highlighted. The
strength of OA channels in increasing visibility and citations are evidenced by
research findings. It is proposed that libraries champion OA initiatives by
making university or institutional governance aware; encouraging institutional
journal publishers to adopt OA platform; collaborating with research groups to
jumpstart OA institutional initiatives and to embed OA awareness into user and
researcher education programmes. By actively involved, libraries will be free
of permission, licensing and archiving barriers usually imposed in traditional
publishing situation.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 02:36:55 GMT"
}
] | 2013-01-24T00:00:00 |
[
[
"Zainab",
"A. N.",
""
]
] |
new_dataset
| 0.999619 |
1301.5585
|
Janusz Brzozowski
|
Janusz Brzozowski, Hellis Tamm
|
Minimal Nondeterministic Finite Automata and Atoms of Regular Languages
|
15 pages, 29 tables
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine the NFA minimization problem in terms of atomic NFA's, that is,
NFA's in which the right language of every state is a union of atoms, where the
atoms of a regular language are non-empty intersections of complemented and
uncomplemented left quotients of the language. We characterize all reduced
atomic NFA's of a given language, that is, those NFA's that have no equivalent
states. Using atomic NFA's, we formalize Sengoku's approach to NFA minimization
and prove that his method fails to find all minimal NFA's. We also formulate
the Kameda-Weiner NFA minimization in terms of quotients and atoms.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 17:51:05 GMT"
}
] | 2013-01-24T00:00:00 |
[
[
"Brzozowski",
"Janusz",
""
],
[
"Tamm",
"Hellis",
""
]
] |
new_dataset
| 0.998856 |
1301.5593
|
Bowen Zhang
|
Bowen Zhang and John Baillieul
|
A Packetized Direct Load Control Mechanism for Demand Side Management
|
the 51st IEEE Conference on Decision and Control,December 10-13,
Maui, 2012
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electricity peaks can be harmful to grid stability and result in additional
generation costs to balance supply with demand. By developing a network of
smart appliances together with a quasi-decentralized control protocol, direct
load control (DLC) provides an opportunity to reduce peak consumption by
directly controlling the on/off switch of the networked appliances. This paper
proposes a packetized DLC (PDLC) solution that is illustrated by an application
to air conditioning temperature control. Here the term packetized refers to a
fixed time energy usage authorization. The consumers in each room choose their
preferred set point, and then an operator of the local appliance pool will
determine the comfort band around the set point. We use a thermal dynamic model
to investigate the duty cycle of thermostatic appliances. Three theorems are
proposed in this paper. The first two theorems evaluate the performance of the
PDLC in both transient and steady state operation. The first theorem proves
that the average room temperature would converge to the average room set point
with fixed number of packets applied in each discrete interval. The second
theorem proves that the PDLC solution guarantees to control the temperature of
all the rooms within their individual comfort bands. The third theorem proposes
an allocation method to link the results in theorem 1 and assumptions in
theorem 2 such that the overall PDLC solution works. The direct result of the
theorems is that we can reduce the consumption oscillation that occurs when no
control is applied. Simulation is provided to verify theoretical results.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 18:30:02 GMT"
}
] | 2013-01-24T00:00:00 |
[
[
"Zhang",
"Bowen",
""
],
[
"Baillieul",
"John",
""
]
] |
new_dataset
| 0.951626 |
1101.2759
|
Jaydip Sen
|
Jaydip Sen
|
Routing Security Issues in Wireless Sensor Networks: Attacks and
Defenses
|
32 pages, 5 figures, 4 tables 4. arXiv admin note: substantial text
overlap with arXiv:1011.1529
|
Book Chapter in Sustainable Wireless Sensor Networks, Yen Kheng
Tan (Ed.), ISBN: 978-953-307-297-5, INTECH Publishers, Croatia, December
2010. Chapter 12, pp. 279 - 309
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) are rapidly emerging as an important new area
in wireless and mobile computing research. Applications of WSNs are numerous
and growing, and range from indoor deployment scenarios in the home and office
to outdoor deployment scenarios in adversary's territory in a tactical
battleground (Akyildiz et al., 2002). For military environment, dispersal of
WSNs into an adversary's territory enables the detection and tracking of enemy
soldiers and vehicles. For home/office environments, indoor sensor networks
offer the ability to monitor the health of the elderly and to detect intruders
via a wireless home security system. In each of these scenarios, lives and
livelihoods may depend on the timeliness and correctness of the sensor data
obtained from dispersed sensor nodes. As a result, such WSNs must be secured to
prevent an intruder from obstructing the delivery of correct sensor data and
from forging sensor data. To address the latter problem, end-to-end data
integrity checksums and post-processing of senor data can be used to identify
forged sensor data (Estrin et al., 1999; Hu et al., 2003a; Ye et al., 2004).
The focus of this chapter is on routing security in WSNs. Most of the currently
existing routing protocols for WSNs make an optimization on the limited
capabilities of the nodes and the application-specific nature of the network,
but do not any the security aspects of the protocols. Although these protocols
have not been designed with security as a goal, it is extremely important to
analyze their security properties. When the defender has the liabilities of
insecure wireless communication, limited node capabilities, and possible
insider threats, and the adversaries can use powerful laptops with high energy
and long range communication to attack the network, designing a secure routing
protocol for WSNs is obviously a non-trivial task.
|
[
{
"version": "v1",
"created": "Fri, 14 Jan 2011 10:23:22 GMT"
}
] | 2013-01-23T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.997979 |
1301.5065
|
Jaydip Sen
|
Jaydip Sen
|
Security in Wireless Sensor Networks
|
51 pages. 5 Figures and 7 Tables. Book Chapter in the book "Wireless
Sensor Networks: Current Status and Future Trends", A.S.K. Pathan et al.
(eds.), CRC Press USA, November 2012; This book chapter is an extended
version of author's earlier arXiv submission: arXiv:1011.1529 and also has
substantial text overlap with arXiv:1101.2759
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks have attracted a lot of interest over the last
decade in wireless and mobile computing research community. Applications of
these networks are numerous and growing, which range from indoor deployment
scenarios in the home and office to outdoor deployment in adversary's territory
in a tactical battleground. However, due to distributed nature and their
deployment in remote areas, these networks are vulnerable to numerous security
threats that can adversely affect their performance. This chapter provides a
comprehensive discussion on the state of the art in security technologies for
wireless sensor networks. It identifies various possible attacks at different
layers of the communication protocol stack in a typical sensor network and
their possible countermeasures. A brief discussion on the future direction of
research in WSN security is also included.
|
[
{
"version": "v1",
"created": "Tue, 22 Jan 2013 04:09:05 GMT"
}
] | 2013-01-23T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.998504 |
1301.5075
|
EPTCS
|
John T. O'Donnell (School of Computing Science, University of Glasgow)
|
Connecting the Dots: Computer Systems Education using a Functional
Hardware Description Language
|
In Proceedings TFPIE 2012, arXiv:1301.4650
|
EPTCS 106, 2013, pp. 20-39
|
10.4204/EPTCS.106.2
| null |
cs.CY cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A functional hardware description language enables students to gain a working
understanding of computer systems, and to see how the levels of abstraction fit
together. By simulating circuits, digital design becomes a living topic, like
programming, and not just a set of inert facts to memorise. Experiences gained
from more than 20 years of teaching computer systems via functional programming
are discussed.
|
[
{
"version": "v1",
"created": "Tue, 22 Jan 2013 05:17:34 GMT"
}
] | 2013-01-23T00:00:00 |
[
[
"O'Donnell",
"John T.",
"",
"School of Computing Science, University of Glasgow"
]
] |
new_dataset
| 0.997107 |
1012.3340
|
Koji Nuida
|
Koji Nuida
|
Short collusion-secure fingerprint codes against three pirates
|
20 pages, a preliminary version was presented at Information Hiding
2010, Calgary, Canada, June 28-30, 2010
|
International Journal of Information Security, vol.11, no.2 (2012)
85-102
|
10.1007/s10207-012-0155-8
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we propose a new construction of probabilistic
collusion-secure fingerprint codes against up to three pirates and give a
theoretical security evaluation. Our pirate tracing algorithm combines a
scoring method analogous to Tardos codes (J. ACM, 2008) with an extension of
parent search techniques of some preceding 2-secure codes. Numerical examples
show that our code lengths are significantly shorter than (about 30% to 40% of)
the shortest known c-secure codes by Nuida et al. (Des. Codes Cryptogr., 2009)
with c = 3. Some preliminary proposal for improving efficiency of our tracing
algorithm is also given.
|
[
{
"version": "v1",
"created": "Wed, 15 Dec 2010 14:06:15 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Nuida",
"Koji",
""
]
] |
new_dataset
| 0.996106 |
1110.5794
|
Peng Zhou
|
Peng Zhou, Xiapu Luo, Ang Chen and Rocky K. C. Chang
|
STor: Social Network based Anonymous Communication in Tor
|
Key words: Social Network, Anonymous Communication, Tor, Fuzzy Model
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anonymity networks hide user identities with the help of relayed anonymity
routers. However, the state-of-the-art anonymity networks do not provide an
effective trust model. As a result, users cannot circumvent malicious or
vulnerable routers, thus making them susceptible to malicious router based
attacks (e.g., correlation attacks). In this paper, we propose a novel social
network based trust model to help anonymity networks circumvent malicious
routers and obtain secure anonymity. In particular, we design an input
independent fuzzy model to determine trust relationships between friends based
on qualitative and quantitative social attributes, both of which can be readily
obtained from existing social networks. Moreover, we design an algorithm for
propagating trust over an anonymity network. We integrate these two elements in
STor, a novel social network based Tor. We have implemented STor by modifying
the Tor's source code and conducted experiments on PlanetLab to evaluate the
effectiveness of STor. Both simulation and PlanetLab experiment results have
demonstrated that STor can achieve secure anonymity by establishing trust-based
circuits in a distributed way. Although the design of STor is based on Tor
network, the social network based trust model can be adopted by other anonymity
networks.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2011 14:00:21 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Nov 2011 12:44:23 GMT"
},
{
"version": "v3",
"created": "Mon, 7 Nov 2011 02:39:34 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Dec 2011 04:56:01 GMT"
},
{
"version": "v5",
"created": "Wed, 18 Jul 2012 06:08:08 GMT"
},
{
"version": "v6",
"created": "Mon, 21 Jan 2013 09:48:59 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Zhou",
"Peng",
""
],
[
"Luo",
"Xiapu",
""
],
[
"Chen",
"Ang",
""
],
[
"Chang",
"Rocky K. C.",
""
]
] |
new_dataset
| 0.956336 |
1203.1203
|
Gabriele Fici
|
Michelangelo Bucci, Alessandro De Luca, Gabriele Fici
|
Enumeration and Structure of Trapezoidal Words
|
Accepted for publication in Theoretical Computer Science
|
Theoretical Computer Science 468, 12-22 (2013)
|
10.1016/j.tcs.2012.11.007
| null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trapezoidal words are words having at most $n+1$ distinct factors of length
$n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give
combinatorial characterizations of trapezoidal words and exhibit a formula for
their enumeration. We then separate trapezoidal words into two disjoint
classes: open and closed. A trapezoidal word is closed if it has a factor that
occurs only as a prefix and as a suffix; otherwise it is open. We investigate
open and closed trapezoidal words, in relation with their special factors. We
prove that Sturmian palindromes are closed trapezoidal words and that a closed
trapezoidal word is a Sturmian palindrome if and only if its longest repeated
prefix is a palindrome. We also define a new class of words, \emph{semicentral
words}, and show that they are characterized by the property that they can be
written as $uxyu$, for a central word $u$ and two different letters $x,y$.
Finally, we investigate the prefixes of the Fibonacci word with respect to the
property of being open or closed trapezoidal words, and show that the sequence
of open and closed prefixes of the Fibonacci word follows the Fibonacci
sequence.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2012 14:04:29 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Oct 2012 23:06:07 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Bucci",
"Michelangelo",
""
],
[
"De Luca",
"Alessandro",
""
],
[
"Fici",
"Gabriele",
""
]
] |
new_dataset
| 0.993331 |
1203.2202
|
Hongmei Xie
|
Hongmei Xie and Zhiyuan Yan
|
Exact-MSR Codes for Distributed Storage with Low Repair Complexity
|
This paper has been withdrawn by the author due to incorrect
statements
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose two new constructions of exact-repair minimum
storage regenerating (exact-MSR) codes. For both constructions, the encoded
symbols are obtained by treating the message vector over GF(q) as a linearized
polynomial and evaluating it over an extension field GF(q^m). For our exact-MSR
codes, data repair does not need matrix inversion, and can be implemented by
additions and multiplications over GF$(q)$ as well as cyclic shifts when a
normal basis is used. The two constructions assume a base field of GF(q) (q>2)
and GF(2), respectively. In contrast to existing constructions of exact-MSR
codes, the former construction works for arbitrary code parameters, provided
that $q$ is large enough. This is the first construction of exact-MSR codes
with arbitrary code parameters, to the best of our knowledge. In comparison to
existing exact-MSR codes, while data construction of our exact-MSR codes has a
higher complexity, the complexity of data repair is lower. Thus, they are
attractive for applications that need a small number of data reconstructions
along with a large number of data repairs.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2012 22:47:48 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Jan 2013 20:52:30 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Xie",
"Hongmei",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.999275 |
1210.5932
|
Vijayvaradharaj Muralidharan
|
Vijayvaradharaj T. Muralidharan and B. Sundar Rajan
|
Physical Layer Network Coding for the K-user Multiple Access Relay
Channel
|
More Simulation results added, 12 pages, 10 figures. arXiv admin
note: substantial text overlap with arXiv:1210.0490
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Physical layer Network Coding (PNC) scheme is proposed for the $K$-user
wireless Multiple Access Relay Channel (MARC), in which $K$ source nodes
transmit their messages to the destination node $D$ with the help of a relay
node $R.$ The proposed PNC scheme involves two transmission phases: (i) Phase 1
during which the source nodes transmit, the relay node and the destination node
receive and (ii) Phase 2 during which the source nodes and the relay node
transmit, and the destination node receives. At the end of Phase 1, the relay
node decodes the messages of the source nodes and during Phase 2 transmits a
many-to-one function of the decoded messages. Wireless networks in which the
relay node decodes, suffer from loss of diversity order if the decoder at the
destination is not chosen properly. A novel decoder is proposed for the PNC
scheme, which offers the maximum possible diversity order of $2,$ for a proper
choice of certain parameters and the network coding map. Specifically, the
network coding map used at the relay is chosen to be a $K$-dimensional Latin
Hypercube, in order to ensure the maximum diversity order of $2.$ Also, it is
shown that the proposed decoder can be implemented by a fast decoding
algorithm. Simulation results presented for the 3-user MARC show that the
proposed scheme offers a large gain over the existing scheme for the $K$-user
MARC.
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 15:31:35 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Jan 2013 16:11:26 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Muralidharan",
"Vijayvaradharaj T.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.999698 |
1301.4539
|
Olivier Cessenat
|
Olivier Cessenat (CEA CESTA)
|
Sophie, an FDTD code on the way to multicore, getting rid of the memory
bandwidth bottleneck better using cache
|
21 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
FDTD codes, such as Sophie developed at CEA/DAM, no longer take advantage of
the processor's increased computing power, especially recently with the raising
multicore technology. This is rooted in the fact that low order numerical
schemes need an important memory bandwidth to bring and store the computed
fields. The aim of this article is to present a programming method at the
software's architecture level that improves the memory access pattern in order
to reuse data in cache instead of constantly accessing RAM memory. We will
exhibit a more than two computing time improvement in practical applications.
The target audience of this article is made of computing scientists and of
electrical engineers that develop simulation codes with no specific knowledge
in computer science or electronics.
|
[
{
"version": "v1",
"created": "Sat, 19 Jan 2013 08:13:27 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Cessenat",
"Olivier",
"",
"CEA CESTA"
]
] |
new_dataset
| 0.994351 |
1301.4654
|
Deepali Virmani
|
Deepali Virmani, Satbir Jain
|
Real Time scheduling with Virtual Nodes for Self Stabilization in
Wireless Sensor Networks
|
arXiv admin note: substantial text overlap with arXiv:cs/0608069 by
other authors without attribution
|
International Journal of Information Technology and Knowledge
Management July-December 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a new scheduling algorithm called Real Time
Scheduling (RTS) which uses virtual nodes for self stabilization. This
algorithm deals with all the contributing components of the end-to-end
travelling delay of data packets in sensor network and with virtual nodes
algorithm achieves QoS in terms of packet delivery, multiple connections,
better power management and stable routes in case of failure. RTS delays
packets at intermediate hops (not just prioritizes them) for a duration that is
a function of their deadline. Delaying packets allows the network to avoid hot
spotting while maintaining deadline-faithfulness. We compare RTS with another
prioritizing and scheduling algorithm for real-time data dissemination in
sensor networks, velocity monotonic scheduling. This paper simulates RTS based
on two typical routing protocols, shortest path routing and greedy forwarding
with J-Sim.
|
[
{
"version": "v1",
"created": "Sun, 20 Jan 2013 12:43:56 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Virmani",
"Deepali",
""
],
[
"Jain",
"Satbir",
""
]
] |
new_dataset
| 0.994178 |
1301.4858
|
Luis Quesada
|
Luis Quesada, Fernando Berzal, Juan-Carlos Cubero
|
A DSL for Mapping Abstract Syntax Models to Concrete Syntax Models in
ModelCC
|
arXiv admin note: substantial text overlap with arXiv:1202.6593
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ModelCC is a model-based parser generator that decouples language design from
language processing. ModelCC provides two different mechanisms to specify the
mapping from an abstract syntax model to a concrete syntax model: metadata
annotations defined on top of the abstract syntax model specification and a
domain-specific language for defining ASM-CSM mappings. Using a domain-specific
language to specify the mapping from abstract to concrete syntax models allows
the definition of multiple concrete syntax models for the same abstract syntax
model. In this paper, we describe the ModelCC domain-specific language for
abstract syntax model to concrete syntax model mappings and we showcase its
capabilities by providing a meta-definition of that domain-specific language.
|
[
{
"version": "v1",
"created": "Mon, 21 Jan 2013 13:18:10 GMT"
}
] | 2013-01-22T00:00:00 |
[
[
"Quesada",
"Luis",
""
],
[
"Berzal",
"Fernando",
""
],
[
"Cubero",
"Juan-Carlos",
""
]
] |
new_dataset
| 0.999524 |
1301.4300
|
Henk Hollmann
|
Henk D. L. Hollmann
|
Storage codes -- coding rate and repair locality
|
Accepted for publication in ICNC'13, San Diego, USA
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The {\em repair locality} of a distributed storage code is the maximum number
of nodes that ever needs to be contacted during the repair of a failed node.
Having small repair locality is desirable, since it is proportional to the
number of disk accesses during repair. However, recent publications show that
small repair locality comes with a penalty in terms of code distance or storage
overhead if exact repair is required.
Here, we first review some of the main results on storage codes under various
repair regimes and discuss the recent work on possible
(information-theoretical) trade-offs between repair locality and other code
parameters like storage overhead and code distance, under the exact repair
regime.
Then we present some new information theoretical lower bounds on the storage
overhead as a function of the repair locality, valid for all common coding and
repair models. In particular, we show that if each of the $n$ nodes in a
distributed storage system has storage capacity $\ga$ and if, at any time, a
failed node can be {\em functionally} repaired by contacting {\em some} set of
$r$ nodes (which may depend on the actual state of the system) and downloading
an amount $\gb$ of data from each, then in the extreme cases where $\ga=\gb$ or
$\ga = r\gb$, the maximal coding rate is at most $r/(r+1)$ or 1/2, respectively
(that is, the excess storage overhead is at least $1/r$ or 1, respectively).
|
[
{
"version": "v1",
"created": "Fri, 18 Jan 2013 05:31:02 GMT"
}
] | 2013-01-21T00:00:00 |
[
[
"Hollmann",
"Henk D. L.",
""
]
] |
new_dataset
| 0.999343 |
1301.3834
|
Ann Becker
|
Ann Becker, Dan Geiger, Christopher Meek
|
Perfect Tree-Like Markovian Distributions
|
Appears in Proceedings of the Sixteenth Conference on Uncertainty in
Artificial Intelligence (UAI2000)
| null | null |
UAI-P-2000-PG-19-23
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that if a strictly positive joint probability distribution for a set
of binary random variables factors according to a tree, then vertex separation
represents all and only the independence relations enclosed in the
distribution. The same result is shown to hold also for multivariate strictly
positive normal distributions. Our proof uses a new property of conditional
independence that holds for these two classes of probability distributions.
|
[
{
"version": "v1",
"created": "Wed, 16 Jan 2013 15:48:48 GMT"
}
] | 2013-01-18T00:00:00 |
[
[
"Becker",
"Ann",
""
],
[
"Geiger",
"Dan",
""
],
[
"Meek",
"Christopher",
""
]
] |
new_dataset
| 0.95863 |
1301.3837
|
Jeff A. Bilmes
|
Jeff A. Bilmes
|
Dynamic Bayesian Multinets
|
Appears in Proceedings of the Sixteenth Conference on Uncertainty in
Artificial Intelligence (UAI2000)
| null | null |
UAI-P-2000-PG-38-45
|
cs.LG cs.AI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, dynamic Bayesian multinets are introduced where a Markov chain
state at time t determines conditional independence patterns between random
variables lying within a local time window surrounding t. It is shown how
information-theoretic criterion functions can be used to induce sparse,
discriminative, and class-conditional network structures that yield an optimal
approximation to the class posterior probability, and therefore are useful for
the classification task. Using a new structure learning heuristic, the
resulting models are tested on a medium-vocabulary isolated-word speech
recognition task. It is demonstrated that these discriminatively structured
dynamic Bayesian multinets, when trained in a maximum likelihood setting using
EM, can outperform both HMMs and other dynamic Bayesian networks with a similar
number of parameters.
|
[
{
"version": "v1",
"created": "Wed, 16 Jan 2013 15:48:59 GMT"
}
] | 2013-01-18T00:00:00 |
[
[
"Bilmes",
"Jeff A.",
""
]
] |
new_dataset
| 0.958055 |
1301.3886
|
David M Pennock
|
David M. Pennock, Michael P. Wellman
|
Compact Securities Markets for Pareto Optimal Reallocation of Risk
|
Appears in Proceedings of the Sixteenth Conference on Uncertainty in
Artificial Intelligence (UAI2000)
| null | null |
UAI-P-2000-PG-481-488
|
cs.GT q-fin.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emph{securities market} is the fundamental theoretical framework in
economics and finance for resource allocation under uncertainty. Securities
serve both to reallocate risk and to disseminate probabilistic information.
emph{Complete} securities markets - which contain one security for every
possible state of nature - support Pareto optimal allocations of risk. Complete
markets suffer from the same exponential dependence on the number of underlying
events as do joint probability distributions. We examine whether markets can be
structured and "compacted" in the same manner as Bayesian network
representations of joint distributions. We show that, if all agents'
risk-neutral independencies agree with the independencies encoded in the market
structure, then the market is emph{operationally complete}: risk is still
Pareto optimally allocated, yet the number of securities can be exponentially
smaller. For collections of agents of a certain type, agreement on Markov
independencies is sufficient to admit compact and operationally complete
markets.
|
[
{
"version": "v1",
"created": "Wed, 16 Jan 2013 15:52:13 GMT"
}
] | 2013-01-18T00:00:00 |
[
[
"Pennock",
"David M.",
""
],
[
"Wellman",
"Michael P.",
""
]
] |
new_dataset
| 0.966751 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.