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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cs/0504094 | Amit K Awasthi | Amit K Awasthi | A New Remote User Authentication Scheme Using Smart Cards with Check
Digits | 3 Pages. Not Published | null | null | null | cs.CR | null | Since 1981, when Lamport introduced the remote user authentication scheme
using table, a plenty of schemes had been proposed with table and without table
using. In 1993, Chang and Wu [5] introduced Remote password authentication
scheme with smart cards. A number of remote authentication schemes with smart
cards have been proposed since then. These schemes allow a valid user to login
a remote server and access the services provided by the remote server. But
still there is no scheme to authenticate the remote proxy user. In this paper
we propose firstly, a protocol to authenticate a proxy user remotely using
smartcards.
| [
{
"version": "v1",
"created": "Sat, 23 Apr 2005 22:47:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Awasthi",
"Amit K",
""
]
]
| new_dataset | 0.999667 |
cs/0504106 | Thomas C. Schmidt | Hans L. Cycon, Thomas C. Schmidt, Matthias Waehlisch, Mark Palkow and
Henrik Regensburg | A Distributed Multimedia Communication System and its Applications to
E-Learning | Including 6 figures | IEEE International Symposium on Consumer Electronics, Sept. 1-3,
2004, Page(s):425 - 429 | null | null | cs.MM cs.NI | null | In this paper we report on a multimedia communication system including a
VCoIP (Video Conferencing over IP) software with a distributed architecture and
its applications for teaching scenarios. It is a simple, ready-to-use scheme
for distributed presenting, recording and streaming multimedia content. We also
introduce and investigate concepts and experiments to IPv6 user and session
mobility, with the special focus on real-time video group communication.
| [
{
"version": "v1",
"created": "Thu, 28 Apr 2005 13:40:09 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cycon",
"Hans L.",
""
],
[
"Schmidt",
"Thomas C.",
""
],
[
"Waehlisch",
"Matthias",
""
],
[
"Palkow",
"Mark",
""
],
[
"Regensburg",
"Henrik",
""
]
]
| new_dataset | 0.997422 |
cs/0505014 | Haibin Wang | Haibin Wang, Florentin Smarandache, Yan-Qing Zhang, Rajshekhar
Sunderraman | Interval Neutrosophic Sets and Logic: Theory and Applications in
Computing | 12 figures, 100 pages, book in press | null | null | null | cs.LO | null | This book presents the advancements and applications of neutrosophics.
Chapter 1 first introduces the interval neutrosophic sets which is an instance
of neutrosophic sets. In this chapter, the definition of interval neutrosophic
sets and set-theoretic operators are given and various properties of interval
neutrosophic set are proved. Chapter 2 defines the interval neutrosophic logic
based on interval neutrosophic sets including the syntax and semantics of first
order interval neutrosophic propositional logic and first order interval
neutrosophic predicate logic. The interval neutrosophic logic can reason and
model fuzzy, incomplete and inconsistent information. In this chapter, we also
design an interval neutrosophic inference system based on first order interval
neutrosophic predicate logic. The interval neutrosophic inference system can be
applied to decision making. Chapter 3 gives one application of interval
neutrosophic sets and logic in the field of relational databases. Neutrosophic
data model is the generalization of fuzzy data model and paraconsistent data
model. Here, we generalize various set-theoretic and relation-theoretic
operations of fuzzy data model to neutrosophic data model. Chapter 4 gives
another application of interval neutrosophic logic. A soft semantic Web
Services agent framework is proposed to faciliate the registration and
discovery of high quality semantic Web Services agent. The intelligent
inference engine module of soft Semantic Web Services agent is implemented
using interval neutrosophic logic.
| [
{
"version": "v1",
"created": "Fri, 6 May 2005 13:57:13 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wang",
"Haibin",
""
],
[
"Smarandache",
"Florentin",
""
],
[
"Zhang",
"Yan-Qing",
""
],
[
"Sunderraman",
"Rajshekhar",
""
]
]
| new_dataset | 0.998789 |
cs/0505047 | David Wood | David R. Wood | A Simple Proof of the F{\'a}ry-Wagner Theorem | 2 pages | null | null | null | cs.CG | null | We give a simple proof of the following fundamental result independently due
to Fary (1948) and Wagner (1936): Every plane graph has a drawing in which
every edge is straight.
| [
{
"version": "v1",
"created": "Wed, 18 May 2005 11:27:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wood",
"David R.",
""
]
]
| new_dataset | 0.998804 |
cs/0505050 | Manuel Arturo Izquierdo | Manuel Arturo Izquierdo | The QDF file format: an electronic system to describe ancient andean
khipus | LaTeX text, 12 pages | null | null | null | cs.CY | null | With the goal of bringing to reseachers of the ancient andean khipus with a
tool to share and process electronically the current corpus of these ancient
information devices, I present on this paper a proposal for a Quipu Description
Format (QDF), a XML based file format designed to describe such documents in a
systematic and computer standard way.
| [
{
"version": "v1",
"created": "Thu, 19 May 2005 22:42:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Izquierdo",
"Manuel Arturo",
""
]
]
| new_dataset | 0.999638 |
cs/0505061 | Dragos Trinca | Dragos Trinca | EAH: A New Encoder based on Adaptive Variable-length Codes | 16 pages | null | null | null | cs.DS | null | Adaptive variable-length codes associate a variable-length codeword to the
symbol being encoded depending on the previous symbols in the input string.
This class of codes has been recently presented in [Dragos Trinca,
arXiv:cs.DS/0505007] as a new class of non-standard variable-length codes. New
algorithms for data compression, based on adaptive variable-length codes of
order one and Huffman's algorithm, have been recently presented in [Dragos
Trinca, ITCC 2004]. In this paper, we extend the work done so far by the
following contributions: first, we propose an improved generalization of these
algorithms, called EAHn. Second, we compute the entropy bounds for EAHn, using
the well-known bounds for Huffman's algorithm. Third, we discuss implementation
details and give reports of experimental results obtained on some well-known
corpora. Finally, we describe a parallel version of EAHn using the PRAM model
of computation.
| [
{
"version": "v1",
"created": "Tue, 24 May 2005 06:53:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Trinca",
"Dragos",
""
]
]
| new_dataset | 0.999413 |
cs/0505062 | Ashutosh Saxena PhD Comp. Science | Ravi S. Veerubhotla, Ashutosh Saxena, V.P. Gulati, A.K. Pujari | Gossip Codes for Fingerprinting: Construction, Erasure Analysis and
Pirate Tracing | 28 pages | Journal of Universal Computer Science, vol. 11, no. 1 (2005),
122-149 | null | null | cs.CR | null | This work presents two new construction techniques for q-ary Gossip codes
from tdesigns and Traceability schemes. These Gossip codes achieve the shortest
code length specified in terms of code parameters and can withstand erasures in
digital fingerprinting applications. This work presents the construction of
embedded Gossip codes for extending an existing Gossip code into a bigger code.
It discusses the construction of concatenated codes and realisation of erasure
model through concatenated codes.
| [
{
"version": "v1",
"created": "Tue, 24 May 2005 13:44:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Veerubhotla",
"Ravi S.",
""
],
[
"Saxena",
"Ashutosh",
""
],
[
"Gulati",
"V. P.",
""
],
[
"Pujari",
"A. K.",
""
]
]
| new_dataset | 0.999234 |
cs/0505070 | Xiao-feng Xie | Xiao-Feng Xie, Wen-Jun Zhang | SWAF: Swarm Algorithm Framework for Numerical Optimization | Genetic and Evolutionary Computation Conference (GECCO), Part I,
2004: 238-250 (LNCS 3102) | null | null | null | cs.NE | null | A swarm algorithm framework (SWAF), realized by agent-based modeling, is
presented to solve numerical optimization problems. Each agent is a bare bones
cognitive architecture, which learns knowledge by appropriately deploying a set
of simple rules in fast and frugal heuristics. Two essential categories of
rules, the generate-and-test and the problem-formulation rules, are
implemented, and both of the macro rules by simple combination and subsymbolic
deploying of multiple rules among them are also studied. Experimental results
on benchmark problems are presented, and performance comparison between SWAF
and other existing algorithms indicates that it is efficiently.
| [
{
"version": "v1",
"created": "Wed, 25 May 2005 01:39:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Xie",
"Xiao-Feng",
""
],
[
"Zhang",
"Wen-Jun",
""
]
]
| new_dataset | 0.998525 |
cs/0505084 | Valentin Brimkov | Valentin Brimkov, Angelo Maimone, Giorgio Nordo | An explicit formula for the number of tunnels in digital objects | 9 pages, 4 figures | null | null | null | cs.DM cs.CG cs.CV | null | An important concept in digital geometry for computer imagery is that of
tunnel. In this paper we obtain a formula for the number of tunnels as a
function of the number of the object vertices, pixels, holes, connected
components, and 2x2 grid squares. It can be used to test for tunnel-freedom a
digital object, in particular a digital curve.
| [
{
"version": "v1",
"created": "Tue, 31 May 2005 00:44:16 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Sep 2005 23:28:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Brimkov",
"Valentin",
""
],
[
"Maimone",
"Angelo",
""
],
[
"Nordo",
"Giorgio",
""
]
]
| new_dataset | 0.996903 |
cs/0506004 | Vladimir Vovk | Vladimir Vovk | Non-asymptotic calibration and resolution | 20 pages | null | null | null | cs.LG | null | We analyze a new algorithm for probability forecasting of binary observations
on the basis of the available data, without making any assumptions about the
way the observations are generated. The algorithm is shown to be well
calibrated and to have good resolution for long enough sequences of
observations and for a suitable choice of its parameter, a kernel on the
Cartesian product of the forecast space $[0,1]$ and the data space. Our main
results are non-asymptotic: we establish explicit inequalities, shown to be
tight, for the performance of the algorithm.
| [
{
"version": "v1",
"created": "Wed, 1 Jun 2005 14:03:20 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jul 2005 16:15:54 GMT"
},
{
"version": "v3",
"created": "Sun, 21 Aug 2005 19:55:55 GMT"
},
{
"version": "v4",
"created": "Sat, 1 Jul 2006 13:46:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vovk",
"Vladimir",
""
]
]
| new_dataset | 0.993248 |
cs/0506008 | Felix Klaedtke | Felix Klaedtke | Bounds on the Automata Size for Presburger Arithmetic | null | null | null | null | cs.LO | null | Automata provide a decision procedure for Presburger arithmetic. However,
until now only crude lower and upper bounds were known on the sizes of the
automata produced by this approach. In this paper, we prove an upper bound on
the the number of states of the minimal deterministic automaton for a
Presburger arithmetic formula. This bound depends on the length of the formula
and the quantifiers occurring in the formula. The upper bound is established by
comparing the automata for Presburger arithmetic formulas with the formulas
produced by a quantifier elimination method. We also show that our bound is
tight, even for nondeterministic automata. Moreover, we provide optimal
automata constructions for linear equations and inequations.
| [
{
"version": "v1",
"created": "Thu, 2 Jun 2005 15:11:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Klaedtke",
"Felix",
""
]
]
| new_dataset | 0.994221 |
cs/0506067 | Juan Jose Amor | Juan Jose Amor, Gregorio Robles, Jesus Gonzalez-Barahona | Measuring Woody: The Size of Debian 3.0 | null | null | null | null | cs.SE | null | Debian is possibly the largest free software distribution, with well over
4,500 source packages in the latest stable release (Debian 3.0) and more than
8,000 source packages in the release currently in preparation. However, we wish
to know what these numbers mean. In this paper, we use David A. Wheeler's
SLOCCount system to determine the number of physical source lines of code
(SLOC) of Debian 3.0 (aka woody). We show that Debian 3.0 includes more than
105,000,000 physical SLOC (almost twice than Red Hat 9, released about 8 months
later), showing that the Debian development model (based on the work of a large
group of voluntary developers spread around the world) is at least as capable
as other development methods (like the more centralized one, based on the work
of employees, used by Red Hat or Microsoft) to manage distributions of this
size.
It is also shown that if Debian had been developed using traditional
proprietary methods, the COCOMO model estimates that its cost would be close to
$6.1 billion USD to develop Debian 3.0. In addition, we offer both an analysis
of the programming languages used in the distribution (C amounts for about 65%,
C++ for about 12%, Shell for about 8% and LISP is around 4%, with many others
to follow), and the largest packages (The Linux kernel, Mozilla, XFree86, PM3,
etc.)
| [
{
"version": "v1",
"created": "Wed, 15 Jun 2005 21:48:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Amor",
"Juan Jose",
""
],
[
"Robles",
"Gregorio",
""
],
[
"Gonzalez-Barahona",
"Jesus",
""
]
]
| new_dataset | 0.99982 |
cs/0506068 | John Watrous | Chris Marriott and John Watrous | Quantum Arthur-Merlin Games | 22 pages | Computational Complexity, 14(2): 122 - 152, 2005 | null | null | cs.CC quant-ph | null | This paper studies quantum Arthur-Merlin games, which are Arthur-Merlin games
in which Arthur and Merlin can perform quantum computations and Merlin can send
Arthur quantum information. As in the classical case, messages from Arthur to
Merlin are restricted to be strings of uniformly generated random bits. It is
proved that for one-message quantum Arthur-Merlin games, which correspond to
the complexity class QMA, completeness and soundness errors can be reduced
exponentially without increasing the length of Merlin's message. Previous
constructions for reducing error required a polynomial increase in the length
of Merlin's message. Applications of this fact include a proof that logarithmic
length quantum certificates yield no increase in power over BQP and a simple
proof that QMA is contained in PP. Other facts that are proved include the
equivalence of three (or more) message quantum Arthur-Merlin games with
ordinary quantum interactive proof systems and some basic properties concerning
two-message quantum Arthur-Merlin games.
| [
{
"version": "v1",
"created": "Wed, 15 Jun 2005 22:13:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Marriott",
"Chris",
""
],
[
"Watrous",
"John",
""
]
]
| new_dataset | 0.958419 |
cs/0506099 | Yuval Shavitt | Yuval Shavitt and Eran Shir | DIMES: Let the Internet Measure Itself | 10 pages, 12 figures | null | null | null | cs.NI | null | Today's Internet maps, which are all collected from a small number of vantage
points, are falling short of being accurate. We suggest here a paradigm shift
for this task. DIMES is a distributed measurement infrastructure for the
Internet that is based on the deployment of thousands of light weight
measurement agents around the globe.
We describe the rationale behind DIMES deployment, discuss its design
trade-offs and algorithmic challenges, and analyze the structure of the
Internet as it seen with DIMES.
| [
{
"version": "v1",
"created": "Tue, 28 Jun 2005 20:29:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Shavitt",
"Yuval",
""
],
[
"Shir",
"Eran",
""
]
]
| new_dataset | 0.992865 |
cs/0506105 | Ren-Chiun Wang | Ren-Chiun Wang, Chou-Chen Yang, Kun-Ru Mo | A protected password change protocol | null | null | null | null | cs.CR | null | Some protected password change protocols were proposed. However, the previous
protocols were easily vulnerable to several attacks such as denial of service,
password guessing, stolen-verifier and impersonation atacks etc. Recently,
Chang et al. proposed a simple authenticated key agreement and protected
password change protocol for enhancing the security and efficiency. In this
paper, authors shall show that password guessing, denial of service and
known-key attacks can work in their password change protocol. At the same time,
authors shall propose a new password change protocol to withstand all the
threats of security.
| [
{
"version": "v1",
"created": "Thu, 30 Jun 2005 03:20:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wang",
"Ren-Chiun",
""
],
[
"Yang",
"Chou-Chen",
""
],
[
"Mo",
"Kun-Ru",
""
]
]
| new_dataset | 0.996522 |
cs/0507012 | Adilson Xavier V. | Gilson A. Giraldi, Adilson V. Xavier, Antonio L. Apolinario Jr, Paulo
S. Rodrigues | Lattice Gas Cellular Automata for Computational Fluid Animation | null | null | null | null | cs.GR | null | The past two decades showed a rapid growing of physically-based modeling of
fluids for computer graphics applications. In this area, a common top down
approach is to model the fluid dynamics by Navier-Stokes equations and apply a
numerical techniques such as Finite Differences or Finite Elements for the
simulation. In this paper we focus on fluid modeling through Lattice Gas
Cellular Automata (LGCA) for computer graphics applications. LGCA are discrete
models based on point particles that move on a lattice, according to suitable
and simple rules in order to mimic a fully molecular dynamics. By
Chapman-Enskog expansion, a known multiscale technique in this area, it can be
demonstrated that the Navier-Stokes model can be reproduced by the LGCA
technique. Thus, with LGCA we get a fluid model that does not require solution
of complicated equations. Therefore, we combine the advantage of the low
computational cost of LGCA and its ability to mimic the realistic fluid
dynamics to develop a new animating framework for computer graphics
applications. In this work, we discuss the theoretical elements of our proposal
and show experimental results.
| [
{
"version": "v1",
"created": "Tue, 5 Jul 2005 19:48:09 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Giraldi",
"Gilson A.",
""
],
[
"Xavier",
"Adilson V.",
""
],
[
"Apolinario",
"Antonio L.",
"Jr"
],
[
"Rodrigues",
"Paulo S.",
""
]
]
| new_dataset | 0.998581 |
cs/0507028 | Robert Milson | Robert Milson, Aaron Krowne | Adapting CBPP platforms for instructional use | Will be presented at the 2005, Emory university symposium on Free
Culture and the Digital Library | null | null | null | cs.DL cs.HC | null | Commons based peer-production (CBPP) is the de-centralized, net-based
approach to the creation and dissemination of information resources. Underlying
every CBPP system is a virtual community brought together by an internet tool
(such as a web site) and structured by a specific collaboration protocol. In
this talk we will argue that the value of such platforms can be leveraged by
adapting them for pedagogical purposes.
We report on one such recent adaptation. The Noosphere system is a web-based
collaboration environment that underlies the popular Planetmath website, a
collaboratively written encyclopedia of mathematics licensed under the GNU Free
Documentation License (FDL). Recently, the system was used to host a
graduate-level mathematics course at Dalhousie University, in Halifax, Canada.
The course consisted of regular lectures and assignment problems. The students
in the course collaborated on a set of course notes, encapsulating the lecture
content and giving solutions of assigned problems. The successful outcome of
this experiment demonstrated that a dedicated Noosphere system is well suited
for classroom applications. We argue that this ``proof of concept'' experience
also strongly suggests that every successful CBPP platform possesses latent
pedagogical value.
| [
{
"version": "v1",
"created": "Sun, 10 Jul 2005 19:05:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Milson",
"Robert",
""
],
[
"Krowne",
"Aaron",
""
]
]
| new_dataset | 0.981549 |
cs/0507030 | G\"unter Rote | Imre Barany and Guenter Rote | Strictly convex drawings of planar graphs | 20 pages, 13 figures. to be published in Documenta Mathematica. The
revision includes numerous small additions, corrections, and improvements, in
particular: - a discussion of the constants in the O-notation, after the
statement of thm.1. - a different set-up and clarification of the case
distinction for Lemma 1 | DOCUMENTA MATHEMATICA, Vol. 11 (2006), 369-391 | null | null | cs.CG cs.DM | null | Every three-connected planar graph with n vertices has a drawing on an O(n^2)
x O(n^2) grid in which all faces are strictly convex polygons. These drawings
are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids.
More generally, a strictly convex drawing exists on a grid of size O(W) x
O(n^4/W), for any choice of a parameter W in the range n<W<n^2. Tighter bounds
are obtained when the faces have fewer sides.
In the proof, we derive an explicit lower bound on the number of primitive
vectors in a triangle.
| [
{
"version": "v1",
"created": "Mon, 11 Jul 2005 20:06:06 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jun 2006 10:01:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Barany",
"Imre",
""
],
[
"Rote",
"Guenter",
""
]
]
| new_dataset | 0.999169 |
cs/0507049 | David Eppstein | David Eppstein, Michael T. Goodrich, Jonathan Z. Sun | The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional
Data | 12 pages, 3 figures. A preliminary version of this paper appeared in
the 21st ACM Symp. Comp. Geom., Pisa, 2005, pp. 296-305 | null | null | null | cs.CG | null | We present a new multi-dimensional data structure, which we call the skip
quadtree (for point data in R^2) or the skip octree (for point data in R^d,
with constant d>2). Our data structure combines the best features of two
well-known data structures, in that it has the well-defined "box"-shaped
regions of region quadtrees and the logarithmic-height search and update
hierarchical structure of skip lists. Indeed, the bottom level of our structure
is exactly a region quadtree (or octree for higher dimensional data). We
describe efficient algorithms for inserting and deleting points in a skip
quadtree, as well as fast methods for performing point location and approximate
range queries.
| [
{
"version": "v1",
"created": "Tue, 19 Jul 2005 20:17:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eppstein",
"David",
""
],
[
"Goodrich",
"Michael T.",
""
],
[
"Sun",
"Jonathan Z.",
""
]
]
| new_dataset | 0.990735 |
cs/0507054 | Andrey Siver S. | A. S. Siver | f2mma: FORTRAN to Mathematica translator | null | null | null | null | cs.OH | null | f2mma program can be used to translate programs written in some subset of the
FORTRAN language into {\sl Mathematica} system's programming language. This
subset have been enough to translate GAPP (Global Analysis of Particle
Properties) programm into {\sl Mathematica} language automatically. Observables
table calculated with GAPP({\sl Mathematica}) is presented.
| [
{
"version": "v1",
"created": "Thu, 21 Jul 2005 13:32:15 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Aug 2005 06:48:26 GMT"
},
{
"version": "v3",
"created": "Fri, 5 Aug 2005 09:26:15 GMT"
},
{
"version": "v4",
"created": "Mon, 23 Jan 2006 14:27:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Siver",
"A. S.",
""
]
]
| new_dataset | 0.998234 |
cs/0507055 | Andrey Siver S. | A. S. Siver | ReacProc: A Tool to Process Reactions Describing Particle Interactions | 5 pages | null | null | null | cs.CE | null | ReacProc is a program written in C/C++ programming language which can be used
(1) to check out of reactions describing particles interactions against
conservation laws and (2) to reduce input reaction into some canonical form. A
table with particles properties is available within ReacProc package.
| [
{
"version": "v1",
"created": "Thu, 21 Jul 2005 14:17:47 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Aug 2005 07:14:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Siver",
"A. S.",
""
]
]
| new_dataset | 0.999177 |
cs/0507057 | Tereza Tu\v{s}arov\'a | Tereza Tusarova | A new sibling of BQP | extended abstract, submitted to UC'05 | null | null | null | cs.CC | null | We present a new quantum complexity class, called MQ^2, which is contained in
AWPP. This class has a compact and simple mathematical definition, involving
only polynomial-time computable functions and a unitarity condition. It
contains both Deutsch-Jozsa's and Shor's algorithm, while its relation to BQP
is unknown. This shows that in the complexity class hierarchy, BQP is not an
extraordinary isolated island, but has ''siblings'' which as well can solve
prime-factorization.
| [
{
"version": "v1",
"created": "Thu, 21 Jul 2005 22:36:41 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Tusarova",
"Tereza",
""
]
]
| new_dataset | 0.995243 |
cs/0508005 | Riccardo Pucella | Nick Papanikolaou | Logic Column 13: Reasoning Formally about Quantum Systems: An Overview | 17 pages | SIGACT News, 36(3), pp. 51-66, 2005 | null | null | cs.LO | null | This article is intended as an introduction to the subject of quantum logic,
and as a brief survey of the relevant literature. Also discussed here are
logics for specification and analysis of quantum information systems, in
particular, recent work by P. Mateus and A. Sernadas, and also by R. van der
Meyden and M. Patra. Overall, our objective is to provide a high-level
presentation of the logical aspects of quantum theory. Mateus' and Sernadas'
EQPL logic is illustrated with a small example, namely the state of an
entangled pair of qubits. The "KT" logic of van der Meyden and Patra is
demonstrated briefly in the context of the B92 protocol for quantum key
distribution.
| [
{
"version": "v1",
"created": "Mon, 1 Aug 2005 14:34:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Papanikolaou",
"Nick",
""
]
]
| new_dataset | 0.983781 |
cs/0508041 | Tian-Jian Jiang | Tian-Jian Jiang, Deng-Liu, Kang-min Liu, Weizhong Yang, Pek-tiong Tan,
Mengjuei Hsieh, Tsung-hsiang Chang, Wen-Lien Hsu | OpenVanilla - A Non-Intrusive Plug-In Framework of Text Services | 4 pages | null | null | null | cs.HC | null | Input method (IM) is a sine qua non for text entry of many Asian languages,
but its potential applications on other languages remain under-explored. This
paper proposes a philosophy of input method design by seeing it as a
nonintrusive plug-in text service framework. Such design allows new
functionalities of text processing to be attached onto a running application
without any tweaking of code. We also introduce OpenVanilla, a cross-platform
framework that is designed with the above-mentioned model in mind. Frameworks
like OpenVanilla have shown that an input method can be more than just a text
entry tool: it offers a convenient way for developing various text service and
language tools.
| [
{
"version": "v1",
"created": "Thu, 4 Aug 2005 22:39:49 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jun 2006 06:41:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jiang",
"Tian-Jian",
""
],
[
"Deng-Liu",
"",
""
],
[
"Liu",
"Kang-min",
""
],
[
"Yang",
"Weizhong",
""
],
[
"Tan",
"Pek-tiong",
""
],
[
"Hsieh",
"Mengjuei",
""
],
[
"Chang",
"Tsung-hsiang",
""
],
[
"Hsu",
"Wen-Lien",
""
]
]
| new_dataset | 0.998634 |
cs/0508063 | Michel Dagenais | Michel R. Dagenais (Dept. of Computer Engineering, Ecole
Polytechnique, Montreal, Canada) | Disks, Partitions, Volumes and RAID Performance with the Linux Operating
System | null | null | null | null | cs.PF cs.OS | null | Block devices in computer operating systems typically correspond to disks or
disk partitions, and are used to store files in a filesystem. Disks are not the
only real or virtual device which adhere to the block accessible stream of
bytes block device model. Files, remote devices, or even RAM may be used as a
virtual disks. This article examines several common combinations of block
device layers used as virtual disks in the Linux operating system: disk
partitions, loopback files, software RAID, Logical Volume Manager, and Network
Block Devices. It measures their relative performance using different
filesystems: Ext2, Ext3, ReiserFS, JFS, XFS,NFS.
| [
{
"version": "v1",
"created": "Fri, 12 Aug 2005 16:13:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dagenais",
"Michel R.",
"",
"Dept. of Computer Engineering, Ecole\n Polytechnique, Montreal, Canada"
]
]
| new_dataset | 0.995476 |
cs/0508066 | Jonathan Bowen | Silvia Filippini-Fantoni and Jonathan P. Bowen | Can Small Museums Develop Compelling, Educational and Accessible Web
Resources? The Case of Accademia Carrara | 14 pages, 6 figures | In James Hemsley, Vito Cappellini and Gerd Stanke (eds.), EVA 2005
London Conference Proceedings, University College London, UK, 25-29 July
2005, pages 18.1-18.14. ISBN: 0-9543146-6-2 | null | null | cs.MM cs.CY cs.DL cs.IR | null | Due to the lack of budget, competence, personnel and time, small museums are
often unable to develop compelling, educational and accessible web resources
for their permanent collections or temporary exhibitions. In an attempt to
prove that investing in these types of resources can be very fruitful even for
small institutions, we will illustrate the case of Accademia Carrara, a museum
in Bergamo, northern Italy, which, for a current temporary exhibition on
Cezanne and Renoir's masterpieces from the Paul Guillaume collection, developed
a series of multimedia applications, including an accessible website, rich in
content and educational material [www.cezannerenoir.it].
| [
{
"version": "v1",
"created": "Sat, 13 Aug 2005 14:46:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Filippini-Fantoni",
"Silvia",
""
],
[
"Bowen",
"Jonathan P.",
""
]
]
| new_dataset | 0.964657 |
cs/0508080 | Kirti Chawla | Kirti Chawla | A 3D RGB Axis-based Color-oriented Cryptography | 16 Pages, 12 figures | null | null | null | cs.CR | null | In this document, a formal approach to encrypt, decrypt, transmit and receive
information using colors is explored. A piece of information consists of set of
symbols with a definite property imposed on the generating set. The symbols are
usually encoded using ascii scheme. A linear to 3d transformation is presented.
The change of axis from traditional xyz to rgb is highlighted and its effect
are studied. A point in this new axis is then represented as a unique color and
a vector or matrix is associated with it, making it amenable to standard vector
or matrix operations. A formal notion on hybrid cryptography is introduced as
the algorithm lies on the boundary of symmetric and asymmetric cryptography. No
discussion is complete, without mentioning reference to communication aspects
of secure information in a channel. Transmission scheme pertaining to light as
carrier is introduced and studied. Key-exchanges do not come under the scope of
current frame of document.
| [
{
"version": "v1",
"created": "Thu, 18 Aug 2005 07:07:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chawla",
"Kirti",
""
]
]
| new_dataset | 0.999003 |
cs/0508086 | Dragos Trinca | Dragos Trinca | High-performance BWT-based Encoders | 12 pages | null | null | null | cs.DS | null | In 1994, Burrows and Wheeler developed a data compression algorithm which
performs significantly better than Lempel-Ziv based algorithms. Since then, a
lot of work has been done in order to improve their algorithm, which is based
on a reversible transformation of the input string, called BWT (the
Burrows-Wheeler transformation). In this paper, we propose a compression scheme
based on BWT, MTF (move-to-front coding), and a version of the algorithms
presented in [Dragos Trinca, ITCC-2004].
| [
{
"version": "v1",
"created": "Sun, 21 Aug 2005 05:47:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Trinca",
"Dragos",
""
]
]
| new_dataset | 0.995413 |
cs/0508116 | Robert Burger PhD | John Robert Burger | Quantum Algorithm Processors to Reveal Hamiltonian Cycles | 10 pages | null | null | null | cs.AR cs.CG | null | Quantum computer versus quantum algorithm processor in CMOS are compared to
find (in parallel) all Hamiltonian cycles in a graph with m edges and n
vertices, each represented by k bits. A quantum computer uses quantum states
analogous to CMOS registers. With efficient initialization, number of CMOS
registers is proportional to (n-1)! Number of qubits in a quantum computer is
approximately proportional to kn+2mn in the approach below. Using CMOS, the
bits per register is about proportional to kn, which is less since bits can be
irreversibly reset. In either concept, number of gates, or operations to
identify Hamiltonian cycles is proportional to kmn. However, a quantum computer
needs an additional exponentially large number of operations to accomplish a
probabilistic readout. In contrast, CMOS is deterministic and readout is
comparable to ordinary memory.
| [
{
"version": "v1",
"created": "Thu, 25 Aug 2005 19:04:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Burger",
"John Robert",
""
]
]
| new_dataset | 0.999224 |
cs/0508129 | Esra Erdem | Esra Erdem, Vladimir Lifschitz, and Don Ringe | Temporal Phylogenetic Networks and Logic Programming | null | null | null | null | cs.LO cs.AI cs.PL | null | The concept of a temporal phylogenetic network is a mathematical model of
evolution of a family of natural languages. It takes into account the fact that
languages can trade their characteristics with each other when linguistic
communities are in contact, and also that a contact is only possible when the
languages are spoken at the same time. We show how computational methods of
answer set programming and constraint logic programming can be used to generate
plausible conjectures about contacts between prehistoric linguistic
communities, and illustrate our approach by applying it to the evolutionary
history of Indo-European languages.
To appear in Theory and Practice of Logic Programming (TPLP).
| [
{
"version": "v1",
"created": "Tue, 30 Aug 2005 13:04:05 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Erdem",
"Esra",
""
],
[
"Lifschitz",
"Vladimir",
""
],
[
"Ringe",
"Don",
""
]
]
| new_dataset | 0.996355 |
cs/0508130 | Mehul Shah | Mary Baker, Mehul Shah, David S. H. Rosenthal, Mema Roussopoulos,
Petros Maniatis, TJ Giuli, Prashanth Bungale | A Fresh Look at the Reliability of Long-term Digital Storage | null | null | null | null | cs.DL cs.DB cs.OS | null | Many emerging Web services, such as email, photo sharing, and web site
archives, need to preserve large amounts of quickly-accessible data
indefinitely into the future. In this paper, we make the case that these
applications' demands on large scale storage systems over long time horizons
require us to re-evaluate traditional storage system designs. We examine
threats to long-lived data from an end-to-end perspective, taking into account
not just hardware and software faults but also faults due to humans and
organizations. We present a simple model of long-term storage failures that
helps us reason about the various strategies for addressing these threats in a
cost-effective manner. Using this model we show that the most important
strategies for increasing the reliability of long-term storage are detecting
latent faults quickly, automating fault repair to make it faster and cheaper,
and increasing the independence of data replicas.
| [
{
"version": "v1",
"created": "Wed, 31 Aug 2005 01:44:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Baker",
"Mary",
""
],
[
"Shah",
"Mehul",
""
],
[
"Rosenthal",
"David S. H.",
""
],
[
"Roussopoulos",
"Mema",
""
],
[
"Maniatis",
"Petros",
""
],
[
"Giuli",
"TJ",
""
],
[
"Bungale",
"Prashanth",
""
]
]
| new_dataset | 0.989358 |
cs/0509025 | Jeremy Avigad | Jeremy Avigad, Kevin Donnelly, David Gray, and Paul Raff | A formally verified proof of the prime number theorem | 23 pages | null | null | null | cs.AI cs.LO cs.SC | null | The prime number theorem, established by Hadamard and de la Vall'ee Poussin
independently in 1896, asserts that the density of primes in the positive
integers is asymptotic to 1 / ln x. Whereas their proofs made serious use of
the methods of complex analysis, elementary proofs were provided by Selberg and
Erd"os in 1948. We describe a formally verified version of Selberg's proof,
obtained using the Isabelle proof assistant.
| [
{
"version": "v1",
"created": "Fri, 9 Sep 2005 15:47:35 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Jan 2006 21:18:33 GMT"
},
{
"version": "v3",
"created": "Thu, 6 Apr 2006 20:27:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Avigad",
"Jeremy",
""
],
[
"Donnelly",
"Kevin",
""
],
[
"Gray",
"David",
""
],
[
"Raff",
"Paul",
""
]
]
| new_dataset | 0.969977 |
cs/0509054 | Joseph O'Rourke | Mirela Damian, Robin Flatland, Joseph O'Rourke | Grid Vertex-Unfolding Orthogonal Polyhedra | Original: 12 pages, 8 figures, 11 references. Revised: 22 pages, 16
figures, 12 references. New version is a substantial revision superceding the
preliminary extended abstract that appeared in Lecture Notes in Computer
Science, Volume 3884, Springer, Berlin/Heidelberg, Feb. 2006, pp. 264-276 | null | null | null | cs.CG cs.DM | null | An edge-unfolding of a polyhedron is produced by cutting along edges and
flattening the faces to a *net*, a connected planar piece with no overlaps. A
*grid unfolding* allows additional cuts along grid edges induced by coordinate
planes passing through every vertex. A vertex-unfolding permits faces in the
net to be connected at single vertices, not necessarily along edges. We show
that any orthogonal polyhedron of genus zero has a grid vertex-unfolding.
(There are orthogonal polyhedra that cannot be vertex-unfolded, so some type of
"gridding" of the faces is necessary.) For any orthogonal polyhedron P with n
vertices, we describe an algorithm that vertex-unfolds P in O(n^2) time.
Enroute to explaining this algorithm, we present a simpler vertex-unfolding
algorithm that requires a 3 x 1 refinement of the vertex grid.
| [
{
"version": "v1",
"created": "Mon, 19 Sep 2005 00:22:03 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Sep 2006 18:21:31 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Damian",
"Mirela",
""
],
[
"Flatland",
"Robin",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.999672 |
cs/0509071 | Krzysztof R. Apt | Krzysztof R. Apt, Francesca Rossi and K. Brent Venable | CP-nets and Nash equilibria | 6 pages. in: roc. of the Third International Conference on
Computational Intelligence, Robotics and Autonomous Systems (CIRAS '05). To
appear | null | null | null | cs.GT cs.AI | null | We relate here two formalisms that are used for different purposes in
reasoning about multi-agent systems. One of them are strategic games that are
used to capture the idea that agents interact with each other while pursuing
their own interest. The other are CP-nets that were introduced to express
qualitative and conditional preferences of the users and which aim at
facilitating the process of preference elicitation. To relate these two
formalisms we introduce a natural, qualitative, extension of the notion of a
strategic game. We show then that the optimal outcomes of a CP-net are exactly
the Nash equilibria of an appropriately defined strategic game in the above
sense. This allows us to use the techniques of game theory to search for
optimal outcomes of CP-nets and vice-versa, to use techniques developed for
CP-nets to search for Nash equilibria of the considered games.
| [
{
"version": "v1",
"created": "Thu, 22 Sep 2005 16:07:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Apt",
"Krzysztof R.",
""
],
[
"Rossi",
"Francesca",
""
],
[
"Venable",
"K. Brent",
""
]
]
| new_dataset | 0.994615 |
cs/0509072 | Kaikai Shen | Kaikai Shen, Lide Wu | Folksonomy as a Complex Network | null | null | null | null | cs.IR cs.DL physics.soc-ph | null | Folksonomy is an emerging technology that works to classify the information
over WWW through tagging the bookmarks, photos or other web-based contents. It
is understood to be organized by every user while not limited to the authors of
the contents and the professional editors. This study surveyed the folksonomy
as a complex network. The result indicates that the network, which is composed
of the tags from the folksonomy, displays both properties of small world and
scale-free. However, the statistics only shows a local and static slice of the
vast body of folksonomy which is still evolving.
| [
{
"version": "v1",
"created": "Fri, 23 Sep 2005 13:27:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Shen",
"Kaikai",
""
],
[
"Wu",
"Lide",
""
]
]
| new_dataset | 0.966154 |
cs/0509082 | Yossi Zana | Yossi Zana, Roberto M. Cesar-JR | Face Recognition Based on Polar Frequency Features | ACM Transactions on Applied Perception | null | null | null | cs.CV | null | A novel biologically motivated face recognition algorithm based on polar
frequency is presented. Polar frequency descriptors are extracted from face
images by Fourier-Bessel transform (FBT). Next, the Euclidean distance between
all images is computed and each image is now represented by its dissimilarity
to the other images. A Pseudo-Fisher Linear Discriminant was built on this
dissimilarity space. The performance of Discrete Fourier transform (DFT)
descriptors, and a combination of both feature types was also evaluated. The
algorithms were tested on a 40- and 1196-subjects face database (ORL and FERET,
respectively). With 5 images per subject in the training and test datasets,
error rate on the ORL database was 3.8, 1.25 and 0.2% for the FBT, DFT, and the
combined classifier, respectively, as compared to 2.6% achieved by the best
previous algorithm. The most informative polar frequency features were
concentrated at low-to-medium angular frequencies coupled to low radial
frequencies. On the FERET database, where an affine normalization
pre-processing was applied, the FBT algorithm outperformed only the PCA in a
rank recognition test. However, it achieved performance comparable to
state-of-the-art methods when evaluated by verification tests. These results
indicate the high informative value of the polar frequency content of face
images in relation to recognition and verification tasks, and that the
Cartesian frequency content can complement information about the subjects'
identity, but possibly only when the images are not pre-normalized. Possible
implications for human face recognition are discussed.
| [
{
"version": "v1",
"created": "Tue, 27 Sep 2005 15:50:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zana",
"Yossi",
""
],
[
"Cesar-JR",
"Roberto M.",
""
]
]
| new_dataset | 0.978271 |
cs/0509100 | Shripad Thite | Jeff Erickson (1), Shripad Thite (1), David P. Bunde (1) ((1)
Department of Computer Science, University of Illinois at Urbana-Champaign,
Urbana, IL, USA) | Distance-2 Edge Coloring is NP-Complete | 3 pages, 1 figure in color | null | null | null | cs.DM cs.CC | null | We prove that it is NP-complete to determine whether there exists a
distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite
2-inductive graph with girth 6 and maximum degree 3.
| [
{
"version": "v1",
"created": "Fri, 30 Sep 2005 13:15:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Erickson",
"Jeff",
""
],
[
"Thite",
"Shripad",
""
],
[
"Bunde",
"David P.",
""
]
]
| new_dataset | 0.998455 |
cs/0510001 | Jo\~ao Vitor Baldini Soares | Jo\~ao V. B. Soares, Jorge J. G. Leandro, Roberto M. Cesar Jr.,
Herbert F. Jelinek, Michael J. Cree | Retinal Vessel Segmentation Using the 2-D Morlet Wavelet and Supervised
Classification | 9 pages, 7 figures and 1 table. Accepted for publication in IEEE
Trans Med Imag; added copyright notice | IEEE Trans Med Imag, Vol. 25, no. 9, pp. 1214- 1222, Sep. 2006. | 10.1109/TMI.2006.879967 | null | cs.CV | null | We present a method for automated segmentation of the vasculature in retinal
images. The method produces segmentations by classifying each image pixel as
vessel or non-vessel, based on the pixel's feature vector. Feature vectors are
composed of the pixel's intensity and continuous two-dimensional Morlet wavelet
transform responses taken at multiple scales. The Morlet wavelet is capable of
tuning to specific frequencies, thus allowing noise filtering and vessel
enhancement in a single step. We use a Bayesian classifier with
class-conditional probability density functions (likelihoods) described as
Gaussian mixtures, yielding a fast classification, while being able to model
complex decision surfaces and compare its performance with the linear minimum
squared error classifier. The probability distributions are estimated based on
a training set of labeled pixels obtained from manual segmentations. The
method's performance is evaluated on publicly available DRIVE and STARE
databases of manually labeled non-mydriatic images. On the DRIVE database, it
achieves an area under the receiver operating characteristic (ROC) curve of
0.9598, being slightly superior than that presented by the method of Staal et
al.
| [
{
"version": "v1",
"created": "Fri, 30 Sep 2005 22:27:45 GMT"
},
{
"version": "v2",
"created": "Thu, 11 May 2006 17:09:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Soares",
"João V. B.",
""
],
[
"Leandro",
"Jorge J. G.",
""
],
[
"Cesar",
"Roberto M.",
"Jr."
],
[
"Jelinek",
"Herbert F.",
""
],
[
"Cree",
"Michael J.",
""
]
]
| new_dataset | 0.984823 |
cs/0510011 | David Delahaye | David Delahaye (CEDRIC), Micaela Mayero (LIPN) | Diophantus' 20th Problem and Fermat's Last Theorem for n=4:
Formalization of Fermat's Proofs in the Coq Proof Assistant | 16 pages | null | null | null | cs.LO cs.SE math.NT | null | We present the proof of Diophantus' 20th problem (book VI of Diophantus'
Arithmetica), which consists in wondering if there exist right triangles whose
sides may be measured as integers and whose surface may be a square. This
problem was negatively solved by Fermat in the 17th century, who used the
"wonderful" method (ipse dixit Fermat) of infinite descent. This method, which
is, historically, the first use of induction, consists in producing smaller and
smaller non-negative integer solutions assuming that one exists; this naturally
leads to a reductio ad absurdum reasoning because we are bounded by zero. We
describe the formalization of this proof which has been carried out in the Coq
proof assistant. Moreover, as a direct and no less historical application, we
also provide the proof (by Fermat) of Fermat's last theorem for n=4, as well as
the corresponding formalization made in Coq.
| [
{
"version": "v1",
"created": "Tue, 4 Oct 2005 08:53:10 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Delahaye",
"David",
"",
"CEDRIC"
],
[
"Mayero",
"Micaela",
"",
"LIPN"
]
]
| new_dataset | 0.997514 |
cs/0510027 | Alexandre d'Aspremont | Alexandre d'Aspremont | A Market Test for the Positivity of Arrow-Debreu Prices | New version, fixes a few minor errors and typos | null | null | null | cs.CE | null | We derive tractable necessary and sufficient conditions for the absence of
buy-and-hold arbitrage opportunities in a perfectly liquid, one period market.
We formulate the positivity of Arrow-Debreu prices as a generalized moment
problem to show that this no arbitrage condition is equivalent to the positive
semidefiniteness of matrices formed by the market price of tradeable securities
and their products. We apply this result to a market with multiple assets and
basket call options.
| [
{
"version": "v1",
"created": "Tue, 11 Oct 2005 13:40:17 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Jun 2006 17:05:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"d'Aspremont",
"Alexandre",
""
]
]
| new_dataset | 0.997887 |
cs/0510039 | Sandor P. Fekete | Christophe Bobda, Ali Ahmadinia, Mateusz Majer, Juergen Teich, Sandor
P. Fekete, Jan van der Veen | DyNoC: A Dynamic Infrastructure for Communication in Dynamically
Reconfigurable Devices | 9 pages, 7 figures, 1 table, Latex, to appear in 15th International
Conference on Field-Programmable Logic and Application | null | null | null | cs.AR | null | A new paradigm to support the communication among modules dynamically placed
on a reconfigurable device at run-time is presented. Based on the network on
chip (NoC) infrastructure, we developed a dynamic communication infrastructure
as well as routing methodologies capable to handle routing in a NoC with
obstacles created by dynamically placed components. We prove the unrestricted
reachability of components and pins, the deadlock-freeness and we finally show
the feasibility of our approach by means on real life example applications.
| [
{
"version": "v1",
"created": "Fri, 14 Oct 2005 22:03:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bobda",
"Christophe",
""
],
[
"Ahmadinia",
"Ali",
""
],
[
"Majer",
"Mateusz",
""
],
[
"Teich",
"Juergen",
""
],
[
"Fekete",
"Sandor P.",
""
],
[
"van der Veen",
"Jan",
""
]
]
| new_dataset | 0.99963 |
cs/0510048 | Sandor P. Fekete | Alexander Kroeller and Sandor P. Fekete and Dennis Pfisterer and
Stefan Fischer | Deterministic boundary recognition and topology extraction for large
sensor networks | 10 pages, 9 figures, Latex, to appear in Symposium on Discrete
Algorithms (SODA 2006) | null | null | null | cs.DC cs.CG | null | We present a new framework for the crucial challenge of self-organization of
a large sensor network. The basic scenario can be described as follows: Given a
large swarm of immobile sensor nodes that have been scattered in a polygonal
region, such as a street network. Nodes have no knowledge of size or shape of
the environment or the position of other nodes. Moreover, they have no way of
measuring coordinates, geometric distances to other nodes, or their direction.
Their only way of interacting with other nodes is to send or to receive
messages from any node that is within communication range. The objective is to
develop algorithms and protocols that allow self-organization of the swarm into
large-scale structures that reflect the structure of the street network,
setting the stage for global routing, tracking and guiding algorithms.
| [
{
"version": "v1",
"created": "Mon, 17 Oct 2005 12:23:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kroeller",
"Alexander",
""
],
[
"Fekete",
"Sandor P.",
""
],
[
"Pfisterer",
"Dennis",
""
],
[
"Fischer",
"Stefan",
""
]
]
| new_dataset | 0.996741 |
cs/0510053 | Martin Kutz | Martin Kutz | A pair of trees without a simultaneous geometric embedding in the plane | This paper has been withdrawn by the author because it had turned out
that the result was already known before | null | null | null | cs.CG | null | Any planar graph has a crossing-free straight-line drawing in the plane. A
simultaneous geometric embedding of two n-vertex graphs is a straight-line
drawing of both graphs on a common set of n points, such that the edges withing
each individual graph do not cross. We consider simultaneous embeddings of two
labeled trees, with predescribed vertex correspondences, and present an
instance of such a pair that cannot be embedded. Further we provide an example
of a planar graph that cannot be embedded together with a path when vertex
correspondences are given.
| [
{
"version": "v1",
"created": "Tue, 18 Oct 2005 18:26:00 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Nov 2005 13:14:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kutz",
"Martin",
""
]
]
| new_dataset | 0.995257 |
cs/0510059 | Arnaud De La Fortelle | Michel Parent (INRIA Rocquencourt), Arnaud De La Fortelle (INRIA
Rocquencourt) | Cybercars : Past, Present and Future of the Technology | null | Dans ITS World Congress 2005 | null | null | cs.RO | null | Automobile has become the dominant transport mode in the world in the last
century. In order to meet a continuously growing demand for transport, one
solution is to change the control approach for vehicle to full driving
automation, which removes the driver from the control loop to improve
efficiency and reduce accidents. Recent work shows that there are several
realistic paths towards this deployment : driving assistance on passenger cars,
automated commercial vehicles on dedicated infrastructures, and new forms of
urban transport (car-sharing and cybercars). Cybercars have already been put
into operation in Europe, and it seems that this approach could lead the way
towards full automation on most urban, and later interurban infrastructures.
The European project CyberCars has brought many improvements in the technology
needed to operate cybercars over the last three years. A new, larger European
project is now being prepared to carry this work further in order to meet more
ambitious objectives in terms of safety and efficiency. This paper will present
past and present technologies and will focus on the future developments.
| [
{
"version": "v1",
"created": "Thu, 20 Oct 2005 15:03:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Parent",
"Michel",
"",
"INRIA Rocquencourt"
],
[
"De La Fortelle",
"Arnaud",
"",
"INRIA\n Rocquencourt"
]
]
| new_dataset | 0.999781 |
cs/0510087 | Johannes Gro{\ss}e | J. Grosse | MathPSfrag: Creating Publication-Quality Labels in Mathematica Plots | 7 pages, 8 figures, for associated Mathematica package, see
http://wwwth.mppmu.mpg.de/members/jgrosse/mathpsfrag/MathPSfrag-1.0.tar.gz | null | null | LMU-ASC 70/05; MPP-2005-126 | cs.GR | null | This article introduces a Mathematica package providing a graphics export
function that automatically replaces Mathematica expressions in a graphic by
the corresponding LaTeX constructs and positions them correctly. It thus
facilitates the creation of publication-quality Enscapulated PostScript (EPS)
graphics.
| [
{
"version": "v1",
"created": "Mon, 31 Oct 2005 09:40:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Grosse",
"J.",
""
]
]
| new_dataset | 0.992897 |
cs/0511017 | Gus Gutoski | Gus Gutoski | Short Quantum Games | MSc thesis, 79 pages single-spaced | null | null | null | cs.CC quant-ph | null | In this thesis we introduce quantum refereed games, which are quantum
interactive proof systems with two competing provers. We focus on a restriction
of this model that we call "short quantum games" and we prove an upper bound
and a lower bound on the expressive power of these games.
For the lower bound, we prove that every language having an ordinary quantum
interactive proof system also has a short quantum game. An important part of
this proof is the establishment of a quantum measurement that reliably
distinguishes between quantum states chosen from disjoint convex sets.
For the upper bound, we show that certain types of quantum refereed games,
including short quantum games, are decidable in deterministic exponential time
by supplying a separation oracle for use with the ellipsoid method for convex
feasibility.
| [
{
"version": "v1",
"created": "Thu, 3 Nov 2005 23:00:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gutoski",
"Gus",
""
]
]
| new_dataset | 0.998905 |
cs/0511022 | Emanuel Diamant | Emanuel Diamant | Does a Plane Imitate a Bird? Does Computer Vision Have to Follow
Biological Paradigms? | Proceedings of the 1st International Symposium on Brain, Vision, and
Artificial Intelligence, 19-21 October 2005, Naples, Italy | LNCS, vol. 3704, pp. 108-115, 2005, Springer Verlag Berlin
Heidelberg 2005 | null | null | cs.NE | null | We posit a new paradigm for image information processing. For the last 25
years, this task was usually approached in the frame of Treisman's two-stage
paradigm [1]. The latter supposes an unsupervised, bottom-up directed process
of preliminary information pieces gathering at the lower processing stages and
a supervised, top-down directed process of information pieces binding and
grouping at the higher stages. It is acknowledged that these sub-processes
interact and intervene between them in a tricky and a complicated manner.
Notwithstanding the prevalence of this paradigm in biological and computer
vision, we nevertheless propose to replace it with a new one, which we would
like to designate as a two-part paradigm. In it, information contained in an
image is initially extracted in an independent top-down manner by one part of
the system, and then it is examined and interpreted by another, separate system
part. We argue that the new paradigm seems to be more plausible than its
forerunner. We provide evidence from human attention vision studies and
insights of Kolmogorov's complexity theory to support our arguments. We also
provide some reasons in favor of separate image interpretation issues.
| [
{
"version": "v1",
"created": "Fri, 4 Nov 2005 15:08:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Diamant",
"Emanuel",
""
]
]
| new_dataset | 0.995775 |
cs/0511025 | Riccardo Pucella | James Cheney | Logic Column 14: Nominal Logic and Abstract Syntax | 24 pages | SIGACT News 36 (4), pp. 47-69, 2005 | null | null | cs.LO | null | Formalizing syntactic proofs of properties of logics, programming languages,
security protocols, and other formal systems is a significant challenge, in
large part because of the obligation to handle name-binding correctly. We
present an approach called nominal abstract syntax that has attracted
considerable interest since its introduction approximately six years ago. After
an overview of other approaches, we describe nominal abstract syntax and
nominal logic, a logic for reasoning about nominal abstract syntax. We also
discuss applications of nominal techniques to programming, automated reasoning,
and identify some future directions.
| [
{
"version": "v1",
"created": "Sat, 5 Nov 2005 02:47:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cheney",
"James",
""
]
]
| new_dataset | 0.99924 |
cs/0511043 | Damiano Bolzoni | Damiano Bolzoni, Emmanuele Zambon, Sandro Etalle, Pieter Hartel | Poseidon: a 2-tier Anomaly-based Intrusion Detection System | null | null | null | TR-CTIT-05-53 | cs.CR | null | We present Poseidon, a new anomaly based intrusion detection system. Poseidon
is payload-based, and presents a two-tier architecture: the first stage
consists of a Self-Organizing Map, while the second one is a modified PAYL
system. Our benchmarks on the 1999 DARPA data set show a higher detection rate
and lower number of false positives than PAYL and PHAD.
| [
{
"version": "v1",
"created": "Fri, 11 Nov 2005 13:43:04 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Dec 2005 15:11:44 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Jan 2006 14:27:46 GMT"
},
{
"version": "v4",
"created": "Fri, 3 Feb 2006 12:26:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bolzoni",
"Damiano",
""
],
[
"Zambon",
"Emmanuele",
""
],
[
"Etalle",
"Sandro",
""
],
[
"Hartel",
"Pieter",
""
]
]
| new_dataset | 0.999636 |
cs/0511071 | Francesco Capasso | Francesco Capasso | A polynomial-time heuristic for Circuit-SAT | 20 pages, 8 figures | null | null | null | cs.CC cs.DS | null | In this paper is presented an heuristic that, in polynomial time and space in
the input dimension, determines if a circuit describes a tautology or a
contradiction. If the circuit is neither a tautology nor a contradiction, then
the heuristic finds an assignment to the circuit inputs such that the circuit
is satisfied.
| [
{
"version": "v1",
"created": "Fri, 18 Nov 2005 20:23:46 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Nov 2005 21:56:11 GMT"
},
{
"version": "v3",
"created": "Wed, 23 Nov 2005 22:19:18 GMT"
},
{
"version": "v4",
"created": "Mon, 28 Nov 2005 19:52:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Capasso",
"Francesco",
""
]
]
| new_dataset | 0.999842 |
cs/0512001 | Frank Ruskey | Jeremy Carroll (1), Frank Ruskey (2), Mark Weston (2) ((1) HP
Laboratories, Bristol, UK, (2) University of Victoria, Canada) | Which n-Venn diagrams can be drawn with convex k-gons? | 10 pages, 3 figures. To be published in Proceedings of the Second
International Workshop on Euler Diagrams (Euler 2005), Electronic Notes in
Theoretical Computer Science | null | null | null | cs.CG | null | We establish a new lower bound for the number of sides required for the
component curves of simple Venn diagrams made from polygons. Specifically, for
any n-Venn diagram of convex k-gons, we prove that k >= (2^n - 2 - n) / (n
(n-2)). In the process we prove that Venn diagrams of seven curves, simple or
not, cannot be formed from triangles. We then give an example achieving the new
lower bound of a (simple, symmetric) Venn diagram of seven quadrilaterals.
Previously Grunbaum had constructed a 7-Venn diagram of non-convex 5-gons
[``Venn Diagrams II'', Geombinatorics 2:25-31, 1992].
| [
{
"version": "v1",
"created": "Wed, 30 Nov 2005 23:30:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Carroll",
"Jeremy",
""
],
[
"Ruskey",
"Frank",
""
],
[
"Weston",
"Mark",
""
]
]
| new_dataset | 0.960081 |
cs/0512005 | Vitorino Ramos Dr. | Vitorino Ramos, Carlos Fernandes and Agostinho C. Rosa | On Ants, Bacteria and Dynamic Environments | 8 pages, 6 figures, full paper with pictures in
http://alfa.ist.utl.pt/~cvrm/staff/vramos/ref_63.html, keywords: Swarm
Intelligence and Perception, Social Cognitive Maps, Social Foraging,
Self-Organization, Distributed Search and Optimization in Dynamic
Environments. In NCA-05, Natural Computing and Applications Workshop, IEEE
Computer Press, Timisoara, Romania, Sep. 25-29, 2005 | null | null | null | cs.DC | null | Wasps, bees, ants and termites all make effective use of their environment
and resources by displaying collective swarm intelligence. Termite colonies -
for instance - build nests with a complexity far beyond the comprehension of
the individual termite, while ant colonies dynamically allocate labor to
various vital tasks such as foraging or defense without any central
decision-making ability. Recent research suggests that microbial life can be
even richer: highly social, intricately networked, and teeming with
interactions, as found in bacteria. What strikes from these observations is
that both ant colonies and bacteria have similar natural mechanisms based on
Stigmergy and Self-Organization in order to emerge coherent and sophisticated
patterns of global behaviour. Keeping in mind the above characteristics we will
present a simple model to tackle the collective adaptation of a social swarm
based on real ant colony behaviors (SSA algorithm) for tracking extrema in
dynamic environments and highly multimodal complex functions described in the
well-know De Jong test suite. Then, for the purpose of comparison, a recent
model of artificial bacterial foraging (BFOA algorithm) based on similar
stigmergic features is described and analyzed. Final results indicate that the
SSA collective intelligence is able to cope and quickly adapt to unforeseen
situations even when over the same cooperative foraging period, the community
is requested to deal with two different and contradictory purposes, while
outperforming BFOA in adaptive speed.
| [
{
"version": "v1",
"created": "Thu, 1 Dec 2005 04:52:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ramos",
"Vitorino",
""
],
[
"Fernandes",
"Carlos",
""
],
[
"Rosa",
"Agostinho C.",
""
]
]
| new_dataset | 0.999706 |
cs/0512007 | Arindam Mitra | Arindam Mitra | Entangled messages | PDF, 2 Pages | null | null | null | cs.CR cs.IR | null | It is sometimes necessary to send copies of the same email to different
parties, but it is impossible to ensure that if one party reads the message the
other parties will bound to read it. We propose an entanglement based scheme
where if one party reads the message the other party will bound to read it
simultaneously.
| [
{
"version": "v1",
"created": "Thu, 1 Dec 2005 15:40:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mitra",
"Arindam",
""
]
]
| new_dataset | 0.958579 |
cs/0512031 | Slawomir Lasota | Slawomir Lasota and Igor Walukiewicz | Alternating Timed Automata | the full version of the Fossacs'05 conference preliminary paper
revised according ot the referee's comments | null | null | null | cs.LO | null | A notion of alternating timed automata is proposed. It is shown that such
automata with only one clock have decidable emptiness problem over finite
words. This gives a new class of timed languages which is closed under boolean
operations and which has an effective presentation. We prove that the
complexity of the emptiness problem for alternating timed automata with one
clock is non-primitive recursive. The proof gives also the same lower bound for
the universality problem for nondeterministic timed automata with one clock. We
investigate extension of the model with epsilon-transitions and prove that
emptiness is undecidable. Over infinite words, we show undecidability of the
universality problem.
| [
{
"version": "v1",
"created": "Thu, 8 Dec 2005 08:50:35 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Aug 2006 14:56:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lasota",
"Slawomir",
""
],
[
"Walukiewicz",
"Igor",
""
]
]
| new_dataset | 0.963289 |
cs/0512042 | Xiaoyang Gu | Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo | Points on Computable Curves | 10 pages, 12 pages appendix | null | null | null | cs.CC cs.CG | null | The ``analyst's traveling salesman theorem'' of geometric measure theory
characterizes those subsets of Euclidean space that are contained in curves of
finite length. This result, proven for the plane by Jones (1990) and extended
to higher-dimensional Euclidean spaces by Okikiolu (1991), says that a bounded
set $K$ is contained in some curve of finite length if and only if a certain
``square beta sum'', involving the ``width of $K$'' in each element of an
infinite system of overlapping ``tiles'' of descending size, is finite.
In this paper we characterize those {\it points} of Euclidean space that lie
on {\it computable} curves of finite length by formulating and proving a
computable extension of the analyst's traveling salesman theorem. Our extension
says that a point in Euclidean space lies on some computable curve of finite
length if and only if it is ``permitted'' by some computable ``Jones
constriction''. A Jones constriction here is an explicit assignment of a
rational cylinder to each of the above-mentioned tiles in such a way that, when
the radius of the cylinder corresponding to a tile is used in place of the
``width of $K$'' in each tile, the square beta sum is finite. A point is
permitted by a Jones constriction if it is contained in the cylinder assigned
to each tile containing the point. The main part of our proof is the
construction of a computable curve of finite length traversing all the points
permitted by a given Jones constriction. Our construction uses the main ideas
of Jones's ``farthest insertion'' construction, but our algorithm for computing
the curve must work exclusively with the Jones constriction itself, because it
has no direct access to the (typically uncomputable) points permitted by the
Jones constriction.
| [
{
"version": "v1",
"created": "Sat, 10 Dec 2005 03:08:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gu",
"Xiaoyang",
""
],
[
"Lutz",
"Jack H.",
""
],
[
"Mayordomo",
"Elvira",
""
]
]
| new_dataset | 0.999597 |
cs/0512062 | Matteo Gagliolo | Juergen Schmidhuber, Matteo Gagliolo, Daan Wierstra, Faustino Gomez | Evolino for recurrent support vector machines | 10 pages, 2 figures | null | null | IDSIA-19-05 version 2.0 | cs.NE | null | Traditional Support Vector Machines (SVMs) need pre-wired finite time windows
to predict and classify time series. They do not have an internal state
necessary to deal with sequences involving arbitrary long-term dependencies.
Here we introduce a new class of recurrent, truly sequential SVM-like devices
with internal adaptive states, trained by a novel method called EVOlution of
systems with KErnel-based outputs (Evoke), an instance of the recent Evolino
class of methods. Evoke evolves recurrent neural networks to detect and
represent temporal dependencies while using quadratic programming/support
vector regression to produce precise outputs. Evoke is the first SVM-based
mechanism learning to classify a context-sensitive language. It also
outperforms recent state-of-the-art gradient-based recurrent neural networks
(RNNs) on various time series prediction tasks.
| [
{
"version": "v1",
"created": "Thu, 15 Dec 2005 15:05:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Schmidhuber",
"Juergen",
""
],
[
"Gagliolo",
"Matteo",
""
],
[
"Wierstra",
"Daan",
""
],
[
"Gomez",
"Faustino",
""
]
]
| new_dataset | 0.989678 |
cs/0512064 | Martin Kutz | Martin Kutz | Computing shortest non-trivial cycles on orientable surfaces of bounded
genus in almost linear time | 13 pages, 7 figures | null | null | null | cs.CG | null | We present an algorithm that computes a shortest non-contractible and a
shortest non-separating cycle on an orientable combinatorial surface of bounded
genus in O(n \log n) time, where n denotes the complexity of the surface. This
solves a central open problem in computational topology, improving upon the
current-best O(n^{3/2})-time algorithm by Cabello and Mohar (ESA 2005). Our
algorithm uses universal-cover constructions to find short cycles and makes
extensive use of existing tools from the field.
| [
{
"version": "v1",
"created": "Thu, 15 Dec 2005 17:02:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kutz",
"Martin",
""
]
]
| new_dataset | 0.997079 |
cs/0512080 | Grigorii Pivovarov | G. B. Pivovarov and S. E. Trunov | EqRank: Theme Evolution in Citation Graphs | 8 pages, 7 figs, 2 tables | null | null | null | cs.DS cs.DL | null | Time evolution of the classification scheme generated by the EqRank algorithm
is studied with hep-th citation graph as an example. Intuitive expectations
about evolution of an adequate classification scheme for a growing set of
objects are formulated. Evolution compliant with these expectations is called
natural. It is demonstrated that EqRank yields a naturally evolving
classification scheme. We conclude that EqRank can be used as a means to detect
new scientific themes, and to track their development.
| [
{
"version": "v1",
"created": "Tue, 20 Dec 2005 14:01:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pivovarov",
"G. B.",
""
],
[
"Trunov",
"S. E.",
""
]
]
| new_dataset | 0.962479 |
cs/0601010 | Xiaowen Zhang | Xiaowen Zhang, Li Shu, Ke Tang | Multi-Map Orbit Hopping Chaotic Stream Cipher | 9 pages | null | null | null | cs.CR | null | In this paper we propose a multi-map orbit hopping chaotic stream cipher that
utilizes the idea of spread spectrum mechanism for secure digital
communications and fundamental chaos characteristics of mixing, unpredictable,
and extremely sensitive to initial conditions. The design, key and subkeys, and
detail implementation of the system are addressed. A variable number of well
studied chaotic maps form a map bank. And the key determines how the system
hops between multiple orbits, and it also determines the number of maps, the
number of orbits for each map, and the number of sample points for each orbits.
A detailed example is provided.
| [
{
"version": "v1",
"created": "Thu, 5 Jan 2006 21:52:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zhang",
"Xiaowen",
""
],
[
"Shu",
"Li",
""
],
[
"Tang",
"Ke",
""
]
]
| new_dataset | 0.999448 |
cs/0601021 | Alexander Haubold | Alexander Haubold | Lighting Control using Pressure-Sensitive Touchpads | null | null | null | null | cs.HC | null | We introduce a novel approach to control physical lighting parameters by
means of a pressure-sensitive touchpad. The two-dimensional area of the
touchpad is subdivided into 5 virtual sliders, each controlling the intensity
of a color (red, green, blue, yellow, and white). The physical interaction
methodology is modeled directly after ubiquitous mechanical sliders and dimmers
which tend to be used for intensity/volume control. Our abstraction to a
pressure-sensitive touchpad provides advantages and introduces additional
benefits over such existing devices.
| [
{
"version": "v1",
"created": "Sat, 7 Jan 2006 11:06:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Haubold",
"Alexander",
""
]
]
| new_dataset | 0.956214 |
cs/0601034 | Vicky Weissman | Joseph Y. Halpern and Vicky Weissman | Using First-Order Logic to Reason about Policies | 39 pages, earlier version in Proceedings of the Sixteenth IEEE
Computer Security Foundations Workshop, 2003, pp. 187-201 | null | null | null | cs.LO cs.CR | null | A policy describes the conditions under which an action is permitted or
forbidden. We show that a fragment of (multi-sorted) first-order logic can be
used to represent and reason about policies. Because we use first-order logic,
policies have a clear syntax and semantics. We show that further restricting
the fragment results in a language that is still quite expressive yet is also
tractable. More precisely, questions about entailment, such as `May Alice
access the file?', can be answered in time that is a low-order polynomial
(indeed, almost linear in some cases), as can questions about the consistency
of policy sets.
| [
{
"version": "v1",
"created": "Tue, 10 Jan 2006 04:30:49 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Jan 2006 12:58:59 GMT"
},
{
"version": "v3",
"created": "Mon, 15 May 2006 15:10:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Halpern",
"Joseph Y.",
""
],
[
"Weissman",
"Vicky",
""
]
]
| new_dataset | 0.998466 |
cs/0601057 | Vedran Kordic | Musa Mailah, Endra Pitowarno & Hishamuddin Jamaluddin | Robust Motion Control for Mobile Manipulator Using Resolved Acceleration
and Proportional-Integral Active Force Control | null | International Journal of Advanced Robotics Systems, Vol.2No2.
(2005) | null | null | cs.RO | null | A resolved acceleration control (RAC) and proportional-integral active force
control (PIAFC) is proposed as an approach for the robust motion control of a
mobile manipulator (MM) comprising a differentially driven wheeled mobile
platform with a two-link planar arm mounted on top of the platform. The study
emphasizes on the integrated kinematic and dynamic control strategy in which
the RAC is used to manipulate the kinematic component while the PIAFC is
implemented to compensate the dynamic effects including the bounded
known/unknown disturbances and uncertainties. The effectivenss and robustness
of the proposed scheme are investigated through a rigorous simulation study and
later complemented with experimental results obtained through a number of
experiments performed on a fully developed working prototype in a laboratory
environment. A number of disturbances in the form of vibratory and impact
forces are deliberately introduced into the system to evaluate the system
performances. The investigation clearly demonstrates the extreme robustness
feature of the proposed control scheme compared to other systems considered in
the study.
| [
{
"version": "v1",
"created": "Sat, 14 Jan 2006 08:14:10 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mailah",
"Musa",
""
],
[
"Pitowarno",
"Endra",
""
],
[
"Jamaluddin",
"Hishamuddin",
""
]
]
| new_dataset | 0.998743 |
cs/0601058 | Vedran Kordic | Michael Sdahl & Bernd Kuhlenkoetter | CAGD - Computer Aided Gripper Design for a Flexible Gripping System | null | International Journal of Advanced Robotics Systems, Vol.2No2.
(2005) | null | null | cs.RO | null | This paper is a summary of the recently accomplished research work on
flexible gripping systems. The goal is to develop a gripper which can be used
for a great amount of geometrically variant workpieces. The economic aspect is
of particular importance during the whole development. The high flexibility of
the gripper is obtained by three parallel used principles. These are human and
computer based analysis of the gripping object as well as mechanical adaptation
of the gripper to the object with the help of servo motors. The focus is on the
gripping of free-form surfaces with suction cup.
| [
{
"version": "v1",
"created": "Sat, 14 Jan 2006 08:15:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Sdahl",
"Michael",
""
],
[
"Kuhlenkoetter",
"Bernd",
""
]
]
| new_dataset | 0.99551 |
cs/0601064 | Vedran Kordic | Chua Kia & Mohd Rizal Arshad | Robotics Vision-based Heuristic Reasoning for Underwater Target Tracking
and Navigation | www.ars-journal.com | International Journal of Advanced Robotics Systems, Vol.2No3.
(2005) | null | null | cs.RO | null | This paper presents a robotics vision-based heuristic reasoning system for
underwater target tracking and navigation. This system is introduced to improve
the level of automation of underwater Remote Operated Vehicles (ROVs)
operations. A prototype which combines computer vision with an underwater
robotics system is successfully designed and developed to perform target
tracking and intelligent navigation. ...
| [
{
"version": "v1",
"created": "Sat, 14 Jan 2006 08:34:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kia",
"Chua",
""
],
[
"Arshad",
"Mohd Rizal",
""
]
]
| new_dataset | 0.977848 |
cs/0601068 | Sorav Bansal | Sorav Bansal | Checkbochs: Use Hardware to Check Software | 4 pages, 4 figures | null | null | null | cs.OS cs.CR | null | In this paper, we present a system called Checkbochs, a machine simulator
that checks rules about its guest operating system and applications at the
hardware level. The properties to be checked can be implemented as `plugins' in
the Checkbochs simulator. Some of the properties that were checked using
Checkbochs include null-pointer checks, format-string vulnerabilities,
user/kernel pointer checks, and race-conditions. On implementing these checks,
we were able to uncover previously-unknown bugs in widely used Linux
distributions. We also tested our tools on undergraduate coursework, and found
numerous bugs.
| [
{
"version": "v1",
"created": "Sat, 14 Jan 2006 23:21:31 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bansal",
"Sorav",
""
]
]
| new_dataset | 0.992883 |
cs/0601071 | Antonio J. Fernandez | Antonio J. Fernandez, Teresa Hortala-Gonzalez, Fernando Saenz-Perez
and Rafael del Vado-Virseda | Constraint Functional Logic Programming over Finite Domains | Accepted for publication in Theory and Practice of Logic programming
(TPLP); 47 pages | null | null | null | cs.PL | null | In this paper, we present our proposal to Constraint Functional Logic
Programming over Finite Domains (CFLP(FD)) with a lazy functional logic
programming language which seamlessly embodies finite domain (FD) constraints.
This proposal increases the expressiveness and power of constraint logic
programming over finite domains (CLP(FD)) by combining functional and
relational notation, curried expressions, higher-order functions, patterns,
partial applications, non-determinism, lazy evaluation, logical variables,
types, domain variables, constraint composition, and finite domain constraints.
We describe the syntax of the language, its type discipline, and its
declarative and operational semantics. We also describe TOY(FD), an
implementation for CFLPFD(FD), and a comparison of our approach with respect to
CLP(FD) from a programming point of view, showing the new features we
introduce. And, finally, we show a performance analysis which demonstrates that
our implementation is competitive with respect to existing CLP(FD) systems and
that clearly outperforms the closer approach to CFLP(FD).
| [
{
"version": "v1",
"created": "Mon, 16 Jan 2006 11:45:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Fernandez",
"Antonio J.",
""
],
[
"Hortala-Gonzalez",
"Teresa",
""
],
[
"Saenz-Perez",
"Fernando",
""
],
[
"del Vado-Virseda",
"Rafael",
""
]
]
| new_dataset | 0.983917 |
cs/0601085 | Vicky Weissman | Riccardo Pucella and Vicky Weissman | A Formal Foundation for ODRL | 30 pgs, preliminary version presented at WITS-04 (Workshop on Issues
in the Theory of Security), 2004 | null | null | null | cs.LO cs.CR | null | ODRL is a popular XML-based language for stating the conditions under which
resources can be accessed legitimately. The language is described in English
and, as a result, agreements written in ODRL are open to interpretation. To
address this problem, we propose a formal semantics for a representative
fragment of the language. We use this semantics to determine precisely when a
permission is implied by a set of ODRL statements and show that answering such
questions is a decidable NP-hard problem. Finally, we define a tractable
fragment of ODRL that is also fairly expressive.
| [
{
"version": "v1",
"created": "Thu, 19 Jan 2006 02:41:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pucella",
"Riccardo",
""
],
[
"Weissman",
"Vicky",
""
]
]
| new_dataset | 0.99974 |
cs/0601086 | Stephen Cook | Stephen Cook | Comments on Beckmann's Uniform Reducts | null | null | null | null | cs.CC | null | Arnold Beckmann defined the uniform reduct of a propositional proof system f
to be the set of those bounded arithmetical formulas whose propositional
translations have polynomial size f-proofs. We prove that the uniform reduct of
f + Extended Frege consists of all true bounded arithmetical formulas iff f +
Extended Frege simulates every proof system.
| [
{
"version": "v1",
"created": "Thu, 19 Jan 2006 22:56:49 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jan 2006 18:08:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cook",
"Stephen",
""
]
]
| new_dataset | 0.993163 |
cs/0601105 | Vassilios Vassiliadis | Vassilios S. Vassiliadis | The Perceptron Algorithm: Image and Signal Decomposition, Compression,
and Analysis by Iterative Gaussian Blurring | null | null | null | null | cs.CV | null | A novel algorithm for tunable compression to within the precision of
reproduction targets, or storage, is proposed. The new algorithm is termed the
`Perceptron Algorithm', which utilises simple existing concepts in a novel way,
has multiple immediate commercial application aspects as well as it opens up a
multitude of fronts in computational science and technology. The aims of this
paper are to present the concepts underlying the algorithm, observations by its
application to some example cases, and the identification of a multitude of
potential areas of applications such as: image compression by orders of
magnitude, signal compression including sound as well, image analysis in a
multilayered detailed analysis, pattern recognition and matching and rapid
database searching (e.g. face recognition), motion analysis, biomedical
applications e.g. in MRI and CAT scan image analysis and compression, as well
as hints on the link of these ideas to the way how biological memory might work
leading to new points of view in neural computation. Commercial applications of
immediate interest are the compression of images at the source (e.g.
photographic equipment, scanners, satellite imaging systems), DVD film
compression, pay-per-view downloads acceleration and many others identified in
the present paper at its conclusion and future work section.
| [
{
"version": "v1",
"created": "Tue, 24 Jan 2006 17:23:17 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Jan 2006 10:40:53 GMT"
},
{
"version": "v3",
"created": "Thu, 26 Jan 2006 08:42:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vassiliadis",
"Vassilios S.",
""
]
]
| new_dataset | 0.99885 |
cs/0602059 | Suchitra Manepalli | Suchitra Manepalli, Giridhar Manepalli, Michael L. Nelson | D2D: Digital Archive to MPEG-21 DIDL | 28 pages, 8 figures | null | null | null | cs.DL | null | Digital Archive to MPEG-21 DIDL (D2D) analyzes the contents of the digital
archive and produces an MPEG-21 Digital Item Declaration Language (DIDL)
encapsulating the analysis results. DIDL is an extensible XML-based language
that aggregates resources and the metadata. We provide a brief report on
several analysis techniques applied on the digital archive by the D2D and
provide an evaluation of its run-time performance.
| [
{
"version": "v1",
"created": "Wed, 15 Feb 2006 22:18:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Manepalli",
"Suchitra",
""
],
[
"Manepalli",
"Giridhar",
""
],
[
"Nelson",
"Michael L.",
""
]
]
| new_dataset | 0.982469 |
cs/0602064 | Ana Romero | A. Romero, J. Rubio, F. Sergeraert | Computing spectral sequences | null | null | null | null | cs.SC | null | In this paper, a set of programs enhancing the Kenzo system is presented.
Kenzo is a Common Lisp program designed for computing in Algebraic Topology, in
particular it allows the user to calculate homology and homotopy groups of
complicated spaces. The new programs presented here entirely compute Serre and
Eilenberg-Moore spectral sequences, in particular the groups and differential
maps for arbitrary r. They also determine when the spectral sequence has
converged and describe the filtration of the target homology groups induced by
the spectral sequence.
| [
{
"version": "v1",
"created": "Fri, 17 Feb 2006 12:29:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Romero",
"A.",
""
],
[
"Rubio",
"J.",
""
],
[
"Sergeraert",
"F.",
""
]
]
| new_dataset | 0.987263 |
cs/0602095 | Joseph O'Rourke | Mirela Damian, Robin Flatland, Joseph O'Rourke | Epsilon-Unfolding Orthogonal Polyhedra | 23 pages, 20 figures, 7 references. Revised version improves language
and figures, updates references, and sharpens the conclusion | null | null | null | cs.CG | null | An unfolding of a polyhedron is produced by cutting the surface and
flattening to a single, connected, planar piece without overlap (except
possibly at boundary points). It is a long unsolved problem to determine
whether every polyhedron may be unfolded. Here we prove, via an algorithm, that
every orthogonal polyhedron (one whose faces meet at right angles) of genus
zero may be unfolded. Our cuts are not necessarily along edges of the
polyhedron, but they are always parallel to polyhedron edges. For a polyhedron
of n vertices, portions of the unfolding will be rectangular strips which, in
the worst case, may need to be as thin as epsilon = 1/2^{Omega(n)}.
| [
{
"version": "v1",
"created": "Mon, 27 Feb 2006 17:03:19 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Mar 2006 14:11:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Damian",
"Mirela",
""
],
[
"Flatland",
"Robin",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.99933 |
cs/0602098 | M. H. van Emden | M.H. van Emden | Compositional Semantics for the Procedural Interpretation of Logic | 17 pages; no figures | null | null | DCS-307-IR | cs.PL | null | Semantics of logic programs has been given by proof theory, model theory and
by fixpoint of the immediate-consequence operator. If clausal logic is a
programming language, then it should also have a compositional semantics.
Compositional semantics for programming languages follows the abstract syntax
of programs, composing the meaning of a unit by a mathematical operation on the
meanings of its constituent units. The procedural interpretation of logic has
only yielded an incomplete abstract syntax for logic programs. We complete it
and use the result as basis of a compositional semantics. We present for
comparison Tarski's algebraization of first-order predicate logic, which is in
substance the compositional semantics for his choice of syntax. We characterize
our semantics by equivalence with the immediate-consequence operator.
| [
{
"version": "v1",
"created": "Tue, 28 Feb 2006 19:28:31 GMT"
},
{
"version": "v2",
"created": "Sun, 7 May 2006 17:41:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"van Emden",
"M. H.",
""
]
]
| new_dataset | 0.997778 |
cs/0603001 | Alois Schl\"ogl | Alois Schl\"ogl | BioSig - An application of Octave | 6 pages, submission for the Octave 2006 meeting | null | null | Octave2006/16 | cs.MS | null | BioSig is an open source software library for biomedical signal processing.
Most users in the field are using Matlab; however, significant effort was
undertaken to provide compatibility to Octave, too. This effort has been widely
successful, only some non-critical components relying on a graphical user
interface are missing. Now, installing BioSig on Octave is as easy as on
Matlab. Moreover, a benchmark test based on BioSig has been developed and the
benchmark results of several platforms are presented.
| [
{
"version": "v1",
"created": "Wed, 1 Mar 2006 15:45:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Schlögl",
"Alois",
""
]
]
| new_dataset | 0.994689 |
cs/0603056 | Philip Davis | Philip M. Davis and Michael J. Fromerth | Does the arXiv lead to higher citations and reduced publisher downloads
for mathematics articles? | Last updated May 02, 2006 | Scientometrics Vol. 71, No. 2. (May, 2007) | 10.1007/s11192-007-1661-8 | null | cs.DL cs.IR math.HO | null | An analysis of 2,765 articles published in four math journals from 1997 to
2005 indicate that articles deposited in the arXiv received 35% more citations
on average than non-deposited articles (an advantage of about 1.1 citations per
article), and that this difference was most pronounced for highly-cited
articles. Open Access, Early View, and Quality Differential were examined as
three non-exclusive postulates for explaining the citation advantage. There was
little support for a universal Open Access explanation, and no empirical
support for Early View. There was some inferential support for a Quality
Differential brought about by more highly-citable articles being deposited in
the arXiv. In spite of their citation advantage, arXiv-deposited articles
received 23% fewer downloads from the publisher's website (about 10 fewer
downloads per article) in all but the most recent two years after publication.
The data suggest that arXiv and the publisher's website may be fulfilling
distinct functional needs of the reader.
| [
{
"version": "v1",
"created": "Tue, 14 Mar 2006 19:36:24 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Mar 2006 21:08:20 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Mar 2006 17:34:40 GMT"
},
{
"version": "v4",
"created": "Tue, 2 May 2006 19:28:01 GMT"
},
{
"version": "v5",
"created": "Tue, 6 Feb 2007 14:52:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Davis",
"Philip M.",
""
],
[
"Fromerth",
"Michael J.",
""
]
]
| new_dataset | 0.997163 |
cs/0603069 | Xueliang Li | Fengwei Li, Xueliang Li | The neighbor-scattering number can be computed in polynomial time for
interval graphs | 13 pages | null | null | null | cs.DM math.CO | null | Neighbor-scattering number is a useful measure for graph vulnerability. For
some special kinds of graphs, explicit formulas are given for this number.
However, for general graphs it is shown that to compute this number is
NP-complete. In this paper, we prove that for interval graphs this number can
be computed in polynomial time.
| [
{
"version": "v1",
"created": "Fri, 17 Mar 2006 07:00:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Fengwei",
""
],
[
"Li",
"Xueliang",
""
]
]
| new_dataset | 0.999711 |
cs/0603073 | Bryan Ford | Bryan Ford | VXA: A Virtual Architecture for Durable Compressed Archives | 14 pages, 7 figures, 2 tables | 4th USENIX Conference on File and Storage Technologies, December
2005 (FAST '05), San Francisco, CA | null | null | cs.DL cs.IR | null | Data compression algorithms change frequently, and obsolete decoders do not
always run on new hardware and operating systems, threatening the long-term
usability of content archived using those algorithms. Re-encoding content into
new formats is cumbersome, and highly undesirable when lossy compression is
involved. Processor architectures, in contrast, have remained comparatively
stable over recent decades. VXA, an archival storage system designed around
this observation, archives executable decoders along with the encoded content
it stores. VXA decoders run in a specialized virtual machine that implements an
OS-independent execution environment based on the standard x86 architecture.
The VXA virtual machine strictly limits access to host system services, making
decoders safe to run even if an archive contains malicious code. VXA's adoption
of a "native" processor architecture instead of type-safe language technology
allows reuse of existing "hand-optimized" decoders in C and assembly language,
and permits decoders access to performance-enhancing architecture features such
as vector processing instructions. The performance cost of VXA's virtualization
is typically less than 15% compared with the same decoders running natively.
The storage cost of archived decoders, typically 30-130KB each, can be
amortized across many archived files sharing the same compression method.
| [
{
"version": "v1",
"created": "Sat, 18 Mar 2006 16:31:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ford",
"Bryan",
""
]
]
| new_dataset | 0.997216 |
cs/0603074 | Bryan Ford | Bryan Ford, Pyda Srisuresh, Dan Kegel | Peer-to-Peer Communication Across Network Address Translators | 8 figures, 1 table | USENIX Annual Technical Conference, April 2005 (USENIX '05),
Anaheim, CA | null | null | cs.NI cs.CR | null | Network Address Translation (NAT) causes well-known difficulties for
peer-to-peer (P2P) communication, since the peers involved may not be reachable
at any globally valid IP address. Several NAT traversal techniques are known,
but their documentation is slim, and data about their robustness or relative
merits is slimmer. This paper documents and analyzes one of the simplest but
most robust and practical NAT traversal techniques, commonly known as "hole
punching." Hole punching is moderately well-understood for UDP communication,
but we show how it can be reliably used to set up peer-to-peer TCP streams as
well. After gathering data on the reliability of this technique on a wide
variety of deployed NATs, we find that about 82% of the NATs tested support
hole punching for UDP, and about 64% support hole punching for TCP streams. As
NAT vendors become increasingly conscious of the needs of important P2P
applications such as Voice over IP and online gaming protocols, support for
hole punching is likely to increase in the future.
| [
{
"version": "v1",
"created": "Sat, 18 Mar 2006 16:51:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ford",
"Bryan",
""
],
[
"Srisuresh",
"Pyda",
""
],
[
"Kegel",
"Dan",
""
]
]
| new_dataset | 0.976092 |
cs/0603076 | Bryan Ford | Bryan Ford, Jacob Strauss, Chris Lesniewski-Laas, Sean Rhea, Frans
Kaashoek, Robert Morris | User-Relative Names for Globally Connected Personal Devices | 7 pages, 1 figure, 1 table | 5th International Workshop on Peer-to-Peer Systems, February 2006
(IPTPS 2006), Santa Barbara, CA | null | null | cs.NI cs.DC cs.OS | null | Nontechnical users who own increasingly ubiquitous network-enabled personal
devices such as laptops, digital cameras, and smart phones need a simple,
intuitive, and secure way to share information and services between their
devices. User Information Architecture, or UIA, is a novel naming and
peer-to-peer connectivity architecture addressing this need. Users assign UIA
names by "introducing" devices to each other on a common local-area network,
but these names remain securely bound to their target as devices migrate.
Multiple devices owned by the same user, once introduced, automatically merge
their namespaces to form a distributed "personal cluster" that the owner can
access or modify from any of his devices. Instead of requiring users to
allocate globally unique names from a central authority, UIA enables users to
assign their own "user-relative" names both to their own devices and to other
users. With UIA, for example, Alice can always access her iPod from any of her
own personal devices at any location via the name "ipod", and her friend Bob
can access her iPod via a relative name like "ipod.Alice".
| [
{
"version": "v1",
"created": "Sat, 18 Mar 2006 17:27:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ford",
"Bryan",
""
],
[
"Strauss",
"Jacob",
""
],
[
"Lesniewski-Laas",
"Chris",
""
],
[
"Rhea",
"Sean",
""
],
[
"Kaashoek",
"Frans",
""
],
[
"Morris",
"Robert",
""
]
]
| new_dataset | 0.989781 |
cs/0603079 | Maria Chiara Meo | Maurizio Gabbrielli and Maria Chiara Meo | A compositional Semantics for CHR | null | null | null | null | cs.PL | null | Constraint Handling Rules (CHR) are a committed-choice declarative language
which has been designed for writing constraint solvers. A CHR program consists
of multi-headed guarded rules which allow one to rewrite constraints into
simpler ones until a solved form is reached.
CHR has received a considerable attention, both from the practical and from
the theoretical side. Nevertheless, due the use of multi-headed clauses, there
are several aspects of the CHR semantics which have not been clarified yet. In
particular, no compositional semantics for CHR has been defined so far.
In this paper we introduce a fix-point semantics which characterizes the
input/output behavior of a CHR program and which is and-compositional, that is,
which allows to retrieve the semantics of a conjunctive query from the
semantics of its components. Such a semantics can be used as a basis to define
incremental and modular analysis and verification tools.
| [
{
"version": "v1",
"created": "Mon, 20 Mar 2006 14:17:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gabbrielli",
"Maurizio",
""
],
[
"Meo",
"Maria Chiara",
""
]
]
| new_dataset | 0.992228 |
cs/0603091 | Himanshu Thapliyal | Himanshu Thapliyal and M.B Srinivas | A New Reversible TSG Gate and Its Application For Designing Efficient
Adder Circuits | 5 Pages: Published in 7th International Symposium on Representations
and Methodology of Future Computing Technologies(RM 2005), Tokyo, Japan,
September 5-6, 2005 | null | null | null | cs.AR | null | In the recent years, reversible logic has emerged as a promising technology
having its applications in low power CMOS, quantum computing, nanotechnology,
and optical computing. The classical set of gates such as AND, OR, and EXOR are
not reversible. This paper proposes a new 4 * 4 reversible gate called TSG
gate. The proposed gate is used to design efficient adder units. The most
significant aspect of the proposed gate is that it can work singly as a
reversible full adder i.e reversible full adder can now be implemented with a
single gate only. The proposed gate is then used to design reversible ripple
carry and carry skip adders. It is demonstrated that the adder architectures
designed using the proposed gate are much better and optimized, compared to
their existing counterparts in literature; in terms of number of reversible
gates and garbage outputs. Thus, this paper provides the initial threshold to
building of more complex system which can execute more complicated operations
using reversible logic.
| [
{
"version": "v1",
"created": "Thu, 23 Mar 2006 06:44:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thapliyal",
"Himanshu",
""
],
[
"Srinivas",
"M. B",
""
]
]
| new_dataset | 0.987894 |
cs/0603092 | Himanshu Thapliyal | Himanshu Thapliyal and M.B Srinivas | An Extension to DNA Based Fredkin Gate Circuits: Design of Reversible
Sequential Circuits using Fredkin Gates | 7 Pages: Deals with design of reversible sequential circuits.
Published: Proceedings of SPIE Volume: 6050, pp.196-202.Optomechatronic
Micro/Nano Devices and Components, Sapporo, Japan, December 5-7, 2005;
Editor(s): Yoshitada Katagiri | null | null | null | cs.AR | null | In recent years, reversible logic has emerged as a promising computing
paradigm having its applications in low power computing, quantum computing,
nanotechnology, optical computing and DNA computing. The classical set of gates
such as AND, OR, and EXOR are not reversible. Recently, it has been shown how
to encode information in DNA and use DNA amplification to implement Fredkin
gates. Furthermore, in the past Fredkin gates have been constructed using DNA,
whose outputs are used as inputs for other Fredkin gates. Thus, it can be
concluded that arbitrary circuits of Fredkin gates can be constructed using
DNA. This paper provides the initial threshold to building of more complex
system having reversible sequential circuits and which can execute more
complicated operations. The novelty of the paper is the reversible designs of
sequential circuits using Fredkin gate. Since, Fredkin gate has already been
realized using DNA, it is expected that this work will initiate the building of
complex systems using DNA. The reversible circuits designed here are highly
optimized in terms of number of gates and garbage outputs. The modularization
approach that is synthesizing small circuits and thereafter using them to
construct bigger circuits is used for designing the optimal reversible
sequential circuits.
| [
{
"version": "v1",
"created": "Thu, 23 Mar 2006 08:33:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thapliyal",
"Himanshu",
""
],
[
"Srinivas",
"M. B",
""
]
]
| new_dataset | 0.962628 |
cs/0603099 | Alin Suciu PhD | Alin Suciu, Rodica Potolea, Tudor Muresan | Benchmark Problems for Constraint Solving | null | null | null | null | cs.PF cs.SC | null | Constraint Programming is roughly a new software technology introduced by
Jaffar and Lassez in 1987 for description and effective solving of large,
particularly combinatorial, problems especially in areas of planning and
scheduling. In the following we define three problems for constraint solving
from the domain of electrical networks; based on them we define 43 related
problems. For the defined set of problems we benchmarked five systems: ILOG
OPL, AMPL, GAMS, Mathematica and UniCalc. As expected some of the systems
performed very well for some problems while others performed very well on
others.
| [
{
"version": "v1",
"created": "Sun, 26 Mar 2006 20:19:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Suciu",
"Alin",
""
],
[
"Potolea",
"Rodica",
""
],
[
"Muresan",
"Tudor",
""
]
]
| new_dataset | 0.998016 |
cs/0603101 | Alin Suciu PhD | Alin Suciu, Kalman Pusztai, Andrei Vancea | Prolog Server Pages | null | null | null | null | cs.NI cs.PL | null | Prolog Server Pages (PSP) is a scripting language, based on Prolog, than can
be embedded in HTML documents. To run PSP applications one needs a web server,
a web browser and a PSP interpreter. The code is executed, by the interpreter,
on the server-side (web server) and the output (together with the html code in
witch the PSP code is embedded) is sent to the client-side (browser). The
current implementation supports Apache Web Server. We implemented an Apache web
server module that handles PSP files, and sends the result (an html document)
to the client. PSP supports both GET and POST http requests. It also provides
methods for working with http cookies.
| [
{
"version": "v1",
"created": "Sun, 26 Mar 2006 20:35:56 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Suciu",
"Alin",
""
],
[
"Pusztai",
"Kalman",
""
],
[
"Vancea",
"Andrei",
""
]
]
| new_dataset | 0.999729 |
cs/0603121 | Scott Turner | Scott Turner, Manuel A. Perez-Quinones and Stephen H. Edwards | minimUML: A Minimalist Approach to UML Diagraming for Early Computer
Science Education | 38 pages, 15 figures | null | null | null | cs.HC cs.SE | null | The Unified Modeling Language (UML) is commonly used in introductory Computer
Science to teach basic object-oriented design. However, there appears to be a
lack of suitable software to support this task. Many of the available programs
that support UML focus on developing code and not on enhancing learning. Those
that were designed for educational use sometimes have poor interfaces or are
missing common and important features, such as multiple selection and
undo/redo. There is a need for software that is tailored to an instructional
environment and has all the useful and needed functionality for that specific
task. This is the purpose of minimUML. minimUML provides a minimum amount of
UML, just what is commonly used in beginning programming classes, while
providing a simple, usable interface. In particular, minimUML was designed to
support abstract design while supplying features for exploratory learning and
error avoidance. In addition, it allows for the annotation of diagrams, through
text or freeform drawings, so students can receive feedback on their work.
minimUML was developed with the goal of supporting ease of use, supporting
novice students, and a requirement of no prior-training for its use.
| [
{
"version": "v1",
"created": "Thu, 30 Mar 2006 06:12:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Turner",
"Scott",
""
],
[
"Perez-Quinones",
"Manuel A.",
""
],
[
"Edwards",
"Stephen H.",
""
]
]
| new_dataset | 0.99393 |
cs/0604026 | Damiano Bolzoni | Damiano Bolzoni, Sandro Etalle | APHRODITE: an Anomaly-based Architecture for False Positive Reduction | null | null | null | TR-CTIT-06-13 | cs.CR | null | We present APHRODITE, an architecture designed to reduce false positives in
network intrusion detection systems. APHRODITE works by detecting anomalies in
the output traffic, and by correlating them with the alerts raised by the NIDS
working on the input traffic. Benchmarks show a substantial reduction of false
positives and that APHRODITE is effective also after a "quick setup", i.e. in
the realistic case in which it has not been "trained" and set up optimally
| [
{
"version": "v1",
"created": "Fri, 7 Apr 2006 12:13:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bolzoni",
"Damiano",
""
],
[
"Etalle",
"Sandro",
""
]
]
| new_dataset | 0.998218 |
cs/0604067 | R.N.Mohan Professor | R.N.Mohan, Moon Ho Lee, Subhash Pokrel | Certain t-partite graphs | null | null | null | null | cs.DM | null | By making use of the generalized concept of orthogonality in Latin squares,
certain t-partite graphs have been constructed and a suggestion for a net work
system and some applications have been made.
| [
{
"version": "v1",
"created": "Tue, 18 Apr 2006 09:30:55 GMT"
},
{
"version": "v2",
"created": "Thu, 11 May 2006 00:11:13 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mohan",
"R. N.",
""
],
[
"Lee",
"Moon Ho",
""
],
[
"Pokrel",
"Subhash",
""
]
]
| new_dataset | 0.997763 |
cs/0604073 | Muthiah Annamalai | Muthiah Annamalai, Hemant Kumar, Leela Velusamy | Octave-GTK: A GTK binding for GNU Octave | Comments: Presented at Octave2006 Conference, Washington D.C | null | null | Octave2006/02 | cs.SE | null | This paper discusses the problems faced with interoperability between two
programming languages, with respect to GNU Octave, and GTK API written in C, to
provide the GTK API on Octave.Octave-GTK is the fusion of two different API's:
one exported by GNU Octave [scientific computing tool] and the other GTK [GUI
toolkit]; this enables one to use GTK primitives within GNU Octave, to build
graphical front ends,at the same time using octave engine for number crunching
power. This paper illustrates our implementation of binding logic, and shows
results extended to various other libraries using the same base code generator.
Also shown, are methods of code generation, binding automation, and the niche
we plan to fill in the absence of GUI in Octave. Canonical discussion of
advantages, feasibility and problems faced in the process are elucidated.
| [
{
"version": "v1",
"created": "Wed, 19 Apr 2006 16:46:23 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Apr 2006 18:43:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Annamalai",
"Muthiah",
""
],
[
"Kumar",
"Hemant",
""
],
[
"Velusamy",
"Leela",
""
]
]
| new_dataset | 0.999449 |
cs/0604087 | Yongzhi Cao | Yongzhi Cao, Lirong Xia and Mingsheng Ying | Probabilistic Automata for Computing with Words | 35 pages; 3 figures | null | null | null | cs.AI cs.CL | null | Usually, probabilistic automata and probabilistic grammars have crisp symbols
as inputs, which can be viewed as the formal models of computing with values.
In this paper, we first introduce probabilistic automata and probabilistic
grammars for computing with (some special) words in a probabilistic framework,
where the words are interpreted as probabilistic distributions or possibility
distributions over a set of crisp symbols. By probabilistic conditioning, we
then establish a retraction principle from computing with words to computing
with values for handling crisp inputs and a generalized extension principle
from computing with words to computing with all words for handling arbitrary
inputs. These principles show that computing with values and computing with all
words can be respectively implemented by computing with some special words. To
compare the transition probabilities of two near inputs, we also examine some
analytical properties of the transition probability functions of generalized
extensions. Moreover, the retractions and the generalized extensions are shown
to be equivalence-preserving. Finally, we clarify some relationships among the
retractions, the generalized extensions, and the extensions studied recently by
Qiu and Wang.
| [
{
"version": "v1",
"created": "Sun, 23 Apr 2006 02:58:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cao",
"Yongzhi",
""
],
[
"Xia",
"Lirong",
""
],
[
"Ying",
"Mingsheng",
""
]
]
| new_dataset | 0.988215 |
cs/0604100 | Abhishek Parakh | Abhishek Parakh | Protocols for Kak's Cubic Cipher and Diffie-Hellman Based Asymmetric
Oblivious Key Exchange | 7 pages, with minor typographical corrections. | null | null | null | cs.CR | null | This paper presents protocols for Kak's cubic transformation and proposes a
modification to Diffie-Hellman key exchange protocol in order to achieve
asymmetric oblivious exchange of keys.
| [
{
"version": "v1",
"created": "Tue, 25 Apr 2006 17:39:37 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Apr 2007 17:49:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Parakh",
"Abhishek",
""
]
]
| new_dataset | 0.977491 |
cs/0604113 | Andrea Sportiello | Sergio Caracciolo, Davide Fichera, Andrea Sportiello | One-in-Two-Matching Problem is NP-complete | 30 pages | null | null | null | cs.CC | null | 2-dimensional Matching Problem, which requires to find a matching of left- to
right-vertices in a balanced $2n$-vertex bipartite graph, is a well-known
polynomial problem, while various variants, like the 3-dimensional analogoue
(3DM, with triangles on a tripartite graph), or the Hamiltonian Circuit Problem
(HC, a restriction to ``unicyclic'' matchings) are among the main examples of
NP-hard problems, since the first Karp reduction series of 1972. The same holds
for the weighted variants of these problems, the Linear Assignment Problem
being polynomial, and the Numerical 3-Dimensional Matching and Travelling
Salesman Problem being NP-complete.
In this paper we show that a small modification of the 2-dimensional Matching
and Assignment Problems in which for each $i \leq n/2$ it is required that
either $\pi(2i-1)=2i-1$ or $\pi(2i)=2i$, is a NP-complete problem. The proof is
by linear reduction from SAT (or NAE-SAT), with the size $n$ of the Matching
Problem being four times the number of edges in the factor graph representation
of the boolean problem. As a corollary, in combination with the simple linear
reduction of One-in-Two Matching to 3-Dimensional Matching, we show that SAT
can be linearly reduced to 3DM, while the original Karp reduction was only
cubic.
| [
{
"version": "v1",
"created": "Fri, 28 Apr 2006 16:40:09 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Caracciolo",
"Sergio",
""
],
[
"Fichera",
"Davide",
""
],
[
"Sportiello",
"Andrea",
""
]
]
| new_dataset | 0.994367 |
cs/0605053 | Rajkumar Buyya | Hussein Gibbins and Rajkumar Buyya | Gridscape II: A Customisable and Pluggable Grid Monitoring Portal and
its Integration with Google Maps | 12 pages | null | null | Technical Report, GRIDS-TR-2006-8, Grid Computing and Distributed
Systems Laboratory, The University of Melbourne, Australia, May 12, 2006 | cs.DC | null | Grid computing has emerged as an effective means of facilitating the sharing
of distributed heterogeneous resources, enabling collaboration in large scale
environments. However, the nature of Grid systems, coupled with the
overabundance and fragmentation of information, makes it difficult to monitor
resources, services, and computations in order to plan and make decisions. In
this paper we present Gridscape II, a customisable portal component that can be
used on its own or plugged in to compliment existing Grid portals. Gridscape II
manages the gathering of information from arbitrary, heterogeneous and
distributed sources and presents them together seamlessly within a single
interface. It also leverages the Google Maps API in order to provide a highly
interactive user interface. Gridscape II is simple and easy to use, providing a
solution to those users who do not wish to invest heavily in developing their
own monitoring portal from scratch, and also for those users who want something
that is easy to customise and extend for their specific needs.
| [
{
"version": "v1",
"created": "Fri, 12 May 2006 09:41:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gibbins",
"Hussein",
""
],
[
"Buyya",
"Rajkumar",
""
]
]
| new_dataset | 0.963878 |
cs/0605062 | Al-Mukaddim Khan Pathan | Al-Mukaddim Khan Pathan and Md. Golam Shagadul Amin Talukder | QoSIP: A QoS Aware IP Routing Ptotocol for Multimedia Data | 8th International Conference of Advanced Communication Technology
(ICACT 2006) | null | null | null | cs.NI | null | Conventional IP routing protocols are not suitable for multimedia
applications which have very stringent Quality-of-Service (QoS) demands and
they require a connection oriented service. For multimedia applications it is
expected that the router should be able to forward the packet according to the
demand of the packet and it is necessary to find a path that satisfies the
specific demands of a particular application. In order to address these issues,
in this paper, we have presented a QoS aware IP routing protocol where a router
stores information about the QoS parameters and routes the packet accordingly.
Keywords: IP Routing Protocol, Quality of Service (QoS) parameter, QoSIP,
Selective Flooding.
| [
{
"version": "v1",
"created": "Mon, 15 May 2006 10:39:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pathan",
"Al-Mukaddim Khan",
""
],
[
"Talukder",
"Md. Golam Shagadul Amin",
""
]
]
| new_dataset | 0.99982 |
cs/0605066 | Xiaowen Zhang | Xiaowen Zhang, Ke Tang, Li Shu | A Chaotic Cipher Mmohocc and Its Randomness Evaluation | 8 pages, 4 figures, and 3 tables, submitted to ICCS06 | null | null | null | cs.CR | null | After a brief introduction to a new chaotic stream cipher Mmohocc which
utilizes the fundamental chaos characteristics of mixing, unpredictability, and
sensitivity to initial conditions, we conducted the randomness statistical
tests against the keystreams generated by the cipher. Two batteries of most
stringent randomness tests, namely the NIST Suite and the Diehard Suite, were
performed. The results showed that the keystreams have successfully passed all
the statistical tests. We conclude that Mmohocc can generate high-quality
pseudorandom numbers from a statistical point of view.
| [
{
"version": "v1",
"created": "Mon, 15 May 2006 18:25:35 GMT"
},
{
"version": "v2",
"created": "Tue, 30 May 2006 11:58:10 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zhang",
"Xiaowen",
""
],
[
"Tang",
"Ke",
""
],
[
"Shu",
"Li",
""
]
]
| new_dataset | 0.997963 |
cs/0605088 | Ke Liu | Ke Liu, Adnan Majeed and Nael B. Abu-Ghazaleh | TARMAC: Traffic-Analysis Reslient MAC Protocol for Multi-Hop Wireless
Networks | null | null | null | null | cs.NI cs.CR | null | Traffic analysis in Multi-hop Wireless Networks can expose the structure of
the network allowing attackers to focus their efforts on critical nodes. For
example, jamming the only data sink in a sensor network can cripple the
network. We propose a new communication protocol that is part of the MAC layer,
but resides conceptually between the routing layer and MAC, that is resilient
to traffic analysis. Each node broadcasts the data that it has to transmit
according to a fixed transmission schedule that is independent of the traffic
being generated, making the network immune to time correlation analysis. The
transmission pattern is identical, with the exception of a possible time shift,
at all nodes, removing spatial correlation of transmissions to network
strucutre. Data for all neighbors resides in the same encrypted packet. Each
neighbor then decides which subset of the data in a packet to forward onwards
using a routing protocol whose details are orthogonal to the proposed scheme.
We analyze the basic scheme, exploring the tradeoffs in terms of frequency of
transmission and packet size. We also explore adaptive and time changing
patterns and analyze their performance under a number of representative
scenarios.
| [
{
"version": "v1",
"created": "Fri, 19 May 2006 22:42:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Liu",
"Ke",
""
],
[
"Majeed",
"Adnan",
""
],
[
"Abu-Ghazaleh",
"Nael B.",
""
]
]
| new_dataset | 0.997139 |
cs/0605102 | Shaili Jain | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian
and Ke Yi | Restricted Strip Covering and the Sensor Cover Problem | 14 pages, 6 figures | null | null | null | cs.DS cs.CG | null | Given a set of objects with durations (jobs) that cover a base region, can we
schedule the jobs to maximize the duration the original region remains covered?
We call this problem the sensor cover problem. This problem arises in the
context of covering a region with sensors. For example, suppose you wish to
monitor activity along a fence by sensors placed at various fixed locations.
Each sensor has a range and limited battery life. The problem is to schedule
when to turn on the sensors so that the fence is fully monitored for as long as
possible. This one dimensional problem involves intervals on the real line.
Associating a duration to each yields a set of rectangles in space and time,
each specified by a pair of fixed horizontal endpoints and a height. The
objective is to assign a position to each rectangle to maximize the height at
which the spanning interval is fully covered. We call this one dimensional
problem restricted strip covering. If we replace the covering constraint by a
packing constraint, the problem is identical to dynamic storage allocation, a
scheduling problem that is a restricted case of the strip packing problem. We
show that the restricted strip covering problem is NP-hard and present an O(log
log n)-approximation algorithm. We present better approximations or exact
algorithms for some special cases. For the uniform-duration case of restricted
strip covering we give a polynomial-time, exact algorithm but prove that the
uniform-duration case for higher-dimensional regions is NP-hard. Finally, we
consider regions that are arbitrary sets, and we present an O(log
n)-approximation algorithm.
| [
{
"version": "v1",
"created": "Wed, 24 May 2006 03:27:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Buchsbaum",
"Adam L.",
""
],
[
"Efrat",
"Alon",
""
],
[
"Jain",
"Shaili",
""
],
[
"Venkatasubramanian",
"Suresh",
""
],
[
"Yi",
"Ke",
""
]
]
| new_dataset | 0.981709 |
cs/0605125 | Germain Drolet | Germain Drolet (Department of Electrical & Computer Engineering, Royal
Military College of Canada) | Combinational Logic Circuit Design with the Buchberger Algorithm | 15 pages, 1 table | null | null | null | cs.AR | null | We detail a procedure for the computation of the polynomial form of an
electronic combinational circuit from the design equations in a truth table.
The method uses the Buchberger algorithm rather than current traditional
methods based on search algorithms. We restrict the analysis to a single
output, but the procedure can be generalized to multiple outputs. The procedure
is illustrated with the design of a simple arithmetic and logic unit with two
3-bit operands and two control bits.
| [
{
"version": "v1",
"created": "Fri, 26 May 2006 18:43:13 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Drolet",
"Germain",
"",
"Department of Electrical & Computer Engineering, Royal\n Military College of Canada"
]
]
| new_dataset | 0.982217 |
cs/0605136 | Bourgeois Gerald | Gerald Bourgeois | Attaque algebrique de NTRU a l'aide des vecteurs de Witt | 6 pages; correction of the miscalculations | null | null | null | cs.CR | null | One improves an algebraic attack of NTRU due to Silverman, Smart and
Vercauteren; the latter considered the first 2 bits of a Witt vector attached
to the research of the secret key; here the first 4 bits are considered, which
provides additional equations of degrees 4 and 8.
| [
{
"version": "v1",
"created": "Mon, 29 May 2006 22:42:24 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jun 2006 22:44:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bourgeois",
"Gerald",
""
]
]
| new_dataset | 0.996458 |
cs/0606007 | Andrew Pavlo | Andrew Pavlo (1), Christopher Homan (2), Jonathan Schull (2) ((1)
University of Wisconsin-Madison, (2) Rochester Institute of Technology) | A parent-centered radial layout algorithm for interactive graph
visualization and animation | null | null | null | null | cs.HC cs.CG cs.GR | null | We have developed (1) a graph visualization system that allows users to
explore graphs by viewing them as a succession of spanning trees selected
interactively, (2) a radial graph layout algorithm, and (3) an animation
algorithm that generates meaningful visualizations and smooth transitions
between graphs while minimizing edge crossings during transitions and in static
layouts.
Our system is similar to the radial layout system of Yee et al. (2001), but
differs primarily in that each node is positioned on a coordinate system
centered on its own parent rather than on a single coordinate system for all
nodes. Our system is thus easy to define recursively and lends itself to
parallelization. It also guarantees that layouts have many nice properties,
such as: it guarantees certain edges never cross during an animation.
We compared the layouts and transitions produced by our algorithms to those
produced by Yee et al. Results from several experiments indicate that our
system produces fewer edge crossings during transitions between graph drawings,
and that the transitions more often involve changes in local scaling rather
than structure.
These findings suggest the system has promise as an interactive graph
exploration tool in a variety of settings.
| [
{
"version": "v1",
"created": "Thu, 1 Jun 2006 16:56:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pavlo",
"Andrew",
""
],
[
"Homan",
"Christopher",
""
],
[
"Schull",
"Jonathan",
""
]
]
| new_dataset | 0.984984 |
cs/0606029 | Audun Josang | Audun Josang | Belief Calculus | 22 pages, 10 figures | null | null | null | cs.AI | null | In Dempster-Shafer belief theory, general beliefs are expressed as belief
mass distribution functions over frames of discernment. In Subjective Logic
beliefs are expressed as belief mass distribution functions over binary frames
of discernment. Belief representations in Subjective Logic, which are called
opinions, also contain a base rate parameter which express the a priori belief
in the absence of evidence. Philosophically, beliefs are quantitative
representations of evidence as perceived by humans or by other intelligent
agents. The basic operators of classical probability calculus, such as addition
and multiplication, can be applied to opinions, thereby making belief calculus
practical. Through the equivalence between opinions and Beta probability
density functions, this also provides a calculus for Beta probability density
functions. This article explains the basic elements of belief calculus.
| [
{
"version": "v1",
"created": "Wed, 7 Jun 2006 14:32:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Josang",
"Audun",
""
]
]
| new_dataset | 0.996467 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.