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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0909.3028
|
Emmanuel Prochasson
|
Emmanuel Prochasson (LINA), Emmanuel Morin (LINA), Christian
Viard-Gaudin (IRCCyN)
|
Vers la reconnaissance de mini-messages manuscrits
| null |
Colloque International sur le Lexique et la Grammaire, Bonifacio :
France (2007)
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Handwriting is an alternative method for entering texts which composed Short
Message Services. However, a whole new language features the texts which are
produced. They include for instance abbreviations and other consonantal writing
which sprung up for time saving and fashion. We have collected and processed a
significant number of such handwritten SMS, and used various strategies to
tackle this challenging area of handwriting recognition. We proposed to study
more specifically three different phenomena: consonant skeleton, rebus, and
phonetic writing. For each of them, we compare the rough results produced by a
standard recognition system with those obtained when using a specific language
model to take care of them.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2009 14:39:05 GMT"
}
] | 2009-09-17T00:00:00 |
[
[
"Prochasson",
"Emmanuel",
"",
"LINA"
],
[
"Morin",
"Emmanuel",
"",
"LINA"
],
[
"Viard-Gaudin",
"Christian",
"",
"IRCCyN"
]
] |
new_dataset
| 0.99982 |
0909.3055
|
Syed Qaseem
|
Syed T. Qaseem, Tareq Y. Al-Naffouri
|
Compressive Sensing Based Opportunistic Protocol for Throughput
Improvement in Wireless Networks
|
Submitted to IEEE Transactions on Communications, August 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key feature in the design of any MAC protocol is the throughput it can
provide. In wireless networks, the channel of a user is not fixed but varies
randomly. Thus, in order to maximize the throughput of the MAC protocol at any
given time, only users with large channel gains should be allowed to transmit.
In this paper, compressive sensing based opportunistic protocol for throughput
improvement in wireless networks is proposed. The protocol is based on the
traditional protocol of R-ALOHA which allows users to compete for channel
access before reserving the channel to the best user. We use compressive
sensing to find the best user, and show that the proposed protocol requires
less time for reservation and so it outperforms other schemes proposed in
literature. This makes the protocol particularly suitable for enhancing R-ALOHA
in fast fading environments. We consider both analog and digital versions of
the protocol where the channel gains sent by the user are analog and digital,
respectively.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2009 16:21:26 GMT"
}
] | 2009-09-17T00:00:00 |
[
[
"Qaseem",
"Syed T.",
""
],
[
"Al-Naffouri",
"Tareq Y.",
""
]
] |
new_dataset
| 0.97652 |
0909.1759
|
Boon Thau Loo
|
William Marczak (University of Pennsylvania), David Zook (LogicBlox),
Wenchao Zhou (University of Pennsylvania), Molham Aref (LogicBlox), Boon Thau
Loo (U. Pennsylvania)
|
Declarative Reconfigurable Trust Management
|
CIDR 2009
| null | null | null |
cs.CR cs.DB
|
http://creativecommons.org/licenses/by/3.0/
|
In recent years, there has been a proliferation of declarative logic-based
trust management languages and systems proposed to ease the description,
configuration, and enforcement of security policies. These systems have
different tradeoffs in expressiveness and complexity, depending on the security
constructs (e.g. authentication, delegation, secrecy, etc.) that are supported,
and the assumed trust level and scale of the execution environment. In this
paper, we present LBTrust, a unified declarative system for reconfigurable
trust management, where various security constructs can be customized and
composed in a declarative fashion. We present an initial proof-of-concept
implementation of LBTrust using LogicBlox, an emerging commercial Datalog-based
platform for enterprise software systems. The LogicBlox language enhances
Datalog in a variety of ways, including constraints and meta-programming, as
well as support for programmer defined constraints which on the meta-model
itself ? meta-constraints ? which act to restrict the set of allowable
programs. LBTrust utilizes LogicBlox?s meta-programming and meta-constraints to
enable customizable cryptographic, partitioning and distribution strategies
based on the execution environment. We present uses cases of LBTrust based on
three trust management systems (Binder, D1LP, and Secure Network Datalog), and
provide a preliminary evaluation of a Binder-based trust management system.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2009 18:05:31 GMT"
}
] | 2009-09-15T00:00:00 |
[
[
"Marczak",
"William",
"",
"University of Pennsylvania"
],
[
"Zook",
"David",
"",
"LogicBlox"
],
[
"Zhou",
"Wenchao",
"",
"University of Pennsylvania"
],
[
"Aref",
"Molham",
"",
"LogicBlox"
],
[
"Loo",
"Boon Thau",
"",
"U. Pennsylvania"
]
] |
new_dataset
| 0.974998 |
0909.1766
|
Yi Zhang
|
Yi Zhang (Duke University), Herodotos Herodotou, Jun Yang (Duke)
|
RIOT: I/O-Efficient Numerical Computing without SQL
|
CIDR 2009
| null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by/3.0/
|
R is a numerical computing environment that is widely popular for statistical
data analysis. Like many such environments, R performs poorly for large
datasets whose sizes exceed that of physical memory. We present our vision of
RIOT (R with I/O Transparency), a system that makes R programs I/O-efficient in
a way transparent to the users. We describe our experience with RIOT-DB, an
initial prototype that uses a relational database system as a backend. Despite
the overhead and inadequacy of generic database systems in handling array data
and numerical computation, RIOT-DB significantly outperforms R in many
large-data scenarios, thanks to a suite of high-level, inter-operation
optimizations that integrate seamlessly into R. While many techniques in RIOT
are inspired by databases (and, for RIOT-DB, realized by a database system),
RIOT users are insulated from anything database related. Compared with previous
approaches that require users to learn new languages and rewrite their programs
to interface with a database, RIOT will, we believe, be easier to adopt by the
majority of the R users.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2009 18:09:27 GMT"
}
] | 2009-09-15T00:00:00 |
[
[
"Zhang",
"Yi",
"",
"Duke University"
],
[
"Herodotou",
"Herodotos",
"",
"Duke"
],
[
"Yang",
"Jun",
"",
"Duke"
]
] |
new_dataset
| 0.981388 |
0909.1780
|
Luc Bouganim
|
Luc Bouganim (INRIA), Bj\"orn J\'onsson (Reykjav\'ik University),
Philippe Bonnet (Department of Computer Science, University of Copenhagen)
|
uFLIP: Understanding Flash IO Patterns
|
CIDR 2009
| null | null | null |
cs.PF
|
http://creativecommons.org/licenses/by/3.0/
|
Does the advent of flash devices constitute a radical change for secondary
storage? How should database systems adapt to this new form of secondary
storage? Before we can answer these questions, we need to fully understand the
performance characteristics of flash devices. More specifically, we want to
establish what kind of IOs should be favored (or avoided) when designing
algorithms and architectures for flash-based systems. In this paper, we focus
on flash IO patterns, that capture relevant distribution of IOs in time and
space, and our goal is to quantify their performance. We define uFLIP, a
benchmark for measuring the response time of flash IO patterns. We also present
a benchmarking methodology which takes into account the particular
characteristics of flash devices. Finally, we present the results obtained by
measuring eleven flash devices, and derive a set of design hints that should
drive the development of flash-based systems on current devices.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2009 18:10:26 GMT"
}
] | 2009-09-15T00:00:00 |
[
[
"Bouganim",
"Luc",
"",
"INRIA"
],
[
"Jónsson",
"Björn",
"",
"Reykjavík University"
],
[
"Bonnet",
"Philippe",
"",
"Department of Computer Science, University of Copenhagen"
]
] |
new_dataset
| 0.992891 |
0909.2185
|
Nevin Vunka Jungum
|
Scott Carter and Laurent Denoue
|
SeeReader: An (Almost) Eyes-Free Mobile Rich Document Viewer
|
International Journal of Computer Science Issues, Volume 1, pp36-41,
August 2009
|
S. Carter and L. Denoue, "SeeReader: An (Almost) Eyes-Free Mobile
Rich Document Viewer ", International Journal of Computer Science Issues,
Volume 1, pp36-41, August 2009
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reading documents on mobile devices is challenging. Not only are screens
small and difficult to read, but also navigating an environment using limited
visual attention can be difficult and potentially dangerous. Reading content
aloud using text-tospeech (TTS) processing can mitigate these problems, but
only for content that does not include rich visual information. In this paper,
we introduce a new technique, SeeReader, that combines TTS with automatic
content recognition and document presentation control that allows users to
listen to documents while also being notified of important visual content.
Together, these services allow users to read rich documents on mobile devices
while maintaining awareness of their visual environment.
|
[
{
"version": "v1",
"created": "Fri, 11 Sep 2009 14:49:10 GMT"
}
] | 2009-09-14T00:00:00 |
[
[
"Carter",
"Scott",
""
],
[
"Denoue",
"Laurent",
""
]
] |
new_dataset
| 0.996772 |
0812.2719
|
John Shea
|
Tan F. Wong, Matthieu Bloch, and John M. Shea
|
Secret Sharing over Fast-Fading MIMO Wiretap Channels
|
Revision submitted to EURASIP Journal on Wireless Communications and
Networking, Special Issue on Wireless Physical Layer Security, Sept. 2009.
v.3: Fixes to proofs. Matthieu Bloch added as co-author for contributions to
proofs
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secret sharing over the fast-fading MIMO wiretap channel is considered. A
source and a destination try to share secret information over a fast-fading
MIMO channel in the presence of a wiretapper who also makes channel
observations that are different from but correlated to those made by the
destination. An interactive authenticated unrestricted public channel is also
available for use by the source and destination in the secret sharing process.
This falls under the "channel-type model with wiretapper" considered by
Ahlswede and Csiszar. A minor extension of their result (to continuous channel
alphabets) is employed to evaluate the key capacity of the fast-fading MIMO
wiretap channel. The effects of spatial dimensionality provided by the use of
multiple antennas at the source, destination, and wiretapper are then
investigated.
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2008 04:03:15 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jun 2009 00:52:02 GMT"
},
{
"version": "v3",
"created": "Sat, 12 Sep 2009 03:10:14 GMT"
}
] | 2009-09-12T00:00:00 |
[
[
"Wong",
"Tan F.",
""
],
[
"Bloch",
"Matthieu",
""
],
[
"Shea",
"John M.",
""
]
] |
new_dataset
| 0.995009 |
0909.1552
|
Adrian Dumitrescu
|
Adrian Dumitrescu and J\'anos Pach
|
Minimum clique partition in unit disk graphs
|
12 pages, 3 figures
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The minimum clique partition (MCP) problem is that of partitioning the vertex
set of a given graph into a minimum number of cliques. Given $n$ points in the
plane, the corresponding unit disk graph (UDG) has these points as vertices,
and edges connecting points at distance at most~1. MCP in unit disk graphs is
known to be NP-hard and several constant factor approximations are known,
including a recent PTAS. We present two improved approximation algorithms for
minimum clique partition in unit disk graphs:
(I) A polynomial time approximation scheme (PTAS) running in time
$n^{O(1/\eps^2)}$. This improves on a previous PTAS with $n^{O(1/\eps^4)}$
running time \cite{PS09}.
(II) A randomized quadratic-time algorithm with approximation ratio 2.16.
This improves on a ratio 3 algorithm with $O(n^2)$ running time \cite{CFFP04}.
|
[
{
"version": "v1",
"created": "Tue, 8 Sep 2009 20:47:19 GMT"
}
] | 2009-09-10T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
],
[
"Pach",
"János",
""
]
] |
new_dataset
| 0.999157 |
0909.1030
|
Amir Ben-Amram
|
Amir M. Ben-Amram
|
The Euler Path to Static Level-Ancestors
|
11 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose that a rooted tree T is given for preprocessing. The Level-Ancestor
Problem is to answer quickly queries of the following form. Given a vertex v
and an integer i > 0, find the i-th vertex on the path from the root to v.
Algorithms that achieve a linear time bound for preprocessing and a constant
time bound for a query have been published by Dietz (1991), Alstrup and Holm
(2000), and Bender and Farach (2002). The first two algorithms address dynamic
versions of the problem; the last addresses the static version only and is the
simplest so far. The purpose of this note is to expose another simple
algorithm, derived from a complicated PRAM algorithm by Berkman and Vishkin
(1990,1994). We further show some easy extensions of its functionality, adding
queries for descendants and level successors as well as ancestors, extensions
for which the formerly known algorithms are less suitable.
|
[
{
"version": "v1",
"created": "Sat, 5 Sep 2009 14:15:29 GMT"
}
] | 2009-09-08T00:00:00 |
[
[
"Ben-Amram",
"Amir M.",
""
]
] |
new_dataset
| 0.960346 |
0909.1151
|
Antoine Seilles
|
Jean Sallantin (LIRMM), Antoine Seilles (LIRMM)
|
n-Opposition theory to structure debates
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
2007 was the first international congress on the ?square of oppositions?. A
first attempt to structure debate using n-opposition theory was presented along
with the results of a first experiment on the web. Our proposal for this paper
is to define relations between arguments through a structure of opposition
(square of oppositions is one structure of opposition). We will be trying to
answer the following questions: How to organize debates on the web 2.0? How to
structure them in a logical way? What is the role of n-opposition theory, in
this context? We present in this paper results of three experiments
(Betapolitique 2007, ECAP 2008, Intermed 2008).
|
[
{
"version": "v1",
"created": "Mon, 7 Sep 2009 06:41:06 GMT"
}
] | 2009-09-08T00:00:00 |
[
[
"Sallantin",
"Jean",
"",
"LIRMM"
],
[
"Seilles",
"Antoine",
"",
"LIRMM"
]
] |
new_dataset
| 0.992182 |
0909.0571
|
R Doomun
|
Saad Ahmad Khan, Sheheryar Ali Arshad
|
QoS Provisioning Using Hybrid FSO RF Based Hierarchical Model for
Wireless Multimedia Sensor Networks
|
6 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA
| null |
ISSN 1947 5500
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our objective is to provide guaranteed packet delivery service in time
constrained sensor networks. The wireless network is a highly variable
environment, where available link bandwidth may vary with network load. Since
multimedia applications require higher bandwidth so we use FSO links for their
transmission. The main advantage of FSO links is that they offer higher
bandwidth and security, while RF links offer more reliability. The routing in
this multitier network is based on directional geographic routing protocol, in
which sensors route their data via multihop paths, to a powerful base station,
through a cluster head. Some modifications have also been incorporated in the
MAC layer to improve the QoS of such systems.
|
[
{
"version": "v1",
"created": "Thu, 3 Sep 2009 05:31:18 GMT"
}
] | 2009-09-04T00:00:00 |
[
[
"Khan",
"Saad Ahmad",
""
],
[
"Arshad",
"Sheheryar Ali",
""
]
] |
new_dataset
| 0.983511 |
0908.4464
|
Damien Chablat
|
Fr\'ed\'eric Boyer (IRCCyN), Damien Chablat (IRCCyN), Philippe Lemoine
(IRCCyN), Philippe Wenger (IRCCyN)
|
The eel-like robot
| null |
ASME Design Engineering Technical Conferences, San Diego : United
States (2009)
| null | null |
cs.RO physics.class-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this project is to design, study and build an "eel-like robot"
prototype able to swim in three dimensions. The study is based on the analysis
of eel swimming and results in the realization of a prototype with 12
vertebrae, a skin and a head with two fins. To reach these objectives, a
multidisciplinary group of teams and laboratories has been formed in the
framework of two French projects.
|
[
{
"version": "v1",
"created": "Mon, 31 Aug 2009 06:27:46 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Sep 2009 07:03:06 GMT"
}
] | 2009-09-02T00:00:00 |
[
[
"Boyer",
"Frédéric",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Lemoine",
"Philippe",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
]
] |
new_dataset
| 0.998582 |
0909.0093
|
R Doomun
|
Mohammad A. Mikki
|
Energy Efficient Location Aided Routing Protocol for Wireless MANETs
|
9 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA
| null |
ISSN 1947 5500
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes
forming a temporary network without using any centralized access point,
infrastructure, or centralized administration. In this paper we introduce an
Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is
based on the Location Aided Routing (LAR). EELAR makes significant reduction in
the energy consumption of the mobile nodes batteries by limiting the area of
discovering a new route to a smaller zone. Thus, control packets overhead is
significantly reduced. In EELAR a reference wireless base station is used and
the network's circular area centered at the base station is divided into six
equal sub-areas. At route discovery instead of flooding control packets to the
whole network area, they are flooded to only the sub-area of the destination
mobile node. The base station stores locations of the mobile nodes in a
position table. To show the efficiency of the proposed protocol we present
simulations using NS-2. Simulation results show that EELAR protocol makes an
improvement in control packet overhead and delivery ratio compared to AODV,
LAR, and DSR protocols.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2009 05:32:29 GMT"
}
] | 2009-09-02T00:00:00 |
[
[
"Mikki",
"Mohammad A.",
""
]
] |
new_dataset
| 0.999471 |
0909.0097
|
R Doomun
|
Kamanashis Biswas, S. A. M. Harun
|
Constraint Minimum Vertex Cover in K Partite Graph, Approximation
Algorithm and Complexity Analysis
|
5 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA
| null |
ISSN 1947 5500
|
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generally, a graph G, an independent set is a subset S of vertices in G such
that no two vertices in S are adjacent (connected by an edge) and a vertex
cover is a subset S of vertices such that each edge of G has at least one of
its endpoints in S. Again, the minimum vertex cover problem is to find a vertex
cover with the smallest number of vertices. This study shows that the
constrained minimum vertex cover problem in k-partite graph (MIN CVCK) is
NP-Complete which is an important property of k partite graph. Many
combinatorial problems on general graphs are NP-complete, but when restricted
to k partite graph with at most k vertices then many of these problems can be
solved in polynomial time. This paper also illustrates an approximation
algorithm for MIN CVCK and analyzes its complexity. In future work section, we
specified a number of dimensions which may be interesting for the researchers
such as developing algorithm for maximum matching and polynomial algorithm for
constructing k-partite graph from general graph.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2009 06:10:44 GMT"
}
] | 2009-09-02T00:00:00 |
[
[
"Biswas",
"Kamanashis",
""
],
[
"Harun",
"S. A. M.",
""
]
] |
new_dataset
| 0.998162 |
0909.0118
|
R Doomun
|
R. Sivaraman, R. Prabakaran, S. Sujatha
|
Dynamic Multimedia Content Retrieval System in Distributed Environment
|
4 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA
| null |
ISSN 1947 5500
|
cs.MM cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WiCoM enables remote management of web resources. Our application Mobile
reporter is aimed at Journalist, who will be able to capture the events in
real-time using their mobile phones and update their web server on the latest
event. WiCoM has been developed using J2ME technology on the client side and
PHP on the server side. The communication between the client and the server is
established through GPRS. Mobile reporter will be able to upload, edit and
remove both textual as well as multimedia contents in the server.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2009 08:19:18 GMT"
}
] | 2009-09-02T00:00:00 |
[
[
"Sivaraman",
"R.",
""
],
[
"Prabakaran",
"R.",
""
],
[
"Sujatha",
"S.",
""
]
] |
new_dataset
| 0.999684 |
0708.0053
|
Dragomir Z. Djokovic
|
Dragomir Z. Djokovic
|
Periodic complementary sets of binary sequences
|
10 pages, 1 table. Substantial revision and simplification. Submitted
to IEEE Trans. Inform. Theory
|
International Mathematical Forum 4 (2009), no. 15, 717-725.
| null | null |
cs.IT math.CO math.IT
| null |
Let PCS_p^N denote a set of p binary sequences of length N such that the sum
of their periodic auto-correlation functions is a delta-function. In the 1990,
Boemer and Antweiler addressed the problem of constructing such sequences. They
presented a table covering the range p <= 12, N <= 50 and showing in which
cases it was known at that time whether such sequences exist, do not exist, or
the question of existence is undecided. The number of undecided cases was
rather large.
Subsequently the number of undecided cases was reduced to 26 by the author.
In the present note, several cyclic difference families are constructed and
used to obtain new sets of periodic binary sequences. Thereby the original
problem of Boemer and Antweiler is completely solved.
|
[
{
"version": "v1",
"created": "Wed, 1 Aug 2007 00:40:12 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Apr 2008 16:20:25 GMT"
}
] | 2009-09-01T00:00:00 |
[
[
"Djokovic",
"Dragomir Z.",
""
]
] |
new_dataset
| 0.997777 |
0905.3678
|
Vadim Madgazin
|
Vadim R. Madgazin
|
Major and minor. The formula of musical emotions
|
22 pages, 3 figures, in Russian, added figures, changed content
| null | null | null |
cs.SD q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The new formulas, which determine sign and amplitude of utilitarian emotions,
are proposed on the basis of the information theory of emotions. In area of
perception of musical chords the force of emotions depends on the relative
pitch of sounds of major and minor chords.
Is advanced hypothesis that in the perception of a musical chord in the
psyche caused by the subject value of some objective function L. This function
is expressed directly through the proportion of the pitch of chord. Major
chords are expressed as the straight proportions, which generate idea about an
increase in the objective function (L>1) and are caused positive utilitarian
emotions. Minor chords are expressed as the inverse proportion, which generate
idea about the decrease of objective function (L<1) and are caused negative
utilitarian emotions.
The formula of musical emotions is advanced: Pwe = log(L) =
(1/M)*log(n1*n2*n3* ... *nM), where M is a quantity of voices of chord, ni -
integer number (or reciprocal fraction) from the pitch proportion, which
corresponds to the i-th voice of chord.
Confined experimental check is produced. The limits of the applicability of
the formula of musical emotions are investigated.
Keywords: sound, music, chord, major, minor, emotions, the formula of musical
emotions, the information theory of emotions.
|
[
{
"version": "v1",
"created": "Fri, 22 May 2009 13:40:36 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Jul 2009 10:57:50 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Sep 2009 11:19:59 GMT"
}
] | 2009-09-01T00:00:00 |
[
[
"Madgazin",
"Vadim R.",
""
]
] |
new_dataset
| 0.999579 |
0907.5438
|
Pranav Agrawal
|
Pranav Agrawal, Joy Kuri
|
Key Distribution Scheme without Deployment Knowledge
|
8 pages, 5 figures, Accepted in ICUMT 2009
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many basic key distribution schemes specifically tuned to wireless sensor
networks have been proposed in the literature. Recently, several researchers
have proposed schemes in which they have used group-based deployment models and
assumed predeployment knowledge of the expected locations of nodes. They have
shown that these schemes achieve better performance than the basic schemes, in
terms of connectivity, resilience against node capture and storage
requirements. But in many situations expected locations of nodes are not
available. In this paper we propose a solution which uses the basic scheme, but
does not use group-based deployment model and predeployment knowledge of the
locations of nodes, and yet performs better than schemes which make the
aforementioned assumptions.
In our scheme, groups are formed after deployment of sensor nodes, on the
basis of their physical locations, and the nodes sample keys from disjoint key
pools. Compromise of a node affects secure links with other nodes that are part
of its group only. Because of this reason, our scheme performs better than the
basic schemes and the schemes using predeployment knowledge, in terms of
connectivity, storage requirement, and security. Moreover, the post-deployment
key generation process completes sooner than in schemes like LEAP+.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2009 22:58:53 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Aug 2009 10:50:52 GMT"
}
] | 2009-08-29T00:00:00 |
[
[
"Agrawal",
"Pranav",
""
],
[
"Kuri",
"Joy",
""
]
] |
new_dataset
| 0.982431 |
0908.3689
|
Renuka Kandregula
|
Renuka Kandregula
|
A DHT Based Measure of Randomness
|
15 pages, 8 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new discrete Hilbert transform (DHT) based measure of
randomness for discrete sequences. The measure has been used to test three
different classes of sequences with satisfactory results.
|
[
{
"version": "v1",
"created": "Tue, 25 Aug 2009 21:16:39 GMT"
}
] | 2009-08-27T00:00:00 |
[
[
"Kandregula",
"Renuka",
""
]
] |
new_dataset
| 0.997002 |
cs/0609117
|
Xudong Ma
|
Xudong Ma and En-hui Yang
|
Constructing LDPC Codes by 2-Lifts
|
11 pages, 7 figures
|
Proceeding of IEEE International Symposium on Information Theory
(ISIT) 2007
| null | null |
cs.IT math.IT
| null |
We propose a new low-density parity-check code construction scheme based on
2-lifts. The proposed codes have an advantage of admitting efficient hardware
implementations. With the motivation of designing codes with low error floors,
we present an analysis of the low-weight stopping set distributions of the
proposed codes. Based on this analysis, we propose design criteria for
designing codes with low error floors. Numerical results show that the
resulting codes have low error probabilities over binary erasure channels.
|
[
{
"version": "v1",
"created": "Thu, 21 Sep 2006 02:14:22 GMT"
}
] | 2009-08-27T00:00:00 |
[
[
"Ma",
"Xudong",
""
],
[
"Yang",
"En-hui",
""
]
] |
new_dataset
| 0.999612 |
0908.3233
|
Yavuz Oruc A.
|
A. Yavuz Oruc and Abdullah Atmaca
|
Asymptotically Optimal Assignments In Ordinal Evaluations of Proposals
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In ordinal evaluations of proposals in peer review systems, a set of
proposals is assigned to a fixed set of referees so as to maximize the number
of pairwise comparisons of proposals under certain referee capacity and
proposal subject constraints. In this paper, the following two related problems
are considered: (1) Assuming that each referee has a capacity to review k out
of n proposals, 2 < k < n, determine the minimum number of referees needed to
ensure that each pair of proposals is reviewed by at least one referee, (2)
Find an assignment that meets the lower bound determined in (1). It is easy to
see that one referee is both necessary and sufficient when k = n, and n(n-1)/2
referees are both necessary and sufficient when k = 2. We show that 6 referees
are both necessary and sufficient when k = n/2. We further show that 11
referees are necessary and 12 are sufficient when k = n/3, and 18 referees are
necessary and 20 referees are sufficient when k = n/4. A more general lower
bound of n(n-1)/k(k-1) referees is also given for any k, 2 < k < n, and an
assignment asymptotically matching this lower bound within a factor of 2 is
presented. These results are not only theoretically interesting but they also
provide practical methods for efficient assignments of proposals to referees.
|
[
{
"version": "v1",
"created": "Sat, 22 Aug 2009 07:08:30 GMT"
}
] | 2009-08-25T00:00:00 |
[
[
"Oruc",
"A. Yavuz",
""
],
[
"Atmaca",
"Abdullah",
""
]
] |
new_dataset
| 0.990149 |
0908.3317
|
Vinith Reddy Podduturi
|
Vinith Reddy, Srinivas Shakkottai, Alex Sprintson and Natarajan Gautam
|
Multipath Wireless Network Coding: A Population Game Perspective
|
9 pages and 4 figures
| null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider wireless networks in which multiple paths are available between
each source and destination. We allow each source to split traffic among all of
its available paths, and ask the question: how do we attain the lowest possible
number of transmissions to support a given traffic matrix? Traffic bound in
opposite directions over two wireless hops can utilize the ``reverse
carpooling'' advantage of network coding in order to decrease the number of
transmissions used. We call such coded hops as ``hyper-links''. With the
reverse carpooling technique longer paths might be cheaper than shorter ones.
However, there is a prisoners dilemma type situation among sources -- the
network coding advantage is realized only if there is traffic in both
directions of a shared path. We develop a two-level distributed control scheme
that decouples user choices from each other by declaring a hyper-link capacity,
allowing sources to split their traffic selfishly in a distributed fashion, and
then changing the hyper-link capacity based on user actions. We show that such
a controller is stable, and verify our analytical insights by simulation.
|
[
{
"version": "v1",
"created": "Sun, 23 Aug 2009 17:07:49 GMT"
}
] | 2009-08-25T00:00:00 |
[
[
"Reddy",
"Vinith",
""
],
[
"Shakkottai",
"Srinivas",
""
],
[
"Sprintson",
"Alex",
""
],
[
"Gautam",
"Natarajan",
""
]
] |
new_dataset
| 0.983142 |
0908.3361
|
Gene Golovchinsky
|
Laurent Denoue, Scott Carter, John Adcock, Gene Golovchinsky, and
Andreas Girgensohn
|
WebNC: efficient sharing of web applications
|
Presented at WWW 2009, Madrid, Spain
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WebNC is a system for efficiently sharing, retrieving and viewing web
applications. Unlike existing screencasting and screensharing tools, WebNC is
optimized to work with web pages where a lot of scrolling happens. WebNC uses a
tile-based encoding to capture, transmit and deliver web applications, and
relies only on dynamic HTML and JavaScript. The resulting webcasts require very
little bandwidth and are viewable on any modern web browser including Firefox
and Internet Explorer as well as browsers on the iPhone and Android platforms.
|
[
{
"version": "v1",
"created": "Mon, 24 Aug 2009 05:34:57 GMT"
}
] | 2009-08-25T00:00:00 |
[
[
"Denoue",
"Laurent",
""
],
[
"Carter",
"Scott",
""
],
[
"Adcock",
"John",
""
],
[
"Golovchinsky",
"Gene",
""
],
[
"Girgensohn",
"Andreas",
""
]
] |
new_dataset
| 0.99528 |
0908.3362
|
Willemien Visser
|
Willemien Visser (LTCI)
|
The Function of Gesture in an Architectural Design Meeting
| null |
About: Designing. Analysing design meetings, Janet McDonnell and
Peter Lloyd (Ed.) (2009) 269-284
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This text presents a cognitive-psychology analysis of spontaneous, co-speech
gestures in a face-to-face architectural design meeting (A1 in DTRS7). The
long-term objective is to formulate specifications for remote
collaborative-design systems, especially for supporting the use of different
semiotic modalities (multi-modal interaction). According to their function for
design, interaction, and collaboration, we distinguish different gesture
families: representational (entity designating or specifying), organisational
(management of discourse, interaction, or functional design actions),
focalising, discourse and interaction modulating, and disambiguating gestures.
Discussion and conclusion concern the following points. It is impossible to
attribute fixed functions to particular gesture forms. "Designating" gestures
may also have a design function. The gestures identified in A1 possess a
certain generic character. The gestures identified are neither systematically
irreplaceable, nor optional accessories to speech or drawing. We discuss the
possibilities for gesture in computer-supported collaborative software systems.
The paper closes on our contribution to gesture studies and cognitive design
research.
|
[
{
"version": "v1",
"created": "Mon, 24 Aug 2009 06:04:46 GMT"
}
] | 2009-08-25T00:00:00 |
[
[
"Visser",
"Willemien",
"",
"LTCI"
]
] |
new_dataset
| 0.998963 |
0904.3062
|
Mikl\'os Cs\H{u}r\"os
|
Miklos Csuros
|
Approximate counting with a floating-point counter
|
Updated content (fixed errors in the previous version)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memory becomes a limiting factor in contemporary applications, such as
analyses of the Webgraph and molecular sequences, when many objects need to be
counted simultaneously. Robert Morris [Communications of the ACM, 21:840--842,
1978] proposed a probabilistic technique for approximate counting that is
extremely space-efficient. The basic idea is to increment a counter containing
the value $X$ with probability $2^{-X}$. As a result, the counter contains an
approximation of $\lg n$ after $n$ probabilistic updates stored in $\lg\lg n$
bits. Here we revisit the original idea of Morris, and introduce a binary
floating-point counter that uses a $d$-bit significand in conjunction with a
binary exponent. The counter yields a simple formula for an unbiased estimation
of $n$ with a standard deviation of about $0.6\cdot n2^{-d/2}$, and uses
$d+\lg\lg n$ bits.
We analyze the floating-point counter's performance in a general framework
that applies to any probabilistic counter, and derive practical formulas to
assess its accuracy.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2009 15:53:33 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Aug 2009 05:10:03 GMT"
}
] | 2009-08-24T00:00:00 |
[
[
"Csuros",
"Miklos",
""
]
] |
new_dataset
| 0.970328 |
0908.2941
|
Huang Huang
|
Huang Huang and Vincent K. N. Lau
|
Delay-Sensitive Distributed Power and Transmission Threshold Control for
S-ALOHA Network with Finite State Markov Fading Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the delay-sensitive power and transmission
threshold control design in S-ALOHA network with FSMC fading channels. The
random access system consists of an access point with K competing users, each
has access to the local channel state information (CSI) and queue state
information (QSI) as well as the common feedback (ACK/NAK/Collision) from the
access point. We seek to derive the delay-optimal control policy (composed of
threshold and power control). The optimization problem belongs to the
memoryless policy K-agent infinite horizon decentralized Markov decision
process (DEC-MDP), and finding the optimal policy is shown to be
computationally intractable. To obtain a feasible and low complexity solution,
we recast the optimization problem into two subproblems, namely the power
control and the threshold control problem. For a given threshold control
policy, the power control problem is decomposed into a reduced state MDP for
single user so that the overall complexity is O(NJ), where N and J are the
buffer size and the cardinality of the CSI states. For the threshold control
problem, we exploit some special structure of the collision channel and common
feedback information to derive a low complexity solution. The delay performance
of the proposed design is shown to have substantial gain relative to
conventional throughput optimal approaches for S-ALOHA.
|
[
{
"version": "v1",
"created": "Thu, 20 Aug 2009 15:17:15 GMT"
}
] | 2009-08-21T00:00:00 |
[
[
"Huang",
"Huang",
""
],
[
"Lau",
"Vincent K. N.",
""
]
] |
new_dataset
| 0.972535 |
0908.2661
|
Pooyan Fazli
|
Pooyan Fazli, Alan K. Mackworth
|
Human-Robot Teams in Entertainment and Other Everyday Scenarios
| null | null | null | null |
cs.MA cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new and relatively unexplored research direction in robotics systems is the
coordination of humans and robots working as a team. In this paper, we focus
upon problem domains and tasks in which multiple robots, humans and other
agents are cooperating through coordination to satisfy a set of goals or to
maximize utility. We are primarily interested in applications of human robot
coordination in entertainment and other activities of daily life. We discuss
the teamwork problem and propose an architecture to address this.
|
[
{
"version": "v1",
"created": "Wed, 19 Aug 2009 02:29:28 GMT"
}
] | 2009-08-20T00:00:00 |
[
[
"Fazli",
"Pooyan",
""
],
[
"Mackworth",
"Alan K.",
""
]
] |
new_dataset
| 0.995741 |
0908.2744
|
Manish Gupta
|
Anshul Chaurasia, Sudhanshu Dwivedi, Prateek Jain and Manish K. Gupta
|
XTile: An Error-Correction Package for DNA Self-Assembly
|
5 pages, FNANO 2009 conference paper, The tool XTile is available for
download and use at http://www.guptalab.org/xtile
|
Proceedings of 6th Annual Conference on Foundations of Nanoscience
(FNANO 09): Self-Assembled Architectures and Devices, Salt Lake City, Utah,
U.S.A., 20th-24th April 2009, pp. 225 - 229
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Self assembly is a process by which supramolecular species form spontaneously
from their components. This process is ubiquitous throughout the life chemistry
and is central to biological information processing. It has been predicted that
in future self assembly will become an important engineering discipline by
combining the fields of bio molecular computation, nano technology and
medicine. However error control is a key challenge in realizing the potential
of self assembly. Recently many authors have proposed several combinatorial
error correction schemes to control errors which have a close analogy with the
coding theory such as Winfree s proofreading scheme and its generalizations by
Chen and Goel and compact scheme of Reif, Sahu and Yin. In this work, we
present an error correction computational tool XTile that can be used to create
input files to the Xgrow simulator of Winfree by providing the design logic of
the tiles and it also allows the user to apply proofreading, snake and compact
error correction schemes.
|
[
{
"version": "v1",
"created": "Wed, 19 Aug 2009 13:02:57 GMT"
}
] | 2009-08-20T00:00:00 |
[
[
"Chaurasia",
"Anshul",
""
],
[
"Dwivedi",
"Sudhanshu",
""
],
[
"Jain",
"Prateek",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.99734 |
0908.2198
|
Maria Bras-Amor\'os
|
Maria Bras-Amor\'os and Michael E. O'Sullivan
|
The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer
Link
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The two primary decoding algorithms for Reed-Solomon codes are the
Berlekamp-Massey algorithm and the Sugiyama et al. adaptation of the Euclidean
algorithm, both designed to solve a key equation. In this article an
alternative version of the key equation and a new way to use the Euclidean
algorithm to solve it are presented, which yield the Berlekamp-Massey
algorithm. This results in a new, simpler, and compacter presentation of the
Berlekamp-Massey algorithm.
|
[
{
"version": "v1",
"created": "Sat, 15 Aug 2009 21:01:42 GMT"
}
] | 2009-08-18T00:00:00 |
[
[
"Bras-Amorós",
"Maria",
""
],
[
"O'Sullivan",
"Michael E.",
""
]
] |
new_dataset
| 0.951616 |
0908.2237
|
Manu Basavaraju
|
Manu Basavaraju, L. Sunil Chandran
|
Acyclic Edge coloring of Planar Graphs
|
10 pages. 0 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $acyclic$ edge coloring of a graph is a proper edge coloring such that
there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph
is the minimum number k such that there is an acyclic edge coloring using k
colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks
(and much earlier by Fiamcik) that $a'(G)\le \Delta+2$, where $\Delta
=\Delta(G)$ denotes the maximum degree of the graph. We prove that if $G$ is a
planar graph with maximum degree $\Delta$, then $a'(G)\le \Delta + 12$.
|
[
{
"version": "v1",
"created": "Sun, 16 Aug 2009 13:16:15 GMT"
}
] | 2009-08-18T00:00:00 |
[
[
"Basavaraju",
"Manu",
""
],
[
"Chandran",
"L. Sunil",
""
]
] |
new_dataset
| 0.997751 |
0812.5104
|
Salah A. Aly
|
Salah A. Aly
|
On Quantum and Classical Error Control Codes: Constructions and
Applications
|
Parts of PhD dissertation, Texas A&M University
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is conjectured that quantum computers are able to solve certain problems
more quickly than any deterministic or probabilistic computer. A quantum
computer exploits the rules of quantum mechanics to speed up computations.
However, it is a formidable task to build a quantum computer, since the quantum
mechanical systems storing the information unavoidably interact with their
environment. Therefore, one has to mitigate the resulting noise and decoherence
effects to avoid computational errors.
In this work, I study various aspects of quantum error control codes -- the
key component of fault-tolerant quantum information processing. I present the
fundamental theory and necessary background of quantum codes and construct many
families of quantum block and convolutional codes over finite fields, in
addition to families of subsystem codes over symmetric and asymmetric channels.
Particularly, many families of quantum BCH, RS, duadic, and convolutional
codes are constructed over finite fields. Families of subsystem codes and a
class of optimal MDS subsystem codes are derived over asymmetric and symmetric
quantum channels. In addition, propagation rules and tables of upper bounds on
subsystem code parameters are established. Classes of quantum and classical
LDPC codes based on finite geometries and Latin squares are constructed.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2008 20:09:07 GMT"
}
] | 2009-08-15T00:00:00 |
[
[
"Aly",
"Salah A.",
""
]
] |
new_dataset
| 0.992103 |
0908.1608
|
Christian Duncan
|
Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
|
Planar Drawings of Higher-Genus Graphs
|
A condensed version of this paper is to appear in Graph Drawing 2009.
This is just a first draft. A final draft will appear in the near future
| null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we give polynomial-time algorithms that can take a graph G
with a given combinatorial embedding on an orientable surface S of genus g and
produce a planar drawing of G in R^2, with a bounding face defined by a
polygonal schema P for S. Our drawings are planar, but they allow for multiple
copies of vertices and edges on P's boundary, which is a common way of
visualizing higher-genus graphs in the plane. Our drawings can be defined with
respect to either a canonical polygonal schema or a polygonal cutset schema,
which provides an interesting tradeoff, since canonical schemas have fewer
sides, and have a nice topological structure, but they can have many more
repeated vertices and edges than general polygonal cutsets. As a side note, we
show that it is NP-complete to determine whether a given graph embedded in a
genus-g surface has a set of 2g fundamental cycles with vertex-disjoint
interiors, which would be desirable from a graph-drawing perspective.
|
[
{
"version": "v1",
"created": "Wed, 12 Aug 2009 02:53:37 GMT"
}
] | 2009-08-13T00:00:00 |
[
[
"Duncan",
"Christian A.",
""
],
[
"Goodrich",
"Michael T.",
""
],
[
"Kobourov",
"Stephen G.",
""
]
] |
new_dataset
| 0.998363 |
0908.1528
|
Robert Geisberger
|
Robert Geisberger
|
Contraction of Timetable Networks with Realistic Transfers
|
15 pages, technical report
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We successfully contract timetable networks with realistic transfer times.
Contraction gradually removes nodes from the graph and adds shortcuts to
preserve shortest paths. This reduces query times to 1 ms with preprocessing
times around 6 minutes on all tested instances. We achieve this by an improved
contraction algorithm and by using a station graph model. Every node in our
graph has a one-to-one correspondence to a station and every edge has an
assigned collection of connections. Our graph model does not need parallel
edges. The query algorithm does not compute a single earliest arrival time at a
station but a set of arriving connections that allow best transfer
opportunities.
|
[
{
"version": "v1",
"created": "Tue, 11 Aug 2009 16:03:46 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Aug 2009 14:26:01 GMT"
}
] | 2009-08-12T00:00:00 |
[
[
"Geisberger",
"Robert",
""
]
] |
new_dataset
| 0.998736 |
0908.1564
|
Jay Kumar Sundararajan
|
Jay Kumar Sundararajan, Szymon Jakubczak, Muriel Medard, Michael
Mitzenmacher, Joao Barros
|
Interfacing network coding with TCP: an implementation
|
9 pages; Submitted to INFOCOM 2010
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In previous work (`Network coding meets TCP') we proposed a new protocol that
interfaces network coding with TCP by means of a coding layer between TCP and
IP. Unlike the usual batch-based coding schemes, the protocol uses a
TCP-compatible sliding window code in combination with new rules for
acknowledging bytes to TCP that take into account the network coding operations
in the lower layer. The protocol was presented in a theoretical framework and
considered only in conjunction with TCP Vegas. In this paper we present a
real-world implementation of this protocol that addresses several important
practical aspects of incorporating network coding and decoding with TCP's
window management mechanism. Further, we work with the more widespread and
practical TCP Reno. Our implementation significantly advances the goal of
designing a deployable, general, TCP-compatible protocol that provides the
benefits of network coding.
|
[
{
"version": "v1",
"created": "Tue, 11 Aug 2009 19:36:15 GMT"
}
] | 2009-08-12T00:00:00 |
[
[
"Sundararajan",
"Jay Kumar",
""
],
[
"Jakubczak",
"Szymon",
""
],
[
"Medard",
"Muriel",
""
],
[
"Mitzenmacher",
"Michael",
""
],
[
"Barros",
"Joao",
""
]
] |
new_dataset
| 0.992714 |
0908.1222
|
Rajesh Ramachandran
|
R Rajesh and Vinod Sharma
|
Distributed Joint Source-Channel Coding for Functions over a Multiple
Access Channel
|
7 Pages, 2 Figures. To Appear in IEEE GLOBECOM, 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we provide sufficient conditions for lossy transmission of
functions of correlated data over a multiple access channel (MAC). The
conditions obtained can be shown as generalized version of Yamamoto's result.
We also obtain efficient joint source-channel coding schemes for transmission
of discrete and continuous alphabet sources to recover the function values.
Keywords: Joint source-channel coding, Graph coloring, Lipschitz functions,
Correlated sources.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2009 10:34:24 GMT"
}
] | 2009-08-11T00:00:00 |
[
[
"Rajesh",
"R",
""
],
[
"Sharma",
"Vinod",
""
]
] |
new_dataset
| 0.993378 |
0908.1348
|
Juergen Bierbrauer
|
J. Bierbrauer, S. Marcugini, F. Pambianco
|
The non-existence of a [[13,5,4]] quantum stabilizer code
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We solve one of the oldest problems in the theory of quantum stabilizer codes
by proving the non-existence of quantum [[13,5,4]]-codes.
|
[
{
"version": "v1",
"created": "Mon, 10 Aug 2009 16:06:44 GMT"
}
] | 2009-08-11T00:00:00 |
[
[
"Bierbrauer",
"J.",
""
],
[
"Marcugini",
"S.",
""
],
[
"Pambianco",
"F.",
""
]
] |
new_dataset
| 0.999586 |
0908.0979
|
R Doomun
|
A. Damodaram, H. Jayasri
|
Authentication Without Identification using Anonymous Credential System
|
4 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 3, No. 1, July 2009, USA
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Privacy and security are often intertwined. For example, identity theft is
rampant because we have become accustomed to authentication by identification.
To obtain some service, we provide enough information about our identity for an
unscrupulous person to steal it (for example, we give our credit card number to
Amazon.com). One of the consequences is that many people avoid e-commerce
entirely due to privacy and security concerns. The solution is to perform
authentication without identification. In fact, all on-line actions should be
as anonymous as possible, for this is the only way to guarantee security for
the overall system. A credential system is a system in which users can obtain
credentials from organizations and demonstrate possession of these credentials.
Such a system is anonymous when transactions carried out by the same user
cannot be linked. An anonymous credential system is of significant practical
relevance because it is the best means of providing privacy for users.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2009 04:02:05 GMT"
}
] | 2009-08-10T00:00:00 |
[
[
"Damodaram",
"A.",
""
],
[
"Jayasri",
"H.",
""
]
] |
new_dataset
| 0.984448 |
0908.0981
|
R Doomun
|
Syed S. Rizvi, and Khaled M. Elleithy
|
A New Scheme for Minimizing Malicious Behavior of Mobile Nodes in Mobile
Ad Hoc Networks
|
10 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 3, No. 1, July 2009, USA
| null |
ISSN 1947 5500
|
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The performance of Mobile Ad hoc networks (MANET) depends on the cooperation
of all active nodes. However, supporting a MANET is a cost-intensive activity
for a mobile node. From a single mobile node perspective, the detection of
routes as well as forwarding packets consume local CPU time, memory,
network-bandwidth, and last but not least energy. We believe that this is one
of the main factors that strongly motivate a mobile node to deny packet
forwarding for others, while at the same time use their services to deliver its
own data. This behavior of an independent mobile node is commonly known as
misbehaving or selfishness. A vast amount of research has already been done for
minimizing malicious behavior of mobile nodes. However, most of them focused on
the methods/techniques/algorithms to remove such nodes from the MANET. We
believe that the frequent elimination of such miss-behaving nodes never allowed
a free and faster growth of MANET. This paper provides a critical analysis of
the recent research wok and its impact on the overall performance of a MANET.
In this paper, we clarify some of the misconceptions in the understating of
selfishness and miss-behavior of nodes. Moreover, we propose a mathematical
model that based on the time division technique to minimize the malicious
behavior of mobile nodes by avoiding unnecessary elimination of bad nodes. Our
proposed approach not only improves the resource sharing but also creates a
consistent trust and cooperation (CTC) environment among the mobile nodes. The
simulation results demonstrate the success of the proposed approach that
significantly minimizes the malicious nodes and consequently maximizes the
overall throughput of MANET than other well known schemes.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2009 04:33:50 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Aug 2009 07:01:54 GMT"
}
] | 2009-08-10T00:00:00 |
[
[
"Rizvi",
"Syed S.",
""
],
[
"Elleithy",
"Khaled M.",
""
]
] |
new_dataset
| 0.99217 |
0906.1538
|
Ender Ayanoglu
|
Ender Ayanoglu
|
On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal
Space-Time Block Codes"
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The computational complexity of the Maximum Likelihood decoding algorithm in
[1], [2] for orthogonal space-time block codes is smaller than specified.
|
[
{
"version": "v1",
"created": "Mon, 8 Jun 2009 16:55:22 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Jun 2009 17:42:23 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Jul 2009 01:48:50 GMT"
},
{
"version": "v4",
"created": "Sat, 8 Aug 2009 00:55:45 GMT"
}
] | 2009-08-08T00:00:00 |
[
[
"Ayanoglu",
"Ender",
""
]
] |
new_dataset
| 0.978651 |
0908.0812
|
Silvio Valenti
|
Dario Rossi, Claudio Testa, Silvio Valenti, Paolo Veglia, Luca
Muscariello
|
News from the Internet congestion control world
|
9 pages, 4 figures, submitted to IEEE INFOCOM 2010
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A few months ago, the BitTorrent developers announced that the transfer of
torrent data in the official client was about to switch to uTP, an
application-layer congestion-control protocol using UDP at the transport-layer.
This announcement immediately raised an unmotivated buzz about a new, imminent
congestion collapse of the whole Internet. Though this reaction was not built
on solid technical foundation, nevertheless a legitimate question remains:
i.e., whether this novel algorithm is a necessary building block for future
Internet applications, or whether it may result in an umpteenth addition to the
already well populated world of Internet congestion control algorithms.
In this paper, we tackle precisely this issue. The novel protocol is now
under discussion at the IETF LEDBAT working group, and has been defined in a
draft document in March 2009, whose adoption decision will be taken at the
beginning of August 2009. Adhering to the IETF draft definition, we implement
the LEDBAT congestion control algorithm and investigate its performance by
means of packet-level simulations. Considering a simple bottleneck scenario
where LEDBAT competes against either TCP or other LEDBAT flows, we evaluate the
fairness of the resource share as well as its efficiency. Our preliminary
results show that indeed, there is an undoubted appeal behind the novel
application-layer congestion-control protocol. Yet, care must be taken in order
to ensure that some important points, such as intra-protocol fairness, are
fully clarified in the draft specification -- which we hope that this work can
contribute to.
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2009 08:45:18 GMT"
}
] | 2009-08-07T00:00:00 |
[
[
"Rossi",
"Dario",
""
],
[
"Testa",
"Claudio",
""
],
[
"Valenti",
"Silvio",
""
],
[
"Veglia",
"Paolo",
""
],
[
"Muscariello",
"Luca",
""
]
] |
new_dataset
| 0.998975 |
0908.0893
|
Moustafa Seifeldin
|
Moustafa Seifeldin and Moustafa Youssef
|
Nuzzer: A Large-Scale Device-Free Passive Localization System for
Wireless Environments
|
9 pages
| null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The widespread usage of wireless local area networks and mobile devices has
fostered the interest in localization systems for wireless environments. The
majority of research in the context of wireless-based localization systems has
focused on device-based active localization, in which a device is attached to
tracked entities. Recently, device-free passive localization (DfP) has been
proposed where the tracked entity is neither required to carry devices nor
participate actively in the localization process. DfP systems are based on the
fact that RF signals are affected by the presence of people and objects in the
environment. The DfP concept enables a wide range of applications including
intrusion detection and tracking, border protection, and smart buildings
automation. Previous studies have focused on small areas with direct line of
sight and/or controlled environments. In this paper, we present the design,
implementation and analysis of Nuzzer, a large-scale device-free passive
localization system for real environments.
Without any additional hardware, it makes use of the already installed
wireless data networks to monitor and process changes in the received signal
strength (RSS) transmitted from access points at one or more monitoring points.
We present probabilistic techniques for DfP localization and evaluate their
performance in a typical office building, rich in multipath, with an area of
1500 square meters. Our results show that the Nuzzer system gives device-free
location estimates with less than 2 meters median distance error using only two
monitoring laptops and three access points. This indicates the suitability of
Nuzzer to a large number of application domains.
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2009 15:31:12 GMT"
}
] | 2009-08-07T00:00:00 |
[
[
"Seifeldin",
"Moustafa",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.999487 |
0908.0930
|
Grenville Croll
|
Bill Bekenn, Ray Hooper
|
Some Spreadsheet Poka-Yoke
|
12 Pages, 8 Colour Figures
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2009 83-94
ISBN 978-1-905617-89-0
| null | null |
cs.HC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Whilst not all spreadsheet defects are structural in nature, poor layout
choices can compromise spreadsheet quality. These defects may be avoided at the
development stage by some simple mistake prevention and detection devices.
Poka-Yoke (Japanese for Mistake Proofing), which owes its genesis to the Toyota
Production System (the standard for manufacturing excellence throughout the
world) offers some principles that may be applied to reducing spreadsheet
defects. In this paper we examine spreadsheet structure and how it can lead to
defects and illustrate some basic spreadsheet Poka-Yokes to reduce them. These
include guidelines on how to arrange areas of cells so that whole rows and
columns can be inserted anywhere without causing errors, and rules for when to
use relative and absolute references with respect to what type of area is being
referred to.
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2009 18:41:34 GMT"
}
] | 2009-08-07T00:00:00 |
[
[
"Bekenn",
"Bill",
""
],
[
"Hooper",
"Ray",
""
]
] |
new_dataset
| 0.991887 |
0901.0118
|
Jubin Jose
|
Jubin Jose, Lei Ying, Sriram Vishwanath
|
On the Stability Region of Amplify-and-Forward Cooperative Relay
Networks
|
accepted for presentation at ITW 2009, Taormina, Sicily
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers an amplify-and-forward relay network with fading states.
Amplify-and-forward scheme (along with its variations) is the core mechanism
for enabling cooperative communication in wireless networks, and hence
understanding the network stability region under amplify-and-forward scheme is
very important. However, in a relay network employing amplify-and-forward, the
interaction between nodes is described in terms of real-valued ``packets''
(signals) instead of discrete packets (bits). This restrains the relay nodes
from re-encoding the packets at desired rates. Hence, the stability analysis
for relay networks employing amplify-and-forward scheme is by no means a
straightforward extension of that in packet-based networks. In this paper, the
stability region of a four-node relay network is characterized, and a simple
throughput optimal algorithm with joint scheduling and rate allocation is
proposed.
|
[
{
"version": "v1",
"created": "Wed, 31 Dec 2008 17:00:12 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Aug 2009 06:02:12 GMT"
}
] | 2009-08-06T00:00:00 |
[
[
"Jose",
"Jubin",
""
],
[
"Ying",
"Lei",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.953319 |
0908.0697
|
Christian Wulff-Nilsen
|
Christian Wulff-Nilsen
|
Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time
|
8 pages, no figures, zip file containing tex and pdf file
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The girth of a graph is the length of its shortest cycle. We give an
algorithm that computes in O(n(log n)^3) time and O(n) space the (weighted)
girth of an n-vertex planar digraph with arbitrary real edge weights. This is
an improvement of a previous time bound of O(n^(3/2)), a bound which was only
valid for non-negative edge-weights. Our algorithm can be modified to output a
shortest cycle within the same time and space bounds if such a cycle exists.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2009 15:59:23 GMT"
}
] | 2009-08-06T00:00:00 |
[
[
"Wulff-Nilsen",
"Christian",
""
]
] |
new_dataset
| 0.99773 |
0903.4207
|
G David Forney Jr.
|
G. David Forney Jr
|
MacWilliams Identities for Codes on Graphs
|
5 pages, 2 figures; final version to be presented at IEEE Information
Theory Workshop, Taormina, Sicily, Oct. 11-16, 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MacWilliams identity for linear time-invariant convolutional codes that
has recently been found by Gluesing-Luerssen and Schneider is proved concisely,
and generalized to arbitrary group codes on graphs. A similar development
yields a short, transparent proof of the dual sum-product update rule.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2009 21:56:54 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Aug 2009 15:42:21 GMT"
}
] | 2009-08-04T00:00:00 |
[
[
"Forney",
"G. David",
"Jr"
]
] |
new_dataset
| 0.991361 |
0908.0080
|
R Doomun
|
Manas Paul, Tanmay Bhattacharya, Suvajit Pal, Ranit Saha
|
A Novel Generic Session Based Bit Level Encryption Technique to Enhance
Information Security
|
7 Pages, International Journal of Computer Science and Information
Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 3, No. 1, July 2009, USA
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
- In this paper a session based symmetric key encryption system has been
proposed and is termed as Permutated Cipher Technique (PCT). This technique is
more fast, suitable and secure for larger files. In this technique the input
file is broken down into blocks of various sizes (of 2 power n order) and
encrypted by shifting the position of each bit by a certain value for a certain
number of times. A key is generated randomly wherein the length of each block
is determined. Each block length generates a unique value of number of bits to
be skipped. This value determines the new position of the bits within the block
that are to be shifted. After the shifting and inverting each block is XORed
with SHA 512 digest of the key. The resultant blocks from the cipher text. The
key is generated according to the binary value of the input file size.
Decryption is done following the same process as the technique is symmetric.
|
[
{
"version": "v1",
"created": "Sat, 1 Aug 2009 13:53:00 GMT"
}
] | 2009-08-04T00:00:00 |
[
[
"Paul",
"Manas",
""
],
[
"Bhattacharya",
"Tanmay",
""
],
[
"Pal",
"Suvajit",
""
],
[
"Saha",
"Ranit",
""
]
] |
new_dataset
| 0.959918 |
0908.0175
|
Alex Stewart
|
Alex A. Stewart and Marta F. Antoszkiewicz
|
BGP Route Analysis and Management Systems
|
IEEE Proceedings of 5th International Conference on Information
Technology
| null | null |
ITNG'08
|
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Border Gateway Protocol (BGP) is an important component in today's IP
network infrastructure. As the main routing protocol of the Internet, clear
understanding of its dynamics is crucial for configuring, diagnosing and
debugging Internet routing problems. Despite the increase in the services that
BGP provide such as MPLS VPNs, there is no much progress achieved in automating
the BGP management tasks. In this paper we discuss some of the problems
encountered by network engineers when managing BGP networks. We also describe
some of the open source tools and methods that attempt to resolve these issues.
Then we present some of the features that, if implemented, will ease BGP
management related tasks.
|
[
{
"version": "v1",
"created": "Mon, 3 Aug 2009 01:53:06 GMT"
}
] | 2009-08-04T00:00:00 |
[
[
"Stewart",
"Alex A.",
""
],
[
"Antoszkiewicz",
"Marta F.",
""
]
] |
new_dataset
| 0.983971 |
0908.0221
|
R Doomun
|
Shilpa Kale, S. S. Shriramwar
|
FPGA-based Controller for a Mobile Robot
|
5 Pages IEEE Format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423
|
International Journal of Computer Science and Information
Security, IJCSIS July 2009, Vol. 3, No. 1, USA
| null | null |
cs.RO cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With application in the robotics and automation, more and more it becomes
necessary the development of applications based on methodologies that
facilitate future modifications, updates and enhancements in the original
projected system. This project presents a conception of mobile robots using
rapid prototyping, distributing the several control actions in growing levels
of complexity and computing proposal oriented to embed systems implementation.
This kind of controller can be tested on different platform representing the
mobile robots using reprogrammable logic components (FPGA). This mobile robot
will detect obstacle and also be able to control the speed. Different modules
will be Actuators, Sensors, wireless transmission. All this modules will be
interfaced using FPGA controller. I would like to construct a mechanically
simple robot model, which can measure the distance from obstacle with the aid
of sensor and accordingly should able to control the speed of motor. I would
like to construct a mechanically simple robot model, which can measure the
distance from obstacle with the aid of sensor and accordingly should able to
control the speed of motor.
|
[
{
"version": "v1",
"created": "Mon, 3 Aug 2009 10:30:55 GMT"
}
] | 2009-08-04T00:00:00 |
[
[
"Kale",
"Shilpa",
""
],
[
"Shriramwar",
"S. S.",
""
]
] |
new_dataset
| 0.999653 |
0907.5441
|
R Doomun
|
B.Narasimhan, S.Santhosh baboo
|
A Hop-by-Hop Congestion-Aware Routing Protocol for Heterogeneous Mobile
Ad-hoc Networks
|
7 pages, International Journal of Computer Science and Information
Security, ISSN 1947 5500, Impact Factor 0.423
|
International Journal of Computer Science and Information
Security, IJCSIS, July 2009, Volume 3. No.1, USA
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Heterogeneous mobile ad hoc networks (MANETs) congestion occurs with
limited resources. Due to the shared wireless channel and dynamic topology,
packet transmissions suffer from interference and fading. In heterogeneous ad
hoc networks, throughput via a given route is depending on the minimum data
rate of all its links. In a route of links with various data rates, if a high
data rate node forwards more traffic to a low data rate node, there is a chance
of congestion, which leads to long queuing delays in such routes. Since hop
count is used as a routing metric in traditional routing, it do not adapt well
to mobile nodes. A congestion-aware routing metric for MANETs should
incorporate transmission capability, reliability, and congestion around a link.
In this paper, we propose to develop a hop-by-hop congestion aware routing
protocol which employs a combined weight value as a routing metric, based on
the data rate, queuing delay, link quality and MAC overhead. Among the
discovered routes, the route with minimum cost index is selected, which is
based on the node weight of all the in-network nodes. Simulation results prove
that our proposed routing protocol attains high throughput and packet delivery
ratio, by reducing the packet drop and delay.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2009 22:31:08 GMT"
}
] | 2009-08-03T00:00:00 |
[
[
"Narasimhan",
"B.",
""
],
[
"baboo",
"S. Santhosh",
""
]
] |
new_dataset
| 0.993395 |
0907.5474
|
Kevin Wortman
|
David Eppstein and Kevin A. Wortman
|
Optimal Angular Resolution for Face-Symmetric Drawings
|
10 pages, 6 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G be a graph that may be drawn in the plane in such a way that all
internal faces are centrally symmetric convex polygons. We show how to find a
drawing of this type that maximizes the angular resolution of the drawing, the
minimum angle between any two incident edges, in polynomial time, by reducing
the problem to one of finding parametric shortest paths in an auxiliary graph.
The running time is at most O(t^3), where t is a parameter of the input graph
that is at most O(n) but is more typically proportional to n^.5.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2009 06:27:19 GMT"
}
] | 2009-08-03T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Wortman",
"Kevin A.",
""
]
] |
new_dataset
| 0.994537 |
0907.5481
|
Yong Gao
|
Yong Gao
|
Treewidth of Erd\"{o}s-R\'{e}nyi Random Graphs, Random Intersection
Graphs, and Scale-Free Random Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the treewidth of an Erd\"{o}s-R\'{e}nyi random graph $\rg{n,
m}$ is, with high probability, greater than $\beta n$ for some constant $\beta
> 0$ if the edge/vertex ratio $\frac{m}{n}$ is greater than 1.073. Our lower
bound $\frac{m}{n} > 1.073$ improves the only previously-known lower bound. We
also study the treewidth of random graphs under two other random models for
large-scale complex networks. In particular, our result on the treewidth of
\rigs strengths a previous observation on the average-case behavior of the
\textit{gate matrix layout} problem. For scale-free random graphs based on the
Barab\'{a}si-Albert preferential-attachment model, our result shows that if
more than 12 vertices are attached to a new vertex, then the treewidth of the
obtained network is linear in the size of the network with high probability.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2009 08:17:58 GMT"
}
] | 2009-08-03T00:00:00 |
[
[
"Gao",
"Yong",
""
]
] |
new_dataset
| 0.994673 |
0903.4366
|
Dimitri Hendriks
|
Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks
|
Complexity of Fractran and Productivity
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In functional programming languages the use of infinite structures is common
practice. For total correctness of programs dealing with infinite structures
one must guarantee that every finite part of the result can be evaluated in
finitely many steps. This is known as productivity. For programming with
infinite structures, productivity is what termination in well-defined results
is for programming with finite structures.
Fractran is a simple Turing-complete programming language invented by Conway.
We prove that the question whether a Fractran program halts on all positive
integers is Pi^0_2-complete. In functional programming, productivity typically
is a property of individual terms with respect to the inbuilt evaluation
strategy. By encoding Fractran programs as specifications of infinite lists, we
establish that this notion of productivity is Pi^0_2-complete even for the most
simple specifications. Therefore it is harder than termination of individual
terms. In addition, we explore possible generalisations of the notion of
productivity in the framework of term rewriting, and prove that their
computational complexity is Pi^1_1-complete, thus exceeding the expressive
power of first-order logic.
|
[
{
"version": "v1",
"created": "Wed, 25 Mar 2009 15:14:00 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jun 2009 10:05:41 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Jul 2009 18:33:42 GMT"
}
] | 2009-07-31T00:00:00 |
[
[
"Endrullis",
"Joerg",
""
],
[
"Grabmayer",
"Clemens",
""
],
[
"Hendriks",
"Dimitri",
""
]
] |
new_dataset
| 0.971334 |
0907.5372
|
Barry Wittman
|
Greg N. Frederickson, Barry Wittman
|
Speedup in the Traveling Repairman Problem with Unit Time Windows
|
16 pages, 3 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The input to the unrooted traveling repairman problem is an undirected metric
graph and a subset of nodes, each of which has a time window of unit length.
Given that a repairman can start at any location, the goal is to plan a route
that visits as many nodes as possible during their respective time windows. A
polynomial-time bicriteria approximation algorithm is presented for this
problem, gaining an increased fraction of repairman visits for increased
speedup of repairman motion. For speedup $s$, we find a $6\gamma/(s +
1)$-approximation for $s$ in the range $1 \leq s \leq 2$ and a
$4\gamma/s$-approximation for $s$ in the range $2 \leq s \leq 4$, where $\gamma
= 1$ on tree-shaped networks and $\gamma = 2 + \epsilon$ on general metric
graphs.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2009 16:30:15 GMT"
}
] | 2009-07-31T00:00:00 |
[
[
"Frederickson",
"Greg N.",
""
],
[
"Wittman",
"Barry",
""
]
] |
new_dataset
| 0.996126 |
0907.5111
|
EPTCS
|
Franziska Biegler, Mark Daley, Ian McQuillan
|
On the Shuffle Automaton Size for Words
| null |
EPTCS 3, 2009, pp. 79-89
|
10.4204/EPTCS.3.7
| null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the state size of DFAs accepting the shuffle of two words. We
provide words u and v, such that the minimal DFA for u shuffled with v requires
an exponential number of states. We also show some conditions for the words u
and v which ensure a quadratic upper bound on the state size of u shuffled with
v. Moreover, switching only two letters within one of u or v is enough to
trigger the change from quadratic to exponential.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2009 13:11:50 GMT"
}
] | 2009-07-30T00:00:00 |
[
[
"Biegler",
"Franziska",
""
],
[
"Daley",
"Mark",
""
],
[
"McQuillan",
"Ian",
""
]
] |
new_dataset
| 0.989928 |
0907.5127
|
EPTCS
|
Viliam Geffert, Lubom\'ira I\v{s}to\v{n}ov\'a
|
Translation from Classical Two-Way Automata to Pebble Two-Way Automata
| null |
EPTCS 3, 2009, pp. 131-140
|
10.4204/EPTCS.3.12
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the relation between the standard two-way automata and more powerful
devices, namely, two-way finite automata with an additional "pebble" movable
along the input tape. Similarly as in the case of the classical two-way
machines, it is not known whether there exists a polynomial trade-off, in the
number of states, between the nondeterministic and deterministic pebble two-way
automata. However, we show that these two machine models are not independent:
if there exists a polynomial trade-off for the classical two-way automata, then
there must also exist a polynomial trade-off for the pebble two-way automata.
Thus, we have an upward collapse (or a downward separation) from the classical
two-way automata to more powerful pebble automata, still staying within the
class of regular languages. The same upward collapse holds for complementation
of nondeterministic two-way machines.
These results are obtained by showing that each pebble machine can be, by
using suitable inputs, simulated by a classical two-way automaton with a linear
number of states (and vice versa), despite the existing exponential blow-up
between the classical and pebble two-way machines.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2009 13:39:09 GMT"
}
] | 2009-07-30T00:00:00 |
[
[
"Geffert",
"Viliam",
""
],
[
"Ištoňová",
"Lubomíra",
""
]
] |
new_dataset
| 0.990166 |
0907.5128
|
EPTCS
|
Martin Kutrib, Andreas Malcher
|
Bounded Languages Meet Cellular Automata with Sparse Communication
| null |
EPTCS 3, 2009, pp. 163-172
|
10.4204/EPTCS.3.15
| null |
cs.FL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cellular automata are one-dimensional arrays of interconnected interacting
finite automata. We investigate one of the weakest classes, the real-time
one-way cellular automata, and impose an additional restriction on their
inter-cell communication by bounding the number of allowed uses of the links
between cells. Moreover, we consider the devices as acceptors for bounded
languages in order to explore the borderline at which non-trivial decidability
problems of cellular automata classes become decidable. It is shown that even
devices with drastically reduced communication, that is, each two neighboring
cells may communicate only constantly often, accept bounded languages that are
not semilinear. If the number of communications is at least logarithmic in the
length of the input, several problems are undecidable. The same result is
obtained for classes where the total number of communications during a
computation is linearly bounded.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2009 13:52:28 GMT"
}
] | 2009-07-30T00:00:00 |
[
[
"Kutrib",
"Martin",
""
],
[
"Malcher",
"Andreas",
""
]
] |
new_dataset
| 0.996393 |
0907.4810
|
Robert Grossman
|
Robert Grossman, Yunhong Gu, Michal Sabala, Collin Bennet, Jonathan
Seidman and Joe Mambratti
|
The Open Cloud Testbed: A Wide Area Testbed for Cloud Computing
Utilizing High Performance Network Services
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, a number of cloud platforms and services have been developed for
data intensive computing, including Hadoop, Sector, CloudStore (formerly KFS),
HBase, and Thrift. In order to benchmark the performance of these systems, to
investigate their interoperability, and to experiment with new services based
on flexible compute node and network provisioning capabilities, we have
designed and implemented a large scale testbed called the Open Cloud Testbed
(OCT). Currently the OCT has 120 nodes in four data centers: Baltimore, Chicago
(two locations), and San Diego. In contrast to other cloud testbeds, which are
in small geographic areas and which are based on commodity Internet services,
the OCT is a wide area testbed and the four data centers are connected with a
high performance 10Gb/s network, based on a foundation of dedicated lightpaths.
This testbed can address the requirements of extremely large data streams that
challenge other types of distributed infrastructure. We have also developed
several utilities to support the development of cloud computing systems and
services, including novel node and network provisioning services, a monitoring
system, and a RPC system. In this paper, we describe the OCT architecture and
monitoring system. We also describe some benchmarks that we developed and some
interoperability studies we performed using these benchmarks.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2009 00:54:23 GMT"
}
] | 2009-07-29T00:00:00 |
[
[
"Grossman",
"Robert",
""
],
[
"Gu",
"Yunhong",
""
],
[
"Sabala",
"Michal",
""
],
[
"Bennet",
"Collin",
""
],
[
"Seidman",
"Jonathan",
""
],
[
"Mambratti",
"Joe",
""
]
] |
new_dataset
| 0.999628 |
0907.4877
|
Liang Xiao
|
Liang Xiao, Larry Greenstein, Narayan Mandayam, Wade Trappe
|
Fingerprints in the Ether: Using the Physical Layer for Wireless
Authentication
|
5 pages, 10 figures, ICC
|
ICC, pp. 4646-4651, Glasgow, Scotland, Jun. 2007
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The wireless medium contains domain-specific information that can be used to
complement and enhance traditional security mechanisms. In this paper we
propose ways to exploit the fact that, in a typically rich scattering
environment, the radio channel response decorrelates quite rapidly in space.
Specifically, we describe a physical-layer algorithm that combines channel
probing (M complex frequency response samples over a bandwidth W) with
hypothesis testing to determine whether current and prior communication
attempts are made by the same user (same channel response). In this way,
legitimate users can be reliably authenticated and false users can be reliably
detected. To evaluate the feasibility of our algorithm, we simulate spatially
variable channel responses in real environments using the WiSE ray-tracing
tool; and we analyze the ability of a receiver to discriminate between
transmitters (users) based on their channel frequency responses in a given
office environment. For several rooms in the extremities of the building we
considered, we have confirmed the efficacy of our approach under static channel
conditions. For example, measuring five frequency response samples over a
bandwidth of 100 MHz and using a transmit power of 100 mW, valid users can be
verified with 99% confidence while rejecting false users with greater than 95%
confidence.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2009 12:53:17 GMT"
}
] | 2009-07-29T00:00:00 |
[
[
"Xiao",
"Liang",
""
],
[
"Greenstein",
"Larry",
""
],
[
"Mandayam",
"Narayan",
""
],
[
"Trappe",
"Wade",
""
]
] |
new_dataset
| 0.997939 |
0907.4908
|
Liang Xiao
|
Liang Xiao, Larry Greenstein, Narayan Mandayam, Wade Trappe
|
MIMO-Assisted Channel-Based Authentication in Wireless Networks
|
5 pages, 6 figures, CISS
|
Proc. Conference on Information Sciences and Systems (CISS), pp.
642-646, Princeton, NJ, Mar. 2008
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple-input multiple-output (MIMO) techniques allow for multiplexing
and/or diversity gain, and will be widely deployed in future wireless systems.
In this paper, we propose a MIMO-assisted channel-based authentication scheme,
exploiting current channel estimation mechanisms in MIMO systems to detect
spoofing attacks with very low overhead. In this scheme, the use of multiple
antennas provides extra dimensions of channel estimation data, and thus leads
to a "security gain" over single-input single-output (SISO) systems. We
investigate the security gain of MIMO systems in several system configurations
via simulations for a specific real indoor environment using ray-tracing
software. We also discuss the effect of increasing the number of transmit and
receive antennas on the security gain and contrast that to the
diversity/multiplexing gain.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2009 13:04:44 GMT"
}
] | 2009-07-29T00:00:00 |
[
[
"Xiao",
"Liang",
""
],
[
"Greenstein",
"Larry",
""
],
[
"Mandayam",
"Narayan",
""
],
[
"Trappe",
"Wade",
""
]
] |
new_dataset
| 0.99939 |
0907.4960
|
Muthiah Annamalai
|
Muthiah Annamalai
|
Ezhil: A Tamil Programming Language
|
6 pages, Tamil UTF-8 characters
| null | null | null |
cs.PL cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
Ezhil is a Tamil language based interpreted procedural programming language.
Tamil keywords and grammar are chosen to make the native Tamil speaker write
programs in the Ezhil system. Ezhil allows easy representation of computer
program closer to the Tamil language logical constructs equivalent to the
conditional, branch and loop statements in modern English based programming
languages. Ezhil is a compact programming language aimed towards Tamil speaking
novice computer users. Grammar for Ezhil and a few example programs are
reported here, from the initial proof-of-concept implementation using the
Python programming language1. To the best of our knowledge, Ezhil language is
the first freely available Tamil programming language.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2009 19:24:51 GMT"
}
] | 2009-07-29T00:00:00 |
[
[
"Annamalai",
"Muthiah",
""
]
] |
new_dataset
| 0.999775 |
0907.4622
|
Rajkumar Buyya
|
Christian Vecchiola, Xingchen Chu, and Rajkumar Buyya
|
Aneka: A Software Platform for .NET-based Cloud Computing
|
30 pages, 10 figures
| null | null |
GRIDS-TR-2009-4, Grid Computing and Distributed Systems Laboratory,
The University of Melbourne, Australia, May 25, 2009
|
cs.DC cs.CE cs.NI cs.OS cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Aneka is a platform for deploying Clouds developing applications on top of
it. It provides a runtime environment and a set of APIs that allow developers
to build .NET applications that leverage their computation on either public or
private clouds. One of the key features of Aneka is the ability of supporting
multiple programming models that are ways of expressing the execution logic of
applications by using specific abstractions. This is accomplished by creating a
customizable and extensible service oriented runtime environment represented by
a collection of software containers connected together. By leveraging on these
architecture advanced services including resource reservation, persistence,
storage management, security, and performance monitoring have been implemented.
On top of this infrastructure different programming models can be plugged to
provide support for different scenarios as demonstrated by the engineering,
life science, and industry applications.
|
[
{
"version": "v1",
"created": "Sun, 26 Jul 2009 02:19:42 GMT"
}
] | 2009-07-28T00:00:00 |
[
[
"Vecchiola",
"Christian",
""
],
[
"Chu",
"Xingchen",
""
],
[
"Buyya",
"Rajkumar",
""
]
] |
new_dataset
| 0.999372 |
0906.2446
|
Serguei Mokhov
|
Marc-Andr\'e Laverdi\`ere, Serguei A. Mokhov, Suhasini Tsapa, and
Djamel Benredjem
|
Ftklipse - Design and Implementation of an Extendable Computer Forensics
Environment: Software Requirements Specification Document
|
SRS project document of an open-source project; 25 pages; 4 figures;
from April 2006; v2 adds missing .ind file for the index
| null | null | null |
cs.CR cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
The purpose behind this article is to describe the features of Ftklipse, an
extendable platform for computer forensics. This document designed to provide a
detailed specification for the developers of Ftklipse. Ftklipse is a
thick-client solution for forensics investigation. It is designed to collect
and preserve evidence, to analyze it and to report on it. It supports chain of
custody management, access control policies, and batch operation of its
included tools in order to facilitate and accelerate the investigation. The
environment itself and its tools are configurable as well and is based on
Eclipse.
|
[
{
"version": "v1",
"created": "Sat, 13 Jun 2009 04:46:52 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Jul 2009 04:34:51 GMT"
}
] | 2009-07-27T00:00:00 |
[
[
"Laverdière",
"Marc-André",
""
],
[
"Mokhov",
"Serguei A.",
""
],
[
"Tsapa",
"Suhasini",
""
],
[
"Benredjem",
"Djamel",
""
]
] |
new_dataset
| 0.978945 |
0907.4006
|
Pushkar Joglekar
|
V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
|
Arithmetic Circuits and the Hadamard Product of Polynomials
|
20 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by the Hadamard product of matrices we define the Hadamard product
of multivariate polynomials and study its arithmetic circuit and branching
program complexity. We also give applications and connections to polynomial
identity testing. Our main results are the following. 1. We show that
noncommutative polynomial identity testing for algebraic branching programs
over rationals is complete for the logspace counting class $\ceql$, and over
fields of characteristic $p$ the problem is in $\ModpL/\Poly$. 2.We show an
exponential lower bound for expressing the Raz-Yehudayoff polynomial as the
Hadamard product of two monotone multilinear polynomials. In contrast the
Permanent can be expressed as the Hadamard product of two monotone multilinear
formulas of quadratic size.
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2009 08:52:50 GMT"
}
] | 2009-07-24T00:00:00 |
[
[
"Arvind",
"V.",
""
],
[
"Joglekar",
"Pushkar S.",
""
],
[
"Srinivasan",
"Srikanth",
""
]
] |
new_dataset
| 0.994079 |
0907.4085
|
Amitabh Saxena
|
Amitabh Saxena
|
A Secure Wireless Routing Protocol Using Enhanced Chain Signatures
|
Extended version
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a routing protocol for wireless networks. Wireless routing
protocols allow hosts within a network to have some knowledge of the topology
in order to know when to forward a packet (via broadcast) and when to drop it.
Since a routing protocol forms the backbone of a network, it is a lucrative
target for many attacks, all of which attempt to disrupt network traffic by
corrupting routing tables of neighboring routers using false updates. Secure
routing protocols designed for wired networks (such as S-BGP) are not scalable
in an ad-hoc wireless environment because of two main drawbacks: (1) the need
to maintain knowledge about all immediate neighbors (which requires a discovery
protocol), and (2) the need to transmit the same update several times, one for
each neighbor. Although information about neighbors is readily available in a
fairly static and wired network, such information is often not updated or
available in an ad-hoc wireless network with mobile devices. Our protocol is a
variant of S-BGP called SS-BGP and allows a single broadcast for routing
updates without having the need to be aware of every neighboring router. The
protocol is based on a novel authentication primitive called Enhanced Chain
Signatures (ECS).
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2009 14:47:31 GMT"
}
] | 2009-07-24T00:00:00 |
[
[
"Saxena",
"Amitabh",
""
]
] |
new_dataset
| 0.999463 |
0907.3781
|
Stephanie Leon
|
St\'ephanie L\'eon (LIRMM)
|
Un syst\`eme modulaire d'acquisition automatique de traductions \`a
partir du Web
| null |
TALN'09 (Traitement Automatique des Langues Naturelles), France
(2009)
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method of automatic translation (French/English) of Complex
Lexical Units (CLU) for aiming at extracting a bilingual lexicon. Our modular
system is based on linguistic properties (compositionality, polysemy, etc.).
Different aspects of the multilingual Web are used to validate candidate
translations and collect new terms. We first build a French corpus of Web pages
to collect CLU. Three adapted processing stages are applied for each linguistic
property : compositional and non polysemous translations, compositional
polysemous translations and non compositional translations. Our evaluation on a
sample of CLU shows that our technique based on the Web can reach a very high
precision.
|
[
{
"version": "v1",
"created": "Wed, 22 Jul 2009 06:25:59 GMT"
}
] | 2009-07-23T00:00:00 |
[
[
"Léon",
"Stéphanie",
"",
"LIRMM"
]
] |
new_dataset
| 0.990916 |
0907.3826
|
Takao Namiki
|
Takao Namiki, Hiraku Kuroda and Shunsuke Naruse
|
Experimental DML over digital repositories in Japan
| null |
Proceedings of Towards a Digital Mathematics Library 2009, Grand
Bend, Ontario, Canada (2009)
| null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper the authors show an overview of Virtual Digital Mathematics
Library in Japan (DML-JP), contents of which consist of metadata harvested from
institutional repositories in Japan and digital repositories in the world.
DML-JP is, in a sense, a subject specific repository which collaborate with
various digital repositories. Beyond portal website, DML-JP provides
subject-specific metadata through OAI-ORE. By the schema it is enabled that
digital repositories can load the rich metadata which were added by
mathematicians.
|
[
{
"version": "v1",
"created": "Wed, 22 Jul 2009 12:40:35 GMT"
}
] | 2009-07-23T00:00:00 |
[
[
"Namiki",
"Takao",
""
],
[
"Kuroda",
"Hiraku",
""
],
[
"Naruse",
"Shunsuke",
""
]
] |
new_dataset
| 0.998832 |
0907.3291
|
Satish Babu Korada
|
S. Hamed Hassani, Satish Babu Korada, Ruediger Urbanke
|
The Compound Capacity of Polar Codes
|
5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the compound capacity of polar codes under successive
cancellation decoding for a collection of binary-input memoryless
output-symmetric channels. By deriving a sequence of upper and lower bounds, we
show that in general the compound capacity under successive decoding is
strictly smaller than the unrestricted compound capacity.
|
[
{
"version": "v1",
"created": "Sun, 19 Jul 2009 14:27:01 GMT"
}
] | 2009-07-21T00:00:00 |
[
[
"Hassani",
"S. Hamed",
""
],
[
"Korada",
"Satish Babu",
""
],
[
"Urbanke",
"Ruediger",
""
]
] |
new_dataset
| 0.999002 |
0907.2929
|
Hassan Gobjuka
|
Hassan Gobjuka
|
4G Wireless Networks: Opportunities and Challenges
| null | null | null |
VZ-TR-G1005309
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the major wireless service providers planning to start deployment of 4G
wireless networks by mid 2010, research and industry communities are racing
against time to find solutions for some of the prominent still open issues in
4G networks. The growing interest in 4G networks is driven by the set of new
services will be made available for the first time such as accessing the
Internet anytime from anywhere, global roaming, and wider support for
multimedia applications. In this paper describe some of the key opportunities
will be made available by 4G networks, present key challenges and point to some
proposed solutions.
|
[
{
"version": "v1",
"created": "Thu, 16 Jul 2009 20:16:02 GMT"
}
] | 2009-07-20T00:00:00 |
[
[
"Gobjuka",
"Hassan",
""
]
] |
new_dataset
| 0.99143 |
0907.3019
|
Dana Fisman
|
Dana Fisman, Orna Kupferman and Yoad Lustig
|
Rational Synthesis
|
14 pages
| null | null | null |
cs.LO cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synthesis is the automated construction of a system from its specification.
The system has to satisfy its specification in all possible environments.
Modern systems often interact with other systems, or agents. Many times these
agents have objectives of their own, other than to fail the system. Thus, it
makes sense to model system environments not as hostile, but as composed of
rational agents; i.e., agents that act to achieve their own objectives. We
introduce the problem of synthesis in the context of rational agents (rational
synthesis, for short). The input consists of a temporal-logic formula
specifying the system and temporal-logic formulas specifying the objectives of
the agents. The output is an implementation T of the system and a profile of
strategies, suggesting a behavior for each of the agents. The output should
satisfy two conditions. First, the composition of T with the strategy profile
should satisfy the specification. Second, the strategy profile should be an
equilibria in the sense that, in view of their objectives, agents have no
incentive to deviate from the strategies assigned to them. We solve the
rational-synthesis problem for various definitions of equilibria studied in
game theory. We also consider the multi-valued case in which the objectives of
the system and the agents are still temporal logic formulas, but involve
payoffs from a finite lattice.
|
[
{
"version": "v1",
"created": "Fri, 17 Jul 2009 08:51:23 GMT"
}
] | 2009-07-20T00:00:00 |
[
[
"Fisman",
"Dana",
""
],
[
"Kupferman",
"Orna",
""
],
[
"Lustig",
"Yoad",
""
]
] |
new_dataset
| 0.999765 |
0907.3045
|
Abdelkader Lahmadi
|
Abdelkader Lahmadi (INRIA Lorraine - LORIA), Olivier Festor (INRIA
Lorraine - LORIA)
|
SecSip: A Stateful Firewall for SIP-based Networks
| null |
11th IFIP/IEEE International Symposium on Integrated Network
Management (2009)
| null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SIP-based networks are becoming the de-facto standard for voice, video and
instant messaging services. Being exposed to many threats while playing an
major role in the operation of essential services, the need for dedicated
security management approaches is rapidly increasing. In this paper we present
an original security management approach based on a specific vulnerability
aware SIP stateful firewall. Through known attack descriptions, we illustrate
the power of the configuration language of the firewall which uses the
capability to specify stateful objects that track data from multiple SIP
elements within their lifetime. We demonstrate through measurements on a real
implementation of the firewall its efficiency and performance.
|
[
{
"version": "v1",
"created": "Fri, 17 Jul 2009 11:28:11 GMT"
}
] | 2009-07-20T00:00:00 |
[
[
"Lahmadi",
"Abdelkader",
"",
"INRIA Lorraine - LORIA"
],
[
"Festor",
"Olivier",
"",
"INRIA\n Lorraine - LORIA"
]
] |
new_dataset
| 0.999328 |
0907.2859
|
Sheng-Yuan Tu
|
Sheng-Yuan Tu and Kwang-Cheng Chen
|
General Spectrum Sensing in Cognitive Radio Networks
|
26 pages, 7 figures, 47 references, submitted to IEEE Trans. on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The successful operation of cognitive radio (CR) between CR transmitter and
CR receiver (CR link) relies on reliable spectrum sensing. To network CRs
requires spectrum sensing at CR transmitter and further information regarding
the spectrum availability at CR receiver. Redefining the spectrum sensing along
with statistical inference suitable for cognitive radio networks (CRN), we
mathematically derive conditions to allow CR transmitter forwarding packets to
CR receiver under guaranteed outage probability, and prove that the correlation
of localized spectrum availability between a cooperative node and CR receiver
determines effectiveness of the cooperative scheme. Applying our novel
mathematical model to potential hidden terminals in CRN, we illustrate that the
allowable transmission region of a CR, defined as neighborhood, is no longer
circular shape even in a pure path loss channel model. This results in
asymmetric CR links to make bidirectional links generally inappropriate in CRN,
though this challenge can be alleviated by cooperative sensing. Therefore,
spectrum sensing capability determines CRN topology. For multiple cooperative
nodes, to fully utilize spectrum availability, the selection methodology of
cooperative nodes is developed due to limited overhead of information exchange.
Defining reliability as information of spectrum availability at CR receiver
provided by a cooperative node and by applying neighborhood area, we can
compare sensing capability of cooperative nodes from both link and network
perspectives. In addition, due to lack of centralized coordination in dynamic
CRN, CRs can only acquire local and partial information within limited sensing
duration, robust spectrum sensing is therefore proposed. Limits of cooperative
schemes and their impacts on network operation are also derived.
|
[
{
"version": "v1",
"created": "Thu, 16 Jul 2009 15:04:15 GMT"
}
] | 2009-07-17T00:00:00 |
[
[
"Tu",
"Sheng-Yuan",
""
],
[
"Chen",
"Kwang-Cheng",
""
]
] |
new_dataset
| 0.959799 |
0907.2479
|
Craig Weidert
|
Craig Weidert
|
Extremal problems in ordered graphs
|
Thesis for Master Degree, Simon Fraser University
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this thesis we consider ordered graphs (that is, graphs with a fixed
linear ordering on their vertices). We summarize and further investigations on
the number of edges an ordered graph may have while avoiding a fixed forbidden
ordered graph as a subgraph. In particular, we take a step toward confirming a
conjecture of Pach and Tardos regarding the number of edges allowed when the
forbidden pattern is a tree by establishing an upper bound for a particular
ordered graph for which existing techniques have failed. We also generalize a
theorem of Geneson by establishing an upper bound on the number of edges
allowed if the forbidden graphs fit a generalized notion of a matching.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2009 01:37:11 GMT"
}
] | 2009-07-16T00:00:00 |
[
[
"Weidert",
"Craig",
""
]
] |
new_dataset
| 0.997289 |
0907.2627
|
Paul Bonsma
|
Paul Bonsma and Felix Breuer
|
Finding Fullerene Patches in Polynomial Time
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the following question, motivated by the enumeration of
fullerenes. A fullerene patch is a 2-connected plane graph G in which inner
faces have length 5 or 6, non-boundary vertices have degree 3, and boundary
vertices have degree 2 or 3. The degree sequence along the boundary is called
the boundary code of G. We show that the question whether a given sequence S is
a boundary code of some fullerene patch can be answered in polynomial time when
such patches have at most five 5-faces. We conjecture that our algorithm gives
the correct answer for any number of 5-faces, and sketch how to extend the
algorithm to the problem of counting the number of different patches with a
given boundary code.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2009 15:39:00 GMT"
}
] | 2009-07-16T00:00:00 |
[
[
"Bonsma",
"Paul",
""
],
[
"Breuer",
"Felix",
""
]
] |
new_dataset
| 0.992509 |
0907.2682
|
Torleiv Kl{\o}ve
|
Torleiv Kl{\o}ve, Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng
|
Permutation Arrays Under the Chebyshev Distance
|
14 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An (n,d) permutation array (PA) is a set of permutations of length n with the
property that the distance (under some metric) between any two permutations in
the array is at least d. They became popular recently for communication over
power lines. Motivated by an application to flash memories, in this paper the
metric used is the Chebyshev metric. A number of different constructions are
given as well as bounds on the size of such PA.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2009 19:12:58 GMT"
}
] | 2009-07-16T00:00:00 |
[
[
"Kløve",
"Torleiv",
""
],
[
"Lin",
"Te-Tsung",
""
],
[
"Tsai",
"Shi-Chun",
""
],
[
"Tzeng",
"Wen-Guey",
""
]
] |
new_dataset
| 0.985419 |
0808.3881
|
Paul Bonsma
|
Paul Bonsma, Felix Breuer
|
Counting Hexagonal Patches and Independent Sets in Circle Graphs
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A hexagonal patch is a plane graph in which inner faces have length 6, inner
vertices have degree 3, and boundary vertices have degree 2 or 3. We consider
the following counting problem: given a sequence of twos and threes, how many
hexagonal patches exist with this degree sequence along the outer face? This
problem is motivated by the study of benzenoid hydrocarbons and fullerenes in
computational chemistry. We give the first polynomial time algorithm for this
problem. We show that it can be reduced to counting maximum independent sets in
circle graphs, and give a simple and fast algorithm for this problem.
|
[
{
"version": "v1",
"created": "Thu, 28 Aug 2008 10:39:10 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Jul 2009 15:27:00 GMT"
}
] | 2009-07-15T00:00:00 |
[
[
"Bonsma",
"Paul",
""
],
[
"Breuer",
"Felix",
""
]
] |
new_dataset
| 0.999698 |
0907.2315
|
Feng Zhang feng
|
Hu Yupu, Zhang Fengrong and Zhang Yiwei
|
Hard Fault Analysis of Trivium
|
10 pages
| null | null | null |
cs.CR cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Fault analysis is a powerful attack to stream ciphers. Up to now, the major
idea of fault analysis is to simplify the cipher system by injecting some soft
faults. We call it soft fault analysis. As a hardware-oriented stream cipher,
Trivium is weak under soft fault analysis.
In this paper we consider another type of fault analysis of stream cipher,
which is to simplify the cipher system by injecting some hard faults. We call
it hard fault analysis. We present the following results about such attack to
Trivium. In Case 1 with the probability not smaller than 0.2396, the attacker
can obtain 69 bits of 80-bits-key. In Case 2 with the probability not smaller
than 0.2291, the attacker can obtain all of 80-bits-key. In Case 3 with the
probability not smaller than 0.2291, the attacker can partially solve the key.
In Case 4 with non-neglectable probability, the attacker can obtain a
simplified cipher, with smaller number of state bits and slower
non-linearization procedure. In Case 5 with non-neglectable probability, the
attacker can obtain another simplified cipher. Besides, these 5 cases can be
checked out by observing the key-stream.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2009 09:47:02 GMT"
}
] | 2009-07-15T00:00:00 |
[
[
"Yupu",
"Hu",
""
],
[
"Fengrong",
"Zhang",
""
],
[
"Yiwei",
"Zhang",
""
]
] |
new_dataset
| 0.997488 |
0907.2412
|
Edwin Hammerich
|
Edwin Hammerich
|
Design of Pulse Shapes and Digital Filters Based on Gaussian Functions
|
14 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two new pulse shapes for communications are presented. The first pulse shape
is ISI-free and identical with the interpolating function (or ISI-free kernel)
of a reconstruction formula in shift-invariant spaces with Gaussian generator.
Several closed form representations in time and frequency domain are given
including one for an approximation that is particularly simple. The second
pulse shape is the root of the former and obtained by spectral factorization.
As a consequence, shifted versions of it form an orthonormal system in the
Hilbert space of finite-energy signals. The latter pulse shape is described as
the response of an infinite-order digital FIR filter on a Gaussian function as
input signal. Several equivalent versions of the digital filter including their
finite-order approximations are presented. All filters enjoy the property that
explicit formulas for their coefficients and poles are available. The filters
are fully parametrizable with respect to bandwidth and sampling rate of the
digital data.
|
[
{
"version": "v1",
"created": "Tue, 14 Jul 2009 17:12:31 GMT"
}
] | 2009-07-15T00:00:00 |
[
[
"Hammerich",
"Edwin",
""
]
] |
new_dataset
| 0.998956 |
0907.2076
|
Francesco Biscani Ph.D.
|
Francesco Biscani
|
The Piranha algebraic manipulator
|
24 pages, 2 figures
| null | null | null |
cs.SC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper we present a specialised algebraic manipulation package devoted
to Celestial Mechanics. The system, called Piranha, is built on top of a
generic and extensible framework, which allows to treat efficiently and in a
unified way the algebraic structures most commonly encountered in Celestial
Mechanics (such as multivariate polynomials and Poisson series). In this
contribution we explain the architecture of the software, with special focus on
the implementation of series arithmetics, show its current capabilities, and
present benchmarks indicating that Piranha is competitive, performance-wise,
with other specialised manipulators.
|
[
{
"version": "v1",
"created": "Sun, 12 Jul 2009 23:41:03 GMT"
}
] | 2009-07-14T00:00:00 |
[
[
"Biscani",
"Francesco",
""
]
] |
new_dataset
| 0.999792 |
0907.2157
|
Jakub Radoszewski
|
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub
Radoszewski, Wojciech Rytter, Tomasz Walen
|
On the maximal number of highly periodic runs in a string
|
8 pages, 2 figures
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A run is a maximal occurrence of a repetition $v$ with a period $p$ such that
$2p \le |v|$. The maximal number of runs in a string of length $n$ was studied
by several authors and it is known to be between $0.944 n$ and $1.029 n$. We
investigate highly periodic runs, in which the shortest period $p$ satisfies
$3p \le |v|$. We show the upper bound $0.5n$ on the maximal number of such runs
in a string of length $n$ and construct a sequence of words for which we obtain
the lower bound $0.406 n$.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2009 13:29:23 GMT"
}
] | 2009-07-14T00:00:00 |
[
[
"Crochemore",
"Maxime",
""
],
[
"Iliopoulos",
"Costas",
""
],
[
"Kubica",
"Marcin",
""
],
[
"Radoszewski",
"Jakub",
""
],
[
"Rytter",
"Wojciech",
""
],
[
"Walen",
"Tomasz",
""
]
] |
new_dataset
| 0.957076 |
0907.1788
|
Alexandre Soro
|
Alexandre Soro, Jerome Lacan
|
FNT-based Reed-Solomon Erasure Codes
|
submitted in CCNC'10
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new construction of Maximum-Distance Separable (MDS)
Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to
FNT, these codes support practical coding and decoding algorithms with
complexity O(n log n), where n is the number of symbols of a codeword. An
open-source implementation shows that the encoding speed can reach 150Mbps for
codes of length up to several 10,000s of symbols. These codes can be used as
the basic component of the Information Dispersal Algorithm (IDA) system used in
a several P2P systems.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2009 12:02:11 GMT"
}
] | 2009-07-13T00:00:00 |
[
[
"Soro",
"Alexandre",
""
],
[
"Lacan",
"Jerome",
""
]
] |
new_dataset
| 0.998977 |
0907.1839
|
Michael Palmer
|
Michael E. Palmer, Daniel B. Miller
|
An Evolved Neural Controller for Bipdedal Walking with Dynamic Balance
|
6 pages, 7 figures. In Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO) 2009, Montreal
|
Palmer, M.E. and Miller, D.B. An Evolved Neural Controller for
Bipdedal Walking with Dynamic Balance. In Proceedings of the Genetic and
Evolutionary Computation Conference (GECCO) 2009, Montreal, July 8-12, 2009
| null | null |
cs.NE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We successfully evolved a neural network controller that produces dynamic
walking in a simulated bipedal robot with compliant actuators, a difficult
control problem. The evolutionary evaluation uses a detailed software
simulation of a physical robot. We describe: 1) a novel theoretical method to
encourage populations to evolve "around" local optima, which employs multiple
demes and fitness functions of progressively increasing difficulty, and 2) the
novel genetic representation of the neural controller.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2009 15:21:56 GMT"
}
] | 2009-07-13T00:00:00 |
[
[
"Palmer",
"Michael E.",
""
],
[
"Miller",
"Daniel B.",
""
]
] |
new_dataset
| 0.978224 |
0807.2666
|
Deniz Gunduz
|
Deniz Gunduz, Elza Erkip, Andrea Goldsmith, H. Vincent Poor
|
Source and Channel Coding for Correlated Sources Over Multiuser Channels
|
Revised version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Source and channel coding over multiuser channels in which receivers have
access to correlated source side information is considered. For several
multiuser channel models necessary and sufficient conditions for optimal
separation of the source and channel codes are obtained. In particular, the
multiple access channel, the compound multiple access channel, the interference
channel and the two-way channel with correlated sources and correlated receiver
side information are considered, and the optimality of separation is shown to
hold for certain source and side information structures. Interestingly, the
optimal separate source and channel codes identified for these models are not
necessarily the optimal codes for the underlying source coding or the channel
coding problems. In other words, while separation of the source and channel
codes is optimal, the nature of these optimal codes is impacted by the joint
design criterion.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2008 21:39:11 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2009 18:07:49 GMT"
}
] | 2009-07-09T00:00:00 |
[
[
"Gunduz",
"Deniz",
""
],
[
"Erkip",
"Elza",
""
],
[
"Goldsmith",
"Andrea",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.987204 |
0907.1227
|
Tzipora Halevi
|
Tzipora Halevi, Nitesh Saxena and Shai Halevi
|
Using HB Family of Protocols for Privacy-Preserving Authentication of
RFID Tags in a Population
|
15 pages, 1 figure, presented at RFIDSec 09
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an HB-like protocol for privacy-preserving
authentication of RFID tags, whereby a tag can remain anonymous and untraceable
to an adversary during the authentication process. Previous proposals of such
protocols were based on PRF computations. Our protocol can instead be used on
low-cost tags that may be incapable of computing standard PRFs. Moreover, since
the underlying computations in HB protocols are very efficient, our protocol
also reduces reader load compared to PRF-based protocols.
We suggest a tree-based approach that replaces the PRF-based authentication
from prior work with a procedure such as HB+ or HB#. We optimize the tree-
traversal stage through usage of a "light version" of the underlying protocol
and shared random challenges across all levels of the tree. This provides
significant reduction of the communication resources, resulting in a
privacy-preserving protocol almost as efficient as the underlying HB+ or HB#
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2009 14:26:50 GMT"
}
] | 2009-07-08T00:00:00 |
[
[
"Halevi",
"Tzipora",
""
],
[
"Saxena",
"Nitesh",
""
],
[
"Halevi",
"Shai",
""
]
] |
new_dataset
| 0.994224 |
cs/0604034
|
David Eppstein
|
David Eppstein
|
Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants
Decomposition
|
22 pages, 14 figures. This version replaces the proof of what is now
Lemma 5.2, as the previous proof was erroneous
|
ACM Trans. Algorithms 5(3): 29, 2009
|
10.1145/1541885.1541890
| null |
cs.CG
| null |
We provide efficient constant factor approximation algorithms for the
problems of finding a hierarchical clustering of a point set in any metric
space, minimizing the sum of minimimum spanning tree lengths within each
cluster, and in the hyperbolic or Euclidean planes, minimizing the sum of
cluster perimeters. Our algorithms for the hyperbolic and Euclidean planes can
also be used to provide a pants decomposition, that is, a set of disjoint
simple closed curves partitioning the plane minus the input points into subsets
with exactly three boundary components, with approximately minimum total
length. In the Euclidean case, these curves are squares; in the hyperbolic
case, they combine our Euclidean square pants decomposition with our tree
clustering method for general metric spaces.
|
[
{
"version": "v1",
"created": "Sun, 9 Apr 2006 01:18:29 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Feb 2008 04:43:44 GMT"
}
] | 2009-07-08T00:00:00 |
[
[
"Eppstein",
"David",
""
]
] |
new_dataset
| 0.951615 |
0907.0792
|
James Raynolds
|
James E. Raynolds and Lenore M. Mullin
|
A generalized inner and outer product of arbitrary multi-dimensional
arrays using A Mathematics of Arrays (MoA)
| null | null | null | null |
cs.MS cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An algorithm has been devised to compute the inner and outer product between
two arbitrary multi-dimensional arrays A and B in a single piece of code. It
was derived using A Mathematics of Arrays (MoA) and the $\psi$-calculus.
Extensive tests of the new algorithm are presented for running in sequential as
well as OpenMP multiple processor modes.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2009 20:17:28 GMT"
}
] | 2009-07-07T00:00:00 |
[
[
"Raynolds",
"James E.",
""
],
[
"Mullin",
"Lenore M.",
""
]
] |
new_dataset
| 0.999596 |
0907.0929
|
Marc Shapiro
|
Mihai Letia (LIP), Nuno Pregui\c{c}a (CITI/Sep. Inform\'atica, FCT),
Marc Shapiro (LIP6, Inria Rocquencourt)
|
CRDTs: Consistency without concurrency control
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A CRDT is a data type whose operations commute when they are concurrent.
Replicas of a CRDT eventually converge without any complex concurrency control.
As an existence proof, we exhibit a non-trivial CRDT: a shared edit buffer
called Treedoc. We outline the design, implementation and performance of
Treedoc. We discuss how the CRDT concept can be generalised, and its
limitations.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2009 08:01:05 GMT"
}
] | 2009-07-07T00:00:00 |
[
[
"Letia",
"Mihai",
"",
"LIP"
],
[
"Preguiça",
"Nuno",
"",
"CITI/Sep. Informática, FCT"
],
[
"Shapiro",
"Marc",
"",
"LIP6, Inria Rocquencourt"
]
] |
new_dataset
| 0.997888 |
0705.0086
|
Maurice Margenstern
|
Maurice Margenstern
|
About the domino problem in the hyperbolic plane, a new solution:
complement
|
20 pages
|
M. Margenstern, "The domino problem of the hyperbolic plane is
undecidable", Theoretical Computer Science, vol. 407, (2008), 29-84
|
10.1016/j.tcs.2008.04.038
| null |
cs.CG cs.DM
| null |
In this paper, we complete the construction of paper arXiv:cs.CG/0701096v2.
Together with the proof contained in arXiv:cs.CG/0701096v2, this paper
definitely proves that the general problem of tiling the hyperbolic plane with
{\it \`a la} Wang tiles is undecidable.
|
[
{
"version": "v1",
"created": "Tue, 1 May 2007 09:29:59 GMT"
},
{
"version": "v2",
"created": "Tue, 1 May 2007 20:09:36 GMT"
},
{
"version": "v3",
"created": "Wed, 9 May 2007 06:25:50 GMT"
},
{
"version": "v4",
"created": "Fri, 18 May 2007 15:14:52 GMT"
}
] | 2009-07-06T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.981313 |
0907.0067
|
R Doomun
|
Huma Naeem, Asif Masood, Mukhtar Hussain, Shoab A. Khan
|
A Novel Two-Staged Decision Support based Threat Evaluation and Weapon
Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial
Intelligence Techinques
|
7 Pages, International Journal of Computer Science and Information
Security (IJCSIS)
|
IJCSIS June 2009 Issue, Vol. 2, No. 1
| null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Surveillance control and reporting (SCR) system for air threats play an
important role in the defense of a country. SCR system corresponds to air and
ground situation management/processing along with information fusion,
communication, coordination, simulation and other critical defense oriented
tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR
system. In such a system, maximal or near maximal utilization of constrained
resources is of extreme importance. Manual TEWA systems cannot provide
optimality because of different limitations e.g.surface to air missile (SAM)
can fire from a distance of 5Km, but manual TEWA systems are constrained by
human vision range and other constraints. Current TEWA systems usually work on
target-by-target basis using some type of greedy algorithm thus affecting the
optimality of the solution and failing in multi-target scenario. his paper
relates to a novel two-staged flexible dynamic decision support based optimal
threat evaluation and weapon assignment algorithm for multi-target air-borne
threats.
|
[
{
"version": "v1",
"created": "Wed, 1 Jul 2009 06:05:22 GMT"
}
] | 2009-07-02T00:00:00 |
[
[
"Naeem",
"Huma",
""
],
[
"Masood",
"Asif",
""
],
[
"Hussain",
"Mukhtar",
""
],
[
"Khan",
"Shoab A.",
""
]
] |
new_dataset
| 0.979713 |
0907.0088
|
Didehvar Farzaad
|
Farzad Didehvar, Ali D. Mehrabi, Fatemeh Raee B
|
On Unique Independence Weighted Graphs
|
9 pages, 1 figure
| null | null | null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An independent set in a graph G is a set of vertices no two of which are
joined by an edge. A vertex-weighted graph associates a weight with every
vertex in the graph. A vertex-weighted graph G is called a unique independence
vertex-weighted graph if it has a unique independent set with maximum sum of
weights. Although, in this paper we observe that the problem of recognizing
unique independence vertex-weighted graphs is NP-hard in general and therefore
no efficient characterization can be expected in general; we give, however,
some combinatorial characterizations of unique independence vertex-weighted
graphs. This paper introduces a motivating application of this problem in the
area of combinatorial auctions, as well.
|
[
{
"version": "v1",
"created": "Wed, 1 Jul 2009 08:38:09 GMT"
}
] | 2009-07-02T00:00:00 |
[
[
"Didehvar",
"Farzad",
""
],
[
"Mehrabi",
"Ali D.",
""
],
[
"B",
"Fatemeh Raee",
""
]
] |
new_dataset
| 0.999193 |
0902.0058
|
Robert Rolland
|
Robert Rolland
|
The second weight of generalized Reed-Muller codes in most cases
|
This version corrects minor misprints and gives a more detailed proof
of a combinatorial lemma
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The second weight of the Generalized Reed-Muller code of order $d$ over the
finite field with $q$ elements is now known for $d <q$ and $d>(n-1)(q-1)$. In
this paper, we determine the second weight for the other values of $d$ which
are not multiple of $q-1$ plus 1. For the special case $d=a(q-1)+1$ we give an
estimate.
|
[
{
"version": "v1",
"created": "Sun, 1 Feb 2009 23:22:23 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jun 2009 04:18:17 GMT"
}
] | 2009-06-30T00:00:00 |
[
[
"Rolland",
"Robert",
""
]
] |
new_dataset
| 0.958367 |
0906.5073
|
R Doomun
|
R. Avudaiammal, R. SivaSubramanian, R.Pandian, P. Seethalakshmi
|
TTSS Packet Classification Algorithm to enhance Multimedia Applications
in Network Processor based Router
|
6 Pages, International Journal of Computer Science and Information
Security (IJCSIS)
|
IJCSIS June 2009 Issue, Vol. 2, No. 1
| null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The objective of this paper is to implement the Trie based Tuple Space
Search(TTSS) packet classification algorithm for Network Processor(NP) based
router to enhance multimedia applications. The performance is evaluated using
Intel IXP2400 NP Simulator. The results demonstrate that, TTSS has better
performance than Tuple Space Search algorithm and is well suited to achieve
high speed packet classification to support multimedia applications.
|
[
{
"version": "v1",
"created": "Sat, 27 Jun 2009 11:59:15 GMT"
}
] | 2009-06-30T00:00:00 |
[
[
"Avudaiammal",
"R.",
""
],
[
"SivaSubramanian",
"R.",
""
],
[
"Pandian",
"R.",
""
],
[
"Seethalakshmi",
"P.",
""
]
] |
new_dataset
| 0.996055 |
0906.5114
|
Hal Daum\'e III
|
Hal Daum\'e III
|
Non-Parametric Bayesian Areal Linguistics
| null |
Proceedings of the Conference of the North American Association
for Computational Linguistics, 2009
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a statistical model over linguistic areas and phylogeny.
Our model recovers known areas and identifies a plausible hierarchy of areal
features. The use of areas improves genetic reconstruction of languages both
qualitatively and quantitatively according to a variety of metrics. We model
linguistic areas by a Pitman-Yor process and linguistic phylogeny by Kingman's
coalescent.
|
[
{
"version": "v1",
"created": "Sun, 28 Jun 2009 02:32:53 GMT"
}
] | 2009-06-30T00:00:00 |
[
[
"Daumé",
"Hal",
"III"
]
] |
new_dataset
| 0.970375 |
0906.4827
|
Walid Saad
|
Walid Saad, Zhu Han, Tamer Basar, Merouane Debbah and Are
Hj{\o}rungnes
|
Physical Layer Security: Coalitional Games for Distributed Cooperation
|
Best paper Award at Wiopt 2009
| null | null | null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperation between wireless network nodes is a promising technique for
improving the physical layer security of wireless transmission, in terms of
secrecy capacity, in the presence of multiple eavesdroppers. While existing
physical layer security literature answered the question "what are the
link-level secrecy capacity gains from cooperation?", this paper attempts to
answer the question of "how to achieve those gains in a practical decentralized
wireless network and in the presence of a secrecy capacity cost for information
exchange?". For this purpose, we model the physical layer security cooperation
problem as a coalitional game with non-transferable utility and propose a
distributed algorithm for coalition formation. Through the proposed algorithm,
the wireless users can autonomously cooperate and self-organize into disjoint
independent coalitions, while maximizing their secrecy capacity taking into
account the security costs during information exchange. We analyze the
resulting coalitional structures, discuss their properties, and study how the
users can self-adapt the network topology to environmental changes such as
mobility. Simulation results show that the proposed algorithm allows the users
to cooperate and self-organize while improving the average secrecy capacity per
user up to 25.32% relative to the non-cooperative case.
|
[
{
"version": "v1",
"created": "Fri, 26 Jun 2009 01:20:58 GMT"
}
] | 2009-06-29T00:00:00 |
[
[
"Saad",
"Walid",
""
],
[
"Han",
"Zhu",
""
],
[
"Basar",
"Tamer",
""
],
[
"Debbah",
"Merouane",
""
],
[
"Hjørungnes",
"Are",
""
]
] |
new_dataset
| 0.984942 |
0809.1570
|
Patrick Erik Bradley
|
Patrick Erik Bradley
|
Mumford dendrograms and discrete p-adic symmetries
|
14 pages, 6 figures
|
p-Adic Numbers, Ultrametric Analysis and Applications, Vol. 1, No.
2 (2009), 118-127
|
10.1134/S2070046609020034
| null |
cs.DM math-ph math.MP q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we present an effective encoding of dendrograms by embedding
them into the Bruhat-Tits trees associated to $p$-adic number fields. As an
application, we show how strings over a finite alphabet can be encoded in
cyclotomic extensions of $\mathbb{Q}_p$ and discuss $p$-adic DNA encoding. The
application leads to fast $p$-adic agglomerative hierarchic algorithms similar
to the ones recently used e.g. by A. Khrennikov and others. From the viewpoint
of $p$-adic geometry, to encode a dendrogram $X$ in a $p$-adic field $K$ means
to fix a set $S$ of $K$-rational punctures on the $p$-adic projective line
$\mathbb{P}^1$. To $\mathbb{P}^1\setminus S$ is associated in a natural way a
subtree inside the Bruhat-Tits tree which recovers $X$, a method first used by
F. Kato in 1999 in the classification of discrete subgroups of
$\textrm{PGL}_2(K)$.
Next, we show how the $p$-adic moduli space $\mathfrak{M}_{0,n}$ of
$\mathbb{P}^1$ with $n$ punctures can be applied to the study of time series of
dendrograms and those symmetries arising from hyperbolic actions on
$\mathbb{P}^1$. In this way, we can associate to certain classes of dynamical
systems a Mumford curve, i.e. a $p$-adic algebraic curve with totally
degenerate reduction modulo $p$.
Finally, we indicate some of our results in the study of general discrete
actions on $\mathbb{P}^1$, and their relation to $p$-adic Hurwitz spaces.
|
[
{
"version": "v1",
"created": "Tue, 9 Sep 2008 14:41:05 GMT"
}
] | 2009-06-24T00:00:00 |
[
[
"Bradley",
"Patrick Erik",
""
]
] |
new_dataset
| 0.961063 |
0903.0992
|
Fortis Alexandra Ms.
|
Diana Sophia Codat
|
L'entreprise franco-roumaine face au Internet
|
6 pages, exposed on 2nd "European conference on Computer Science &
Applications" - XA2008, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series 6 (2008), 25-30
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main goal of the present work is to analyze the activity of the French
companies from Romania related to the increasing use of the information and
communication technology in the productive field. The convergent assembly of
information and communication technologies and the process of economic
globalization have led to a profound transformation of the economic activity.
The present paper is part of a series of studies made on the French firms from
Romania between 2007 and 2008.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2009 14:04:07 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Jun 2009 13:12:54 GMT"
}
] | 2009-06-23T00:00:00 |
[
[
"Codat",
"Diana Sophia",
""
]
] |
new_dataset
| 0.969539 |
0906.3864
|
Oren Somekh
|
O. Somekh, O. Simeone, H. V. Poor, and S. Shamai (Shitz)
|
The Two-Tap Input-Erasure Gaussian Channel and its Application to
Cellular Communications
|
Presented at the Forty-Sixth Annual Allerton Conference on
Communication, Control, and Computing, Sep. 2008, Monticello, Illinois
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the input-erasure Gaussian channel. In contrast to the
output-erasure channel where erasures are applied to the output of a linear
time-invariant (LTI) system, here erasures, known to the receiver, are applied
to the inputs of the LTI system. Focusing on the case where the input symbols
are independent and identically distributed (i.i.d)., it is shown that the two
channels (input- and output-erasure) are equivalent. Furthermore, assuming that
the LTI system consists of a two-tap finite impulse response (FIR) filter, and
using simple properties of tri-diagonal matrices, an achievable rate expression
is presented in the form of an infinite sum. The results are then used to study
the benefits of joint multicell processing (MCP) over single-cell processing
(SCP) in a simple linear cellular uplink, where each mobile terminal is
received by only the two nearby base-stations (BSs). Specifically, the analysis
accounts for ergodic shadowing that simultaneously blocks the mobile terminal
(MT) signal from being received by the two BS. It is shown that the resulting
ergodic per-cell capacity with optimal MCP is equivalent to that of the two-tap
input-erasure channel. Finally, the same cellular uplink is addressed by
accounting for dynamic user activity, which is modelled by assuming that each
MT is randomly selected to be active or to remain silent throughout the whole
transmission block. For this alternative model, a similar equivalence results
to the input-erasure channel are reported.
|
[
{
"version": "v1",
"created": "Sun, 21 Jun 2009 11:54:54 GMT"
}
] | 2009-06-23T00:00:00 |
[
[
"Somekh",
"O.",
"",
"Shitz"
],
[
"Simeone",
"O.",
"",
"Shitz"
],
[
"Poor",
"H. V.",
"",
"Shitz"
],
[
"Shamai",
"S.",
"",
"Shitz"
]
] |
new_dataset
| 0.991718 |
0906.3225
|
EPTCS
|
J\'er\^ome Durand-Lose
|
Small Turing universal signal machines
| null |
EPTCS 1, 2009, pp. 70-80
|
10.4204/EPTCS.1.7
| null |
cs.CC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article aims at providing signal machines as small as possible able to
perform any computation (in the classical understanding). After presenting
signal machines, it is shown how to get universal ones from Turing machines,
cellular-automata and cyclic tag systems. Finally a halting universal signal
machine with 13 meta-signals and 21 collision rules is presented.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2009 16:08:47 GMT"
}
] | 2009-06-22T00:00:00 |
[
[
"Durand-Lose",
"Jérôme",
""
]
] |
new_dataset
| 0.995264 |
0906.3227
|
EPTCS
|
Nicolas Ollinger, Ga\'etan Richard
|
A Particular Universal Cellular Automaton
| null |
EPTCS 1, 2009, pp. 205-214
|
10.4204/EPTCS.1.20
| null |
cs.CC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Signals are a classical tool used in cellular automata constructions that
proved to be useful for language recognition or firing-squad synchronisation.
Particles and collisions formalize this idea one step further, describing
regular nets of colliding signals. In the present paper, we investigate the use
of particles and collisions for constructions involving an infinite number of
interacting particles. We obtain a high-level construction for a new smallest
intrinsically universal cellular automaton with 4 states.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2009 16:11:12 GMT"
}
] | 2009-06-22T00:00:00 |
[
[
"Ollinger",
"Nicolas",
""
],
[
"Richard",
"Gaétan",
""
]
] |
new_dataset
| 0.997416 |
0906.3410
|
Christian Spagnol
|
Christian Spagnol, Marta Rossi, Massimiliano Sala
|
Quasi-cyclic LDPC codes with high girth
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a class of quasi-cyclic LDPC codes. We provide precise conditions
guaranteeing high girth in their Tanner graph. Experimentally, the codes we
propose perform no worse than random LDPC codes with their same parameters,
which is a significant achievement for algebraic codes.
|
[
{
"version": "v1",
"created": "Thu, 18 Jun 2009 11:28:40 GMT"
}
] | 2009-06-19T00:00:00 |
[
[
"Spagnol",
"Christian",
""
],
[
"Rossi",
"Marta",
""
],
[
"Sala",
"Massimiliano",
""
]
] |
new_dataset
| 0.971497 |
0906.3101
|
Christine Michel
|
Christine Michel (LIESP, ICTT), Marc-Eric Bobillier-Chaumon (ICTT),
Franck Tarpin-Bernard (LIESP, ICTT)
|
Fracture num\'erique chez les seniors du 4eme age. Observation d'une
acculturation technique
| null |
Les Cahiers du num\'erique 5, 1 (2009) 147-168
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Very old people accumulate the "handicaps": social, physical, psychological
or cognitive. Various research thus developed to determine there waiting and
needs and also to see the benefit possibly produced by technologies (called
?gerontechnology?) on their living conditions. The object of this article is to
present the numerical service offer to very old perople and to see how it takes
part in a social justice according to the definition of Rawls (principle of
equal freedom, principle of equal opportunity in the access). The adoption, the
use and the benefit of technology are analyzed in a theoretical way through a
state of the art and in an experimental way through a qualitative and
quantitative investigation carried out with a population of very old people. We
propose to identify dynamic technological acceptance of old people according to
the TAM'S (Technology Acceptance Model) of Davis adapted by (Hamner and Qazi,
2008).
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2009 08:14:03 GMT"
}
] | 2009-06-18T00:00:00 |
[
[
"Michel",
"Christine",
"",
"LIESP, ICTT"
],
[
"Bobillier-Chaumon",
"Marc-Eric",
"",
"ICTT"
],
[
"Tarpin-Bernard",
"Franck",
"",
"LIESP, ICTT"
]
] |
new_dataset
| 0.995799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.