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/0208028 | Joseph Y. Halpern | Joseph Y. Halpern and Ron van der Meyden | A logical reconstruction of SPKI | This is an updated version of a paper that appears in the Proceedings
of the 14th IEEE Computer Security Foundations Workshop. It will appear in a
special issue of the Journal of Computer Security devoted to papers from that
conference | null | null | null | cs.CR cs.LO | null | SPKI/SDSI is a proposed public key infrastructure standard that incorporates
the SDSI public key infrastructure. SDSI's key innovation was the use of local
names. We previously introduced a Logic of Local Name Containment that has a
clear semantics and was shown to completely characterize SDSI name resolution.
Here we show how our earlier approach can be extended to deal with a number of
key features of SPKI, including revocation, expiry dates, and tuple reduction.
We show that these extensions add relatively little complexity to the logic. In
particular, we do not need a nonmonotonic logic to capture revocation. We then
use our semantics to examine SPKI's tuple reduction rules. Our analysis
highlights places where SPKI's informal description of tuple reduction is
somewhat vague, and shows that extra reduction rules are necessary in order to
capture general information about binding and authorization.
| [
{
"version": "v1",
"created": "Mon, 19 Aug 2002 21:03:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Halpern",
"Joseph Y.",
""
],
[
"van der Meyden",
"Ron",
""
]
]
| new_dataset | 0.973768 |
cs/0208029 | Peter Van Roy | Peter Van Roy, Per Brand, Denys Duchier, Seif Haridi, Martin Henz,
Christian Schulte | Logic programming in the context of multiparadigm programming: the Oz
experience | 48 pages, to appear in the journal "Theory and Practice of Logic
Programming" | null | null | null | cs.PL | null | Oz is a multiparadigm language that supports logic programming as one of its
major paradigms. A multiparadigm language is designed to support different
programming paradigms (logic, functional, constraint, object-oriented,
sequential, concurrent, etc.) with equal ease. This article has two goals: to
give a tutorial of logic programming in Oz and to show how logic programming
fits naturally into the wider context of multiparadigm programming. Our
experience shows that there are two classes of problems, which we call
algorithmic and search problems, for which logic programming can help formulate
practical solutions. Algorithmic problems have known efficient algorithms.
Search problems do not have known efficient algorithms but can be solved with
search. The Oz support for logic programming targets these two problem classes
specifically, using the concepts needed for each. This is in contrast to the
Prolog approach, which targets both classes with one set of concepts, which
results in less than optimal support for each class. To explain the essential
difference between algorithmic and search programs, we define the Oz execution
model. This model subsumes both concurrent logic programming
(committed-choice-style) and search-based logic programming (Prolog-style).
Instead of Horn clause syntax, Oz has a simple, fully compositional,
higher-order syntax that accommodates the abilities of the language. We
conclude with lessons learned from this work, a brief history of Oz, and many
entry points into the Oz literature.
| [
{
"version": "v1",
"created": "Tue, 20 Aug 2002 11:12:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Van Roy",
"Peter",
""
],
[
"Brand",
"Per",
""
],
[
"Duchier",
"Denys",
""
],
[
"Haridi",
"Seif",
""
],
[
"Henz",
"Martin",
""
],
[
"Schulte",
"Christian",
""
]
]
| new_dataset | 0.999038 |
cs/0208038 | Andrei Popescu-Belis | Andrei Popescu-Belis, Isabelle Robba, Gerard Sabah | Reference Resolution Beyond Coreference: a Conceptual Frame and its
Application | 8 pages | Proceedings of COLING-ACL'98, Montreal, Canada, 1998, p.1046-1052 | null | null | cs.CL | null | A model for reference use in communication is proposed, from a
representationist point of view. Both the sender and the receiver of a message
handle representations of their common environment, including mental
representations of objects. Reference resolution by a computer is viewed as the
construction of object representations using referring expressions from the
discourse, whereas often only coreference links between such expressions are
looked for. Differences between these two approaches are discussed. The model
has been implemented with elementary rules, and tested on complex narrative
texts (hundreds to thousands of referring expressions). The results support the
mental representations paradigm.
| [
{
"version": "v1",
"created": "Wed, 21 Aug 2002 14:43:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Popescu-Belis",
"Andrei",
""
],
[
"Robba",
"Isabelle",
""
],
[
"Sabah",
"Gerard",
""
]
]
| new_dataset | 0.998526 |
cs/0208039 | Jean Slisz | Elizabeth Anderson, Robert Atkinson, Elizabeth Buckley-Geer, Cynthia
Crego, Lisa Giacchetti, Stephen Hanson, David Ritchie, Jean Slisz, Sara
Tompson, Stephen Wolbers | A Virtual Library of Technical Publications | Presented at 6th International World Wide Web Conference, Santa
Clara, CA, 7-12 Apr 1997 and at Inforum'97, Oak Ridge TN, 6-8 May 1997 | null | null | FERMILAB-TM-2004 | cs.DL | null | Through a collaborative effort, the Fermilab Information Resources Department
and Computing Division have created a "virtual library" of technical
publications that provides public access to electronic full-text documents.
This paper will discuss the vision, planning and milestones of the project, as
well as the hardware, software and interdepartmental cooperation components.
| [
{
"version": "v1",
"created": "Fri, 23 Aug 2002 19:14:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Anderson",
"Elizabeth",
""
],
[
"Atkinson",
"Robert",
""
],
[
"Buckley-Geer",
"Elizabeth",
""
],
[
"Crego",
"Cynthia",
""
],
[
"Giacchetti",
"Lisa",
""
],
[
"Hanson",
"Stephen",
""
],
[
"Ritchie",
"David",
""
],
[
"Slisz",
"Jean",
""
],
[
"Tompson",
"Sara",
""
],
[
"Wolbers",
"Stephen",
""
]
]
| new_dataset | 0.999094 |
cs/0209011 | Erran L. Li | Zygmunt Haas, Joseph Y. Halpern and Erran L. Li | Gossip Based Ad-Hoc Routing | 10 pages | IEEE INFOCOM, June 2002 | null | null | cs.NI | null | Many ad hoc routing protocols are based on some variant of flooding. Despite
various optimizations, many routing messages are propagated unnecessarily. We
propose a gossiping-based approach, where each node forwards a message with
some probability, to reduce the overhead of the routing protocols. Gossiping
exhibits bimodal behavior in sufficiently large networks: in some executions,
the gossip dies out quickly and hardly any node gets the message; in the
remaining executions, a substantial fraction of the nodes gets the message. The
fraction of executions in which most nodes get the message depends on the
gossiping probability and the topology of the network. In the networks we have
considered, using gossiping probability between 0.6 and 0.8 suffices to ensure
that almost every node gets the message in almost every execution. For large
networks, this simple gossiping protocol uses up to 35% fewer messages than
flooding, with improved performance. Gossiping can also be combined with
various optimizations of flooding to yield further benefits. Simulations show
that adding gossiping to AODV results in significant performance improvement,
even in networks as small as 150 nodes. We expect that the improvement should
be even more significant in larger networks.
| [
{
"version": "v1",
"created": "Thu, 5 Sep 2002 21:45:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Haas",
"Zygmunt",
""
],
[
"Halpern",
"Joseph Y.",
""
],
[
"Li",
"Erran L.",
""
]
]
| new_dataset | 0.955916 |
cs/0209013 | Erran L. Li | Erran L. Li and Joseph Y. Halpern | Minimum-Energy Mobile Wireless Networks Revisited | 6 pages | IEEE ICC, 2001 | null | null | cs.NI | null | We propose a protocol that, given a communication network, computes a
subnetwork such that, for every pair $(u,v)$ of nodes connected in the original
network, there is a minimum-energy path between $u$ and $v$ in the subnetwork
(where a minimum-energy path is one that allows messages to be transmitted with
a minimum use of energy). The network computed by our protocol is in general a
subnetwork of the one computed by the protocol given in [13]. Moreover, our
protocol is computationally simpler. We demonstrate the performance
improvements obtained by using the subnetwork computed by our protocol through
simulation.
| [
{
"version": "v1",
"created": "Thu, 5 Sep 2002 22:47:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Erran L.",
""
],
[
"Halpern",
"Joseph Y.",
""
]
]
| new_dataset | 0.964563 |
cs/0209016 | Michael H. Albert | M.H.Albert and M.D.Atkinson | Sorting with a forklift | 24 pages, 2 figures | null | null | null | cs.DM cs.DS math.CO | null | A fork stack is a generalised stack which allows pushes and pops of several
items at a time. We consider the problem of determining which input streams can
be sorted using a single forkstack, or dually, which permutations of a fixed
input stream can be produced using a single forkstack. An algorithm is given to
solve the sorting problem and the minimal unsortable sequences are found. The
results are extended to fork stacks where there are bounds on how many items
can be pushed and popped at one time. In this context we also establish how to
enumerate the collection of sortable sequences.
| [
{
"version": "v1",
"created": "Tue, 10 Sep 2002 22:05:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Albert",
"M. H.",
""
],
[
"Atkinson",
"M. D.",
""
]
]
| new_dataset | 0.989095 |
cs/0209020 | Wen Chen | W. Chen | A new definition of the fractional Laplacian | This study is carred out with the ongoing project of "mathematical
and numerical modelling of medical ultasound wave propagation" sponsored by
the Simula Research Laboratory | null | null | null | cs.NA cs.CE | null | It is noted that the standard definition of the fractional Laplacian leads to
a hyper-singular convolution integral and is also obscure about how to
implement the boundary conditions. This purpose of this note is to introduce a
new definition of the fractional Laplacian to overcome these major drawbacks.
| [
{
"version": "v1",
"created": "Wed, 18 Sep 2002 12:45:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.979079 |
cs/0209021 | Paul Prekop | Paul Prekop and Mark Burnett | Activities, Context and Ubiquitous Computing | null | Computer Communications 26 (2003) 1168-1176 | null | null | cs.IR | null | Context and context-awareness provides computing environments with the
ability to usefully adapt the services or information they provide. It is the
ability to implicitly sense and automatically derive the user needs that
separates context-aware applications from traditionally designed applications,
and this makes them more attentive, responsive, and aware of their user's
identity, and their user's environment. This paper argues that context-aware
applications capable of supporting complex, cognitive activities can be built
from a model of context called Activity-Centric Context. A conceptual model of
Activity-Centric context is presented. The model is illustrated via a detailed
example.
| [
{
"version": "v1",
"created": "Thu, 19 Sep 2002 06:53:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Prekop",
"Paul",
""
],
[
"Burnett",
"Mark",
""
]
]
| new_dataset | 0.992453 |
cs/0210001 | Krzysztof R. Apt | Krzysztof R. Apt | Edsger Wybe Dijkstra (1930 -- 2002): A Portrait of a Genius | 10 pages. To appear in Formal Aspects of Computing | null | null | null | cs.GL | null | We discuss the scientific contributions of Edsger Wybe Dijkstra, his opinions
and his legacy.
| [
{
"version": "v1",
"created": "Tue, 1 Oct 2002 01:37:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Apt",
"Krzysztof R.",
""
]
]
| new_dataset | 0.99817 |
cs/0210014 | A. Kirilov | A.S.Kirilov | Current state of the Sonix -- the IBR-2 instrument control software and
plans for future developments | Invited talk at NOBUGS2002 Conference, NIST, Gaithersburg, MD NOBUGS
abstract identifier NOBUGS2002/015 5 pages, pdf, 2 figures | null | null | null | cs.HC | null | The Sonix is the main control software for the IBR-2 instruments. This is a
modular configurable and flexible system created using the Varman (real time
database) and the X11/OS9 graphical package in the OS-9 environment. In the
last few years we were mostly focused on making this system more reliable and
user friendly. Because the VME hardware and software upgrade is rather
expensive we would like to replace existing VME + OS9 control computers with
the PC+Windows XP ones in the future. This could be done with the help of
VME-PCI adapters.
| [
{
"version": "v1",
"created": "Wed, 16 Oct 2002 07:42:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kirilov",
"A. S.",
""
]
]
| new_dataset | 0.996961 |
cs/0210016 | Hsueh-I. Lu | Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen | Compact Floor-Planning via Orderly Spanning Trees | 13 pages, 5 figures, An early version of this work was presented at
9th International Symposium on Graph Drawing (GD 2001), Vienna, Austria,
September 2001. Accepted to Journal of Algorithms, 2003 | Journal of Algorithms, 48(2):441-451, 2003 | 10.1016/S0196-6774(03)00057-9 | null | cs.DS cs.CG | null | Floor-planning is a fundamental step in VLSI chip design. Based upon the
concept of orderly spanning trees, we present a simple O(n)-time algorithm to
construct a floor-plan for any n-node plane triangulation. In comparison with
previous floor-planning algorithms in the literature, our solution is not only
simpler in the algorithm itself, but also produces floor-plans which require
fewer module types. An equally important aspect of our new algorithm lies in
its ability to fit the floor-plan area in a rectangle of size (n-1)x(2n+1)/3.
Lower bounds on the worst-case area for floor-planning any plane triangulation
are also provided in the paper.
| [
{
"version": "v1",
"created": "Thu, 17 Oct 2002 06:47:02 GMT"
},
{
"version": "v2",
"created": "Sun, 4 May 2003 17:53:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Liao",
"Chien-Chih",
""
],
[
"Lu",
"Hsueh-I",
""
],
[
"Yen",
"Hsu-Chun",
""
]
]
| new_dataset | 0.999717 |
cs/0210018 | Thomas Worlton | T. G. Worlton, A. Chatterjee, J. P. Hammonds, P. F. Peterson, D. J.
Mikkelson, and R. L. Mikkelson | User software for the next generation | Invited talk at NOBUGS2002 Conference, NIST, Gaithersburg, MD NOBUGS
abstract identifier NOBUGS2002/023 6 PAGES, pdf | null | null | null | cs.GR cs.CE | null | New generations of neutron scattering sources and instrumentation are
providing challenges in data handling for user software. Time-of-Flight
instruments used at pulsed sources typically produce hundreds or thousands of
channels of data for each detector segment. New instruments are being designed
with thousands to hundreds of thousands of detector segments. High intensity
neutron sources make possible parametric studies and texture studies which
further increase data handling requirements. The Integrated Spectral Analysis
Workbench (ISAW) software developed at Argonne handles large numbers of spectra
simultaneously while providing operations to reduce, sort, combine and export
the data. It includes viewers to inspect the data in detail in real time. ISAW
uses existing software components and packages where feasible and takes
advantage of the excellent support for user interface design and network
communication in Java. The included scripting language simplifies repetitive
operations for analyzing many files related to a given experiment. Recent
additions to ISAW include a contour view, a time-slice table view, routines for
finding and fitting peaks in data, and support for data from other facilities
using the NeXus format. In this paper, I give an overview of features and
planned improvements of ISAW. Details of some of the improvements are covered
in other presentations at this conference.
| [
{
"version": "v1",
"created": "Sat, 19 Oct 2002 01:27:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Worlton",
"T. G.",
""
],
[
"Chatterjee",
"A.",
""
],
[
"Hammonds",
"J. P.",
""
],
[
"Peterson",
"P. F.",
""
],
[
"Mikkelson",
"D. J.",
""
],
[
"Mikkelson",
"R. L.",
""
]
]
| new_dataset | 0.980566 |
cs/0210019 | Petros Maniatis | Petros Maniatis and Mary Baker | A Historic Name-Trail Service | 13 Pages | null | null | null | cs.NI cs.DC | null | People change the identifiers through which they are reachable online as they
change jobs or residences or Internet service providers. This kind of personal
mobility makes reaching people online error-prone. As people move, they do not
always know who or what has cached their now obsolete identifiers so as to
inform them of the move. Use of these old identifiers can cause delivery
failure of important messages, or worse, may cause delivery of messages to
unintended recipients. For example, a sensitive email message sent to my now
obsolete work address at a former place of employment may reach my unfriendly
former boss instead of me.
In this paper we describe HINTS, a historic name-trail service. This service
provides a persistent way to name willing participants online using today's
transient online identifiers. HINTS accomplishes this by connecting together
the names a person uses along with the times during which those names were
valid for the person, thus giving people control over the historic use of their
names. A correspondent who wishes to reach a mobile person can use an obsolete
online name for that person, qualified with a time at which the online name was
successfully used; HINTS resolves this historic name to a current valid online
identifier for the intended recipient, if that recipient has chosen to leave a
name trail in HINTS.
| [
{
"version": "v1",
"created": "Sat, 19 Oct 2002 10:27:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Maniatis",
"Petros",
""
],
[
"Baker",
"Mary",
""
]
]
| new_dataset | 0.995484 |
cs/0210020 | David Liben-Nowell | Erik D. Demaine, Susan Hohenberger, David Liben-Nowell | Tetris is Hard, Even to Approximate | 56 pages, 11 figures | null | null | MIT-LCS-TR-865 | cs.CC cs.CG cs.DM | null | In the popular computer game of Tetris, the player is given a sequence of
tetromino pieces and must pack them into a rectangular gameboard initially
occupied by a given configuration of filled squares; any completely filled row
of the gameboard is cleared and all pieces above it drop by one row. We prove
that in the offline version of Tetris, it is NP-complete to maximize the number
of cleared rows, maximize the number of tetrises (quadruples of rows
simultaneously filled and cleared), minimize the maximum height of an occupied
square, or maximize the number of pieces placed before the game ends. We
furthermore show the extreme inapproximability of the first and last of these
objectives to within a factor of p^(1-epsilon), when given a sequence of p
pieces, and the inapproximability of the third objective to within a factor of
(2 - epsilon), for any epsilon>0. Our results hold under several variations on
the rules of Tetris, including different models of rotation, limitations on
player agility, and restricted piece sets.
| [
{
"version": "v1",
"created": "Mon, 21 Oct 2002 18:32:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Hohenberger",
"Susan",
""
],
[
"Liben-Nowell",
"David",
""
]
]
| new_dataset | 0.997158 |
cs/0211005 | Sanshzar Kettebekov | Sanshzar Kettebekov, Mohammed Yeasin, Rajeev Sharma | Prosody Based Co-analysis for Continuous Recognition of Coverbal
Gestures | Alternative see:
http://vision.cse.psu.edu/kettebek/academ/publications.htm | S. Kettebekov, M. Yeasin, and R. Sharma, "Prosody Based
Co-analysis for Continuous Recognition of Coverbal Gestures," presented at
International Conference on Multimodal Interfaces (ICMI'02), Pittsburgh, USA,
2002 | null | null | cs.CV cs.HC | null | Although speech and gesture recognition has been studied extensively, all the
successful attempts of combining them in the unified framework were
semantically motivated, e.g., keyword-gesture cooccurrence. Such formulations
inherited the complexity of natural language processing. This paper presents a
Bayesian formulation that uses a phenomenon of gesture and speech articulation
for improving accuracy of automatic recognition of continuous coverbal
gestures. The prosodic features from the speech signal were coanalyzed with the
visual signal to learn the prior probability of co-occurrence of the prominent
spoken segments with the particular kinematical phases of gestures. It was
found that the above co-analysis helps in detecting and disambiguating visually
small gestures, which subsequently improves the rate of continuous gesture
recognition. The efficacy of the proposed approach was demonstrated on a large
database collected from the weather channel broadcast. This formulation opens
new avenues for bottom-up frameworks of multimodal integration.
| [
{
"version": "v1",
"created": "Tue, 5 Nov 2002 19:27:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kettebekov",
"Sanshzar",
""
],
[
"Yeasin",
"Mohammed",
""
],
[
"Sharma",
"Rajeev",
""
]
]
| new_dataset | 0.960481 |
cs/0212010 | Peter Turney | Arnold Smith (National Research Council of Canada), Peter Turney
(National Research Council of Canada), Robert Ewaschuk (University of
Waterloo) | JohnnyVon: Self-Replicating Automata in Continuous Two-Dimensional Space | 26 pages, issued 2002, Java code available at
http://purl.org/net/johnnyvon/ | null | null | NRC-44953 | cs.NE cs.CE | null | JohnnyVon is an implementation of self-replicating automata in continuous
two-dimensional space. Two types of particles drift about in a virtual liquid.
The particles are automata with discrete internal states but continuous
external relationships. Their internal states are governed by finite state
machines but their external relationships are governed by a simulated physics
that includes brownian motion, viscosity, and spring-like attractive and
repulsive forces. The particles can be assembled into patterns that can encode
arbitrary strings of bits. We demonstrate that, if an arbitrary "seed" pattern
is put in a "soup" of separate individual particles, the pattern will replicate
by assembling the individual particles into copies of itself. We also show
that, given sufficient time, a soup of separate individual particles will
eventually spontaneously form self-replicating patterns. We discuss the
implications of JohnnyVon for research in nanotechnology, theoretical biology,
and artificial life.
| [
{
"version": "v1",
"created": "Sun, 8 Dec 2002 00:26:49 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Smith",
"Arnold",
"",
"National Research Council of Canada"
],
[
"Turney",
"Peter",
"",
"National Research Council of Canada"
],
[
"Ewaschuk",
"Robert",
"",
"University of\n Waterloo"
]
]
| new_dataset | 0.99911 |
cs/0212050 | Joseph O'Rourke | Erik D. Demaine and Joseph O'Rourke | Open Problems from CCCG 2002 | 10 problems, 4 pages. Minor updates in 2nd version. To appear in the
Proceedings of the Canadian Computational Geometry Conference, August 2003 | null | null | null | cs.CG cs.DM | null | A list of the problems presented on August 12, 2002 at the open-problem
session of the 14th Canadian Conference on Computational Geometry held in
Lethbridge, Alberta, Canada.
| [
{
"version": "v1",
"created": "Sun, 22 Dec 2002 03:15:56 GMT"
},
{
"version": "v2",
"created": "Sat, 21 Jun 2003 19:53:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.963081 |
cs/0301002 | Mark J. Kilgard | Cass Everitt, Mark J. Kilgard | Practical and Robust Stenciled Shadow Volumes for Hardware-Accelerated
Rendering | 8 pages, 5 figures | null | null | null | cs.GR cs.CG | null | Twenty-five years ago, Crow published the shadow volume approach for
determining shadowed regions in a scene. A decade ago, Heidmann described a
hardware-accelerated stencil buffer-based shadow volume algorithm.
Unfortunately hardware-accelerated stenciled shadow volume techniques have
not been widely adopted by 3D games and applications due in large part to the
lack of robustness of described techniques. This situation persists despite
widely available hardware support. Specifically what has been lacking is a
technique that robustly handles various "hard" situations created by near or
far plane clipping of shadow volumes.
We describe a robust, artifact-free technique for hardware-accelerated
rendering of stenciled shadow volumes. Assuming existing hardware, we resolve
the issues otherwise caused by shadow volume near and far plane clipping
through a combination of (1) placing the conventional far clip plane "at
infinity", (2) rasterization with infinite shadow volume polygons via
homogeneous coordinates, and (3) adopting a zfail stencil-testing scheme. Depth
clamping, a new rasterization feature provided by NVIDIA's GeForce3, preserves
existing depth precision by not requiring the far plane to be placed at
infinity. We also propose two-sided stencil testing to improve the efficiency
of rendering stenciled shadow volumes.
| [
{
"version": "v1",
"created": "Mon, 6 Jan 2003 20:57:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Everitt",
"Cass",
""
],
[
"Kilgard",
"Mark J.",
""
]
]
| new_dataset | 0.978772 |
cs/0301003 | Danny Hong | Alexandros Eleftheriadis and Danny Hong | Flavor: A Language for Media Representation | 20 pages and 15 figures | null | null | null | cs.PL | null | Flavor (Formal Language for Audio-Visual Object Representation) has been
created as a language for describing coded multimedia bitstreams in a formal
way so that the code for reading and writing bitstreams can be automatically
generated. It is an extension of C++ and Java, in which the typing system
incorporates bitstream representation semantics. This allows describing in a
single place both the in-memory representation of data as well as their
bitstream-level (compressed) representation. Flavor also comes with a
translator that automatically generates standard C++ or Java code from the
Flavor source code so that direct access to compressed multimedia information
by application developers can be achieved with essentially zero programming.
Flavor has gone through many enhancements and this paper fully describes the
latest version of the language and the translator. The software has been made
into an open source project as of Version 4.1, and the latest downloadable
Flavor package is available at http://flavor.sourceforge.net.
| [
{
"version": "v1",
"created": "Tue, 7 Jan 2003 07:53:20 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eleftheriadis",
"Alexandros",
""
],
[
"Hong",
"Danny",
""
]
]
| new_dataset | 0.998905 |
cs/0301025 | Sostenes Lins | Lauro Lins, Sostenes Lins and Silvio Melo | PHORMA: Perfectly Hashed Order Restricted Multidimensional Array | 12 pages, 4 figures | null | null | null | cs.DM | null | In this paper we propose a simple and efficient strategy to obtain a data
structure generator to accomplish a perfect hash of quite general order
restricted multidimensional arrays named {\em phormas}. The constructor of such
objects gets two parameters as input: an n-vector a of non negative integers
and a boolean function B on the types of order restrictions on the coordinates
of the valid n-vectors bounded by a. At compiler time, the phorma constructor
builds, from the pair a,B, a digraph G(a,B) with a single source s and a single
sink t such that the st-paths are in 1-1 correspondence with the members of the
B-restricted a-bounded array A(a,B). Besides perfectly hashing A(a,B), G(a,B)
is an instance of an NW-family. This permits other useful computational tasks
on it.
| [
{
"version": "v1",
"created": "Fri, 24 Jan 2003 13:30:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lins",
"Lauro",
""
],
[
"Lins",
"Sostenes",
""
],
[
"Melo",
"Silvio",
""
]
]
| new_dataset | 0.964051 |
cs/0301031 | Judith Beumer | K. Keahey and V. Welch | Fine-Grain Authorization for Resource Management in the Grid Environment | 7 pages | null | null | ANL/MCS-P991-0802 | cs.CR cs.DC | null | In this document we describe our work-in-progress for enabling fine-grain
authorization of resource management. In particular, we address the needs of
Virtual Organizations (VOs) to enforce their own policies in addition to those
of the resource owners.
| [
{
"version": "v1",
"created": "Tue, 28 Jan 2003 19:27:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Keahey",
"K.",
""
],
[
"Welch",
"V.",
""
]
]
| new_dataset | 0.999078 |
cs/0302006 | Rajkumar Buyya | Jia Yu, Srikumar Venugopal, Rajkumar Buyya | Grid Market Directory: A Web Services based Grid Service Publication
Directory | Technical Report, Grid Computing and Distributed Systems Lab,
University of Melbourne, Jan 2003 | null | null | null | cs.DC | null | As Grids are emerging as the next generation service-oriented computing
platforms, they need to support Grid economy that helps in the management of
supply and demand for resources and offers an economic incentive for Grid
resource providers. To enable this Grid economy, a market-like Grid environment
including an infrastructure that supports the publication of services and their
discovery is needed. As part of the Gridbus project, we proposed and have
developed a Grid Market Directory (GMD) that serves as a registry for
high-level service publication and discovery in Virtual Organisations.
| [
{
"version": "v1",
"created": "Thu, 6 Feb 2003 03:31:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Yu",
"Jia",
""
],
[
"Venugopal",
"Srikumar",
""
],
[
"Buyya",
"Rajkumar",
""
]
]
| new_dataset | 0.998349 |
cs/0302021 | Steven Bird | Gary Simons and Steven Bird | Building an Open Language Archives Community on the OAI Foundation | 12 pages | Library Hi Tech 21(2), 2003 | null | null | cs.CL cs.DL | null | The Open Language Archives Community (OLAC) is an international partnership
of institutions and individuals who are creating a worldwide virtual library of
language resources. The Dublin Core (DC) Element Set and the OAI Protocol have
provided a solid foundation for the OLAC framework. However, we need more
precision in community-specific aspects of resource description than is offered
by DC. Furthermore, many of the institutions and individuals who might
participate in OLAC do not have the technical resources to support the OAI
protocol. This paper presents our solutions to these two problems. To address
the first, we have developed an extensible application profile for language
resource metadata. To address the second, we have implemented Vida (the virtual
data provider) and Viser (the virtual service provider), which permit community
members to provide data and services without having to implement the OAI
protocol. These solutions are generic and could be adopted by other specialized
subcommunities.
| [
{
"version": "v1",
"created": "Fri, 14 Feb 2003 07:11:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Simons",
"Gary",
""
],
[
"Bird",
"Steven",
""
]
]
| new_dataset | 0.993828 |
cs/0302027 | Alper Ungor | David Eppstein, John M. Sullivan, and Alper Ungor | Tiling space and slabs with acute tetrahedra | 20 pages; 17 figures; 1 table; see also
http://www.cs.duke.edu/~ungor/abstracts/acute_tiling.html | Computational Geometry Theory & Applications 27(3):237-255, 2004 | 10.1016/j.comgeo.2003.11.003 | null | cs.CG math.MG | null | We show it is possible to tile three-dimensional space using only tetrahedra
with acute dihedral angles. We present several constructions to achieve this,
including one in which all dihedral angles are less than $77.08^\circ$, and
another which tiles a slab in space.
| [
{
"version": "v1",
"created": "Wed, 19 Feb 2003 20:40:54 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eppstein",
"David",
""
],
[
"Sullivan",
"John M.",
""
],
[
"Ungor",
"Alper",
""
]
]
| new_dataset | 0.97959 |
cs/0303031 | Massimo Di Pierro | Massimo Di Pierro | A Bird's eye view of Matrix Distributed Processing | null | Proceedings of the ICCSA 2003 Conference | null | null | cs.DC cs.CE cs.DM cs.MS hep-lat physics.comp-ph | null | We present Matrix Distributed Processing, a C++ library for fast development
of efficient parallel algorithms. MDP is based on MPI and consists of a
collection of C++ classes and functions such as lattice, site and field. Once
an algorithm is written using these components the algorithm is automatically
parallel and no explicit call to communication functions is required. MDP is
particularly suitable for implementing parallel solvers for multi-dimensional
differential equations and mesh-like problems.
| [
{
"version": "v1",
"created": "Fri, 28 Mar 2003 20:47:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Di Pierro",
"Massimo",
""
]
]
| new_dataset | 0.993946 |
cs/0303033 | David S. H. Rosenthal | David S. H. Rosenthal | A Digital Preservation Appliance Based on OpenBSD | 12 pages | Proceedings of BSDcon, 2003 | null | null | cs.DC cs.DL | null | The LOCKSS program has developed and deployed in a world-wide test a system
for preserving access to academic journals published on the Web. The
fundamental problem for any digital preservation system is that it must be
affordable for the long term. To reduce the cost of ownership, the LOCKSS
system uses generic PC hardware, open source software, and peer-to-peer
technology. It is packaged as a ``network appliance'', a single-function box
that can be connected to the Internet, configured and left alone to do its job
with minimal monitoring or administration. The first version of this system was
based on a Linux boot floppy. After three years of testing it was replaced by a
second version, based on OpenBSD and booting from CD-ROM.
We focus in this paper on the design, implementation and deployment of a
network appliance based on an open source operating system. We provide an
overview of the LOCKSS application and describe the experience of deploying and
supporting its first version. We list the requirements we took from this to
drive the design of the second version, describe how we satisfied them in the
OpenBSD environment, and report on the initial
| [
{
"version": "v1",
"created": "Sun, 30 Mar 2003 18:46:46 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Apr 2003 15:05:11 GMT"
},
{
"version": "v3",
"created": "Sun, 21 Nov 2004 23:54:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rosenthal",
"David S. H.",
""
]
]
| new_dataset | 0.993725 |
cs/0304002 | Paul M. Aoki | Paul M. Aoki, Matthew Romaine, Margaret H. Szymanski, James D.
Thornton, Daniel Wilson, Allison Woodruff | The Mad Hatter´s Cocktail Party: A Social Mobile Audio Space
Supporting Multiple Simultaneous Conversations | 8 pages | Proc. ACM SIGCHI Conf. on Human Factors in Computing Systems, Ft.
Lauderdale, FL, Apr. 2003, 425-432. ACM Press. | 10.1145/642611.642686 | null | cs.HC cs.SD | null | This paper presents a mobile audio space intended for use by gelled social
groups. In face-to-face interactions in such social groups, conversational
floors change frequently, e.g., two participants split off to form a new
conversational floor, a participant moves from one conversational floor to
another, etc. To date, audio spaces have provided little support for such
dynamic regroupings of participants, either requiring that the participants
explicitly specify with whom they wish to talk or simply presenting all
participants as though they are in a single floor. By contrast, the audio space
described here monitors participant behavior to identify conversational floors
as they emerge. The system dynamically modifies the audio delivered to each
participant to enhance the salience of the participants with whom they are
currently conversing. We report a user study of the system, focusing on
conversation analytic results.
| [
{
"version": "v1",
"created": "Tue, 1 Apr 2003 05:15:05 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Aoki",
"Paul M.",
""
],
[
"Romaine",
"Matthew",
""
],
[
"Szymanski",
"Margaret H.",
""
],
[
"Thornton",
"James D.",
""
],
[
"Wilson",
"Daniel",
""
],
[
"Woodruff",
"Allison",
""
]
]
| new_dataset | 0.999819 |
cs/0304011 | Goncalo Carvalho | Paul Anderson and Goncalo Carvalho | Embedded Reflection Mapping | null | null | null | null | cs.GR | null | Environment maps are used to simulate reflections off curved objects. We
present a technique to reflect a user, or a group of users, in a real
environment, onto a virtual object, in a virtual reality application, using the
live video feeds from a set of cameras, in real-time. Our setup can be used in
a variety of environments ranging from outdoor or indoor scenes.
| [
{
"version": "v1",
"created": "Tue, 8 Apr 2003 14:17:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Anderson",
"Paul",
""
],
[
"Carvalho",
"Goncalo",
""
]
]
| new_dataset | 0.997588 |
cs/0304026 | Oded Regev | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev | A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover | null | null | null | null | cs.CC | null | Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the
smallest subset of vertices that intersects every hyper-edge. We present a new
multilayered PCP construction that extends the Raz verifier. This enables us to
prove that E$k$-Vertex-Cover is NP-hard to approximate within factor
$(k-1-\epsilon)$ for any $k \geq 3$ and any $\epsilon>0$. The result is
essentially tight as this problem can be easily approximated within factor $k$.
Our construction makes use of the biased Long-Code and is analyzed using
combinatorial properties of $s$-wise $t$-intersecting families of subsets.
| [
{
"version": "v1",
"created": "Sat, 19 Apr 2003 17:59:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dinur",
"Irit",
""
],
[
"Guruswami",
"Venkatesan",
""
],
[
"Khot",
"Subhash",
""
],
[
"Regev",
"Oded",
""
]
]
| new_dataset | 0.988607 |
cs/0304030 | John M. Hitchcock | John M. Hitchcock | Small Spans in Scaled Dimension | 28 pages | null | null | null | cs.CC | null | Juedes and Lutz (1995) proved a small span theorem for polynomial-time
many-one reductions in exponential time. This result says that for language A
decidable in exponential time, either the class of languages reducible to A
(the lower span) or the class of problems to which A can be reduced (the upper
span) is small in the sense of resource-bounded measure and, in particular,
that the degree of A is small. Small span theorems have been proven for
increasingly stronger polynomial-time reductions, and a small span theorem for
polynomial-time Turing reductions would imply BPP != EXP. In contrast to the
progress in resource-bounded measure, Ambos-Spies, Merkle, Reimann, and Stephan
(2001) showed that there is no small span theorem for the resource-bounded
dimension of Lutz (2000), even for polynomial-time many-one reductions.
Resource-bounded scaled dimension, recently introduced by Hitchcock, Lutz,
and Mayordomo (2003), provides rescalings of resource-bounded dimension. We use
scaled dimension to further understand the contrast between measure and
dimension regarding polynomial-time spans and degrees. We strengthen prior
results by showing that the small span theorem holds for polynomial-time
many-one reductions in the -3rd-order scaled dimension, but fails to hold in
the -2nd-order scaled dimension. Our results also hold in exponential space.
As an application, we show that determining the -2nd- or -1st-order scaled
dimension in ESPACE of the many-one complete languages for E would yield a
proof of P = BPP or P != PSPACE. On the other hand, it is shown unconditionally
that the complete languages for E have -3rd-order scaled dimension 0 in ESPACE
and -2nd- and -1st-order scaled dimension 1 in E.
| [
{
"version": "v1",
"created": "Tue, 22 Apr 2003 19:43:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hitchcock",
"John M.",
""
]
]
| new_dataset | 0.9864 |
cs/0305003 | Stina Nylander | Stina Nylander, Markus Bylund, Annika Waern | The Ubiquitous Interactor - Device Independent Access to Mobile Services | null | null | null | null | cs.HC | null | The Ubiquitous Interactor (UBI) addresses the problems of design and
development that arise around services that need to be accessed from many
different devices. In UBI, the same service can present itself with different
user interfaces on different devices. This is done by separating interaction
between users and services from presentation. The interaction is kept the same
for all devices, and different presentation information is provided for
different devices. This way, tailored user interfaces for many different
devices can be created without multiplying development and maintenance work. In
this paper we describe the system design of UBI, the system implementation, and
two services implemented for the system: a calendar service and a stockbroker
service.
| [
{
"version": "v1",
"created": "Mon, 5 May 2003 11:32:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Nylander",
"Stina",
""
],
[
"Bylund",
"Markus",
""
],
[
"Waern",
"Annika",
""
]
]
| new_dataset | 0.995701 |
cs/0305004 | V. Sriram | V.Sriram, B. Ravi Sekar Reddy and R. Sangal | Approximate Grammar for Information Extraction | 10 pages, 3 figures, 2 tables, Presented at "International Conference
on Universal Knowledge and Language, Goa'2002" | Conference on Universal Knowledge and Language, Goa'2002 | null | null | cs.CL cs.AI | null | In this paper, we present the concept of Approximate grammar and how it can
be used to extract information from a documemt. As the structure of
informational strings cannot be defined well in a document, we cannot use the
conventional grammar rules to represent the information. Hence, the need arises
to design an approximate grammar that can be used effectively to accomplish the
task of Information extraction. Approximate grammars are a novel step in this
direction. The rules of an approximate grammar can be given by a user or the
machine can learn the rules from an annotated document. We have performed our
experiments in both the above areas and the results have been impressive.
| [
{
"version": "v1",
"created": "Tue, 6 May 2003 14:06:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Sriram",
"V.",
""
],
[
"Reddy",
"B. Ravi Sekar",
""
],
[
"Sangal",
"R.",
""
]
]
| new_dataset | 0.972598 |
cs/0305005 | Gianni Franceschini | Gianni Franceschini and Viliam Geffert | An In-Place Sorting with O(n log n) Comparisons and O(n) Moves | null | null | null | null | cs.DS cs.CC | null | We present the first in-place algorithm for sorting an array of size n that
performs, in the worst case, at most O(n log n) element comparisons and O(n)
element transports.
This solves a long-standing open problem, stated explicitly, e.g., in [J.I.
Munro and V. Raman, Sorting with minimum data movement, J. Algorithms, 13,
374-93, 1992], of whether there exists a sorting algorithm that matches the
asymptotic lower bounds on all computational resources simultaneously.
| [
{
"version": "v1",
"created": "Fri, 9 May 2003 14:56:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Franceschini",
"Gianni",
""
],
[
"Geffert",
"Viliam",
""
]
]
| new_dataset | 0.95784 |
cs/0305006 | Hsueh-I. Lu | Ming-Yang Chen, Hsueh-I. Lu, and Hsu-Chun Yen | On the Ramsey Numbers for Bipartite Multigraphs | 10 pages, 3 figures | null | null | null | cs.DM | null | A coloring of a complete bipartite graph is shuffle-preserved if it is the
case that assigning a color $c$ to edges $(u, v)$ and $(u', v')$ enforces the
same color assignment for edges $(u, v')$ and $(u',v)$. (In words, the induced
subgraph with respect to color $c$ is complete.) In this paper, we investigate
a variant of the Ramsey problem for the class of complete bipartite
multigraphs. (By a multigraph we mean a graph in which multiple edges, but no
loops, are allowed.) Unlike the conventional m-coloring scheme in Ramsey theory
which imposes a constraint (i.e., $m$) on the total number of colors allowed in
a graph, we introduce a relaxed version called m-local coloring which only
requires that, for every vertex $v$, the number of colors associated with $v$'s
incident edges is bounded by $m$. Note that the number of colors found in a
graph under $m$-local coloring may exceed m. We prove that given any $n \times
n$ complete bipartite multigraph $G$, every shuffle-preserved $m$-local
coloring displays a monochromatic copy of $K_{p,p}$ provided that $2(p-1)(m-1)
< n$. Moreover, the above bound is tight when (i) $m=2$, or (ii) $n=2^k$ and
$m=3\cdot 2^{k-2}$ for every integer $k\geq 2$. As for the lower bound of $p$,
we show that the existence of a monochromatic $K_{p,p}$ is not guaranteed if
$p> \lceil \frac{n}{m} \rceil$. Finally, we give a generalization for
$k$-partite graphs and a method applicable to general graphs. Many conclusions
found in $m$-local coloring can be inferred to similar results of $m$-coloring.
| [
{
"version": "v1",
"created": "Mon, 12 May 2003 16:17:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"Ming-Yang",
""
],
[
"Lu",
"Hsueh-I.",
""
],
[
"Yen",
"Hsu-Chun",
""
]
]
| new_dataset | 0.999032 |
cs/0305016 | Sandor P. Fekete | Sandor P. Fekete and Henk Meijer | The one-round Voronoi game replayed | 14 pages, 6 figures, Latex; revised for journal version, to appear in
Computational Geometry: Theory and Applications. Extended abstract version
appeared in Workshop on Algorithms and Data Structures, Springer Lecture
Notes in Computer Science, vol.2748, 2003, pp. 150-161 | null | null | null | cs.CG cs.GT | null | We consider the one-round Voronoi game, where player one (``White'', called
``Wilma'') places a set of n points in a rectangular area of aspect ratio r
<=1, followed by the second player (``Black'', called ``Barney''), who places
the same number of points. Each player wins the fraction of the board closest
to one of his points, and the goal is to win more than half of the total area.
This problem has been studied by Cheong et al., who showed that for large
enough $n$ and r=1, Barney has a strategy that guarantees a fraction of 1/2+a,
for some small fixed a.
We resolve a number of open problems raised by that paper. In particular, we
give a precise characterization of the outcome of the game for optimal play: We
show that Barney has a winning strategy for n>2 and r>sqrt{2}/n, and for n=2
and r>sqrt{3}/2. Wilma wins in all remaining cases, i.e., for n>=3 and
r<=sqrt{2}/n, for n=2 and r<=sqrt{3}/2, and for n=1. We also discuss complexity
aspects of the game on more general boards, by proving that for a polygon with
holes, it is NP-hard to maximize the area Barney can win against a given set of
points by Wilma.
| [
{
"version": "v1",
"created": "Fri, 16 May 2003 14:43:04 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Apr 2004 14:15:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Fekete",
"Sandor P.",
""
],
[
"Meijer",
"Henk",
""
]
]
| new_dataset | 0.952387 |
cs/0305033 | Johan Schubert | Ulla Bergsten, Johan Schubert, Per Svensson | Beslutst\"odssystemet Dezzy - en \"oversikt | 18 pages, 8 figures, in Swedish, with appendix in English | in Dokumentation 7 juni av Seminarium och fackutst\"allning om
samband, sensorer och datorer f\"or ledningssystem till f\"orsvaret
(MILINF'89), pp. 07B2:19-31, Enk\"oping, June 1989, Telub AB, V\"axj\"o, 1989 | null | FOA Report B 20078-2.7 | cs.AI cs.DB | null | Within the scope of the three-year ANTI-SUBMARINE WARFARE project of the
National Defence Research Establishment, the INFORMATION SYSTEMS subproject has
developed the demonstration prototype Dezzy for handling and analysis of
intelligence reports concerning foreign underwater activities.
-----
Inom ramen f\"or FOA:s tre{\aa}riga huvudprojekt UB{\AA}TSSKYDD har
delprojekt INFORMATIONSSYSTEM utvecklat demonstrationsprototypen Dezzy till ett
beslutsst\"odsystem f\"or hantering och analys av underr\"attelser om
fr\"ammande undervattensverksamhet.
| [
{
"version": "v1",
"created": "Fri, 16 May 2003 18:26:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bergsten",
"Ulla",
""
],
[
"Schubert",
"Johan",
""
],
[
"Svensson",
"Per",
""
]
]
| new_dataset | 0.994032 |
cs/0305042 | Filippo Menczer | Markus Jakobsson, Filippo Menczer | Untraceable Email Cluster Bombs: On Agent-Based Distributed Denial of
Service | null | null | null | null | cs.CY cs.NI | null | We uncover a vulnerability that allows for an attacker to perform an
email-based attack on selected victims, using only standard scripts and agents.
What differentiates the attack we describe from other, already known forms of
distributed denial of service (DDoS) attacks is that an attacker does not need
to infiltrate the network in any manner -- as is normally required to launch a
DDoS attack. Thus, we see this type of attack as a poor man's DDoS. Not only is
the attack easy to mount, but it is also almost impossible to trace back to the
perpetrator. Along with descriptions of our attack, we demonstrate its
destructive potential with (limited and contained) experimental results. We
illustrate the potential impact of our attack by describing how an attacker can
disable an email account by flooding its inbox; block competition during
on-line auctions; harm competitors with an on-line presence; disrupt phone
service to a given victim; cheat in SMS-based games; disconnect mobile
corporate leaders from their networks; and disrupt electronic elections.
Finally, we propose a set of countermeasures that are light-weight, do not
require modifications to the infrastructure, and can be deployed in a gradual
manner.
| [
{
"version": "v1",
"created": "Fri, 23 May 2003 22:10:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jakobsson",
"Markus",
""
],
[
"Menczer",
"Filippo",
""
]
]
| new_dataset | 0.990013 |
cs/0305056 | Andrei Salnikov | R. Bartoldus, G. Dubois-Felsmann, Y. Kolomensky, A. Salnikov | Configuration Database for BaBar On-line | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, 4 figures, PDF. PSN MOKT004 | null | null | SLAC-PUB-9831 | cs.DB cs.IR | null | The configuration database is one of the vital systems in the BaBar on-line
system. It provides services for the different parts of the data acquisition
system and control system, which require run-time parameters. The original
design and implementation of the configuration database played a significant
role in the successful BaBar operations since the beginning of experiment.
Recent additions to the design of the configuration database provide better
means for the management of data and add new tools to simplify main
configuration tasks. We describe the design of the configuration database, its
implementation with the Objectivity/DB object-oriented database, and our
experience collected during the years of operation.
| [
{
"version": "v1",
"created": "Thu, 29 May 2003 21:37:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bartoldus",
"R.",
""
],
[
"Dubois-Felsmann",
"G.",
""
],
[
"Kolomensky",
"Y.",
""
],
[
"Salnikov",
"A.",
""
]
]
| new_dataset | 0.996348 |
cs/0305065 | James A. Hamilton | James A. Hamilton, Gregory P. Dubois-Felsmann and Rainer Bartoldus | A Generic Multi-node State Monitoring Subsystem | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages | null | null | SLAC-PUB-9909 | cs.DC | null | The BaBar online data acquisition (DAQ) system includes approximately fifty
Unix systems that collectively implement the level-three trigger. These systems
all run the same code. Each of these systems has its own state, and this state
is expected to change in response to changes in the overall DAQ system. A
specialized subsystem has been developed to initiate processing on this
collection of systems, and to monitor them both for error conditions and to
ensure that they all follow the same state trajectory within a specifiable
period of time. This subsystem receives start commands from the main DAQ run
control system, and reports major coherent state changes, as well as error
conditions, back to the run control system. This state monitoring subsystem has
the novel feature that it does not know anything about the state machines that
it is monitoring, and hence does not introduce any fundamentally new state
machine into the overall system. This feature makes it trivially applicable to
other multi-node subsystems. Indeed it has already found a second application
beyond the level-three trigger, within the BaBar experiment.
| [
{
"version": "v1",
"created": "Fri, 30 May 2003 17:43:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hamilton",
"James A.",
""
],
[
"Dubois-Felsmann",
"Gregory P.",
""
],
[
"Bartoldus",
"Rainer",
""
]
]
| new_dataset | 0.99606 |
cs/0306003 | Steve Fisher | Rob Byrom, Brian Coghlan, Andrew W Cooke, Roney Cordenonsi, Linda
Cornwall, Ari Datta, Abdeslem Djaoui, Laurence Field, Steve Fisher, Steve
Hicks, Stuart Kenny, James Magowan, Werner Nutt, David O'Callaghan, Manfred
Oevers, Norbert Podhorszki, John Ryan, Manish Soni, Paul Taylor, Antony J.
Wilson and Xiaomei Zhu | R-GMA: First results after deployment | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, LaTeX, 3 eps figures. PSN
MOET004 | null | null | null | cs.DC | null | We describe R-GMA (Relational Grid Monitoring Architecture) which is being
developed within the European DataGrid Project as an Grid Information and
Monitoring System. Is is based on the GMA from GGF, which is a simple
Consumer-Producer model. The special strength of this implementation comes from
the power of the relational model. We offer a global view of the information as
if each VO had one large relational database. We provide a number of different
Producer types with different characteristics; for example some support
streaming of information. We also provide combined Consumer/Producers, which
are able to combine information and republish it. At the heart of the system is
the mediator, which for any query is able to find and connect to the best
Producers to do the job. We are able to invoke MDS info-provider scripts and
publish the resulting information via R-GMA in addition to having some of our
own sensors. APIs are available which allow the user to deploy monitoring and
information services for any application that may be needed in the future. We
have used it both for information about the grid (primarily to find what
services are available at any one time) and for application monitoring. R-GMA
has been deployed in Grid testbeds, we describe the results and experiences of
this deployment.
| [
{
"version": "v1",
"created": "Fri, 30 May 2003 20:39:27 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Jun 2003 18:13:56 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Byrom",
"Rob",
""
],
[
"Coghlan",
"Brian",
""
],
[
"Cooke",
"Andrew W",
""
],
[
"Cordenonsi",
"Roney",
""
],
[
"Cornwall",
"Linda",
""
],
[
"Datta",
"Ari",
""
],
[
"Djaoui",
"Abdeslem",
""
],
[
"Field",
"Laurence",
""
],
[
"Fisher",
"Steve",
""
],
[
"Hicks",
"Steve",
""
],
[
"Kenny",
"Stuart",
""
],
[
"Magowan",
"James",
""
],
[
"Nutt",
"Werner",
""
],
[
"O'Callaghan",
"David",
""
],
[
"Oevers",
"Manfred",
""
],
[
"Podhorszki",
"Norbert",
""
],
[
"Ryan",
"John",
""
],
[
"Soni",
"Manish",
""
],
[
"Taylor",
"Paul",
""
],
[
"Wilson",
"Antony J.",
""
],
[
"Zhu",
"Xiaomei",
""
]
]
| new_dataset | 0.996844 |
cs/0306026 | Alasdair Earl | A.D.Earl, A.Hasan and D. Boutigany | BdbServer++: A User Driven Data Location and Retrieval Tool | Paper based on the poster from the 2003 Computing in High Energy and
Nuclear Physics (CHEP03), La Jolla, Ca, USA, March 2003, 4 pages, LaTeX, 0
figures. PSN TUCP011 | null | null | SLAC-PUB-9925 | cs.IR | null | The adoption of Grid technology has the potential to greatly aid the BaBar
experiment. BdbServer was originally designed to extract copies of data from
the Objectivity/DB database at SLAC and IN2P3. With data now stored in multiple
locations in a variety of data formats, we are enhancing this tool. This will
enable users to extract selected deep copies of event collections and ship them
to the requested site using the facilities offered by the existing Grid
infrastructure. By building on the work done by various groups in BaBar, and
the European DataGrid, we have successfully expanded the capabilities of the
BdbServer software. This should provide a framework for future work in data
distribution.
| [
{
"version": "v1",
"created": "Thu, 5 Jun 2003 12:20:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Earl",
"A. D.",
""
],
[
"Hasan",
"A.",
""
],
[
"Boutigany",
"D.",
""
]
]
| new_dataset | 0.995652 |
cs/0306028 | David A. Plaisted | David A. Plaisted | An Abstract Programming System | Internal report | null | null | null | cs.SE cs.LO | null | The system PL permits the translation of abstract proofs of program
correctness into programs in a variety of programming languages. A programming
language satisfying certain axioms may be the target of such a translation. The
system PL also permits the construction and proof of correctness of programs in
an abstract programming language, and permits the translation of these programs
into correct programs in a variety of languages. The abstract programming
language has an imperative style of programming with assignment statements and
side-effects, to allow the efficient generation of code. The abstract programs
may be written by humans and then translated, avoiding the need to write the
same program repeatedly in different languages or even the same language. This
system uses classical logic, is conceptually simple, and permits reasoning
about nonterminating programs using Scott-Strachey style denotational
semantics.
| [
{
"version": "v1",
"created": "Thu, 5 Jun 2003 18:31:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Plaisted",
"David A.",
""
]
]
| new_dataset | 0.997321 |
cs/0306038 | Bruce Long | Bruce Long | Quanta: a Language for Modeling and Manipulating Information Structures | null | null | null | null | cs.LO cs.PL | null | We present a theory for modeling the structure of information and a language
(Quanta) expressing the theory. Unlike Shannon's information theory, which
focuses on the amount of information in an information system, we focus on the
structure of the information in the system. For example, we can model the
information structure corresponding to an algorithm or a physical process such
as the structure of a quantum interaction. After a brief discussion of the
relation between an evolving state-system and an information structure, we
develop an algebra of information pieces (infons) to represent the structure of
systems where descriptions of complex systems are constructed from expressions
involving descriptions of simpler information systems. We map the theory to the
Von Neumann computing model of sequences/conditionals/repetitions, and to the
class/object theory of object-oriented programming (OOP).
| [
{
"version": "v1",
"created": "Mon, 9 Jun 2003 20:13:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Long",
"Bruce",
""
]
]
| new_dataset | 0.966693 |
cs/0306041 | Boris Konev | Anatoly Degtyarev, Michael Fisher, and Boris Konev | Monodic temporal resolution | 38 pages, 3 figures | null | null | null | cs.LO | null | Until recently, First-Order Temporal Logic (FOTL) has been little understood.
While it is well known that the full logic has no finite axiomatisation, a more
detailed analysis of fragments of the logic was not previously available.
However, a breakthrough by Hodkinson et.al., identifying a finitely
axiomatisable fragment, termed the monodic fragment, has led to improved
understanding of FOTL. Yet, in order to utilise these theoretical advances, it
is important to have appropriate proof techniques for the monodic fragment.
In this paper, we modify and extend the clausal temporal resolution
technique, originally developed for propositional temporal logics, to enable
its use in such monodic fragments. We develop a specific normal form for
formulae in FOTL, and provide a complete resolution calculus for formulae in
this form. Not only is this clausal resolution technique useful as a practical
proof technique for certain monodic classes, but the use of this approach
provides us with increased understanding of the monodic fragment. In
particular, we here show how several features of monodic FOTL are established
as corollaries of the completeness result for the clausal temporal resolution
method. These include definitions of new decidable monodic classes,
simplification of existing monodic classes by reductions, and completeness of
clausal temporal resolution in the case of monodic logics with expanding
domains, a case with much significance in both theory and practice.
| [
{
"version": "v1",
"created": "Tue, 10 Jun 2003 10:02:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Degtyarev",
"Anatoly",
""
],
[
"Fisher",
"Michael",
""
],
[
"Konev",
"Boris",
""
]
]
| new_dataset | 0.987359 |
cs/0306048 | Judith Beumer | Jianwei Li, Wei-keng Liao, Alok Choudhary, Robert Ross, Rajeev Thakur,
William Gropp, Rob Latham | Parallel netCDF: A Scientific High-Performance I/O Interface | 10 pages,7 figures | null | null | Preprint ANL/MCS-P1048-0503 | cs.DC | null | Dataset storage, exchange, and access play a critical role in scientific
applications. For such purposes netCDF serves as a portable and efficient file
format and programming interface, which is popular in numerous scientific
application domains. However, the original interface does not provide an
efficient mechanism for parallel data storage and access. In this work, we
present a new parallel interface for writing and reading netCDF datasets. This
interface is derived with minimum changes from the serial netCDF interface but
defines semantics for parallel access and is tailored for high performance. The
underlying parallel I/O is achieved through MPI-IO, allowing for dramatic
performance gains through the use of collective I/O optimizations. We compare
the implementation strategies with HDF5 and analyze both. Our tests indicate
programming convenience and significant I/O performance improvement with this
parallel netCDF interface.
| [
{
"version": "v1",
"created": "Wed, 11 Jun 2003 20:25:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Jianwei",
""
],
[
"Liao",
"Wei-keng",
""
],
[
"Choudhary",
"Alok",
""
],
[
"Ross",
"Robert",
""
],
[
"Thakur",
"Rajeev",
""
],
[
"Gropp",
"William",
""
],
[
"Latham",
"Rob",
""
]
]
| new_dataset | 0.991702 |
cs/0306049 | Vince Grolmusz | Vince Grolmusz | Hyperdense Coding Modulo 6 with Filter-Machines | null | null | null | null | cs.CC cs.DB | null | We show how one can encode $n$ bits with $n^{o(1)}$ ``wave-bits'' using still
hypothetical filter-machines (here $o(1)$ denotes a positive quantity which
goes to 0 as $n$ goes to infity). Our present result - in a completely
different computational model - significantly improves on the quantum
superdense-coding breakthrough of Bennet and Wiesner (1992) which encoded $n$
bits by $\lceil{n/2}\rceil$ quantum-bits. We also show that our earlier
algorithm (Tech. Rep. TR03-001, ECCC, See
ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03-001/index.html) which
used $n^{o(1)}$ muliplication for computing a representation of the dot-product
of two $n$-bit sequences modulo 6, and, similarly, an algorithm for computing a
representation of the multiplication of two $n\times n$ matrices with
$n^{2+o(1)}$ multiplications can be turned to algorithms computing the exact
dot-product or the exact matrix-product with the same number of multiplications
with filter-machines. With classical computation, computing the dot-product
needs $\Omega(n)$ multiplications and the best known algorithm for matrix
multiplication (D. Coppersmith and S. Winograd, Matrix multiplication via
arithmetic progressions, J. Symbolic Comput., 9(3):251--280, 1990) uses
$n^{2.376}$ multiplications.
| [
{
"version": "v1",
"created": "Wed, 11 Jun 2003 20:31:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Grolmusz",
"Vince",
""
]
]
| new_dataset | 0.966207 |
cs/0306051 | Atsushi Manabe | Atsushi Manabe, Kohki Ishikawa, Yoshihiko Itoh, Setsuya Kawabata,
Tetsuro Mashimo, Youhei Morita, Hiroshi Sakamoto, Takashi Sasaki, Hiroyuki
Sato, Junichi Tanaka, Ikuo Ueda, Yoshiyuki Watase, Satomi Yamamoto, Shigeo
Yashiro | A data Grid testbed environment in Gigabit WAN with HPSS | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, LaTeX, 9 figures, PSN
THCT002 | null | null | null | cs.DC | null | For data analysis of large-scale experiments such as LHC Atlas and other
Japanese high energy and nuclear physics projects, we have constructed a Grid
test bed at ICEPP and KEK. These institutes are connected to national
scientific gigabit network backbone called SuperSINET. In our test bed, we have
installed NorduGrid middleware based on Globus, and connected 120TB HPSS at KEK
as a large scale data store. Atlas simulation data at ICEPP has been
transferred and accessed using SuperSINET. We have tested various performances
and characteristics of HPSS through this high speed WAN. The measurement
includes comparison between computing and storage resources are tightly coupled
with low latency LAN and long distant WAN.
| [
{
"version": "v1",
"created": "Thu, 12 Jun 2003 08:48:16 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Sep 2003 05:44:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Manabe",
"Atsushi",
""
],
[
"Ishikawa",
"Kohki",
""
],
[
"Itoh",
"Yoshihiko",
""
],
[
"Kawabata",
"Setsuya",
""
],
[
"Mashimo",
"Tetsuro",
""
],
[
"Morita",
"Youhei",
""
],
[
"Sakamoto",
"Hiroshi",
""
],
[
"Sasaki",
"Takashi",
""
],
[
"Sato",
"Hiroyuki",
""
],
[
"Tanaka",
"Junichi",
""
],
[
"Ueda",
"Ikuo",
""
],
[
"Watase",
"Yoshiyuki",
""
],
[
"Yamamoto",
"Satomi",
""
],
[
"Yashiro",
"Shigeo",
""
]
]
| new_dataset | 0.998399 |
cs/0306054 | David Chamont | D. Chamont and C. Charlot | OVAL: the CMS Testing Robot | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, LaTeX, 0 eps figures. PSN
MOJT005 | null | null | null | cs.SE | null | Oval is a testing tool which help developers to detect unexpected changes in
the behavior of their software. It is able to automatically compile some test
programs, to prepare on the fly the needed configuration files, to run the
tests within a specified Unix environment, and finally to analyze the output
and check expectations. Oval does not provide utility code to help writing the
tests, therefore it is quite independant of the programming/scripting language
of the software to be tested. It can be seen as a kind of robot which apply the
tests and warn about any unexpected change in the output. Oval was developed by
the LLR laboratory for the needs of the CMS experiment, and it is now
recommended by the CERN LCG project.
| [
{
"version": "v1",
"created": "Thu, 12 Jun 2003 17:08:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chamont",
"D.",
""
],
[
"Charlot",
"C.",
""
]
]
| new_dataset | 0.999554 |
cs/0306055 | Jeremiah M. Mans | Jeremiah Mans and David Bengali | BlueOx: A Java Framework for Distributed Data Analysis | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, LaTeX, 1 eps figure. PSN
TULT006 | null | null | null | cs.DC | null | High energy physics experiments including those at the Tevatron and the
upcoming LHC require analysis of large data sets which are best handled by
distributed computation. We present the design and development of a distributed
data analysis framework based on Java. Analysis jobs run through three phases:
discovery of data sets available, brokering/assignment of data sets to analysis
servers, and job execution. Each phase is represented by a set of abstract
interfaces. These interfaces allow different techniques to be used without
modification to the framework. For example, the communications interface has
been implemented by both a packet protocol and a SOAP-based scheme. User
authentication can be provided either through simple passwords or through a GSI
certificates system. Data from CMS HCAL Testbeams, the L3 LEP experiment, and a
hypothetical high-energy linear collider experiment have been interfaced with
the framework.
| [
{
"version": "v1",
"created": "Thu, 12 Jun 2003 15:53:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mans",
"Jeremiah",
""
],
[
"Bengali",
"David",
""
]
]
| new_dataset | 0.977425 |
cs/0306057 | Simon Patton | S. Patton, D. Glowacki | IceCube's Development Environment | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 6 pages, 9 Figures, LaTeX. PSN
MONT001 | null | null | null | cs.SE | null | When the IceCube experiment started serious software development it needed a
development environment in which both its developers and clients could work and
that would encourage and support a good software development process. Some of
the key features that IceCube wanted in such a environment were: the separation
of the configuration and build tools; inclusion of an issue tracking system;
support for the Unified Change Model; support for unit testing; and support for
continuous building. No single, affordable, off the shelf, environment offered
all these features. However there are many open source tools that address
subsets of these feature, therefore IceCube set about selecting those tools
which it could use in developing its own environment and adding its own tools
where no suitable tools were found. This paper outlines the tools that where
chosen, what are their responsibilities in the development environment and how
they fit together. The complete environment will be demonstrated with a walk
through of single cycle of the development process.
| [
{
"version": "v1",
"created": "Thu, 12 Jun 2003 17:31:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Patton",
"S.",
""
],
[
"Glowacki",
"D.",
""
]
]
| new_dataset | 0.994323 |
cs/0306059 | Joseph Perl | J. Perl, R. Giannitrapani, M. Frailis | The Use of HepRep in GLAST | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 9 pages pdf, 15 figures. PSN THLT009 | null | null | SLAC-PUB-9908 | cs.GR | null | HepRep is a generic, hierarchical format for description of graphics
representables that can be augmented by physics information and relational
properties. It was developed for high energy physics event display applications
and is especially suited to client/server or component frameworks. The GLAST
experiment, an international effort led by NASA for a gamma-ray telescope to
launch in 2006, chose HepRep to provide a flexible, extensible and maintainable
framework for their event display without tying their users to any one graphics
application. To support HepRep in their GUADI infrastructure, GLAST developed a
HepRep filler and builder architecture. The architecture hides the details of
XML and CORBA in a set of base and helper classes allowing physics experts to
focus on what data they want to represent. GLAST has two GAUDI services:
HepRepSvc, which registers HepRep fillers in a global registry and allows the
HepRep to be exported to XML, and CorbaSvc, which allows the HepRep to be
published through a CORBA interface and which allows the client application to
feed commands back to GAUDI (such as start next event, or run some GAUDI
algorithm). GLAST's HepRep solution gives users a choice of client
applications, WIRED (written in Java) or FRED (written in C++ and Ruby), and
leaves them free to move to any future HepRep-compliant event display.
| [
{
"version": "v1",
"created": "Thu, 12 Jun 2003 20:37:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Perl",
"J.",
""
],
[
"Giannitrapani",
"R.",
""
],
[
"Frailis",
"M.",
""
]
]
| new_dataset | 0.954524 |
cs/0306060 | Andrei Tsaregorodtsev | N.Brook, A.Bogdanchikov, A.Buckley, J.Closier, U.Egede, M.Frank,
D.Galli, M.Gandelman, V.Garonne, C.Gaspar, R.Graciani Diaz, K.Harrison, E.van
Herwijnen, A.Khan, S.Klous, I.Korolko, G.Kuznetsov, F.Loverre, U.Marconi,
J.P.Palacios, G.N.Patrick, A.Pickford, S.Ponce, V.Romanovski, J.J.Saborido,
M.Schmelling, A.Soroko, A.Tsaregorodtsev, V.Vagnoni, A.Washbrook | DIRAC - Distributed Infrastructure with Remote Agent Control | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 8 pages, Word, 5 figures. PSN
TUAT006 | null | null | null | cs.DC | null | This paper describes DIRAC, the LHCb Monte Carlo production system. DIRAC has
a client/server architecture based on: Compute elements distributed among the
collaborating institutes; Databases for production management, bookkeeping (the
metadata catalogue) and software configuration; Monitoring and cataloguing
services for updating and accessing the databases. Locally installed software
agents implemented in Python monitor the local batch queue, interrogate the
production database for any outstanding production requests using the XML-RPC
protocol and initiate the job submission. The agent checks and, if necessary,
installs any required software automatically. After the job has processed the
events, the agent transfers the output data and updates the metadata catalogue.
DIRAC has been successfully installed at 18 collaborating institutes, including
the DataGRID, and has been used in recent Physics Data Challenges. In the near
to medium term future we must use a mixed environment with different types of
grid middleware or no middleware. We describe how this flexibility has been
achieved and how ubiquitously available grid middleware would improve DIRAC.
| [
{
"version": "v1",
"created": "Thu, 12 Jun 2003 23:54:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Brook",
"N.",
""
],
[
"Bogdanchikov",
"A.",
""
],
[
"Buckley",
"A.",
""
],
[
"Closier",
"J.",
""
],
[
"Egede",
"U.",
""
],
[
"Frank",
"M.",
""
],
[
"Galli",
"D.",
""
],
[
"Gandelman",
"M.",
""
],
[
"Garonne",
"V.",
""
],
[
"Gaspar",
"C.",
""
],
[
"Diaz",
"R. Graciani",
""
],
[
"Harrison",
"K.",
""
],
[
"van Herwijnen",
"E.",
""
],
[
"Khan",
"A.",
""
],
[
"Klous",
"S.",
""
],
[
"Korolko",
"I.",
""
],
[
"Kuznetsov",
"G.",
""
],
[
"Loverre",
"F.",
""
],
[
"Marconi",
"U.",
""
],
[
"Palacios",
"J. P.",
""
],
[
"Patrick",
"G. N.",
""
],
[
"Pickford",
"A.",
""
],
[
"Ponce",
"S.",
""
],
[
"Romanovski",
"V.",
""
],
[
"Saborido",
"J. J.",
""
],
[
"Schmelling",
"M.",
""
],
[
"Soroko",
"A.",
""
],
[
"Tsaregorodtsev",
"A.",
""
],
[
"Vagnoni",
"V.",
""
],
[
"Washbrook",
"A.",
""
]
]
| new_dataset | 0.995774 |
cs/0306068 | Pablo Saiz | Pablo Saiz, Predrag Buncic, Andreas J. Peters | AliEn Resource Brokers | 5 pages, 8 figures, CHEP 03 conference | null | null | null | cs.DC | null | AliEn (ALICE Environment) is a lightweight GRID framework developed by the
Alice Collaboration. When the experiment starts running, it will collect data
at a rate of approximately 2 PB per year, producing O(109) files per year. All
these files, including all simulated events generated during the preparation
phase of the experiment, must be accounted and reliably tracked in the GRID
environment. The backbone of AliEn is a distributed file catalogue, which
associates universal logical file name to physical file names for each dataset
and provides transparent access to datasets independently of physical location.
The file replication and transport is carried out under the control of the File
Transport Broker. In addition, the file catalogue maintains information about
every job running in the system. The jobs are distributed by the Job Resource
Broker that is implemented using a simplified pull (as opposed to traditional
push) architecture. This paper describes the Job and File Transport Resource
Brokers and shows that a similar architecture can be applied to solve both
problems.
| [
{
"version": "v1",
"created": "Fri, 13 Jun 2003 16:00:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Saiz",
"Pablo",
""
],
[
"Buncic",
"Predrag",
""
],
[
"Peters",
"Andreas J.",
""
]
]
| new_dataset | 0.999252 |
cs/0306071 | Andreas-Joachim Peters | Andreas J. Peters, P. Saiz, P. Buncic | AliEnFS - a Linux File System for the AliEn Grid Services | 9 pages, 12 figures | null | null | null | cs.DC | null | Among the services offered by the AliEn (ALICE Environment
http://alien.cern.ch) Grid framework there is a virtual file catalogue to allow
transparent access to distributed data-sets using various file transfer
protocols. $alienfs$ (AliEn File System) integrates the AliEn file catalogue as
a new file system type into the Linux kernel using LUFS, a hybrid user space
file system framework (Open Source http://lufs.sourceforge.net). LUFS uses a
special kernel interface level called VFS (Virtual File System Switch) to
communicate via a generalised file system interface to the AliEn file system
daemon. The AliEn framework is used for authentication, catalogue browsing,
file registration and read/write transfer operations. A C++ API implements the
generic file system operations. The goal of AliEnFS is to allow users easy
interactive access to a worldwide distributed virtual file system using
familiar shell commands (f.e. cp,ls,rm ...) The paper discusses general aspects
of Grid File Systems, the AliEn implementation and present and future
developments for the AliEn Grid File System.
| [
{
"version": "v1",
"created": "Fri, 13 Jun 2003 18:18:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Peters",
"Andreas J.",
""
],
[
"Saiz",
"P.",
""
],
[
"Buncic",
"P.",
""
]
]
| new_dataset | 0.994379 |
cs/0306083 | Wim T. L. P. Lavrijsen | W.T.L.P. Lavrijsen | The Athena Startup Kit | 5 pages, 1 figure, CHEP 2003, March 2003, La Jolla, California, PSN
TUJT002 | null | null | null | cs.SE | null | The Athena Startup Kit (ASK), is an interactive front-end to the Atlas
software framework (ATHENA). Written in python, a very effective "glue"
language, it is build on top of the, in principle unrelated, code repository,
build, configuration, debug, binding, and analysis tools. ASK automates many
error-prone tasks that are otherwise left to the end-user, thereby pre-empting
a whole category of potential problems. Through the existing tools, which ASK
will setup for the user if and as needed, it locates available resources,
maintains job coherency, manages the run-time environment, allows for
interactivity and debugging, and provides standalone execution scripts. An
end-user who wants to run her own analysis algorithms within the standard
environment can let ASK generate the appropriate skeleton package, the needed
dependencies and run-time, as well as a default job options script. For new and
casual users, ASK comes with a graphical user interface; for advanced users,
ASK has a scriptable command line interface. Both are built on top of the same
set of libraries. ASK does not need to be, and isn't, experiment neutral. Thus
it has built-in workarounds for known gotcha's, that would otherwise be a major
time-sink for each and every new user. ASK minimizes the overhead for those
physicists in Atlas who just want to write and run their analysis code.
| [
{
"version": "v1",
"created": "Sat, 14 Jun 2003 03:03:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lavrijsen",
"W. T. L. P.",
""
]
]
| new_dataset | 0.998662 |
cs/0306085 | Wim T. L. P. Lavrijsen | K. Harrison, W.T.L.P. Lavrijsen, P. Mato, A. Soroko, C.L. Tan, C.E.
Tull, N. Brook, R.W.L. Jones | GANGA: a user-Grid interface for Atlas and LHCb | 9 pages, 3 figures, CHEP 2003, March 2003, La Jolla, California, PSN
TUCT002 | null | null | null | cs.SE | null | The Gaudi/Athena and Grid Alliance (GANGA) is a front-end for the
configuration, submission, monitoring, bookkeeping, output collection, and
reporting of computing jobs run on a local batch system or on the grid. In
particular, GANGA handles jobs that use applications written for the Gaudi
software framework shared by the Atlas and LHCb experiments. GANGA exploits the
commonality of Gaudi-based computing jobs, while insulating against grid-,
batch- and framework-specific technicalities, to maximize end-user productivity
in defining, configuring, and executing jobs. Designed for a python-based
component architecture, GANGA has a modular underpinning and is therefore well
placed for contributing to, and benefiting from, work in related projects. Its
functionality is accessible both from a scriptable command-line interface, for
expert users and automated tasks, and through a graphical interface, which
simplifies the interaction with GANGA for beginning and c1asual users.
This paper presents the GANGA design and implementation, the development of
the underlying software bus architecture, and the functionality of the first
public GANGA release.
| [
{
"version": "v1",
"created": "Sat, 14 Jun 2003 02:57:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Harrison",
"K.",
""
],
[
"Lavrijsen",
"W. T. L. P.",
""
],
[
"Mato",
"P.",
""
],
[
"Soroko",
"A.",
""
],
[
"Tan",
"C. L.",
""
],
[
"Tull",
"C. E.",
""
],
[
"Brook",
"N.",
""
],
[
"Jones",
"R. W. L.",
""
]
]
| new_dataset | 0.993745 |
cs/0306089 | Paolo Calafiura | P. Calafiura, C.G. Leggett, D.R. Quarrie, H. Ma, S. Rajagopalan | The StoreGate: a Data Model for the Atlas Software Architecture | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 4 pages, LaTeX, MOJT008 | null | null | null | cs.SE | null | The Atlas collaboration at CERN has adopted the Gaudi software architecture
which belongs to the blackboard family: data objects produced by knowledge
sources (e.g. reconstruction modules) are posted to a common in-memory data
base from where other modules can access them and produce new data objects. The
StoreGate has been designed, based on the Atlas requirements and the experience
of other HENP systems such as Babar, CDF, CLEO, D0 and LHCB, to identify in a
simple and efficient fashion (collections of) data objects based on their type
and/or the modules which posted them to the Transient Data Store (the
blackboard). The developer also has the freedom to use her preferred key class
to uniquely identify a data object according to any other criterion. Besides
this core functionality, the StoreGate provides the developers with a powerful
interface to handle in a coherent fashion persistable references, object
lifetimes, memory management and access control policy for the data objects in
the Store. It also provides a Handle/Proxy mechanism to define and hide the
cache fault mechanism: upon request, a missing Data Object can be transparently
created and added to the Transient Store presumably retrieving it from a
persistent data-base, or even reconstructing it on demand.
| [
{
"version": "v1",
"created": "Sat, 14 Jun 2003 06:56:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Calafiura",
"P.",
""
],
[
"Leggett",
"C. G.",
""
],
[
"Quarrie",
"D. R.",
""
],
[
"Ma",
"H.",
""
],
[
"Rajagopalan",
"S.",
""
]
]
| new_dataset | 0.998598 |
cs/0306094 | Bebo White | Ray Cowan, Yogesh Deshpande, and Bebo White | BaBar - A Community Web Site in an Organizational Setting | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 8 pages, PDF, PSN MONT006 | null | null | null | cs.IR | null | The BABAR Web site was established in 1993 at the Stanford Linear Accelerator
Center (SLAC) to support the BABAR experiment, to report its results, and to
facilitate communication among its scientific and engineering collaborators,
currently numbering about 600 individuals from 75 collaborating institutions in
10 countries. The BABAR Web site is, therefore, a community Web site. At the
same time it is hosted at SLAC and funded by agencies that demand adherence to
policies decided under different priorities. Additionally, the BABAR Web
administrators deal with the problems that arise during the course of managing
users, content, policies, standards, and changing technologies. Desired
solutions to some of these problems may be incompatible with the overall
administration of the SLAC Web sites and/or the SLAC policies and concerns.
There are thus different perspectives of the same Web site and differing
expectations in segments of the SLAC population which act as constraints and
challenges in any review or re-engineering activities. Web Engineering, which
post-dates the BABAR Web, has aimed to provide a comprehensive understanding of
all aspects of Web development. This paper reports on the first part of a
recent review of application of Web Engineering methods to the BABAR Web site,
which has led to explicit user and information models of the BABAR community
and how SLAC and the BABAR community relate and react to each other. The paper
identifies the issues of a community Web site in a hierarchical,
semi-governmental sector and formulates a strategy for periodic reviews of
BABAR and similar sites.
| [
{
"version": "v1",
"created": "Mon, 16 Jun 2003 06:12:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cowan",
"Ray",
""
],
[
"Deshpande",
"Yogesh",
""
],
[
"White",
"Bebo",
""
]
]
| new_dataset | 0.999699 |
cs/0306103 | Alexandre Vaniachine | A. Vaniachine, S. Eckmann, D. Malon (1), P. Nevski, T. Wenaus (2) ((1)
Argonne National Laboratory, (2) Brookhaven National Laboratory) | Primary Numbers Database for ATLAS Detector Description Parameters | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 6 pages, 5 figures, pdf. PSN MOKT006 | null | null | ANL-HEP-CP-03-050 | cs.DB cs.HC | null | We present the design and the status of the database for detector description
parameters in ATLAS experiment. The ATLAS Primary Numbers are the parameters
defining the detector geometry and digitization in simulations, as well as
certain reconstruction parameters. Since the detailed ATLAS detector
description needs more than 10,000 such parameters, a preferred solution is to
have a single verified source for all these data. The database stores the data
dictionary for each parameter collection object, providing schema evolution
support for object-based retrieval of parameters. The same Primary Numbers are
served to many different clients accessing the database: the ATLAS software
framework Athena, the Geant3 heritage framework Atlsim, the Geant4 developers
framework FADS/Goofy, the generator of XML output for detector description, and
several end-user clients for interactive data navigation, including web-based
browsers and ROOT. The choice of the MySQL database product for the
implementation provides additional benefits: the Primary Numbers database can
be used on the developers laptop when disconnected (using the MySQL embedded
server technology), with data being updated when the laptop is connected (using
the MySQL database replication).
| [
{
"version": "v1",
"created": "Mon, 16 Jun 2003 19:59:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vaniachine",
"A.",
""
],
[
"Eckmann",
"S.",
""
],
[
"Malon",
"D.",
""
],
[
"Nevski",
"P.",
""
],
[
"Wenaus",
"T.",
""
]
]
| new_dataset | 0.997956 |
cs/0306130 | P. V. S. Ram Babu | Akshar Bharati, Vineet Chaitanya, Amba P. Kulkarni, Rajeev Sangal | Anusaaraka: Machine Translation in Stages | 5 pages, Published in Vivek, A Quarterly in Artificial Intelligence,
10, 3, July 1997, pp. 22-25 | Vivek, A Quarterly in Artificial Intelligence, 10, 3, July 1997,
pp. 22-25 | null | null | cs.CL cs.AI | null | Fully-automatic general-purpose high-quality machine translation systems
(FGH-MT) are extremely difficult to build. In fact, there is no system in the
world for any pair of languages which qualifies to be called FGH-MT. The
reasons are not far to seek. Translation is a creative process which involves
interpretation of the given text by the translator. Translation would also vary
depending on the audience and the purpose for which it is meant. This would
explain the difficulty of building a machine translation system. Since, the
machine is not capable of interpreting a general text with sufficient accuracy
automatically at present - let alone re-expressing it for a given audience, it
fails to perform as FGH-MT. FOOTNOTE{The major difficulty that the machine
faces in interpreting a given text is the lack of general world knowledge or
common sense knowledge.}
| [
{
"version": "v1",
"created": "Wed, 25 Jun 2003 10:26:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bharati",
"Akshar",
""
],
[
"Chaitanya",
"Vineet",
""
],
[
"Kulkarni",
"Amba P.",
""
],
[
"Sangal",
"Rajeev",
""
]
]
| new_dataset | 0.98847 |
cs/0307004 | Robert Ghrist | A. Abrams and R. Ghrist | State complexes for metamorphic robots | 19 pages; based on paper presented at Workshop in Algorithmic
Foundations of Robotics, December 2002 | null | null | null | cs.RO cs.CG | null | A metamorphic robotic system is an aggregate of homogeneous robot units which
can individually and selectively locomote in such a way as to change the global
shape of the system. We introduce a mathematical framework for defining and
analyzing general metamorphic robots. This formal structure, combined with
ideas from geometric group theory, leads to a natural extension of a
configuration space for metamorphic robots -- the state complex -- which is
especially adapted to parallelization. We present an algorithm for optimizing
reconfiguration sequences with respect to elapsed time. A universal geometric
property of state complexes -- non-positive curvature -- is the key to proving
convergence to the globally time-optimal solution.
| [
{
"version": "v1",
"created": "Wed, 2 Jul 2003 19:41:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Abrams",
"A.",
""
],
[
"Ghrist",
"R.",
""
]
]
| new_dataset | 0.988151 |
cs/0307042 | Joseph O'Rourke | Mirela Damian and Joseph O'Rourke | A Note on Objects Built From Bricks without Corners | 5 pages, 3 figures | null | null | null | cs.CG cs.DM | null | We report a small advance on a question raised by Robertson, Schweitzer, and
Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks
without corners, and asked whether every genus-0 such polyhedron must have a
corner. A brick is a parallelopiped, and a corner is a brick of degree three or
less in the brick graph. We describe a genus-3 polyhedron built from bricks
with no corner, narrowing the genus gap.
| [
{
"version": "v1",
"created": "Thu, 17 Jul 2003 20:46:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Damian",
"Mirela",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.99882 |
cs/0307044 | K\^oiti Hasida | Koiti Hasida | The Linguistic DS: Linguisitic Description in MPEG-7 | 40 pages, 4 figures | null | null | null | cs.CL | null | MPEG-7 (Moving Picture Experts Group Phase 7) is an XML-based international
standard on semantic description of multimedia content. This document discusses
the Linguistic DS and related tools. The linguistic DS is a tool, based on the
GDA tag set (http://i-content.org/GDA/tagset.html), for semantic annotation of
linguistic data in or associated with multimedia content. The current document
text reflects `Study of FPDAM - MPEG-7 MDS Extensions' issued in March 2003,
and not most part of MPEG-7 MDS, for which the readers are referred to the
first version of MPEG-7 MDS document available from ISO (http://www.iso.org).
Without that reference, however, this document should be mostly intelligible to
those who are familiar with XML and linguistic theories. Comments are welcome
and will be considered in the standardization process.
| [
{
"version": "v1",
"created": "Sat, 19 Jul 2003 12:24:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hasida",
"Koiti",
""
]
]
| new_dataset | 0.997715 |
cs/0307050 | Amar Isli | Amar Isli | A ternary Relation Algebra of directed lines | 60 pages. Submitted. Technical report mentioned in "Report-no" below
is an earlier version of the work, and its title differs slightly (Reasoning
about relative position of directed lines as a ternary Relation Algebra (RA):
presentation of the RA and of its use in the concrete domain of an
ALC(D)-like description logic) | null | null | Technical report FBI-HH-M-313/02, Fachbereich Informatik,
Universitaet Hamburg | cs.AI | null | We define a ternary Relation Algebra (RA) of relative position relations on
two-dimensional directed lines (d-lines for short). A d-line has two degrees of
freedom (DFs): a rotational DF (RDF), and a translational DF (TDF). The
representation of the RDF of a d-line will be handled by an RA of 2D
orientations, CYC_t, known in the literature. A second algebra, TA_t, which
will handle the TDF of a d-line, will be defined. The two algebras, CYC_t and
TA_t, will constitute, respectively, the translational and the rotational
components of the RA, PA_t, of relative position relations on d-lines: the PA_t
atoms will consist of those pairs <t,r> of a TA_t atom and a CYC_t atom that
are compatible. We present in detail the RA PA_t, with its converse table, its
rotation table and its composition tables. We show that a (polynomial)
constraint propagation algorithm, known in the literature, is complete for a
subset of PA_t relations including almost all of the atomic relations. We will
discuss the application scope of the RA, which includes incidence geometry, GIS
(Geographic Information Systems), shape representation, localisation in
(multi-)robot navigation, and the representation of motion prepositions in NLP
(Natural Language Processing). We then compare the RA to existing ones, such as
an algebra for reasoning about rectangles parallel to the axes of an
(orthogonal) coordinate system, a ``spatial Odyssey'' of Allen's interval
algebra, and an algebra for reasoning about 2D segments.
| [
{
"version": "v1",
"created": "Mon, 21 Jul 2003 16:01:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Isli",
"Amar",
""
]
]
| new_dataset | 0.997634 |
cs/0307052 | Rajkumar Buyya | Hussein Gibbins and Rajkumar Buyya | Gridscape: A Tool for the Creation of Interactive and Dynamic Grid
Testbed Web Portals | 12 pages, 6 figures | null | null | July 2003 Research Report, GRIDS Lab @ The University of Melbourne | cs.DC | null | The notion of grid computing has gained an increasing popularity recently as
a realistic solution to many of our large-scale data storage and processing
needs. It enables the sharing, selection and aggregation of resources
geographically distributed across collaborative organisations. Now more and
more people are beginning to embrace grid computing and thus are seeing the
need to set up their own grids and grid testbeds. With this comes the need to
have some means to enable them to view and monitor the status of the resources
in these testbeds (eg. Web based Grid portal). Generally developers invest a
substantial amount of time and effort developing custom monitoring software. To
overcome this limitation, this paper proposes Gridscape ? a tool that enables
the rapid creation of interactive and dynamic testbed portals (without any
programming effort). Gridscape primarily aims to provide a solution for those
users who need to be able to create a grid testbed portal but don?t necessarily
have the time or resources to build a system of their own from scratch.
| [
{
"version": "v1",
"created": "Tue, 22 Jul 2003 12:27:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gibbins",
"Hussein",
""
],
[
"Buyya",
"Rajkumar",
""
]
]
| new_dataset | 0.9758 |
cs/0308004 | Gene Cooperman | Gene Cooperman, Xiaoqin Ma and Viet Ha Nguyen | DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators | 12 pages, 11 figures | null | null | null | cs.DB cs.DS | null | We present a new algorithm for fast record retrieval,
distribute-probe-gather, or DPG. DPG has important applications both in sorting
and in joins. Current main memory sorting algorithms split their work into
three phases: extraction of key-pointer pairs; sorting of the key-pointer
pairs; and copying of the original records into the destination array according
the sorted key-pointer pairs. The copying in the last phase dominates today's
sorting time. Hence, the use of DPG in the third phase provides an accelerator
for existing sorting algorithms.
DPG also provides two new join methods for foreign key joins: DPG-move join
and DPG-sort join. The resulting join methods with DPG are faster because DPG
join is cache-efficient and at the same time DPG join avoids the need for
sorting or for hashing. The ideas presented for foreign key join can also be
extended to faster record pair retrieval for spatial and temporal databases.
| [
{
"version": "v1",
"created": "Sat, 2 Aug 2003 08:13:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cooperman",
"Gene",
""
],
[
"Ma",
"Xiaoqin",
""
],
[
"Nguyen",
"Viet Ha",
""
]
]
| new_dataset | 0.991726 |
cs/0308015 | Shinji Yamane | Shinji Yamane, Jiahong Wang, Hironobu Suzuki, Norihisa Segawa and Yuko
Murayama | Rethinking OpenPGP PKI and OpenPGP Public Keyserver | 8 pages, 2 figures | null | null | null | cs.CY cs.CR | null | OpenPGP, an IETF Proposed Standard based on PGP application, has its own
Public Key Infrastructure (PKI) architecture which is different from the one
based on X.509, another standard from ITU. This paper describes the OpenPGP
PKI; the historical perspective as well as its current use. The current OpenPGP
PKI issues include the capability of a PGP keyserver and its performance. PGP
keyservers have been developed and operated by volunteers since the 1990s. The
keyservers distribute, merge, and expire the OpenPGP public keys. Major
keyserver managers from several countries have built the globally distributed
network of PGP keyservers. However, the current PGP Public Keyserver (pksd) has
some limitations. It does not support fully the OpenPGP format so that it is
neither expandable nor flexible, without any cluster technology. Finally we
introduce the project on the next generation OpenPGP public keyserver called
the OpenPKSD, lead by Hironobu Suzuki, one of the authors, and funded by
Japanese Information-technology Promotion Agency(IPA).
| [
{
"version": "v1",
"created": "Thu, 7 Aug 2003 16:33:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Yamane",
"Shinji",
""
],
[
"Wang",
"Jiahong",
""
],
[
"Suzuki",
"Hironobu",
""
],
[
"Segawa",
"Norihisa",
""
],
[
"Murayama",
"Yuko",
""
]
]
| new_dataset | 0.984566 |
cs/0308019 | P. V. S. Ram Babu | Akshar Bharati, Vineet Chaitanya, Amba P. Kulkarni, Rajeev Sangal | Language Access: An Information Based Approach | Published in the proceedings of Knowledge Based Computer Systems
conference, 2000, Tata McGraw-Hill, New Delhi, Dec. 2000 | Published in the proceedings of Knowledge Based Computer Systems
Conference, 2000, Tata McGraw Hill, New Delhi 2000 | null | LTRC-TR010 | cs.CL | null | The anusaaraka system (a kind of machine translation system) makes text in
one Indian language accessible through another Indian language. The machine
presents an image of the source text in a language close to the target
language. In the image, some constructions of the source language (which do not
have equivalents in the target language) spill over to the output. Some special
notation is also devised.
Anusaarakas have been built from five pairs of languages: Telugu,Kannada,
Marathi, Bengali and Punjabi to Hindi. They are available for use through Email
servers.
Anusaarkas follows the principle of substitutibility and reversibility of
strings produced. This implies preservation of information while going from a
source language to a target language.
For narrow subject areas, specialized modules can be built by putting subject
domain knowledge into the system, which produce good quality grammatical
output. However, it should be remembered, that such modules will work only in
narrow areas, and will sometimes go wrong. In such a situation, anusaaraka
output will still remain useful.
| [
{
"version": "v1",
"created": "Thu, 7 Aug 2003 09:40:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bharati",
"Akshar",
""
],
[
"Chaitanya",
"Vineet",
""
],
[
"Kulkarni",
"Amba P.",
""
],
[
"Sangal",
"Rajeev",
""
]
]
| new_dataset | 0.999547 |
cs/0308034 | Gerardo Iovane | G.Iovane, P.Giordano, C.Iovane, F.Rotulo | Fingerprint based bio-starter and bio-access | 4 pages, Proceeding of Automotive 2003, Turin (Italy) | null | null | null | cs.CV | null | In the paper will be presented a safety and security system based on
fingerprint technology. The results suggest a new scenario where the new cars
can use a fingerprint sensor integrated in car handle to allow access and in
the dashboard as starter button.
| [
{
"version": "v1",
"created": "Thu, 21 Aug 2003 10:47:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Iovane",
"G.",
""
],
[
"Giordano",
"P.",
""
],
[
"Iovane",
"C.",
""
],
[
"Rotulo",
"F.",
""
]
]
| new_dataset | 0.998616 |
cs/0308035 | Gerardo Iovane | G.Iovane, F.S.Tortoriello | IS (Iris Security) | 7 pages, Proceeding of NIDays 2003 (Sponsored by National
Instruments), Rome (Italy) | null | null | null | cs.CV | null | In the paper will be presented a safety system based on iridology. The
results suggest a new scenario where the security problem in supervised and
unsupervised areas can be treat with the present system and the iris image
recognition.
| [
{
"version": "v1",
"created": "Thu, 21 Aug 2003 10:52:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Iovane",
"G.",
""
],
[
"Tortoriello",
"F. S.",
""
]
]
| new_dataset | 0.997156 |
cs/0308036 | Shi Zhou | Shi Zhou and Raul J Mondragon | The Rich-Club Phenomenon In The Internet Topology | To be appeared in the IEEE Communications Letters | IEEE Communications Letters, vol. 8, no. 3, pp.180-182, March
2004. | 10.1109/LCOMM.2004.823426 | null | cs.NI | null | We show that the Internet topology at the Autonomous System (AS) level has a
rich--club phenomenon. The rich nodes, which are a small number of nodes with
large numbers of links, are very well connected to each other. The rich--club
is a core tier that we measured using the rich--club connectivity and the
node--node link distribution. We obtained this core tier without any heuristic
assumption between the ASes. The rich--club phenomenon is a simple qualitative
way to differentiate between power law topologies and provides a criterion for
new network models. To show this, we compared the measured rich--club of the AS
graph with networks obtained using the Barab\'asi--Albert (BA) scale--free
network model, the Fitness BA model and the Inet--3.0 model.
| [
{
"version": "v1",
"created": "Thu, 21 Aug 2003 11:05:19 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Sep 2003 10:49:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zhou",
"Shi",
""
],
[
"Mondragon",
"Raul J",
""
]
]
| new_dataset | 0.986182 |
cs/0309017 | David Renault | David Renault | Enumerating planar locally finite Cayley graphs | 19 pages, 6 PostScript figures, 12 embedded PsTricks figures. An
additional file (~ 438ko.) containing the figures in appendix might be found
at http://www.labri.fr/Perso/~renault/research/pages.ps.gz | null | null | null | cs.DM | null | We characterize the set of planar locally finite Cayley graphs, and give a
finite representation of these graphs by a special kind of finite state
automata called labeling schemes. As a result, we are able to enumerate and
describe all planar locally finite Cayley graphs of a given degree. This
analysis allows us to solve the problem of decision of the locally finite
planarity for a word-problem-decidable presentation.
Keywords: vertex-transitive, Cayley graph, planar graph, tiling, labeling
scheme
| [
{
"version": "v1",
"created": "Thu, 11 Sep 2003 09:59:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Renault",
"David",
""
]
]
| new_dataset | 0.99705 |
cs/0309031 | Kazutaka Maruyama | Kazutaka Maruyama, Minoru Terada | Timestamp Based Execution Control for C and Java Programs | In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth
International Workshop on Automated Debugging (AADEBUG 2003), September 2003,
Ghent. cs.SE/0309027 | null | null | null | cs.SE | null | Many programmers have had to deal with an overwritten variable resulting for
example from an aliasing problem. The culprit is obviously the last
write-access to that memory location before the manifestation of the bug. The
usual technique for removing such bugs starts with the debugger by (1) finding
the last write and (2) moving the control point of execution back to that time
by re-executing the program from the beginning. We wish to automate this. Step
(2) is easy if we can somehow mark the last write found in step (1) and control
the execution-point to move it back to this time.
In this paper we propose a new concept, position, that is, a point in the
program execution trace, as needed for step (2) above. The position enables
debuggers to automate the control of program execution to support common
debugging activities. We have implemented position in C by modifying GCC and in
Java with a bytecode transformer. Measurements show that position can be
provided with an acceptable amount of overhead.
| [
{
"version": "v1",
"created": "Wed, 17 Sep 2003 06:35:44 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Maruyama",
"Kazutaka",
""
],
[
"Terada",
"Minoru",
""
]
]
| new_dataset | 0.998848 |
cs/0309048 | Juergen Schmidhuber | Juergen Schmidhuber | Goedel Machines: Self-Referential Universal Problem Solvers Making
Provably Optimal Self-Improvements | 29 pages, 1 figure, minor improvements, updated references | Variants published in "Adaptive Agents and Multi-Agent Systems
II", LNCS 3394, p. 1-23, Springer, 2005: ISBN 978-3-540-25260-3; as well as
in Proc. ICANN 2005, LNCS 3697, p. 223-233, Springer, 2005 (plenary talk); as
well as in "Artificial General Intelligence", Series: Cognitive Technologies,
Springer, 2006: ISBN-13: 978-3-540-23733-4 | null | IDSIA-19-03 | cs.LO cs.AI | null | We present the first class of mathematically rigorous, general, fully
self-referential, self-improving, optimally efficient problem solvers. Inspired
by Kurt Goedel's celebrated self-referential formulas (1931), such a problem
solver rewrites any part of its own code as soon as it has found a proof that
the rewrite is useful, where the problem-dependent utility function and the
hardware and the entire initial code are described by axioms encoded in an
initial proof searcher which is also part of the initial code. The searcher
systematically and efficiently tests computable proof techniques (programs
whose outputs are proofs) until it finds a provably useful, computable
self-rewrite. We show that such a self-rewrite is globally optimal - no local
maxima! - since the code first had to prove that it is not useful to continue
the proof search for alternative self-rewrites. Unlike previous
non-self-referential methods based on hardwired proof searchers, ours not only
boasts an optimal order of complexity but can optimally reduce any slowdowns
hidden by the O()-notation, provided the utility of such speed-ups is provable
at all.
| [
{
"version": "v1",
"created": "Thu, 25 Sep 2003 15:59:46 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Oct 2003 09:56:02 GMT"
},
{
"version": "v3",
"created": "Thu, 11 Dec 2003 09:34:17 GMT"
},
{
"version": "v4",
"created": "Mon, 27 Dec 2004 11:16:21 GMT"
},
{
"version": "v5",
"created": "Sun, 17 Dec 2006 23:01:13 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Schmidhuber",
"Juergen",
""
]
]
| new_dataset | 0.997464 |
cs/0310013 | Franco Bagnoli | Franco Bagnoli, Fabio Franci, Francesco Mugelli, Andrea Sterbini | WebTeach in practice: the entrance test to the Engineering faculty in
Florence | 6 pages, 5 figures | null | null | null | cs.HC cs.IR | null | We present the WebTeach project, formed by a web interface to database for
test management, a wiki site for the diffusion of teaching material and student
forums, and a suite for the generation of multiple-choice mathematical quiz
with automatic elaboration of forms. This system has been massively tested for
the entrance test to the Engineering Faculty of the University of Florence,
Italy
| [
{
"version": "v1",
"created": "Wed, 8 Oct 2003 14:07:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bagnoli",
"Franco",
""
],
[
"Franci",
"Fabio",
""
],
[
"Mugelli",
"Francesco",
""
],
[
"Sterbini",
"Andrea",
""
]
]
| new_dataset | 0.996489 |
cs/0310025 | Mikhail Auguston | Mikhail Auguston, Clinton Jeffery, Scott Underwood | A Monitoring Language for Run Time and Post-Mortem Behavior Analysis and
Visualization | In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth
International Workshop on Automated Debugging (AADEBUG 2003), September 2003,
Ghent. cs.SE/0309027 | null | null | null | cs.SE cs.PL | null | UFO is a new implementation of FORMAN, a declarative monitoring language, in
which rules are compiled into execution monitors that run on a virtual machine
supported by the Alamo monitor architecture.
| [
{
"version": "v1",
"created": "Tue, 14 Oct 2003 21:06:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Auguston",
"Mikhail",
""
],
[
"Jeffery",
"Clinton",
""
],
[
"Underwood",
"Scott",
""
]
]
| new_dataset | 0.993933 |
cs/0310030 | Oliver Oppitz | Oliver Oppitz | A Particular Bug Trap: Execution Replay Using Virtual Machines | In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth
International Workshop on Automated Debugging (AADEBUG 2003), September 2003,
Ghent. cs.SE/0309027 | null | null | null | cs.DC | null | Execution-replay (ER) is well known in the literature but has been restricted
to special system architectures for many years. Improved hardware resources and
the maturity of virtual machine technology promise to make ER useful for a
broader range of development projects.
This paper describes an approach to create a practical, generic ER
infrastructure for desktop PC systems using virtual machine technology. In the
created VM environment arbitrary application programs will run and be replayed
unmodified, neither instrumentation nor recompilation are required.
| [
{
"version": "v1",
"created": "Wed, 15 Oct 2003 20:54:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Oppitz",
"Oliver",
""
]
]
| new_dataset | 0.995024 |
cs/0310054 | Bernhard M\"oller | J. Desharnais, B. M\"oller, G. Struth | Kleene algebra with domain | 40 pages | null | null | null | cs.LO | null | We propose Kleene algebra with domain (KAD), an extension of Kleene algebra
with two equational axioms for a domain and a codomain operation, respectively.
KAD considerably augments the expressiveness of Kleene algebra, in particular
for the specification and analysis of state transition systems. We develop the
basic calculus, discuss some related theories and present the most important
models of KAD. We demonstrate applicability by two examples: First, an
algebraic reconstruction of Noethericity and well-foundedness; second, an
algebraic reconstruction of propositional Hoare logic.
| [
{
"version": "v1",
"created": "Tue, 28 Oct 2003 16:09:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Desharnais",
"J.",
""
],
[
"Möller",
"B.",
""
],
[
"Struth",
"G.",
""
]
]
| new_dataset | 0.976992 |
cs/0310056 | Judith Beumer | William McCune | OTTER 3.3 Reference Manual | 66 pages | null | null | ANL/MCS-TM-263 | cs.SC cs.MS | null | OTTER is a resolution-style theorem-proving program for first-order logic
with equality. OTTER includes the inference rules binary resolution,
hyperresolution, UR-resolution, and binary paramodulation. Some of its other
abilities and features are conversion from first-order formulas to clauses,
forward and back subsumption, factoring, weighting, answer literals, term
ordering, forward and back demodulation, evaluable functions and predicates,
Knuth-Bendix completion, and the hints strategy. OTTER is coded in ANSI C, is
free, and is portable to many different kinds of computer.
| [
{
"version": "v1",
"created": "Tue, 28 Oct 2003 19:17:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"McCune",
"William",
""
]
]
| new_dataset | 0.997525 |
cs/0310062 | Miroslaw Truszczynski | Lengning Liu, Miroslaw Truszczynski | WSAT(cc) - a fast local-search ASP solver | Proceedings of LPNMR-03 (7th International Conference), LNCS,
Springer Verlag | null | null | null | cs.AI | null | We describe WSAT(cc), a local-search solver for computing models of theories
in the language of propositional logic extended by cardinality atoms. WSAT(cc)
is a processing back-end for the logic PS+, a recently proposed formalism for
answer-set programming.
| [
{
"version": "v1",
"created": "Fri, 31 Oct 2003 16:46:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Liu",
"Lengning",
""
],
[
"Truszczynski",
"Miroslaw",
""
]
]
| new_dataset | 0.998275 |
cs/0311006 | Paul M. Aoki | Allison Woodruff and Paul M. Aoki | How Push-To-Talk Makes Talk Less Pushy | 10 pages | Proc. ACM SIGGROUP Conf. on Supporting Group Work, Sanibel Island,
FL, Nov. 2003, 170-179. ACM Press. | 10.1145/958160.958187 | null | cs.HC | null | This paper presents an exploratory study of college-age students using
two-way, push-to-talk cellular radios. We describe the observed and reported
use of cellular radio by the participants. We discuss how the half-duplex,
lightweight cellular radio communication was associated with reduced
interactional commitment, which meant the cellular radios could be used for a
wide range of conversation styles. One such style, intermittent conversation,
is characterized by response delays. Intermittent conversation is surprising in
an audio medium, since it is typically associated with textual media such as
instant messaging. We present design implications of our findings.
| [
{
"version": "v1",
"created": "Fri, 7 Nov 2003 02:17:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Woodruff",
"Allison",
""
],
[
"Aoki",
"Paul M.",
""
]
]
| new_dataset | 0.989425 |
cs/0311032 | Oleg Mazonka | Oleg Mazonka, Daniel B. Cristofani | A Very Short Self-Interpreter | null | null | null | null | cs.PL | null | In this paper we would like to present a very short (possibly the shortest)
self-interpreter, based on a simplistic Turing-complete imperative language.
This interpreter explicitly processes the statements of the language, which
means the interpreter constitutes a description of the language inside that
same language. The paper does not require any specific knowledge; however,
experience in programming and a vivid imagination are beneficial.
| [
{
"version": "v1",
"created": "Fri, 21 Nov 2003 06:18:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mazonka",
"Oleg",
""
],
[
"Cristofani",
"Daniel B.",
""
]
]
| new_dataset | 0.99589 |
cs/0311035 | Milenko Petrovi\'c | Milenko Petrovic and Mokhtar Aboelaze | Improving TCP/IP Performance over Wireless IEEE 802.11 Link | 7 pages, ICWN 2002 (International Conference on Wireless Networks) | null | null | null | cs.NI cs.PF | null | Cellular phones, wireless laptops, personal portable devices that supports
both voice and data access are all examples of communicating devices that uses
wireless communication. Sine TCP/IP (and UDP) is the dominant technology in use
in the internet, it is expected that they will be used (and they are currently)
over wireless connections. In this paper, we investigate the performance of the
TCP (and UDP) over IEEE802.11 wireless MAC protocol. We investigate the
performance of the TCP and UDP assuming three different traffic patterns. First
bulk transmission where the main concern is the throughput. Second real-time
audio (using UDP) in the existence of bulk TCP transmission where the main
concern is the packet loss for audio traffic. Finally web traffic where the
main concern is the response time. We also investigate the effect of using
forward Error Correction (FEC) technique and the MAC sublayer parameters on the
throughput and response time.
| [
{
"version": "v1",
"created": "Mon, 24 Nov 2003 04:49:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Petrovic",
"Milenko",
""
],
[
"Aboelaze",
"Mokhtar",
""
]
]
| new_dataset | 0.998302 |
cs/0311038 | Wolfgang May | Wolfgang May | XPath-Logic and XPathLog: A Logic-Programming Style XML Data
Manipulation Language | null | null | null | null | cs.DB | null | We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a
clear, declarative language for querying and manipulating XML whose
perspectives are especially in XML data integration. In our characterization,
the formal semantics is defined wrt. an edge-labeled graph-based model which
covers the XML data model. We give a complete, logic-based characterization of
XML data and the main language concept for XML, XPath. XPath-Logic extends the
XPath language with variable bindings and embeds it into first-order logic.
XPathLog is then the Horn fragment of XPath-Logic, providing a Datalog-style,
rule-based language for querying and manipulating XML data. The model-theoretic
semantics of XPath-Logic serves as the base of XPathLog as a logic-programming
language, whereas also an equivalent answer-set semantics for evaluating
XPathLog queries is given. In contrast to other approaches, the XPath syntax
and semantics is also used for a declarative specification how the database
should be updated: when used in rule heads, XPath filters are interpreted as
specifications of elements and properties which should be added to the
database.
| [
{
"version": "v1",
"created": "Tue, 25 Nov 2003 09:42:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"May",
"Wolfgang",
""
]
]
| new_dataset | 0.999749 |
cs/0311049 | Milenko Petrovi\'c | Milenko Petrovic and Mokhtar Aboelaze | Performance of TCP/UDP under Ad Hoc IEEE802.11 | 9 pages, 5 figures, ICT 2003 (10th International Conference on
Telecommunication) | null | null | null | cs.NI cs.PF | null | TCP is the De facto standard for connection oriented transport layer
protocol, while UDP is the De facto standard for transport layer protocol,
which is used with real time traffic for audio and video. Although there have
been many attempts to measure and analyze the performance of the TCP protocol
in wireless networks, very few research was done on the UDP or the interaction
between TCP and UDP traffic over the wireless link. In this paper, we tudy the
performance of TCP and UDP over IEEE802.11 ad hoc network. We used two
topologies, a string and a mesh topology. Our work indicates that IEEE802.11 as
a ad-hoc network is not very suitable for bulk transfer using TCP. It also
indicates that it is much better for real-time audio. Although one has to be
careful here since real-time audio does require much less bandwidth than the
wireless link bandwidth. Careful and detailed studies are needed to further
clarify that issue.
| [
{
"version": "v1",
"created": "Thu, 27 Nov 2003 23:02:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Petrovic",
"Milenko",
""
],
[
"Aboelaze",
"Mokhtar",
""
]
]
| new_dataset | 0.999193 |
cs/0311054 | Douglas A. Galbi | Douglas A. Galbi | Copyright and Creativity: Authors and Photographers | Part of a larger work, "Sense in Communication," available at
http://www.galbithink.org That work includes material on "human/computer
interaction" and "neurons and cognition." | null | null | null | cs.CY cs.DL | null | The history of the occupations "author" and "photographer" provides an
insightful perspective on copyright and creativity. The concept of the romantic
author, associated with personal creative genius, gained prominence in the
eighteenth century. However, in the U.S. in 1900 only about three thousand
persons professed their occupation to be "author." Self-professed
"photographers" were then about ten times as numerous as authors. Being a
photographer was associated with manufacturing and depended only on mastering
technical skills and making a living. Being an author, in contrast, was an
elite status associated with science and literature. Across the twentieth
century, the number of writers and authors grew much more rapidly than the
number of photographers. The relative success of writers and authors in
creating jobs seems to have depended not on differences in copyright or
possibilities for self-production, but on greater occupational innovation.
Creativity in organizing daily work is an important form of creativity.
| [
{
"version": "v1",
"created": "Fri, 28 Nov 2003 19:33:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Galbi",
"Douglas A.",
""
]
]
| new_dataset | 0.997321 |
cs/0312005 | Alvaro Francisco Huertas Rosero | Alvaro Francisco Huertas-Rosero | A Cartography for 2x2 Symmetric Games | 13 pages, 7 figures This is a new version of the work, adapted to be
presented in the III Colombian Congress and I Andean International Conference
of Operational Research (Cartagena, Colombia, March 2004) | null | null | null | cs.GT | null | A bidimensional representation of the space of 2x2 Symmetric Games in the
strategic representation is proposed. This representation provides a tool for
the classification of 2x2 symmetric games, quantification of the fraction of
them having a certain feature, and predictions of changes in the
characteristics of a game when a change in done on the payoff matrix that
defines it.
| [
{
"version": "v1",
"created": "Tue, 2 Dec 2003 15:52:46 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Mar 2004 23:36:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Huertas-Rosero",
"Alvaro Francisco",
""
]
]
| new_dataset | 0.969603 |
cs/0312022 | Rajkumar Buyya | Manjuka Soysa, Rajkumar Buyya, and Baikunth Nath | GridEmail: A Case for Economically Regulated Internet-based
Interpersonal Communications | 15 pages, 10 figures, A Technical Report from Grid Computing and
Distributed Systems Laboratory, University of Melbourne, Australia | null | null | GRIDS-TR-2003-6 | cs.DC | null | Email has emerged as a dominant form of electronic communication between
people. Spam is a major problem for email users, with estimates of up to 56% of
email falling into that category. Control of Spam is being attempted with
technical and legislative methods. In this paper we look at email and spam from
a supply-demand perspective. We propose Gridemail, an email system based on an
economy of communicating parties, where participants? motivations are
represented as pricing policies and profiles. This system is expected to help
people regulate their personal communications to suit their conditions, and
help in removing unwanted messages.
| [
{
"version": "v1",
"created": "Fri, 12 Dec 2003 11:42:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Soysa",
"Manjuka",
""
],
[
"Buyya",
"Rajkumar",
""
],
[
"Nath",
"Baikunth",
""
]
]
| new_dataset | 0.992154 |
cs/0312030 | Jiyou Jia | Jiyou Jia | CSIEC (Computer Simulator in Educational Communication): An Intelligent
Web-Based Teaching System for Foreign Language Learning | 8 pages, 4 figures, 5 tables to appear on ED-MEDIA 2004 (World
Conference on Educational Multimedia, Hypermedia & Telecommunications) | null | null | null | cs.CY | null | In this paper we present an innovative intelligent web-based computer-aided
instruction system for foreign language learning: CSIEC (Computer Simulator in
Educational Communication). This system can not only grammatically understand
the sentences in English given from the users via Internet, but also reasonably
and individually speak with the users. At first the related works in this
research field are analyzed. Then we introduce the system goals and the system
framework, i.e., the natural language understanding mechanism (NLML, NLOMJ and
NLDB) and the communicational response (CR). Finally we give the syntactic and
semantic content of this instruction system, i.e. some important notations of
English grammar used in it and their relations with the NLOMJ.
| [
{
"version": "v1",
"created": "Tue, 16 Dec 2003 14:14:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jia",
"Jiyou",
""
]
]
| new_dataset | 0.997865 |
cs/0312031 | Daniel Cabeza | Daniel Cabeza and Manuel V. Hermenegildo | Distributed WWW Programming using (Ciao-)Prolog and the PiLLoW library | 32 pages, 4 figures | Theory and Practice of Logic Programming, Vol 1(3), 2001, 251-282 | null | null | cs.DC cs.PL | null | We discuss from a practical point of view a number of issues involved in
writing distributed Internet and WWW applications using LP/CLP systems. We
describe PiLLoW, a public-domain Internet and WWW programming library for
LP/CLP systems that we have designed in order to simplify the process of
writing such applications. PiLLoW provides facilities for accessing documents
and code on the WWW; parsing, manipulating and generating HTML and XML
structured documents and data; producing HTML forms; writing form handlers and
CGI-scripts; and processing HTML/XML templates. An important contribution of
PiLLoW is to model HTML/XML code (and, thus, the content of WWW pages) as
terms. The PiLLoW library has been developed in the context of the Ciao Prolog
system, but it has been adapted to a number of popular LP/CLP systems,
supporting most of its functionality. We also describe the use of concurrency
and a high-level model of client-server interaction, Ciao Prolog's active
modules, in the context of WWW programming. We propose a solution for
client-side downloading and execution of Prolog code, using generic browsers.
Finally, we also provide an overview of related work on the topic.
| [
{
"version": "v1",
"created": "Tue, 16 Dec 2003 19:09:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cabeza",
"Daniel",
""
],
[
"Hermenegildo",
"Manuel V.",
""
]
]
| new_dataset | 0.998003 |
cs/0401008 | Javier Segura | Amparo Gil, Javier Segura, Nico M. Temme | Algorithm xxx: Modified Bessel functions of imaginary order and positive
argument | 6 pages, 4 figures. To appear in ACM T. Math. Software | null | null | null | cs.MS cs.NA math.NA | null | Fortran 77 programs for the computation of modified Bessel functions of
purely imaginary order are presented. The codes compute the functions
$K_{ia}(x)$, $L_{ia}(x)$ and their derivatives for real $a$ and positive $x$;
these functions are independent solutions of the differential equation $x^2 w''
+x w' +(a^2 -x^2)w=0$. The code also computes exponentially scaled functions.
The range of computation is $(x,a)\in (0,1500]\times [-1500,1500]$ when scaled
functions are considered and it is larger than $(0,500]\times [-400,400]$ for
standard IEEE double precision arithmetic. The relative accuracy is better than
$10^{-13}$ in the range $(0,200]\times [-200,200]$ and close to $10^{-12}$ in
$(0,1500]\times [-1500,1500]$.
| [
{
"version": "v1",
"created": "Tue, 13 Jan 2004 14:29:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gil",
"Amparo",
""
],
[
"Segura",
"Javier",
""
],
[
"Temme",
"Nico M.",
""
]
]
| new_dataset | 0.992881 |
cs/0401010 | Nicolas Christin | Nicolas Christin and John Chuang | On the Cost of Participating in a Peer-to-Peer Network | 17 pages, 4 figures. Short version to be published in the Proceedings
of the Third International Workshop on Peer-to-Peer Systems (IPTPS'04). San
Diego, CA. February 2004 | null | null | p2pecon TR-2003-12-CC | cs.NI | null | In this paper, we model the cost incurred by each peer participating in a
peer-to-peer network. Such a cost model allows to gauge potential disincentives
for peers to collaborate, and provides a measure of the ``total cost'' of a
network, which is a possible benchmark to distinguish between proposals. We
characterize the cost imposed on a node as a function of the experienced load
and the node connectivity, and show how our model applies to a few proposed
routing geometries for distributed hash tables (DHTs). We further outline a
number of open questions this research has raised.
| [
{
"version": "v1",
"created": "Wed, 14 Jan 2004 02:32:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Christin",
"Nicolas",
""
],
[
"Chuang",
"John",
""
]
]
| new_dataset | 0.955578 |
cs/0401025 | Russell K. Standish | Richard Leow and Russell K. Standish | Running C++ models undet the Swarm environment | null | Proceedings SwarmFest 2003 | null | null | cs.MA | null | Objective-C is still the language of choice if users want to run their
simulation efficiently under the Swarm environment since the Swarm environment
itself was written in Objective-C. The language is a fast, object-oriented and
easy to learn. However, the language is less well known than, less expressive
than, and lacks support for many important features of C++ (eg. OpenMP for high
performance computing application). In this paper, we present a methodology and
software tools that we have developed for auto generating an Objective-C object
template (and all the necessary interfacing functions) from a given C++ model,
utilising the Classdesc's object description technology, so that the C++ model
can both be run and accessed under the Objective-C and C++ environments. We
also present a methodology for modifying an existing Swarm application to make
part of the model (eg. the heatbug's step method) run under the C++
environment.
| [
{
"version": "v1",
"created": "Tue, 27 Jan 2004 03:42:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Leow",
"Richard",
""
],
[
"Standish",
"Russell K.",
""
]
]
| new_dataset | 0.993783 |
cs/0402001 | Robert G. Capra III | Robert G. Capra, Manuel A. Perez-Quinones | Mobile Re-Finding of Web Information Using a Voice Interface | null | null | null | null | cs.HC cs.IR | null | Mobile access to information is a considerable problem for many users,
especially to information found on the Web. In this paper, we explore how a
voice-controlled service, accessible by telephone, could support mobile users'
needs for refinding specific information previously found on the Web. We
outline challenges in creating such a service and describe architectural and
user interfaces issues discovered in an exploratory prototype we built called
WebContext.
We also present the results of a study, motivated by our experience with
WebContext, to explore what people remember about information that they are
trying to refind and how they express information refinding requests in a
collaborative conversation. As part of the study, we examine how
end-usercreated Web page annotations can be used to help support mobile
information re-finding. We observed the use of URLs, page titles, and
descriptions of page contents to help identify waypoints in the search process.
Furthermore, we observed that the annotations were utilized extensively,
indicating that explicitly added context by the user can play an important role
in re-finding.
| [
{
"version": "v1",
"created": "Sat, 31 Jan 2004 20:09:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Capra",
"Robert G.",
""
],
[
"Perez-Quinones",
"Manuel A.",
""
]
]
| new_dataset | 0.994486 |
cs/0402004 | Shujun Li Dr. | Shujun Li, Guanrong Chen, Kwok-Wo Wong, Xuanqin Mou and Yuanlong Cai | Baptista-type chaotic cryptosystems: Problems and countermeasures | 13 pages, 2 figures | Physics Letters A, 332(5-6):368-375, 2004 | 10.1016/j.physleta.2004.09.028 | null | cs.CR nlin.CD | null | In 1998, M. S. Baptista proposed a chaotic cryptosystem, which has attracted
much attention from the chaotic cryptography community: some of its
modifications and also attacks have been reported in recent years. In [Phys.
Lett. A 307 (2003) 22], we suggested a method to enhance the security of
Baptista-type cryptosystem, which can successfully resist all proposed attacks.
However, the enhanced Baptista-type cryptosystem has a nontrivial defect, which
produces errors in the decrypted data with a generally small but nonzero
probability, and the consequent error propagation exists. In this Letter, we
analyze this defect and discuss how to rectify it. In addition, we point out
some newly-found problems existing in all Baptista-type cryptosystems and
consequently propose corresponding countermeasures.
| [
{
"version": "v1",
"created": "Mon, 2 Feb 2004 10:39:12 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Nov 2004 05:41:20 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Shujun",
""
],
[
"Chen",
"Guanrong",
""
],
[
"Wong",
"Kwok-Wo",
""
],
[
"Mou",
"Xuanqin",
""
],
[
"Cai",
"Yuanlong",
""
]
]
| new_dataset | 0.999472 |
cs/0402017 | Rajkumar Buyya | Akshay Luther, Rajkumar Buyya, Rajiv Ranjan, and Srikumar Venugopal | Alchemi: A .NET-based Grid Computing Framework and its Integration into
Global Grids | 17 pages, 12 figures, 2 tables | Technical Report, GRIDS-TR-2003-8, Grid Computing and Distributed
Systems Laboratory, University of Melbourne, Australia, December 2003 | null | GRIDS-TR-2003-8 | cs.DC | null | Computational grids that couple geographically distributed resources are
becoming the de-facto computing platform for solving large-scale problems in
science, engineering, and commerce. Software to enable grid computing has been
primarily written for Unix-class operating systems, thus severely limiting the
ability to effectively utilize the computing resources of the vast majority of
desktop computers i.e. those running variants of the Microsoft Windows
operating system. Addressing Windows-based grid computing is particularly
important from the software industry's viewpoint where interest in grids is
emerging rapidly. Microsoft's .NET Framework has become near-ubiquitous for
implementing commercial distributed systems for Windows-based platforms,
positioning it as the ideal platform for grid computing in this context. In
this paper we present Alchemi, a .NET-based grid computing framework that
provides the runtime machinery and programming environment required to
construct desktop grids and develop grid applications. It allows flexible
application composition by supporting an object-oriented grid application
programming model in addition to a grid job model. Cross-platform support is
provided via a web services interface and a flexible execution model supports
dedicated and non-dedicated (voluntary) execution by grid nodes.
| [
{
"version": "v1",
"created": "Tue, 10 Feb 2004 09:18:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Luther",
"Akshay",
""
],
[
"Buyya",
"Rajkumar",
""
],
[
"Ranjan",
"Rajiv",
""
],
[
"Venugopal",
"Srikumar",
""
]
]
| new_dataset | 0.994174 |
cs/0402037 | Petrus H. Potgieter | P.H. Potgieter | The pre-history of quantum computation | 11 pages, in Afrikaans (title: Die voorgeskiedenis van
kwantumberekening) with English abstract | Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie, Vol
23, Issue 1 / 2, Mar / Jun, 2-6 (2004) | null | null | cs.GL | null | The main ideas behind developments in the theory and technology of quantum
computation were formulated in the late 1970s and early 1980s by two physicists
in the West and a mathematician in the former Soviet Union. It is not generally
known in the West that the subject has roots in the Russian technical
literature. The author hopes to present as impartial a synthesis as possible of
the early history of thought on this subject. The role of reversible and
irreversible computational processes is examined briefly as it relates to the
origins of quantum computing and the so-called Information Paradox in physics.
| [
{
"version": "v1",
"created": "Tue, 17 Feb 2004 06:54:26 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Nov 2004 05:15:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Potgieter",
"P. H.",
""
]
]
| new_dataset | 0.980215 |
cs/0402039 | Serban Vlad E. | Serban E. Vlad | On the Inertia of the Asynchronous Circuits | null | CAIM 2003, Oradea, Romania, May 29-31, 2003 | null | null | cs.LO | null | We present the bounded delays, the absolute inertia and the relative inertia.
| [
{
"version": "v1",
"created": "Tue, 17 Feb 2004 12:54:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vlad",
"Serban E.",
""
]
]
| new_dataset | 0.995071 |
cs/0402045 | Sandor P. Fekete | Esther M. Arkin, Michael A. Bender, Sandor P. Fekete, Joseph S. B.
Mitchell, and Martin Skutella | The Freeze-Tag Problem: How to Wake Up a Swarm of Robots | 27 pages, 9 figures, Latex, to appear in Algorithmica. Cleaned up
various parts of the paper, removed one overly technical section | null | null | null | cs.DS | null | An optimization problem that naturally arises in the study of swarm robotics
is the Freeze-Tag Problem (FTP) of how to awaken a set of ``asleep'' robots, by
having an awakened robot move to their locations. Once a robot is awake, it can
assist in awakening other slumbering robots.The objective is to have all robots
awake as early as possible. While the FTP bears some resemblance to problems
from areas in combinatorial optimization such as routing, broadcasting,
scheduling, and covering, its algorithmic characteristics are surprisingly
different. We consider both scenarios on graphs and in geometric
environments.In graphs, robots sleep at vertices and there is a length function
on the edges. Awake robots travel along edges, with time depending on edge
length. For most scenarios, we consider the offline version of the problem, in
which each awake robot knows the position of all other robots. We prove that
the problem is NP-hard, even for the special case of star graphs. We also
establish hardness of approximation, showing that it is NP-hard to obtain an
approximation factor better than 5/3, even for graphs of bounded degree.These
lower bounds are complemented with several positive algorithmic results,
including: (1) We show that the natural greedy strategy on star graphs has a
tight worst-case performance of 7/3 and give a polynomial-time approximation
scheme (PTAS) for star graphs. (2) We give a simple O(log D)-competitive online
algorithm for graphs with maximum degree D and locally bounded edge weights.
(3) We give a PTAS, running in nearly linear time, for geometrically embedded
instances.
| [
{
"version": "v1",
"created": "Wed, 18 Feb 2004 20:49:02 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Sep 2005 23:31:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Arkin",
"Esther M.",
""
],
[
"Bender",
"Michael A.",
""
],
[
"Fekete",
"Sandor P.",
""
],
[
"Mitchell",
"Joseph S. B.",
""
],
[
"Skutella",
"Martin",
""
]
]
| new_dataset | 0.998892 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.