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/9902019 | Wei Ding | Wei Ding, Gary Marchionini, Dagobert Soergel | Multimodal Surrogates for Video Browsing | 11 pages | null | null | null | cs.DL cs.HC | null | Three types of video surrogates - visual (keyframes), verbal
(keywords/phrases), and combination of the two - were designed and studied in a
qualitative investigation of user cognitive processes. The results favor the
combined surrogates in which verbal information and images reinforce each
other, lead to better comprehension, and may actually require less processing
time. The results also highlight image features users found most helpful. These
findings will inform the interface design and video representation for video
retrieval and browsing.
| [
{
"version": "v1",
"created": "Tue, 9 Feb 1999 04:56:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ding",
"Wei",
""
],
[
"Marchionini",
"Gary",
""
],
[
"Soergel",
"Dagobert",
""
]
]
| new_dataset | 0.956826 |
cs/9903005 | Lecomte Pierre | Pierre B. A. Lecomte, Michel Rigo | Numeration systems on a regular language | 15 pages | null | null | null | cs.OH | null | Generalizations of linear numeration systems in which the set of natural
numbers is recognizable by finite automata are obtained by describing an
arbitrary infinite regular language following the lexicographic ordering. For
these systems of numeration, we show that ultimately periodic sets are
recognizable. We also study the translation and the multiplication by constants
as well as the order dependence of the recognizability.
| [
{
"version": "v1",
"created": "Thu, 4 Mar 1999 08:35:21 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lecomte",
"Pierre B. A.",
""
],
[
"Rigo",
"Michel",
""
]
]
| new_dataset | 0.968152 |
cs/9903007 | Marc Dymetman | Marc Dymetman | Some Remarks on the Geometry of Grammar | 22 pages, 15 figures | null | null | null | cs.CL cs.LO | null | This paper, following (Dymetman:1998), presents an approach to grammar
description and processing based on the geometry of cancellation diagrams, a
concept which plays a central role in combinatorial group theory
(Lyndon-Schuppe:1977). The focus here is on the geometric intuitions and on
relating group-theoretical diagrams to the traditional charts associated with
context-free grammars and type-0 rewriting systems. The paper is structured as
follows. We begin in Section 1 by analyzing charts in terms of constructs
called cells, which are a geometrical counterpart to rules. Then we move in
Section 2 to a presentation of cancellation diagrams and show how they can be
used computationally. In Section 3 we give a formal algebraic presentation of
the concept of group computation structure, which is based on the standard
notions of free group and conjugacy. We then relate in Section 4 the geometric
and the algebraic views of computation by using the fundamental theorem of
combinatorial group theory (Rotman:1994). In Section 5 we study in more detail
the relationship between the two views on the basis of a simple grammar stated
as a group computation structure. In section 6 we extend this grammar to handle
non-local constructs such as relative pronouns and quantifiers. We conclude in
Section 7 with some brief notes on the differences between normal submonoids
and normal subgroups, group computation versus rewriting systems, and the use
of group morphisms to study the computational complexity of parsing and
generation.
| [
{
"version": "v1",
"created": "Fri, 5 Mar 1999 18:25:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dymetman",
"Marc",
""
]
]
| new_dataset | 0.969588 |
cs/9903018 | Carlos Cassino | Carlos Cassino, Roberto Ierusalimschy, and Noemi Rodriguez | LuaJava - A Scripting Tool for Java | 10 pages, LaTeX, 1 figure. Available at
http://www.tecgraf.puc-rio.br/~cassino/luajava | null | null | PUC-RioInf.MCC02/99 | cs.SE | null | Scripting languages are becoming more and more important as a tool for
software development, as they provide great flexibility for rapid prototyping
and for configuring componentware applications. In this paper we present
LuaJava, a scripting tool for Java. LuaJava adopts Lua, a dynamically typed
interpreted language, as its script language. Great emphasis is given to the
transparency of the integration between the two languages, so that objects from
one language can be used inside the other like native objects. The final result
of this integration is a tool that allows the construction of configurable Java
applications, using off-the-shelf components, in a high abstraction level.
| [
{
"version": "v1",
"created": "Tue, 30 Mar 1999 11:28:44 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cassino",
"Carlos",
""
],
[
"Ierusalimschy",
"Roberto",
""
],
[
"Rodriguez",
"Noemi",
""
]
]
| new_dataset | 0.990327 |
cs/9904005 | Walter Eaves | Walter Eaves | Transport Level Security: a proof using the Gong-Needham-Yahalom Logic | 22 pages, 2 figures, 1 appendix | null | null | null | cs.CR | null | This paper provides a proof of the proposed Internet standard Transport Level
Security protocol using the Gong-Needham-Yahalom logic. It is intended as a
teaching aid and hopes to show to students: the potency of a formal method for
protocol design; some of the subtleties of authenticating parties on a network
where all messages can be intercepted; the design of what should be a widely
accepted standard.
| [
{
"version": "v1",
"created": "Wed, 14 Apr 1999 20:05:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eaves",
"Walter",
""
]
]
| new_dataset | 0.970948 |
cs/9904011 | Yin Zhang | Yin Zhang | WebScript -- A Scripting Language for the Web | 19 pages, 11 figures | null | null | null | cs.NI cs.PL | null | WebScript is a scripting language for processing Web documents. Designed as
an extension to Jacl, the Java implementation of Tcl, WebScript allows
programmers to manipulate HTML in the same way as Tcl manipulates text strings
and GUI elements. This leads to a completely new way of writing the next
generation of Web applications. This paper presents the motivation behind the
design and implementation of WebScript, an overview of its major features, as
well as some demonstrations of its power.
| [
{
"version": "v1",
"created": "Wed, 21 Apr 1999 19:21:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zhang",
"Yin",
""
]
]
| new_dataset | 0.998985 |
cs/9904014 | Stephen F. Bush | Stephen F. Bush and Sunil Jagannath and Joseph B. Evans and Victor
Frost and Gary Minden and K. Sam Shanmugan | A Control and Management Network for Wireless ATM Systems | author's web page at http://www.crd.ge.com/people/bush | ACM-Baltzer Wireless Networks (WINET), volume 3, pages
267-283,1997 | null | null | cs.NI | null | This paper describes the design of a control and management network
(orderwire) for a mobile wireless Asynchronous Transfer Mode (ATM) network.
This mobile wireless ATM network is part of the Rapidly Deployable Radio
Network (RDRN). The orderwire system consists of a packet radio network which
overlays the mobile wireless ATM network, each network element in this network
uses Global Positioning System (GPS) information to control a beamforming
antenna subsystem which provides for spatial reuse. This paper also proposes a
novel Virtual Network Configuration (VNC) algorithm for predictive network
configuration. A mobile ATM Private Network-Network Interface (PNNI) based on
VNC is also discussed. Finally, as a prelude to the system implementation,
results of a Maisie simulation of the orderwire system are discussed.
| [
{
"version": "v1",
"created": "Thu, 22 Apr 1999 12:58:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bush",
"Stephen F.",
""
],
[
"Jagannath",
"Sunil",
""
],
[
"Evans",
"Joseph B.",
""
],
[
"Frost",
"Victor",
""
],
[
"Minden",
"Gary",
""
],
[
"Shanmugan",
"K. Sam",
""
]
]
| new_dataset | 0.998949 |
cs/9904017 | David R. Hanson | David R. Hanson | A Machine-Independent Debugger--Revisited | 12 pages; 6 figures; 3 tables | Software--Practice & Experience, vol. 29, no. 10, 849-862, Aug.
1999 | null | Microsoft Research MSR-TR-99-04 | cs.PL cs.SE | null | Most debuggers are notoriously machine-dependent, but some recent research
prototypes achieve varying degrees of machine-independence with novel designs.
Cdb, a simple source-level debugger for C, is completely independent of its
target architecture. This independence is achieved by embedding symbol tables
and debugging code in the target program, which costs both time and space. This
paper describes a revised design and implementation of cdb that reduces the
space cost by nearly one-half and the time cost by 13% by storing symbol tables
in external files. A symbol table is defined by a 31-line grammar in the
Abstract Syntax Description Language (ASDL). ASDL is a domain-specific language
for specifying tree data structures. The ASDL tools accept an ASDL grammar and
generate code to construct, read, and write these data structures. Using ASDL
automates implementing parts of the debugger, and the grammar documents the
symbol table concisely. Using ASDL also suggested simplifications to the
interface between the debugger and the target program. Perhaps most important,
ASDL emphasizes that symbol tables are data structures, not file formats. Many
of the pitfalls of working with low-level file formats can be avoided by
focusing instead on high-level data structures and automating the
implementation details.
| [
{
"version": "v1",
"created": "Fri, 23 Apr 1999 18:34:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hanson",
"David R.",
""
]
]
| new_dataset | 0.958871 |
cs/9904020 | Walter Eaves | Walter Eaves | ODP channel objects that provide services transparently for distributing
processing systems | 35 pages, 10 figures | null | null | null | cs.DC cs.OS | null | This paper describes an architecture for a distributing processing system
that would allow remote procedure calls to invoke other services as messages
are passed between clients and servers. It proposes that an additional class of
data processing objects be located in the software communications channel. The
objects in this channel would then be used to enforce protocols on
client-server applications without any additional effort by the application
programmers. For example, services such as key-management, time-stamping,
sequencing and encryption can be implemented at different levels of the
software communications stack to provide a complete authentication service. A
distributing processing environment could be used to control broadband network
data delivery. Architectures and invocation semantics are discussed, Example
classes and interfaces for channel objects are given in the Java programming
language.
| [
{
"version": "v1",
"created": "Mon, 26 Apr 1999 21:13:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eaves",
"Walter",
""
]
]
| new_dataset | 0.991387 |
cs/9906010 | Victor Makarov | Victor Makarov | Predicate Logic with Definitions | 15 pages | null | null | null | cs.LO cs.AI | null | Predicate Logic with Definitions (PLD or D-logic) is a modification of
first-order logic intended mostly for practical formalization of mathematics.
The main syntactic constructs of D-logic are terms, formulas and definitions. A
definition is a definition of variables, a definition of constants, or a
composite definition (D-logic has also abbreviation definitions called
abbreviations). Definitions can be used inside terms and formulas. This
possibility alleviates introducing new quantifier-like names. Composite
definitions allow constructing new definitions from existing ones.
| [
{
"version": "v1",
"created": "Mon, 7 Jun 1999 20:16:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Makarov",
"Victor",
""
]
]
| new_dataset | 0.997975 |
cs/9906020 | Ion Androutsopoulos | I. Androutsopoulos (Software & Knowledge Engineering Lab, Institute of
Informatics & Telecommunications, NCSR Demokritos, Greece) | Temporal Meaning Representations in a Natural Language Front-End | 15 pages. To appear in the Proceedings of the 12th International
Symposium on Languages for Intensional Programming, Athens, Greece, 1999 | In Gergatsoulis, M. and Rondogiannis, P. (Eds.), Intensional
Programming II (Proceedings of the 12th International Symposium on Languages
for Intensional Programming, Athens, Greece, 1999), pp. 197-213, World
Scientific, 2000. | null | null | cs.CL | null | Previous work in the context of natural language querying of temporal
databases has established a method to map automatically from a large subset of
English time-related questions to suitable expressions of a temporal logic-like
language, called TOP. An algorithm to translate from TOP to the TSQL2 temporal
database language has also been defined. This paper shows how TOP expressions
could be translated into a simpler logic-like language, called BOT. BOT is very
close to traditional first-order predicate logic (FOPL), and hence existing
methods to manipulate FOPL expressions can be exploited to interface to
time-sensitive applications other than TSQL2 databases, maintaining the
existing English-to-TOP mapping.
| [
{
"version": "v1",
"created": "Tue, 22 Jun 1999 08:28:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Androutsopoulos",
"I.",
"",
"Software & Knowledge Engineering Lab, Institute of\n Informatics & Telecommunications, NCSR Demokritos, Greece"
]
]
| new_dataset | 0.99905 |
cs/9906022 | Joseph O'Rourke | Joseph O'Rourke and Irena Pashchenko | Zero-Parity Stabbing Information | null | Proc. Japan Conf. Discrete Comput. Geom. '98, Dec. 1998, 93--97 | null | null | cs.CG cs.DM | null | Everett et al. introduced several varieties of stabbing information for the
lines determined by pairs of vertices of a simple polygon P, and established
their relationships to vertex visibility and other combinatorial data. In the
same spirit, we define the ``zero-parity (ZP) stabbing information'' to be a
natural weakening of their ``weak stabbing information,'' retaining only the
distinction among {zero, odd, even>0} in the number of polygon edges stabbed.
Whereas the weak stabbing information's relation to visibility remains an open
problem, we completely settle the analogous questions for zero-parity
information, with three results: (1) ZP information is insufficient to
distinguish internal from external visibility graph edges; (2) but it does
suffice for all polygons that avoid a certain complex substructure; and (3) the
natural generalization of ZP information to the continuous case of smooth
curves does distinguish internal from external visibility.
| [
{
"version": "v1",
"created": "Tue, 22 Jun 1999 20:32:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"O'Rourke",
"Joseph",
""
],
[
"Pashchenko",
"Irena",
""
]
]
| new_dataset | 0.999689 |
cs/9907016 | Jim Gray | Tom Barclay Jim Gray Don Slutz | Microsoft TerraServer: A Spatial Data Warehouse | Original MSword format at
http://research.microsoft.com/~gray/papers/MS_TR_99_30_TerraServer.doc | null | null | Microsoft Research Technical Report MSR-TR-99-29 | cs.DB cs.DL | null | The TerraServer stores aerial, satellite, and topographic images of the earth
in a SQL database available via the Internet. It is the world's largest online
atlas, combining five terabytes of image data from the United States Geological
Survey (USGS) and SPIN-2. This report describes the system-redesign based on
our experience over the last year. It also reports usage and operations results
over the last year -- over 2 billion web hits and over 20 Terabytes of imagry
served over the Internet. Internet browsers provide intuitive spatial and text
interfaces to the data. Users need no special hardware, software, or knowledge
to locate and browse imagery. This paper describes how terabytes of "Internet
unfriendly" geo-spatial images were scrubbed and edited into hundreds of
millions of "Internet friendly" image tiles and loaded into a SQL data
warehouse. Microsoft TerraServer demonstrates that general-purpose relational
database technology can manage large scale image repositories, and shows that
web browsers can be a good geospatial image presentation system.
| [
{
"version": "v1",
"created": "Fri, 9 Jul 1999 21:30:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Slutz",
"Tom Barclay Jim Gray Don",
""
]
]
| new_dataset | 0.980574 |
cs/9907018 | Erik Demaine | Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N.
Frederickson, Erich Friedman | Hinged Dissection of Polyominoes and Polyforms | 27 pages, 39 figures. Accepted to Computational Geometry: Theory and
Applications. v3 incorporates several comments by referees. v2 added many new
results and a new coauthor (Frederickson) | null | null | null | cs.CG cs.DM | null | A hinged dissection of a set of polygons S is a collection of polygonal
pieces hinged together at vertices that can be folded into any member of S. We
present a hinged dissection of all edge-to-edge gluings of n congruent copies
of a polygon P that join corresponding edges of P. This construction uses kn
pieces, where k is the number of vertices of P. When P is a regular polygon, we
show how to reduce the number of pieces to ceiling(k/2)*(n-1). In particular,
we consider polyominoes (made up of unit squares), polyiamonds (made up of
equilateral triangles), and polyhexes (made up of regular hexagons). We also
give a hinged dissection of all polyabolos (made up of right isosceles
triangles), which do not fall under the general result mentioned above.
Finally, we show that if P can be hinged into Q, then any edge-to-edge gluing
of n congruent copies of P can be hinged into any edge-to-edge gluing of n
congruent copies of Q.
| [
{
"version": "v1",
"created": "Sat, 10 Jul 1999 21:29:56 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Oct 1999 01:54:07 GMT"
},
{
"version": "v3",
"created": "Sun, 23 Mar 2003 13:29:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Eppstein",
"David",
""
],
[
"Frederickson",
"Greg N.",
""
],
[
"Friedman",
"Erich",
""
]
]
| new_dataset | 0.982193 |
cs/9907027 | Andrea Schaerf | Krzysztof R. Apt and Andrea Schaerf | The Alma Project, or How First-Order Logic Can Help Us in Imperative
Programming | 25 pages | null | null | null | cs.LO cs.PL | null | The aim of the Alma project is the design of a strongly typed constraint
programming language that combines the advantages of logic and imperative
programming. The first stage of the project was the design and implementation
of Alma-0, a small programming language that provides a support for declarative
programming within the imperative programming framework. It is obtained by
extending a subset of Modula-2 by a small number of features inspired by the
logic programming paradigm. In this paper we discuss the rationale for the
design of Alma-0, the benefits of the resulting hybrid programming framework,
and the current work on adding constraint processing capabilities to the
language. In particular, we discuss the role of the logical and customary
variables, the interaction between the constraint store and the program, and
the need for lists.
| [
{
"version": "v1",
"created": "Mon, 19 Jul 1999 09:36:05 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Apt",
"Krzysztof R.",
""
],
[
"Schaerf",
"Andrea",
""
]
]
| new_dataset | 0.992287 |
cs/9908003 | Erik Demaine | Marshall Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea
Mantler, Jack Snoeyink | Ununfoldable Polyhedra with Convex Faces | 14 pages, 9 figures, LaTeX 2e. To appear in Computational Geometry:
Theory and Applications. Major revision with two new authors, solving the
open problem about triangular faces | Computational Geometry: Theory and Applications 24(2):51-62,
February 2003 | null | null | cs.CG cs.DM | null | Unfolding a convex polyhedron into a simple planar polygon is a well-studied
problem. In this paper, we study the limits of unfoldability by studying
nonconvex polyhedra with the same combinatorial structure as convex polyhedra.
In particular, we give two examples of polyhedra, one with 24 convex faces and
one with 36 triangular faces, that cannot be unfolded by cutting along edges.
We further show that such a polyhedron can indeed be unfolded if cuts are
allowed to cross faces. Finally, we prove that ``open'' polyhedra with
triangular faces may not be unfoldable no matter how they are cut.
| [
{
"version": "v1",
"created": "Tue, 3 Aug 1999 17:37:04 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Aug 2001 20:42:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bern",
"Marshall",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Eppstein",
"David",
""
],
[
"Kuo",
"Eric",
""
],
[
"Mantler",
"Andrea",
""
],
[
"Snoeyink",
"Jack",
""
]
]
| new_dataset | 0.998126 |
cs/9908008 | Dahlia Malkhi | Dahlia Malkhi, Michael Merritt and Ohad Rodeh | Secure Multicast in a WAN | preprint of a paper to appear in the Distributed Computing Journal | null | null | null | cs.CR cs.DC | null | A secure reliable multicast protocol enables a process to send a message to a
group of recipients such that all correct destinations receive the same
message, despite the malicious efforts of fewer than a third of the total
number of processes, including the sender. This has been sh own to be a useful
tool in building secure distributed services, albeit with a cost that typically
grows linearly with the size of the system. For very large networks, for which
this is prohibitive, we present two approaches for reducing the cost: First, we
show a protocol whose cost is on the order of the number of tolerated failures.
Secondly, we show how relaxing the consistency requirement to a probabilistic
guarantee can reduce the associated cost, effectively to a constant.
| [
{
"version": "v1",
"created": "Thu, 12 Aug 1999 17:40:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Malkhi",
"Dahlia",
""
],
[
"Merritt",
"Michael",
""
],
[
"Rodeh",
"Ohad",
""
]
]
| new_dataset | 0.998019 |
cs/9908009 | Dahlia Malkhi | Dahlia Malkhi and Michael Reiter | Secure Execution of Java Applets using a Remote Playground | preprint of a paper to appear in IEEE Transactions on Software
Engineering | null | null | null | cs.CR cs.NI | null | Mobile code presents a number of threats to machines that execute it. We
introduce an approach for protecting machines and the resources they hold from
mobile code, and describe a system based on our approach for protecting host
machines from Java 1.1 applets. In our approach, each Java applet downloaded to
the protected domain is rerouted to a dedicated machine (or set of machines),
the {\em playground}, at which it is executed. Prior to execution the applet is
transformed to use the downloading user's web browser as a graphics terminal
for its input and output, and so the user has the illusion that the applet is
running on her own machine. In reality, however, mobile code runs only in the
sanitized environment of the playground, where user files cannot be mounted and
from which only limited network connections are accepted by machines in the
protected domain. Our playground thus provides a second level of defense
against mobile code that circumvents language-based defenses. The paper
presents the design and implementation of a playground for Java 1.1 applets,
and discusses extensions of it for other forms of mobile code including Java
1.2.
| [
{
"version": "v1",
"created": "Thu, 12 Aug 1999 17:50:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Malkhi",
"Dahlia",
""
],
[
"Reiter",
"Michael",
""
]
]
| new_dataset | 0.999777 |
cs/9908016 | David Eppstein | Marshall Bern and David Eppstein | Quadrilateral Meshing by Circle Packing | 12 pages, 10 figures. To appear in Int. J. Comp. Geom. & Appl. A
preliminary version of this work was presented at the 6th Int. Meshing
Roundtable, Park City, Utah, 1997 | Int. J. Comp. Geom. & Appl. 10(4):347-360, Aug. 2000 | null | null | cs.CG | null | We use circle-packing methods to generate quadrilateral meshes for polygonal
domains, with guaranteed bounds both on the quality and the number of elements.
We show that these methods can generate meshes of several types: (1) the
elements form the cells of a Voronoi diagram, (2) all elements have two
opposite right angles, (3) all elements are kites, or (4) all angles are at
most 120 degrees. In each case the total number of elements is O(n), where n is
the number of input vertices.
| [
{
"version": "v1",
"created": "Thu, 19 Aug 1999 20:40:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bern",
"Marshall",
""
],
[
"Eppstein",
"David",
""
]
]
| new_dataset | 0.97526 |
cs/9909018 | Devillers | Olivier Devillers, Pierre-Maris Gandoin | Geometric compression for progressive transmission | 16 pages, 10 figures | null | null | INRIA Research report 3766, in french | cs.CG cs.GR | null | The compression of geometric structures is a relatively new field of data
compression. Since about 1995, several articles have dealt with the coding of
meshes, using for most of them the following approach: the vertices of the mesh
are coded in an order such that it contains partially the topology of the mesh.
In the same time, some simple rules attempt to predict the position of the
current vertex from the positions of its neighbours that have been previously
coded. In this article, we describe a compression algorithm whose principle is
completely different: the order of the vertices is used to compress their
coordinates, and then the topology of the mesh is reconstructed from the
vertices. This algorithm, particularly suited for terrain models, achieves
compression factors that are slightly greater than those of the currently
available algorithms, and moreover, it allows progressive and interactive
transmission of the meshes.
| [
{
"version": "v1",
"created": "Tue, 28 Sep 1999 06:56:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Devillers",
"Olivier",
""
],
[
"Gandoin",
"Pierre-Maris",
""
]
]
| new_dataset | 0.994244 |
cs/9910018 | Shie-Yuan Wang | S.Y. Wang | Decoupling Control from Data for TCP Congestion Control | Ph.D. Thesis, Harvard University, September 1999. This thesis's
Chapter 3 about "TCP Trunking" will be published in IEEE ICNP'99 Proceedings.
A condensed version of this thesis is currently submitted to a conference | null | null | null | cs.NI | null | Many applications want to use TCP congestion control to regulate the
transmission rate of a data packet stream. A natural way to achieve this goal
is to transport the data packet stream on a TCP connection. However, because
TCP implements both congestion and error control, transporting a data packet
stream directly using a TCP connection forces the data packet stream to be
subject to TCP's other properties caused by TCP error control, which may be
inappropriate for these applications.
The TCP decoupling approach proposed in this thesis is a novel way of
applying TCP congestion control to a data packet stream without actually
transporting the data packet stream on a TCP connection. Instead, a TCP
connection using the same network path as the data packet stream is set up
separately and the transmission rate of the data packet stream is then
associated with that of the TCP packets. Since the transmission rate of these
TCP packets is under TCP congestion control, so is that of the data packet
stream. Furthermore, since the data packet stream is not transported on a TCP
connection, the regulated data packet stream is not subject to TCP error
control.
Because of this flexibility, the TCP decoupling approach opens up many new
opportunities, solves old problems, and improves the performance of some
existing applications. All of these advantages will be demonstrated in the
thesis.
This thesis presents the design, implementation, and analysis of the TCP
decoupling approach, and its successful applications in TCP trunking, wireless
communication, and multimedia streaming.
| [
{
"version": "v1",
"created": "Thu, 21 Oct 1999 22:03:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wang",
"S. Y.",
""
]
]
| new_dataset | 0.999025 |
cs/9910024 | Steven M. Robbins | Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna
Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint,
Sue Whitesides | On Reconfiguring Tree Linkages: Trees can Lock | 16 pages, 6 figures Introduction reworked and references added, as
the main open problem was recently closed | null | null | SOCS-00.7 | cs.CG cs.DM | null | It has recently been shown that any simple (i.e. nonintersecting) polygonal
chain in the plane can be reconfigured to lie on a straight line, and any
simple polygon can be reconfigured to be convex. This result cannot be extended
to tree linkages: we show that there are trees with two simple configurations
that are not connected by a motion that preserves simplicity throughout the
motion. Indeed, we prove that an $N$-link tree can have $2^{\Omega(N)}$
equivalence classes of configurations.
| [
{
"version": "v1",
"created": "Mon, 1 Nov 1999 17:50:19 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Sep 2000 02:26:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Biedl",
"Therese",
""
],
[
"Demaine",
"Erik",
""
],
[
"Demaine",
"Martin",
""
],
[
"Lazard",
"Sylvain",
""
],
[
"Lubiw",
"Anna",
""
],
[
"O'Rourke",
"Joseph",
""
],
[
"Robbins",
"Steve",
""
],
[
"Streinu",
"Ileana",
""
],
[
"Toussaint",
"Godfried",
""
],
[
"Whitesides",
"Sue",
""
]
]
| new_dataset | 0.986642 |
cs/9911002 | Rigo Michel | Michel Rigo | Numeration systems on a regular language: Arithmetic operations,
Recognizability and Formal power series | 34 pages; corrected typos, two sections concerning exponential case
and relation with positional systems added | Theoret. Comput. Sci. 269 (2001) 469--498 | null | null | cs.CC | null | Generalizations of numeration systems in which N is recognizable by a finite
automaton are obtained by describing a lexicographically ordered infinite
regular language L over a finite alphabet A. For these systems, we obtain a
characterization of recognizable sets of integers in terms of rational formal
series. We also show that, if the complexity of L is Theta (n^q) (resp. if L is
the complement of a polynomial language), then multiplication by an integer k
preserves recognizability only if k=t^{q+1} (resp. if k is not a power of the
cardinality of A) for some integer t. Finally, we obtain sufficient conditions
for the notions of recognizability and U-recognizability to be equivalent,
where U is some positional numeration system related to a sequence of integers.
| [
{
"version": "v1",
"created": "Mon, 8 Nov 1999 13:03:50 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Jan 2000 13:40:21 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rigo",
"Michel",
""
]
]
| new_dataset | 0.998167 |
cs/9911009 | John Watrous | Andris Ambainis (1), John Watrous (2) ((1) UC Berkeley, (2) University
of Calgary) | Two-way finite automata with quantum and classical states | 11 pages | null | null | null | cs.CC quant-ph | null | We introduce 2-way finite automata with quantum and classical states
(2qcfa's). This is a variant on the 2-way quantum finite automata (2qfa) model
which may be simpler to implement than unrestricted 2qfa's; the internal state
of a 2qcfa may include a quantum part that may be in a (mixed) quantum state,
but the tape head position is required to be classical.
We show two languages for which 2qcfa's are better than classical 2-way
automata. First, 2qcfa's can recognize palindromes, a language that cannot be
recognized by 2-way deterministic or probabilistic finite automata. Second, in
polynomial time 2qcfa's can recognize {a^n b^n | n>=0}, a language that can be
recognized classically by a 2-way probabilistic automaton but only in
exponential time.
| [
{
"version": "v1",
"created": "Tue, 16 Nov 1999 22:24:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ambainis",
"Andris",
""
],
[
"Watrous",
"John",
""
]
]
| new_dataset | 0.999462 |
cs/9911013 | Joseph O'Rourke | Joseph O'Rourke and The Smith Problem Solving Group | PushPush is NP-hard in 3D | 10 pages, 7 figures | null | null | Smith Tech. Rep. 064, Nov. 1999 | cs.CG cs.DM | null | We prove that a particular pushing-blocks puzzle is intractable in 3D. The
puzzle, inspired by the game PushPush, consists of unit square blocks on an
integer lattice. An agent may push blocks (but never pull them) in attempting
to move between given start and goal positions. In the PushPush version, the
agent can only push one block at a time, and moreover, each block, when pushed,
slides the maximal extent of its free range. We prove this version is NP-hard
in 3D by reduction from SAT. The corresponding problem in 2D remains open.
| [
{
"version": "v1",
"created": "Sun, 28 Nov 1999 15:43:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"O'Rourke",
"Joseph",
""
],
[
"Group",
"The Smith Problem Solving",
""
]
]
| new_dataset | 0.99951 |
cs/9912003 | Masaki Murata | M. Murata, H. Isahara (CRL), M. Nagao (Kyoto University) | Resolution of Indirect Anaphora in Japanese Sentences Using Examples 'X
no Y (Y of X)' | 8 pages, 0 figures. Computation and Language | ACL'99 Workshop on 'Coreference and Its Applications', Maryland,
USA, June 22, 1999 | null | null | cs.CL | null | A noun phrase can indirectly refer to an entity that has already been
mentioned. For example, ``I went into an old house last night. The roof was
leaking badly and ...'' indicates that ``the roof'' is associated with `` an
old house}'', which was mentioned in the previous sentence. This kind of
reference (indirect anaphora) has not been studied well in natural language
processing, but is important for coherence resolution, language understanding,
and machine translation. In order to analyze indirect anaphora, we need a case
frame dictionary for nouns that contains knowledge of the relationships between
two nouns but no such dictionary presently exists. Therefore, we are forced to
use examples of ``X no Y'' (Y of X) and a verb case frame dictionary instead.
We tried estimating indirect anaphora using this information and obtained a
recall rate of 63% and a precision rate of 68% on test sentences. This
indicates that the information of ``X no Y'' is useful to a certain extent when
we cannot make use of a noun case frame dictionary. We estimated the results
that would be given by a noun case frame dictionary, and obtained recall and
precision rates of 71% and 82% respectively. Finally, we proposed a way to
construct a noun case frame dictionary by using examples of ``X no Y.''
| [
{
"version": "v1",
"created": "Mon, 13 Dec 1999 04:42:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Murata",
"M.",
"",
"CRL"
],
[
"Isahara",
"H.",
"",
"CRL"
],
[
"Nagao",
"M.",
"",
"Kyoto University"
]
]
| new_dataset | 0.997778 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.