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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1303.6777
|
Andreas Angerer
|
Andreas Angerer, Remi Smirra, Alwin Hoffmann, Andreas Schierl, Michael
Vistein and Wolfgang Reif
|
A Graphical Language for Real-Time Critical Robot Commands
|
Presented at DSLRob 2012 (arXiv:cs/1302.5082)
| null | null |
DSLRob/2012/02
|
cs.RO cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Industrial robotics is characterized by sophisticated mechanical components
and highly-developed real-time control algorithms. However, the efficient use
of robotic systems is very much limited by existing proprietary programming
methods. In the research project SoftRobot, a software architecture was
developed that enables the programming of complex real-time critical robot
tasks with an object-oriented general purpose language. On top of this
architecture, a graphical language was developed to ease the specification of
complex robot commands, which can then be used as part of robot application
workflows. This paper gives an overview about the design and implementation of
this graphical language and illustrates its usefulness with some examples.
|
[
{
"version": "v1",
"created": "Wed, 27 Mar 2013 10:14:44 GMT"
}
] | 2013-03-28T00:00:00 |
[
[
"Angerer",
"Andreas",
""
],
[
"Smirra",
"Remi",
""
],
[
"Hoffmann",
"Alwin",
""
],
[
"Schierl",
"Andreas",
""
],
[
"Vistein",
"Michael",
""
],
[
"Reif",
"Wolfgang",
""
]
] |
new_dataset
| 0.994764 |
1112.1795
|
Francois Clement
|
Sylvie Boldo (INRIA Saclay - Ile de France, LRI), Francois Clement
(INRIA Rocquencourt), Jean-Christophe Filli\^atre (INRIA Saclay - Ile de
France, LRI), Micaela Mayero (LIPN, Inria Grenoble Rh\^one-Alpes / LIP
Laboratoire de l'Informatique du Parall\'elisme), Guillaume Melquiond (INRIA
Saclay - Ile de France, LRI), Pierre Weis (INRIA Rocquencourt)
|
Wave Equation Numerical Resolution: a Comprehensive Mechanized Proof of
a C Program
|
No. RR-7826 (2011)
|
Journal of Automated Reasoning 50, 4 (2013) 423-456
|
10.1007/s10817-012-9255-4
| null |
cs.LO math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We formally prove correct a C program that implements a numerical scheme for
the resolution of the one-dimensional acoustic wave equation. Such an
implementation introduces errors at several levels: the numerical scheme
introduces method errors, and floating-point computations lead to round-off
errors. We annotate this C program to specify both method error and round-off
error. We use Frama-C to generate theorems that guarantee the soundness of the
code. We discharge these theorems using SMT solvers, Gappa, and Coq. This
involves a large Coq development to prove the adequacy of the C program to the
numerical scheme and to bound errors. To our knowledge, this is the first time
such a numerical analysis program is fully machine-checked.
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2011 09:45:56 GMT"
},
{
"version": "v2",
"created": "Wed, 16 May 2012 06:57:05 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Jul 2012 13:32:53 GMT"
}
] | 2013-03-27T00:00:00 |
[
[
"Boldo",
"Sylvie",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Clement",
"Francois",
"",
"INRIA Rocquencourt"
],
[
"Filliâtre",
"Jean-Christophe",
"",
"INRIA Saclay - Ile de\n France, LRI"
],
[
"Mayero",
"Micaela",
"",
"LIPN, Inria Grenoble Rhône-Alpes / LIP\n Laboratoire de l'Informatique du Parallélisme"
],
[
"Melquiond",
"Guillaume",
"",
"INRIA\n Saclay - Ile de France, LRI"
],
[
"Weis",
"Pierre",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.99183 |
1008.2750
|
Alex Alvarado
|
Alex Alvarado, Leszek Szczecinski, Erik Agrell
|
On BICM receivers for TCM transmission
|
Submitted to the IEEE Transactions on Communications
|
IEEE Trans. Commun., vol. 59, no. 10, pp. 2692-2702 , 2011
|
10.1109/TCOMM.2011.091411.100505
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent results have shown that the performance of bit-interleaved coded
modulation (BICM) using convolutional codes in nonfading channels can be
significantly improved when the interleaver takes a trivial form (BICM-T),
i.e., when it does not interleave the bits at all. In this paper, we give a
formal explanation for these results and show that BICM-T is in fact the
combination of a TCM transmitter and a BICM receiver. To predict the
performance of BICM-T, a new type of distance spectrum for convolutional codes
is introduced, analytical bounds based on this spectrum are developed, and
asymptotic approximations are also presented. It is shown that the minimum
distance of the code is not the relevant optimization criterion for BICM-T.
Optimal convolutional codes for different constrain lengths are tabulated and
asymptotic gains of about 2 dB are obtained. These gains are found to be the
same as those obtained by Ungerboeck's one-dimensional trellis coded modulation
(1D-TCM), and therefore, in nonfading channels, BICM-T is shown to be
asymptotically as good as 1D-TCM.
|
[
{
"version": "v1",
"created": "Mon, 16 Aug 2010 19:52:04 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Dec 2010 17:31:37 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Alvarado",
"Alex",
""
],
[
"Szczecinski",
"Leszek",
""
],
[
"Agrell",
"Erik",
""
]
] |
new_dataset
| 0.963693 |
1209.5931
|
Stefan Hild
|
Stefan Hild, Sean Leavey, Christian Gr\"af and Borja Sorazu
|
Smart Charging Technologies for Portable Electronic Devices
|
Updated version with a new section describing a software based
charging control of a laptop
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we describe our efforts of extending demand-side control
concepts to the application in portable electronic devices, such as laptop
computers, mobile phones and tablet computers. As these devices feature
built-in energy storage (in the form of batteries) and the ability to run
complex control routines, they are ideal for the implementation of smart
charging concepts. We developed a prototype of a smart laptop charger that
controls the charging process depending on the locally measured frequency of
the electricity grid. If this technique is incorporated into millions of
devices in UK households, this will contribute significantly to the stability
of the electricity grid, help to mitigate the power production fluctuations
from renewable energy sources and avoid the high cost of building and
maintaining conventional power plants as standby reserve.
|
[
{
"version": "v1",
"created": "Tue, 25 Sep 2012 13:37:10 GMT"
},
{
"version": "v2",
"created": "Sat, 23 Mar 2013 15:30:17 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Hild",
"Stefan",
""
],
[
"Leavey",
"Sean",
""
],
[
"Gräf",
"Christian",
""
],
[
"Sorazu",
"Borja",
""
]
] |
new_dataset
| 0.999363 |
1210.7774
|
Mads Kristensen
|
Mads Ruben Burgdorff Kristensen, Simon Andreas Frimann Lund, Troels
Blum, Brian Vinter
|
cphVB: A System for Automated Runtime Optimization and Parallelization
of Vectorized Applications
| null |
Proceedings of The 11th Python In Science Conference (SciPy 2012)
| null | null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern processor architectures, in addition to having still more cores, also
require still more consideration to memory-layout in order to run at full
capacity. The usefulness of most languages is deprecating as their
abstractions, structures or objects are hard to map onto modern processor
architectures efficiently.
The work in this paper introduces a new abstract machine framework, cphVB,
that enables vector oriented high-level programming languages to map onto a
broad range of architectures efficiently. The idea is to close the gap between
high-level languages and hardware optimized low-level implementations. By
translating high-level vector operations into an intermediate vector bytecode,
cphVB enables specialized vector engines to efficiently execute the vector
operations.
The primary success parameters are to maintain a complete abstraction from
low-level details and to provide efficient code execution across different,
modern, processors. We evaluate the presented design through a setup that
targets multi-core CPU architectures. We evaluate the performance of the
implementation using Python implementations of well-known algorithms: a jacobi
solver, a kNN search, a shallow water simulation and a synthetic stencil
simulation. All demonstrate good performance.
|
[
{
"version": "v1",
"created": "Fri, 26 Oct 2012 12:03:08 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Mar 2013 15:18:56 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Kristensen",
"Mads Ruben Burgdorff",
""
],
[
"Lund",
"Simon Andreas Frimann",
""
],
[
"Blum",
"Troels",
""
],
[
"Vinter",
"Brian",
""
]
] |
new_dataset
| 0.996517 |
1303.4905
|
Giuseppe Pirr\'o
|
Valeria Fionda, Claudio Gutierrez, Giuseppe Pirr\'o
|
Web Maps and Their Algebra
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A map is an abstract visual representation of a region, taken from a given
space, usually designed for final human consumption. Traditional cartography
focuses on the mapping of Euclidean spaces by using some distance metric. In
this paper we aim at mapping the Web space by leveraging its relational nature.
We introduce a general mathematical framework for maps and an algebra and
discuss the feasibility of maps suitable for interpretation not only by humans
but also by machines.
|
[
{
"version": "v1",
"created": "Wed, 20 Mar 2013 11:15:10 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Mar 2013 10:39:36 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Fionda",
"Valeria",
""
],
[
"Gutierrez",
"Claudio",
""
],
[
"Pirró",
"Giuseppe",
""
]
] |
new_dataset
| 0.998454 |
1303.5364
|
Dr. Nadeem Javaid
|
S. Faisal, N. Javaid, A. Javaid, M. A. Khan, S. H. Bouk, Z. A. Khan
|
Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks
| null |
Journal of Basic and Applied Scientific Research (JBASR), 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) are comprised of thousands of sensor nodes,
with restricted energy, that co-operate to accomplish a sensing task. Various
routing Protocols are designed for transmission in WSNs. In this paper, we
proposed a hybrid routing protocol: Zonal-Stable Election Protocol (Z-SEP) for
heterogeneous WSNs. In this protocol, some nodes transmit data directly to base
station while some use clustering technique to send data to base station as in
SEP. We implemented Z-SEP and compared it with traditional Low Energy adaptive
clustering hierarchy (LEACH) and SEP. Simulation results showed that Z-SEP
enhanced the stability period and throughput than existing protocols like LEACH
and SEP.
|
[
{
"version": "v1",
"created": "Thu, 21 Mar 2013 18:37:48 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Mar 2013 16:26:36 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Faisal",
"S.",
""
],
[
"Javaid",
"N.",
""
],
[
"Javaid",
"A.",
""
],
[
"Khan",
"M. A.",
""
],
[
"Bouk",
"S. H.",
""
],
[
"Khan",
"Z. A.",
""
]
] |
new_dataset
| 0.997126 |
1303.5800
|
Mugurel Ionut Andreica
|
Mugurel Ionut Andreica, Eliana-Dina Tirsa
|
Line-Constrained Geometric Server Placement
| null |
Metalurgia International, vol. 16, no. 11, pp. 106-110, 2011.
(ISSN: 1582-2214)
| null | null |
cs.DS cs.CG cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present new algorithmic solutions for several constrained
geometric server placement problems. We consider the problems of computing the
1-center and obnoxious 1-center of a set of line segments, constrained to lie
on a line segment, and the problem of computing the K-median of a set of
points, constrained to lie on a line. The presented algorithms have
applications in many types of distributed systems, as well as in various fields
which make use of distributed systems for running some of their applications
(like chemistry, metallurgy, physics, etc.).
|
[
{
"version": "v1",
"created": "Sat, 23 Mar 2013 00:29:24 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Andreica",
"Mugurel Ionut",
""
],
[
"Tirsa",
"Eliana-Dina",
""
]
] |
new_dataset
| 0.952986 |
1303.5874
|
Oscar Mora
|
Oscar Mora and Jes\'us Bisbal
|
BIMS: Biomedical Information Management System
|
5 pages
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present BIMS (Biomedical Information Management System).
BIMS is a software architecture designed to provide a flexible computational
framework to manage the information needs of a wide range of biomedical
research projects. The main goal is to facilitate the clinicians' job in data
entry, and researcher's tasks in data management, in high data quality
biomedical research projects. The BIMS architecture has been designed following
the two-level modeling paradigm, a promising methodology to model rich and
dynamic information environments. In addition, a functional implementation of
BIMS architecture has been developed as a web-based application. The result is
a highly flexible web application which allows modeling and managing large
amounts of heterogeneous biomedical data sets, both textual as well as visual
(medical images) information.
|
[
{
"version": "v1",
"created": "Sat, 23 Mar 2013 18:54:02 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Mora",
"Oscar",
""
],
[
"Bisbal",
"Jesús",
""
]
] |
new_dataset
| 0.964129 |
1303.5929
|
Sourish Dasgupta
|
Sourish Dasgupta, Ankur Padia, Kushal Shah, Rupali KaPatel, Prasenjit
Majumder
|
DLOLIS-A: Description Logic based Text Ontology Learning
|
11 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ontology Learning has been the subject of intensive study for the past
decade. Researchers in this field have been motivated by the possibility of
automatically building a knowledge base on top of text documents so as to
support reasoning based knowledge extraction. While most works in this field
have been primarily statistical (known as light-weight Ontology Learning) not
much attempt has been made in axiomatic Ontology Learning (called heavy-weight
Ontology Learning) from Natural Language text documents. Heavy-weight Ontology
Learning supports more precise formal logic-based reasoning when compared to
statistical ontology learning. In this paper we have proposed a sound Ontology
Learning tool DLOL_(IS-A) that maps English language IS-A sentences into their
equivalent Description Logic (DL) expressions in order to automatically
generate a consistent pair of T-box and A-box thereby forming both regular
(definitional form) and generalized (axiomatic form) DL ontology. The current
scope of the paper is strictly limited to IS-A sentences that exclude the
possible structures of: (i) implicative IS-A sentences, and (ii) "Wh" IS-A
questions. Other linguistic nuances that arise out of pragmatics and epistemic
of IS-A sentences are beyond the scope of this present work. We have adopted
Gold Standard based Ontology Learning evaluation on chosen IS-A rich Wikipedia
documents.
|
[
{
"version": "v1",
"created": "Sun, 24 Mar 2013 08:39:18 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Dasgupta",
"Sourish",
""
],
[
"Padia",
"Ankur",
""
],
[
"Shah",
"Kushal",
""
],
[
"KaPatel",
"Rupali",
""
],
[
"Majumder",
"Prasenjit",
""
]
] |
new_dataset
| 0.998531 |
1303.5943
|
Dmitry Namiot
|
Dmitry Namiot and Manfred Sneps-Sneppe
|
Geofence and Network Proximity
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many of modern location-based services are often based on an area or place as
opposed to an accurate determination of the precise location. Geo-fencing
approach is based on the observation that users move from one place to another
and then stay at that place for a while. These places can be, for example,
commercial properties, homes, office centers and so on. As per geo-fencing
approach they could be described (defined) as some geographic areas bounded by
polygons. It assumes users simply move from fence to fence and stay inside
fences for a while. In this article we replace geo-based boundaries with
network proximity rules. This new approach let us effectively deploy location
based services indoor and provide a significant energy saving for mobile
devices comparing with the traditional methods.
|
[
{
"version": "v1",
"created": "Sun, 24 Mar 2013 12:52:51 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
],
[
"Sneps-Sneppe",
"Manfred",
""
]
] |
new_dataset
| 0.996948 |
1303.6076
|
Yu Wu
|
Yu Wu, Chuan Wu, Bo Li, Francis C.M. Lau
|
vSkyConf: Cloud-assisted Multi-party Mobile Video Conferencing
|
10 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As an important application in the busy world today, mobile video
conferencing facilitates virtual face-to-face communication with friends,
families and colleagues, via their mobile devices on the move. However, how to
provision high-quality, multi-party video conferencing experiences over mobile
devices is still an open challenge. The fundamental reason behind is the lack
of computation and communication capacities on the mobile devices, to scale to
large conferencing sessions. In this paper, we present vSkyConf, a
cloud-assisted mobile video conferencing system to fundamentally improve the
quality and scale of multi-party mobile video conferencing. By novelly
employing a surrogate virtual machine in the cloud for each mobile user, we
allow fully scalable communication among the conference participants via their
surrogates, rather than directly. The surrogates exchange conferencing streams
among each other, transcode the streams to the most appropriate bit rates, and
buffer the streams for the most efficient delivery to the mobile recipients. A
fully decentralized, optimal algorithm is designed to decide the best paths of
streams and the most suitable surrogates for video transcoding along the paths,
such that the limited bandwidth is fully utilized to deliver streams of the
highest possible quality to the mobile recipients. We also carefully tailor a
buffering mechanism on each surrogate to cooperate with optimal stream
distribution. We have implemented vSkyConf based on Amazon EC2 and verified the
excellent performance of our design, as compared to the widely adopted unicast
solutions.
|
[
{
"version": "v1",
"created": "Mon, 25 Mar 2013 10:35:35 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Wu",
"Yu",
""
],
[
"Wu",
"Chuan",
""
],
[
"Li",
"Bo",
""
],
[
"Lau",
"Francis C. M.",
""
]
] |
new_dataset
| 0.999449 |
1303.6200
|
Xujin Chen
|
Zhigang Cao, Xujin Chen, Changjun Wang
|
How to Schedule the Marketing of Products with Negative Externalities
|
16 pages, 1 figure
| null | null | null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In marketing products with negative externalities, a schedule which specifies
an order of consumer purchase decisions is crucial, since in the social network
of consumers, the decision of each consumer is negatively affected by the
choices of her neighbors. In this paper, we study the problems of finding a
marketing schedule for two asymmetric products with negative externalites. The
goals are two-fold: maximizing the sale of one product and ensuring regret-free
purchase decisions. We show that the maximization is NP-hard, and provide
efficient algorithms with satisfactory performance guarantees. Two of these
algorithms give regret-proof schedules, i.e. they reach Nash equilibria where
no consumers regret their previous decisions. Our work is the first attempt to
address these marketing problems from an algorithmic point of view.
|
[
{
"version": "v1",
"created": "Mon, 25 Mar 2013 16:32:20 GMT"
}
] | 2013-03-26T00:00:00 |
[
[
"Cao",
"Zhigang",
""
],
[
"Chen",
"Xujin",
""
],
[
"Wang",
"Changjun",
""
]
] |
new_dataset
| 0.996744 |
1207.1266
|
Gabriel Nivasch
|
Gabriel Nivasch, J\'anos Pach, Rom Pinchasi, Shira Zerbib
|
The number of distinct distances from a vertex of a convex polygon
|
11 pages, 4 figures
|
Journal of Computational Geometry, 4:1-12, 2013
| null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in
the plane contains a point that determines at least floor(n/2) distinct
distances to the other points of P. The best known lower bound due to
Dumitrescu (2006) is 13n/36 - O(1). In the present note, we slightly improve on
this result to (13/36 + eps)n - O(1) for eps ~= 1/23000. Our main ingredient is
an improved bound on the maximum number of isosceles triangles determined by P.
|
[
{
"version": "v1",
"created": "Thu, 5 Jul 2012 14:22:41 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Mar 2013 04:59:53 GMT"
}
] | 2013-03-25T00:00:00 |
[
[
"Nivasch",
"Gabriel",
""
],
[
"Pach",
"János",
""
],
[
"Pinchasi",
"Rom",
""
],
[
"Zerbib",
"Shira",
""
]
] |
new_dataset
| 0.995009 |
1303.5691
|
Martin Rumpf
|
Benjamin Berkels, Ivan Cabrilo, Sven Haller, Martin Rumpf, Carlo
Schaller
|
Cortical Surface Co-Registration based on MRI Images and Photos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brain shift, i.e. the change in configuration of the brain after opening the
dura mater, is a key problem in neuronavigation. We present an approach to
co-register intra-operative microscope images with pre-operative MRI to adapt
and optimize intra-operative neuronavigation. The tools are a robust
classification of sulci on MRI extracted cortical surfaces, guided user marking
of most prominent sulci on a microscope image, and the actual variational
registration method with a fidelity energy for 3D deformations of the cortical
surface combined with a higher order, linear elastica type prior energy.
Furthermore, the actual registration is validated on an artificial testbed with
known ground truth deformation and on real data of a neuro clinical patient.
|
[
{
"version": "v1",
"created": "Fri, 22 Mar 2013 19:07:13 GMT"
}
] | 2013-03-25T00:00:00 |
[
[
"Berkels",
"Benjamin",
""
],
[
"Cabrilo",
"Ivan",
""
],
[
"Haller",
"Sven",
""
],
[
"Rumpf",
"Martin",
""
],
[
"Schaller",
"Carlo",
""
]
] |
new_dataset
| 0.994731 |
1303.5698
|
Mehdi Bennis
|
Mehdi Bennis, Meryem Simsek, Walid Saad, Stefan Valentin, Merouane
Debbah, Andreas Czylwik
|
When Cellular Meets WiFi in Wireless Small Cell Networks
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The deployment of small cell base stations(SCBSs) overlaid on existing
macro-cellular systems is seen as a key solution for offloading traffic,
optimizing coverage, and boosting the capacity of future cellular wireless
systems. The next-generation of SCBSs is envisioned to be multi-mode, i.e.,
capable of transmitting simultaneously on both licensed and unlicensed bands.
This constitutes a cost-effective integration of both WiFi and cellular radio
access technologies (RATs) that can efficiently cope with peak wireless data
traffic and heterogeneous quality-of-service requirements. To leverage the
advantage of such multi-mode SCBSs, we discuss the novel proposed paradigm of
cross-system learning by means of which SCBSs self-organize and autonomously
steer their traffic flows across different RATs. Cross-system learning allows
the SCBSs to leverage the advantage of both the WiFi and cellular worlds. For
example, the SCBSs can offload delay-tolerant data traffic to WiFi, while
simultaneously learning the probability distribution function of their
transmission strategy over the licensed cellular band. This article will first
introduce the basic building blocks of cross-system learning and then provide
preliminary performance evaluation in a Long-Term Evolution (LTE) simulator
overlaid with WiFi hotspots. Remarkably, it is shown that the proposed
cross-system learning approach significantly outperforms a number of benchmark
traffic steering policies.
|
[
{
"version": "v1",
"created": "Fri, 22 Mar 2013 19:48:54 GMT"
}
] | 2013-03-25T00:00:00 |
[
[
"Bennis",
"Mehdi",
""
],
[
"Simsek",
"Meryem",
""
],
[
"Saad",
"Walid",
""
],
[
"Valentin",
"Stefan",
""
],
[
"Debbah",
"Merouane",
""
],
[
"Czylwik",
"Andreas",
""
]
] |
new_dataset
| 0.98037 |
1208.0460
|
Patrick Prosser
|
Alice Miller and Patrick Prosser
|
Diamond-free Degree Sequences
|
8 pages, 2 figures, 2 algorithms, 2 models, 1 table
|
Acta Univ. Sapientiae, Informatica, 4(2): 189-200, 2012
| null |
TR-2010-318
|
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new problem, CSPLib problem number 50, to generate all degree
sequences that have a corresponding diamond-free graph with secondary
properties. This problem arises naturally from a problem in mathematics to do
with balanced incomplete block designs; we devote a section of this paper to
this. The problem itself is challenging with respect to computational effort
arising from the large number of symmetries within the models. We introduce two
models for this problem. The second model is an improvement on the first, and
this improvement largely consists of breaking the problem into two stages, the
first stage producing graphical degree sequences that satisfy arithmetic
constraints and the second part testing that there exists a graph with that
degree sequence that is diamond-free.
|
[
{
"version": "v1",
"created": "Thu, 2 Aug 2012 12:11:25 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Aug 2012 10:38:35 GMT"
},
{
"version": "v3",
"created": "Wed, 22 Aug 2012 15:32:06 GMT"
}
] | 2013-03-22T00:00:00 |
[
[
"Miller",
"Alice",
""
],
[
"Prosser",
"Patrick",
""
]
] |
new_dataset
| 0.955884 |
1303.5134
|
Angeline Rao
|
Angeline Rao, Ying Liu, Yezhou Feng, and Jian Shen
|
Bounds on the Number of Huffman and Binary-Ternary Trees
|
17 pages, 6 figures, 1 table data
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Huffman coding is a widely used method for lossless data compression because
it optimally stores data based on how often the characters occur in Huffman
trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each
vertex can have either $n$ "children" vertices connecting to it, or 0 children.
Vertices with 0 children are called \textit{leaves}. We let $h_n(q)$ represent
the total number of $n$-ary Huffman trees with $q$ leaves. In this paper, we
use a recursive method to generate upper and lower bounds on $h_n(q)$ and get
$h_2(q) \approx (0.1418532)(1.7941471)^q+(0.0612410)(1.2795491)^q$ for $n=2$.
This matches the best results achieved by Elsholtz, Heuberger, and Prodinger in
August 2011. Our approach reveals patterns in Huffman trees that we used in our
analysis of the Binary-Ternary (BT) trees we created. Our research opens a
completely new door in data compression by extending the study of Huffman trees
to BT trees. Our study of BT trees paves the way for designing data-specific
trees, minimizing possible wasted storage space from Huffman coding. We prove a
recursive formula for the number of BT trees with $q$ leaves. Furthermore, we
provide analysis and further proofs to reach numeric bounds. Our discoveries
have broad applications in computer data compression. These results also
improve graphical representations of protein sequences that facilitate in-depth
genome analysis used in researching evolutionary patterns.
|
[
{
"version": "v1",
"created": "Thu, 21 Mar 2013 01:21:41 GMT"
}
] | 2013-03-22T00:00:00 |
[
[
"Rao",
"Angeline",
""
],
[
"Liu",
"Ying",
""
],
[
"Feng",
"Yezhou",
""
],
[
"Shen",
"Jian",
""
]
] |
new_dataset
| 0.971092 |
1301.3577
|
Rostislav Goroshin
|
Rostislav Goroshin and Yann LeCun
|
Saturating Auto-Encoders
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a simple new regularizer for auto-encoders whose hidden-unit
activation functions contain at least one zero-gradient (saturated) region.
This regularizer explicitly encourages activations in the saturated region(s)
of the corresponding activation function. We call these Saturating
Auto-Encoders (SATAE). We show that the saturation regularizer explicitly
limits the SATAE's ability to reconstruct inputs which are not near the data
manifold. Furthermore, we show that a wide variety of features can be learned
when different activation functions are used. Finally, connections are
established with the Contractive and Sparse Auto-Encoders.
|
[
{
"version": "v1",
"created": "Wed, 16 Jan 2013 04:07:46 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Feb 2013 00:28:01 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Mar 2013 15:37:33 GMT"
}
] | 2013-03-21T00:00:00 |
[
[
"Goroshin",
"Rostislav",
""
],
[
"LeCun",
"Yann",
""
]
] |
new_dataset
| 0.99756 |
1303.4788
|
Pedro Hipola
|
Antonio Munoz-Canavate, Pedro Hipola
|
Business information through Spain's Chambers of Commerce: meeting
business needs
| null |
Munoz-Canavate, Antonio; Hipola Pedro. Business information
through Spain's Chambers of Commerce: meeting business needs. Business
Information Review. vol. 25, 4, December 2008, pp. 224-229. DOI:
10.1177/0266382108098866
|
10.1177/0266382108098866
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From different public and private instances, mechanisms have been set in
action that allow for companies to obtain information in order to make
decisions with a stronger foundation. This article is focused on the
description of an entire information system for the business world, developed
in the realm of the Chambers of Commerce of Spain, which have given rise to the
creation of an authentic network of inter-chamber information.
In Spain, the obligatory membership of businesses to the Chambers of Commerce
in their geographic areas, and therefore the compulsory payment of member
quotas, has traditionally generated some polemics, above all because many firms
have not perceived a material usefulness of the services offered by these
Chambers.
Notwithstanding, the 85 Chambers currently existing in Spain, as well as the
organism that coordinates them -the Upper Council or Consejo Superior de
Camaras de Comercio- and the company created expressly to commercialize
informational services online, Camerdata, have developed genuinely informative
tools that cover a good part of the informational demands that a business might
claim, described here.
|
[
{
"version": "v1",
"created": "Tue, 19 Mar 2013 23:21:59 GMT"
}
] | 2013-03-21T00:00:00 |
[
[
"Munoz-Canavate",
"Antonio",
""
],
[
"Hipola",
"Pedro",
""
]
] |
new_dataset
| 0.999351 |
1303.4839
|
Firoj Parwej Dr.
|
Dr. Firoj Parwej
|
The State of the Art Recognize in Arabic Script through Combination of
Online and Offline
|
Pages 7, Figure 6, Table 2. arXiv admin note: text overlap with
arXiv:1110.1488 by other authors
|
International Journal of Computer Science and Telecommunications
(IJCST), UK, London (http://www.ijcst.org) , ISSN 2047-3338 , Vol. 4, Issue
3, pages 60 - 66, March 2013. Link - http://www.ijcst.org/Volume4/Issue3.html
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Handwriting recognition refers to the identification of written characters.
Handwriting recognition has become an acute research area in recent years for
the ease of access of computer science. In this paper primarily discussed
On-line and Off-line handwriting recognition methods for Arabic words which are
often used among then across the Middle East and North Africa People. Arabic
word online handwriting recognition is a very challenging task due to its
cursive nature. Because of the characteristic of the whole body of the Arabic
script, namely connectivity between the characters, thereby the segmentation of
An Arabic script is very difficult. In this paper we introduced an Arabic
script multiple classifier system for recognizing notes written on a Starboard.
This Arabic script multiple classifier system combines one off-line and on-line
handwriting recognition systems. The Arabic script recognizers are all based on
Hidden Markov Models but vary in the way of preprocessing and normalization. To
combine the Arabic script output sequences of the recognizers, we incrementally
align the word sequences using a norm string matching algorithm. The Arabic
script combination we could increase the system performance over the excellent
character recognizer by about 3%. The proposed technique is also the necessary
step towards character recognition, person identification, personality
determination where input data is processed from all perspectives.
|
[
{
"version": "v1",
"created": "Wed, 20 Mar 2013 04:54:44 GMT"
}
] | 2013-03-21T00:00:00 |
[
[
"Parwej",
"Dr. Firoj",
""
]
] |
new_dataset
| 0.994317 |
1303.4840
|
Igor Polk
|
Igor Polkovnikov
|
Asynchronous Cellular Operations on Gray Images Extracting Topographic
Shape Features and Their Relations
|
19 pages, 37 figures, 10 function classes
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A variety of operations of cellular automata on gray images is presented. All
operations are of a wave-front nature finishing in a stable state. They are
used to extract shape descripting gray objects robust to a variety of pattern
distortions. Topographic terms are used: "lakes", "dales", "dales of dales". It
is shown how mutual object relations like "above" can be presented in terms of
gray image analysis and how it can be used for character classification and for
gray pattern decomposition. Algorithms can be realized with a parallel
asynchronous architecture. Keywords: Pattern Recognition, Mathematical
Morphology, Cellular Automata, Wave-front Algorithms, Gray Image Analysis,
Topographical Shape Descriptors, Asynchronous Parallel Processors, Holes,
Cavities, Concavities, Graphs.
|
[
{
"version": "v1",
"created": "Wed, 20 Mar 2013 04:59:08 GMT"
}
] | 2013-03-21T00:00:00 |
[
[
"Polkovnikov",
"Igor",
""
]
] |
new_dataset
| 0.998242 |
1303.4949
|
Claudia Picardi
|
Fabio Varesano
|
FreeIMU: An Open Hardware Framework for Orientation and Motion Sensing
|
10 pages, 1 figure
| null | null | null |
cs.ET cs.AR cs.HC
|
http://creativecommons.org/licenses/by/3.0/
|
Orientation and Motion Sensing are widely implemented on various consumer
products, such as mobile phones, tablets and cameras as they enable immediate
interaction with virtual information. The prototyping phase of any orientation
and motion sensing capable device is however a quite difficult process as it
may involve complex hardware designing, math algorithms and programming.
In this paper, we present FreeIMU, an Open Hardware Framework for prototyping
orientation and motion sensing capable devices. The framework consists in a
small circuit board containing various sensors and a software library, built on
top of the Arduino platform. Both the hardware and library are released under
open licences and supported by an active community allowing to be implemented
into research and commercial projects.
|
[
{
"version": "v1",
"created": "Wed, 20 Mar 2013 14:25:14 GMT"
}
] | 2013-03-21T00:00:00 |
[
[
"Varesano",
"Fabio",
""
]
] |
new_dataset
| 0.99985 |
1303.4994
|
Albert Wegener
|
Albert Wegener
|
Universal Numerical Encoder and Profiler Reduces Computing's Memory Wall
with Software, FPGA, and SoC Implementations
|
10 pages, 4 figures, 3 tables, 19 references
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the multicore era, the time to computational results is increasingly
determined by how quickly operands are accessed by cores, rather than by the
speed of computation per operand. From high-performance computing (HPC) to
mobile application processors, low multicore utilization rates result from the
slowness of accessing off-chip operands, i.e. the memory wall. The APplication
AXcelerator (APAX) universal numerical encoder reduces computing's memory wall
by compressing numerical operands (integers and floats), thereby decreasing CPU
access time by 3:1 to 10:1 as operands stream between memory and cores. APAX
encodes numbers using a low-complexity algorithm designed both for time series
sensor data and for multi-dimensional data, including images. APAX encoding
parameters are determined by a profiler that quantifies the uncertainty
inherent in numerical datasets and recommends encoding parameters reflecting
this uncertainty. Compatible software, FPGA, and systemon-chip (SoC)
implementations efficiently support encoding rates between 150 MByte/sec and
1.5 GByte/sec at low power. On 25 integer and floating-point datasets, we
achieved encoding rates between 3:1 and 10:1, with average correlation of
0.999959, while accelerating computational "time to results."
|
[
{
"version": "v1",
"created": "Wed, 20 Mar 2013 17:11:12 GMT"
}
] | 2013-03-21T00:00:00 |
[
[
"Wegener",
"Albert",
""
]
] |
new_dataset
| 0.996327 |
1109.5034
|
Piotr Gawron jr.
|
Micha{\l} Romaszewski and Przemys{\l}aw G{\l}omb and Piotr Gawron
|
Natural hand gestures for human identification in a Human-Computer
Interface
|
13 pages, 3 figures, This is a major rewrite of previous version of
the paper. The same dataset as in previous version was used. The analysis is
now focused on application of the gestures classification methods to human
identification
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this work is the identification of humans based on motion data in
the form of natural hand gestures. In this paper, the identification problem is
formulated as classification with classes corresponding to persons' identities,
based on recorded signals of performed gestures. The identification performance
is examined with a database of twenty-two natural hand gestures recorded with
two types of hardware and three state-of-art classifiers: Linear Discrimination
Analysis (LDA), Support Vector machines (SVM) and k-Nearest Neighbour (k-NN).
Results show that natural hand gestures allow for an effective human
classification.
|
[
{
"version": "v1",
"created": "Fri, 23 Sep 2011 11:16:25 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Mar 2013 18:42:02 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"Romaszewski",
"Michał",
""
],
[
"Głomb",
"Przemysław",
""
],
[
"Gawron",
"Piotr",
""
]
] |
new_dataset
| 0.99723 |
1212.2054
|
Myongchol Ri
|
Dokjun An, Myongchol Ri, Changil Choe, Sunam Han, Yongmin Kim
|
SDMS-based Disk Encryption Method
| null |
Journal of Mobile,Embeded and Distributed Systems, Vol.4, No.4,
209-214, 2012
| null |
KISU-MATH-2012-E-R-010
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a disk encryption method, called secure disk mixed system (SDMS)
in this paper, for data protection of disk storages such as USB flash memory,
USB hard disk and CD/DVD. It is aimed to solve temporal and spatial limitation
problems of existing disk encryption methods and to control security
performance flexibly according to the security requirement of system. SDMS
stores data by encrypting with different encryption key per sector and updates
sector encryption keys each time data is written. Security performance of SDMS
is analyzed at the end of the paper.
|
[
{
"version": "v1",
"created": "Mon, 10 Dec 2012 13:24:08 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"An",
"Dokjun",
""
],
[
"Ri",
"Myongchol",
""
],
[
"Choe",
"Changil",
""
],
[
"Han",
"Sunam",
""
],
[
"Kim",
"Yongmin",
""
]
] |
new_dataset
| 0.960502 |
1212.2789
|
Changil Choe
|
Changil Choe, Hyejong Hong, Kukhwan Kim
|
Formal Design and Verification of N-M Switching Control System
| null |
Romanian Journal of Mathematics and Computer Science, Vol. 2, No.
2, 2012, 36-43
| null |
KISU-MATH-2012-E-R-008
|
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Production factories in which stable voltage is critical, e.g.,
electro-plating factory, require constantly stable voltage to minimize loss by
adjusting incoming voltage in real time, even if low-quality electricity is
supplied from outside. To solve such problem often being raised from the
factories located in the area with unstable electricity supply, we designed N-M
switching control system and verified its correctness using LTL model checking
technique.
|
[
{
"version": "v1",
"created": "Wed, 12 Dec 2012 12:26:25 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"Choe",
"Changil",
""
],
[
"Hong",
"Hyejong",
""
],
[
"Kim",
"Kukhwan",
""
]
] |
new_dataset
| 0.951275 |
1301.4732
|
Nicolas Kuhn M.
|
Nicolas Kuhn, Olivier Mehani, Huyen-Chi Bui, Jerome Lacan, Jose Radzik
and Emmanuel Lochin
|
Physical Channel Access (PCA): Time and Frequency Access Methods
Emulation in NS-2
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an NS-2 module, Physical Channel Access (PCA), to simulate
different access methods on a link shared with Multi-Frequency Time Division
Multiple Access (MF-TDMA). This tech- nique is widely used in various network
technologies, such as satellite communication. In this context, different
access methods at the gateway induce different queuing delays and available
capacities, which strongly impact transport layer performance. Depending on QoS
requirements, design of new congestion and flow control mechanisms and/or
access methods requires evaluation through simulations.
PCA module emulates the delays that packets will experience using the shared
link, based on descriptive parameters of lower layers characteris- tics. Though
PCA has been developed with DVB-RCS2 considerations in mind (for which we
present a use case), other MF-TDMA-based appli- cations can easily be simulated
by adapting input parameters. Moreover, the presented implementation details
highlight the main methods that might need modifications to implement more
specific functionality or emulate other similar access methods (e.g., OFDMA).
|
[
{
"version": "v1",
"created": "Mon, 21 Jan 2013 02:43:04 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Jan 2013 22:55:05 GMT"
},
{
"version": "v3",
"created": "Tue, 5 Feb 2013 23:25:25 GMT"
},
{
"version": "v4",
"created": "Tue, 19 Mar 2013 05:50:42 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"Kuhn",
"Nicolas",
""
],
[
"Mehani",
"Olivier",
""
],
[
"Bui",
"Huyen-Chi",
""
],
[
"Lacan",
"Jerome",
""
],
[
"Radzik",
"Jose",
""
],
[
"Lochin",
"Emmanuel",
""
]
] |
new_dataset
| 0.999086 |
1303.4376
|
Dominique Rossin
|
Adeline Pierrot (LIAFA), Dominique Rossin (LIX)
|
2-stack pushall sortable permutations
|
41 pages
| null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the 60's, Knuth introduced stack-sorting and serial compositions of
stacks. In particular, one significant question arise out of the work of Knuth:
how to decide efficiently if a given permutation is sortable with 2 stacks in
series? Whether this problem is polynomial or NP-complete is still unanswered
yet. In this article we introduce 2-stack pushall permutations which form a
subclass of 2-stack sortable permutations and show that these two classes are
closely related. Moreover, we give an optimal O(n^2) algorithm to decide if a
given permutation of size n is 2-stack pushall sortable and describe all its
sortings. This result is a step to the solve the general 2-stack sorting
problem in polynomial time.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 19:44:45 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"Pierrot",
"Adeline",
"",
"LIAFA"
],
[
"Rossin",
"Dominique",
"",
"LIX"
]
] |
new_dataset
| 0.970657 |
1303.4439
|
Xu Chen
|
Xu Chen, Dongning Guo and John Grosspietsch
|
The Public Safety Broadband Network: A Novel Architecture with Mobile
Base Stations
|
ICC 2013
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A nationwide interoperable public safety broadband network is being planned
by the United States government. The network will be based on long term
evolution (LTE) standards and use recently designated spectrum in the 700 MHz
band. The public safety network has different objectives and traffic patterns
than commercial wireless networks. In particular, the public safety network
puts more emphasis on coverage, reliability and latency in the worst case
scenario. Moreover, the routine public safety traffic is relatively light,
whereas when a major incident occurs, the traffic demand at the incident scene
can be significantly heavier than that in a commercial network. Hence it is
prohibitively costly to build the public safety network using conventional
cellular network architecture consisting of an infrastructure of stationary
base transceiver stations. A novel architecture is proposed in this paper for
the public safety broadband network. The architecture deploys stationary base
stations sparsely to serve light routine traffic and dispatches mobile base
stations to incident scenes along with public safety personnel to support heavy
traffic. The analysis shows that the proposed architecture can potentially
offer more than 75% reduction in terms of the total number of base stations
needed.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 21:52:45 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"Chen",
"Xu",
""
],
[
"Guo",
"Dongning",
""
],
[
"Grosspietsch",
"John",
""
]
] |
new_dataset
| 0.998475 |
1303.4451
|
Kristina Lerman
|
Kristina Lerman, Prachi Jain, Rumi Ghosh, Jeon-Hyung Kang, Ponnurangam
Kumaraguru
|
Limited Attention and Centrality in Social Networks
|
in Proceedings of International Conference on Social Intelligence and
Technology (SOCIETY2013)
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How does one find important or influential people in an online social
network? Researchers have proposed a variety of centrality measures to identify
individuals that are, for example, often visited by a random walk, infected in
an epidemic, or receive many messages from friends. Recent research suggests
that a social media users' capacity to respond to an incoming message is
constrained by their finite attention, which they divide over all incoming
information, i.e., information sent by users they follow. We propose a new
measure of centrality --- limited-attention version of Bonacich's
Alpha-centrality --- that models the effect of limited attention on epidemic
diffusion. The new measure describes a process in which nodes broadcast
messages to their out-neighbors, but the neighbors' ability to receive the
message depends on the number of in-neighbors they have. We evaluate the
proposed measure on real-world online social networks and show that it can
better reproduce an empirical influence ranking of users than other popular
centrality measures.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 22:52:09 GMT"
}
] | 2013-03-20T00:00:00 |
[
[
"Lerman",
"Kristina",
""
],
[
"Jain",
"Prachi",
""
],
[
"Ghosh",
"Rumi",
""
],
[
"Kang",
"Jeon-Hyung",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.98006 |
1104.3314
|
Zino H. Hu
|
Zino H. Hu
|
On Direct Product and Quotient of Strongly Connected Automata
|
11 pages including examples
| null | null | null |
cs.FL math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An automaton is isomorphic to the direct product of a permutation strongly
connected automaton and a synchronizing strongly connected automaton if and
only if all of the following conditions are met: (i) it is strongly connected;
(ii) the minimal ideal of its transition semigroup is a right group and (iii)
the ranges of the idempotent elements of the minimal ideal of its transition
semigroup form a partition on its set of states.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2011 13:06:30 GMT"
},
{
"version": "v10",
"created": "Sun, 17 Mar 2013 11:38:26 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Apr 2011 03:06:07 GMT"
},
{
"version": "v3",
"created": "Wed, 18 May 2011 07:09:05 GMT"
},
{
"version": "v4",
"created": "Fri, 3 Jun 2011 02:00:36 GMT"
},
{
"version": "v5",
"created": "Tue, 21 Jun 2011 12:49:16 GMT"
},
{
"version": "v6",
"created": "Tue, 25 Oct 2011 12:52:41 GMT"
},
{
"version": "v7",
"created": "Mon, 31 Oct 2011 12:43:07 GMT"
},
{
"version": "v8",
"created": "Thu, 19 Jan 2012 11:45:59 GMT"
},
{
"version": "v9",
"created": "Tue, 8 May 2012 06:51:09 GMT"
}
] | 2013-03-19T00:00:00 |
[
[
"Hu",
"Zino H.",
""
]
] |
new_dataset
| 0.998598 |
1302.6274
|
Ibrahim Al Shourbaji H
|
Ibrahim Al Shourbaji, Rafat AlAmeer
|
Wireless Intrusion Detection Systems(WIDS)
|
6 pages,2 figures,World Science Publisher,Advances in Computer
Science and its Applications (ACSA),Vol. 2, No. 3,February 2013
| null | null | null |
cs.CR cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
The rapid proliferation of wireless networks and mobile computing
applications has changed the landscape of network security,the wireless
networks have changed the way business, organizations work and offered a new
range of possibilities and flexibilities; It is clear that wireless solutions
are transforming the way we work and live. Employees are able to keep in touch
with their e-mail, calendar and employer from mobile devices, but on the other
hands they introduced a new security threats appeared. While an attacker needs
physical access to a wired network in order to gain access to the network and
to accomplish his goals, a wireless network allows anyone within its range to
passively monitor the traffic or even start an attack,one of the
countermeasures that can be used is the intrusion detection systems in order to
allow us to know both the threats affecting our wireless network and our system
vulnerabilities in order to prevent those attackers, the IDS its main purpose
is to manage the system and its operations and Its duty depends on .
|
[
{
"version": "v1",
"created": "Mon, 25 Feb 2013 23:07:24 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Feb 2013 20:09:56 GMT"
}
] | 2013-03-19T00:00:00 |
[
[
"Shourbaji",
"Ibrahim Al",
""
],
[
"AlAmeer",
"Rafat",
""
]
] |
new_dataset
| 0.999618 |
1303.3921
|
Sergey Yekhanin
|
Michael Forbes and Sergey Yekhanin
|
On the Locality of Codeword Symbols in Non-Linear Codes
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider a possibly non-linear (n,K,d)_q code. Coordinate i has locality r if
its value is determined by some r other coordinates. A recent line of work
obtained an optimal trade-off between information locality of codes and their
redundancy. Further, for linear codes meeting this trade-off, structure
theorems were derived. In this work we give a new proof of the locality /
redundancy trade-off and generalize structure theorems to non-linear codes.
|
[
{
"version": "v1",
"created": "Fri, 15 Mar 2013 22:46:46 GMT"
}
] | 2013-03-19T00:00:00 |
[
[
"Forbes",
"Michael",
""
],
[
"Yekhanin",
"Sergey",
""
]
] |
new_dataset
| 0.994278 |
1303.4224
|
Nouh Sa\"id Mr
|
Abderrazzak Farchane, Mostafa Belkasmi and Said Nouh
|
Generalized parallel concatenated block codes based on BCH and RS codes,
construction and Iterative decoding
| null |
Journal Of Telecommunications, Volume 12, Issue 1, January 2012
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a generalization of parallel concatenated block GPCB codes
based on BCH and RS codes is presented.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 12:14:44 GMT"
}
] | 2013-03-19T00:00:00 |
[
[
"Farchane",
"Abderrazzak",
""
],
[
"Belkasmi",
"Mostafa",
""
],
[
"Nouh",
"Said",
""
]
] |
new_dataset
| 0.997026 |
1303.4262
|
James Alderman
|
James Alderman and Jason Crampton
|
On the Use of Key Assignment Schemes in Authentication Protocols
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Key Assignment Schemes (KASs) have been extensively studied in the context of
cryptographically-enforced access control, where derived keys are used to
decrypt protected resources. In this paper, we explore the use of KASs in
entity authentication protocols, where we use derived keys to encrypt
challenges. This novel use of KASs permits the efficient authentication of an
entity in accordance with an authentication policy by associating entities with
security labels representing specific services. Cryptographic keys are
associated with each security label and demonstrating knowledge of an
appropriate key is used as the basis for authentication. Thus, by controlling
the distribution of such keys, restrictions may be efficiently placed upon the
circumstances under which an entity may be authenticated and the services to
which they may gain access.
In this work, we explore how both standardized protocols and novel
constructions may be developed to authenticate entities as members of a group
associated to a particular security label, whilst protecting the long-term
secrets in the system. We also see that such constructions may allow for
authentication whilst preserving anonymity, and that by including a trusted
third party we can achieve the authentication of individual identities and
authentication based on timestamps without the need for synchronized clocks.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 14:32:26 GMT"
}
] | 2013-03-19T00:00:00 |
[
[
"Alderman",
"James",
""
],
[
"Crampton",
"Jason",
""
]
] |
new_dataset
| 0.990511 |
1303.4264
|
Wojciech Mazurczyk
|
Pawel Kopiczko, Wojciech Mazurczyk, Krzysztof Szczypiorski
|
StegTorrent: a Steganographic Method for the P2P File Sharing Service
|
7 pages, 7 figures, 1 table
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper proposes StegTorrent a new network steganographic method for the
popular P2P file transfer service-BitTorrent. It is based on modifying the
order of data packets in the peer-peer data exchange protocol. Unlike other
existing steganographic methods that modify the packets' order it does not
require any synchronization. Experimental results acquired from prototype
implementation proved that it provides high steganographic bandwidth of up to
270 b/s while introducing little transmission distortion and providing
difficult detectability.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 14:36:53 GMT"
}
] | 2013-03-19T00:00:00 |
[
[
"Kopiczko",
"Pawel",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.992269 |
1104.3353
|
Anthony Labarre
|
Simona Grusea and Anthony Labarre
|
The distribution of cycles in breakpoint graphs of signed permutations
| null | null |
10.1016/j.dam.2013.02.002
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Breakpoint graphs are ubiquitous structures in the field of genome
rearrangements. Their cycle decomposition has proved useful in computing and
bounding many measures of (dis)similarity between genomes, and studying the
distribution of those cycles is therefore critical to gaining insight on the
distributions of the genomic distances that rely on it. We extend here the work
initiated by Doignon and Labarre, who enumerated unsigned permutations whose
breakpoint graph contains $k$ cycles, to signed permutations, and prove
explicit formulas for computing the expected value and the variance of the
corresponding distributions, both in the unsigned case and in the signed case.
We also compare these distributions to those of several well-studied distances,
emphasising the cases where approximations obtained in this way stand out.
Finally, we show how our results can be used to derive simpler proofs of other
previously known results.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2011 21:41:45 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Aug 2012 14:32:39 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Grusea",
"Simona",
""
],
[
"Labarre",
"Anthony",
""
]
] |
new_dataset
| 0.977824 |
1209.6152
|
Son Hoang Dau
|
Son Hoang Dau, Yan Jia, Chao Jin, Weiya Xi, Kheong Sann Chan
|
Parity Declustering for Fault-Tolerant Storage Systems via $t$-designs
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parity declustering allows faster reconstruction of a disk array when some
disk fails. Moreover, it guarantees uniform reconstruction workload on all
surviving disks. It has been shown that parity declustering for one-failure
tolerant array codes can be obtained via Balanced Incomplete Block Designs. We
extend this technique for array codes that can tolerate an arbitrary number of
disk failures via $t$-designs.
|
[
{
"version": "v1",
"created": "Thu, 27 Sep 2012 07:59:15 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Mar 2013 09:04:40 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Dau",
"Son Hoang",
""
],
[
"Jia",
"Yan",
""
],
[
"Jin",
"Chao",
""
],
[
"Xi",
"Weiya",
""
],
[
"Chan",
"Kheong Sann",
""
]
] |
new_dataset
| 0.997448 |
1303.3427
|
Antonios Argyriou
|
Antonios Argyriou
|
Distributed Space-Time Coding of Over-the-Air Superimposed Packets in
Wireless Networks
|
ICC 2013
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a new cooperative packet transmission scheme that
allows independent sources to superimpose over-the-air their packet
transmissions. Relay nodes are used and cooperative diversity is combined with
distributed space-time block coding (STBC). With the proposed scheme the
participating relays create a ST code for the over-the-air superimposed symbols
that are received locally and without proceeding to any decoding step
beforehand. The advantage of the proposed scheme is that communication is
completed in fewer transmission slots because of the concurrent packet
transmissions, while the diversity benefit from the use of the STBC results in
higher decoding performance. The proposed scheme does not depend on the STBC
that is applied at the relays. Simulation results reveal significant throughput
benefits even in the low SNR regime.
|
[
{
"version": "v1",
"created": "Thu, 14 Mar 2013 12:38:28 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Argyriou",
"Antonios",
""
]
] |
new_dataset
| 0.994799 |
1303.3624
|
Weiqiang Xu
|
Weiqiang Xu, Qingjiang Shi, Xiaoyun Wei, Yaming Wang
|
Distributed Optimal Rate-Reliability-Lifetime Tradeoff in Wireless
Sensor Networks
|
27 pages, 10 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The transmission rate, delivery reliability and network lifetime are three
fundamental but conflicting design objectives in energy-constrained wireless
sensor networks. In this paper, we address the optimal
rate-reliability-lifetime tradeoff with link capacity constraint, reliability
constraint and energy constraint. By introducing the weight parameters, we
combine the objectives at rate, reliability, and lifetime into a single
objective to characterize the tradeoff among them. However, the optimization
formulation of the rate-reliability-reliability tradeoff is neither separable
nor convex. Through a series of transformations, a separable and convex problem
is derived, and an efficient distributed Subgradient Dual Decomposition
algorithm (SDD) is proposed. Numerical examples confirm its convergence. Also,
numerical examples investigate the impact of weight parameters on the rate
utility, reliability utility and network lifetime, which provide a guidance to
properly set the value of weight parameters for a desired performance of WSNs
according to the realistic application's requirements.
|
[
{
"version": "v1",
"created": "Thu, 14 Mar 2013 22:09:41 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Xu",
"Weiqiang",
""
],
[
"Shi",
"Qingjiang",
""
],
[
"Wei",
"Xiaoyun",
""
],
[
"Wang",
"Yaming",
""
]
] |
new_dataset
| 0.960642 |
1303.3665
|
Harshan Jagadeesh
|
J. Harshan, Emanuele Viterbo
|
Integer Space-Time Block Codes for Practical MIMO Systems
|
10 pages and 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by
transmitting linear combinations of information symbols through every transmit
antenna. However, the coefficients used for the linear combinations, if not
chosen carefully, results in ({\em i}) large number of processor bits for the
encoder and ({\em ii}) high peak-to-average power ratio (PAPR) values. In this
work, we propose a new class of full-rate STBCs called Integer STBCs (ICs) for
multiple-input multiple-output (MIMO) fading channels. A unique property of ICs
is the presence of integer coefficients in the code structure which enables
reduced numbers of processor bits for the encoder and lower PAPR values. We
show that the reduction in the number of processor bits is significant for
small MIMO channels, while the reduction in the PAPR is significant for large
MIMO channels. We also highlight the advantages of the proposed codes in
comparison with the well known full-rate algebraic STBCs.
|
[
{
"version": "v1",
"created": "Fri, 15 Mar 2013 03:07:48 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Harshan",
"J.",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.99769 |
1303.3737
|
Joaquim Borges
|
Jos\'e Joaqu\'in Bernal, Joaquim Borges, Cristina
Fern\'andez-C\'ordoba, Merc\`e Villanueva
|
Permutation decoding of Z2Z4-linear codes
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An alternative permutation decoding method is described which can be used for
any binary systematic encoding scheme, regardless whether the code is linear or
not. Thus, the method can be applied to some important codes such as
Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the
usual sense. For this, it is proved that these codes allow a systematic
encoding scheme. As a particular example, this permutation decoding method is
applied to some Hadamard Z2Z4-linear codes.
|
[
{
"version": "v1",
"created": "Fri, 15 Mar 2013 11:23:26 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Bernal",
"José Joaquín",
""
],
[
"Borges",
"Joaquim",
""
],
[
"Fernández-Córdoba",
"Cristina",
""
],
[
"Villanueva",
"Mercè",
""
]
] |
new_dataset
| 0.998322 |
1303.3828
|
Jo\~ao Em\'ilio Almeida
|
Jo\~ao Ribeiro, Jo\~ao Em\'ilio Almeida, Rosaldo J. F. Rossetti,
Ant\'onio Coelho, Ant\'onio Le\c{c}a Coelho
|
Using Serious Games to Train Evacuation Behaviour
|
CISTI 2012 - 7 Conferencia Ib\'erica de Sistemas y Tecnolog\'ias de
Informaci\'on, pp 771-776, Madrid, Spain. ISBN: 978-989-96247-6-4
| null | null | null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emergency evacuation plans and evacuation drills are mandatory in public
buildings in many countries. Their importance is considerable when it comes to
guarantee safety and protection during a crisis. However, sometimes
discrepancies arise between the goals of the plan and its outcomes, because
people find it hard to take them very seriously, or due to the financial and
time resources required. Serious games are a possible solution to tackle this
problem. They have been successfully applied in different areas such as health
care and education, since they can simulate an environment/task quite
accurately, making them a practical alternative to real-life simulations. This
paper presents a serious game developed using Unity3D to recreate a virtual
fire evacuation training tool. The prototype application was deployed which
allowed the validation by user testing. A sample of 30 individuals tested the
evacuating scenario, having to leave the building during a fire in the shortest
time possible. Results have shown that users effectively end up learning some
evacuation procedures from the activity, even if only to look for emergency
signs indicating the best evacuation paths. It was also evidenced that users
with higher video game experience had a significantly better performance.
|
[
{
"version": "v1",
"created": "Fri, 15 Mar 2013 16:58:00 GMT"
}
] | 2013-03-18T00:00:00 |
[
[
"Ribeiro",
"João",
""
],
[
"Almeida",
"João Emílio",
""
],
[
"Rossetti",
"Rosaldo J. F.",
""
],
[
"Coelho",
"António",
""
],
[
"Coelho",
"António Leça",
""
]
] |
new_dataset
| 0.998383 |
1005.4973
|
Mutsuo Saito
|
Mutsuo Saito and Makoto Matsumoto
|
Variants of Mersenne Twister Suitable for Graphic Processors
|
23 pages, 6 figures
|
Transactions on Mathematical Software, 39 (2013), 12:1--12:20
| null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a type of pseudorandom number generator, Mersenne Twister
for Graphic Processor (MTGP), for efficient generation on graphic processessing
units (GPUs). MTGP supports large state sizes such as 11213 bits, and uses the
high parallelism of GPUs in computing many steps of the recursion in parallel.
The second proposal is a parameter-set generator for MTGP, named MTGP Dynamic
Creator (MTGPDC). MT- GPDC creates up to 2^32 distinct parameter sets which
generate sequences with high-dimensional uniformity. This facility is suitable
for a large grid of GPUs where each GPU requires separate random number
streams. MTGP is based on linear recursion over the two-element field, and has
better high-dimensional equidistribution than the Mersenne Twister pseudorandom
number generator.
|
[
{
"version": "v1",
"created": "Thu, 27 May 2010 01:06:54 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Jun 2010 06:17:48 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Mar 2012 08:12:08 GMT"
}
] | 2013-03-14T00:00:00 |
[
[
"Saito",
"Mutsuo",
""
],
[
"Matsumoto",
"Makoto",
""
]
] |
new_dataset
| 0.980287 |
1205.6595
|
Mouradian Alexandre
|
Alexandre Mouradian (CITI, CITI Insa Lyon / Inria Grenoble
Rh\^one-Alpes), Isabelle Aug\'e-Blum (CITI Insa Lyon / Inria Grenoble
Rh\^one-Alpes), Fabrice Valois (CITI, CITI Insa Lyon / Inria Grenoble
Rh\^one-Alpes)
|
RTXP : A Localized Real-Time Mac-Routing Protocol for Wireless Sensor
Networks
| null |
N° RR-7978 (2012)
| null |
RR-7978
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Protocols developed during the last years for Wireless Sensor Networks (WSNs)
are mainly focused on energy efficiency and autonomous mechanisms (e.g.
self-organization, self-configuration, etc). Nevertheless, with new WSN
applications, appear new QoS requirements such as time constraints. Real-time
applications require the packets to be delivered before a known time bound
which depends on the application requirements. We particularly focus on
applications which consist in alarms sent to the sink node. We propose
Real-Time X-layer Protocol (RTXP), a real-time communication protocol. To the
best of our knowledge, RTXP is the first MAC and routing real-time
communication protocol that is not centralized, but instead relies only on
local information. The solution is cross-layer (X-layer) because it allows to
control the delays due to MAC and Routing layers interactions. RTXP uses a
suited hop-count-based Virtual Coordinate System which allows deterministic
medium access and forwarder selection. In this paper we describe the protocol
mechanisms. We give theoretical bound on the end-to-end delay and the capacity
of the protocol. Intensive simulation results confirm the theoretical
predictions and allow to compare with a real-time centralized solution. RTXP is
also simulated under harsh radio channel, in this case the radio link
introduces probabilistic behavior. Nevertheless, we show that RTXP it performs
better than a non-deterministic solution. It thus advocates for the usefulness
of designing real-time (deterministic) protocols even for highly unreliable
networks such as WSNs.
|
[
{
"version": "v1",
"created": "Wed, 30 May 2012 09:11:50 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Mar 2013 07:43:42 GMT"
}
] | 2013-03-14T00:00:00 |
[
[
"Mouradian",
"Alexandre",
"",
"CITI, CITI Insa Lyon / Inria Grenoble\n Rhône-Alpes"
],
[
"Augé-Blum",
"Isabelle",
"",
"CITI Insa Lyon / Inria Grenoble\n Rhône-Alpes"
],
[
"Valois",
"Fabrice",
"",
"CITI, CITI Insa Lyon / Inria Grenoble\n Rhône-Alpes"
]
] |
new_dataset
| 0.998687 |
1303.3026
|
Yuming Jiang
|
Yuming Jiang
|
Stochastic Service Curve and Delay Bound Analysis: A Single Node Case
| null | null | null | null |
cs.PF cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A packet-switched network node with constant capacity (in bps) is considered,
where packets within each flow are served in the first in first out (FIFO)
manner. While this single node system is perhaps the simplest computer
communication system, its stochastic service curve characterization and
independent case analysis in the context of stochastic network calculus
(snetcal) are still basic and many crucial questions surprisingly remain open.
Specifically, when the input is a single flow, what stochastic service curve
and delay bound does the node provide? When the considered flow shares the node
with another flow, what stochastic service curve and delay bound does the node
provide to the considered flow, and if the two flows are independent, can this
independence be made use of and how? The aim of this paper is to provide
answers to these fundamental questions.
|
[
{
"version": "v1",
"created": "Tue, 12 Mar 2013 20:59:46 GMT"
}
] | 2013-03-14T00:00:00 |
[
[
"Jiang",
"Yuming",
""
]
] |
new_dataset
| 0.990635 |
1303.3071
|
Ankit Chaudhary
|
S. Kumar, R. Sehgal, P. Singh, Ankit Chaudhary
|
Nepenthes Honeypots based Botnet Detection
|
http://ojs.academypublisher.com/index.php/jait/article/view/jait0304215221
|
JAIT 3(4), 2012
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The numbers of the botnet attacks are increasing day by day and the detection
of botnet spreading in the network has become very challenging. Bots are having
specific characteristics in comparison of normal malware as they are controlled
by the remote master server and usually dont show their behavior like normal
malware until they dont receive any command from their master server. Most of
time bot malware are inactive, hence it is very difficult to detect. Further
the detection or tracking of the network of theses bots requires an
infrastructure that should be able to collect the data from a diverse range of
data sources and correlate the data to bring the bigger picture in view. In
this paper, we are sharing our experience of botnet detection in the private
network as well as in public zone by deploying the nepenthes honeypots. The
automated framework for malware collection using nepenthes and analysis using
anti-virus scan are discussed. The experimental results of botnet detection by
enabling nepenthes honeypots in network are shown. Also we saw that existing
known bots in our network can be detected.
|
[
{
"version": "v1",
"created": "Wed, 13 Mar 2013 00:55:21 GMT"
}
] | 2013-03-14T00:00:00 |
[
[
"Kumar",
"S.",
""
],
[
"Sehgal",
"R.",
""
],
[
"Singh",
"P.",
""
],
[
"Chaudhary",
"Ankit",
""
]
] |
new_dataset
| 0.996958 |
1303.3072
|
John Baillieul
|
Zhaodan Kong, Kayhan \"Ozcimder, Nathan Fuller, Alison Greco, Diane
Theriault, Zheng Wu, Thomas Kunz, Margrit Betke, John Baillieul
|
Optical Flow Sensing and the Inverse Perception Problem for Flying Bats
|
20 Pages, 7 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The movements of birds, bats, and other flying species are governed by
complex sensorimotor systems that allow the animals to react to stationary
environmental features as well as to wind disturbances, other animals in nearby
airspace, and a wide variety of unexpected challenges. The paper and talk will
describe research that analyzes the three-dimensional trajectories of bats
flying in a habitat in Texas. The trajectories are computed with stereoscopic
methods using data from synchronous thermal videos that were recorded with high
temporal and spatial resolution from three viewpoints. Following our previously
reported work, we examine the possibility that bat trajectories in this habitat
are governed by optical flow sensing that interpolates periodic distance
measurements from echolocation. Using an idealized geometry of bat eyes, we
introduce the concept of time-to-transit, and recall some research that
suggests that this quantity is computed by the animals' visual cortex. Several
steering control laws based on time-to-transit are proposed for an idealized
flight model, and it is shown that these can be used to replicate the observed
flight of what we identify as typical bats. Although the vision-based motion
control laws we propose and the protocols for switching between them are quite
simple, some of the trajectories that have been synthesized are qualitatively
bat-like. Examination of the control protocols that generate these trajectories
suggests that bat motions are governed both by their reactions to a subset of
key feature points as well by their memories of where these feature points are
located.
|
[
{
"version": "v1",
"created": "Wed, 13 Mar 2013 00:59:05 GMT"
}
] | 2013-03-14T00:00:00 |
[
[
"Kong",
"Zhaodan",
""
],
[
"Özcimder",
"Kayhan",
""
],
[
"Fuller",
"Nathan",
""
],
[
"Greco",
"Alison",
""
],
[
"Theriault",
"Diane",
""
],
[
"Wu",
"Zheng",
""
],
[
"Kunz",
"Thomas",
""
],
[
"Betke",
"Margrit",
""
],
[
"Baillieul",
"John",
""
]
] |
new_dataset
| 0.964069 |
1303.3229
|
Radu Dragusin
|
Radu Dragusin (1 and 2), Paula Petcu (1 and 3), Christina Lioma (1 and
2), Birger Larsen (4), Henrik L. J{\o}rgensen (5), Ingemar J. Cox (1 and 6),
Lars Kai Hansen (1), Peter Ingwersen (4), Ole Winther (1) ((1) DTU Compute,
Technical University of Denmark, Denmark, (2) Department of Computer Science,
University of Copenhagen, Denmark, (3) Findwise, Copenhagen, Denmark, (4)
Information Systems and Interaction Design, Royal School of Library and
Information Science, Copenhagen, Denmark, (5) Department of Clinical
Biochemistry, Bispebjerg Hospital, Copenhagen, Denmark, (6) Department of
Computer Science, University College London, London, United Kingdom)
|
FindZebra: A search engine for rare diseases
| null |
International Journal of Medical Informatics, Available online 23
February 2013, ISSN 1386-5056
|
10.1016/j.ijmedinf.2013.01.005
| null |
cs.IR cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Background: The web has become a primary information resource about illnesses
and treatments for both medical and non-medical users. Standard web search is
by far the most common interface for such information. It is therefore of
interest to find out how well web search engines work for diagnostic queries
and what factors contribute to successes and failures. Among diseases, rare (or
orphan) diseases represent an especially challenging and thus interesting class
to diagnose as each is rare, diverse in symptoms and usually has scattered
resources associated with it. Methods: We use an evaluation approach for web
search engines for rare disease diagnosis which includes 56 real life
diagnostic cases, state-of-the-art evaluation measures, and curated information
resources. In addition, we introduce FindZebra, a specialized (vertical) rare
disease search engine. FindZebra is powered by open source search technology
and uses curated freely available online medical information. Results:
FindZebra outperforms Google Search in both default setup and customised to the
resources used by FindZebra. We extend FindZebra with specialized
functionalities exploiting medical ontological information and UMLS medical
concepts to demonstrate different ways of displaying the retrieved results to
medical experts. Conclusions: Our results indicate that a specialized search
engine can improve the diagnostic quality without compromising the ease of use
of the currently widely popular web search engines. The proposed evaluation
approach can be valuable for future development and benchmarking. The FindZebra
search engine is available at http://www.findzebra.com/.
|
[
{
"version": "v1",
"created": "Wed, 13 Mar 2013 17:47:57 GMT"
}
] | 2013-03-14T00:00:00 |
[
[
"Dragusin",
"Radu",
"",
"1 and 2"
],
[
"Petcu",
"Paula",
"",
"1 and 3"
],
[
"Lioma",
"Christina",
"",
"1 and\n 2"
],
[
"Larsen",
"Birger",
"",
"1 and 6"
],
[
"Jørgensen",
"Henrik L.",
"",
"1 and 6"
],
[
"Cox",
"Ingemar J.",
"",
"1 and 6"
],
[
"Hansen",
"Lars Kai",
""
],
[
"Ingwersen",
"Peter",
""
],
[
"Winther",
"Ole",
""
]
] |
new_dataset
| 0.988671 |
1303.2967
|
Flavio D'Alessandro
|
A. Bertoni. Ch. Choffrut, F. D'Alessandro
|
Quantum finite automata and linear context-free languages: a decidable
problem
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the so-called measure once finite quantum automata model
introduced by Moore and Crutchfield in 2000. We show that given a language
recognized by such a device and a linear context-free language, it is
recursively decidable whether or not they have a nonempty intersection. This
extends a result of Blondel et al. which can be interpreted as solving the
problem with the free monoid in place of the family of linear context-free
languages.
|
[
{
"version": "v1",
"created": "Tue, 12 Mar 2013 17:51:57 GMT"
}
] | 2013-03-13T00:00:00 |
[
[
"Choffrut",
"A. Bertoni. Ch.",
""
],
[
"D'Alessandro",
"F.",
""
]
] |
new_dataset
| 0.999135 |
0908.3545
|
Pat Morin
|
Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle
|
Notes on large angle crossing graphs
| null |
Chicago Journal of Theoretical Computer Science, Article 2011-4
|
10.4086/cjtcs.2011.004
| null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges
in G intersect at an angle of at least a. The concept of right angle crossing
(RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown
that any RAC graph with n vertices has at most 4n-10 edges and that there are
infinitely many values of n for which there exists a RAC graph with n vertices
and 4n-10 edges. In this paper, we give upper and lower bounds for the number
of edges in aAC graphs for all 0 < a < Pi/2.
|
[
{
"version": "v1",
"created": "Tue, 25 Aug 2009 06:21:41 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Nov 2010 15:05:40 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Dujmovic",
"Vida",
""
],
[
"Gudmundsson",
"Joachim",
""
],
[
"Morin",
"Pat",
""
],
[
"Wolle",
"Thomas",
""
]
] |
new_dataset
| 0.998956 |
0911.2484
|
Pat Morin
|
Dan Chen, Luc Devroye, Vida Dujmovic, and Pat Morin
|
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
|
11 pages, 6 figures
|
Computational Geometry: Theory and Applications, Volume 45, Issue
4, May 2012, Pages 178-185
|
10.1016/j.comgeo.2011.12.005
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A memoryless routing algorithm is one in which the decision about the next
edge on the route to a vertex t for a packet currently located at vertex v is
made based only on the coordinates of v, t, and the neighbourhood, N(v), of v.
The current paper explores the limitations of such algorithms by showing that,
for any (randomized) memoryless routing algorithm A, there exists a convex
subdivision on which A takes Omega(n^2) expected time to route a message
between some pair of vertices. Since this lower bound is matched by a random
walk, this result implies that the geometric information available in convex
subdivisions is not helpful for this class of routing algorithms. The current
paper also shows the existence of triangulations for which the Random-Compass
algorithm proposed by Bose etal (2002,2004) requires 2^{\Omega(n)} time to
route between some pair of vertices.
|
[
{
"version": "v1",
"created": "Thu, 12 Nov 2009 21:53:08 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Chen",
"Dan",
""
],
[
"Devroye",
"Luc",
""
],
[
"Dujmovic",
"Vida",
""
],
[
"Morin",
"Pat",
""
]
] |
new_dataset
| 0.99782 |
1209.0236
|
Han Mao Kiah
|
Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Chengmin Wang
|
Cross-Bifix-Free Codes Within a Constant Factor of Optimality
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cross-bifix-free code is a set of words in which no prefix of any length of
any word is the suffix of any word in the set. Cross-bifix-free codes arise in
the study of distributed sequences for frame synchronization. We provide a new
construction of cross-bifix-free codes which generalizes the construction in
Bajic (2007) to longer code lengths and to any alphabet size. The codes are
shown to be nearly optimal in size. We also establish new results on Fibonacci
sequences, that are used in estimating the size of the cross-bifix-free codes.
|
[
{
"version": "v1",
"created": "Mon, 3 Sep 2012 03:29:10 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Mar 2013 09:20:08 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Purkayastha",
"Punarbasu",
""
],
[
"Wang",
"Chengmin",
""
]
] |
new_dataset
| 0.998971 |
1303.0045
|
Bogdan State
|
Bogdan State, Patrick Park, Ingmar Weber, Yelena Mejova, Michael Macy
|
The Mesh of Civilizations and International Email Flows
|
10 pages, 3 figures
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In The Clash of Civilizations, Samuel Huntington argued that the primary axis
of global conflict was no longer ideological or economic but cultural and
religious, and that this division would characterize the "battle lines of the
future." In contrast to the "top down" approach in previous research focused on
the relations among nation states, we focused on the flows of interpersonal
communication as a bottom-up view of international alignments. To that end, we
mapped the locations of the world's countries in global email networks to see
if we could detect cultural fault lines. Using IP-geolocation on a worldwide
anonymized dataset obtained from a large Internet company, we constructed a
global email network. In computing email flows we employ a novel rescaling
procedure to account for differences due to uneven adoption of a particular
Internet service across the world. Our analysis shows that email flows are
consistent with Huntington's thesis. In addition to location in Huntington's
"civilizations," our results also attest to the importance of both cultural and
economic factors in the patterning of inter-country communication ties.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2013 23:29:11 GMT"
},
{
"version": "v2",
"created": "Sun, 10 Mar 2013 19:15:12 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"State",
"Bogdan",
""
],
[
"Park",
"Patrick",
""
],
[
"Weber",
"Ingmar",
""
],
[
"Mejova",
"Yelena",
""
],
[
"Macy",
"Michael",
""
]
] |
new_dataset
| 0.986466 |
1303.2219
|
Boris Ryabko
|
Boris Ryabko
|
The Vernam cipher is robust to small deviations from randomness
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Vernam cipher (or one-time pad) has played an important rule in
cryptography because it is a perfect secrecy system. For example, if an English
text (presented in binary system) $X_1 X_2 ... $ is enciphered according to the
formula $Z_i = (X_i + Y_i) \mod 2 $, where $Y_1 Y_2 ...$ is a key sequence
generated by the Bernoulli source with equal probabilities of 0 and 1, anyone
who knows $Z_1 Z_2 ... $ has no information about $X_1 X_2 ... $ without the
knowledge of the key $Y_1 Y_2 ...$. (The best strategy is to guess $X_1 X_2 ...
$ not paying attention to $Z_1 Z_2 ... $.)
But what should one say about secrecy of an analogous method where the key
sequence $Y_1 Y_2 ...$ is generated by the Bernoulli source with a small bias,
say, $P(0) = 0.49, $ $ P(1) = 0.51$? To the best of our knowledge, there are no
theoretical estimates for the secrecy of such a system, as well as for the
general case where $X_1 X_2 ... $ (the plaintext) and key sequence are
described by stationary ergodic processes. We consider the running-key ciphers
where the plaintext and the key are generated by stationary ergodic sources and
show how to estimate the secrecy of such systems. In particular, it is shown
that, in a certain sense, the Vernam cipher is robust to small deviations from
randomness.
|
[
{
"version": "v1",
"created": "Sat, 9 Mar 2013 15:12:46 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Ryabko",
"Boris",
""
]
] |
new_dataset
| 0.989251 |
1303.2282
|
Xiyong Zhang
|
Xiyong Zhang and Guangpu Gao
|
On the conjecture about the nonexistence of rotation symmetric bent
functions
| null | null | null | null |
cs.CR math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe a different approach to the proof of the
nonexistence of homogeneous rotation symmetric bent functions. As a result, we
obtain some new results which support the conjecture made in this journal,
i.e., there are no homogeneous rotation symmetric bent functions of degree >2.
Also we characterize homogeneous degree 2 rotation symmetric bent functions by
using GCD of polynomials.
|
[
{
"version": "v1",
"created": "Sun, 10 Mar 2013 02:10:54 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Zhang",
"Xiyong",
""
],
[
"Gao",
"Guangpu",
""
]
] |
new_dataset
| 0.996923 |
1303.2547
|
Josep Rif\`a
|
J. Rifa, V. Zinoviev
|
On a family of binary completely transitive codes with growing covering
radius
|
Submitted to Discrete mathematics. March 10, 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new family of binary linear completely transitive (and, therefore,
completely regular) codes is constructed. The covering radius of these codes is
growing with the length of the code. In particular, for any integer r > 1,
there exist two codes with d=3, covering radius r and length 2r(4r-1) and
(2r+1)(4r+1), respectively. These new completely transitive codes induce, as
coset graphs, a family of distance-transitive graphs of growing diameter.
|
[
{
"version": "v1",
"created": "Mon, 11 Mar 2013 15:19:46 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Rifa",
"J.",
""
],
[
"Zinoviev",
"V.",
""
]
] |
new_dataset
| 0.999893 |
1303.2553
|
Yi-ying Tseng
|
Jen-Yeu Chen, Yi-ying Tseng
|
Distributed Intrusion Detection of Byzantine Attacks in Wireless
Networks with Random Linear Network Coding
| null |
International Journal of Distributed Sensor Networks, Volume 2012
(2012), Article ID 758340, 10 pages
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network coding is an elegant technique where, instead of simply relaying the
packets of information they receive, the nodes of a network are allowed to
combine \emph{several} packets together for transmission and this technique can
be used to achieve the maximum possible information flow in a network and save
the needed number of packet transmissions. Moreover, in an energy-constraint
wireless network such as Wireless Sensor Network (a typical type of wireless ad
hoc network), applying network coding to reduce the number of wireless
transmissions can also prolong the life time of sensor nodes. Although applying
network coding in a wireless sensor network is obviously beneficial, due to the
operation that one transmitting information is actually combination of multiple
other information, it is possible that an error propagation may occur in the
network. This special characteristic also exposes network coding system to a
wide range of error attacks, especially Byzantine attacks. When some adversary
nodes generate error data in the network with network coding, those erroneous
information will be mixed at intermeidate nodes and thus corrupt all the
information reaching a destination. Recent research efforts have shown that
network coding can be combined with classical error control codes and
cryptography for secure communication or misbehavior detection. Nevertheless,
when it comes to Byzantine attacks, these results have limited effect. In fact,
unless we find out those adversary nodes and isolate them, network coding may
perform much worse than pure routing in the presence of malicious nodes. In
this paper, a distributed hierarchical algorithm based on random linear network
coding is developed to detect, locate and isolate malicious nodes.
|
[
{
"version": "v1",
"created": "Mon, 11 Mar 2013 15:50:51 GMT"
}
] | 2013-03-12T00:00:00 |
[
[
"Chen",
"Jen-Yeu",
""
],
[
"Tseng",
"Yi-ying",
""
]
] |
new_dataset
| 0.996908 |
1303.1461
|
Paul Dagum
|
Paul Dagum, Adam Galper
|
Forecasting Sleep Apnea with Dynamic Network Models
|
Appears in Proceedings of the Ninth Conference on Uncertainty in
Artificial Intelligence (UAI1993)
| null | null |
UAI-P-1993-PG-64-71
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic network models (DNMs) are belief networks for temporal reasoning. The
DNM methodology combines techniques from time series analysis and probabilistic
reasoning to provide (1) a knowledge representation that integrates
noncontemporaneous and contemporaneous dependencies and (2) methods for
iteratively refining these dependencies in response to the effects of exogenous
influences. We use belief-network inference algorithms to perform forecasting,
control, and discrete event simulation on DNMs. The belief network formulation
allows us to move beyond the traditional assumptions of linearity in the
relationships among time-dependent variables and of normality in their
probability distributions. We demonstrate the DNM methodology on an important
forecasting problem in medicine. We conclude with a discussion of how the
methodology addresses several limitations found in traditional time series
analyses.
|
[
{
"version": "v1",
"created": "Wed, 6 Mar 2013 14:19:03 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Dagum",
"Paul",
""
],
[
"Galper",
"Adam",
""
]
] |
new_dataset
| 0.972278 |
1303.1492
|
Marek J. Druzdzel
|
Marek J. Druzdzel, Max Henrion
|
Intercausal Reasoning with Uninstantiated Ancestor Nodes
|
Appears in Proceedings of the Ninth Conference on Uncertainty in
Artificial Intelligence (UAI1993)
| null | null |
UAI-P-1993-PG-317-325
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intercausal reasoning is a common inference pattern involving probabilistic
dependence of causes of an observed common effect. The sign of this dependence
is captured by a qualitative property called product synergy. The current
definition of product synergy is insufficient for intercausal reasoning where
there are additional uninstantiated causes of the common effect. We propose a
new definition of product synergy and prove its adequacy for intercausal
reasoning with direct and indirect evidence for the common effect. The new
definition is based on a new property matrix half positive semi-definiteness, a
weakened form of matrix positive semi-definiteness.
|
[
{
"version": "v1",
"created": "Wed, 6 Mar 2013 14:22:00 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Druzdzel",
"Marek J.",
""
],
[
"Henrion",
"Max",
""
]
] |
new_dataset
| 0.999098 |
1303.1501
|
Tom S. Verma
|
Tom S. Verma, Judea Pearl
|
Deciding Morality of Graphs is NP-complete
|
Appears in Proceedings of the Ninth Conference on Uncertainty in
Artificial Intelligence (UAI1993)
| null | null |
UAI-P-1993-PG-391-399
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to find a causal explanation for data presented in the form of
covariance and concentration matrices it is necessary to decide if the graph
formed by such associations is a projection of a directed acyclic graph (dag).
We show that the general problem of deciding whether such a dag exists is
NP-complete.
|
[
{
"version": "v1",
"created": "Wed, 6 Mar 2013 14:22:53 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Verma",
"Tom S.",
""
],
[
"Pearl",
"Judea",
""
]
] |
new_dataset
| 0.985161 |
1303.1597
|
Sumit Kumar
|
Garimella Rama Murthy (IIIT-Hyderabad, India)
|
Concurrent Cyber Physical Systems:Tensor State Space Representation
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this research paper, state space representation of concurrent, linearly
coupled dynamical systems is discussed. It is reasoned that the Tensor State
Space Representation (TSSR) proposed in [Rama1] is directly applicable in such
a problem. Also some discussion on linearly coupled, concurrent systems
evolving on multiple time scales is included. Briefly new ideas related to
distributed signal processing in cyber physical systems are included.
|
[
{
"version": "v1",
"created": "Thu, 7 Mar 2013 02:43:45 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Murthy",
"Garimella Rama",
"",
"IIIT-Hyderabad, India"
]
] |
new_dataset
| 0.961743 |
1303.1697
|
Tino
|
Avinash Bhujbal, Ashish Jagtap, Devendra Gurav, Tino Jameskutty
|
Secure Video Streaming Plug-In
| null | null | null | null |
cs.MM cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
Video sharing sites like YouTube, Metacafe, Dailymotion, Vimeo, etc. provide
a platform for media content sharing among its users. Some of these videos are
copyright protected and restricted from being downloaded and saved. But users
can use various download managers or application programs to download and save
these videos. This affects the incoming traffic on these websites reducing
their hit rate and consequently reducing their revenue. Adobe Flash Player is
the most commonly used player for watching online videos. It uses RTMP (Real
Time Messaging Protocol) to stream audio, video and data over the Internet,
between a Flash Player and Adobe Flash Media Server.Here, we propose a plug-in
that enables the site owner control over downloading of videos from such
website. The plug-in will be installed at the client side with the consent of
the user. When the video is being played this plug-in will send unique keys to
the media server. The server will continue streaming the video after verifying
the keys. Download managers or application programs will not be able to
download the videos as they wont be able to create the unique keys that need to
be sent to the server.
|
[
{
"version": "v1",
"created": "Thu, 7 Mar 2013 14:17:23 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Bhujbal",
"Avinash",
""
],
[
"Jagtap",
"Ashish",
""
],
[
"Gurav",
"Devendra",
""
],
[
"Jameskutty",
"Tino",
""
]
] |
new_dataset
| 0.997315 |
1303.1716
|
Kim Nguyen
|
V\'eronique Benzaken (LRI), Giuseppe Castagna (PPS), Kim Nguy\~\^en
(LRI), J\'er\^ome Sim\'eon
|
Static and dynamic semantics of NoSQL languages
| null |
POPL, Rome : Italy (2013)
|
10.1145/2429069.2429083
| null |
cs.PL cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a calculus for processing semistructured data that spans
differences of application area among several novel query languages, broadly
categorized as "NoSQL". This calculus lets users define their own operators,
capturing a wider range of data processing capabilities, whilst providing a
typing precision so far typical only of primitive hard-coded operators. The
type inference algorithm is based on semantic type checking, resulting in type
information that is both precise, and flexible enough to handle structured and
semistructured data. We illustrate the use of this calculus by encoding a large
fragment of Jaql, including operations and iterators over JSON, embedded SQL
expressions, and co-grouping, and show how the encoding directly yields a
typing discipline for Jaql as it is, namely without the addition of any type
definition or type annotation in the code.
|
[
{
"version": "v1",
"created": "Thu, 7 Mar 2013 15:19:21 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Benzaken",
"Véronique",
"",
"LRI"
],
[
"Castagna",
"Giuseppe",
"",
"PPS"
],
[
"Nguy\\~ên",
"Kim",
"",
"LRI"
],
[
"Siméon",
"Jérôme",
""
]
] |
new_dataset
| 0.99559 |
1303.1728
|
Zungeru Adamu Murtala
|
A.M. Zungeru, P.O. Abraham-Attah
|
A Digital Automatic Sliding Door with a Room Light Control System
|
17 pages, 17 figures, Journal paper
|
A.M. Zungeru, P.O. Abraham-Attah. A Digital Automatic Sliding Door
with a Room Light Control System, International Journal of Information
Technology, Modeling and Computing (IJITMC), vol. 1(1), pp. 1-17, 2012
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic door is an automated movable barrier installed in the entry of a
room or building to restrict access, provide ease of opening a door or provide
visual privacy. As a result of enhanced civilization and modernization, the
human nature demands more comfort to his life. The man seeks ways to do things
easily and which saves time. So thus, the automatic gates are one of the
examples that human nature invent to bring comfort and ease in its daily life.
To this end, we model and design an automatic sliding door with a room light
control system to provide the mentioned needs. This was achieved by considering
some factors such as economy, availability of components and research
materials, efficiency, compatibility and portability and also durability in the
design process. The performance of the system after test met design
specifications. This system works on the principle of breaking an infrared beam
of light, sensed by a photodiode. It consists of two transmitting infrared
diodes and two receiving photo-diodes. The first one is for someone coming in
and the second one is for someone going out of the room. The photodiodes are
connected to comparators, which give a lower output when the beam is broken and
high output when transmitting normally. The general operation of the work and
performance is dependent on the presence of an intruder entering through the
door and how close he/she is in closer to the door. The door is meant to open
automatically but in a case where there is no power supply trying to force the
door open would damage the mechanical control system of the unit. The overall
work was implemented with a constructed work, tested working and perfectly
functional.
|
[
{
"version": "v1",
"created": "Thu, 7 Mar 2013 16:02:28 GMT"
}
] | 2013-03-08T00:00:00 |
[
[
"Zungeru",
"A. M.",
""
],
[
"Abraham-Attah",
"P. O.",
""
]
] |
new_dataset
| 0.997008 |
1303.1232
|
Jessica C. Ram\'irez
|
Jessica Ram\'irez, Masayuki Asahara, Yuji Matsumoto
|
Japanese-Spanish Thesaurus Construction Using English as a Pivot
| null |
In Proceeding of The Third International Joint Conference on
Natural Language Processing (IJCNLP-08), Hyderabad, India. pages 473-480,
2008
| null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the results of research with the goal of automatically creating a
multilingual thesaurus based on the freely available resources of Wikipedia and
WordNet. Our goal is to increase resources for natural language processing
tasks such as machine translation targeting the Japanese-Spanish language pair.
Given the scarcity of resources, we use existing English resources as a pivot
for creating a trilingual Japanese-Spanish-English thesaurus. Our approach
consists of extracting the translation tuples from Wikipedia, disambiguating
them by mapping them to WordNet word senses. We present results comparing two
methods of disambiguation, the first using VSM on Wikipedia article texts and
WordNet definitions, and the second using categorical information extracted
from Wikipedia, We find that mixing the two methods produces favorable results.
Using the proposed method, we have constructed a multilingual
Spanish-Japanese-English thesaurus consisting of 25,375 entries. The same
method can be applied to any pair of languages that are linked to English in
Wikipedia.
|
[
{
"version": "v1",
"created": "Wed, 6 Mar 2013 01:30:58 GMT"
}
] | 2013-03-07T00:00:00 |
[
[
"Ramírez",
"Jessica",
""
],
[
"Asahara",
"Masayuki",
""
],
[
"Matsumoto",
"Yuji",
""
]
] |
new_dataset
| 0.988885 |
1303.0930
|
Jun Zhang
|
Jun Zhang, Xinran Li and Fang-Wei Fu
|
An Authentication Scheme for Subspace Codes over Network Based on Linear
Codes
|
18 pages
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network coding provides the advantage of maximizing the usage of network
resources, and has great application prospects in future network
communications. However, the properties of network coding also make the
pollution attack more serious. In this paper, we give an unconditional secure
authentication scheme for network coding based on a linear code $C$.
Safavi-Naini and Wang gave an authentication code for multi-receivers and
multiple messages. We notice that the scheme of Safavi-Naini and Wang is
essentially constructed with Reed-Solomon codes. And we modify their
construction slightly to make it serve for authenticating subspace codes over
linear network. Also, we generalize the construction with linear codes. The
generalization to linear codes has the similar advantages as generalizing
Shamir's secret sharing scheme to linear secret sharing sceme based on linear
codes. One advantage of this generalization is that for a fixed message space,
our scheme allows arbitrarily many receivers to check the integrity of their
own messages, while the scheme with Reed-Solomon codes has a constraint on the
number of verifying receivers. Another advantage is that we introduce access
structure in the generalized scheme. Massey characterized the access structure
of linear secret sharing scheme by minimal codewords in the dual code whose
first component is 1. We slightly modify the definition of minimal codewords.
Let $C$ be a $[V,k]$ linear code. For any coordinate $i\in \{1,2,\cdots,V\}$, a
codeword $\vec{c}$ in $C$ is called minimal respect to $i$ if the codeword
$\vec{c}$ has component 1 at the $i$-th coordinate and there is no other
codeword whose $i$-th component is 1 with support strictly contained in that of
$\vec{c}$. Then the security of receiver $R_i$ in our authentication scheme is
characterized by the minimal codewords respect to $i$ in the dual code
$C^\bot$.
|
[
{
"version": "v1",
"created": "Tue, 5 Mar 2013 05:33:40 GMT"
}
] | 2013-03-06T00:00:00 |
[
[
"Zhang",
"Jun",
""
],
[
"Li",
"Xinran",
""
],
[
"Fu",
"Fang-Wei",
""
]
] |
new_dataset
| 0.99705 |
1303.0964
|
Jan Egger
|
Jan Egger, Tina Kapur, Andriy Fedorov, Steve Pieper, James V. Miller,
Harini Veeraraghavan, Bernd Freisleben, Alexandra Golby, Christopher Nimsky,
Ron Kikinis
|
GBM Volumetry using the 3D Slicer Medical Image Computing Platform
|
7 pages, 6 figures, 2 tables, 1 equation, 43 references
|
Sci. Rep. 3, 1364, 2013
|
10.1038/srep01364
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Volumetric change in glioblastoma multiforme (GBM) over time is a critical
factor in treatment decisions. Typically, the tumor volume is computed on a
slice-by-slice basis using MRI scans obtained at regular intervals. (3D)Slicer
- a free platform for biomedical research - provides an alternative to this
manual slice-by-slice segmentation process, which is significantly faster and
requires less user interaction. In this study, 4 physicians segmented GBMs in
10 patients, once using the competitive region-growing based GrowCut
segmentation module of Slicer, and once purely by drawing boundaries completely
manually on a slice-by-slice basis. Furthermore, we provide a variability
analysis for three physicians for 12 GBMs. The time required for GrowCut
segmentation was on an average 61% of the time required for a pure manual
segmentation. A comparison of Slicer-based segmentation with manual
slice-by-slice segmentation resulted in a Dice Similarity Coefficient of 88.43
+/- 5.23% and a Hausdorff Distance of 2.32 +/- 5.23 mm.
|
[
{
"version": "v1",
"created": "Tue, 5 Mar 2013 09:40:46 GMT"
}
] | 2013-03-06T00:00:00 |
[
[
"Egger",
"Jan",
""
],
[
"Kapur",
"Tina",
""
],
[
"Fedorov",
"Andriy",
""
],
[
"Pieper",
"Steve",
""
],
[
"Miller",
"James V.",
""
],
[
"Veeraraghavan",
"Harini",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Golby",
"Alexandra",
""
],
[
"Nimsky",
"Christopher",
""
],
[
"Kikinis",
"Ron",
""
]
] |
new_dataset
| 0.99631 |
1303.1006
|
EPTCS
|
Jan Peleska (University of Bremen, Verified Systems International
GmbH, Bremen, Germany)
|
Industrial-Strength Model-Based Testing - State of the Art and Current
Challenges
|
In Proceedings MBT 2013, arXiv:1303.0379
|
EPTCS 111, 2013, pp. 3-28
|
10.4204/EPTCS.111.1
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As of today, model-based testing (MBT) is considered as leading-edge
technology in industry. We sketch the different MBT variants that - according
to our experience - are currently applied in practice, with special emphasis on
the avionic, railway and automotive domains. The key factors for successful
industrial-scale application of MBT are described, both from a scientific and a
managerial point of view. With respect to the former view, we describe the
techniques for automated test case, test data and test procedure generation for
concurrent reactive real-time systems which are considered as the most
important enablers for MBT in practice. With respect to the latter view, our
experience with introducing MBT approaches in testing teams are sketched.
Finally, the most challenging open scientific problems whose solutions are
bound to improve the acceptance and effectiveness of MBT in industry are
discussed.
|
[
{
"version": "v1",
"created": "Tue, 5 Mar 2013 12:18:09 GMT"
}
] | 2013-03-06T00:00:00 |
[
[
"Peleska",
"Jan",
"",
"University of Bremen, Verified Systems International\n GmbH, Bremen, Germany"
]
] |
new_dataset
| 0.958759 |
1303.1119
|
Zungeru Adamu Murtala
|
A.M. Zungeru, L.-M. Ang, K.P. Seng
|
Termite-hill: From natural to artificial termites in sensor networks
|
26 pages, 4 figures
|
A.M. Zungeru, L.-M. Ang, K.P. Seng. Termite-hill: From Natural to
Artificial Termites in Sensor Networks, International Journal of Swarm
Intelligence Research (IGI-Publishers), vol. 3(4), pp. 1-23, 2012
|
10.4018/jsir.2012100101
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Termites present a very good natural metaphor to evolutionary computation.
While each individuals computational power is small compared to more evolved
species, it is the power of their colonies that inspires communication
engineers. This paper presents a study of artificial termites in sensor
networks for the purpose of solving its routing problem. The behaviors of each
of the termites in their colony allow their simulation in a restricted
environment. The simulating behavior demonstrates how the termites make use of
an auto-catalytic behavior in order to collectively find a solution for a posed
problem in reasonable time. The derived algorithm termed Termite-hill
demonstrates the principle of termites behavior to routing problem solving in
the real applications of sensor networks. The performance of the algorithm was
tested on static and dynamic sink scenarios. The results as compared with other
routing algorithms and with varying network density show that Termite-hill is
scalable and improved on network energy consumption with a control over
best-effort-service.
|
[
{
"version": "v1",
"created": "Tue, 5 Mar 2013 17:58:29 GMT"
}
] | 2013-03-06T00:00:00 |
[
[
"Zungeru",
"A. M.",
""
],
[
"Ang",
"L. -M.",
""
],
[
"Seng",
"K. P.",
""
]
] |
new_dataset
| 0.9997 |
1302.4043
|
Belhassen Akrout
|
Belhassen Akrout, Imen Khanfir Kallel, Chokri Ben Amar
|
A new scheme of signature extraction for iris authentication
|
7 pages, 13 figures,International Multi-Conference on Systems Signals
and Devices
|
IEEE 6th International Multi-Conference on Systems, Signals and
Devices. (2009) 1-8
|
10.1109/SSD.2009.4956749
|
REGIM-2009-03
|
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Iris recognition, a relatively new biometric technology, has great
advantages, such as variability, stability and security, thus is the most
promising for high security environment. Iris recognition is proposed in this
report. We describe some methods, the first one is based on grey level
histogram to extract the pupil, the second is based on elliptic and parabolic
HOUGH transformation to determinate the edge of iris, upper and lower eyelids,
the third we used 2D Gabor Wavelets to encode the iris and finally we used the
Hamming distance for authentication.
|
[
{
"version": "v1",
"created": "Sun, 17 Feb 2013 08:11:58 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Akrout",
"Belhassen",
""
],
[
"Kallel",
"Imen Khanfir",
""
],
[
"Amar",
"Chokri Ben",
""
]
] |
new_dataset
| 0.987377 |
1302.5414
|
Marco Chiesa
|
Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, and Giuseppe Di
Battista
|
Intra-Domain Pathlet Routing
|
13 figures, 1 table
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internal routing inside an ISP network is the foundation for lots of services
that generate revenue from the ISP's customers. A fine-grained control of paths
taken by network traffic once it enters the ISP's network is therefore a
crucial means to achieve a top-quality offer and, equally important, to enforce
SLAs. Many widespread network technologies and approaches (most notably, MPLS)
offer limited (e.g., with RSVP-TE), tricky (e.g., with OSPF metrics), or no
control on internal routing paths. On the other hand, recent advances in the
research community are a good starting point to address this shortcoming, but
miss elements that would enable their applicability in an ISP's network.
We extend pathlet routing by introducing a new control plane for internal
routing that has the following qualities: it is designed to operate in the
internal network of an ISP; it enables fine-grained management of network paths
with suitable configuration primitives; it is scalable because routing changes
are only propagated to the network portion that is affected by the changes; it
supports independent configuration of specific network portions without the
need to know the configuration of the whole network; it is robust thanks to the
adoption of multipath routing; it supports the enforcement of QoS levels; it is
independent of the specific data plane used in the ISP's network; it can be
incrementally deployed and it can nicely coexist with other control planes.
Besides formally introducing the algorithms and messages of our control plane,
we propose an experimental validation in the simulation framework OMNeT++ that
we use to assess the effectiveness and scalability of our approach.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2013 20:55:20 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Mar 2013 02:45:12 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Chiesa",
"Marco",
""
],
[
"Lospoto",
"Gabriele",
""
],
[
"Rimondini",
"Massimo",
""
],
[
"Di Battista",
"Giuseppe",
""
]
] |
new_dataset
| 0.99944 |
1302.7051
|
Wesam Elshamy
|
Wesam Elshamy, Hassan M Emara, Ahmed Bahgat
|
Polyploidy and Discontinuous Heredity Effect on Evolutionary
Multi-Objective Optimization
|
Corrected the last name of the second author to match his name in the
paper
| null | null |
EPM-217-2006
|
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper examines the effect of mimicking discontinuous heredity caused by
carrying more than one chromosome in some living organisms cells in
Evolutionary Multi-Objective Optimization algorithms. In this representation,
the phenotype may not fully reflect the genotype. By doing so we are mimicking
living organisms inheritance mechanism, where traits may be silently carried
for many generations to reappear later. Representations with different number
of chromosomes in each solution vector are tested on different benchmark
problems with high number of decision variables and objectives. A comparison
with Non-Dominated Sorting Genetic Algorithm-II is done on all problems.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2013 01:32:28 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Mar 2013 00:20:07 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Elshamy",
"Wesam",
""
],
[
"Emara",
"Hassan M",
""
],
[
"Bahgat",
"Ahmed",
""
]
] |
new_dataset
| 0.9747 |
1303.0058
|
Mohammad Shahrokh Esfahani
|
Mohammad Shahrokh Esfahani and Masoumeh Nasiri-Kenari
|
A Cooperative MARC Scheme Using Analogue Network Coding to Achieve
Second-Order Diversity
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multiple access relay channel (MARC) is considered in which an
analogue-like network coding is implemented in the relay node. This analogue
coding is a simple addition of the received signals at the relay node. Using
"nulling detection" structure employed in V-BLAST receiver, we propose a
detection scheme in the destination which is able to provide a diversity order
of two for all users. We analytically evaluate the performance of our proposed
scheme for the MARC with two users where tight upper bounds for both uncoded
and Convolutionally coded transmission blocks are provided. We verify our
analytical evaluations by simulations and compare the results with those of
noncooperative transmission and Alamouti's scheme for the same power and rate
transmission. Our results indicate that while our proposed scheme shows a
comparable performance compared to the Alamouti's scheme, it substantially
outperforms the non-cooperate transmission.
|
[
{
"version": "v1",
"created": "Fri, 1 Mar 2013 00:47:29 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Mar 2013 19:33:18 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Esfahani",
"Mohammad Shahrokh",
""
],
[
"Nasiri-Kenari",
"Masoumeh",
""
]
] |
new_dataset
| 0.970282 |
1303.0405
|
Waqas Ahmed Imtiaz
|
Waqas Ahmed Imtiaz, Muhammad Afaq, Muhammad Asmatullah Khan Babar
|
mSCTP Based Decentralized Mobility Framework
|
7 Pages, Journal
|
International Journal of Advanced Computer Science and
Applications, Vol. 2, No.9, 2011, Page 106-112
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To conceive the full potential of wireless IP services, Mobile Nodes (MNs)
must be able to roam seamlessly across different networks. Mobile Stream
Control Transmission Protocol (mSCTP) is a transport layer solution, which
unlike Mobile IP (MIP), provides seamless mobility with minimum delay and
negligible packet loss. However, mSCTP fails to locate the current IP address
of the mobile node when Correspondent Node (CN) wants to initiate a session. In
this paper, we propose DHT Chord to provide the required location management.
Chord is a P2P algorithm, which can efficiently provide the IP address of the
called MN by using its key-value mapping. The proposed decentralized mobility
framework collectively exploits the multihoming feature of mSCTP, and efficient
key-value mapping of chord to provide seamless mobility. Suitability of the
framework is analyzed by preliminary analysis of chord lookup efficiency, and
mSCTP handover procedure using overlay weaver and NS-2. Performance analysis
shows that mSCTP multihoming feature and Chord efficient key-value mapping can
provide a non-delayed, reliable, and an efficient IP handover solution.
|
[
{
"version": "v1",
"created": "Sat, 2 Mar 2013 17:35:19 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Imtiaz",
"Waqas Ahmed",
""
],
[
"Afaq",
"Muhammad",
""
],
[
"Babar",
"Muhammad Asmatullah Khan",
""
]
] |
new_dataset
| 0.991988 |
1303.0484
|
Folke Mitzlaff
|
Folke Mitzlaff and Gerd Stumme
|
Onomastics 2.0 - The Power of Social Co-Occurrences
|
Historically, this is the first paper on the analysis of names in the
context of the name search engine 'nameling'. arXiv admin note: text overlap
with arXiv:1302.4412
| null | null | null |
cs.IR cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Onomastics is "the science or study of the origin and forms of proper names
of persons or places." ["Onomastics". Merriam-Webster.com, 2013.
http://www.merriam-webster.com (11 February 2013)]. Especially personal names
play an important role in daily life, as all over the world future parents are
facing the task of finding a suitable given name for their child. This choice
is influenced by different factors, such as the social context, language,
cultural background and, in particular, personal taste.
With the rise of the Social Web and its applications, users more and more
interact digitally and participate in the creation of heterogeneous,
distributed, collaborative data collections. These sources of data also reflect
current and new naming trends as well as new emerging interrelations among
names.
The present work shows, how basic approaches from the field of social network
analysis and information retrieval can be applied for discovering relations
among names, thus extending Onomastics by data mining techniques. The
considered approach starts with building co-occurrence graphs relative to data
from the Social Web, respectively for given names and city names. As a main
result, correlations between semantically grounded similarities among names
(e.g., geographical distance for city names) and structural graph based
similarities are observed.
The discovered relations among given names are the foundation of "nameling"
[http://nameling.net], a search engine and academic research platform for given
names which attracted more than 30,000 users within four months,
underpinningthe relevance of the proposed methodology.
|
[
{
"version": "v1",
"created": "Sun, 3 Mar 2013 10:11:44 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Mitzlaff",
"Folke",
""
],
[
"Stumme",
"Gerd",
""
]
] |
new_dataset
| 0.999493 |
1303.0598
|
M.M.A. Hashem
|
Kawser Wazed Nafi, Tonny Shekha Kar, Sayed Anisul Hoque and M. M. A.
Hashem
|
A Newer User Authentication, File encryption and Distributed Server
Based Cloud Computing Security Architecture
| null |
International Journal of Advanced Computer Science and
Applications (IJACSA), Vol. 3, No. 10, pp. 181-186, [ISSN: 2156-5570] (2012)
| null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cloud computing platform gives people the opportunity for sharing
resources, services and information among the people of the whole world. In
private cloud system, information is shared among the persons who are in that
cloud. For this, security or personal information hiding process hampers. In
this paper we have proposed new security architecture for cloud computing
platform. This ensures secure communication system and hiding information from
others. AES based file encryption system and asynchronous key system for
exchanging information or data is included in this model. This structure can be
easily applied with main cloud computing features, e.g. PaaS, SaaS and IaaS.
This model also includes onetime password system for user authentication
process. Our work mainly deals with the security system of the whole cloud
computing platform.
|
[
{
"version": "v1",
"created": "Mon, 4 Mar 2013 04:19:15 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Nafi",
"Kawser Wazed",
""
],
[
"Kar",
"Tonny Shekha",
""
],
[
"Hoque",
"Sayed Anisul",
""
],
[
"Hashem",
"M. M. A.",
""
]
] |
new_dataset
| 0.996142 |
1303.0646
|
Stefano Braghin
|
Anwitaman Datta and Stefano Braghin and Jackson Tan Teck Yong
|
The Zen of Multidisciplinary Team Recommendation
| null | null | null | null |
cs.SI cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to accomplish complex tasks, it is often necessary to compose a team
consisting of experts with diverse competencies. However, for proper
functioning, it is also preferable that a team be socially cohesive. A team
recommendation system, which facilitates the search for potential team members
can be of great help both for (i) individuals who need to seek out
collaborators and (ii) managers who need to build a team for some specific
tasks.
A decision support system which readily helps summarize such metrics, and
possibly rank the teams in a personalized manner according to the end users'
preferences, can be a great tool to navigate what would otherwise be an
information avalanche.
In this work we present a general framework of how to compose such subsystems
together to build a composite team recommendation system, and instantiate it
for a case study of academic teams.
|
[
{
"version": "v1",
"created": "Mon, 4 Mar 2013 09:07:04 GMT"
}
] | 2013-03-05T00:00:00 |
[
[
"Datta",
"Anwitaman",
""
],
[
"Braghin",
"Stefano",
""
],
[
"Yong",
"Jackson Tan Teck",
""
]
] |
new_dataset
| 0.974863 |
1302.6352
|
Roohallah Rastaghi
|
Roohallah Rastaghi
|
URDP: General Framework for Direct CCA2 Security from any Lattice-Based
PKE Scheme
|
arXiv admin note: text overlap with arXiv:1302.0347, arXiv:1211.6984;
and with arXiv:1205.5224 by other authors
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Design efficient lattice-based cryptosystem secure against adaptive chosen
ciphertext attack (IND-CCA2) is a challenge problem. To the date, full
CCA2-security of all proposed lattice-based PKE schemes achieved by using a
generic transformations such as either strongly unforgeable one-time signature
schemes (SU-OT-SS), or a message authentication code (MAC) and weak form of
commitment. The drawback of these schemes is that encryption requires "separate
encryption". Therefore, the resulting encryption scheme is not sufficiently
efficient to be used in practice and it is inappropriate for many applications
such as small ubiquitous computing devices with limited resources such as smart
cards, active RFID tags, wireless sensor networks and other embedded devices.
In this work, for the first time, we introduce an efficient universal random
data padding (URDP) scheme, and show how it can be used to construct a "direct"
CCA2-secure encryption scheme from "any" worst-case hardness problems in
(ideal) lattice in the standard model, resolving a problem that has remained
open till date. This novel approach is a "black-box" construction and leads to
the elimination of separate encryption, as it avoids using general
transformation from CPA-secure scheme to a CCA2-secure one. IND-CCA2 security
of this scheme can be tightly reduced in the standard model to the assumption
that the underlying primitive is an one-way trapdoor function.
|
[
{
"version": "v1",
"created": "Tue, 26 Feb 2013 08:22:22 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Mar 2013 19:07:42 GMT"
}
] | 2013-03-04T00:00:00 |
[
[
"Rastaghi",
"Roohallah",
""
]
] |
new_dataset
| 0.995579 |
1303.0213
|
Phillip Lord Dr
|
Phillip Lord
|
The Semantic Web takes Wing: Programming Ontologies with Tawny-OWL
| null | null | null | null |
cs.AI cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
The Tawny-OWL library provides a fully-programmatic environment for ontology
building; it enables the use of a rich set of tools for ontology development,
by recasting development as a form of programming. It is built in Clojure - a
modern Lisp dialect, and is backed by the OWL API. Used simply, it has a
similar syntax to OWL Manchester syntax, but it provides arbitrary
extensibility and abstraction. It builds on existing facilities for Clojure,
which provides a rich and modern programming tool chain, for versioning,
distributed development, build, testing and continuous integration. In this
paper, we describe the library, this environment and the its potential
implications for the ontology development process.
|
[
{
"version": "v1",
"created": "Fri, 1 Mar 2013 16:35:19 GMT"
}
] | 2013-03-04T00:00:00 |
[
[
"Lord",
"Phillip",
""
]
] |
new_dataset
| 0.999264 |
1302.7111
|
Ruggero Pagnan
|
Ruggero Pagnan
|
Syllogisms in Rudimentary Linear Logic, Diagrammatically
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a reading of the traditional syllogistics in a fragment of the
propositional intuitionistic multiplicative linear logic and prove that with
respect to a diagrammatic logical calculus that we introduced in a previous
paper, a syllogism is provable in such a fragment if and only if it is
diagrammatically provable. We extend this result to syllogistics with
complemented terms \`a la De Morgan, with respect to a suitable extension of
the diagrammatic reasoning system for the traditional case and a corresponding
reading of such De Morgan style syllogistics in the previously referred to
fragment of linear logic.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2013 08:40:40 GMT"
}
] | 2013-03-01T00:00:00 |
[
[
"Pagnan",
"Ruggero",
""
]
] |
new_dataset
| 0.999347 |
1302.7145
|
Farhat Masood
|
Rao Farhat Masood (Member IEEE, MIE (Pak), PEC)
|
Adaptive Modulation (QPSK, QAM)
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, introduced below are the concepts of digital modulation used
in many communication systems today. Techniques described include quadrature
phase shift keying (QPSK) and quadrature amplitude modulation (QAM) and how
these techniques can be used to increase the capacity and speed of a wireless
network. These modulation techniques are the basis of communications for
systems like cable modems, DSL modems, CDMA, 3G, Wi-Fi* (IEEE 802.11) and
WiMAX* (IEEE 802.16).
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2013 10:46:41 GMT"
}
] | 2013-03-01T00:00:00 |
[
[
"Masood",
"Rao Farhat",
"",
"Member IEEE, MIE"
]
] |
new_dataset
| 0.991681 |
1302.7314
|
Kevin Galloway
|
Kevin Galloway, Koushil Sreenath, Aaron D. Ames and J.W. Grizzle
|
Torque Saturation in Bipedal Robotic Walking through Control Lyapunov
Function Based Quadratic Programs
| null | null | null | null |
cs.SY cs.RO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel method for directly incorporating user-defined
control input saturations into the calculation of a control Lyapunov function
(CLF)-based walking controller for a biped robot. Previous work by the authors
has demonstrated the effectiveness of CLF controllers for stabilizing periodic
gaits for biped walkers, and the current work expands on those results by
providing a more effective means for handling control saturations. The new
approach, based on a convex optimization routine running at a 1 kHz control
update rate, is useful not only for handling torque saturations but also for
incorporating a whole family of user-defined constraints into the online
computation of a CLF controller. The paper concludes with an experimental
implementation of the main results on the bipedal robot MABEL.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2013 20:50:26 GMT"
}
] | 2013-03-01T00:00:00 |
[
[
"Galloway",
"Kevin",
""
],
[
"Sreenath",
"Koushil",
""
],
[
"Ames",
"Aaron D.",
""
],
[
"Grizzle",
"J. W.",
""
]
] |
new_dataset
| 0.983179 |
1302.6666
|
Yan Huang
|
Yan Huang, Ruoming Jin, Favyen Bastani, Xiaoyang Sean Wang
|
Large Scale Real-time Ridesharing with Service Guarantee on Road
Networks
| null | null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The mean occupancy rates of personal vehicle trips in the United States is
only 1.6 persons per vehicle mile. Urban traffic gridlock is a familiar scene.
Ridesharing has the potential to solve many environmental, congestion, and
energy problems. In this paper, we introduce the problem of large scale
real-time ridesharing with service guarantee on road networks. Servers and trip
requests are dynamically matched while waiting time and service time
constraints of trips are satisfied. We first propose two basic algorithms: a
branch-and-bound algorithm and an integer programing algorithm. However, these
algorithm structures do not adapt well to the dynamic nature of the ridesharing
problem. Thus, we then propose a kinetic tree algorithm capable of better
scheduling dynamic requests and adjusting routes on-the-fly. We perform
experiments on a large real taxi dataset from Shanghai. The results show that
the kinetic tree algorithm is faster than other algorithms in response time.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2013 05:41:49 GMT"
}
] | 2013-02-28T00:00:00 |
[
[
"Huang",
"Yan",
""
],
[
"Jin",
"Ruoming",
""
],
[
"Bastani",
"Favyen",
""
],
[
"Wang",
"Xiaoyang Sean",
""
]
] |
new_dataset
| 0.99881 |
1302.6803
|
Didier Dubois
|
Didier Dubois, Luis Farinas del Cerro, Andreas Herzig, Henri Prade
|
An Ordinal View of Independence with Application to Plausible Reasoning
|
Appears in Proceedings of the Tenth Conference on Uncertainty in
Artificial Intelligence (UAI1994)
| null | null |
UAI-P-1994-PG-195-203
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An ordinal view of independence is studied in the framework of possibility
theory. We investigate three possible definitions of dependence, of increasing
strength. One of them is the counterpart to the multiplication law in
probability theory, and the two others are based on the notion of conditional
possibility. These two have enough expressive power to support the whole
possibility theory, and a complete axiomatization is provided for the strongest
one. Moreover we show that weak independence is well-suited to the problems of
belief change and plausible reasoning, especially to address the problem of
blocking of property inheritance in exception-tolerant taxonomic reasoning.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2013 14:15:38 GMT"
}
] | 2013-02-28T00:00:00 |
[
[
"Dubois",
"Didier",
""
],
[
"del Cerro",
"Luis Farinas",
""
],
[
"Herzig",
"Andreas",
""
],
[
"Prade",
"Henri",
""
]
] |
new_dataset
| 0.998198 |
1302.6911
|
Oskar Schirmer
|
Oskar Schirmer
|
Using Virtual Addresses with Communication Channels
|
5 pages, 4 figures
| null | null | null |
cs.DC cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While for single processor and SMP machines, memory is the allocatable
quantity, for machines made up of large amounts of parallel computing units,
each with its own local memory, the allocatable quantity is a single computing
unit. Where virtual address management is used to keep memory coherent and
allow allocation of more than physical memory is actually available, virtual
communication channel references can be used to make computing units stay
connected across allocation and swapping.
|
[
{
"version": "v1",
"created": "Mon, 11 Feb 2013 20:34:05 GMT"
}
] | 2013-02-28T00:00:00 |
[
[
"Schirmer",
"Oskar",
""
]
] |
new_dataset
| 0.99868 |
1203.2268
|
Aaron Clauset
|
Winter Mason and Aaron Clauset
|
Friends FTW! Friendship, Collaboration and Competition in Halo: Reach
|
12 pages, 12 figures, 4 tables
|
Proceedings of the 2013 Conference on Computer Supported
Cooperative Work (CSCW '13), 375-386 (2013)
|
10.1145/2441776.2441820
| null |
cs.SI cs.CY cs.HC physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How important are friendships in determining success by individuals and teams
in complex collaborative environments? By combining a novel data set containing
the dynamics of millions of ad hoc teams from the popular multiplayer online
first person shooter Halo: Reach with survey data on player demographics, play
style, psychometrics and friendships derived from an anonymous online survey,
we investigate the impact of friendship on collaborative and competitive
performance. In addition to finding significant differences in player behavior
across these variables, we find that friendships exert a strong influence,
leading to both improved individual and team performance--even after
controlling for the overall expertise of the team--and increased pro-social
behaviors. Players also structure their in-game activities around social
opportunities, and as a result hidden friendship ties can be accurately
inferred directly from behavioral time series. Virtual environments that enable
such friendship effects will thus likely see improved collaboration and
competition.
|
[
{
"version": "v1",
"created": "Sat, 10 Mar 2012 17:31:47 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Feb 2013 03:12:07 GMT"
}
] | 2013-02-27T00:00:00 |
[
[
"Mason",
"Winter",
""
],
[
"Clauset",
"Aaron",
""
]
] |
new_dataset
| 0.970046 |
1302.6267
|
Shams Zawoad
|
Shams Zawoad, Amit Kumar Dutta, Ragib Hasan
|
SecLaaS: Secure Logging-as-a-Service for Cloud Forensics
|
To appear at the 8th ACM Symposium on Information, Computer and
Communications Security (ASIACCS), 2013. (Acceptance rate: 16.2%)
| null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing has emerged as a popular computing paradigm in recent years.
However, today's cloud computing architectures often lack support for computer
forensic investigations. Analyzing various logs (e.g., process logs, network
logs) plays a vital role in computer forensics. Unfortunately, collecting logs
from a cloud is very hard given the black-box nature of clouds and the
multi-tenant cloud models, where many users share the same processing and
network resources. Researchers have proposed using log API or cloud management
console to mitigate the challenges of collecting logs from cloud
infrastructure. However, there has been no concrete work, which shows how to
provide cloud logs to investigator while preserving users' privacy and
integrity of the logs. In this paper, we introduce Secure-Logging-as-a-Service
(SecLaaS), which stores virtual machines' logs and provides access to forensic
investigators ensuring the confidentiality of the cloud users. Additionally,
SeclaaS preserves proofs of past log and thus protects the integrity of the
logs from dishonest investigators or cloud providers. Finally, we evaluate the
feasibility of the scheme by implementing SecLaaS for network access logs in
OpenStack - a popular open source cloud platform.
|
[
{
"version": "v1",
"created": "Mon, 25 Feb 2013 22:36:06 GMT"
}
] | 2013-02-27T00:00:00 |
[
[
"Zawoad",
"Shams",
""
],
[
"Dutta",
"Amit Kumar",
""
],
[
"Hasan",
"Ragib",
""
]
] |
new_dataset
| 0.998911 |
1302.6330
|
EPTCS
|
Massimo Bartoletti (Universita' degli Studi di Cagliari), Tiziana
Cimoli (Universita' degli Studi di Cagliari), G. Michele Pinna (Universita'
degli Studi di Cagliari), Roberto Zunino (DISI-Universita' degli Studi di
Trento and COSBI, Italy)
|
An event-based model for contracts
|
In Proceedings PLACES 2012, arXiv:1302.5798
|
EPTCS 109, 2013, pp. 13-20
|
10.4204/EPTCS.109.3
| null |
cs.LO cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a basic model for contracts. Our model extends event structures
with a new relation, which faithfully captures the circular dependencies among
contract clauses. We establish whether an agreement exists which respects all
the contracts at hand (i.e. all the dependencies can be resolved), and we
detect the obligations of each participant. The main technical contribution is
a correspondence between our model and a fragment of the contract logic PCL.
More precisely, we show that the reachable events are exactly those which
correspond to provable atoms in the logic. Despite of this strong
correspondence, our model improves previous work on PCL by exhibiting a
finer-grained notion of culpability, which takes into account the legitimate
orderings of events.
|
[
{
"version": "v1",
"created": "Tue, 26 Feb 2013 06:48:55 GMT"
}
] | 2013-02-27T00:00:00 |
[
[
"Bartoletti",
"Massimo",
"",
"Universita' degli Studi di Cagliari"
],
[
"Cimoli",
"Tiziana",
"",
"Universita' degli Studi di Cagliari"
],
[
"Pinna",
"G. Michele",
"",
"Universita'\n degli Studi di Cagliari"
],
[
"Zunino",
"Roberto",
"",
"DISI-Universita' degli Studi di\n Trento and COSBI, Italy"
]
] |
new_dataset
| 0.95095 |
1109.5416
|
M. H. van Emden
|
M. H. van Emden
|
Matrix Code
|
39 pages, 19 figures; extensions and minor corrections
| null | null |
DCS-341-IR
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Matrix Code gives imperative programming a mathematical semantics and
heuristic power comparable in quality to functional and logic programming. A
program in Matrix Code is developed incrementally from a specification in
pre/post-condition form. The computations of a code matrix are characterized by
powers of the matrix when it is interpreted as a transformation in a space of
vectors of logical conditions. Correctness of a code matrix is expressed in
terms of a fixpoint of the transformation. The abstract machine for Matrix Code
is the dual-state machine, which we present as a variant of the classical
finite-state machine.
|
[
{
"version": "v1",
"created": "Sun, 25 Sep 2011 23:31:15 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Oct 2011 00:21:50 GMT"
},
{
"version": "v3",
"created": "Thu, 17 Nov 2011 19:49:50 GMT"
},
{
"version": "v4",
"created": "Mon, 11 Jun 2012 01:42:49 GMT"
},
{
"version": "v5",
"created": "Tue, 17 Jul 2012 00:09:57 GMT"
},
{
"version": "v6",
"created": "Mon, 25 Feb 2013 05:37:09 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"van Emden",
"M. H.",
""
]
] |
new_dataset
| 0.999795 |
1204.4714
|
Joseph Simons
|
Maarten L\"offler, Joe Simons, Darren Strash
|
Dynamic Planar Point Location with Sub-Logarithmic Local Updates
| null | null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study planar point location in a collection of disjoint fat regions, and
investigate the complexity of \emph {local updates}: replacing any region by a
different region that is "similar" to the original region. (i.e., the size
differs by at most a constant factor, and distance between the two regions is a
constant times that size). We show that it is possible to create a linear size
data structure that allows for insertions, deletions, and queries in
logarithmic time, and allows for local updates in sub-logarithmic time on a
pointer machine.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2012 19:47:45 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Feb 2013 23:21:09 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"Löffler",
"Maarten",
""
],
[
"Simons",
"Joe",
""
],
[
"Strash",
"Darren",
""
]
] |
new_dataset
| 0.992062 |
1208.6268
|
Tanmoy Chakraborty
|
Tanmoy Chakraborty
|
Authorship Identification in Bengali Literature: a Comparative Analysis
|
9 pages, 5 tables, 4 pictures
|
Chakraborty, T., Authorship Identification in Bengali Literature:
a Comparative Analysis, Proceedings of COLING 2012: Demonstration Papers,
December, 2012, pp. 41-50
| null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stylometry is the study of the unique linguistic styles and writing behaviors
of individuals. It belongs to the core task of text categorization like
authorship identification, plagiarism detection etc. Though reasonable number
of studies have been conducted in English language, no major work has been done
so far in Bengali. In this work, We will present a demonstration of authorship
identification of the documents written in Bengali. We adopt a set of
fine-grained stylistic features for the analysis of the text and use them to
develop two different models: statistical similarity model consisting of three
measures and their combination, and machine learning model with Decision Tree,
Neural Network and SVM. Experimental results show that SVM outperforms other
state-of-the-art methods after 10-fold cross validations. We also validate the
relative importance of each stylistic feature to show that some of them remain
consistently significant in every model used in this experiment.
|
[
{
"version": "v1",
"created": "Thu, 30 Aug 2012 19:09:24 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Aug 2012 19:34:18 GMT"
},
{
"version": "v3",
"created": "Thu, 6 Sep 2012 17:08:33 GMT"
},
{
"version": "v4",
"created": "Sun, 24 Feb 2013 09:27:56 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"Chakraborty",
"Tanmoy",
""
]
] |
new_dataset
| 0.993548 |
1302.5198
|
Arunasalam Sambhanthan
|
Arunasalam Sambhanthan, Alice Good
|
Implications for Improving Accessibility to E-Commerce Websites in
Developing Countries: A Subjective Study of Sri Lankan Hotel Websites
|
Conference paper. Journal version is arXiv:1302.5491
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research explores the accessibility issues with regard to the e-commerce
websites in developing countries, through a subjective study of Sri Lankan
hotel websites. A web survey and a web content analysis were conducted as the
methods to elicit data on web accessibility. Factors preventing accessibility
were hypothesized as an initial experiment. Hazardous design elements are
identified through web content analysis, the results of which are utilized to
develop specific implications for improving web accessibility. The hypothesis
tests show that there is no significant correlation between accessibility and
geographical or economic factors. However, physical impairments of users have a
considerable influence on the accessibility. Especially, visual and mobility
impaired users experience poor accessibility. Poor readability and less
navigable page designs are two observable issues, which pose threats to
accessibility. The lack of conformance to W3C accessibility guidelines and the
poor design process are the specific shortcomings which reduce the overall
accessibility. Guidelines aim to improve the accessibility of sites with a
strategic focus. Further enhancements are suggested with adherence to
principles and user centered design and developing customizable web portals
compatible for connections with differing speeds. A need for developing new
design models for differencing user groups and implementing web accessibility
strategy are emphasized as vital steps towards effective information
dissemination via e-commerce websites in the developing countries.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2013 06:36:29 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"Sambhanthan",
"Arunasalam",
""
],
[
"Good",
"Alice",
""
]
] |
new_dataset
| 0.993991 |
1302.5491
|
Arunasalam Sambhanthan
|
Arunasalam Sambhanthan, Alice Good
|
Implications for Improving Accessibility to E-Commerce Websites in
Developing Countries - A Study of Hotel Websites
|
Journal article. conference version is arXiv:1302.5198
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research explores the accessibility issues with regard to the e-commerce
websites in developing countries, through a study of Sri Lankan hotel websites.
A web survey and a web content analysis were conducted as the methods to elicit
data on web accessibility. Factors preventing accessibility were hypothesized
as an initial experiment. Affecting design elements are identified through web
content analysis, the results of which are utilized to develop specific
implications for improving web accessibility. The hypothesis tests show that
there is no significant correlation between accessibility and geographical or
economic factors. However, physical impairments of users have a considerable
influence on the accessibility of web page user interface if it has been
designed without full consideration of the needs of all users. Especially,
visual and mobility impaired users experience poor accessibility. Poor
readability and less navigable page designs are two observable issues, which
pose threats to accessibility. The lack of conformance to W3C accessibility
guidelines and the poor design process are the specific shortcomings which
reduce the overall accessibility. Guidelines aim to improve the accessibility
of sites with a strategic focus. Further enhancements are suggested with
adherence to principles, user centered design and developing customizable web
portals compatible for connections with differing speeds. Re-ordering search
results has been suggested as one of the finest step towards making the web
content accessible for users with differing needs. A need for developing new
design models for differencing user groups and implementing web accessibility
strategy are emphasized as vital steps towards effective information
dissemination via e-commerce websites in the developing countries.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 06:15:44 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"Sambhanthan",
"Arunasalam",
""
],
[
"Good",
"Alice",
""
]
] |
new_dataset
| 0.973557 |
1302.5894
|
Sonya Eini
|
Sonya Eini and Abdolah Chalechale
|
Four Side Distance: A New Fourier Shape Signature
|
6 pages, 7 figures, International Journal of Advanced Studies in
Computers, Science and Engineering
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shape is one of the main features in content based image retrieval (CBIR).
This paper proposes a new shape signature. In this technique, features of each
shape are extracted based on four sides of the rectangle that covers the shape.
The proposed technique is Fourier based and it is invariant to translation,
scaling and rotation. The retrieval performance between some commonly used
Fourier based signatures and the proposed four sides distance (FSD) signature
has been tested using MPEG-7 database. Experimental results are shown that the
FSD signature has better performance compared with those signatures.
|
[
{
"version": "v1",
"created": "Sun, 24 Feb 2013 10:49:39 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"Eini",
"Sonya",
""
],
[
"Chalechale",
"Abdolah",
""
]
] |
new_dataset
| 0.953407 |
1302.5985
|
Xiaodi Hou
|
Xiaodi Hou and Alan Yuille and Christof Koch
|
A Meta-Theory of Boundary Detection Benchmarks
|
NIPS 2012 Workshop on Human Computation for Science and Computational
Sustainability
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human labeled datasets, along with their corresponding evaluation algorithms,
play an important role in boundary detection. We here present a psychophysical
experiment that addresses the reliability of such benchmarks. To find better
remedies to evaluate the performance of any boundary detection algorithm, we
propose a computational framework to remove inappropriate human labels and
estimate the intrinsic properties of boundaries.
|
[
{
"version": "v1",
"created": "Mon, 25 Feb 2013 03:12:12 GMT"
}
] | 2013-02-26T00:00:00 |
[
[
"Hou",
"Xiaodi",
""
],
[
"Yuille",
"Alan",
""
],
[
"Koch",
"Christof",
""
]
] |
new_dataset
| 0.998529 |
1302.5502
|
Srimugunthan Dhandapani
|
Srimugunthan, K. Gopinath, Giridhar Appaji Nag Yasa
|
LFTL: A multi-threaded FTL for a Parallel IO Flash Card under Linux
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now
available, with several usecases in the design of a high performance storage
system. By using an array of flash chips, arranged in multiple banks, large
capacities are achieved. Such multi-banked architecture allow parallel read,
write and erase operations. In a raw PCI-e flash card, such parallelism is
directly available to the software layer. In addition, the devices have
restrictions such as, pages within a block can only be written sequentially.
The devices also have larger minimum write sizes (greater than 4KB). Current
flash translation layers (FTLs) in Linux are not well suited for such devices
due to the high device speeds, architectural restrictions as well as other
factors such as high lock contention. We present a FTL for Linux that takes
into account the hardware restrictions, that also exploits the parallelism to
achieve high speeds. We also consider leveraging the parallelism for garbage
collection by scheduling the garbage collection activities on idle banks. We
propose and evaluate an adaptive method to vary the amount of garbage
collection according to the current I/O load on the device.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 07:32:48 GMT"
}
] | 2013-02-25T00:00:00 |
[
[
"Srimugunthan",
"",
""
],
[
"Gopinath",
"K.",
""
],
[
"Yasa",
"Giridhar Appaji Nag",
""
]
] |
new_dataset
| 0.999636 |
1302.5611
|
Dennis Luxen
|
Julian Arz, Dennis Luxen, Peter Sanders
|
Transit Node Routing Reconsidered
|
19 pages, submitted to SEA'2013
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transit Node Routing (TNR) is a fast and exact distance oracle for road
networks. We show several new results for TNR. First, we give a surprisingly
simple implementation fully based on Contraction Hierarchies that speeds up
preprocessing by an order of magnitude approaching the time for just finding a
CH (which alone has two orders of magnitude larger query time). We also develop
a very effective purely graph theoretical locality filter without any
compromise in query times. Finally, we show that a specialization to the online
many-to-one (or one-to-many) shortest path further speeds up query time by an
order of magnitude. This variant even has better query time than the fastest
known previous methods which need much more space.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 14:43:06 GMT"
}
] | 2013-02-25T00:00:00 |
[
[
"Arz",
"Julian",
""
],
[
"Luxen",
"Dennis",
""
],
[
"Sanders",
"Peter",
""
]
] |
new_dataset
| 0.999563 |
1302.5657
|
Bernat Gaston
|
Bernat Gast\'on, Jaume Pujol, Merc\`e Villanueva
|
A realistic distributed storage system: the rack model
|
Submitted to IEEE Transactions on Information Theory. arXiv admin
note: text overlap with arXiv:1301.1549
| null | null | null |
cs.IT cs.DC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a realistic distributed storage environment, storage nodes are usually
placed in racks, a metallic support designed to accommodate electronic
equipment. It is known that the communication (bandwidth) cost between nodes
which are in the same rack is much lower than between nodes which are in
different racks.
In this paper, a new model, where the storage nodes are placed in two racks,
is proposed and analyzed. Moreover, the two-rack model is generalized to any
number of racks. In this model, the storage nodes have different repair costs
depending on the rack where they are placed. A threshold function, which
minimizes the amount of stored data per node and the bandwidth needed to
regenerate a failed node, is shown. This threshold function generalizes the
ones given for previous distributed storage models. The tradeoff curve obtained
from this threshold function is compared with the ones obtained from the
previous models, and it is shown that this new model outperforms the previous
ones in terms of repair cost.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 17:35:50 GMT"
}
] | 2013-02-25T00:00:00 |
[
[
"Gastón",
"Bernat",
""
],
[
"Pujol",
"Jaume",
""
],
[
"Villanueva",
"Mercè",
""
]
] |
new_dataset
| 0.992842 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.