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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1102.1472
|
Karthekeyan Chandrasekaran
|
Karthekeyan Chandrasekaran, Richard Karp, Erick Moreno-Centeno,
Santosh Vempala
|
Algorithms for Implicit Hitting Set Problems
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A hitting set for a collection of sets is a set that has a non-empty
intersection with each set in the collection; the hitting set problem is to
find a hitting set of minimum cardinality. Motivated by instances of the
hitting set problem where the number of sets to be hit is large, we introduce
the notion of implicit hitting set problems. In an implicit hitting set problem
the collection of sets to be hit is typically too large to list explicitly;
instead, an oracle is provided which, given a set H, either determines that H
is a hitting set or returns a set that H does not hit. We show a number of
examples of classic implicit hitting set problems, and give a generic algorithm
for solving such problems optimally. The main contribution of this paper is to
show that this framework is valuable in developing approximation algorithms. We
illustrate this methodology by presenting a simple on-line algorithm for the
minimum feedback vertex set problem on random graphs. In particular our
algorithm gives a feedback vertex set of size n-(1/p)\log{np}(1-o(1)) with
probability at least 3/4 for the random graph G_{n,p} (the smallest feedback
vertex set is of size n-(2/p)\log{np}(1+o(1))). We also consider a planted
model for the feedback vertex set in directed random graphs. Here we show that
a hitting set for a polynomial-sized subset of cycles is a hitting set for the
planted random graph and this allows us to exactly recover the planted feedback
vertex set.
|
[
{
"version": "v1",
"created": "Mon, 7 Feb 2011 23:40:58 GMT"
}
] | 2011-02-09T00:00:00 |
[
[
"Chandrasekaran",
"Karthekeyan",
""
],
[
"Karp",
"Richard",
""
],
[
"Moreno-Centeno",
"Erick",
""
],
[
"Vempala",
"Santosh",
""
]
] |
new_dataset
| 0.979406 |
1102.1142
|
Vadim E. Levit
|
Vadim E. Levit and Eugen Mandrescu
|
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered
Graphs
|
12 pages, 12 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A maximum stable set in a graph G is a stable set of maximum cardinality. S
is called a local maximum stable set of G if S is a maximum stable set of the
subgraph induced by the closed neighborhood of S. A greedoid (V,F) is called a
local maximum stable set greedoid if there exists a graph G=(V,E) such that its
family of local maximum stable sets coinsides with (V,F). It has been shown
that the family local maximum stable sets of a forest T forms a greedoid on its
vertex set. In this paper we demonstrate that if G is a very well-covered
graph, then its family of local maximum stable sets is a greedoid if and only
if G has a unique perfect matching.
|
[
{
"version": "v1",
"created": "Sun, 6 Feb 2011 11:43:56 GMT"
}
] | 2011-02-08T00:00:00 |
[
[
"Levit",
"Vadim E.",
""
],
[
"Mandrescu",
"Eugen",
""
]
] |
new_dataset
| 0.974684 |
1102.1152
|
Hongbo Ni
|
Hongbo Ni, Bessam Abdulrazak, Daqing Zhang, Shu Wu
|
CDTOM: A Context-driven Task-oriented Middleware for Pervasive Homecare
Environment
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the growing number of the elderly, we see a greater demand for home
care, and the vision of pervasive computing is also floating into the domain of
the household that aims to build a smart home which can assist inhabitants
(users) to live more conveniently and harmoniously. Such health-care pervasive
applications in smart home should focus on the inhabitant's goal or task in
diverse situations, rather than the various complex devices and services. The
core challenge for homecare design is to perceive the environment and assess
occurring situations, thus allowing systems to behave intelligently according
to the user's intent. Due to the dynamic and heterogeneous nature of pervasive
computing environment, it is difficult for an average user to obtain right
information and service and in right place at right time. This paper proposes a
context-driven task-oriented middleware (CDTOM) to meet the challenge. The most
important component is its task model that provides an adequate high-level
description of user-oriented tasks and their related contexts. Leveraging the
model multiple entities can easily exchange, share and reuse their knowledge.
Based on the hierarchy of task ontology, a novel task recognition approach
using CBR (case-based reasoning) is presented and the performance of task
recognition is evaluated by task number, context size and time costing.
Moreover, a dynamic mechanism for mapping the recognized task and services is
also discussed. Finally, we present the design and implementation of our task
supporting system (TSS) to aid an inhabitant's tasks in light of his lifestyle
and environment conditions in pervasive homecare environment, and the results
of the prototype system show that our middleware approach achieves good
efficiency of context management and good accuracy of user's activity
inference, and can improve efficiently quality of user's life.
|
[
{
"version": "v1",
"created": "Sun, 6 Feb 2011 14:00:30 GMT"
}
] | 2011-02-08T00:00:00 |
[
[
"Ni",
"Hongbo",
""
],
[
"Abdulrazak",
"Bessam",
""
],
[
"Zhang",
"Daqing",
""
],
[
"Wu",
"Shu",
""
]
] |
new_dataset
| 0.998876 |
1102.1226
|
Jaydip Sen
|
Jaydip Sen
|
Secure Routing in Wireless Mesh Networks
|
44 pages, 17 figures, 5 tables
|
Book Chapter: Jaydip Sen (2011). Secure Routing in Wireless Mesh
Networks, Wireless Mesh Networks, Nobuo Funabiki (Ed.), InTech. Available
from:
http://www.intechopen.com/articles/show/title/secure-routing-in-wireless-mesh-networks
| null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mesh networks (WMNs) have emerged as a promising concept to meet the
challenges in next-generation networks such as providing flexible, adaptive,
and reconfigurable architecture while offering cost-effective solutions to the
service providers. Unlike traditional Wi-Fi networks, with each access point
(AP) connected to the wired network, in WMNs only a subset of the APs are
required to be connected to the wired network. The APs that are connected to
the wired network are called the Internet gateways (IGWs), while the APs that
do not have wired connections are called the mesh routers (MRs). The MRs are
connected to the IGWs using multi-hop communication. The IGWs provide access to
conventional clients and interconnect ad hoc, sensor, cellular, and other
networks to the Internet. However, most of the existing routing protocols for
WMNs are extensions of protocols originally designed for mobile ad hoc networks
(MANETs) and thus they perform sub-optimally. Moreover, most routing protocols
for WMNs are designed without security issues in mind, where the nodes are all
assumed to be honest. In practical deployment scenarios, this assumption does
not hold. This chapter provides a comprehensive overview of security issues in
WMNs and then particularly focuses on secure routing in these networks. First,
it identifies security vulnerabilities in the medium access control (MAC) and
the network layers. Various possibilities of compromising data confidentiality,
data integrity, replay attacks and offline cryptanalysis are also discussed.
Then various types of attacks in the MAC and the network layers are discussed.
After enumerating the various types of attacks on the MAC and the network
layer, the chapter briefly discusses on some of the preventive mechanisms for
these attacks.
|
[
{
"version": "v1",
"created": "Mon, 7 Feb 2011 03:49:40 GMT"
}
] | 2011-02-08T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.993419 |
1102.1237
|
Vadim Zaliva
|
Vadim Zaliva
|
Applying static code analysis to firewall policies for the purpose of
anomaly detection
| null | null | null | null |
cs.PL cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Treating modern firewall policy languages as imperative, special purpose
programming languages, in this article we will try to apply static code
analysis techniques for the purpose of anomaly detection.
We will first abstract a policy in common firewall policy language into an
intermediate language, and then we will try to apply anomaly detection
algorithms to it.
The contributions made by this work are:
1. An analysis of various control flow instructions in popular firewall
policy languages 2. Introduction of an intermediate firewall policy language,
with emphasis on control flow constructs. 3. Application of \textit{Static Code
Analysis} to detect anomalies in firewall policy, expressed in intermediate
firewall policy language. 4. Sample implementation of \textit{Static Code
Analysis} of firewall policies, expressed in our abstract language using
Datalog language.
|
[
{
"version": "v1",
"created": "Mon, 7 Feb 2011 07:26:03 GMT"
}
] | 2011-02-08T00:00:00 |
[
[
"Zaliva",
"Vadim",
""
]
] |
new_dataset
| 0.993145 |
1102.1340
|
Michel Grabisch
|
Ulrich Faigle and Michel Grabisch
|
A Discrete Choquet Integral for Ordered Systems
| null | null |
10.1016/j.fss.2010.10.003
| null |
cs.DM math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A model for a Choquet integral for arbitrary finite set systems is presented.
The model includes in particular the classical model on the system of all
subsets of a finite set. The general model associates canonical non-negative
and positively homogeneous superadditive functionals with generalized belief
functions relative to an ordered system, which are then extended to arbitrary
valuations on the set system. It is shown that the general Choquet integral can
be computed by a simple Monge-type algorithm for so-called intersection
systems, which include as a special case weakly union-closed families.
Generalizing Lov\'asz' classical characterization, we give a characterization
of the superadditivity of the Choquet integral relative to a capacity on a
union-closed system in terms of an appropriate model of supermodularity of such
capacities.
|
[
{
"version": "v1",
"created": "Mon, 7 Feb 2011 15:40:54 GMT"
}
] | 2011-02-08T00:00:00 |
[
[
"Faigle",
"Ulrich",
""
],
[
"Grabisch",
"Michel",
""
]
] |
new_dataset
| 0.99905 |
0802.1312
|
Josef Cibulka
|
Josef Cibulka
|
Untangling polygons and graphs
|
11 pages, 3 figures
|
Discrete and Computational Geometry 43(2): 402-411 (2010)
|
10.1007/s00454-009-9150-x
| null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Untangling is a process in which some vertices of a planar graph are moved to
obtain a straight-line plane drawing. The aim is to move as few vertices as
possible. We present an algorithm that untangles the cycle graph C_n while
keeping at least \Omega(n^{2/3}) vertices fixed. For any graph G, we also
present an upper bound on the number of fixed vertices in the worst case. The
bound is a function of the number of vertices, maximum degree and diameter of
G. One of its consequences is the upper bound O((n log n)^{2/3}) for all
3-vertex-connected planar graphs.
|
[
{
"version": "v1",
"created": "Sun, 10 Feb 2008 09:28:15 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Jun 2008 09:45:10 GMT"
}
] | 2011-02-07T00:00:00 |
[
[
"Cibulka",
"Josef",
""
]
] |
new_dataset
| 0.985075 |
0901.3119
|
Josef Cibulka
|
Josef Cibulka
|
Average number of flips in pancake sorting
|
21 pages, new computational results for unburnt pancakes (up to n=19)
|
Theor. Comput. Sci. 412, pp. 822-834 (2011)
|
10.1016/j.tcs.2010.11.028
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are given a stack of pancakes of different sizes and the only allowed
operation is to take several pancakes from top and flip them. The unburnt
version requires the pancakes to be sorted by their sizes at the end, while in
the burnt version they additionally need to be oriented burnt-side down. We
present an algorithm with the average number of flips, needed to sort a stack
of n burnt pancakes, equal to 7n/4+O(1) and a randomized algorithm for the
unburnt version with at most 17n/12+O(1) flips on average.
In addition, we show that in the burnt version, the average number of flips
of any algorithm is at least n+\Omega(n/log n) and conjecture that some
algorithm can reach n+\Theta(n/log n).
We also slightly increase the lower bound on g(n), the minimum number of
flips needed to sort the worst stack of n burnt pancakes. This bound, together
with the upper bound found by Heydari and Sudborough in 1997, gives the exact
number of flips to sort the previously conjectured worst stack -I_n for n=3 mod
4 and n>=15. Finally we present exact values of f(n) up to n=19 and of g(n) up
to n=17 and disprove a conjecture of Cohen and Blum by showing that the burnt
stack -I_{15} is not the worst one for n=15.
|
[
{
"version": "v1",
"created": "Tue, 20 Jan 2009 20:08:57 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Sep 2009 16:17:16 GMT"
}
] | 2011-02-07T00:00:00 |
[
[
"Cibulka",
"Josef",
""
]
] |
new_dataset
| 0.952872 |
1102.0951
|
Gabriel Kerneis
|
Gabriel Kerneis (PPS), Juliusz Chroboczek (PPS)
|
CPC: programming with a massive number of lightweight threads
|
To appear in PLACES'11
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Threads are a convenient and modular abstraction for writing concurrent
programs, but often fairly expensive. The standard alternative to threads,
event-loop programming, allows much lighter units of concurrency, but leads to
code that is difficult to write and even harder to understand. Continuation
Passing C (CPC) is a translator that converts a program written in threaded
style into a program written with events and native system threads, at the
programmer's choice. Together with two undergraduate students, we taught
ourselves how to program in CPC by writing Hekate, a massively concurrent
network server designed to efficiently handle tens of thousands of
simultaneously connected peers. In this paper, we describe a number of
programming idioms that we learnt while writing Hekate; while some of these
idioms are specific to CPC, many should be applicable to other programming
systems with sufficiently cheap threads.
|
[
{
"version": "v1",
"created": "Fri, 4 Feb 2011 15:57:48 GMT"
}
] | 2011-02-07T00:00:00 |
[
[
"Kerneis",
"Gabriel",
"",
"PPS"
],
[
"Chroboczek",
"Juliusz",
"",
"PPS"
]
] |
new_dataset
| 0.999581 |
0912.5324
|
Jose Ignacio Alvarez-Hamelin
|
Ortega A. Alfredo (ITBA, CORE), Victor A. Bettachini (ITBA), Jos\'e
Ignacio Alvarez-Hamelin (ITBA, CONICET), Diego F. Grosz (CONICET, LabOp)
|
Point-to-point and Point-to-multipoint CDMA Access Network with Enhanced
Security
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a network implementation with enhanced security at the physical
layer by means of time-hopping CDMA, supporting cryptographically secure
point-to-point and point-to-multipoint communication. In particular, we analyze
an active star topology optical network implementation capable of supporting
128 simultaneous users up to 20 km apart. The feasibility of the proposed
scheme is demonstrated through numerical simulation.
|
[
{
"version": "v1",
"created": "Tue, 29 Dec 2009 16:05:46 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Sep 2010 05:06:12 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Feb 2011 19:50:42 GMT"
}
] | 2011-02-04T00:00:00 |
[
[
"Alfredo",
"Ortega A.",
"",
"ITBA, CORE"
],
[
"Bettachini",
"Victor A.",
"",
"ITBA"
],
[
"Alvarez-Hamelin",
"José Ignacio",
"",
"ITBA, CONICET"
],
[
"Grosz",
"Diego F.",
"",
"CONICET, LabOp"
]
] |
new_dataset
| 0.979123 |
1102.0583
|
Bimal Kumar Mr
|
Bimal Aklesh Kumar
|
Thin Client Web-Based Campus Information Systems for Fiji National
University
|
14 pages
|
International Journal of Software Engineering & Applications
(IJSEA), Vol.2, No.1, January 2011
|
10.5121/ijsea.2011.2102
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fiji National University is encountering many difficulties with its current
administrative systems. These difficulties include accessibility, scalability,
performance, flexibility and integration. We propose a new campus information
system, FNU-CIS to addresses these difficulties. FNU-CIS has the potential to
provide wide range of the services for students and staffs at the university.
In order to assist in the design and implementation of proposed FNU-CIS, we
present an overview, software architecture and prototype implementation of our
proposed system. We discuss the key properties of our system, compare it with
other similar systems available and outline our future plans for research in
FNU-CIS implementation.
|
[
{
"version": "v1",
"created": "Wed, 2 Feb 2011 23:04:49 GMT"
}
] | 2011-02-04T00:00:00 |
[
[
"Kumar",
"Bimal Aklesh",
""
]
] |
new_dataset
| 0.996995 |
1102.0634
|
D\v{z}enan Zuki\'c
|
D\v{z}enan Zuki\'c and Jan Egger and Miriam H. A. Bauer and Daniela
Kuhnt and Barbara Carl and Bernd Freisleben and Andreas Kolb and Christopher
Nimsky
|
Glioblastoma Multiforme Segmentation in MRI Data with a Balloon
Inflation Approach
|
4 pages, 4 figures, Proc. of the 6th Russian-Bavarian Conference on
Bio-Medical Engineering
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gliomas are the most common primary brain tumors, evolving from the cerebral
supportive cells. For clinical follow-up, the evaluation of the preoperative
tumor volume is essential. Volumetric assessment of tumor volume with manual
segmentation of its outlines is a time-consuming process that can be overcome
with the help of computer-assisted segmentation methods. In this paper, a
semi-automatic approach for World Health Organization (WHO) grade IV glioma
segmentation is introduced that uses balloon inflation forces, and relies on
the detection of high-intensity tumor boundaries that are coupled by using
contrast agent gadolinium. The presented method is evaluated on 27 magnetic
resonance imaging (MRI) data sets and the ground truth data of the tumor
boundaries - for evaluation of the results - are manually extracted by
neurosurgeons.
|
[
{
"version": "v1",
"created": "Thu, 3 Feb 2011 10:00:15 GMT"
}
] | 2011-02-04T00:00:00 |
[
[
"Zukić",
"Dženan",
""
],
[
"Egger",
"Jan",
""
],
[
"Bauer",
"Miriam H. A.",
""
],
[
"Kuhnt",
"Daniela",
""
],
[
"Carl",
"Barbara",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Kolb",
"Andreas",
""
],
[
"Nimsky",
"Christopher",
""
]
] |
new_dataset
| 0.998066 |
1102.0666
|
Abuzer Yakaryilmaz
|
Abuzer Yakaryilmaz and A. C. Cem Say
|
Probabilistic and quantum finite automata with postselection
|
24 pages. A preliminary version of this paper appeared in the
Proceedings of Randomized and Quantum Computation (satellite workshop of MFCS
and CSL 2010), pages 14--24, 2010
| null | null | null |
cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that endowing a real-time probabilistic or quantum computer with the
ability of postselection increases its computational power. For this purpose,
we provide a new model of finite automata with postselection, and compare it
with the model of L\={a}ce et al. We examine the related language classes, and
also establish separations between the classical and quantum versions, and
between the zero-error vs. bounded-error modes of recognition in this model.
|
[
{
"version": "v1",
"created": "Thu, 3 Feb 2011 12:48:53 GMT"
}
] | 2011-02-04T00:00:00 |
[
[
"Yakaryilmaz",
"Abuzer",
""
],
[
"Say",
"A. C. Cem",
""
]
] |
new_dataset
| 0.986383 |
1005.3324
|
David Pritchard
|
David Pritchard
|
An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack
| null | null | null | null |
cs.DM
|
http://creativecommons.org/licenses/by/3.0/
|
In this note we study packing or covering integer programs with at most k
constraints, which are also known as k-dimensional knapsack problems. For any
integer k > 0 and real epsilon > 0, we observe there is a polynomial-sized LP
for the k-dimensional knapsack problem with integrality gap at most 1+epsilon.
The variables may be unbounded or have arbitrary upper bounds. In the packing
case, we can also remove the dependence of the LP on the cost-function,
yielding a polyhedral approximation of the integer hull. This generalizes a
recent result of Bienstock on the classical knapsack problem.
|
[
{
"version": "v1",
"created": "Tue, 18 May 2010 20:44:52 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Feb 2011 14:26:56 GMT"
}
] | 2011-02-03T00:00:00 |
[
[
"Pritchard",
"David",
""
]
] |
new_dataset
| 0.996463 |
1005.0291
|
Moritz Wiese
|
Moritz Wiese and Holger Boche and Igor Bjelakovi\'c and Volker
Jungnickel
|
The Compound Multiple Access Channel with Partially Cooperating Encoders
|
accepted for publication in IEEE Transactions on Information Theory,
Special Issue on Interference Networks
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this paper is to provide a rigorous information-theoretic
analysis of subnetworks of interference networks. We prove two coding theorems
for the compound multiple-access channel with an arbitrary number of channel
states. The channel state information at the transmitters is such that each
transmitter has a finite partition of the set of states and knows which element
of the partition the actual state belongs to. The receiver may have arbitrary
channel state information. The first coding theorem is for the case that both
transmitters have a common message and that each has an additional common
message. The second coding theorem is for the case where rate-constrained, but
noiseless transmitter cooperation is possible. This cooperation may be used to
exchange information about channel state information as well as the messages to
be transmitted. The cooperation protocol used here generalizes Willems'
conferencing. We show how this models base station cooperation in modern
wireless cellular networks used for interference coordination and capacity
enhancement. In particular, the coding theorem for the cooperative case shows
how much cooperation is necessary in order to achieve maximal capacity in the
network considered.
|
[
{
"version": "v1",
"created": "Mon, 3 May 2010 13:45:09 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Nov 2010 13:28:15 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Feb 2011 09:39:23 GMT"
}
] | 2011-02-02T00:00:00 |
[
[
"Wiese",
"Moritz",
""
],
[
"Boche",
"Holger",
""
],
[
"Bjelaković",
"Igor",
""
],
[
"Jungnickel",
"Volker",
""
]
] |
new_dataset
| 0.964196 |
0901.0911
|
Jean-Guillaume Dumas
|
Alexandre Berzati (LETI, PRISM), C\'ecile Canovas (LETI),
Jean-Guillaume Dumas (LJK), Louis Goubin (PRISM)
|
Fault Attacks on RSA Public Keys: Left-To-Right Implementations are also
Vulnerable
| null |
RSA Conference 2009, Cryptographers' Track, San Francisco : United
States (2009)
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
After attacking the RSA by injecting fault and corresponding countermeasures,
works appear now about the need for protecting RSA public elements against
fault attacks. We provide here an extension of a recent attack based on the
public modulus corruption. The difficulty to decompose the "Left-To-Right"
exponentiation into partial multiplications is overcome by modifying the public
modulus to a number with known factorization. This fault model is justified
here by a complete study of faulty prime numbers with a fixed size. The good
success rate of this attack combined with its practicability raises the
question of using faults for changing algebraic properties of finite field
based cryptosystems.
|
[
{
"version": "v1",
"created": "Wed, 7 Jan 2009 20:15:58 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Jan 2009 07:33:45 GMT"
},
{
"version": "v3",
"created": "Mon, 31 Jan 2011 17:41:13 GMT"
}
] | 2011-02-01T00:00:00 |
[
[
"Berzati",
"Alexandre",
"",
"LETI, PRISM"
],
[
"Canovas",
"Cécile",
"",
"LETI"
],
[
"Dumas",
"Jean-Guillaume",
"",
"LJK"
],
[
"Goubin",
"Louis",
"",
"PRISM"
]
] |
new_dataset
| 0.996227 |
1101.5490
|
Tom Cuypers
|
Tom Cuypers and Se Baek Oh and Tom Haber and Philippe Bekaert and
Ramesh Raskar
|
Ray-Based Reflectance Model for Diffraction
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel method of simulating wave effects in graphics using
ray--based renderers with a new function: the Wave BSDF (Bidirectional
Scattering Distribution Function). Reflections from neighboring surface patches
represented by local BSDFs are mutually independent. However, in many surfaces
with wavelength-scale microstructures, interference and diffraction requires a
joint analysis of reflected wavefronts from neighboring patches. We demonstrate
a simple method to compute the BSDF for the entire microstructure, which can be
used independently for each patch. This allows us to use traditional ray--based
rendering pipelines to synthesize wave effects of light and sound. We exploit
the Wigner Distribution Function (WDF) to create transmissive, reflective, and
emissive BSDFs for various diffraction phenomena in a physically accurate way.
In contrast to previous methods for computing interference, we circumvent the
need to explicitly keep track of the phase of the wave by using BSDFs that
include positive as well as negative coefficients. We describe and compare the
theory in relation to well understood concepts in rendering and demonstrate a
straightforward implementation. In conjunction with standard raytracers, such
as PBRT, we demonstrate wave effects for a range of scenarios such as
multi--bounce diffraction materials, holograms and reflection of high frequency
surfaces.
|
[
{
"version": "v1",
"created": "Fri, 28 Jan 2011 09:41:43 GMT"
}
] | 2011-01-31T00:00:00 |
[
[
"Cuypers",
"Tom",
""
],
[
"Oh",
"Se Baek",
""
],
[
"Haber",
"Tom",
""
],
[
"Bekaert",
"Philippe",
""
],
[
"Raskar",
"Ramesh",
""
]
] |
new_dataset
| 0.996849 |
1101.5313
|
Grenville Croll
|
Grenville J. Croll
|
A Chronology of Torah Cryptography
|
10 Pages, 1 Table, 7 Figures
|
Proc. ANPA 31, 2011, Cambridge, UK
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regarding some papers and notes submitted to, or presented at, the second
congress of the International Torah Codes Society in Jerusalem, Israel, June
2000.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 00:53:30 GMT"
}
] | 2011-01-28T00:00:00 |
[
[
"Croll",
"Grenville J.",
""
]
] |
new_dataset
| 0.999916 |
1001.4023
|
Thierry Bouche
|
Thierry Bouche (IF, CCDNM)
|
Digital Mathematics Libraries: The Good, the Bad, the Ugly
| null |
Mathematics in Computer Science 3, 3 (2010) 227-241
|
10.1007/s11786-010-0029-2
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea of a World digital mathematics library (DML) has been around since
the turn of the 21th century. We feel that it is time to make it a reality,
starting in a modest way from successful bricks that have already been built,
but with an ambitious goal in mind. After a brief historical overview of
publishing mathematics, an estimate of the size and a characterisation of the
bulk of documents to be included in the DML, we turn to proposing a model for a
Reference Digital Mathematics Library--a network of institutions where the
digital documents would be physically archived. This pattern based rather on
the bottom-up strategy seems to be more practicable and consistent with the
digital nature of the DML. After describing the model we summarise what can and
should be done in order to accomplish the vision. The current state of some of
the local libraries that could contribute to the global views are described
with more details.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2010 15:26:51 GMT"
}
] | 2011-01-25T00:00:00 |
[
[
"Bouche",
"Thierry",
"",
"IF, CCDNM"
]
] |
new_dataset
| 0.994356 |
1101.4426
|
EPTCS
|
Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca
|
Intersection types for unbind and rebind
|
In Proceedings ITRS 2010, arXiv:1101.4104
|
EPTCS 45, 2011, pp. 45-58
|
10.4204/EPTCS.45.4
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a type system with intersection types for an extension of
lambda-calculus with unbind and rebind operators. In this calculus, a term with
free variables, representing open code, can be packed into an "unbound" term,
and passed around as a value. In order to execute inside code, an unbound term
should be explicitly rebound at the point where it is used. Unbinding and
rebinding are hierarchical, that is, the term can contain arbitrarily nested
unbound terms, whose inside code can only be executed after a sequence of
rebinds has been applied. Correspondingly, types are decorated with levels, and
a term has type decorated with k if it needs k rebinds in order to reduce to a
value. With intersection types we model the fact that a term can be used
differently in contexts providing different numbers of unbinds. In particular,
top-level terms, that is, terms not requiring unbinds to reduce to values,
should have a value type, that is, an intersection type where at least one
element has level 0. With the proposed intersection type system we get
soundness under the call-by-value strategy, an issue which was not resolved by
previous type systems.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 01:39:37 GMT"
}
] | 2011-01-25T00:00:00 |
[
[
"Dezani-Ciancaglini",
"Mariangiola",
""
],
[
"Giannini",
"Paola",
""
],
[
"Zucca",
"Elena",
""
]
] |
new_dataset
| 0.995712 |
1101.4554
|
Mario Alviano
|
Francesco Ricca, Giovanni Grasso, Mario Alviano, Marco Manna,
Vincenzino Lio, Salvatore Iiritano, Nicola Leone
|
Team-building with Answer Set Programming in the Gioia-Tauro Seaport
|
21 pages, 2 figures, to appear in Theory and Practice of Logic
Programming (TPLP)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(To appear in Theory and Practice of Logic Programming (TPLP).)
The seaport of Gioia Tauro is the largest transshipment terminal of the
Mediterranean coast. A crucial management task for the companies operating in
the seaport is team building: the problem of properly allocating the available
personnel for serving the incoming ships. Teams have to be carefully arranged
in order to meet several constraints, such as allocation of the employees with
the appropriate skills, fair distribution of the working load, and turnover of
the heavy/dangerous roles. This makes team building a hard and expensive task
requiring several hours per day of manual preparation.
In this paper we present a system based on Answer Set Programming (ASP) for
the automatic generation of the teams of employees in the seaport of Gioia
Tauro. The system is currently exploited in the Gioia Tauro seaport by ICO BLG,
a company specialized in automobile logistics.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 14:50:57 GMT"
}
] | 2011-01-25T00:00:00 |
[
[
"Ricca",
"Francesco",
""
],
[
"Grasso",
"Giovanni",
""
],
[
"Alviano",
"Mario",
""
],
[
"Manna",
"Marco",
""
],
[
"Lio",
"Vincenzino",
""
],
[
"Iiritano",
"Salvatore",
""
],
[
"Leone",
"Nicola",
""
]
] |
new_dataset
| 0.990941 |
1101.4632
|
Serguei Mokhov
|
Serguei A. Mokhov and Marc-Andr\'e Laverdi\`ere and Ali Benssam and
Djamel Benredjem
|
A Secure Web-Based File Exchange Server: Software Requirements
Specification Document
|
13 pages, 3 figures; a December 2005 report
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
This document presents brief software specification of a secure file exchange
system prototype involving mutual authentication of the users via their browser
and the application server with PKI-based certificates as credentials, the use
of LDAP for credential management, and authentication between the application
and database servers to maintain a high level of trust between all parties.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 19:49:14 GMT"
}
] | 2011-01-25T00:00:00 |
[
[
"Mokhov",
"Serguei A.",
""
],
[
"Laverdière",
"Marc-André",
""
],
[
"Benssam",
"Ali",
""
],
[
"Benredjem",
"Djamel",
""
]
] |
new_dataset
| 0.979926 |
1101.3953
|
Barry Wittman
|
Greg N. Frederickson and Barry Wittman
|
Two Multivehicle Routing Problems with Unit-Time Windows
|
7 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two multivehicle routing problems are considered in the framework that a
visit to a location must take place during a specific time window in order to
be counted and all time windows are the same length. In the first problem, the
goal is to visit as many locations as possible using a fixed number of
vehicles. In the second, the goal is to visit all locations using the smallest
number of vehicles possible. For the first problem, we present an approximation
algorithm whose output path collects a reward within a constant factor of
optimal for any fixed number of vehicles. For the second problem, our algorithm
finds a 6-approximation to the problem on a tree metric, whenever a single
vehicle could visit all locations during their time windows.
|
[
{
"version": "v1",
"created": "Thu, 20 Jan 2011 16:39:00 GMT"
}
] | 2011-01-21T00:00:00 |
[
[
"Frederickson",
"Greg N.",
""
],
[
"Wittman",
"Barry",
""
]
] |
new_dataset
| 0.993889 |
1101.3960
|
Barry Wittman
|
Greg N. Frederickson and Barry Wittman
|
Speedup in the Traveling Repairman Problem with Constrained Time Windows
|
28 pages, 3 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A bicriteria approximation algorithm is presented for the unrooted traveling
repairman problem, realizing increased profit in return for increased speedup
of repairman motion. The algorithm generalizes previous results from the case
in which all time windows are the same length to the case in which their
lengths can range between l and 2. This analysis can extend to any range of
time window lengths, following our earlier techniques. This relationship
between repairman profit and speedup is applicable over a range of values that
is dependent on the cost of putting the input in an especially desirable form,
involving what are called "trimmed windows." For time windows with lengths
between 1 and 2, the range of values for speedup $s$ for which our analysis
holds is $1 \leq s \leq 6$. In this range, we establish an approximation ratio
that is constant for any specific value of $s$.
|
[
{
"version": "v1",
"created": "Thu, 20 Jan 2011 16:51:55 GMT"
}
] | 2011-01-21T00:00:00 |
[
[
"Frederickson",
"Greg N.",
""
],
[
"Wittman",
"Barry",
""
]
] |
new_dataset
| 0.975435 |
1005.1395
|
Leonardo Ermann
|
L. Ermann, A. D. Chepelianskii and D. L. Shepelyansky
|
Fractal Weyl law for Linux Kernel Architecture
|
RevTex 6 pages, 7 figs, linked to arXiv:1003.5455[cs.SE]. Research at
http://www.quantware.ups-tlse.fr/, Improved version, changed format
|
Eur. Phys. J. B 79, 115-120 (2011)
|
10.1140/epjb/e2010-10774-7
| null |
cs.CE cond-mat.dis-nn nlin.CD physics.data-an
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the properties of spectrum and eigenstates of the Google matrix of a
directed network formed by the procedure calls in the Linux Kernel. Our results
obtained for various versions of the Linux Kernel show that the spectrum is
characterized by the fractal Weyl law established recently for systems of
quantum chaotic scattering and the Perron-Frobenius operators of dynamical
maps. The fractal Weyl exponent is found to be $\nu \approx 0.63$ that
corresponds to the fractal dimension of the network $d \approx 1.2$. The
eigenmodes of the Google matrix of Linux Kernel are localized on certain
principal nodes. We argue that the fractal Weyl law should be generic for
directed networks with the fractal dimension $d<2$.
|
[
{
"version": "v1",
"created": "Sun, 9 May 2010 13:25:58 GMT"
},
{
"version": "v2",
"created": "Tue, 11 May 2010 08:57:24 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Sep 2010 08:54:42 GMT"
}
] | 2011-01-20T00:00:00 |
[
[
"Ermann",
"L.",
""
],
[
"Chepelianskii",
"A. D.",
""
],
[
"Shepelyansky",
"D. L.",
""
]
] |
new_dataset
| 0.999017 |
1101.3443
|
Olivier Finkel
|
Olivier Finkel (ELM)
|
Borel Hierarchy and Omega Context Free Languages
| null |
Theoretical Computer Science 290 (3) (2003) 1385-1405
| null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give in this paper additional answers to questions of Lescow and Thomas
[Logical Specifications of Infinite Computations, In:"A Decade of Concurrency",
Springer LNCS 803 (1994), 583-621], proving new topological properties of omega
context free languages : there exist some omega-CFL which are non Borel sets.
And one cannot decide whether an omega-CFL is a Borel set. We give also an
answer to questions of Niwinski and Simonnet about omega powers of finitary
languages, giving an example of a finitary context free language L such that
L^omega is not a Borel set. Then we prove some recursive analogues to preceding
properties: in particular one cannot decide whether an omega-CFL is an
arithmetical set.
|
[
{
"version": "v1",
"created": "Tue, 18 Jan 2011 12:40:06 GMT"
}
] | 2011-01-20T00:00:00 |
[
[
"Finkel",
"Olivier",
"",
"ELM"
]
] |
new_dataset
| 0.996176 |
1003.1738
|
Mai Vu
|
Mai Vu
|
MISO Capacity with Per-Antenna Power Constraint
|
7 pages double-column, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish in closed-form the capacity and the optimal signaling scheme for
a MISO channel with per-antenna power constraint. Two cases of channel state
information are considered: constant channel known at both the transmitter and
receiver, and Rayleigh fading channel known only at the receiver. For the first
case, the optimal signaling scheme is beamforming with the phases of the beam
weights matched to the phases of the channel coefficients, but the amplitudes
independent of the channel coefficients and dependent only on the constrained
powers. For the second case, the optimal scheme is to send independent signals
from the antennas with the constrained powers. In both cases, the capacity with
per-antenna power constraint is usually less than that with sum power
constraint.
|
[
{
"version": "v1",
"created": "Mon, 8 Mar 2010 21:53:05 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jan 2011 16:37:34 GMT"
}
] | 2011-01-19T00:00:00 |
[
[
"Vu",
"Mai",
""
]
] |
new_dataset
| 0.961345 |
1101.3124
|
Xinyu Xing
|
Xinyu Xing, Yu-Li Liang, Hanqiang Cheng, Jianxun Dang, Sui Huang,
Richard Han, Xue Liu, Qin Lv, Shivakant Mishra
|
SafeVchat: Detecting Obscene Content and Misbehaving Users in Online
Video Chat Services
|
The 20th International World Wide Web Conference (WWW 2011)
| null | null | null |
cs.CR cs.CV cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online video chat services such as Chatroulette, Omegle, and vChatter that
randomly match pairs of users in video chat sessions are fast becoming very
popular, with over a million users per month in the case of Chatroulette. A key
problem encountered in such systems is the presence of flashers and obscene
content. This problem is especially acute given the presence of underage minors
in such systems. This paper presents SafeVchat, a novel solution to the problem
of flasher detection that employs an array of image detection algorithms. A key
contribution of the paper concerns how the results of the individual detectors
are fused together into an overall decision classifying the user as misbehaving
or not, based on Dempster-Shafer Theory. The paper introduces a novel,
motion-based skin detection method that achieves significantly higher recall
and better precision. The proposed methods have been evaluated over real world
data and image traces obtained from Chatroulette.com.
|
[
{
"version": "v1",
"created": "Mon, 17 Jan 2011 05:11:04 GMT"
}
] | 2011-01-19T00:00:00 |
[
[
"Xing",
"Xinyu",
""
],
[
"Liang",
"Yu-Li",
""
],
[
"Cheng",
"Hanqiang",
""
],
[
"Dang",
"Jianxun",
""
],
[
"Huang",
"Sui",
""
],
[
"Han",
"Richard",
""
],
[
"Liu",
"Xue",
""
],
[
"Lv",
"Qin",
""
],
[
"Mishra",
"Shivakant",
""
]
] |
new_dataset
| 0.996017 |
1101.3398
|
Wenping Ma
|
Wenping Ma
|
New Quadriphase Sequences families with Larger Linear Span and Size
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, new families of quadriphase sequences with larger linear span
and size have been proposed and studied. In particular, a new family of
quadriphase sequences of period $2^n-1$ for a positive integer $n=em$ with an
even positive factor $m$ is presented, the cross-correlation function among
these sequences has been explicitly calculated. Another new family of
quadriphase sequences of period $2(2^n-1)$ for a positive integer $n=em$ with
an even positive factor $m$ is also presented, a detailed analysis of the
cross-correlation function of proposed sequences has also been presented.
|
[
{
"version": "v1",
"created": "Tue, 18 Jan 2011 08:35:50 GMT"
}
] | 2011-01-19T00:00:00 |
[
[
"Ma",
"Wenping",
""
]
] |
new_dataset
| 0.999823 |
1101.2577
|
Prabhu D
|
D.Prabhu (1) and M.Adimoolam (2) ((1) Dept of Information Technology,
Mailam Engineering College, Mailam (Affiliated to Anna University of
Technology, Chennai) (2) Lecturer, Dept of Information Technology, Christ
College of Engineering and Technology, (Affiliated to Pondicherry University,
Puducherry))
|
Bi-serial DNA Encryption Algorithm(BDEA)
| null | null | null | null |
cs.CR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vast parallelism, exceptional energy efficiency and extraordinary
information inherent in DNA molecules are being explored for computing, data
storage and cryptography. DNA cryptography is a emerging field of cryptography.
In this paper a novel encryption algorithm is devised based on number
conversion, DNA digital coding, PCR amplification, which can effectively
prevent attack. Data treatment is used to transform the plain text into cipher
text which provides excellent security
|
[
{
"version": "v1",
"created": "Thu, 13 Jan 2011 15:08:32 GMT"
}
] | 2011-01-14T00:00:00 |
[
[
"Prabhu",
"D.",
""
],
[
"Adimoolam",
"M.",
""
]
] |
new_dataset
| 0.996513 |
1101.2219
|
Serguei Mokhov
|
Elizaveta Eidelman and Serguei A. Mokhov
|
Alchymical Mirror: Real-time Interactive Sound- and Simple
Motion-Tracking Set of Jitter/Max/MSP Patches
|
13 pages; a December 2005 report; video is not included into the
arXiv submission; Jitter language patches are not replicated in this version
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document supplements an experimental Jitter / Max/MSP collection of
implementation patches that set its goal to simulate an alchemical process for
a person standing in front of a mirror-like screen while interacting with it.
The work involved takes some patience and has three stages to go through. At
the final stage the "alchemist" in the mirror wearing sharp-colored gloves (for
motion tracking) is to extract the final ultimate shining sparkle (FFT-based
visualization) in the nexus of the hands. The more the hands are apart, the
large the sparkle should be. Moving hands around should make the sparkle
follow. To achieve the desired visual effect and the feedback mechanism, the
Jitter lattice-based intensional programming model is used to work on
4-dimensional (A+R+G+B) video matrices and sound signals in order to apply some
well-known alchemical techniques to the video at real-time to get a mirror
effect and accompanying transmutation and transformation stages of the video
based on the stability of the sound produced for some duration of time in
real-time. There is an accompanying video of the result with the interaction
with the tool and the corresponding programming patches.
|
[
{
"version": "v1",
"created": "Wed, 5 Jan 2011 18:43:30 GMT"
}
] | 2011-01-13T00:00:00 |
[
[
"Eidelman",
"Elizaveta",
""
],
[
"Mokhov",
"Serguei A.",
""
]
] |
new_dataset
| 0.991601 |
1101.1602
|
Jasni Mohamad Zain
|
Nor Amizam Jusoh, Jasni Mohamad Zain
|
Application of Freeman Chain Codes: An Alternative Recognition Technique
for Malaysian Car Plates
|
6 pages, 8 figures
|
International Journal of Computer Science and Network Security,
Vol. 9 No. 11 pp. 222-227, November 2009, ISSN 1738-7906
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various applications of car plate recognition systems have been developed
using various kinds of methods and techniques by researchers all over the
world. The applications developed were only suitable for specific country due
to its standard specification endorsed by the transport department of
particular countries. The Road Transport Department of Malaysia also has
endorsed a specification for car plates that includes the font and size of
characters that must be followed by car owners. However, there are cases where
this specification is not followed. Several applications have been developed in
Malaysia to overcome this problem. However, there is still problem in achieving
100% recognition accuracy. This paper is mainly focused on conducting an
experiment using chain codes technique to perform recognition for different
types of fonts used in Malaysian car plates.
|
[
{
"version": "v1",
"created": "Sat, 8 Jan 2011 16:22:20 GMT"
}
] | 2011-01-11T00:00:00 |
[
[
"Jusoh",
"Nor Amizam",
""
],
[
"Zain",
"Jasni Mohamad",
""
]
] |
new_dataset
| 0.975447 |
1101.1680
|
Ted Herman
|
Ted Herman
|
Safe Register Token Transfer in a Ring
|
22 pages
| null | null |
TR-11-01
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A token ring is an arrangement of N processors that take turns engaging in an
activity which must be controlled. A token confers the right to engage in the
controlled activity. Processors communicate with neighbors in the ring to
obtain and release a token. The communication mechanism investigated in this
paper is the safe register abstraction, which may arbitrarily corrupt a value
that a processor reads when the operation reading a register is concurrent with
an write operation on that register by a neighboring processor. The main
results are simple protocols for quasi-atomic communication, constructed from
safe registers. A quasi-atomic register behaves atomically except that a
special undefined value may be returned in the case of concurrent read and
write operations. Under certain conditions that constrain the number of writes
and registers, quasi-atomic protocols are adequate substitutes for atomic
protocols. The paper demonstrates how quasi-atomic protocols can be used to
implement a self-stabilizing token ring, either by using two safe registers
between neighboring processors or by using O(lg N) safe registers between
neighbors, which lowers read complexity.
|
[
{
"version": "v1",
"created": "Sun, 9 Jan 2011 22:24:44 GMT"
}
] | 2011-01-11T00:00:00 |
[
[
"Herman",
"Ted",
""
]
] |
new_dataset
| 0.99839 |
1101.1240
|
Lin Zhong
|
Mian Dong and Lin Zhong
|
Chameleon: A Color-Adaptive Web Browser for Mobile OLED Displays
| null | null | null | null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Displays based on organic light-emitting diode (OLED) technology are
appearing on many mobile devices. Unlike liquid crystal displays (LCD), OLED
displays consume dramatically different power for showing different colors. In
particular, OLED displays are inefficient for showing bright colors. This has
made them undesirable for mobile devices because much of the web content is of
bright colors.
To tackle this problem, we present the motivational studies, design, and
realization of Chameleon, a color adaptive web browser that renders web pages
with power-optimized color schemes under user-supplied constraints. Driven by
the findings from our motivational studies, Chameleon provides end users with
important options, offloads tasks that are not absolutely needed in real-time,
and accomplishes real-time tasks by carefully enhancing the codebase of a
browser engine. According to measure-ments with OLED smartphones, Chameleon is
able to re-duce average system power consumption for web browsing by 41% and
reduce display power consumption by 64% without introducing any noticeable
delay.
|
[
{
"version": "v1",
"created": "Mon, 13 Dec 2010 18:45:13 GMT"
}
] | 2011-01-07T00:00:00 |
[
[
"Dong",
"Mian",
""
],
[
"Zhong",
"Lin",
""
]
] |
new_dataset
| 0.999428 |
1101.1256
|
Christoph Durr
|
Johanne Cohen, Christoph Durr and Nguyen Kim Thang
|
Non-clairvoyant Scheduling Games
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a scheduling game, each player owns a job and chooses a machine to execute
it. While the social cost is the maximal load over all machines (makespan), the
cost (disutility) of each player is the completion time of its own job. In the
game, players may follow selfish strategies to optimize their cost and
therefore their behaviors do not necessarily lead the game to an equilibrium.
Even in the case there is an equilibrium, its makespan might be much larger
than the social optimum, and this inefficiency is measured by the price of
anarchy -- the worst ratio between the makespan of an equilibrium and the
optimum. Coordination mechanisms aim to reduce the price of anarchy by
designing scheduling policies that specify how jobs assigned to a same machine
are to be scheduled. Typically these policies define the schedule according to
the processing times as announced by the jobs. One could wonder if there are
policies that do not require this knowledge, and still provide a good price of
anarchy. This would make the processing times be private information and avoid
the problem of truthfulness. In this paper we study these so-called
non-clairvoyant policies. In particular, we study the RANDOM policy that
schedules the jobs in a random order without preemption, and the EQUI policy
that schedules the jobs in parallel using time-multiplexing, assigning each job
an equal fraction of CPU time.
|
[
{
"version": "v1",
"created": "Thu, 6 Jan 2011 17:05:50 GMT"
}
] | 2011-01-07T00:00:00 |
[
[
"Cohen",
"Johanne",
""
],
[
"Durr",
"Christoph",
""
],
[
"Thang",
"Nguyen Kim",
""
]
] |
new_dataset
| 0.986821 |
1004.4727
|
Krzysztof R. Apt
|
Krzysztof R. Apt
|
Direct Proofs of Order Independence
|
9 pages
|
Economics Bulletin, Vol. 31 no. 1 pp. 106-115 (2011)
| null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish a generic result concerning order independence of a dominance
relation on finite games. It allows us to draw conclusions about order
independence of various dominance relations in a direct and simple way.
|
[
{
"version": "v1",
"created": "Tue, 27 Apr 2010 07:17:50 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Jan 2011 07:14:10 GMT"
}
] | 2011-01-06T00:00:00 |
[
[
"Apt",
"Krzysztof R.",
""
]
] |
new_dataset
| 0.960932 |
1101.0964
|
Yota Otachi
|
Yota Otachi and Ryohei Suda
|
Bandwidth and pathwidth of three-dimensional grids
|
11 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the bandwidth and the pathwidth of multi-dimensional grids. It can
be shown for grids, that these two parameters are equal to a more basic graph
parameter, the vertex boundary width. Using this fact, we determine the
bandwidth and the pathwidth of three-dimensional grids, which were known only
for the cubic case. As a by-product, we also determine the two parameters of
multi-dimensional grids with relatively large maximum factors.
|
[
{
"version": "v1",
"created": "Wed, 5 Jan 2011 13:29:38 GMT"
}
] | 2011-01-06T00:00:00 |
[
[
"Otachi",
"Yota",
""
],
[
"Suda",
"Ryohei",
""
]
] |
new_dataset
| 0.993216 |
1101.0640
|
Chandra Nair
|
Chandra Nair
|
A note on outer bounds for broadcast channel
|
This was presented in the International Zurich Seminar 2010. This is
just for a documented proof of the result
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note we establish two facts concerning the so-called {\em New-Jersey}
outer bound. We show that this outer bound is equivalent to a much simpler {\em
computable} region; and secondly we show that in the absence of private
information this bound is exactly same as the $UV$-outerbound.
|
[
{
"version": "v1",
"created": "Tue, 4 Jan 2011 02:28:37 GMT"
}
] | 2011-01-05T00:00:00 |
[
[
"Nair",
"Chandra",
""
]
] |
new_dataset
| 0.980472 |
1101.0664
|
Evgenii Vorozhtsov
|
G.A. Tarnavsky and E.V. Vorozhtsov
|
Computer Simulation Center in Internet
|
12 pages, 8 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The general description of infrastructure and content of SciShop.ru computer
simulation center is given. This resource is a new form of knowledge generation
and remote education using modern Cloud Computing technologies.
|
[
{
"version": "v1",
"created": "Tue, 4 Jan 2011 06:58:07 GMT"
}
] | 2011-01-05T00:00:00 |
[
[
"Tarnavsky",
"G. A.",
""
],
[
"Vorozhtsov",
"E. V.",
""
]
] |
new_dataset
| 0.983366 |
0705.2106
|
Finn {\AA}rup Nielsen
|
Finn Aarup Nielsen
|
Scientific citations in Wikipedia
|
5 pages, 2 figures
|
First Monday, 12(8), 2007 August
| null | null |
cs.DL cs.IR
| null |
The Internet-based encyclopaedia Wikipedia has grown to become one of the
most visited web-sites on the Internet. However, critics have questioned the
quality of entries, and an empirical study has shown Wikipedia to contain
errors in a 2005 sample of science entries. Biased coverage and lack of sources
are among the "Wikipedia risks". The present work describes a simple assessment
of these aspects by examining the outbound links from Wikipedia articles to
articles in scientific journals with a comparison against journal statistics
from Journal Citation Reports such as impact factors. The results show an
increasing use of structured citation markup and good agreement with the
citation pattern seen in the scientific literature though with a slight
tendency to cite articles in high-impact journals such as Nature and Science.
These results increase confidence in Wikipedia as an good information organizer
for science in general.
|
[
{
"version": "v1",
"created": "Tue, 15 May 2007 09:42:30 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Nielsen",
"Finn Aarup",
""
]
] |
new_dataset
| 0.997115 |
1006.4903
|
Frank Sottile
|
Luis David Garcia-Puente, Frank Sottile, Chungang Zhu
|
Toric degenerations of Bezier patches
|
21 pages, many .eps figures
| null | null | null |
cs.GR math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The control polygon of a Bezier curve is well-defined and has geometric
significance---there is a sequence of weights under which the limiting position
of the curve is the control polygon. For a Bezier surface patch, there are many
possible polyhedral control structures, and none are canonical. We propose a
not necessarily polyhedral control structure for surface patches, regular
control surfaces, which are certain C^0 spline surfaces. While not unique,
regular control surfaces are exactly the possible limiting positions of a
Bezier patch when the weights are allowed to vary.
|
[
{
"version": "v1",
"created": "Fri, 25 Jun 2010 03:11:37 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Dec 2010 05:17:12 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Garcia-Puente",
"Luis David",
""
],
[
"Sottile",
"Frank",
""
],
[
"Zhu",
"Chungang",
""
]
] |
new_dataset
| 0.998245 |
1012.5962
|
Jose Hernandez-Orallo
|
Jose Hernandez-Orallo
|
Annotated English
|
Keywords: English spelling, English pronunciation, Phonetic rules,
Diacritics, Pronunciation without Respelling, Spelling Reform. 68 pages
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This document presents Annotated English, a system of diacritical symbols
which turns English pronunciation into a precise and unambiguous process. The
annotations are defined and located in such a way that the original English
text is not altered (not even a letter), thus allowing for a consistent reading
and learning of the English language with and without annotations. The
annotations are based on a set of general rules that make the frequency of
annotations not dramatically high. This makes the reader easily associate
annotations with exceptions, and makes it possible to shape, internalise and
consolidate some rules for the English language which otherwise are weakened by
the enormous amount of exceptions in English pronunciation. The advantages of
this annotation system are manifold. Any existing text can be annotated without
a significant increase in size. This means that we can get an annotated version
of any document or book with the same number of pages and fontsize. Since no
letter is affected, the text can be perfectly read by a person who does not
know the annotation rules, since annotations can be simply ignored. The
annotations are based on a set of rules which can be progressively learned and
recognised, even in cases where the reader has no access or time to read the
rules. This means that a reader can understand most of the annotations after
reading a few pages of Annotated English, and can take advantage from that
knowledge for any other annotated document she may read in the future.
|
[
{
"version": "v1",
"created": "Wed, 29 Dec 2010 15:40:09 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Dec 2010 10:21:09 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Hernandez-Orallo",
"Jose",
""
]
] |
new_dataset
| 0.982082 |
1101.0093
|
Georg Hager
|
Markus Wittmann and Georg Hager
|
Optimizing ccNUMA locality for task-parallel execution under OpenMP and
TBB on multicore-based systems
|
9 pages, 4 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Task parallelism as employed by the OpenMP task construct or some Intel
Threading Building Blocks (TBB) components, although ideal for tackling
irregular problems or typical producer/consumer schemes, bears some potential
for performance bottlenecks if locality of data access is important, which is
typically the case for memory-bound code on ccNUMA systems. We present a thin
software layer ameliorates adverse effects of dynamic task distribution by
sorting tasks into locality queues, each of which is preferably processed by
threads that belong to the same locality domain. Dynamic scheduling is fully
preserved inside each domain, and is preferred over possible load imbalance
even if nonlocal access is required, making this strategy well-suited for
typical multicore-mutisocket systems. The effectiveness of the approach is
demonstrated by using a blocked six-point stencil solver as a toy model.
|
[
{
"version": "v1",
"created": "Thu, 30 Dec 2010 14:55:02 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Wittmann",
"Markus",
""
],
[
"Hager",
"Georg",
""
]
] |
new_dataset
| 0.993938 |
1101.0234
|
Michael Lew
|
Ruoyun Gao, Michael S. Lew, Ling Shao
|
Dynamic Feature Description in Human Action Recognition
| null | null | null |
LML20090701
|
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work aims to present novel description methods for human action
recognition. Generally, a video sequence can be represented as a collection of
spatial temporal words by detecting space-time interest points and describing
the unique features around the detected points (Bag of Words representation).
Interest points as well as the cuboids around them are considered informative
for feature description in terms of both the structural distribution of
interest points and the information content inside the cuboids. Our proposed
description approaches are based on this idea and making the feature
descriptors more discriminative.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 12:06:11 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Gao",
"Ruoyun",
""
],
[
"Lew",
"Michael S.",
""
],
[
"Shao",
"Ling",
""
]
] |
new_dataset
| 0.974441 |
1101.0262
|
Sugreev Kaur
|
Sugreev Kaur, Rajesh Mehra
|
High Speed and Area Efficient 2D DWT Processor based Image Compression"
Signal & Image Processing
|
10 Pages, 9 figures
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a high speed and area efficient DWT processor based
design for Image Compression applications. In this proposed design, pipelined
partially serial architecture has been used to enhance the speed along with
optimal utilization and resources available on target FPGA. The proposed model
has been designed and simulated using Simulink and System Generator blocks,
synthesized with Xilinx Synthesis tool (XST) and implemented on Spartan 2 and 3
based XC2S100-5tq144 and XC3S500E-4fg320 target device. The results show that
proposed design can operate at maximum frequency 231 MHz in case of Spartan 3
by consuming power of 117mW at 28 degree/c junction temperature. The result
comparison has shown an improvement of 15% in speed.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 14:34:06 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Kaur",
"Sugreev",
""
],
[
"Mehra",
"Rajesh",
""
]
] |
new_dataset
| 0.975392 |
1101.0530
|
Maurice Margenstern
|
Maurice Margenstern
|
Coordinates for a new triangular tiling of the hyperbolic plane
|
15 pages, 8 figures, 3 tables
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we define an infinite family of triangular tilings of the
hyperbolic plane defined by two parameters ranging in the natural nummbers and
we give a uniform way to define coordinates for locating the triangles of the
tiling.
|
[
{
"version": "v1",
"created": "Mon, 3 Jan 2011 14:39:40 GMT"
}
] | 2011-01-04T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.997525 |
1012.1334
|
Pierre Guillon
|
Pablo Arrighi (LIG), Vincent Fabrice Nesme
|
The Block Neighborhood
|
Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)
| null | null | null |
cs.DM cs.FL nlin.CG quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the block neighborhood of a reversible CA, which is related both to
its decomposition into a product of block permutations and to quantum
computing. We give a purely combinatorial characterization of the block
neighborhood, which helps in two ways. First, it makes the computation of the
block neighborhood of a given CA relatively easy. Second, it allows us to
derive upper bounds on the block neighborhood: for a single CA as function of
the classical and inverse neighborhoods, and for the composition of several
CAs. One consequence of that is a characterization of a class of "elementary"
CAs that cannot be written as the composition of two simpler parts whose
neighborhoods and inverse neighborhoods would be reduced by one half.
|
[
{
"version": "v1",
"created": "Fri, 3 Dec 2010 10:07:13 GMT"
}
] | 2010-12-30T00:00:00 |
[
[
"Arrighi",
"Pablo",
"",
"LIG"
],
[
"Nesme",
"Vincent Fabrice",
""
]
] |
new_dataset
| 0.992774 |
1012.5498
|
Somphong Jitman
|
Somphong Jitman, San Ling, Hongwei Liu, and Xiaoli Xie
|
Checkable Codes from Group Rings
|
9 pages, 4 tables, Submitted to IEEE Transactions on Information
Theory, December 2010
| null | null | null |
cs.IT math.AC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study codes with a single check element derived from group rings, namely,
checkable codes. The notion of a code-checkable group ring is introduced.
Necessary and sufficient conditions for a group ring to be code-checkable are
given in the case where the group is a finite abelian group and the ring is a
finite field. This characterization leads to many good examples, among which
two checkable codes and two shortened codes have minimum distance better than
the lower bound given in Grassl's online table. Furthermore, when a group ring
is code-checkable, it is shown that every code in such a group ring admits a
generator, and that its dual is also generated by an element which may be
deduced directly from a check element of the original code. These are analogous
to the generator and parity-check polynomials of cyclic codes. In addition, the
structures of reversible and complementary dual checkable codes are established
as generalizations of reversible and complementary dual cyclic codes.
|
[
{
"version": "v1",
"created": "Sun, 26 Dec 2010 08:34:06 GMT"
}
] | 2010-12-30T00:00:00 |
[
[
"Jitman",
"Somphong",
""
],
[
"Ling",
"San",
""
],
[
"Liu",
"Hongwei",
""
],
[
"Xie",
"Xiaoli",
""
]
] |
new_dataset
| 0.999659 |
1012.5594
|
Kush Agrawal
|
Kush Agrawal
|
The Ethics of Robotics
|
8 pages, 1 figure
| null | null | null |
cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The three laws of Robotics first appeared together in Isaac Asimov's story
'Runaround' after being mentioned in some form or the other in previous works
by Asimov. These three laws commonly known as the three laws of robotics are
the earliest forms of depiction for the needs of ethics in Robotics. In
simplistic language Isaac Asimov is able to explain what rules a robot must
confine itself to in order to maintain societal sanctity. However, even though
they are outdated they still represent some of our innate fears which are
beginning to resurface in present day 21st Century. Our society is on the
advent of a new revolution; a revolution led by advances in Computer Science,
Artificial Intelligence & Nanotechnology. Some of our advances have been so
phenomenal that we surpassed what was predicted by the Moore's law. With these
advancements comes the fear that our future may be at the mercy of these
androids. Humans today are scared that we, ourselves, might create something
which we cannot control. We may end up creating something which can not only
learn much faster than anyone of us can, but also evolve faster than what the
theory of evolution has allowed us to. The greatest fear is not only that we
might lose our jobs to these intelligent beings, but that these beings might
end up replacing us at the top of the cycle. The public hysteria has been
heightened more so by a number of cultural works which depict annihilation of
the human race by robots. Right from Frankenstein to I, Robot mass media has
also depicted such issues. This paper is an effort to understand the need for
ethics in Robotics or simply termed as Roboethics. This is achieved by the
study of artificial beings and the thought being put behind them. By the end of
the paper, however, it is concluded that there isn't a need for ethical robots
but more so ever a need for ethical roboticists.
|
[
{
"version": "v1",
"created": "Mon, 27 Dec 2010 11:14:56 GMT"
}
] | 2010-12-30T00:00:00 |
[
[
"Agrawal",
"Kush",
""
]
] |
new_dataset
| 0.996453 |
1008.2857
|
Aydin Sezgin
|
Aydin Sezgin, Holger Boche, and Amir Salman Avestimehr
|
Bidirectional multi-pair network with a MIMO relay: Beamforming
strategies and lack of duality
|
Allerton 2010, updated the references
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of a multi-user relay network, where multiple
single-antenna node pairs want to exchange information by using a multiple
antenna relay node. Due to the half-duplex constraint of the relay, the
exchange of information takes place in two steps. In the first step, the nodes
transmit their data to the relay, while in the second step, the relay is
broadcasting the data by using linear and non-linear precoding strategies. We
focus on the second step in this paper. We first consider the problem of
maximizing the overall rate achievable using linear and dirty-paper type
precoding strategies at the relay. Then, we consider minimizing the total power
at the relay subject to individual SINR constraints using the same strategies
at the relay. We show that the downlink-uplink duality does not hold for the
setup considered here, which is a somewhat surprising result. We also show that
the beamforming strategy which is optimal in the single-pair case performs very
well in the multi-pair case for practically relevant SNR. The results are
illustrated by numerical simulations.
|
[
{
"version": "v1",
"created": "Tue, 17 Aug 2010 10:02:03 GMT"
},
{
"version": "v2",
"created": "Sat, 4 Dec 2010 21:06:26 GMT"
},
{
"version": "v3",
"created": "Wed, 22 Dec 2010 10:15:57 GMT"
}
] | 2010-12-23T00:00:00 |
[
[
"Sezgin",
"Aydin",
""
],
[
"Boche",
"Holger",
""
],
[
"Avestimehr",
"Amir Salman",
""
]
] |
new_dataset
| 0.957167 |
1012.4881
|
Deniz Sarioz
|
Deniz Sarioz
|
Generalized Delaunay Graphs with respect to any Convex Set are Plane
Graphs
|
3 pages, 0 figures. Keywords: geometric graphs, Delaunay graphs,
scaled translates, convex sets, planarity
| null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider two types of geometric graphs on point sets on the plane based on
a plane set C: one obtained by translates of C, another by positively scaled
translates (homothets) of C. For compact and convex C, graphs defined by scaled
translates of C, i.e., Delaunay graphs based on C, are known to be plane
graphs. We show that as long as C is convex, both types of graphs are plane
graphs.
|
[
{
"version": "v1",
"created": "Wed, 22 Dec 2010 06:06:55 GMT"
}
] | 2010-12-23T00:00:00 |
[
[
"Sarioz",
"Deniz",
""
]
] |
new_dataset
| 0.999598 |
0911.2567
|
Christoph Durr
|
Marek Chrobak, Christoph Durr, Flavio Guinez, Antoni Lozano, Nguyen
Kim Thang
|
Tile Packing Tomography is NP-hard
| null | null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discrete tomography deals with reconstructing finite spatial objects from
lower dimensional projections and has applications for example in timetable
design. In this paper we consider the problem of reconstructing a tile packing
from its row and column projections. It consists of disjoint copies of a fixed
tile, all contained in some rectangular grid. The projections tell how many
cells are covered by a tile in each row and column. How difficult is it to
construct a tile packing satisfying given projections? It was known to be
solvable by a greedy algorithm for bars (tiles of width or height 1), and
NP-hardness results were known for some specific tiles. This paper shows that
the problem is NP-hard whenever the tile is not a bar.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2009 08:54:27 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Dec 2010 09:43:49 GMT"
}
] | 2010-12-22T00:00:00 |
[
[
"Chrobak",
"Marek",
""
],
[
"Durr",
"Christoph",
""
],
[
"Guinez",
"Flavio",
""
],
[
"Lozano",
"Antoni",
""
],
[
"Thang",
"Nguyen Kim",
""
]
] |
new_dataset
| 0.989837 |
1012.4487
|
Damianos Gavalas
|
Konstantina Zafeiri, Damianos Gavalas, Aikaterini Balla
|
Selling Culture: Implementation of e-Commerce and WAP-based Prototypes
|
9 pages, 8 figures
|
International Review on Computers and Software (ISSN: 1828-6003),
1(1), pp 68-76, Praise Worthy Prize, July 2006
| null | null |
cs.NI cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Museum stores represent integral parts of the museums that have also a lot to
benefit from a successful presence on the web arena. In addition to traditional
web sites, carefully designed electronic commerce (e-commerce) sites may
increase the potential of museum stores offering possibilities for on-line
shopping and other commercial functions. In parallel, the recent convergence of
the traditionally separate technologies of the Internet and mobile telephony
has brought the concept of 'wireless Internet' into the spotlight. Within this
context, 'mobile commerce' (m-commerce) is a relatively new trend that
represents a natural extension of e-commerce into the wireless world.
M-commerce refers to electronic business transactions and differentiates from
e-commerce since it involves the use of mobile devices and wireless medium
rather than wired. The unique characteristics of mobile computing bring forward
new challenges and opportunities for museum stores. This article presents the
design and implementation of an e-commerce and an m-commerce museum shop
application. The aim is to evaluate and compare the two applications in terms
of several parameters, such as available technologies, strengths and
limitations, design requirements, usability, interaction speed, usage cost, etc
and also to identify ways for enhancing the potential of such applications and
designing successful and profitable business models.
|
[
{
"version": "v1",
"created": "Mon, 20 Dec 2010 21:58:37 GMT"
}
] | 2010-12-22T00:00:00 |
[
[
"Zafeiri",
"Konstantina",
""
],
[
"Gavalas",
"Damianos",
""
],
[
"Balla",
"Aikaterini",
""
]
] |
new_dataset
| 0.966583 |
1012.4691
|
Thomas Sejr Jensen
|
Steffen Godskesen, Thomas Sejr Jensen, Niels Kjeldsen, Rune Larsen
|
Solving a real-life large-scale energy management problem
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a three-phase heuristic approach for a large-scale
energy management and maintenance scheduling problem. The problem is concerned
with scheduling maintenance and refueling for nuclear power plants up to five
years into the future, while handling a number of scenarios for future demand
and prices. The goal is to minimize the expected total production costs. The
first phase of the heuristic solves a simplified constraint programming model
of the problem, the second performs a local search, and the third handles
overproduction in a greedy fashion.
This work was initiated in the context of the ROADEF/EURO Challenge 2010, a
competition organized jointly by the French Operational Research and Decision
Support Society, the European Operational Research Society, and the European
utility company Electricite de France. In the concluding phase of the
competition our team ranked second in the junior category and sixth overall.
After correcting an implementation bug in the program that was submitted for
evaluation, our heuristic solves all ten real-life instances, and the solutions
obtained are all within 2.45% of the currently best known solutions. The
results given here would have ranked first in the original competition.
|
[
{
"version": "v1",
"created": "Tue, 21 Dec 2010 15:21:26 GMT"
}
] | 2010-12-22T00:00:00 |
[
[
"Godskesen",
"Steffen",
""
],
[
"Jensen",
"Thomas Sejr",
""
],
[
"Kjeldsen",
"Niels",
""
],
[
"Larsen",
"Rune",
""
]
] |
new_dataset
| 0.957486 |
1012.4755
|
Emmanuel Abbe A
|
Emmanuel Abbe
|
Mutual information, matroids and extremal dependencies
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, it is shown that the rank function of a matroid can be
represented by a "mutual information function" if and only if the matroid is
binary. The mutual information function considered is the one measuring the
amount of information between the inputs (binary uniform) and the output of a
multiple access channel (MAC). Moreover, it is shown that a MAC whose mutual
information function is integer valued is "equivalent" to a linear
deterministic MAC, in the sense that it essentially contains at the output no
more information than some linear forms of the inputs. These notes put emphasis
on the connection between mutual information functionals and rank functions in
matroid theory, without assuming prior knowledge on these two subjects. The
first section introduces mutual information functionals, the second section
introduces basic notions of matroid theory, and the third section connects
these two subjects. It is also shown that entropic matroids studied in the
literature correspond to specific cases of MAC matroids.
|
[
{
"version": "v1",
"created": "Tue, 21 Dec 2010 18:18:13 GMT"
}
] | 2010-12-22T00:00:00 |
[
[
"Abbe",
"Emmanuel",
""
]
] |
new_dataset
| 0.979126 |
1012.4759
|
Ying Ding
|
Bin Chen (1), David J Wild (1), Qian Zhu (1), Ying Ding (2), Xiao Dong
(1), Madhuvanthi Sankaranarayanan (1), Huijun Wang (1), Yuyin Sun (2) ((1)
School of Informatics and Computing, Indiana University, Bloomington, IN,
USA, (2) School of Library and Information Science, Indiana University,
Bloomington, IN, USA)
|
Chem2Bio2RDF: A Linked Open Data Portal for Chemical Biology
|
8 pages, 10 figures
| null | null | null |
cs.IR q-bio.OT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Chem2Bio2RDF portal is a Linked Open Data (LOD) portal for systems
chemical biology aiming for facilitating drug discovery. It converts around 25
different datasets on genes, compounds, drugs, pathways, side effects,
diseases, and MEDLINE/PubMed documents into RDF triples and links them to other
LOD bubbles, such as Bio2RDF, LODD and DBPedia. The portal is based on D2R
server and provides a SPARQL endpoint, but adds on few unique features like RDF
faceted browser, user-friendly SPARQL query generator, MEDLINE/PubMed cross
validation service, and Cytoscape visualization plugin. Three use cases
demonstrate the functionality and usability of this portal.
|
[
{
"version": "v1",
"created": "Tue, 21 Dec 2010 18:29:54 GMT"
}
] | 2010-12-22T00:00:00 |
[
[
"Chen",
"Bin",
""
],
[
"Wild",
"David J",
""
],
[
"Zhu",
"Qian",
""
],
[
"Ding",
"Ying",
""
],
[
"Dong",
"Xiao",
""
],
[
"Sankaranarayanan",
"Madhuvanthi",
""
],
[
"Wang",
"Huijun",
""
],
[
"Sun",
"Yuyin",
""
]
] |
new_dataset
| 0.999534 |
1012.4240
|
Joachim Schimpf
|
Joachim Schimpf and Kish Shen
|
ECLiPSe - from LP to CLP
|
To appear in Theory and Practice of Logic Programming (TPLP)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ECLiPSe is a Prolog-based programming system, aimed at the development and
deployment of constraint programming applications. It is also used for teaching
most aspects of combinatorial problem solving, e.g. problem modelling,
constraint programming, mathematical programming, and search techniques. It
uses an extended Prolog as its high-level modelling and control language,
complemented by several constraint solver libraries, interfaces to third-party
solvers, an integrated development environment and interfaces for embedding
into host environments. This paper discusses language extensions,
implementation aspects, components and tools that we consider relevant on the
way from Logic Programming to Constraint Logic Programming.
|
[
{
"version": "v1",
"created": "Mon, 20 Dec 2010 05:11:57 GMT"
}
] | 2010-12-21T00:00:00 |
[
[
"Schimpf",
"Joachim",
""
],
[
"Shen",
"Kish",
""
]
] |
new_dataset
| 0.998938 |
1012.4263
|
Simon Gog
|
Simon Gog and Enno Ohlebusch
|
Lightweight LCP-Array Construction in Linear Time
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The suffix tree is a very important data structure in string processing, but
it suffers from a huge space consumption. In large-scale applications,
compressed suffix trees (CSTs) are therefore used instead. A CST consists of
three (compressed) components: the suffix array, the LCP-array, and data
structures for simulating navigational operations on the suffix tree. The
LCP-array stores the lengths of the longest common prefixes of
lexicographically adjacent suffixes, and it can be computed in linear time. In
this paper, we present new LCP-array construction algorithms that are fast and
very space efficient. In practice, our algorithms outperform the currently best
algorithms.
|
[
{
"version": "v1",
"created": "Mon, 20 Dec 2010 09:08:05 GMT"
}
] | 2010-12-21T00:00:00 |
[
[
"Gog",
"Simon",
""
],
[
"Ohlebusch",
"Enno",
""
]
] |
new_dataset
| 0.999352 |
1011.6508
|
Binod Kumar Pattanayak
|
Binod Kumar Pattanayak, Manoj Kumar Mishra, Alok Kumar Jagadev,
Manojranjan Nayak
|
Multi-Hop Bandwidth Management Protocol for Mobile Ad Hoc Networks
|
20 pages,30 figures
|
International Journal of Managing Information technology, November
2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An admission control scheme should play the role of a coordinator for flows
in a data communication network, to provide the guarantees as the medium is
shared. The nodes of a wired network can monitor the medium to know the
available bandwidth at any point of time. But, in wireless ad hoc networks, a
node must consume the bandwidth of neighboring nodes, during a communication.
Hence, the consumption of bandwidth by a flow and the availability of resources
to any wireless node strictly depend upon the neighboring nodes within its
transmission range. We present a scalable and efficient admission control
scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS
requirements in multi-hop ad hoc networks. We simulate several options to
design MBMP and compare the performances of these options through mathematical
analysis and simulation results, and compare its effectiveness with the
existing admission control schemes through extensive simulations.
|
[
{
"version": "v1",
"created": "Tue, 30 Nov 2010 10:03:53 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Dec 2010 08:55:15 GMT"
}
] | 2010-12-20T00:00:00 |
[
[
"Pattanayak",
"Binod Kumar",
""
],
[
"Mishra",
"Manoj Kumar",
""
],
[
"Jagadev",
"Alok Kumar",
""
],
[
"Nayak",
"Manojranjan",
""
]
] |
new_dataset
| 0.983253 |
1012.3805
|
Yang Wang
|
Yang Wang, Zhikui Chen, Xiaodi Huang
|
Element Retrieval using Namespace Based on keyword search over XML
Documents
|
9 pages
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Querying over XML elements using keyword search is steadily gaining
popularity. The traditional similarity measure is widely employed in order to
effectively retrieve various XML documents. A number of authors have already
proposed different similarity-measure methods that take advantage of the
structure and content of XML documents. They do not, however, consider the
similarity between latent semantic information of element texts and that of
keywords in a query. Although many algorithms on XML element search are
available, some of them have the high computational complexity due to searching
a huge number of elements. In this paper, we propose a new algorithm that makes
use of the semantic similarity between elements instead of between entire XML
documents, considering not only the structure and content of an XML document,
but also semantic information of namespaces in elements. We compare our
algorithm with the three other algorithms by testing on the real datasets. The
experiments have demonstrated that our proposed method is able to improve the
query accuracy, as well as to reduce the running time.
|
[
{
"version": "v1",
"created": "Fri, 17 Dec 2010 04:00:10 GMT"
}
] | 2010-12-20T00:00:00 |
[
[
"Wang",
"Yang",
""
],
[
"Chen",
"Zhikui",
""
],
[
"Huang",
"Xiaodi",
""
]
] |
new_dataset
| 0.976958 |
1011.4438
|
Yun Bao Huang
|
Yun Bao Huang
|
Smooth infinite words over $n$-letter alphabets having same remainder
when divided by $n$
|
25 pages
| null | null | null |
cs.FL cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brlek et al. (2008) studied smooth infinite words and established some
results on letter frequency, recurrence, reversal and complementation for
2-letter alphabets having same parity. In this paper, we explore smooth
infinite words over $n$-letter alphabet $\{a_1,a_2,...,a_n\}$, where
$a_1<a_2<...<a_n$ are positive integers and have same remainder when divided by
$n$. And let $a_i=n\cdot q_i+r,\;q_i\in N$ for $i=1,2,...,n$, where
$r=0,1,2,...,n-1$. We use distinct methods to prove that (1) if $r=0$, the
letters frequency of two times differentiable well-proportioned infinite words
is $1/n$, which suggests that the letter frequency of the generalized Kolakoski
sequences is $1/2$ for 2-letter even alphabets; (2) the smooth infinite words
are recurrent; (3) if $r=0$ or $r>0 \text{ and }n$ is an even number, the
generalized Kolakoski words are uniformly recurrent for the alphabet $\Sigma_n$
with the cyclic order; (4) the factor set of three times differentiable
infinite words is not closed under any nonidentical permutation. Brlek et al.'s
results are only the special cases of our corresponding results.
|
[
{
"version": "v1",
"created": "Fri, 19 Nov 2010 14:32:49 GMT"
}
] | 2010-12-16T00:00:00 |
[
[
"Huang",
"Yun Bao",
""
]
] |
new_dataset
| 0.997559 |
1012.3201
|
Qin Huang
|
Qin Huang, Qiuju Diao, Shu Lin and Khaled Abdel-Ghaffar
|
Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained
Parity-Check Matrices and Their Trapping Sets
|
70 pages, submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with construction and structural analysis of both
cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three
parts. The first part shows that a cyclic code given by a parity-check matrix
in circulant form can be decomposed into descendant cyclic and quasi-cyclic
codes of various lengths and rates. Some fundamental structural properties of
these descendant codes are developed, including the characterizations of the
roots of the generator polynomial of a cyclic descendant code. The second part
of the paper shows that cyclic and quasi-cyclic descendant LDPC codes can be
derived from cyclic finite geometry LDPC codes using the results developed in
first part of the paper. This enlarges the repertoire of cyclic LDPC codes. The
third part of the paper analyzes the trapping sets of regular LDPC codes whose
parity-check matrices satisfy a certain constraint on their rows and columns.
Several classes of finite geometry and finite field cyclic and quasi-cyclic
LDPC codes with large minimum weights are shown to have no harmful trapping
sets with size smaller than their minimum weights. Consequently, their
performance error-floors are dominated by their minimum weights.
|
[
{
"version": "v1",
"created": "Wed, 15 Dec 2010 00:39:43 GMT"
}
] | 2010-12-16T00:00:00 |
[
[
"Huang",
"Qin",
""
],
[
"Diao",
"Qiuju",
""
],
[
"Lin",
"Shu",
""
],
[
"Abdel-Ghaffar",
"Khaled",
""
]
] |
new_dataset
| 0.999177 |
1012.3452
|
Mohammad Nikseresht
|
Mohammad R Nikseresht, Anil Somayaji, Anil Maheshwari
|
Customer Appeasement Scheduling
| null | null | null |
TR-10-18
|
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Almost all of the current process scheduling algorithms which are used in
modern operating systems (OS) have their roots in the classical scheduling
paradigms which were developed during the 1970's. But modern computers have
different types of software loads and user demands. We think it is important to
run what the user wants at the current moment. A user can be a human, sitting
in front of a desktop machine, or it can be another machine sending a request
to a server through a network connection. We think that OS should become
intelligent to distinguish between different processes and allocate resources,
including CPU, to those processes which need them most. In this work, as a
first step to make the OS aware of the current state of the system, we consider
process dependencies and interprocess communications. We are developing a
model, which considers the need to satisfy interactive users and other possible
remote users or customers, by making scheduling decisions based on process
dependencies and interprocess communications. Our simple proof of concept
implementation and experiments show the effectiveness of this approach in the
real world applications. Our implementation does not require any change in the
software applications nor any special kind of configuration in the system,
Moreover, it does not require any additional information about CPU needs of
applications nor other resource requirements. Our experiments show significant
performance improvement for real world applications. For example, almost
constant average response time for Mysql data base server and constant frame
rate for mplayer under different simulated load values.
|
[
{
"version": "v1",
"created": "Wed, 15 Dec 2010 20:38:40 GMT"
}
] | 2010-12-16T00:00:00 |
[
[
"Nikseresht",
"Mohammad R",
""
],
[
"Somayaji",
"Anil",
""
],
[
"Maheshwari",
"Anil",
""
]
] |
new_dataset
| 0.953257 |
1012.2648
|
Georg Gottlob
|
S. Abiteboul, G. Gottlob, M. Manna
|
Distributed XML Design
|
"56 pages, 4 figures"
|
Proceedings of PODS '09 (2009) 247-258
|
10.1145/1559795.1559833
| null |
cs.DB cs.CC cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A distributed XML document is an XML document that spans several machines. We
assume that a distribution design of the document tree is given, consisting of
an XML kernel-document T[f1,...,fn] where some leaves are "docking points" for
external resources providing XML subtrees (f1,...,fn, standing, e.g., for Web
services or peers at remote locations). The top-down design problem consists
in, given a type (a schema document that may vary from a DTD to a tree
automaton) for the distributed document, "propagating" locally this type into a
collection of types, that we call typing, while preserving desirable
properties. We also consider the bottom-up design which consists in, given a
type for each external resource, exhibiting a global type that is enforced by
the local types, again with natural desirable properties. In the article, we
lay out the fundamentals of a theory of distributed XML design, analyze
problems concerning typing issues in this setting, and study their complexity.
|
[
{
"version": "v1",
"created": "Mon, 13 Dec 2010 07:45:30 GMT"
}
] | 2010-12-15T00:00:00 |
[
[
"Abiteboul",
"S.",
""
],
[
"Gottlob",
"G.",
""
],
[
"Manna",
"M.",
""
]
] |
new_dataset
| 0.999534 |
1012.2661
|
Christian Retore
|
Maxime Amblard (INRIA Lorraine - LORIA), Alain Lecomte (INRIA Bordeaux
- Sud-Ouest, SFLTAMP), Christian Retor\'e (INRIA Bordeaux - Sud-Ouest, LaBRI)
|
Categorial Minimalist Grammar
| null |
Linguistic Analysis 36, 1--4 (2010) 273--308
| null | null |
cs.CL math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We first recall some basic notions on minimalist grammars and on categorial
grammars. Next we shortly introduce partially commutative linear logic, and our
representation of minimalist grammars within this categorial system, the
so-called categorial minimalist grammars. Thereafter we briefly present
\lambda\mu-DRT (Discourse Representation Theory) an extension of \lambda-DRT
(compositional DRT) in the framework of \lambda\mu calculus: it avoids type
raising and derives different readings from a single semantic representation,
in a setting which follows discourse structure. We run a complete example which
illustrates the various structures and rules that are needed to derive a
semantic representation from the categorial view of a transformational
syntactic analysis.
|
[
{
"version": "v1",
"created": "Mon, 13 Dec 2010 08:55:43 GMT"
}
] | 2010-12-15T00:00:00 |
[
[
"Amblard",
"Maxime",
"",
"INRIA Lorraine - LORIA"
],
[
"Lecomte",
"Alain",
"",
"INRIA Bordeaux\n - Sud-Ouest, SFLTAMP"
],
[
"Retoré",
"Christian",
"",
"INRIA Bordeaux - Sud-Ouest, LaBRI"
]
] |
new_dataset
| 0.981729 |
1012.2995
|
Andreas Lundblad
|
Mads Dam, Andreas Lundblad
|
A Proof Carrying Code Framework for Inlined Reference Monitors in Java
Bytecode
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a light-weight approach for certification of monitor inlining for
sequential Java bytecode using proof-carrying code. The goal is to enable the
use of monitoring for quality assurance at development time, while minimizing
the need for post-shipping code rewrites as well as changes to the end-host
TCB. Standard automaton-based security policies express constraints on allowed
API call/return sequences. Proofs are represented as JML-style program
annotations. This is adequate in our case as all proofs generated in our
framework are recognized in time polynomial in the size of the program. Policy
adherence is proved by comparing the transitions of an inlined monitor with
those of a trusted "ghost" monitor represented using JML-style annotations. At
time of receiving a program with proof annotations, it is sufficient for the
receiver to plug in its own trusted ghost monitor and check the resulting
verification conditions, to verify that inlining has been performed correctly,
of the correct policy. We have proved correctness of the approach at the Java
bytecode level and formalized the proof of soundness in Coq. An implementation,
including an application loader running on a mobile device, is available, and
we conclude by giving benchmarks for two sample applications.
|
[
{
"version": "v1",
"created": "Tue, 14 Dec 2010 11:12:36 GMT"
}
] | 2010-12-15T00:00:00 |
[
[
"Dam",
"Mads",
""
],
[
"Lundblad",
"Andreas",
""
]
] |
new_dataset
| 0.990621 |
1012.2553
|
Jianhua Zhao
|
Jianhua Zhao, Xuandong Li
|
Scope Logic with Local Reasoning and Pre/Post-State Properties
|
30 pages, with two non-trival examples in the appendix
| null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents an extension to Hoare logic for pointer program
verification. Logic formulas with user-defined recursive functions are used to
specify properties on the program states before/after program executions.
Three basic functions are introduced to represents memory access,
record-field access and array-element access. Some axioms are introduced to
specify these basic functions in our logic.
The concept Memory Scope Function (MSF) is introduced in our logic. Given a
recursive function $f$, the MSF of $f$ computes the set of memory units
accessed during the evaluation of $f$. A set of rules are given to derive the
definition of this MSF syntactically from the definition of $f$. As MSFs are
also recursive functions, they also have their MSFs. An axiom is given to
specify that an MSF contains its MSF. Based on this axiom, local reasoning is
supported with predicate variables.
Pre-state terms are used to specify the relations between pre-states and
post-states. People can use pre-state terms in post-conditions to represents
the values on the pre-state.
The axiom of assignment statements in Hoare's logic is modified to deal with
pointers. The basic idea is that during the program execution, a recursive
function is evaluated to the same value as long as no memory unit in its memory
scope is modified. Another proof rule is added for memory allocation
statements.
We use a simple example to show that our logic can deal with pointer programs
in this paper. In the appendix, the Shorre-Waite algorithm is proved using our
logic. We also use the selection-sort program to show that our logic can be
used to prove program with indirectly-specified components.
|
[
{
"version": "v1",
"created": "Sun, 12 Dec 2010 16:12:57 GMT"
}
] | 2010-12-14T00:00:00 |
[
[
"Zhao",
"Jianhua",
""
],
[
"Li",
"Xuandong",
""
]
] |
new_dataset
| 0.999706 |
0809.5145
|
Youssef, Joseph Nasser
|
Youssef Nasser (IETR), Jean-Fran\c{c}ois H\'elard (IETR), Matthieu
Crussi\`ere (IETR)
|
3D MIMO Scheme for Broadcasting Future Digital TV in Single Frequency
Networks
| null |
Electronics Letters / IEE Electronics Letters 44, 13 (2008)
829-830
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter introduces a 3D space-time-space block code for future digital TV
systems. The code is based on a double layer structure for inter-cell and
intra-cell transmission mode in single frequency networks. Without increasing
the complexity of the receiver, the proposed code is very efficient for
different transmission scenarios.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2008 09:23:19 GMT"
}
] | 2010-12-13T00:00:00 |
[
[
"Nasser",
"Youssef",
"",
"IETR"
],
[
"Hélard",
"Jean-François",
"",
"IETR"
],
[
"Crussière",
"Matthieu",
"",
"IETR"
]
] |
new_dataset
| 0.998646 |
1012.2256
|
Laurent Lefevre
|
Anne-C\'ecile Orgerie (INRIA Rh\^one-Alpes / LIP Laboratoire de
l'Informatique du Parall\'elisme), Laurent Lef\`evre (INRIA Rh\^one-Alpes /
LIP Laboratoire de l'Informatique du Parall\'elisme)
|
A year in the life of a large scale experimental distributed system: the
Grid'5000 platform in 2008
| null | null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents the usage results of Grid'5000 over year 2008. Usage of
the main operationnal Grid'5000 sites (Bordeaux, Lille, Lyon, Nancy, Orsay,
Rennes, Sophia-Antipolis, Toulouse) is presented and analyzed.
|
[
{
"version": "v1",
"created": "Fri, 10 Dec 2010 13:07:28 GMT"
}
] | 2010-12-13T00:00:00 |
[
[
"Orgerie",
"Anne-Cécile",
"",
"INRIA Rhône-Alpes / LIP Laboratoire de\n l'Informatique du Parallélisme"
],
[
"Lefèvre",
"Laurent",
"",
"INRIA Rhône-Alpes /\n LIP Laboratoire de l'Informatique du Parallélisme"
]
] |
new_dataset
| 0.991764 |
0908.4094
|
Arya Mazumdar
|
Alexander Barg and Arya Mazumdar
|
Codes in Permutations and Error Correction for Rank Modulation
|
Some typos corrected from the published journal version
|
IEEE Transactions on Information Theory, Vol. 56, Issue 7, July
2010, pp. 3158 - 3165
|
10.1109/TIT.2010.2048455
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Codes for rank modulation have been recently proposed as a means of
protecting flash memory devices from errors. We study basic coding theoretic
problems for such codes, representing them as subsets of the set of
permutations of $n$ elements equipped with the Kendall tau distance. We derive
several lower and upper bounds on the size of codes. These bounds enable us to
establish the exact scaling of the size of optimal codes for large values of
$n$. We also show the existence of codes whose size is within a constant factor
of the sphere packing bound for any fixed number of errors.
|
[
{
"version": "v1",
"created": "Thu, 27 Aug 2009 20:28:16 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2009 03:16:28 GMT"
},
{
"version": "v3",
"created": "Fri, 22 Oct 2010 22:33:52 GMT"
}
] | 2010-12-10T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Mazumdar",
"Arya",
""
]
] |
new_dataset
| 0.986658 |
1012.1912
|
Giacomo Como
|
Giacomo Como and Serdar Y\"uksel
|
On the Capacity of Memoryless Finite-State Multiple-Access Channels with
Asymmetric State Information at the Encoders
|
8 pages, 1 figure, accepted for publication, in press
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A single-letter characterization is provided for the capacity region of
finite-state multiple-access channels, when the channel state process is an
independent and identically distributed sequence, the transmitters have access
to partial (quantized) state information, and complete channel state
information is available at the receiver. The partial channel state information
is assumed to be asymmetric at the encoders. As a main contribution, a tight
converse coding theorem is presented. The difficulties associated with the case
when the channel state has memory are discussed and connections to
decentralized stochastic control theory are presented.
|
[
{
"version": "v1",
"created": "Thu, 9 Dec 2010 02:55:46 GMT"
}
] | 2010-12-10T00:00:00 |
[
[
"Como",
"Giacomo",
""
],
[
"Yüksel",
"Serdar",
""
]
] |
new_dataset
| 0.993678 |
1012.2042
|
George Giannakopoulos
|
George Giannakopoulos (1) and George Vouros (2) and Vangelis
Karkaletsis (1) ((1) NCSR Demokritos, Greece, (2) University of the Aegean,
Greece)
|
MUDOS-NG: Multi-document Summaries Using N-gram Graphs (Tech Report)
|
Technical Report
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report describes the MUDOS-NG summarization system, which applies a set
of language-independent and generic methods for generating extractive
summaries. The proposed methods are mostly combinations of simple operators on
a generic character n-gram graph representation of texts. This work defines the
set of used operators upon n-gram graphs and proposes using these operators
within the multi-document summarization process in such subtasks as document
analysis, salient sentence selection, query expansion and redundancy control.
Furthermore, a novel chunking methodology is used, together with a novel way to
assign concepts to sentences for query expansion. The experimental results of
the summarization system, performed upon widely used corpora from the Document
Understanding and the Text Analysis Conferences, are promising and provide
evidence for the potential of the generic methods introduced. This work aims to
designate core methods exploiting the n-gram graph representation, providing
the basis for more advanced summarization systems.
|
[
{
"version": "v1",
"created": "Thu, 9 Dec 2010 16:15:34 GMT"
}
] | 2010-12-10T00:00:00 |
[
[
"Giannakopoulos",
"George",
""
],
[
"Vouros",
"George",
""
],
[
"Karkaletsis",
"Vangelis",
""
]
] |
new_dataset
| 0.952212 |
1012.1621
|
Adrian Paschke
|
Abdelaali Briache, Kamar Marrakchi, Amine Kerzazi, Ismael
Navas-Delgado, Jose F Aldana Montes, Badr D. Rossi Hassani, Khalid Lairini
|
YeastMed: an XML-Based System for Biological Data Integration of Yeast
|
in Adrian Paschke, Albert Burger, Andrea Splendiani, M. Scott
Marshall, Paolo Romano: Proceedings of the 3rd International Workshop on
Semantic Web Applications and Tools for the Life Sciences, Berlin,Germany,
December 8-10, 2010
| null | null |
SWAT4LS 2010
|
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key goal of bioinformatics is to create database systems and software
platforms capable of storing and analysing large sets of biological data.
Hundreds of biological databases are now available and provide access to huge
amount of biological data. SGD, Yeastract, CYGD-MIPS, BioGrid and PhosphoGrid
are five of the most visited databases by the yeast community. These sources
provide complementary data on biological entities. Biologists are brought
systematically to query these data sources in order to analyse the results of
their experiments. Because of the heterogeneity of these sources, querying them
separately and then manually combining the returned result is a complex and
laborious task. To provide transparent and simultaneous access to these
sources, we have developed a mediator-based system called YeastMed. In this
paper, we present YeastMed focusing on its architecture.
|
[
{
"version": "v1",
"created": "Tue, 7 Dec 2010 21:53:31 GMT"
}
] | 2010-12-09T00:00:00 |
[
[
"Briache",
"Abdelaali",
""
],
[
"Marrakchi",
"Kamar",
""
],
[
"Kerzazi",
"Amine",
""
],
[
"Navas-Delgado",
"Ismael",
""
],
[
"Montes",
"Jose F Aldana",
""
],
[
"Hassani",
"Badr D. Rossi",
""
],
[
"Lairini",
"Khalid",
""
]
] |
new_dataset
| 0.981437 |
1012.1645
|
Adrian Paschke
|
Alexandru Todor, Adrian Paschke, Stephan Heineke
|
ChemCloud: Chemical e-Science Information Cloud
|
in Adrian Paschke, Albert Burger, Andrea Splendiani, M. Scott
Marshall, Paolo Romano: Proceedings of the 3rd International Workshop on
Semantic Web Applications and Tools for the Life Sciences, Berlin,Germany,
December 8-10, 2010
| null | null |
SWAT4LS 2010
|
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our Chemical e-Science Information Cloud (ChemCloud) - a Semantic Web based
eScience infrastructure - integrates and automates a multitude of databases,
tools and services in the domain of chemistry, pharmacy and bio-chemistry
available at the Fachinformationszentrum Chemie (FIZ Chemie), at the Freie
Universitaet Berlin (FUB), and on the public Web. Based on the approach of the
W3C Linked Open Data initiative and the W3C Semantic Web technologies for
ontologies and rules it semantically links and integrates knowledge from our
W3C HCLS knowledge base hosted at the FUB, our multi-domain knowledge base
DBpedia (Deutschland) implemented at FUB, which is extracted from Wikipedia
(De) providing a public semantic resource for chemistry, and our
well-established databases at FIZ Chemie such as ChemInform for organic
reaction data, InfoTherm the leading source for thermophysical data, Chemisches
Zentralblatt, the complete chemistry knowledge from 1830 to 1969, and
ChemgaPedia the largest and most frequented e-Learning platform for Chemistry
and related sciences in German language.
|
[
{
"version": "v1",
"created": "Tue, 7 Dec 2010 23:52:54 GMT"
}
] | 2010-12-09T00:00:00 |
[
[
"Todor",
"Alexandru",
""
],
[
"Paschke",
"Adrian",
""
],
[
"Heineke",
"Stephan",
""
]
] |
new_dataset
| 0.999418 |
1012.1666
|
Adrian Paschke
|
Luke McCarthy, Ben Vandervalk, Mark Wilkinson
|
SPARQL Assist Language-Neutral Query Composer
|
in Adrian Paschke, Albert Burger, Andrea Splendiani, M. Scott
Marshall, Paolo Romano: Proceedings of the 3rd International Workshop on
Semantic Web Applications and Tools for the Life Sciences, Berlin,Germany,
December 8-10, 2010
| null | null |
SWAT4LS 2010
|
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SPARQL query composition is difficult for the lay-person or even the
experienced bioinformatician in cases where the data model is unfamiliar.
Established best-practices and internationalization concerns dictate that
semantic web ontologies should use terms with opaque identifiers, further
complicating the task. We present SPARQL Assist: a web application that
addresses these issues by providing context-sensitive type-ahead completion to
existing web forms. Ontological terms are suggested using their labels and
descriptions, leveraging existing XML support for internationalization and
language-neutrality.
|
[
{
"version": "v1",
"created": "Wed, 8 Dec 2010 01:10:59 GMT"
}
] | 2010-12-09T00:00:00 |
[
[
"McCarthy",
"Luke",
""
],
[
"Vandervalk",
"Ben",
""
],
[
"Wilkinson",
"Mark",
""
]
] |
new_dataset
| 0.989435 |
1012.1332
|
Pierre Guillon
|
Andr\'es Moreira, Anahi Gajardo
|
Time-Symmetric Cellular Automata
|
Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)
| null | null | null |
cs.DM cs.FL nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Together with the concept of reversibility, another relevant physical notion
is time-symmetry, which expresses that there is no way of distinguishing
between backward and forward time directions. This notion, found in physical
theories, has been neglected in the area of discrete dynamical systems. Here we
formalize it in the context of cellular automata and establish some basic facts
and relations. We also state some open problems that may encourage further
research on the topic.
|
[
{
"version": "v1",
"created": "Fri, 3 Dec 2010 09:41:17 GMT"
}
] | 2010-12-08T00:00:00 |
[
[
"Moreira",
"Andrés",
""
],
[
"Gajardo",
"Anahi",
""
]
] |
new_dataset
| 0.994668 |
1012.0375
|
Chengling Jiang
|
Yan Liang, Chengling Jiang, Chunliang Yang
|
Dynamic Resource Coordination and Interference Management for Femtocell
Networks
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Femtocell is emerging as a key technology to secure the coverage and capacity
in indoor environments. However the deployment of a new femtocell layer may
originate undesired interference to the whole system. This paper investigates
spectrum resource coordination and interference management for the femtocell
networks. A resource coordination scheme based on broadcasting resource
coordination request messages by the femto mobile is proposed to reduce the
system interference.
|
[
{
"version": "v1",
"created": "Thu, 2 Dec 2010 03:00:20 GMT"
}
] | 2010-12-03T00:00:00 |
[
[
"Liang",
"Yan",
""
],
[
"Jiang",
"Chengling",
""
],
[
"Yang",
"Chunliang",
""
]
] |
new_dataset
| 0.975317 |
1012.0557
|
Andrey Rumyantsev
|
Andrey Rumyantsev
|
Infinite computable version of Lovasz Local Lemma
| null | null | null | null |
cs.DS cs.DM math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lov\'asz Local Lemma (LLL) is a probabilistic tool that allows us to prove
the existence of combinatorial objects in the cases when standard probabilistic
argument does not work (there are many partly independent conditions).
LLL can be also used to prove the consistency of an infinite set of
conditions, using standard compactness argument (if an infinite set of
conditions is inconsistent, then some finite part of it is inconsistent, too,
which contradicts LLL). In this way we show that objects satisfying all the
conditions do exist (though the probability of this event equals~$0$). However,
if we are interested in finding a computable solution that satisfies all the
constraints, compactness arguments do not work anymore.
Moser and Tardos recently gave a nice constructive proof of LLL. Lance
Fortnow asked whether one can apply Moser--Tardos technique to prove the
existence of a computable solution. We show that this is indeed possible (under
almost the same conditions as used in the non-constructive version).
|
[
{
"version": "v1",
"created": "Thu, 2 Dec 2010 20:11:02 GMT"
}
] | 2010-12-03T00:00:00 |
[
[
"Rumyantsev",
"Andrey",
""
]
] |
new_dataset
| 0.986437 |
1001.3593
|
Samuel Hornus
|
Otfried Cheong (KAIST CS), Hazel Everett (INRIA Lorraine - LORIA),
Marc Glisse (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Joachim
Gudmundsson (NICTA), Samuel Hornus (INRIA Lorraine - LORIA), Sylvain Lazard
(INRIA Lorraine - LORIA), Mira Lee (KAIST CS), Hyeon-Suk Na
|
Farthest-Polygon Voronoi Diagrams
| null |
Computational Geometry (2010)
| null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a family of k disjoint connected polygonal sites in general position
and of total complexity n, we consider the farthest-site Voronoi diagram of
these sites, where the distance to a site is the distance to a closest point on
it. We show that the complexity of this diagram is O(n), and give an O(n log^3
n) time algorithm to compute it. We also prove a number of structural
properties of this diagram. In particular, a Voronoi region may consist of k-1
connected components, but if one component is bounded, then it is equal to the
entire region.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2010 14:09:41 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Nov 2010 21:08:02 GMT"
}
] | 2010-12-02T00:00:00 |
[
[
"Cheong",
"Otfried",
"",
"KAIST CS"
],
[
"Everett",
"Hazel",
"",
"INRIA Lorraine - LORIA"
],
[
"Glisse",
"Marc",
"",
"INRIA Sophia Antipolis / INRIA Saclay - Ile de France"
],
[
"Gudmundsson",
"Joachim",
"",
"NICTA"
],
[
"Hornus",
"Samuel",
"",
"INRIA Lorraine - LORIA"
],
[
"Lazard",
"Sylvain",
"",
"INRIA Lorraine - LORIA"
],
[
"Lee",
"Mira",
"",
"KAIST CS"
],
[
"Na",
"Hyeon-Suk",
""
]
] |
new_dataset
| 0.994151 |
1008.3845
|
Kalyana Babu Nakshatrala
|
S. Srinivasan and K. B. Nakshatrala
|
A stabilized mixed formulation for unsteady Brinkman equation based on
the method of horizontal lines
| null | null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a stabilized mixed formulation for unsteady
Brinkman equation. The formulation is systematically derived based on the
variational multiscale formalism and the method of horizontal lines. The
derivation does not need the assumption that the fine-scale variables do not
depend on the time, which is the case with the conventional derivation of
multiscale stabilized formulations for transient mixed problems. An expression
for the stabilization parameter is obtained in terms of a bubble function, and
appropriate bubble functions for various finite elements are also presented.
Under the proposed formulation, equal-order interpolation for the velocity and
pressure (which is computationally the most convenient) is stable.
Representative numerical results are presented to illustrate the performance of
the proposed formulation. Spatial and temporal convergence studies are also
performed, and the proposed formulation performed well.
|
[
{
"version": "v1",
"created": "Thu, 15 Jul 2010 21:47:04 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Nov 2010 06:18:59 GMT"
}
] | 2010-12-01T00:00:00 |
[
[
"Srinivasan",
"S.",
""
],
[
"Nakshatrala",
"K. B.",
""
]
] |
new_dataset
| 0.971256 |
1011.6021
|
Prabhanjan Ananth
|
Prabhanjan V. Ananth, Ambedkar Dukkipati
|
Border basis detection is NP-complete
|
18 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Border basis detection (BBD) is described as follows: given a set of
generators of an ideal, decide whether that set of generators is a border basis
of the ideal with respect to some order ideal. The motivation for this problem
comes from a similar problem related to Gr\"obner bases termed as Gr\"obner
basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD
was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we
investigate the computational complexity of BBD and show that it is
NP-complete.
|
[
{
"version": "v1",
"created": "Sun, 28 Nov 2010 08:22:42 GMT"
}
] | 2010-11-30T00:00:00 |
[
[
"Ananth",
"Prabhanjan V.",
""
],
[
"Dukkipati",
"Ambedkar",
""
]
] |
new_dataset
| 0.992822 |
1011.6044
|
Lahatra Rakotondrainibe
|
Lahatra Rakotondrainibe (IETR), Yvan Kokar (IETR), Gheorghe Zaharia
(IETR), Guy Grunfelder (IETR), Gha\"is El Zein (IETR)
|
Single Carrier Architecture for High Data Rate Wireless PAN
Communications System
|
Design, Experimentation, Measurement, Performance; IWCMC '10, Caen :
France (2010)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A 60 GHz wireless Gigabit Ethernet (G.E.) communication system is developed
at IETR. As the 60 GHz radio link operates only in a single-room configuration,
an additional Radio over Fibre (RoF) link is used to ensure the communications
in all the rooms of a residential environment. The realized system covers 2 GHz
bandwidth. Due to the hardware constraints, a symbol rate at 875 Mbps is
attained using simple single carrier architecture. In the baseband (BB)
processing block, an original byte/frame synchronization process is designed to
provide a smaller value of the preamble missing detection and false alarm
probabilities. Bit error rate (BER) measurements have been realized in a large
gym for line-of-sight (LOS) conditions. A Tx-Rx distance greater than 30 meters
was attained with low BER using high gain antennas and forward error correction
RS (255, 239) coding.
|
[
{
"version": "v1",
"created": "Sun, 28 Nov 2010 13:11:52 GMT"
}
] | 2010-11-30T00:00:00 |
[
[
"Rakotondrainibe",
"Lahatra",
"",
"IETR"
],
[
"Kokar",
"Yvan",
"",
"IETR"
],
[
"Zaharia",
"Gheorghe",
"",
"IETR"
],
[
"Grunfelder",
"Guy",
"",
"IETR"
],
[
"Zein",
"Ghaïs El",
"",
"IETR"
]
] |
new_dataset
| 0.958948 |
1011.6100
|
Grigory Yaroslavtsev
|
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya
Raskhodnikova, David Woodruff, Grigory Yaroslavtsev
|
Steiner Transitive-Closure Spanners of d-Dimensional Posets
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a directed graph G and an integer k >= 1, a
k-transitive-closure-spanner (k-TCspanner) of G is a directed graph H that has
(1) the same transitive-closure as G and (2) diameter at most k. In some
applications, the shortcut paths added to the graph in order to obtain small
diameter can use Steiner vertices, that is, vertices not in the original graph
G. The resulting spanner is called a Steiner transitive-closure spanner
(Steiner TC-spanner).
Motivated by applications to property reconstruction and access control
hierarchies, we concentrate on Steiner TC-spanners of directed acyclic graphs
or, equivalently, partially ordered sets. In these applications, the goal is to
find a sparsest Steiner k-TC-spanner of a poset G for a given k and G. The
focus of this paper is the relationship between the dimension of a poset and
the size of its sparsest Steiner TCspanner. The dimension of a poset G is the
smallest d such that G can be embedded into a d-dimensional directed hypergrid
via an order-preserving embedding.
We present a nearly tight lower bound on the size of Steiner 2-TC-spanners of
d-dimensional directed hypergrids. It implies better lower bounds on the
complexity of local reconstructors of monotone functions and functions with low
Lipschitz constant. The proof of the lower bound constructs a dual solution to
a linear programming relaxation of the Steiner 2-TC-spanner problem. We also
show that one can efficiently construct a Steiner 2-TC-spanner, of size
matching the lower bound, for any low-dimensional poset. Finally, we present a
lower bound on the size of Steiner k-TC-spanners of d-dimensional posets that
shows that the best-known construction, due to De Santis et al., cannot be
improved significantly.
|
[
{
"version": "v1",
"created": "Sun, 28 Nov 2010 22:40:46 GMT"
}
] | 2010-11-30T00:00:00 |
[
[
"Berman",
"Piotr",
""
],
[
"Bhattacharyya",
"Arnab",
""
],
[
"Grigorescu",
"Elena",
""
],
[
"Raskhodnikova",
"Sofya",
""
],
[
"Woodruff",
"David",
""
],
[
"Yaroslavtsev",
"Grigory",
""
]
] |
new_dataset
| 0.974347 |
1011.6218
|
Chan Thai
|
Chan Dai Truyen Thai, Petar Popovski, Megumi Kaneko and Elisabeth de
Carvalho
|
Coordinated Transmissions to Direct and Relayed Users in Wireless
Cellular Systems
|
5 pages, 5 figures
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ideas of wireless network coding at the physical layer promise high
throughput gains in wireless systems with relays and multi-way traffic flows.
This gain can be ascribed to two principles: (1) joint transmission of multiple
communication flows and (2) usage of \emph{a priori} information to cancel the
interference. In this paper we use these principles to devise new transmission
schemes in wireless cellular systems that feature both users served directly by
the base stations (direct users) and users served through relays (relayed
users). We present four different schemes for \emph{coordinated transmission}
of uplink and downlink traffic in which one direct and one relayed user are
served. These schemes are then used as building blocks in multi-user scenarios,
where we present several schemes for scheduling pairs of users for coordinated
transmissions. The optimal scheme involves exhaustive search of the best user
pair in terms of overall rate. We propose several suboptimal scheduling
schemes, which perform closely to the optimal scheme. The numerical results
show a substantial increase in the system--level rate with respect to the
systems with non--coordinated transmissions.
|
[
{
"version": "v1",
"created": "Mon, 29 Nov 2010 12:51:07 GMT"
}
] | 2010-11-30T00:00:00 |
[
[
"Thai",
"Chan Dai Truyen",
""
],
[
"Popovski",
"Petar",
""
],
[
"Kaneko",
"Megumi",
""
],
[
"de Carvalho",
"Elisabeth",
""
]
] |
new_dataset
| 0.980206 |
1011.5778
|
Tobias Marschall
|
Tobias Marschall and Inke Herms and Hans-Michael Kaltenbach and Sven
Rahmann
|
Probabilistic Arithmetic Automata and their Applications
| null | null | null | null |
cs.FL q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present probabilistic arithmetic automata (PAAs), a general model to
describe chains of operations whose operands depend on chance, along with two
different algorithms to exactly calculate the distribution of the results
obtained by such probabilistic calculations. PAAs provide a unifying framework
to approach many problems arising in computational biology and elsewhere. Here,
we present five different applications, namely (1) pattern matching statistics
on random texts, including the computation of the distribution of occurrence
counts, waiting time and clump size under HMM background models; (2) exact
analysis of window-based pattern matching algorithms; (3) sensitivity of
filtration seeds used to detect candidate sequence alignments; (4) length and
mass statistics of peptide fragments resulting from enzymatic cleavage
reactions; and (5) read length statistics of 454 sequencing reads. The
diversity of these applications indicates the flexibility and unifying
character of the presented framework.
While the construction of a PAA depends on the particular application, we
single out a frequently applicable construction method for pattern statistics:
We introduce deterministic arithmetic automata (DAAs) to model deterministic
calculations on sequences, and demonstrate how to construct a PAA from a given
DAA and a finite-memory random text model. We show how to transform a finite
automaton into a DAA and then into the corresponding PAA.
|
[
{
"version": "v1",
"created": "Fri, 26 Nov 2010 13:13:08 GMT"
}
] | 2010-11-29T00:00:00 |
[
[
"Marschall",
"Tobias",
""
],
[
"Herms",
"Inke",
""
],
[
"Kaltenbach",
"Hans-Michael",
""
],
[
"Rahmann",
"Sven",
""
]
] |
new_dataset
| 0.996473 |
1011.5332
|
Jan Wielemaker
|
Jan Wielemaker and Tom Schrijvers and Markus Triska and Torbj\"orn
Lager
|
SWI-Prolog
|
30 pages, 6 figures, 1 table. To appear in Theory and Practice of
Logic Programming (TPLP)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SWI-Prolog is neither a commercial Prolog system nor a purely academic
enterprise, but increasingly a community project. The core system has been
shaped to its current form while being used as a tool for building research
prototypes, primarily for \textit{knowledge-intensive} and \textit{interactive}
systems. Community contributions have added several interfaces and the
constraint (CLP) libraries. Commercial involvement has created the initial
garbage collector, added several interfaces and two development tools: PlDoc (a
literate programming documentation system) and PlUnit (a unit testing
environment).
In this article we present SWI-Prolog as an integrating tool, supporting a
wide range of ideas developed in the Prolog community and acting as glue
between \textit{foreign} resources. This article itself is the glue between
technical articles on SWI-Prolog, providing context and experience in applying
them over a longer period.
|
[
{
"version": "v1",
"created": "Wed, 24 Nov 2010 10:28:56 GMT"
}
] | 2010-11-26T00:00:00 |
[
[
"Wielemaker",
"Jan",
""
],
[
"Schrijvers",
"Tom",
""
],
[
"Triska",
"Markus",
""
],
[
"Lager",
"Torbjörn",
""
]
] |
new_dataset
| 0.99957 |
1011.5264
|
Piero Giacomelli Dr.
|
Piero Giacomelli
|
Wheel Random Apollonian Graphs
| null | null | null | null |
cs.DM cond-mat.dis-nn math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a subset of High-Dimensional Random Apollonian networks, that
we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to
generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some
basic graph properties like vertices and edges cardinality, some question
concerning cycles and the chromaticity in such type of graphs, we suggest
further work on this type of graphs.
|
[
{
"version": "v1",
"created": "Sat, 20 Nov 2010 07:46:17 GMT"
}
] | 2010-11-25T00:00:00 |
[
[
"Giacomelli",
"Piero",
""
]
] |
new_dataset
| 0.999199 |
1011.5295
|
Karim Eldefrawy
|
Karim El Defrawy, Srdjan Capkun and Gene Tsudik
|
GDB: Group Distance Bounding Protocols
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secure distance bounding (DB) protocols allow one entity, the verifier, to
securely obtain an upper-bound on the distance to another entity, the prover.
Thus far, DB was considered mostly in the context of a single prover and a
single verifier. There has been no substantial prior work on secure DB in group
settings, where a set of provers interact with a set of verifiers. The need for
group distance bounding (GDB) is motivated by many practical scenarios,
including: group device pairing, location-based access control and secure
distributed localization. GDB is also useful in mission-critical networks and
automotive computer systems. This paper addresses, for the first time, GDB
protocols by utilizing the new passive DB primitive and the novel mutual
multi-party GDB protocol. We show how they can be used to construct secure and
efficient GDB protocols for various settings. We analyze security and
performance of our protocols and compare them with existing DB techniques when
applied to group settings.
|
[
{
"version": "v1",
"created": "Wed, 24 Nov 2010 05:05:14 GMT"
}
] | 2010-11-25T00:00:00 |
[
[
"Defrawy",
"Karim El",
""
],
[
"Capkun",
"Srdjan",
""
],
[
"Tsudik",
"Gene",
""
]
] |
new_dataset
| 0.982981 |
1011.5374
|
Maddu Kamaraju
|
M. Kamaraju, A.V.N. Tilak, K.Lal Kishore, K.Baburao
|
VHDL Implementation and Verification of ARINC-429 Core
|
7 pages,15 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern Avionics are controlled by sophisticated mission components in the
Aircraft. The control function is implemented via a standard ARINC-429 bus
interface. It is a two-wire point-topoint serial data bus for control
communications in Avionics. The bus operates 12.5 or 100kb/sec, the
implementation is envisaged for one transmits and receive channel respectively.
Further the code can be modified for more no of independent Tx and Rx channels.
An on chip memory allotment on the FPGA will provide a buffer bank for storing
the incoming or outgoing data. For this purpose SRAM based FPGAs are utilized.
This flexible ARINC429 solution gives exactly what is needed for real time
applications. The IP can be programmed to send an interrupt to the host and
also prepare it to process the data. Majority of the hardware function of
digital natures are embedded into a single FPGA by saving in terms of PCB board
space, power consumption and volume results. This paper deals with the
development, implementation, simulation, and verification of ARINC_429 formats.
The IP core development is described in VHDL.
|
[
{
"version": "v1",
"created": "Wed, 24 Nov 2010 14:02:30 GMT"
}
] | 2010-11-25T00:00:00 |
[
[
"Kamaraju",
"M.",
""
],
[
"Tilak",
"A. V. N.",
""
],
[
"Kishore",
"K. Lal",
""
],
[
"Baburao",
"K.",
""
]
] |
new_dataset
| 0.971962 |
0801.2838
|
Avraham Trahtman N
|
A.N. Trahtman
|
An Algorithm for Road Coloring
|
10 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A coloring of edges of a finite directed graph turns the graph into
finite-state automaton. The synchronizing word of a deterministic automaton is
a word in the alphabet of colors (considered as letters) of its edges that maps
the automaton to a single state. A coloring of edges of a directed graph of
uniform outdegree (constant outdegree of any vertex) is synchronizing if the
coloring turns the graph into a deterministic finite automaton possessing a
synchronizing word. The road coloring problem is the problem of synchronizing
coloring of a directed finite strongly connected graph of uniform outdegree if
the greatest common divisor of the lengths of all its cycles is one. The
problem posed in 1970 had evoked a noticeable interest among the specialists in
the theory of graphs, automata, codes, symbolic dynamics as well as among the
wide mathematical community. A polynomial time algorithm of $O(n^3)$ complexity
in the most worst case and quadratic in majority of studied cases for the road
coloring of the considered graph is presented below. The work is based on
recent positive solution of the road coloring problem. The algorithm was
implemented in the package TESTAS
|
[
{
"version": "v1",
"created": "Fri, 18 Jan 2008 09:22:46 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Nov 2009 06:11:35 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Nov 2010 11:06:54 GMT"
}
] | 2010-11-24T00:00:00 |
[
[
"Trahtman",
"A. N.",
""
]
] |
new_dataset
| 0.970681 |
1011.5065
|
Woohyuk Chang
|
Woohyuk Chang, Sae-Young Chung, Yong H. Lee
|
Gaussian Relay Channel Capacity to Within a Fixed Number of Bits
|
6 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we show that the capacity of the three-node Gaussian relay
channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward
and amplify-and-forward relaying, respectively.
|
[
{
"version": "v1",
"created": "Tue, 23 Nov 2010 11:27:46 GMT"
}
] | 2010-11-24T00:00:00 |
[
[
"Chang",
"Woohyuk",
""
],
[
"Chung",
"Sae-Young",
""
],
[
"Lee",
"Yong H.",
""
]
] |
new_dataset
| 0.971836 |
1011.5072
|
Muhammad Asim
|
Muhammad Asim, Hala Mokhtar, Madjid Merabti
|
A self-managing fault management mechanism for wireless sensor networks
|
14 pages, 5 figures, Journal
|
International Journal of Wireless & Mobile Networks (IJWMN) Vol.2,
No.4, November 2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sensor network can be described as a collection of sensor nodes which
co-ordinate with each other to perform some specific function. These sensor
nodes are mainly in large numbers and are densely deployed either inside the
phenomenon or very close to it. They can be used for various application areas
(e.g. health, military, home). Failures are inevitable in wireless sensor
networks due to inhospitable environment and unattended deployment. Therefore,
it is necessary that network failures are detected in advance and appropriate
measures are taken to sustain network operation. We previously proposed a
cellular approach for fault detection and recovery. In this paper we extend the
cellular approach and propose a new fault management mechanism to deal with
fault detection and recovery. We propose a hierarchical structure to properly
distribute fault management tasks among sensor nodes by introducing more
'self-managing' functions. The proposed failure detection and recovery
algorithm has been compared with some existing related work and proven to be
more energy efficient.
|
[
{
"version": "v1",
"created": "Tue, 23 Nov 2010 12:05:57 GMT"
}
] | 2010-11-24T00:00:00 |
[
[
"Asim",
"Muhammad",
""
],
[
"Mokhtar",
"Hala",
""
],
[
"Merabti",
"Madjid",
""
]
] |
new_dataset
| 0.951839 |
1011.5164
|
Emilio Ferrara
|
Emilio Ferrara, Giacomo Fiumara, Francesco Pagano
|
Living City, a Collaborative Browser-based Massively Multiplayer Online
Game
|
8 pages, 6 figures; SIMUTools '10: Proceedings of the 3rd
International ICST Conference on Simulation Tools and Techniques
|
Proceedings of the 3rd International ICST Conference on Simulation
Tools and Techniques (SIMUTools '10), 2010
|
10.4108/ICST.SIMUTOOLS2010.8730
| null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents the design and implementation of our Browser-based
Massively Multiplayer Online Game, Living City, a simulation game fully
developed at the University of Messina. Living City is a persistent and
real-time digital world, running in the Web browser environment and accessible
from users without any client-side installation. Today Massively Multiplayer
Online Games attract the attention of Computer Scientists both for their
architectural peculiarity and the close interconnection with the social network
phenomenon. We will cover these two aspects paying particular attention to some
aspects of the project: game balancing (e.g. algorithms behind time and money
balancing); business logic (e.g., handling concurrency, cheating avoidance and
availability) and, finally, social and psychological aspects involved in the
collaboration of players, analyzing their activities and interconnections.
|
[
{
"version": "v1",
"created": "Tue, 23 Nov 2010 16:59:55 GMT"
}
] | 2010-11-24T00:00:00 |
[
[
"Ferrara",
"Emilio",
""
],
[
"Fiumara",
"Giacomo",
""
],
[
"Pagano",
"Francesco",
""
]
] |
new_dataset
| 0.999064 |
0901.4466
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Physarum boats: If plasmodium sailed it would never leave a port
| null |
Applied Bionics and Biomechanics, Volume 7, Issue 1 March 2010 ,
pages 31 - 39
|
10.1080/11762320902863890
| null |
cs.RO q-bio.CB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Plasmodium of \emph{Physarum polycephalum} is a single huge (visible by naked
eye) cell with myriad of nuclei. The plasmodium is a promising substrate for
non-classical, nature-inspired, computing devices. It is capable for
approximation of shortest path, computation of planar proximity graphs and
plane tessellations, primitive memory and decision-making. The unique
properties of the plasmodium make it an ideal candidate for a role of amorphous
biological robots with massive parallel information processing and distributed
inputs and outputs. We show that when adhered to light-weight object resting on
a water surface the plasmodium can propel the object by oscillating its
protoplasmic pseudopodia. In experimental laboratory conditions and
computational experiments we study phenomenology of the plasmodium-floater
system, and possible mechanisms of controlling motion of objects propelled by
on board plasmodium.
|
[
{
"version": "v1",
"created": "Wed, 28 Jan 2009 14:12:32 GMT"
}
] | 2010-11-23T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999716 |
0911.5508
|
G David Forney Jr.
|
G. David Forney Jr
|
Codes on graphs: Duality and MacWilliams identities
|
30 pages, 20 figures. Accepted for IEEE Transactions on Information
Theory. Preliminary versions presented at IEEE Information Theory Workshop,
Taormina, Italy, October 2009 and 2010 IEEE International Symposium on
Information Theory, Austin, TX, June 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A conceptual framework involving partition functions of normal factor graphs
is introduced, paralleling a similar recent development by Al-Bashabsheh and
Mao. The partition functions of dual normal factor graphs are shown to be a
Fourier transform pair, whether or not the graphs have cycles. The original
normal graph duality theorem follows as a corollary. Within this framework,
MacWilliams identities are found for various local and global weight generating
functions of general group or linear codes on graphs; this generalizes and
provides a concise proof of the MacWilliams identity for linear time-invariant
convolutional codes that was recently found by Gluesing-Luerssen and Schneider.
Further MacWilliams identities are developed for terminated convolutional
codes, particularly for tail-biting codes, similar to those studied recently by
Bocharova, Hug, Johannesson and Kudryashov.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2009 19:03:01 GMT"
},
{
"version": "v2",
"created": "Mon, 10 May 2010 18:10:58 GMT"
},
{
"version": "v3",
"created": "Sun, 1 Aug 2010 20:47:56 GMT"
},
{
"version": "v4",
"created": "Sat, 20 Nov 2010 16:53:47 GMT"
}
] | 2010-11-23T00:00:00 |
[
[
"Forney",
"G. David",
"Jr"
]
] |
new_dataset
| 0.9998 |
1011.4580
|
AbdelRahman Karawia Dr.
|
A.A. Karawia
|
A New Algorithm for General Cyclic Heptadiagonal Linear Systems Using
Sherman-Morrison-Woodbury formula
|
8 pages
| null | null | null |
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new efficient computational algorithm is presented for
solving cyclic heptadiagonal linear systems based on using of heptadiagonal
linear solver and Sherman-Morrison-Woodbury formula. The implementation of the
algorithm using computer algebra systems (CAS) such as MAPLE and MATLAB is
straightforward. Numerical example is presented for the sake of illustration.
|
[
{
"version": "v1",
"created": "Sat, 20 Nov 2010 12:37:45 GMT"
}
] | 2010-11-23T00:00:00 |
[
[
"Karawia",
"A. A.",
""
]
] |
new_dataset
| 0.975338 |
1011.4602
|
Elena Veronica Belmega
|
E. V. Belmega, B. Djeumou, and S. Lasaulce
|
Gaussian Broadcast Channels with an Orthogonal and Bidirectional
Cooperation Link
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a system where one transmitter broadcasts a single
common message to two receivers linked by a bidirectional cooperation channel,
which is assumed to be orthogonal to the downlink channel. Assuming a
simplified setup where, in particular, scalar relaying protocols are used and
channel coding is not exploited, we want to provide elements of response to
several questions of practical interest. Here are the main underlying issues:
1. The way of recombining the signals at the receivers; 2. The optimal number
of cooperation rounds; 3. The way of cooperating (symmetrically or
asymmetrically; which receiver should start cooperating in the latter case); 4.
The influence of spectral resources. These issues are considered by studying
the performance of the assumed system through analytical results when they are
derivable and through simulation results. For the particular choices we made,
the results sometimes do not coincide with those available for the discrete
counterpart of the studied channel.
|
[
{
"version": "v1",
"created": "Sat, 20 Nov 2010 19:31:37 GMT"
}
] | 2010-11-23T00:00:00 |
[
[
"Belmega",
"E. V.",
""
],
[
"Djeumou",
"B.",
""
],
[
"Lasaulce",
"S.",
""
]
] |
new_dataset
| 0.988293 |
1010.4207
|
Francis Bach
|
Francis Bach (INRIA Rocquencourt, LIENS)
|
Convex Analysis and Optimization with Submodular Functions: a Tutorial
| null | null | null | null |
cs.LG math.OC stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Set-functions appear in many areas of computer science and applied
mathematics, such as machine learning, computer vision, operations research or
electrical networks. Among these set-functions, submodular functions play an
important role, similar to convex functions on vector spaces. In this tutorial,
the theory of submodular functions is presented, in a self-contained way, with
all results shown from first principles. A good knowledge of convex analysis is
assumed.
|
[
{
"version": "v1",
"created": "Wed, 20 Oct 2010 14:02:21 GMT"
},
{
"version": "v2",
"created": "Sun, 14 Nov 2010 17:19:42 GMT"
}
] | 2010-11-17T00:00:00 |
[
[
"Bach",
"Francis",
"",
"INRIA Rocquencourt, LIENS"
]
] |
new_dataset
| 0.973884 |
1011.2834
|
Morgan Barbier
|
Morgan Barbier (LIX)
|
New Set of Codes for the Maximum-Likelihood Decoding Problem
|
in Yet Another Conference on Cryptography, Porquerolle : France
(2010)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The maximum-likelihood decoding problem is known to be NP-hard for general
linear and Reed-Solomon codes. In this paper, we introduce the notion of
A-covered codes, that is, codes that can be decoded through a polynomial time
algorithm A whose decoding bound is beyond the covering radius. For these
codes, we show that the maximum-likelihood decoding problem is reachable in
polynomial time in the code parameters. Focusing on bi- nary BCH codes, we were
able to find several examples of A-covered codes, including two codes for which
the maximum-likelihood decoding problem can be solved in quasi-quadratic time.
|
[
{
"version": "v1",
"created": "Fri, 12 Nov 2010 05:55:00 GMT"
}
] | 2010-11-17T00:00:00 |
[
[
"Barbier",
"Morgan",
"",
"LIX"
]
] |
new_dataset
| 0.992014 |
1011.3708
|
Stefano Bilotta
|
Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi
|
Catalan structures and Catalan pairs
|
14 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms.
These objects are enumerated by the well-known Catalan numbers, and have been
introduced with the aim of giving a common language to most of the structures
counted by Catalan numbers. Here, we give a simple method to pass from the
recursive definition of a generic Catalan structure to the recursive definition
of the Catalan pair on the same structure, thus giving an automatic way to
interpret Catalan structures in terms of Catalan pairs. We apply our method to
many well-known Catalan structures, focusing on the meaning of the relations S
and R in each considered case.
|
[
{
"version": "v1",
"created": "Tue, 16 Nov 2010 14:42:05 GMT"
}
] | 2010-11-17T00:00:00 |
[
[
"Bilotta",
"Stefano",
""
],
[
"Disanto",
"Filippo",
""
],
[
"Pinzani",
"Renzo",
""
],
[
"Rinaldi",
"Simone",
""
]
] |
new_dataset
| 0.99966 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.