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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1006.1703
|
Harco Leslie Hendric Spits Warnars
|
Spits Warnars
|
Indonesian Earthquake Decision Support System
|
8 pages, 7 figures
|
The 5th International Conference on Information & Communication
Technology and Systems (ICTS) 2009, Informatics Department, Institute of
Technology Sepuluh Nopember (ITS), Surabaya, Indonesia, 3-4 August 2009
| null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Earthquake DSS is an information technology environment which can be used by
government to sharpen, make faster and better the earthquake mitigation
decision. Earthquake DSS can be delivered as E-government which is not only for
government itself but in order to guarantee each citizen's rights for
education, training and information about earthquake and how to overcome the
earthquake. Knowledge can be managed for future use and would become mining by
saving and maintain all the data and information about earthquake and
earthquake mitigation in Indonesia. Using Web technology will enhance global
access and easy to use. Datawarehouse as unNormalized database for
multidimensional analysis will speed the query process and increase reports
variation. Link with other Disaster DSS in one national disaster DSS, link with
other government information system and international will enhance the
knowledge and sharpen the reports.
|
[
{
"version": "v1",
"created": "Wed, 9 Jun 2010 04:36:14 GMT"
}
] | 2010-06-10T00:00:00 |
[
[
"Warnars",
"Spits",
""
]
] |
new_dataset
| 0.995567 |
1006.1711
|
EPTCS
|
Angelo Montanari (Universit\`a di Udine), Margherita Napoli
(Universit\`a di Salerno), Mimmo Parente (Universit\`a di Salerno)
|
Proceedings First Symposium on Games, Automata, Logic, and Formal
Verification
| null |
EPTCS 25, 2010
|
10.4204/EPTCS.25
| null |
cs.GT cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the Proceedings of the first Symposium on "Games,
Automata, Logic, and Formal Verification (GandALF)", held in Minori (Amalfi
coast), Italy, 17-18 June 2010. The symposium has been promoted by a number of
Italian computer scientists interested in game theory, mathematical logic,
automata theory, and their applications to the specification, design, and
verification of complex systems. It covers a large spectrum of research topics,
ranging from theoretical aspects to concrete applications. Its aim is to
provide a forum where people from different areas, and possibly with a
different background, can successfully interact. The high-level international
profile of the event is witnessed by the composition of the program committee
and by the final program.
|
[
{
"version": "v1",
"created": "Wed, 9 Jun 2010 06:30:25 GMT"
}
] | 2010-06-10T00:00:00 |
[
[
"Montanari",
"Angelo",
"",
"Università di Udine"
],
[
"Napoli",
"Margherita",
"",
"Università di Salerno"
],
[
"Parente",
"Mimmo",
"",
"Università di Salerno"
]
] |
new_dataset
| 0.992278 |
1006.1406
|
EPTCS
|
Giovanna D'Agostino (University of Udine, Italy), Giacomo Lenzi
(University of Salerno, Italy)
|
On Modal {\mu}-Calculus over Finite Graphs with Bounded Strongly
Connected Components
| null |
EPTCS 25, 2010, pp. 55-71
|
10.4204/EPTCS.25.9
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For every positive integer k we consider the class SCCk of all finite graphs
whose strongly connected components have size at most k. We show that for every
k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level
Delta2, but not to Comp(Sigma1,Pi1) (compositions of formulas of level Sigma1
and Pi1). This contrasts with the class of all graphs, where
Delta2=Comp(Sigma1,Pi1).
|
[
{
"version": "v1",
"created": "Tue, 8 Jun 2010 00:42:43 GMT"
}
] | 2010-06-09T00:00:00 |
[
[
"D'Agostino",
"Giovanna",
"",
"University of Udine, Italy"
],
[
"Lenzi",
"Giacomo",
"",
"University of Salerno, Italy"
]
] |
new_dataset
| 0.967642 |
1006.1428
|
EPTCS
|
Mikl\'os Bartha (Memorial University of Newfoundland)
|
Turing Automata and Graph Machines
| null |
EPTCS 26, 2010, pp. 19-31
|
10.4204/EPTCS.26.3
| null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indexed monoidal algebras are introduced as an equivalent structure for
self-dual compact closed categories, and a coherence theorem is proved for the
category of such algebras. Turing automata and Turing graph machines are
defined by generalizing the classical Turing machine concept, so that the
collection of such machines becomes an indexed monoidal algebra. On the analogy
of the von Neumann data-flow computer architecture, Turing graph machines are
proposed as potentially reversible low-level universal computational devices,
and a truly reversible molecular size hardware model is presented as an
example.
|
[
{
"version": "v1",
"created": "Tue, 8 Jun 2010 01:16:19 GMT"
}
] | 2010-06-09T00:00:00 |
[
[
"Bartha",
"Miklós",
"",
"Memorial University of Newfoundland"
]
] |
new_dataset
| 0.994672 |
1006.1074
|
Mathias Monnerville
|
M. Monnerville and G. S\'emah
|
Youpi, a Web-based Astronomical Image Processing Pipeline
|
4 pages, 2 figures, to appear in the proceedings of ADASS XIX, Oct
4-8 2009, Sapporo, Japan (ASP Conf. Series)
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Youpi stands for "YOUpi is your processing PIpeline". It is a portable, easy
to use web application providing high level functionalities to perform data
reduction on scientific FITS images. It is built on top of open source
processing tools that are released to the community by Terapix, in order to
organize your data on a computer cluster, to manage your processing jobs in
real time and to facilitate teamwork by allowing fine-grain sharing of results
and data. On the server side, Youpi is written in the Python programming
language and uses the Django web framework. On the client side, Ajax techniques
are used along with the Prototype and script.aculo.us Javascript librairies.
|
[
{
"version": "v1",
"created": "Sat, 5 Jun 2010 22:27:14 GMT"
}
] | 2010-06-08T00:00:00 |
[
[
"Monnerville",
"M.",
""
],
[
"Sémah",
"G.",
""
]
] |
new_dataset
| 0.998401 |
1006.1172
|
Ali Talari
|
Ali Talari and Nazanin Rahnavard
|
Distributed Rateless Codes with UEP Property
|
Accepted, 2010 IEEE International Symposium on Information Theory
(ISIT 2010)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When multiple sources of data need to transmit their rateless coded symbols
through a single relay to a common destination, a distributed rateless code
instead of several separate conventional rateless codes can be employed to
encode the input symbols to increase the transmission efficiency and
flexibility.
In this paper, we propose distributed rateless codes DU-rateless that can
provide unequal error protection (UEP) for distributed sources with different
data block lengths and different importance levels. We analyze our proposed
DU-rateless code employing And-Or tree analysis technique. Next, we design
several sets of optimum DU-rateless codes for various setups employing
multi-objective genetic algorithms and evaluate their performances.
|
[
{
"version": "v1",
"created": "Mon, 7 Jun 2010 05:19:43 GMT"
}
] | 2010-06-08T00:00:00 |
[
[
"Talari",
"Ali",
""
],
[
"Rahnavard",
"Nazanin",
""
]
] |
new_dataset
| 0.995974 |
1006.0836
|
Ashley Smith
|
Harsh kumar and Shweta Srivastava
|
Rectangular and Circular Antenna Design on Thick Substrate
|
Submitted to Journal of Telecommunications, see
http://sites.google.com/site/journaloftelecommunications/volume-2-issue-2-may-2010
|
Journal of Telecommunications,Volume 2, Issue 2, pp58-63, May 2010
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave technology being an emerging area is still very undeveloped.
A substantial research needs to be done in this area as its applications are
numerous. In the present endeavor, a rectangular patch antenna is designed on
thick substrate and simulated using SONNET software, also a novel analysis
technique is developed for circular patch antenna for millimeter wave
frequency. The antenna is designed at 39 GHz on thick substrate and has been
analyzed and simulated.The results of the theoretical analysis are in good
agreement with the simulated results.
|
[
{
"version": "v1",
"created": "Fri, 4 Jun 2010 10:07:00 GMT"
}
] | 2010-06-07T00:00:00 |
[
[
"kumar",
"Harsh",
""
],
[
"Srivastava",
"Shweta",
""
]
] |
new_dataset
| 0.999758 |
1006.0850
|
Ashley Smith
|
Hardeep Singh, Jasvir Singh and M. Mian
|
Simulink based VoIP Analysis
|
Submitted to Journal of Telecommunications, see
http://sites.google.com/site/journaloftelecommunications/volume-2-issue-2-may-2010
|
Journal of Telecommunications,Volume 2, Issue 2, p126-130, May
2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice communication over internet not be possible without a reliable data
network, this was first available when distributed network topologies were used
in conjunction with data packets. Early network used single centre node network
in which a single workstation (Server) is responsible for the communication.
This posed problems as if there was a fault with the centre node, (workstation)
nothing would work. This problem was solved by the distributed system in which
reliability increases by spreading the load between many nodes. The idea of
packet switching & distributed network were combined, this combination were
increased reliability, speed & responsible for voice communication over
internet, Voice-over-IP (VoIP)These data packets travel through a
packet-switched network such as the Internet and arrive at their destination
where they are decompressed using a compatible Codec (audio coder/decoder) and
converted back to analogue audio. This paper deals with the Simulink
architecture for VoIP network.
|
[
{
"version": "v1",
"created": "Fri, 4 Jun 2010 10:36:13 GMT"
}
] | 2010-06-07T00:00:00 |
[
[
"Singh",
"Hardeep",
""
],
[
"Singh",
"Jasvir",
""
],
[
"Mian",
"M.",
""
]
] |
new_dataset
| 0.999029 |
1006.0902
|
Alexandru I. Tomescu
|
Alexandru I. Tomescu
|
On cycles through two arcs in strong multipartite tournaments
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multipartite tournament is an orientation of a complete $c$-partite graph.
In [L. Volkmann, A remark on cycles through an arc in strongly connected
multipartite tournaments, Appl. Math. Lett. 20 (2007) 1148--1150], Volkmann
proved that a strongly connected $c$-partite tournament with $c \ge 3$ contains
an arc that belongs to a directed cycle of length $m$ for every $m \in \{3, 4,
\ldots, c\}$. He also conjectured the existence of three arcs with this
property. In this note, we prove the existence of two such arcs.
|
[
{
"version": "v1",
"created": "Fri, 4 Jun 2010 14:20:04 GMT"
}
] | 2010-06-07T00:00:00 |
[
[
"Tomescu",
"Alexandru I.",
""
]
] |
new_dataset
| 0.999521 |
1006.0576
|
Benjamin Nguyen
|
Georges Gardarin (PRISM), Benjamin Nguyen (PRISM), Laurent Yeh
(PRISM), Karine Zeitouni (PRISM), Bogdan Butnaru (PRISM), Iulian Sandu-Popa
(PRISM)
|
Gestion efficace de s\'eries temporelles en P2P: Application \`a
l'analyse technique et l'\'etude des objets mobiles
| null |
Bases de Donn\'ees Avanc\'ees, Namur : Belgium (2009)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a simple generic model to manage time series. A
time series is composed of a calendar with a typed value for each calendar
entry. Although the model could support any kind of XML typed values, in this
paper we focus on real numbers, which are the usual application. We define
basic vector space operations (plus, minus, scale), and also relational-like
and application oriented operators to manage time series. We show the interest
of this generic model on two applications: (i) a stock investment helper; (ii)
an ecological transport management system. Stock investment requires
window-based operations while trip management requires complex queries. The
model has been implemented and tested in PHP, Java, and XQuery. We show
benchmark results illustrating that the computing of 5000 series of over
100.000 entries in length - common requirements for both applications - is
difficult on classical centralized PCs. In order to serve a community of users
sharing time series, we propose a P2P implementation of time series by dividing
them in segments and providing optimized algorithms for operator expression
computation.
|
[
{
"version": "v1",
"created": "Thu, 3 Jun 2010 07:59:40 GMT"
}
] | 2010-06-04T00:00:00 |
[
[
"Gardarin",
"Georges",
"",
"PRISM"
],
[
"Nguyen",
"Benjamin",
"",
"PRISM"
],
[
"Yeh",
"Laurent",
"",
"PRISM"
],
[
"Zeitouni",
"Karine",
"",
"PRISM"
],
[
"Butnaru",
"Bogdan",
"",
"PRISM"
],
[
"Sandu-Popa",
"Iulian",
"",
"PRISM"
]
] |
new_dataset
| 0.979235 |
1001.2327
|
Yeow-Khiang Chia
|
Yeow-Khiang Chia and Abbas El Gamal
|
Wiretap Channel with Causal State Information
|
V2: Minor edits. 19 pages, 3 figures V3: Minor edits. Typos corrected
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A lower bound on the secrecy capacity of the wiretap channel with state
information available causally at both the encoder and decoder is established.
The lower bound is shown to be strictly larger than that for the noncausal case
by Liu and Chen. Achievability is proved using block Markov coding, Shannon
strategy, and key generation from common state information. The state sequence
available at the end of each block is used to generate a key, which is used to
enhance the transmission rate of the confidential message in the following
block. An upper bound on the secrecy capacity when the state is available
noncausally at the encoder and decoder is established and is shown to coincide
with the lower bound for several classes of wiretap channels with state.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 22:40:28 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jan 2010 01:24:28 GMT"
},
{
"version": "v3",
"created": "Wed, 2 Jun 2010 05:29:01 GMT"
}
] | 2010-06-03T00:00:00 |
[
[
"Chia",
"Yeow-Khiang",
""
],
[
"Gamal",
"Abbas El",
""
]
] |
new_dataset
| 0.957009 |
1006.0247
|
Wojciech Mazurczyk
|
Wojciech Fraczek, Wojciech Mazurczyk, Krzysztof Szczypiorski
|
Stream Control Transmission Protocol Steganography
|
6 pages, 6 figures, 2 tables
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stream Control Transmission Protocol (SCTP) is a new transport layer protocol
that is due to replace TCP (Transmission Control Protocol) and UDP (User
Datagram Protocol) protocols in future IP networks. Currently, it is
implemented in such operating systems like BSD, Linux, HP-UX or Sun Solaris. It
is also supported in Cisco network devices operating system (Cisco IOS) and may
be used in Windows. This paper describes potential steganographic methods that
may be applied to SCTP and may pose a threat to network security. Proposed
methods utilize new, characteristic SCTP features like multi-homing and
multistreaming. Identified new threats and suggested countermeasures may be
used as a supplement to RFC 5062, which describes security attacks in SCTP
protocol and can induce further standard modifications.
|
[
{
"version": "v1",
"created": "Tue, 1 Jun 2010 20:26:27 GMT"
}
] | 2010-06-03T00:00:00 |
[
[
"Fraczek",
"Wojciech",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.998826 |
1006.0334
|
Rui Costa
|
Rui A. Costa and Michael Langberg and Jo\~ao Barros
|
One-Shot Capacity of Discrete Channels
|
ISIT 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shannon defined channel capacity as the highest rate at which there exists a
sequence of codes of block length $n$ such that the error probability goes to
zero as $n$ goes to infinity. In this definition, it is implicit that the block
length, which can be viewed as the number of available channel uses, is
unlimited. This is not the case when the transmission power must be
concentrated on a single transmission, most notably in military scenarios with
adversarial conditions or delay-tolerant networks with random short encounters.
A natural question arises: how much information can we transmit in a single use
of the channel? We give a precise characterization of the one-shot capacity of
discrete channels, defined as the maximum number of bits that can be
transmitted in a single use of a channel with an error probability that does
not exceed a prescribed value. This capacity definition is shown to be useful
and significantly different from the zero-error problem statement.
|
[
{
"version": "v1",
"created": "Wed, 2 Jun 2010 09:31:35 GMT"
}
] | 2010-06-03T00:00:00 |
[
[
"Costa",
"Rui A.",
""
],
[
"Langberg",
"Michael",
""
],
[
"Barros",
"João",
""
]
] |
new_dataset
| 0.990484 |
1006.0385
|
Dr. Paul J. Werbos
|
Paul J. Werbos
|
Brain-Like Stochastic Search: A Research Challenge and Funding
Opportunity
|
Plenary talk at IEEE Conference on Evolutionary Computing 1999,
extended in 2010 with new appendix
| null | null | null |
cs.AI
|
http://creativecommons.org/licenses/publicdomain/
|
Brain-Like Stochastic Search (BLiSS) refers to this task: given a family of
utility functions U(u,A), where u is a vector of parameters or task
descriptors, maximize or minimize U with respect to u, using networks (Option
Nets) which input A and learn to generate good options u stochastically. This
paper discusses why this is crucial to brain-like intelligence (an area funded
by NSF) and to many applications, and discusses various possibilities for
network design and training. The appendix discusses recent research, relations
to work on stochastic optimization in operations research, and relations to
engineering-based approaches to understanding neocortex.
|
[
{
"version": "v1",
"created": "Tue, 1 Jun 2010 18:16:10 GMT"
}
] | 2010-06-03T00:00:00 |
[
[
"Werbos",
"Paul J.",
""
]
] |
new_dataset
| 0.953759 |
1003.3713
|
Joseph O'Rourke
|
Joseph O'Rourke
|
The Yao Graph Y_6 is a Spanner
|
12 pages, 11 figures, 2 references, unpublished. A subcase of Case(2)
of Theorem 1 was overlooked, and I withdraw the paper until that gap is
filled.
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that Y_6 is a spanner. Y_6 is the Yao graph on a set of planar
points, which has an edge from each point x to a closest point y within each of
the six angular cones of 60 deg surrounding x.
|
[
{
"version": "v1",
"created": "Fri, 19 Mar 2010 04:36:52 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Jun 2010 18:25:13 GMT"
}
] | 2010-06-02T00:00:00 |
[
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.997949 |
1005.3968
|
Gilson Oliveira Santos
|
G. O. Santos, F. M. Assis and A. F. Lima
|
A Scheme of Concatenated Quantum Code to Protect against both
Computational Error and an Erasure
|
21 pages, 2 figures
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a description of encoding/decoding for a concatenated quantum code
that enables both protection against quantum computational errors and the
occurrence of one quantum erasure. For this, it is presented how encoding and
decoding for quantum graph codes are done, which will provide the protection
against the occurrence of computational errors (external code). As internal
code is used encoding and decoding via scheme of GHZ states for protection
against the occurrence of one quantum erasure.
|
[
{
"version": "v1",
"created": "Fri, 21 May 2010 14:07:08 GMT"
},
{
"version": "v2",
"created": "Mon, 31 May 2010 20:37:11 GMT"
}
] | 2010-06-02T00:00:00 |
[
[
"Santos",
"G. O.",
""
],
[
"Assis",
"F. M.",
""
],
[
"Lima",
"A. F.",
""
]
] |
new_dataset
| 0.999456 |
1005.5633
|
Olivier Finkel
|
Olivier Finkel (ELM)
|
On Omega Context Free Languages which are Borel Sets of Infinite Rank
|
The supremum of the set of Borel ranks of omega-context-free
languages is actually greater than the first non-recursive ordinal. This has
been proved later in a paper "Borel Ranks and Wadge Degrees of Omega Context
Free Languages" published in the journal Mathematical Structures in Computer
Science (2006)
|
Theoretical Computer Science 299 (1-3) (2003) 327-346
| null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is a continuation of the study of topological properties of omega
context free languages (omega-CFL). We proved before that the class of
omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there
exist some omega-CFL which are analytic but non Borel sets. We prove here that
there exist some omega context free languages which are Borel sets of infinite
(but not finite) rank, giving additional answer to questions of Lescow and
Thomas [Logical Specifications of Infinite Computations, In:"A Decade of
Concurrency", Springer LNCS 803 (1994), 583-621].
|
[
{
"version": "v1",
"created": "Mon, 31 May 2010 09:16:55 GMT"
}
] | 2010-06-02T00:00:00 |
[
[
"Finkel",
"Olivier",
"",
"ELM"
]
] |
new_dataset
| 0.996185 |
1006.0153
|
Solomija Buk N
|
Solomiya Buk
|
Ivan Franko's novel Dlja domashnjoho ohnyshcha (For the Hearth) in the
light of the frequency dictionary
|
11 pages, in Ukrainian
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the article, the methodology and the principles of the compilation of the
Frequency dictionary for Ivan Franko's novel Dlja domashnjoho ohnyshcha (For
the Hearth) are described. The following statistical parameters of the novel
vocabulary are obtained: variety, exclusiveness, concentration indexes,
correlation between word rank and text coverage, etc. The main quantitative
characteristics of Franko's novels Perekhresni stezhky (The Cross-Paths) and
Dlja domashnjoho ohnyshcha are compared on the basis of their frequency
dictionaries.
|
[
{
"version": "v1",
"created": "Tue, 1 Jun 2010 15:20:59 GMT"
}
] | 2010-06-02T00:00:00 |
[
[
"Buk",
"Solomiya",
""
]
] |
new_dataset
| 0.988172 |
0909.2309
|
Jun Tanaka
|
Jun Tanaka
|
Logic with Verbs
| null | null | null | null |
cs.AI cs.LO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The aim of this paper is to introduce a logic in which nouns and verbs are
handled together as a deductive reasoning, and also to observe the relationship
between nouns and verbs as well as between logics and conversations.
|
[
{
"version": "v1",
"created": "Sat, 12 Sep 2009 07:49:36 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Oct 2009 00:49:38 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Dec 2009 10:54:13 GMT"
}
] | 2010-06-01T00:00:00 |
[
[
"Tanaka",
"Jun",
""
]
] |
new_dataset
| 0.999919 |
1002.3077
|
Marc Mezzarobba
|
Marc Mezzarobba (INRIA Rocquencourt)
|
NumGfun: a Package for Numerical and Analytic Computation with D-finite
Functions
| null | null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article describes the implementation in the software package NumGfun of
classical algorithms that operate on solutions of linear differential equations
or recurrence relations with polynomial coefficients, including what seems to
be the first general implementation of the fast high-precision numerical
evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our
descriptions contain improvements over existing algorithms. We also provide
references to relevant ideas not currently used in NumGfun.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2010 13:07:30 GMT"
},
{
"version": "v2",
"created": "Mon, 31 May 2010 08:12:06 GMT"
}
] | 2010-06-01T00:00:00 |
[
[
"Mezzarobba",
"Marc",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.999173 |
1005.5444
|
Loet Leydesdorff
|
Loet Leydesdorff
|
Eugene Garfield and Algorithmic Historiography: Co-Words, Co-Authors,
and Journal Names
| null | null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Algorithmic historiography was proposed by Eugene Garfield in collaboration
with Irving Sher in the 1960s, but further developed only recently into
HistCite^{TM} with Alexander Pudovkin. As in history writing, HistCite^{TM}
reconstructs by drawing intellectual lineages. In addition to cited references,
however, documents can be attributed a multitude of other variables such as
title words, keywords, journal names, author names, and even full texts. New
developments in multidimensional scaling (MDS) enable us not only to visualize
these patterns at each moment of time, but also to animate them over time.
Using title words, co-authors, and journal names in Garfield's oeuvre, the
method is demonstrated and further developed in this paper (and in the
animation at http://www.leydesdorff.net/garfield/animation). The variety and
substantive content of the animation enables us to write, visualize, and
animate the author's intellectual history.
|
[
{
"version": "v1",
"created": "Sat, 29 May 2010 09:34:13 GMT"
}
] | 2010-06-01T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.999731 |
1005.5489
|
Constantin Jucovschi
|
Constantin Jucovschi, Michael Kohlhase
|
sTeXIDE: An Integrated Development Environment for sTeX Collections
|
To appear in The 9th International Conference on Mathematical
Knowledge Management: MKM 2010
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Authoring documents in MKM formats like OMDoc is a very tedious task. After
years of working on a semantically annotated corpus of sTeX documents (GenCS),
we identified a set of common, time-consuming subtasks, which can be supported
in an integrated authoring environment. We have adapted the modular Eclipse IDE
into sTeXIDE, an authoring solution for enhancing productivity in contributing
to sTeX based corpora. sTeXIDE supports context-aware command completion,
module management, semantic macro retrieval, and theory graph navigation.
|
[
{
"version": "v1",
"created": "Sat, 29 May 2010 22:31:05 GMT"
}
] | 2010-06-01T00:00:00 |
[
[
"Jucovschi",
"Constantin",
""
],
[
"Kohlhase",
"Michael",
""
]
] |
new_dataset
| 0.99078 |
1005.5591
|
Min-Zheng Shieh
|
Min-Zheng Shieh and Shi-Chun Tsai
|
On the minimum weight problem of permutation codes under Chebyshev
distance
|
5 pages. ISIT 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Permutation codes of length $n$ and distance $d$ is a set of permutations on
$n$ symbols, where the distance between any two elements in the set is at least
$d$. Subgroup permutation codes are permutation codes with the property that
the elements are closed under the operation of composition. In this paper,
under the distance metric $\ell_{\infty}$-norm, we prove that finding the
minimum weight codeword for subgroup permutation code is NP-complete. Moreover,
we show that it is NP-hard to approximate the minimum weight within the factor
$7/6-\epsilon$ for any $\epsilon>0$.
|
[
{
"version": "v1",
"created": "Mon, 31 May 2010 06:09:49 GMT"
}
] | 2010-06-01T00:00:00 |
[
[
"Shieh",
"Min-Zheng",
""
],
[
"Tsai",
"Shi-Chun",
""
]
] |
new_dataset
| 0.997967 |
0806.1215
|
Lav Varshney
|
Lav R. Varshney
|
Performance of LDPC Codes Under Faulty Iterative Decoding
|
Revised in May 2010 in response to reviewer comments
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Departing from traditional communication theory where decoding algorithms are
assumed to perform without error, a system where noise perturbs both
computational devices and communication channels is considered here. This paper
studies limits in processing noisy signals with noisy circuits by investigating
the effect of noise on standard iterative decoders for low-density parity-check
codes. Concentration of decoding performance around its average is shown to
hold when noise is introduced into message-passing and local computation.
Density evolution equations for simple faulty iterative decoders are derived.
In one model, computing nonlinear estimation thresholds shows that performance
degrades smoothly as decoder noise increases, but arbitrarily small probability
of error is not achievable. Probability of error may be driven to zero in
another system model; the decoding threshold again decreases smoothly with
decoder noise. As an application of the methods developed, an achievability
result for reliable memory systems constructed from unreliable components is
provided.
|
[
{
"version": "v1",
"created": "Fri, 6 Jun 2008 18:32:08 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Aug 2009 15:36:42 GMT"
},
{
"version": "v3",
"created": "Fri, 28 May 2010 18:13:54 GMT"
}
] | 2010-05-31T00:00:00 |
[
[
"Varshney",
"Lav R.",
""
]
] |
new_dataset
| 0.969339 |
1005.3190
|
Isabel Rodet
|
Annie Luciani (ACROE)
|
From granular avalanches to fluid turbulences through oozing pastes. A
mesoscopic physically-based particle model
| null |
Graphicon 2000, Moscou : Russian Federation (2000)
| null | null |
cs.GR physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe how we can precisely produce complex and various
dynamic morphological features such as structured and chaotic features which
occur in sand pilings (piles, avalanches, internal collapses, arches) , in
flowing fluids (laminar flowing, Kelvin-Helmholtz and Von Karmann eddies), and
in cohesive pastes (twist-and-turn oozing and packing) using only a single
unified model, called "mesoscopic model". This model is a physically-based
particle model whose behavior depends on only four simple, but easy to
understand, physically-based parameters : elasticity, viscosity and their local
areas of influence. It is fast to compute and easy to understand by
non-physicist users.
|
[
{
"version": "v1",
"created": "Tue, 18 May 2010 13:10:28 GMT"
}
] | 2010-05-31T00:00:00 |
[
[
"Luciani",
"Annie",
"",
"ACROE"
]
] |
new_dataset
| 0.99542 |
1005.4028
|
William Jackson
|
Rami Alnaqeib, Hamdan. O. Alanazi, Hamid. A. Jalab, M. A. Zaidan and
Ali K. Hmood
|
Internet Banking System Prototype
|
http://www.journalofcomputing.org
|
Journal of Computing, Volume 2, Issue 5, May 2010
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet Banking System refers to systems that enable bank customers to
access accounts and general information on bank products and services through a
personal computer or other intelligent device. Internet banking products and
services can include detailed account information for corporate customers as
well as account summery and transfer money. Ultimately, the products and
services obtained through Internet Banking may mirror products and services
offered through other bank delivery channels. In this paper, Internet Banking
System Prototype has been proposed in order to illustrate the services which is
provided by the Bank online services.
|
[
{
"version": "v1",
"created": "Fri, 21 May 2010 17:46:45 GMT"
}
] | 2010-05-31T00:00:00 |
[
[
"Alnaqeib",
"Rami",
""
],
[
"Alanazi",
"Hamdan. O.",
""
],
[
"Jalab",
"Hamid. A.",
""
],
[
"Zaidan",
"M. A.",
""
],
[
"Hmood",
"Ali K.",
""
]
] |
new_dataset
| 0.999296 |
0801.3703
|
Margreta Kuijper
|
Margreta Kuijper and Raquel Pinto
|
On minimality of convolutional ring encoders
|
13 pages in v1, submitted; 8 pages in revision v2
|
IEEE Trans. Information Theory, Vol. 55, No. 11, pp. 4890-4897,
November 2009
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Convolutional codes are considered with code sequences modelled as
semi-infinite Laurent series. It is wellknown that a convolutional code C over
a finite group G has a minimal trellis representation that can be derived from
code sequences. It is also wellknown that, for the case that G is a finite
field, any polynomial encoder of C can be algebraically manipulated to yield a
minimal polynomial encoder whose controller canonical realization is a minimal
trellis. In this paper we seek to extend this result to the finite ring case G
= Z_{p^r} by introducing a socalled "p-encoder". We show how to manipulate a
polynomial encoding of a noncatastrophic convolutional code over Z_{p^r} to
produce a particular type of p-encoder ("minimal p-encoder") whose controller
canonical realization is a minimal trellis with nonlinear features. The minimum
number of trellis states is then expressed as p^gamma, where gamma is the sum
of the row degrees of the minimal p-encoder. In particular, we show that any
convolutional code over Z_{p^r} admits a delay-free p-encoder which implies the
novel result that delay-freeness is not a property of the code but of the
encoder, just as in the field case. We conjecture that a similar result holds
with respect to catastrophicity, i.e., any catastrophic convolutional code over
Z_{p^r} admits a noncatastrophic p-encoder.
|
[
{
"version": "v1",
"created": "Thu, 24 Jan 2008 05:07:49 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Apr 2009 05:36:02 GMT"
}
] | 2010-05-28T00:00:00 |
[
[
"Kuijper",
"Margreta",
""
],
[
"Pinto",
"Raquel",
""
]
] |
new_dataset
| 0.987162 |
1005.1635
|
Hossein Bagheri
|
Hossein Bagheri, Abolfazl S. Motahari, and Amir K. Khandani
|
The Approximate Capacity Region of the Gaussian Z-Interference Channel
with Conferencing Encoders
|
25 pages, 6 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which
encoders are connected through noiseless links with finite capacities. In this
setting, prior to each transmission block the encoders communicate with each
other over the cooperative links. The capacity region and the sum-capacity of
the channel are characterized within 1.71 bits per user and 2 bits in total,
respectively. It is also established that properly sharing the total limited
cooperation capacity between the cooperative links may enhance the achievable
region, even when compared to the case of unidirectional transmitter
cooperation with infinite cooperation capacity. To obtain the results,
genie-aided upper bounds on the sum-capacity and cut-set bounds on the
individual rates are compared with the achievable rate region. In the
interference-limited regime, the achievable scheme enjoys a simple type of
Han-Kobayashi signaling, together with the zero-forcing, and basic relaying
techniques. In the noise-limited regime, it is shown that treating interference
as noise achieves the capacity region up to a single bit per user.
|
[
{
"version": "v1",
"created": "Mon, 10 May 2010 19:51:59 GMT"
},
{
"version": "v2",
"created": "Thu, 27 May 2010 00:20:23 GMT"
}
] | 2010-05-28T00:00:00 |
[
[
"Bagheri",
"Hossein",
""
],
[
"Motahari",
"Abolfazl S.",
""
],
[
"Khandani",
"Amir K.",
""
]
] |
new_dataset
| 0.990076 |
1005.4984
|
Tianxiong Ji
|
Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, and
Alexander Stoylar
|
Backpressure-based Packet-by-Packet Adaptive Routing in Communication
Networks
|
13 pages, 9 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Backpressure-based adaptive routing algorithms where each packet is routed
along a possibly different path have been extensively studied in the
literature. However, such algorithms typically result in poor delay performance
and involve high implementation complexity. In this paper, we develop a new
adaptive routing algorithm built upon the widely-studied back-pressure
algorithm. We decouple the routing and scheduling components of the algorithm
by designing a probabilistic routing table which is used to route packets to
per-destination queues. The scheduling decisions in the case of wireless
networks are made using counters called shadow queues. The results are also
extended to the case of networks which employ simple forms of network coding.
In that case, our algorithm provides a low-complexity solution to optimally
exploit the routing-coding tradeoff.
|
[
{
"version": "v1",
"created": "Thu, 27 May 2010 04:31:05 GMT"
}
] | 2010-05-28T00:00:00 |
[
[
"Athanasopoulou",
"Eleftheria",
""
],
[
"Bui",
"Loc",
""
],
[
"Ji",
"Tianxiong",
""
],
[
"Srikant",
"R.",
""
],
[
"Stoylar",
"Alexander",
""
]
] |
new_dataset
| 0.9565 |
1005.5045
|
Mario Bravetti
|
Mario Bravetti
|
File Managing and Program Execution in Web Operating Systems
| null | null | null | null |
cs.SE cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web Operating Systems can be seen as an extension of traditional Operating
Systems where the addresses used to manage files and execute programs (via the
basic load/execution mechanism) are extended from local filesystem path-names
to URLs. A first consequence is that, similarly as in traditional web
technologies, executing a program at a given URL, can be done in two
modalities: either the execution is performed client-side at the invoking
machine (and relative URL addressing in the executed program set to refer to
the invoked URL) or it is performed server-side at the machine addressed by the
invoked URL (as, e.g., for a web service). Moreover in this context, user
identification for access to programs and files and workflow-based composition
of service programs is naturally based on token/session-like mechanisms. We
propose a middleware based on client-server protocols and on a set primitives,
for managing files/resources and executing programs (in the form of
client-side/server-side components/services) in Web Operating Systems. We
formally define the semantics of such middleware via a process algebraic
approach.
|
[
{
"version": "v1",
"created": "Thu, 27 May 2010 12:28:51 GMT"
}
] | 2010-05-28T00:00:00 |
[
[
"Bravetti",
"Mario",
""
]
] |
new_dataset
| 0.985301 |
1005.4564
|
Isabel Rodet
|
Annie Luciani (ACROE, ICA), Matthieu Evrard (ICA), Damien Courouss\'e
(ICA), Nicolas Castagn\'e (ACROE, ICA), Claude Cadoz (ACROE, ICA), Jean-Loup
Florens (ACROE)
|
A basic gesture and motion format for virtual reality multisensory
applications
|
GRAPP'06, Set\`ubal : Portugal (2006)
| null | null | null |
cs.HC cs.GR cs.MM cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The question of encoding movements such as those produced by human gestures
may become central in the coming years, given the growing importance of
movement data exchanges between heterogeneous systems and applications (musical
applications, 3D motion control, virtual reality interaction, etc.). For the
past 20 years, various formats have been proposed for encoding movement,
especially gestures. Though, these formats, at different degrees, were designed
in the context of quite specific applications (character animation, motion
capture, musical gesture, biomechanical concerns...). The article introduce a
new file format, called GMS (for 'Gesture and Motion Signal'), with the aim of
being more low-level and generic, by defining the minimal features a format
carrying movement/gesture information needs, rather than by gathering all the
information generally given by the existing formats. The article argues that,
given its growing presence in virtual reality situations, the "gesture signal"
itself must be encoded, and that a specific format is needed. The proposed
format features the inner properties of such signals: dimensionality,
structural features, types of variables, and spatial and temporal properties.
The article first reviews the various situations with multisensory virtual
objects in which gesture controls intervene. The proposed format is then
deduced, as a mean to encode such versatile and variable "gestural and animated
scene".
|
[
{
"version": "v1",
"created": "Tue, 25 May 2010 13:16:29 GMT"
}
] | 2010-05-26T00:00:00 |
[
[
"Luciani",
"Annie",
"",
"ACROE, ICA"
],
[
"Evrard",
"Matthieu",
"",
"ICA"
],
[
"Couroussé",
"Damien",
"",
"ICA"
],
[
"Castagné",
"Nicolas",
"",
"ACROE, ICA"
],
[
"Cadoz",
"Claude",
"",
"ACROE, ICA"
],
[
"Florens",
"Jean-Loup",
"",
"ACROE"
]
] |
new_dataset
| 0.993184 |
0910.4507
|
Sam Skipsey
|
Sam Skipsey (1), David Ambrose-Griffith (2), Greig Cowan (3), Mike
Kenyon (1), Orlando Richards (3), Phil Roffe (2), Graeme Stewart (1) ((1)
University of Glasgow, UK, (2) University of Durham, UK, (3) University of
Edinburgh, UK)
|
ScotGrid: Providing an Effective Distributed Tier-2 in the LHC Era
|
Preprint for 17th International Conference on Computing in High
Energy and Nuclear Physics, 7 pages, 1 figure
|
J.Phys.Conf.Ser.219:052014,2010
|
10.1088/1742-6596/219/5/052014
|
GLAS-PPE/2009-07
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ScotGrid is a distributed Tier-2 centre in the UK with sites in Durham,
Edinburgh and Glasgow. ScotGrid has undergone a huge expansion in hardware in
anticipation of the LHC and now provides more than 4MSI2K and 500TB to the LHC
VOs. Scaling up to this level of provision has brought many challenges to the
Tier-2 and we show in this paper how we have adopted new methods of organising
the centres, from fabric management and monitoring to remote management of
sites to management and operational procedures, to meet these challenges. We
describe how we have coped with different operational models at the sites,
where Glagsow and Durham sites are managed "in house" but resources at
Edinburgh are managed as a central university resource. This required the
adoption of a different fabric management model at Edinburgh and a special
engagement with the cluster managers. Challenges arose from the different job
models of local and grid submission that required special attention to resolve.
We show how ScotGrid has successfully provided an infrastructure for ATLAS and
LHCb Monte Carlo production. Special attention has been paid to ensuring that
user analysis functions efficiently, which has required optimisation of local
storage and networking to cope with the demands of user analysis. Finally,
although these Tier-2 resources are pledged to the whole VO, we have
established close links with our local physics user communities as being the
best way to ensure that the Tier-2 functions effectively as a part of the LHC
grid computing framework..
|
[
{
"version": "v1",
"created": "Fri, 23 Oct 2009 13:02:19 GMT"
}
] | 2010-05-25T00:00:00 |
[
[
"Skipsey",
"Sam",
""
],
[
"Ambrose-Griffith",
"David",
""
],
[
"Cowan",
"Greig",
""
],
[
"Kenyon",
"Mike",
""
],
[
"Richards",
"Orlando",
""
],
[
"Roffe",
"Phil",
""
],
[
"Stewart",
"Graeme",
""
]
] |
new_dataset
| 0.984463 |
1005.4290
|
Chriss Romy
|
C. S. Sridhar, R. ShashiKumar, S. Madhava Kumar, Manjula Sridhar,
Varun. D
|
E-Speed Governors For Public Transport Vehicles
|
IEEE Publication format, International Journal of Computer Science
and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
An accident is unexpected, unusual, unintended and identifiable external
event which occurs at any place and at any time. The major concern faced by the
government and traffic officials is over speeding at limited speed zones like
hospitals, schools or residential places leading to causalities and more deaths
on the roads. Hence the speed of the vehicles is to be regulated and confined
to the limits as prescribed by the traffic regulations. In this paper we
propose a solution in the form of providing E-speed governor fitted with a
wireless communication system consisting of a Rx which receives the information
regarding the speed regulation for their zones. The TX will be made highly
intelligent and decide when receiver should be made active to regulate the
speed and unwarranted honking from the vehicles which can be deactivated in the
silent zones.
|
[
{
"version": "v1",
"created": "Mon, 24 May 2010 09:50:52 GMT"
}
] | 2010-05-25T00:00:00 |
[
[
"Sridhar",
"C. S.",
""
],
[
"ShashiKumar",
"R.",
""
],
[
"Kumar",
"S. Madhava",
""
],
[
"Sridhar",
"Manjula",
""
],
[
"D",
"Varun.",
""
]
] |
new_dataset
| 0.999628 |
1005.4395
|
Joseph Collins
|
Joseph B. Collins
|
An OpenMath Content Dictionary for Tensor Concepts
|
To appear in The 9th International Conference on Mathematical
Knowledge Management: MKM 2010
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new OpenMath content dictionary, named tensor1, containing
symbols for the expression of tensor formulas. These symbols support the
expression of non-Cartesian coordinates and invariant, multilinear expressions
in the context of coordinate transformations. While current OpenMath symbols
support the expression of linear algebra formulas using matrices and vectors,
we find that there is an underlying assumption of Cartesian, or standard,
coordinates that makes the expression of general tensor formulas difficult, if
not impossible. In introducing these new OpenMath symbols for the expression of
tensor formulas, we attempt to maintain, as much as possible, consistency with
prior OpenMath symbol definitions for linear algebra.
|
[
{
"version": "v1",
"created": "Mon, 24 May 2010 18:46:34 GMT"
}
] | 2010-05-25T00:00:00 |
[
[
"Collins",
"Joseph B.",
""
]
] |
new_dataset
| 0.999072 |
1005.4009
|
William Jackson
|
E. Jenefa JebaJothi, V. Kavitha and T. Kavitha
|
Contention Based Routing in Mobile Ad Hoc Networks with Multiple Copies
|
http://www.journalofcomputing.org
|
Journal of Computing, Volume 2, Issue 5, May 2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Routing the packets efficiently in mobile ad hoc network does not have end to
end paths. Multiple copies are forwarded from the source to the destination. To
deal with such networks, researches introduced flooding based routing schemes
which leads to high probability of delivery. But the flooding based routing
schemes suffered with contention and large delays. Here the proposed protocol
"Spray Select Focus", sprays a few message copies into the network, neighbors
receives a copy and by that relay nodes we are choosing the shortest route and
then route that copy towards the destination. Previous works assumption is that
there is no contention and dead ends. But we argue that contention and dead
ends must be considered for finding efficiency in routing. So we are including
a network which has contention and dead ends and we applied the proposed
protocol. We can say that this protocol works well for the contention based
network.
|
[
{
"version": "v1",
"created": "Fri, 21 May 2010 17:09:47 GMT"
}
] | 2010-05-24T00:00:00 |
[
[
"JebaJothi",
"E. Jenefa",
""
],
[
"Kavitha",
"V.",
""
],
[
"Kavitha",
"T.",
""
]
] |
new_dataset
| 0.99946 |
1001.2942
|
Xiyong Zhang
|
Xiyong Zhang, Hua Guo, Yifa Li
|
Proof of a Conjecture about Rotation Symmetric Functions
| null | null | null | null |
cs.CR cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rotation symmetric Boolean functions have important applications in the
design of cryptographic algorithms. In this paper, the Conjecture about
rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and
St\u{a}nic\u{a} is proved. As a result, the nonlinearity of such kind of
functions is determined.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2010 02:27:46 GMT"
},
{
"version": "v2",
"created": "Thu, 20 May 2010 14:01:06 GMT"
}
] | 2010-05-21T00:00:00 |
[
[
"Zhang",
"Xiyong",
""
],
[
"Guo",
"Hua",
""
],
[
"Li",
"Yifa",
""
]
] |
new_dataset
| 0.995081 |
0910.4325
|
Simon Blackburn
|
Simon R. Blackburn, Maura B. Paterson and Douglas R. Stinson
|
Putting Dots in Triangles
|
10 pages Minor rephrasing: final version to submit to journal.
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a right-angled triangle of squares in a grid whose horizontal and
vertical sides are $n$ squares long, let N(n) denote the maximum number of dots
that can be placed into the cells of the triangle such that each row, each
column, and each diagonal parallel to the long side of the triangle contains at
most one dot. It has been proven that
$N(n) = \lfloor \frac{2n+1}{3} \rfloor$.
In this note, we give a new proof of this result using linear programming
techniques.
|
[
{
"version": "v1",
"created": "Thu, 22 Oct 2009 13:35:51 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Nov 2009 14:10:14 GMT"
},
{
"version": "v3",
"created": "Tue, 18 May 2010 14:27:23 GMT"
}
] | 2010-05-19T00:00:00 |
[
[
"Blackburn",
"Simon R.",
""
],
[
"Paterson",
"Maura B.",
""
],
[
"Stinson",
"Douglas R.",
""
]
] |
new_dataset
| 0.974822 |
0707.3540
|
Patrick Erik Bradley
|
Patrick Erik Bradley
|
Mumford dendrograms
|
16 pages, 7 figures; Incorporating Special Issue: Ultrametric and
p-Adic Applications in Computer Science
|
The Computer Journal, Vol. 53, No. 4 (2010), 393-404
|
10.1093/comjnl/bxm088
| null |
cs.DM
| null |
An effective $p$-adic encoding of dendrograms is presented through an
explicit embedding into the Bruhat-Tits tree for a $p$-adic number field. This
field depends on the number of children of a vertex and is a finite extension
of the field of $p$-adic numbers. It is shown that fixing $p$-adic
representatives of the residue field allows a natural way of encoding strings
by identifying a given alphabet with such representatives. A simple $p$-adic
hierarchic classification algorithm is derived for $p$-adic numbers, and is
applied to strings over finite alphabets. Examples of DNA coding are presented
and discussed. Finally, new geometric and combinatorial invariants of time
series of $p$-adic dendrograms are developped.
|
[
{
"version": "v1",
"created": "Tue, 24 Jul 2007 13:00:17 GMT"
}
] | 2010-05-18T00:00:00 |
[
[
"Bradley",
"Patrick Erik",
""
]
] |
new_dataset
| 0.998982 |
0711.0840
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
A thread calculus with molecular dynamics
|
47 pages; examples and results added, phrasing improved, references
replaced
|
Information and Computation, 208(7):817-844, 2010
|
10.1016/j.ic.2010.01.004
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a theory of threads, interleaving of threads, and interaction
between threads and services with features of molecular dynamics, a model of
computation that bears on computations in which dynamic data structures are
involved. Threads can interact with services of which the states consist of
structured data objects and computations take place by means of actions which
may change the structure of the data objects. The features introduced include
restriction of the scope of names used in threads to refer to data objects.
Because that feature makes it troublesome to provide a model based on
structural operational semantics and bisimulation, we construct a projective
limit model for the theory.
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2007 11:25:20 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Nov 2008 09:29:03 GMT"
}
] | 2010-05-18T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.992993 |
1005.2672
|
Carst Tankink
|
Carst Tankink and Herman Geuvers and James McKinna and Freek Wiedijk
|
Proviola: A Tool for Proof Re-animation
|
Accepted for the 9th International Conference on Mathematical
Knowledge Management (MKM 2010), 15 pages
| null | null | null |
cs.LO cs.DL cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To improve on existing models of interaction with a proof assistant (PA), in
particular for storage and replay of proofs, we in- troduce three related
concepts, those of: a proof movie, consisting of frames which record both user
input and the corresponding PA response; a camera, which films a user's
interactive session with a PA as a movie; and a proviola, which replays a movie
frame-by-frame to a third party. In this paper we describe the movie data
structure and we discuss a proto- type implementation of the camera and
proviola based on the ProofWeb system. ProofWeb uncouples the interaction with
a PA via a web- interface (the client) from the actual PA that resides on the
server. Our camera films a movie by "listening" to the ProofWeb communication.
The first reason for developing movies is to uncouple the reviewing of a formal
proof from the PA used to develop it: the movie concept enables users to
discuss small code fragments without the need to install the PA or to load a
whole library into it. Other advantages include the possibility to develop a
separate com- mentary track to discuss or explain the PA interaction. We assert
that a combined camera+proviola provides a generic layer between a client
(user) and a server (PA). Finally we claim that movies are the right type of
data to be stored in an encyclopedia of formalized mathematics, based on our
experience in filming the Coq standard library.
|
[
{
"version": "v1",
"created": "Sat, 15 May 2010 12:54:28 GMT"
}
] | 2010-05-18T00:00:00 |
[
[
"Tankink",
"Carst",
""
],
[
"Geuvers",
"Herman",
""
],
[
"McKinna",
"James",
""
],
[
"Wiedijk",
"Freek",
""
]
] |
new_dataset
| 0.998466 |
0903.4826
|
Fernando Hernando
|
Fernando Hernando and Diego Ruano
|
New Linear Codes from Matrix-Product Codes with Polynomial Units
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new construction of codes from old ones is considered, it is an extension
of the matrix-product construction. Several linear codes that improve the
parameters of the known ones are presented.
|
[
{
"version": "v1",
"created": "Fri, 27 Mar 2009 15:30:58 GMT"
},
{
"version": "v2",
"created": "Wed, 12 May 2010 16:06:21 GMT"
}
] | 2010-05-13T00:00:00 |
[
[
"Hernando",
"Fernando",
""
],
[
"Ruano",
"Diego",
""
]
] |
new_dataset
| 0.999717 |
1005.1744
|
Dan Shepherd
|
Dan Shepherd
|
Binary Matroids and Quantum Probability Distributions
|
24 pages (inc appendix & refs)
| null | null | null |
cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We characterise the probability distributions that arise from quantum
circuits all of whose gates commute, and show when these distributions can be
classically simulated efficiently. We consider also marginal distributions and
the computation of correlation coefficients, and draw connections between the
simulation of stabiliser circuits and the combinatorics of representable
matroids, as developed in the 1990s.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 08:13:14 GMT"
}
] | 2010-05-12T00:00:00 |
[
[
"Shepherd",
"Dan",
""
]
] |
new_dataset
| 0.983789 |
1005.1835
|
Benjamin Steinberg
|
Benjamin Steinberg
|
The Cerny conjecture for one-cluster automata with prime length cycle
| null | null | null | null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove the Cerny conjecture for one-cluster automata with prime length
cycle. Consequences are given for the hybrid Road-coloring-Cerny conjecture for
digraphs with a proper cycle of prime length.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 13:55:00 GMT"
}
] | 2010-05-12T00:00:00 |
[
[
"Steinberg",
"Benjamin",
""
]
] |
new_dataset
| 0.990485 |
1005.1349
|
Ali Al-Bashabsheh
|
Ali Al-Bashabsheh, Yongyi Mao and Abbas Yongacoglu
|
On Holant Theorem and Its Proof
|
25th Queen's Biennial Symposium on Communications.
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Holographic algorithms are a recent breakthrough in computer science and has
found applications in information theory. This paper provides a proof to the
central component of holographic algorithms, namely, the Holant theorem.
Compared with previous works, the proof appears simpler and more direct. Along
the proof, we also develop a mathematical tool, which we call c-tensor. We
expect the notion of c-tensor may be applicable over a wide range of analysis.
|
[
{
"version": "v1",
"created": "Sat, 8 May 2010 19:28:55 GMT"
}
] | 2010-05-11T00:00:00 |
[
[
"Al-Bashabsheh",
"Ali",
""
],
[
"Mao",
"Yongyi",
""
],
[
"Yongacoglu",
"Abbas",
""
]
] |
new_dataset
| 0.98052 |
1005.0813
|
Robert Weigel
|
R.S. Weigel, D. M. Lindholm, A. Wilson, and J. Faden
|
TSDS: high-performance merge, subset, and filter software for time
series-like data
|
Submitted to Earth Science Informatics
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time Series Data Server (TSDS) is a software package for implementing a
server that provides fast super-setting, sub-setting, filtering, and uniform
gridding of time series-like data. TSDS was developed to respond quickly to
requests for long time spans of data. Data may be served from a fast database,
typically created by aggregating granules (e.g., data files) from a remote data
source and storing them in a local cache that is optimized for serving time
series. The system was designed specifically for time series data, and is
optimized for requests where the longest dimension of the requested data
structure is time. Scalar, vector, and spectrogram time series types are
supported. The user can interact with the server by requesting a time series, a
date range, and an optional filter to apply to the data. Available filters
include strides, block average/minimum/maximum, exclude, and inequality.
Constraint expressions are supported, which allow such operations as a request
for data from one time series when a different time series satisfied a
specified relationship. TSDS builds upon DAP (Data Access Protocol), NcML
(netCDF Mark-up language) and related software libraries. In this work, we
describe the current design of this server, as well as planned features and
potential implementation strategies.
|
[
{
"version": "v1",
"created": "Tue, 13 Apr 2010 23:30:24 GMT"
}
] | 2010-05-06T00:00:00 |
[
[
"Weigel",
"R. S.",
""
],
[
"Lindholm",
"D. M.",
""
],
[
"Wilson",
"A.",
""
],
[
"Faden",
"J.",
""
]
] |
new_dataset
| 0.998897 |
1005.0086
|
Pino Caballero-Gil
|
Pino Caballero-Gil, Amparo F\'uster-Sabater, Oscar Delgado-Mohatar
|
Linear Cellular Automata as Discrete Models for Generating Cryptographic
Sequences
| null |
Journal of Research and Practice in Information Technology, Vol.
40, No. 4, November 2008
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we develop a new cellular automata-based linear model for
several nonlinear pseudorandom number generators with practical applications in
symmetric cryptography. Such a model generates all the solutions of linear
binary difference equations as well as many of these solutions are
pseudo-random keystream sequences. In this way, a linear structure based on
cellular automata may be used to generate not only difference equation
solutions but also cryptographic sequences. The proposed model is very simple
since it is based exclusively on successive concatenations of a basic linear
automaton.
|
[
{
"version": "v1",
"created": "Sat, 1 May 2010 15:31:01 GMT"
}
] | 2010-05-04T00:00:00 |
[
[
"Caballero-Gil",
"Pino",
""
],
[
"Fúster-Sabater",
"Amparo",
""
],
[
"Delgado-Mohatar",
"Oscar",
""
]
] |
new_dataset
| 0.96255 |
1005.0139
|
Sugata Sanyal
|
Jayesh Kataria, P.S. Dhekne and Sugata Sanyal
|
ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route
Requests
|
15 Pages, 6 Figures, 1 table, 3rd International Conference on
Computers and Devices for Communication (CODEC-06) Institute of Radio Physics
and Electronics, University of Calcutta, December 18-20, 2006.
|
International Journal of Computers, Information Technology and
Engineering (IJCITAE), Vol. 1, No. 1, pp 9-15, June 2007, Serial
Publications.
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing
(AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are
used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with
control packets. There is generally a limit on the number of these packets that
can be generated or forwarded. But a malicious node can disregard this limit
and flood the network with fake control packets. These packets hog the limited
bandwidth and processing power of genuine nodes in the network while being
forwarded. Due to this, genuine route requests suffer and many routes either do
not get a chance to materialize or they end up being longer than otherwise. In
this paper we propose a non cryptographic solution to the above problem and
prove its efficiency by means of simulation.
|
[
{
"version": "v1",
"created": "Sun, 2 May 2010 13:11:48 GMT"
}
] | 2010-05-04T00:00:00 |
[
[
"Kataria",
"Jayesh",
""
],
[
"Dhekne",
"P. S.",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.995963 |
1005.0146
|
Vyacheslav Levitsky
|
Andriy Kovalchuk, Vyacheslav Levitsky, Igor Samolyuk and Valentyn
Yanchuk
|
The Formulator MathML Editor Project: User-Friendly Authoring of Content
Markup Documents
|
To appear in The 9th International Conference on Mathematical
Knowledge Management: MKM 2010
| null | null | null |
cs.DL cs.HC cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Implementation of an editing process for Content MathML formulas in common
visual style is a real challenge for a software developer who does not really
want the user to have to understand the structure of Content MathML in order to
edit an expression, since it is expected that users are often not that
technically minded. In this paper, we demonstrate how this aim is achieved in
the context of the Formulator project and discuss features of this MathML
editor, which provides a user with a WYSIWYG editing style while authoring
MathML documents with Content or mixed markup. We also present the approach
taken to enhance availability of the MathML editor to end-users, demonstrating
an online version of the editor that runs inside a Web browser.
|
[
{
"version": "v1",
"created": "Sun, 2 May 2010 16:12:32 GMT"
}
] | 2010-05-04T00:00:00 |
[
[
"Kovalchuk",
"Andriy",
""
],
[
"Levitsky",
"Vyacheslav",
""
],
[
"Samolyuk",
"Igor",
""
],
[
"Yanchuk",
"Valentyn",
""
]
] |
new_dataset
| 0.999514 |
1004.5436
|
Kang Ning
|
Kang Ning
|
Multiple oligo nucleotide arrays: Methods to reduce manufacture time and
cost
|
11 pages, 7 figures. A simple method targets some researchers in the
field.
| null | null | null |
cs.DM q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The customized multiple arrays are becoming vastly used in microarray
experiments for varies purposes, mainly for its ability to handle a large
quantity of data and output high quality results. However, experimenters who
use customized multiple arrays still face many problems, such as the cost and
time to manufacture the masks, and the cost for production of the multiple
arrays by costly machines. Although there is some research on the multiple
arrays, there is little concern on the manufacture time and cost, which is
actually important to experimenters. In this paper, we have proposed methods to
reduce the time and cost for the manufacture of the customized multiple arrays.
We have first introduced a heuristic algorithm for the mask decomposition
problem for multiple arrays. Then a streamline method is proposed for the
integration of different steps of manufacture on a higher level. Experiments
show that our methods are very effective in reduction of the time and cost of
manufacture of multiple arrays.
|
[
{
"version": "v1",
"created": "Fri, 30 Apr 2010 02:27:54 GMT"
}
] | 2010-05-03T00:00:00 |
[
[
"Ning",
"Kang",
""
]
] |
new_dataset
| 0.97518 |
1004.5601
|
Punarbasu Purkayastha
|
Alexander Barg and Punarbasu Purkayastha
|
Near MDS poset codes and distributions
|
13 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study $q$-ary codes with distance defined by a partial order of the
coordinates of the codewords. Maximum Distance Separable (MDS) codes in the
poset metric have been studied in a number of earlier works. We consider codes
that are close to MDS codes by the value of their minimum distance. For such
codes, we determine their weight distribution, and in the particular case of
the "ordered metric" characterize distributions of points in the unit cube
defined by the codes. We also give some constructions of codes in the ordered
Hamming space.
|
[
{
"version": "v1",
"created": "Fri, 30 Apr 2010 19:45:38 GMT"
}
] | 2010-05-03T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Purkayastha",
"Punarbasu",
""
]
] |
new_dataset
| 0.999143 |
1004.5195
|
Natalia Silberstein
|
Natalia Silberstein and Tuvi Etzion
|
On Perfect Codes in the Johnson Graph
|
Submitted for ACCT 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we consider the existence of nontrivial perfect codes in the
Johnson graph J(n,w). We present combinatorial and number theory techniques to
provide necessary conditions for existence of such codes and reduce the range
of parameters in which 1-perfect and 2-perfect codes may exist.
|
[
{
"version": "v1",
"created": "Thu, 29 Apr 2010 06:38:59 GMT"
}
] | 2010-04-30T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.990728 |
1004.5214
|
Valentin Savin
|
Valentin Savin
|
Split-Extended LDPC codes for coded cooperation
|
6 pages, ISITA10
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new code design that aims to distribute an LDPC code over a
relay channel. It is based on a split-and-extend approach, which allows the
relay to split the set of bits connected to some parity-check of the LDPC code
into two or several subsets. Subsequently, the sums of bits within each subset
are used in a repeat-accumulate manner in order to generate extra bits sent
from the relay toward the destination. We show that the proposed design yields
LDPC codes with enhanced correction capacity and can be advantageously applied
to existing codes, which allows for addressing cooperation issues for evolving
standards. Finally, we derive density evolution equations for the proposed
design, and we show that Split-Extended LDPC codes can approach very closely
the capacity of the Gaussian relay channel.
|
[
{
"version": "v1",
"created": "Thu, 29 Apr 2010 08:10:02 GMT"
}
] | 2010-04-30T00:00:00 |
[
[
"Savin",
"Valentin",
""
]
] |
new_dataset
| 0.998658 |
1004.5257
|
Pierre Lescanne
|
Pierre Lescanne (LIP), Perrinel Matthieu (LIP)
|
On the Rationality of Escalation
|
23 p.
| null | null | null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Escalation is a typical feature of infinite games. Therefore tools conceived
for studying infinite mathematical structures, namely those deriving from
coinduction are essential. Here we use coinduction, or backward coinduction (to
show its connection with the same concept for finite games) to study carefully
and formally the infinite games especially those called dollar auctions, which
are considered as the paradigm of escalation. Unlike what is commonly admitted,
we show that, provided one assumes that the other agent will always stop,
bidding is rational, because it results in a subgame perfect equilibrium. We
show that this is not the only rational strategy profile (the only subgame
perfect equilibrium). Indeed if an agent stops and will stop at every step, we
claim that he is rational as well, if one admits that his opponent will never
stop, because this corresponds to a subgame perfect equilibrium. Amazingly, in
the infinite dollar auction game, the behavior in which both agents stop at
each step is not a Nash equilibrium, hence is not a subgame perfect
equilibrium, hence is not rational.
|
[
{
"version": "v1",
"created": "Thu, 29 Apr 2010 12:03:29 GMT"
}
] | 2010-04-30T00:00:00 |
[
[
"Lescanne",
"Pierre",
"",
"LIP"
],
[
"Matthieu",
"Perrinel",
"",
"LIP"
]
] |
new_dataset
| 0.985187 |
0805.0501
|
Christian Senger
|
Christian Senger, Vladimir Sidorenko, Martin Bossert, Victor Zyablov
|
Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon
Codes
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008. 5 pages, 2 figures
| null |
10.1109/ISIT.2008.4595300
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generalized Concatenated codes are a code construction consisting of a number
of outer codes whose code symbols are protected by an inner code. As outer
codes, we assume the most frequently used Reed-Solomon codes; as inner code, we
assume some linear block code which can be decoded up to half its minimum
distance. Decoding up to half the minimum distance of Generalized Concatenated
codes is classically achieved by the Blokh-Zyablov-Dumer algorithm, which
iteratively decodes by first using the inner decoder to get an estimate of the
outer code words and then using an outer error/erasure decoder with a varying
number of erasures determined by a set of pre-calculated thresholds. In this
paper, a modified version of the Blokh-Zyablov-Dumer algorithm is proposed,
which exploits the fact that a number of outer Reed-Solomon codes with average
minimum distance d can be grouped into one single Interleaved Reed-Solomon code
which can be decoded beyond d/2. This allows to skip a number of decoding
iterations on the one hand and to reduce the complexity of each decoding
iteration significantly - while maintaining the decoding performance - on the
other.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2008 10:12:13 GMT"
}
] | 2010-04-29T00:00:00 |
[
[
"Senger",
"Christian",
""
],
[
"Sidorenko",
"Vladimir",
""
],
[
"Bossert",
"Martin",
""
],
[
"Zyablov",
"Victor",
""
]
] |
new_dataset
| 0.993241 |
1004.5034
|
Franck Butelle
|
Franck Butelle and Florent Hivert and Micaela Mayero and Fr\'ed\'eric
Toumazet
|
Formal Proof of SCHUR Conjugate Function
|
To appear in CALCULEMUS 2010
| null | null | null |
cs.LO cs.MS cs.SC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main goal of our work is to formally prove the correctness of the key
commands of the SCHUR software, an interactive program for calculating with
characters of Lie groups and symmetric functions. The core of the computations
relies on enumeration and manipulation of combinatorial structures. As a first
"proof of concept", we present a formal proof of the conjugate function,
written in C. This function computes the conjugate of an integer partition. To
formally prove this program, we use the Frama-C software. It allows us to
annotate C functions and to generate proof obligations, which are proved using
several automated theorem provers. In this paper, we also draw on methodology,
discussing on how to formally prove this kind of program.
|
[
{
"version": "v1",
"created": "Wed, 28 Apr 2010 14:12:43 GMT"
}
] | 2010-04-29T00:00:00 |
[
[
"Butelle",
"Franck",
""
],
[
"Hivert",
"Florent",
""
],
[
"Mayero",
"Micaela",
""
],
[
"Toumazet",
"Frédéric",
""
]
] |
new_dataset
| 0.998863 |
1004.4821
|
Ashley Smith
|
Wriddhi Bhowmik and Shweta Srivastava
|
Optimum Design of a 4x4 Planar Butler Matrix Array for WLAN Application
|
Wriddhi Bhowmik and Shweta Srivastava, "Optimum Design of a 4x4
Planar Butler Matrix Array for WLAN Application", Journal of
Telecommunications, Volume 2, Issue 1, p68-74, April 2010
|
Journal of Telecommunications, Volume 2, Issue 1, p68-74, April
2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, high-speed wireless communication is in vogue. In wireless
communication systems, multipath fading, delay and interference occurres by
reflection or diffraction. In a high-speed wireless communication, it becomes a
necessary to separate desired signal from delay or interference signal. Thus to
overcome these problems Smart antenna systems have been developed. Basically
there are two types of smart antenna systems, one is Switched beam system and
another Adaptive array system.This paper presents the optimum design of a 4x4
plannar Butler matrix array as a key component of a switched beam smart antenna
system, operating at 5.2 GHz for WLAN with a dielectric substrate, FR4 of er
=4.9 and h=1.6mm. Conception details, simulation results and measurements are
also given for the components (microstrip antenna, hybrid couplers,
cross-coupler, phase shifter) used to implement the matrix. In this
dissertation, mathematical calculations for all the components using MATLAB is
done and then every individual component is designed using the commercial
software SONNET. Then these entire components have been combined on a single
substrate and simulated using SONNET.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 19:09:17 GMT"
}
] | 2010-04-28T00:00:00 |
[
[
"Bhowmik",
"Wriddhi",
""
],
[
"Srivastava",
"Shweta",
""
]
] |
new_dataset
| 0.988728 |
0910.5697
|
Eitan Yaakobi
|
Eitan Yaakobi and Tuvi Etzion
|
High Dimensional Error-Correcting Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we construct multidimensional codes with high dimension. The
codes can correct high dimensional errors which have the form of either small
clusters, or confined to an area with a small radius. We also consider small
number of errors in a small area. The clusters which are discussed are mainly
spheres such as semi-crosses and crosses. Also considered are clusters with
small number of errors such as 2-bursts, two errors in various clusters, and
three errors on a line. Our main focus is on the redundancy of the codes when
the most dominant parameter is the dimension of the code.
|
[
{
"version": "v1",
"created": "Thu, 29 Oct 2009 18:06:41 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Apr 2010 08:35:15 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Yaakobi",
"Eitan",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.973366 |
1004.4356
|
Gautam Thakur
|
Gautam S. Thakur, Mukul Sharma, Ahmed Helmy
|
SHIELD: Social sensing and Help In Emergency using mobiLe Devices
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
School and College campuses face a perceived threat of violent crimes and
require a realistic plan against unpredictable emergencies and disasters.
Existing emergency systems (e.g., 911, campus-wide alerts) are quite useful,
but provide delayed response (often tens of minutes) and do not utilize
proximity or locality. There is a need to augment such systems with
proximity-based systems for more immediate response to attempt to prevent and
deter crime. In this paper we propose SHIELD, an on-campus emergency rescue and
alert management service. It is a fully distributed infrastructure-less
platform based on proximity-enabled trust and cooperation. It relies on
localized responses, sent using Bluetooth and/or WiFi on the fly to achieve
minimal response time and maximal availability thereby augmenting the
traditional notion of emergency services. Analysis of campus crime statistics
and WLAN traces surprisingly show a strong positive correlation (over 55%)
between on-campus crime statistics and spatio-temporal density distribution of
on-campus mobile users. This result provides a motivation to develop such
platform and points to the promise in reducing crime incidences. We also show
an implementation of a prototype application to be used in such scenarios.
|
[
{
"version": "v1",
"created": "Sun, 25 Apr 2010 15:10:56 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Thakur",
"Gautam S.",
""
],
[
"Sharma",
"Mukul",
""
],
[
"Helmy",
"Ahmed",
""
]
] |
new_dataset
| 0.992731 |
1004.4465
|
William Jackson
|
Er. Anantdeep, Er. Sandeep kaur and Er. Balpreet Kaur
|
Mobile Zigbee Sensor Networks
|
https://sites.google.com/site/journalofcomputing/
|
Journal of Computing, Volume 2, Issue 4, April 2010, 95-99
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OPNET Modeler accelerates network R&D and improves product quality through
high-fidelity modeling and scalable simulation. It provides a virtual
environment for designing protocols and devices, and for testing and
demonstrating designs in realistic scenarios prior to production. OPNET Modeler
supports 802.15.4 standard and has been used to make a model of PAN. Iterations
have been performed by changing the Power of the transmitter and the throughput
will has been analyzed to arrive at optimal values.An energy-efficient wireless
home network based on IEEE 802.15.4, a novel architecture has been proposed. In
this architecture, all nodes are classified into stationary nodes and mobile
nodes according to the functionality of each node. Mobile nodes are usually
battery-powered, and therefore need low-power operation. In order to improve
power consumption of mobile nodes, effective handover sequence based on MAC
broadcast and transmission power control based on LQ (link quality) are
employed. Experimental results demonstrate that by using the proposed
architecture, communication time and power consumption of mobile nodes can be
reduced by 1.2 seconds and 42.8%, respectively.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 10:13:09 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Anantdeep",
"Er.",
""
],
[
"kaur",
"Er. Sandeep",
""
],
[
"Kaur",
"Er. Balpreet",
""
]
] |
new_dataset
| 0.978244 |
1004.4469
|
William Jackson
|
Khawar Hameed, Kamran Ahsan and Weijun Yang
|
Mobile Commerce and Applications: An Exploratory Study and Review
|
Journal of Computing online at
https://sites.google.com/site/journalofcomputing/
|
Journal of Computing, Volume 2, Issue 4, April 2010
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile commerce is enabling the development of additional revenue streams for
organizations through the delivery of chargeable mobile services. According to
the European Information Technology Observatory, the total amount of revenue
generated by mobile commerce was reported to be less than {\pounds}9 million in
the United Kingdom in 2001. By 2005 this had, at least, doubled and more recent
industry forecasts project significant global growth in this area. Mobile
commerce creates a range of business opportunities and new revenue streams for
businesses across industry sectors via the deployment of innovative services,
applications and associated information content. This paper presents a review
of mobile commerce business models and their importance for the creation of
mobile commerce solutions.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 10:19:59 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Hameed",
"Khawar",
""
],
[
"Ahsan",
"Kamran",
""
],
[
"Yang",
"Weijun",
""
]
] |
new_dataset
| 0.999638 |
1004.4583
|
Ashley Smith
|
Iwan Adhicandra
|
Measuring Data and VoIP Traffic in WiMAX Networks
|
Iwan Adhicandra, "Measuring Data and VoIP Traffic in WiMAX Networks",
Journal of Telecommunications, Volume 2, Issue 1, p1-6, April 2010
|
Journal of Telecommunications, Volume 2, Issue 1, p1-6, April 2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to its large coverage area, low cost of deployment and high speed data
rates, WiMAX is a promising technology for providing wireless last-mile
connectivity. Physical and MAC layer of this technology refer to the IEEE
802.16e standard, which defines 5 different data delivery service classes that
can be used in order to satisfy Quality of Service (QoS) requirements of
different applications, such as VoIP, videoconference, FTP, Web, etc. The main
aim of the paper is to examine a case of QoS deployment over a cellular WiMAX
network. In particular, the paper compares the performance obtained using two
different QoS configurations differing from the delivery service class used to
transport VoIP traffic, i.e. UGS or ertPS. Results indicate that for
delay-sensitive traffic that fluctuates beyond its nominal rate, having the
possibility to give back some of its reserved bandwidth, ertPS has the
advantage to permit the transmission of BE traffic.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 18:00:35 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Adhicandra",
"Iwan",
""
]
] |
new_dataset
| 0.993915 |
1004.4605
|
Ashley Smith
|
Abdelati Malek Amel, Ben Abdelali Abdessalem and Mtibaa Abdellatif
|
Video shot boundary detection using motion activity descriptor
|
Abdelati Malek Amel, Ben Abdelali Abdessalem and Mtibaa Abdellatif,
"Video shot boundary detection using motion activity descriptor", Journal of
Telecommunications, Volume 2, Issue 1, p54-59, April 2010
|
Journal of Telecommunications, Volume 2, Issue 1, p54-59, April
2010
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focus on the study of the motion activity descriptor for shot
boundary detection in video sequences. We interest in the validation of this
descriptor in the aim of its real time implementation with reasonable high
performances in shot boundary detection. The motion activity information is
extracted in uncompressed domain based on adaptive rood pattern search (ARPS)
algorithm. In this context, the motion activity descriptor was applied for
different video sequence.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 19:00:08 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Amel",
"Abdelati Malek",
""
],
[
"Abdessalem",
"Ben Abdelali",
""
],
[
"Abdellatif",
"Mtibaa",
""
]
] |
new_dataset
| 0.971624 |
1004.4616
|
Ashley Smith
|
Lamia Chaari, Rim Ayadi and Lotfi Kamoun
|
Conception and FPGA implementation of IEEE 802.11s mesh network MAC
layer transmitter
|
Lamia Chaari, Rim Ayadi and Lotfi Kamoun, "Conception and FPGA
implementation of IEEE 802.11s mesh network MAC layer transmitter"
|
Journal of Telecommunications, Volume 2, Issue 1, p115-123, April
2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes, a hardware implementation of Wireless Mesh Networks
(WMN) medium Access Controller (MAC) layer transmitter. In the literature a lot
of works are focused on WMN routing protocol as well as performance analysis
and software integration of WMN units, however few works deals with WMN
hardware implementation. In this field our contribution is to conceive and to
implements on FPGA a WMN MAC transmitter module. Our implementation, written in
hardware description language (HDL) is based on the IEEE 802.11 s standard. The
hardware implementation retains a good performance in speed.
|
[
{
"version": "v1",
"created": "Mon, 26 Apr 2010 19:35:56 GMT"
}
] | 2010-04-27T00:00:00 |
[
[
"Chaari",
"Lamia",
""
],
[
"Ayadi",
"Rim",
""
],
[
"Kamoun",
"Lotfi",
""
]
] |
new_dataset
| 0.991811 |
1004.2003
|
Norbert B\'atfai
|
Norbert B\'atfai
|
The Socceral Force
|
20 pages, 13 figures, added FerSML 0.0.2
| null | null | null |
cs.AI cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have an audacious dream, we would like to develop a simulation and virtual
reality system to support the decision making in European football (soccer). In
this review, we summarize the efforts that we have made to fulfil this dream
until recently. In addition, an introductory version of FerSML (Footballer and
Football Simulation Markup Language) is presented in this paper.
|
[
{
"version": "v1",
"created": "Mon, 12 Apr 2010 16:24:54 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Apr 2010 11:26:15 GMT"
}
] | 2010-04-23T00:00:00 |
[
[
"Bátfai",
"Norbert",
""
]
] |
new_dataset
| 0.992438 |
0911.5667
|
Christian Senger
|
Christian Senger, Steffen Schober, Tong Mao, Alexander Zeh
|
End-to-End Algebraic Network Coding for Wireless TCP/IP Networks
|
Accepted for the 17th International Conference on Telecommunications
2010 (ICT2010), Doha, Qatar, April 4 - 7, 2010. 6 pages, 7 figures
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Transmission Control Protocol (TCP) was designed to provide reliable
transport services in wired networks. In such networks, packet losses mainly
occur due to congestion. Hence, TCP was designed to apply congestion avoidance
techniques to cope with packet losses. Nowadays, TCP is also utilized in
wireless networks where, besides congestion, numerous other reasons for packet
losses exist. This results in reduced throughput and increased transmission
round-trip time when the state of the wireless channel is bad. We propose a new
network layer, that transparently sits below the transport layer and hides non
congestion-imposed packet losses from TCP. The network coding in this new layer
is based on the well-known class of Maximum Distance Separable (MDS) codes.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2009 15:18:39 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Apr 2010 08:09:40 GMT"
}
] | 2010-04-21T00:00:00 |
[
[
"Senger",
"Christian",
""
],
[
"Schober",
"Steffen",
""
],
[
"Mao",
"Tong",
""
],
[
"Zeh",
"Alexander",
""
]
] |
new_dataset
| 0.999299 |
1004.3173
|
Richard Brent
|
Richard P. Brent
|
MP users guide
|
MP Users Guide (fourth edition), 73 pages. A technical report that
was not published elsewhere, submitted for archival purposes. For further
information see http://wwwmaths.anu.edu.au/~brent/pub/pub035.html
| null | null |
TR-CS-81-08, Department of Computer Science, Australian National
University (June 1981)
|
cs.MS math.NA math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MP is a package of ANSI Standard Fortran (ANS X3.9-1966) subroutines for
performing multiple-precision floating-point arithmetic and evaluating
elementary and special functions. The subroutines are machine independent and
the precision is arbitrary, subject to storage limitations. The User's Guide
describes the routines and their calling sequences, example and test programs,
use of the Augment precompiler, and gives installation instructions for the
package.
|
[
{
"version": "v1",
"created": "Mon, 19 Apr 2010 12:26:15 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Apr 2010 00:56:02 GMT"
}
] | 2010-04-21T00:00:00 |
[
[
"Brent",
"Richard P.",
""
]
] |
new_dataset
| 0.995266 |
1004.3486
|
Sheng-Gwo Chen
|
Jyh-Yang Wu, Mei-Hsiu Chi and Sheng-Gwo Chen
|
Convergent discrete Laplace-Beltrami operators over surfaces
|
13 pages and 4 figures
| null | null | null |
cs.CG cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The convergence problem of the Laplace-Beltrami operators plays an essential
role in the convergence analysis of the numerical simulations of some important
geometric partial differential equations which involve the operator. In this
note we present a new effective and convergent algorithm to compute discrete
Laplace-Beltrami operators acting on functions over surfaces. We prove a
convergence theorem for our discretization. To our knowledge, this is the first
convergent algorithm of discrete Laplace-Beltrami operators over surfaces for
functions on general surfaces. Our algorithm is conceptually simple and easy to
compute. Indeed, the convergence rate of our new algorithm of discrete
Laplace-Beltrami operators over surfaces is $O(r)$ where r represents the size
of the mesh of discretization of the surface.
|
[
{
"version": "v1",
"created": "Tue, 20 Apr 2010 15:51:24 GMT"
}
] | 2010-04-21T00:00:00 |
[
[
"Wu",
"Jyh-Yang",
""
],
[
"Chi",
"Mei-Hsiu",
""
],
[
"Chen",
"Sheng-Gwo",
""
]
] |
new_dataset
| 0.975535 |
1004.3057
|
Bryan Ford
|
Henry Corrigan-Gibbs and Bryan Ford (Yale University)
|
Accountable Anonymous Group Messaging
|
12 pages, 5 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Users often wish to participate in online groups anonymously, but misbehaving
users may abuse this anonymity to spam or disrupt the group. Messaging
protocols such as Mix-nets and DC-nets leave online groups vulnerable to
denial-of-service and Sybil attacks, while accountable voting protocols are
unusable or inefficient for general anonymous messaging.
We present the first general messaging protocol that offers provable
anonymity with accountability for moderate-size groups, and efficiently handles
unbalanced loads where few members have much data to transmit in a given round.
The N group members first cooperatively shuffle an NxN matrix of pseudorandom
seeds, then use these seeds in N "pre-planned" DC-nets protocol runs. Each
DC-nets run transmits the variable-length bulk data comprising one member's
message, using the minimum number of bits required for anonymity under our
attack model. The protocol preserves message integrity and one-to-one
correspondence between members and messages, makes denial-of-service attacks by
members traceable to the culprit, and efficiently handles large and unbalanced
message loads. A working prototype demonstrates the protocol's practicality for
anonymous messaging in groups of 40+ member nodes.
|
[
{
"version": "v1",
"created": "Sun, 18 Apr 2010 20:32:38 GMT"
}
] | 2010-04-20T00:00:00 |
[
[
"Corrigan-Gibbs",
"Henry",
"",
"Yale University"
],
[
"Ford",
"Bryan",
"",
"Yale University"
]
] |
new_dataset
| 0.966435 |
1004.3178
|
Mohamed Ibrahim
|
Mohamed Ibrahim, Moustafa Youssef
|
CellSense: A Probabilistic RSSI-based GSM Positioning System
|
6 pages, 6 figures, Submitted to Globe-com 2010
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context-aware applications have been gaining huge interest in the last few
years. With cell phones becoming ubiquitous computing devices, cell phone
localization has become an important research problem. In this paper, we
present CellSense, a prob- abilistic RSSI-based fingerprinting location
determina- tion system for GSM phones.We discuss the challenges of implementing
a probabilistic fingerprinting local- ization technique in GSM networks and
present the details of the CellSense system and how it addresses the
challenges. To evaluate our proposed system, we implemented CellSense on
Android-based phones. Re- sults for two different testbeds, representing urban
and rural environments, show that CellSense provides at least 23.8% enhancement
in accuracy in rural areas and at least 86.4% in urban areas compared to other
RSSI-based GSMlocalization systems. This comes with a minimal increase in
computational requirements. We also evaluate the effect of changing the
different system parameters on the accuracy-complexity tradeoff.
|
[
{
"version": "v1",
"created": "Mon, 19 Apr 2010 12:50:39 GMT"
}
] | 2010-04-20T00:00:00 |
[
[
"Ibrahim",
"Mohamed",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.9983 |
1004.3263
|
Vishal Goyal
|
Aissam Berrahou, Mourad Rafi, Mohsine Eleuldj
|
DRMS Co-design by F4MS
|
International Journal of Computer Science Issues online at
http://ijcsi.org/articles/DRMS-Co-design-by-F4MS.php
|
IJCSI, Volume 7, Issue 2, March 2010
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present Digital Rights Management systems (DRMS) which are
becoming more and more complex due to technology revolution in relation with
telecommunication networks, multimedia applications and the reading equipments
(Mobile Phone, IPhone, PDA, DVD Player,..). The complexity of the DRMS,
involves the use of new tools and methodologies that support software
components and hardware components coupled design. The traditional systems
design approach has been somewhat hardware first in that the software
components are designed after the hardware has been designed and prototyped.
This leaves little flexibility in evaluating different design options and
hardware-software mappings. The key of codesign is to avoid isolation between
hardware and software designs to proceed in parallel, with feedback and
interaction between the two as the design progresses, in order to achieve high
quality designs with a reduced design time. In this paper, we present the F4MS
(Framework for Mixed Systems) which is a unified framework for software and
hardware design environment, simulation and aided execution of mixed systems.
To illustrate this work we propose an implementation of DRMS business model
based on F4MS framework.
|
[
{
"version": "v1",
"created": "Mon, 19 Apr 2010 18:01:45 GMT"
}
] | 2010-04-20T00:00:00 |
[
[
"Berrahou",
"Aissam",
""
],
[
"Rafi",
"Mourad",
""
],
[
"Eleuldj",
"Mohsine",
""
]
] |
new_dataset
| 0.997329 |
1004.3268
|
Vishal Goyal
|
Amir Mollanejad, Leili Mohammad Khanli, Mohammad Zeynali
|
DBSR: Dynamic base station Repositioning using Genetic algorithm in
wireless sensor network
|
International Journal of Computer Science Issues online at
http://ijcsi.org/articles/DBSR-Dynamic-base-station-Repositioning-using-Genetic-algorithm-in-wireless-sensor-network.php
|
IJCSI, Volume 7, Issue 2, March 2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks (WSNs) are commonly used in various ubiquitous and
pervasive applications. Due to limited power resources, the optimal dynamic
base station (BS) replacement could be Prolong the sensor network lifetime. In
this paper we'll present a dynamic optimum method for base station replacement
so that can save energy in sensors and increases network lifetime. Because
positioning problem is a NPhard problem [1], therefore we'll use genetic
algorithm to solve positioning problem. We've considered energy and distance
parameters for finding BS optimized position. In our represented algorithm base
station position is fixed just during each round and its positioning is done at
the start of next round then it'll be placed in optimized position. Evaluating
our proposed algorithm, we'll execute DBSR algorithm on LEACH & HEED Protocols.
|
[
{
"version": "v1",
"created": "Mon, 19 Apr 2010 18:10:13 GMT"
}
] | 2010-04-20T00:00:00 |
[
[
"Mollanejad",
"Amir",
""
],
[
"Khanli",
"Leili Mohammad",
""
],
[
"Zeynali",
"Mohammad",
""
]
] |
new_dataset
| 0.978674 |
1001.0107
|
Changho Suh
|
Changho Suh and Kannan Ramchandran
|
Exact Regeneration Codes for Distributed Storage Repair Using
Interference Alignment
|
to be submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes
has recently motivated a new class of codes, called Regenerating Codes, that
optimally trade off storage cost for repair bandwidth. On one end of this
spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes
that can match the minimum storage cost of MDS codes while also significantly
reducing repair bandwidth. In this paper, we describe Exact-MSR codes which
allow for any failed nodes (whether they are systematic or parity nodes) to be
regenerated exactly rather than only functionally or information-equivalently.
We show that Exact-MSR codes come with no loss of optimality with respect to
random-network-coding based MSR codes (matching the cutset-based lower bound on
repair bandwidth) for the cases of: (a) k/n <= 1/2; and (b) k <= 3. Our
constructive approach is based on interference alignment techniques, and,
unlike the previous class of random-network-coding based approaches, we provide
explicit and deterministic coding schemes that require a finite-field size of
at most 2(n-k).
|
[
{
"version": "v1",
"created": "Thu, 31 Dec 2009 18:36:03 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Apr 2010 20:17:54 GMT"
}
] | 2010-04-19T00:00:00 |
[
[
"Suh",
"Changho",
""
],
[
"Ramchandran",
"Kannan",
""
]
] |
new_dataset
| 0.997759 |
1001.0627
|
John Horton
|
John Horton, Lydia Chilton
|
The Labor Economics of Paid Crowdsourcing
| null | null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crowdsourcing is a form of "peer production" in which work traditionally
performed by an employee is outsourced to an "undefined, generally large group
of people in the form of an open call." We present a model of workers supplying
labor to paid crowdsourcing projects. We also introduce a novel method for
estimating a worker's reservation wage--the smallest wage a worker is willing
to accept for a task and the key parameter in our labor supply model. It shows
that the reservation wages of a sample of workers from Amazon's Mechanical Turk
(AMT) are approximately log normally distributed, with a median wage of
$1.38/hour. At the median wage, the point elasticity of extensive labor supply
is 0.43. We discuss how to use our calibrated model to make predictions in
applied work. Two experimental tests of the model show that many workers
respond rationally to offered incentives. However, a non-trivial fraction of
subjects appear to set earnings targets. These "target earners" consider not
just the offered wage--which is what the rational model predicts--but also
their proximity to earnings goals. Interestingly, a number of workers clearly
prefer earning total amounts evenly divisible by 5, presumably because these
amounts make good targets.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2010 20:55:50 GMT"
}
] | 2010-04-19T00:00:00 |
[
[
"Horton",
"John",
""
],
[
"Chilton",
"Lydia",
""
]
] |
new_dataset
| 0.998729 |
cs/0601002
|
G\"unter Rote
|
Wolfgang Mulzer and Guenter Rote
|
Minimum-weight triangulation is NP-hard
|
45 pages (including a technical appendix of 13 pages), 28 figures.
This revision contains a few improvements in the exposition
|
Journal of the ACM, 55, no. 2 (May 2008), Article 11, 29 pp.
|
10.1145/1346330.1346336
|
B 05-23 (revised)
|
cs.CG cs.CC
| null |
A triangulation of a planar point set S is a maximal plane straight-line
graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we
are looking for a triangulation of a given point set that minimizes the sum of
the edge lengths. We prove that the decision version of this problem is
NP-hard. We use a reduction from PLANAR-1-IN-3-SAT. The correct working of the
gadgets is established with computer assistance, using dynamic programming on
polygonal faces, as well as the beta-skeleton heuristic to certify that certain
edges belong to the minimum-weight triangulation.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2006 16:11:29 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Sep 2007 01:33:35 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Feb 2008 22:30:23 GMT"
}
] | 2010-04-19T00:00:00 |
[
[
"Mulzer",
"Wolfgang",
""
],
[
"Rote",
"Guenter",
""
]
] |
new_dataset
| 0.998583 |
0809.2651
|
Sasanka Roy
|
John Augustine, Brian Putnam, Sasanka Roy
|
Largest Empty Circle Centered on a Query Line
|
18 pages, 13 figures
| null |
10.1016/j.jda.2009.10.002
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Largest Empty Circle problem seeks the largest circle centered within the
convex hull of a set $P$ of $n$ points in $\mathbb{R}^2$ and devoid of points
from $P$. In this paper, we introduce a query version of this well-studied
problem. In our query version, we are required to preprocess $P$ so that when
given a query line $Q$, we can quickly compute the largest empty circle
centered at some point on $Q$ and within the convex hull of $P$.
We present solutions for two special cases and the general case; all our
queries run in $O(\log n)$ time. We restrict the query line to be horizontal in
the first special case, which we preprocess in $O(n \alpha(n) \log n)$ time and
space, where $\alpha(n)$ is the slow growing inverse of the Ackermann's
function. When the query line is restricted to pass through a fixed point, the
second special case, our preprocessing takes $O(n \alpha(n)^{O(\alpha(n))} \log
n)$ time and space. We use insights from the two special cases to solve the
general version of the problem with preprocessing time and space in $O(n^3 \log
n)$ and $O(n^3)$ respectively.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2008 15:00:50 GMT"
}
] | 2010-04-15T00:00:00 |
[
[
"Augustine",
"John",
""
],
[
"Putnam",
"Brian",
""
],
[
"Roy",
"Sasanka",
""
]
] |
new_dataset
| 0.998352 |
1004.2322
|
Feng Xia
|
Guowei Wu, Chi Lin, Feng Xia, Lin Yao, He Zhang, Bing Liu
|
Dynamical Jumping Real-Time Fault-Tolerant Routing Protocol for Wireless
Sensor Networks
|
22 pages, 9 figures
|
Sensors, 10(3):2416-2437, 2010
|
10.3390/s100302416
| null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In time-critical wireless sensor network (WSN) applications, a high degree of
reliability is commonly required. A dynamical jumping real-time fault-tolerant
routing protocol (DMRF) is proposed in this paper. Each node utilizes the
remaining transmission time of the data packets and the state of the forwarding
candidate node set to dynamically choose the next hop. Once node failure,
network congestion or void region occurs, the transmission mode will switch to
jumping transmission mode, which can reduce the transmission time delay,
guaranteeing the data packets to be sent to the destination node within the
specified time limit. By using feedback mechanism, each node dynamically
adjusts the jumping probabilities to increase the ratio of successful
transmission. Simulation results show that DMRF can not only efficiently reduce
the effects of failure nodes, congestion and void region, but also yield higher
ratio of successful transmission, smaller transmission delay and reduced number
of control packets.
|
[
{
"version": "v1",
"created": "Wed, 14 Apr 2010 06:35:04 GMT"
}
] | 2010-04-15T00:00:00 |
[
[
"Wu",
"Guowei",
""
],
[
"Lin",
"Chi",
""
],
[
"Xia",
"Feng",
""
],
[
"Yao",
"Lin",
""
],
[
"Zhang",
"He",
""
],
[
"Liu",
"Bing",
""
]
] |
new_dataset
| 0.998133 |
1004.2447
|
Jeremy Faden Mr.
|
J. Faden, R. S. Weigel, J. Merka, R. H. W. Friedel
|
Autoplot: A browser for scientific data on the web
|
16 pages
| null |
10.1007/s12145-010-0049-0
| null |
cs.GR physics.data-an physics.space-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autoplot is software developed for the Virtual Observatories in Heliophysics
to provide intelligent and automated plotting capabilities for many typical
data products that are stored in a variety of file formats or databases.
Autoplot has proven to be a flexible tool for exploring, accessing, and viewing
data resources as typically found on the web, usually in the form of a
directory containing data files with multiple parameters contained in each
file. Data from a data source is abstracted into a common internal data model
called QDataSet. Autoplot is built from individually useful components, and can
be extended and reused to create specialized data handling and analysis
applications and is being used in a variety of science visualization and
analysis applications. Although originally developed for viewing
heliophysics-related time series and spectrograms, its flexible and generic
data representation model makes it potentially useful for the Earth sciences.
|
[
{
"version": "v1",
"created": "Wed, 14 Apr 2010 16:40:41 GMT"
}
] | 2010-04-15T00:00:00 |
[
[
"Faden",
"J.",
""
],
[
"Weigel",
"R. S.",
""
],
[
"Merka",
"J.",
""
],
[
"Friedel",
"R. H. W.",
""
]
] |
new_dataset
| 0.999587 |
cs/0307066
|
Oleg Lodygensky
|
Oleg Lodygensky, Gilles Fedak, Vincent Neri, Alain Cordier, Franck
Cappello
|
Augernome & XtremWeb: Monte Carlos computation on a global computing
platform
| null |
ECONF C0303241:THAT001,2003
| null | null |
cs.DC
| null |
In this paper, we present XtremWeb, a Global Computing platform used to
generate monte carlos showers in Auger, an HEP experiment to study the highest
energy cosmic rays at Mallargue-Mendoza, Argentina.
XtremWeb main goal, as a Global Computing platform, is to compute distributed
applications using idle time of widely interconnected machines. It is
especially dedicated to -but not limited to- multi-parameters applications such
as monte carlos computations; its security mechanisms ensuring not only hosts
integrity but also results certification and its fault tolerant features,
encouraged us to test it and, finally, to deploy it as to support our CPU needs
to simulate showers.
We first introduce Auger computing needs and how Global Computing could help.
We then detail XtremWeb architecture and goals. The fourth and last part
presents the profits we have gained to choose this platform. We conclude on
what could be done next.
|
[
{
"version": "v1",
"created": "Tue, 29 Jul 2003 14:12:07 GMT"
}
] | 2010-04-15T00:00:00 |
[
[
"Lodygensky",
"Oleg",
""
],
[
"Fedak",
"Gilles",
""
],
[
"Neri",
"Vincent",
""
],
[
"Cordier",
"Alain",
""
],
[
"Cappello",
"Franck",
""
]
] |
new_dataset
| 0.998379 |
1001.2059
|
Roberto N\'obrega
|
Roberto W. Nobrega and Bartolomeu F. Uchoa-Filho
|
Multishot Codes for Network Coding using Rank-Metric Codes
|
6 pages, 4 figures. Replaced the extended injection distance (and
doubtful unproven statements about it) with the extended subspace distance;
some other minor corrections and points clarified.
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The multiplicative-additive finite-field matrix channel arises as an adequate
model for linear network coding systems when links are subject to errors and
erasures, and both the network topology and the network code are unknown. In a
previous work we proposed a general construction of multishot codes for this
channel based on the multilevel coding theory. Herein we apply this
construction to the rank-metric space, obtaining multishot rank-metric codes
which, by lifting, can be converted to codes for the aforementioned channel. We
also adapt well-known encoding and decoding algorithms to the considered
situation.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 02:04:03 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Apr 2010 18:23:54 GMT"
}
] | 2010-04-13T00:00:00 |
[
[
"Nobrega",
"Roberto W.",
""
],
[
"Uchoa-Filho",
"Bartolomeu F.",
""
]
] |
new_dataset
| 0.999092 |
1004.1678
|
Rdv Ijcsis
|
Arabinda Nanda, Amiya Kumar Rath, Saroj Kumar Rout
|
Node Sensing & Dynamic Discovering Routes for Wireless Sensor Networks
|
IEEE Publication format, International Journal of Computer Science
and Information Security, IJCSIS, Vol. 7 No. 3, March 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The applications of Wireless Sensor Networks (WSN) contain a wide variety of
scenarios. In most of them, the network is composed of a significant number of
nodes deployed in an extensive area in which not all nodes are directly
connected. Then, the data exchange is supported by multihop communications.
Routing protocols are in charge of discovering and maintaining the routes in
the network. However, the correctness of a particular routing protocol mainly
depends on the capabilities of the nodes and on the application requirements.
This paper presents a dynamic discover routing method for communication between
sensor nodes and a base station in WSN. This method tolerates failures of
arbitrary individual nodes in the network (node failure) or a small part of the
network (area failure). Each node in the network does only local routing
preservation, needs to record only its neighbor nodes' information, and incurs
no extra routing overhead during failure free periods. It dynamically discovers
new routes when an intermediate node or a small part of the network in the path
from a sensor node to a base station fails. In our planned method, every node
decides its path based only on local information, such as its parent node and
neighbor nodes' routing information. So, it is possible to form a loop in the
routing path. We believe that the loop problem in sensor network routing is not
as serious as that in the Internet routing or traditional mobile ad-hoc
routing. We are trying to find all possible loops and eliminate the loops as
far as possible in WSN.
|
[
{
"version": "v1",
"created": "Sat, 10 Apr 2010 03:57:58 GMT"
}
] | 2010-04-13T00:00:00 |
[
[
"Nanda",
"Arabinda",
""
],
[
"Rath",
"Amiya Kumar",
""
],
[
"Rout",
"Saroj Kumar",
""
]
] |
new_dataset
| 0.998441 |
1004.1736
|
Zoltan Esik
|
Zoltan Esik
|
An undecidable property of context-free languages
| null | null | null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that there exists no algorithm to decide whether the language
generated by a context-free grammar is dense with respect to the lexicographic
ordering. As a corollary to this result, we show that it is undecidable whether
the lexicographic orderings of the languages generated by two context-free
grammars have the same order type.
|
[
{
"version": "v1",
"created": "Sat, 10 Apr 2010 19:16:50 GMT"
}
] | 2010-04-13T00:00:00 |
[
[
"Esik",
"Zoltan",
""
]
] |
new_dataset
| 0.998552 |
1004.1745
|
Rdv Ijcsis
|
Nabil Taib, Toufik Rekioua, Bruno Francois
|
An Improved Fixed Switching Frequency Direct Torque Control of Induction
Motor Drives Fed by Direct Matrix Converter
|
IEEE Publication format, International Journal of Computer Science
and Information Security, IJCSIS, Vol. 7 No. 3, March 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A few papers have been interested by the fixed switching frequency direct
torque control fed by direct matrix converters, where we can find just the use
of direct torque controlled space vector modulated method. In this present
paper, we present an improved method used for a fixed switching frequency
direct torque control (DTC) using a direct matrix converter (DMC). This method
is characterized by a simple structure, a fixed switching frequency which
causes minimal torque ripple and a unity input power factor. Using this
strategy, we combine the direct matrix converters advantages with those of
direct torque control (DTC) schemes. The used technique for constant frequency
is combined with the input current space vector to create the switching table
of direct matrix converter (DMC). Simulation results clearly demonstrate a
better dynamic and steady state performances of the proposed method.
|
[
{
"version": "v1",
"created": "Sat, 10 Apr 2010 22:10:43 GMT"
}
] | 2010-04-13T00:00:00 |
[
[
"Taib",
"Nabil",
""
],
[
"Rekioua",
"Toufik",
""
],
[
"Francois",
"Bruno",
""
]
] |
new_dataset
| 0.965337 |
1004.1746
|
Rdv Ijcsis
|
S Qamar, Niranjan Lal, Mrityunjay Singh
|
Internet ware cloud computing :Challenges
|
IEEE Publication format, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
IJCSIS, Vol. 7 No. 3, March 2010, 206-210
| null | null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
After decades of engineering development and infrastructural investment,
Internet connections have become commodity product in many countries, and
Internet scale "cloud computing" has started to compete with traditional
software business through its technological advantages and economy of scale.
Cloud computing is a promising enabling technology of Internet ware Cloud
Computing is termed as the next big thing in the modern corporate world. Apart
from the present day software and technologies, cloud computing will have a
growing impact on enterprise IT and business activities in many large
organizations. This paper provides an insight to cloud computing, its impacts
and discusses various issues that business organizations face while
implementing cloud computing. Further, it recommends various strategies that
organizations need to adopt while migrating to cloud computing. The purpose of
this paper is to develop an understanding of cloud computing in the modern
world and its impact on organizations and businesses. Initially the paper
provides a brief description of the cloud computing model introduction and its
purposes. Further it discusses various technical and non-technical issues that
need to be overcome in order for the benefits of cloud computing to be realized
in corporate businesses and organizations. It then provides various
recommendations and strategies that businesses need to work on before stepping
into new technologies.
|
[
{
"version": "v1",
"created": "Sat, 10 Apr 2010 22:17:18 GMT"
}
] | 2010-04-13T00:00:00 |
[
[
"Qamar",
"S",
""
],
[
"Lal",
"Niranjan",
""
],
[
"Singh",
"Mrityunjay",
""
]
] |
new_dataset
| 0.963221 |
0802.4237
|
Ranko Lazic
|
Ranko Lazic
|
Safety alternating automata on data words
|
23 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A data word is a sequence of pairs of a letter from a finite alphabet and an
element from an infinite set, where the latter can only be compared for
equality. Safety one-way alternating automata with one register on infinite
data words are considered, their nonemptiness is shown EXPSPACE-complete, and
their inclusion decidable but not primitive recursive. The same complexity
bounds are obtained for satisfiability and refinement, respectively, for the
safety fragment of linear temporal logic with freeze quantification. Dropping
the safety restriction, adding past temporal operators, or adding one more
register, each causes undecidability.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2008 16:54:31 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Mar 2009 18:52:17 GMT"
},
{
"version": "v3",
"created": "Fri, 9 Apr 2010 15:20:30 GMT"
}
] | 2010-04-12T00:00:00 |
[
[
"Lazic",
"Ranko",
""
]
] |
new_dataset
| 0.997484 |
1004.1511
|
Ludo M.G.M. Tolhuizen
|
Ludo Tolhuizen
|
Bounds for codes for a non-symmetric ternary channel
|
To be presented at 31st WIC Symposium on Information Theory in the
Benelux, Rotterdam, the Netherlands, May 11-12, 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide bounds for codes for a non-symmetric channel or, equivalently, for
ternary codes with the Manhattan distance.
|
[
{
"version": "v1",
"created": "Fri, 9 Apr 2010 09:49:11 GMT"
}
] | 2010-04-12T00:00:00 |
[
[
"Tolhuizen",
"Ludo",
""
]
] |
new_dataset
| 0.999855 |
0906.5022
|
Tad Hogg
|
Tad Hogg and Robert A. Freitas Jr
|
Chemical Power for Microscopic Robots in Capillaries
|
28 pages, 7 figures
|
Nanomedicine: Nanotechnology, Biology, and Medicine 6:298-317
(2010)
|
10.1016/j.nano.2009.10.002
| null |
cs.RO physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The power available to microscopic robots (nanorobots) that oxidize
bloodstream glucose while aggregated in circumferential rings on capillary
walls is evaluated with a numerical model using axial symmetry and
time-averaged release of oxygen from passing red blood cells. Robots about one
micron in size can produce up to several tens of picowatts, in steady-state, if
they fully use oxygen reaching their surface from the blood plasma. Robots with
pumps and tanks for onboard oxygen storage could collect oxygen to support
burst power demands two to three orders of magnitude larger. We evaluate
effects of oxygen depletion and local heating on surrounding tissue. These
results give the power constraints when robots rely entirely on ambient
available oxygen and identify aspects of the robot design significantly
affecting available power. More generally, our numerical model provides an
approach to evaluating robot design choices for nanomedicine treatments in and
near capillaries.
|
[
{
"version": "v1",
"created": "Fri, 26 Jun 2009 23:54:08 GMT"
}
] | 2010-04-09T00:00:00 |
[
[
"Hogg",
"Tad",
""
],
[
"Freitas",
"Robert A.",
"Jr"
]
] |
new_dataset
| 0.985026 |
1004.1195
|
Sami Akin
|
Sami Akin, Mustafa Cenk Gursoy
|
Ergodic Capacity Analysis in Cognitive Radio Systems under Channel
Uncertainty
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, pilot-symbol-assisted transmission in cognitive radio systems
over time selective flat fading channels is studied. It is assumed that causal
and noncausal Wiener filter estimators are used at the secondary receiver with
the aid of training symbols to obtain the channel side information (CSI) under
an interference power constraint. Cognitive radio model is described together
with detection and false alarm probabilities determined by using a
Neyman-Person detector for channel sensing. Subsequently, for both filters, the
variances of estimate errors are calculated from the Doppler power spectrum of
the channel, and achievable rate expressions are provided considering the
scenarios which are results of channel sensing. Numerical results are obtained
in Gauss-Markov modeled channels, and achievable rates obtained by using causal
and noncausal filters are compared and it is shown that the difference is
decreasing with increasing signal-to-noise ratio (SNR). Moreover, the optimal
probability of detection and false alarm values are shown, and the tradeoff
between these two parameters is discussed. Finally, optimal power distributions
are provided.
|
[
{
"version": "v1",
"created": "Wed, 7 Apr 2010 21:31:38 GMT"
}
] | 2010-04-09T00:00:00 |
[
[
"Akin",
"Sami",
""
],
[
"Gursoy",
"Mustafa Cenk",
""
]
] |
new_dataset
| 0.967257 |
1004.1216
|
Zhi Xu
|
Zhi Xu
|
Multi-Shift de Bruijn Sequence
|
9 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A (non-circular) de Bruijn sequence w of order n is a word such that every
word of length n appears exactly once in w as a factor. In this paper, we
generalize the concept to a multi-shift setting: a multi-shift de Bruijn
sequence tau(m,n) of shift m and order n is a word such that every word of
length n appears exactly once in w as a factor that starts at index im+1 for
some integer i>=0. We show the number of the multi-shift de Bruijn sequence
tau(m,n) is (a^n)!a^{(m-n)(a^n-1)} for 1<=n<=m and is (a^m!)^{a^{n-m}} for
1<=m<=n, where a=|Sigma|. We provide two algorithms for generating a tau(m,n).
The multi-shift de Bruijn sequence is important in solving the Frobenius
problem in a free monoid.
|
[
{
"version": "v1",
"created": "Thu, 8 Apr 2010 01:24:50 GMT"
}
] | 2010-04-09T00:00:00 |
[
[
"Xu",
"Zhi",
""
]
] |
new_dataset
| 0.999676 |
1004.1232
|
Rdv Ijcsis
|
Hossein Rouhani Zeidanloo, Azizah Bt Abdul Manaf
|
Botnet Detection by Monitoring Similar Communication Patterns
|
IEEE Publication format, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
IJCSIS, Vol. 7 No. 3, March 2010
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Botnet is most widespread and occurs commonly in today's cyber attacks,
resulting in serious threats to our network assets and organization's
properties. Botnets are collections of compromised computers (Bots) which are
remotely controlled by its originator (BotMaster) under a common
Command-and-Control (C&C) infrastructure. They are used to distribute commands
to the Bots for malicious activities such as distributed denial-of-service
(DDoS) attacks, spam and phishing. Most of the existing Botnet detection
approaches concentrate only on particular Botnet command and control (C&C)
protocols (e.g., IRC,HTTP) and structures (e.g., centralized), and can become
ineffective as Botnets change their structure and C&C techniques. In this paper
at first we provide taxonomy of Botnets C&C channels and evaluate well-known
protocols which are being used in each of them. Then we proposed a new general
detection framework which currently focuses on P2P based and IRC based Botnets.
This proposed framework is based on definition of Botnets. Botnet has been
defined as a group of bots that perform similar communication and malicious
activity patterns within the same Botnet. The point that distinguishes our
proposed detection framework from many other similar works is that there is no
need for prior knowledge of Botnets such as Botnet signature.
|
[
{
"version": "v1",
"created": "Thu, 8 Apr 2010 03:11:06 GMT"
}
] | 2010-04-09T00:00:00 |
[
[
"Zeidanloo",
"Hossein Rouhani",
""
],
[
"Manaf",
"Azizah Bt Abdul",
""
]
] |
new_dataset
| 0.954919 |
1004.1267
|
Arnaud Legout
|
Stevens Le Blond, Pere Manils, Abdelberi Chaabane, Mohamed Ali Kaafar,
Arnaud Legout, Claude Castellucia, Walid Dabbous (INRIA Sophia Antipolis /
INRIA Rh\^one-Alpes)
|
De-anonymizing BitTorrent Users on Tor
|
Poster accepted at the 7th USENIX Symposium on Network Design and
Implementation (NSDI '10), San Jose, CA : United States (2010)
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some BitTorrent users are running BitTorrent on top of Tor to preserve their
privacy. In this extended abstract, we discuss three different attacks to
reveal the IP address of BitTorrent users on top of Tor. In addition, we
exploit the multiplexing of streams from different applications into the same
circuit to link non-BitTorrent applications to revealed IP addresses.
|
[
{
"version": "v1",
"created": "Thu, 8 Apr 2010 07:23:04 GMT"
}
] | 2010-04-09T00:00:00 |
[
[
"Blond",
"Stevens Le",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
],
[
"Manils",
"Pere",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
],
[
"Chaabane",
"Abdelberi",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
],
[
"Kaafar",
"Mohamed Ali",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
],
[
"Legout",
"Arnaud",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
],
[
"Castellucia",
"Claude",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
],
[
"Dabbous",
"Walid",
"",
"INRIA Sophia Antipolis /\n INRIA Rhône-Alpes"
]
] |
new_dataset
| 0.976296 |
1001.1798
|
Kai Fong Ernest Chong
|
Kai Fong Ernest Chong, Ernest Kurniawan, Sumei Sun and Kai Yen
|
Fountain Codes with Varying Probability Distributions
|
5 pages, 1 figure. Changes, including a different simulation example
in Section IV, are made to improve clarity. Theory remains unchanged.
Resubmitted to the 6th International Symposium on Turbo Codes & Iterative
Information Processing (ISTC 2010).
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fountain codes are rateless erasure-correcting codes, i.e., an essentially
infinite stream of encoded packets can be generated from a finite set of data
packets. Several fountain codes have been proposed recently to minimize
overhead, many of which involve modifications of the Luby transform (LT) code.
These fountain codes, like the LT code, have the implicit assumption that the
probability distribution is fixed throughout the encoding process. In this
paper, we will use the theory of posets to show that this assumption is
unnecessary, and by dropping it, we can achieve overhead reduction by as much
as 64% lower than LT codes. We also present the fundamental theory of
probability distribution designs for fountain codes with non-constant
probability distributions that minimize overhead.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2010 06:12:37 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Apr 2010 06:09:45 GMT"
}
] | 2010-04-08T00:00:00 |
[
[
"Chong",
"Kai Fong Ernest",
""
],
[
"Kurniawan",
"Ernest",
""
],
[
"Sun",
"Sumei",
""
],
[
"Yen",
"Kai",
""
]
] |
new_dataset
| 0.998993 |
1003.4830
|
Carmelo Malta
|
Carmelo Malta, Jos\'e Martinez (LINA)
|
Limits of Commutativity on Abstract Data Types
| null |
5th International Conference on Information Systems and Management
of Data (CISMOD'92), Bangalore : India (1992)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present some formal properties of (symmetrical) commutativity, the major
criterion used in transactional systems, which allow us to fully understand its
advantages and disadvantages. The main result is that commutativity is subject
to the same limitation as compatibility for arbitrary objects. However,
commutativity has also a number of attracting properties, one of which is
related to recovery and, to our knowledge, has not been exploited in the
literature. Advantages and disadvantages are illustrated on abstract data types
of interest. We also show how limits of commutativity have been circumvented,
which gives guidelines for doing so (or not!).
|
[
{
"version": "v1",
"created": "Thu, 25 Mar 2010 09:52:39 GMT"
}
] | 2010-04-08T00:00:00 |
[
[
"Malta",
"Carmelo",
"",
"LINA"
],
[
"Martinez",
"José",
"",
"LINA"
]
] |
new_dataset
| 0.981952 |
1003.4894
|
Michel Aurnague
|
Michel Aurnague (CLLE), Laure Vieu (IRIT), Andr\'ee Borillo (CLLE)
|
La repr\'esentation formelle des concepts spatiaux dans la langue
| null |
Langage et cognition spatiale, Michel Denis (Ed.) (1997) 69-102
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this chapter, we assume that systematically studying spatial markers
semantics in language provides a means to reveal fundamental properties and
concepts characterizing conceptual representations of space. We propose a
formal system accounting for the properties highlighted by the linguistic
analysis, and we use these tools for representing the semantic content of
several spatial relations of French. The first part presents a semantic
analysis of the expression of space in French aiming at describing the
constraints that formal representations have to take into account. In the
second part, after presenting the structure of our formal system, we set out
its components. A commonsense geometry is sketched out and several functional
and pragmatic spatial concepts are formalized. We take a special attention in
showing that these concepts are well suited to representing the semantic
content of several prepositions of French ('sur' (on), 'dans' (in), 'devant'
(in front of), 'au-dessus' (above)), and in illustrating the inferential
adequacy of these representations.
|
[
{
"version": "v1",
"created": "Thu, 25 Mar 2010 14:03:51 GMT"
}
] | 2010-04-08T00:00:00 |
[
[
"Aurnague",
"Michel",
"",
"CLLE"
],
[
"Vieu",
"Laure",
"",
"IRIT"
],
[
"Borillo",
"Andrée",
"",
"CLLE"
]
] |
new_dataset
| 0.984475 |
1004.1045
|
Chau Yuen
|
Yifan Chen, Chau Yuen
|
Double-Directional Information Azimuth Spectrum and Relay Network
Tomography for a Decentralized Wireless Relay Network
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel channel representation for a two-hop decentralized wireless relay
network (DWRN) is proposed, where the relays operate in a completely
distributive fashion. The modeling paradigm applies an analogous approach to
the description method for a double-directional multipath propagation channel,
and takes into account the finite system spatial resolution and the extended
relay listening/transmitting time. Specifically, the double-directional
information azimuth spectrum (IAS) is formulated to provide a compact
representation of information flows in a DWRN. The proposed channel
representation is then analyzed from a geometrically-based statistical modeling
perspective. Finally, we look into the problem of relay network tomography
(RNT), which solves an inverse problem to infer the internal structure of a
DWRN by using the instantaneous doubledirectional IAS recorded at multiple
measuring nodes exterior to the relay region.
|
[
{
"version": "v1",
"created": "Wed, 7 Apr 2010 10:28:30 GMT"
}
] | 2010-04-08T00:00:00 |
[
[
"Chen",
"Yifan",
""
],
[
"Yuen",
"Chau",
""
]
] |
new_dataset
| 0.999075 |
1004.1158
|
Hacene Belbachir
|
Kenza Guenda
|
New MDS Self-Dual Codes over Large Finite Fields
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct MDS Euclidean and Hermitian self-dual codes over large finite
fields of odd and even characteristics. Our codes arise from cyclic and
negacyclic duadic codes.
|
[
{
"version": "v1",
"created": "Wed, 7 Apr 2010 19:06:55 GMT"
}
] | 2010-04-08T00:00:00 |
[
[
"Guenda",
"Kenza",
""
]
] |
new_dataset
| 0.995847 |
1004.0259
|
Lennart Nacke Ph.D.
|
Lennart E. Nacke, Sophie Stellmach, Dennis Sasse, Craig A. Lindley
|
Gameplay experience in a gaze interaction game
|
pages 49-54, The 5th Conference on Communication by Gaze Interaction
- COGAIN 2009: Gaze Interaction For Those Who Want It Most, ISBN:
978-87-643-0475-6
| null | null | null |
cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Assessing gameplay experience for gaze interaction games is a challenging
task. For this study, a gaze interaction Half-Life 2 game modification was
created that allowed eye tracking control. The mod was deployed during an
experiment at Dreamhack 2007, where participants had to play with gaze
navigation and afterwards rate their gameplay experience. The results show low
tension and negative affects scores on the gameplay experience questionnaire as
well as high positive challenge, immersion and flow ratings. The correlation
between spatial presence and immersion for gaze interaction was high and yields
further investigation. It is concluded that gameplay experience can be
correctly assessed with the methodology presented in this paper.
|
[
{
"version": "v1",
"created": "Thu, 1 Apr 2010 23:52:50 GMT"
}
] | 2010-04-05T00:00:00 |
[
[
"Nacke",
"Lennart E.",
""
],
[
"Stellmach",
"Sophie",
""
],
[
"Sasse",
"Dennis",
""
],
[
"Lindley",
"Craig A.",
""
]
] |
new_dataset
| 0.991155 |
1003.0958
|
Jianfeng Zhan
|
Jianfeng Zhan, Lei Wang, Weisong Shi, Shimin Gong and Xiutao Zang
|
PhoenixCloud: Provisioning Resources for Heterogeneous Cloud Workloads
|
Submitted to IEEE Transaction on Service Computing
| null | null | null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As more and more service providers choose Cloud platforms, a resource
provider needs to provision resources and supporting runtime environments (REs)
for heterogeneous workloads in different scenarios. Previous work fails to
resolve this issue in several ways: (1) it fails to pay attention to diverse RE
requirements, and does not enable creating coordinated REs on demand; (2) few
work investigates coordinated resource provisioning for heterogeneous
workloads. In this paper, our contributions are three-fold: (1) we present an
RE agreement that expresses diverse RE requirements, and build an innovative
system PhoenixCloud that enables a resource provider to create REs on demand
according to RE agreements; (2) we propose two coordinated resource
provisioning solutions for heterogeneous workloads in two typical Cloud
scenarios: first, a large organization operates a private Cloud for two
heterogeneous workloads; second, a large organization or two service providers
running heterogeneous workloads revert to a public Cloud; and (3) A
comprehensive evaluation has been performed in experiments. For typical
workload traces of parallel batch jobs and Web services, our experiments show
that: a) In the first Cloud scenario, when the throughput is almost same like
that of a dedicated cluster system, our solution decreases the configuration
size of cluster by about 40%; b) in the second scenario, our solution decreases
not only the total resource consumption, but also the peak resource consumption
maximally to 31% with respect to that of EC2 + RightScale solution.
|
[
{
"version": "v1",
"created": "Thu, 4 Mar 2010 03:26:26 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Mar 2010 06:24:32 GMT"
},
{
"version": "v3",
"created": "Tue, 30 Mar 2010 02:55:49 GMT"
},
{
"version": "v4",
"created": "Wed, 31 Mar 2010 00:40:42 GMT"
}
] | 2010-04-01T00:00:00 |
[
[
"Zhan",
"Jianfeng",
""
],
[
"Wang",
"Lei",
""
],
[
"Shi",
"Weisong",
""
],
[
"Gong",
"Shimin",
""
],
[
"Zang",
"Xiutao",
""
]
] |
new_dataset
| 0.97356 |
1003.5993
|
Xiangyong Zeng
|
Xiangyong Zeng and Jinyong Shan and Lei Hu
|
A Triple-Error-Correcting Cyclic Code from the Gold and Kasami-Welch APN
Power Functions
|
29 pages
| null | null | null |
cs.DM cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on a sufficient condition proposed by Hollmann and Xiang for
constructing triple-error-correcting codes, the minimum distance of a binary
cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $\alpha$, $\alpha^3$, and
$\alpha^{13}$ of length $2^m-1$ and the weight divisibility of its dual code
are studied, where $m\geq 5$ is odd and $\alpha$ is a primitive element of the
finite field $\mathbb{F}_{2^m}$. The code $\mathcal{C}_{1,3,13}$ is proven to
have the same weight distribution as the binary triple-error-correcting
primitive BCH code $\mathcal{C}_{1,3,5}$ of the same length.
|
[
{
"version": "v1",
"created": "Wed, 31 Mar 2010 09:08:32 GMT"
}
] | 2010-04-01T00:00:00 |
[
[
"Zeng",
"Xiangyong",
""
],
[
"Shan",
"Jinyong",
""
],
[
"Hu",
"Lei",
""
]
] |
new_dataset
| 0.994098 |
0706.2153
|
Quentin Merigot
|
Fr\'ed\'eric Chazal (INRIA Sophia Antipolis), David Cohen-Steiner
(INRIA Sophia Antipolis), Quentin M\'erigot (INRIA Sophia Antipolis)
|
Stability of boundary measures
| null |
Boundary measures for geometric inference, Found. Comput. Math.,
10 (2), pp. 221-240, 2010
|
10.1007/s10208-009-9056-2
| null |
cs.CG math.CA math.MG
| null |
We introduce the boundary measure at scale r of a compact subset of the
n-dimensional Euclidean space. We show how it can be computed for point clouds
and suggest these measures can be used for feature detection. The main
contribution of this work is the proof a quantitative stability theorem for
boundary measures using tools of convex analysis and geometric measure theory.
As a corollary we obtain a stability result for Federer's curvature measures of
a compact, allowing to compute them from point-cloud approximations of the
compact.
|
[
{
"version": "v1",
"created": "Thu, 14 Jun 2007 16:03:28 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jun 2007 09:06:56 GMT"
}
] | 2010-03-31T00:00:00 |
[
[
"Chazal",
"Frédéric",
"",
"INRIA Sophia Antipolis"
],
[
"Cohen-Steiner",
"David",
"",
"INRIA Sophia Antipolis"
],
[
"Mérigot",
"Quentin",
"",
"INRIA Sophia Antipolis"
]
] |
new_dataset
| 0.992439 |
0803.2262
|
Maximilien Gadouleau
|
Maximilien Gadouleau and Zhiyuan Yan
|
Constant-Rank Codes and Their Connection to Constant-Dimension Codes
|
10 pages, 3 figures, accepted to appear in IEEE Transactions on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constant-dimension codes have recently received attention due to their
significance to error control in noncoherent random linear network coding. What
the maximal cardinality of any constant-dimension code with finite dimension
and minimum distance is and how to construct the optimal constant-dimension
code (or codes) that achieves the maximal cardinality both remain open research
problems. In this paper, we introduce a new approach to solving these two
problems. We first establish a connection between constant-rank codes and
constant-dimension codes. Via this connection, we show that optimal
constant-dimension codes correspond to optimal constant-rank codes over
matrices with sufficiently many rows. As such, the two aforementioned problems
are equivalent to determining the maximum cardinality of constant-rank codes
and to constructing optimal constant-rank codes, respectively. To this end, we
then derive bounds on the maximum cardinality of a constant-rank code with a
given minimum rank distance, propose explicit constructions of optimal or
asymptotically optimal constant-rank codes, and establish asymptotic bounds on
the maximum rate of a constant-rank code.
|
[
{
"version": "v1",
"created": "Sat, 15 Mar 2008 00:02:43 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Apr 2008 17:07:10 GMT"
},
{
"version": "v3",
"created": "Tue, 29 Apr 2008 22:29:31 GMT"
},
{
"version": "v4",
"created": "Sun, 6 Jul 2008 23:04:05 GMT"
},
{
"version": "v5",
"created": "Mon, 28 Jul 2008 23:05:24 GMT"
},
{
"version": "v6",
"created": "Tue, 23 Jun 2009 13:23:16 GMT"
},
{
"version": "v7",
"created": "Tue, 30 Mar 2010 09:49:46 GMT"
}
] | 2010-03-31T00:00:00 |
[
[
"Gadouleau",
"Maximilien",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.998455 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.