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/0009017 | Christof Monz | Christof Monz, Maarten de Rijke | A Tableau Calculus for Pronoun Resolution | 16 pages | In: N.V. Murray (ed.) Automated Reasoning with Analytic Tableaux
and Related Methods. Lecture Notes in Artificial Intelligence 1617, Springer,
1999, pages 247-262 | null | null | cs.CL cs.AI | null | We present a tableau calculus for reasoning in fragments of natural language.
We focus on the problem of pronoun resolution and the way in which it
complicates automated theorem proving for natural language processing. A method
for explicitly manipulating contextual information during deduction is
proposed, where pronouns are resolved against this context during deduction. As
a result, pronoun resolution and deduction can be interleaved in such a way
that pronouns are only resolved if this is licensed by a deduction rule; this
helps us to avoid the combinatorial complexity of total pronoun disambiguation.
| [
{
"version": "v1",
"created": "Thu, 21 Sep 2000 14:49:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Monz",
"Christof",
""
],
[
"de Rijke",
"Maarten",
""
]
]
| new_dataset | 0.99349 |
cs/0009029 | Matthew Huntbach | Matthew Huntbach | The Concurrent Language Aldwych | Presented at RULE 2000, First International Workshop on Rule-Based
Programming, Montreal, Canada | null | null | null | cs.PL | null | Aldwych is proposed as the foundation of a general purpose language for
parallel applications. It works on a rule-based principle, and has aspects
variously of concurrent functional, logic and object-oriented languages, yet it
forms an integrated whole. It is intended to be applicable both for small-scale
parallel programming, and for large-scale open systems.
| [
{
"version": "v1",
"created": "Fri, 29 Sep 2000 14:24:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Huntbach",
"Matthew",
""
]
]
| new_dataset | 0.999785 |
cs/0010013 | Igor Sobrado Delgado | Diego Rodriguez (University of Oviedo), Igor Sobrado (University of
Oviedo) | A Public-key based Information Management Model for Mobile Agents | 7 pages, 0 PostScript figures, uses IEEE/LaTeX macros
IEEEtran.{bst|cls} | null | null | FFUOV-00/04 | cs.CR cs.DC cs.IR cs.NI | null | Mobile code based computing requires development of protection schemes that
allow digital signature and encryption of data collected by the agents in
untrusted hosts. These algorithms could not rely on carrying encryption keys if
these keys could be stolen or used to counterfeit data by hostile hosts and
agents. As a consequence, both information and keys must be protected in a way
that only authorized hosts, that is the host that provides information and the
server that has sent the mobile agent, could modify (by changing or removing)
retrieved data. The data management model proposed in this work allows the
information collected by the agents to be protected against handling by other
hosts in the information network. It has been done by using standard public-key
cryptography modified to support protection of data in distributed environments
without requiring an interactive protocol with the host that has dropped the
agent. Their significance stands on the fact that it is the first model that
supports a full-featured protection of mobile agents allowing remote hosts to
change its own information if required before agent returns to its originating
server.
| [
{
"version": "v1",
"created": "Mon, 9 Oct 2000 20:17:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rodriguez",
"Diego",
"",
"University of Oviedo"
],
[
"Sobrado",
"Igor",
"",
"University of\n Oviedo"
]
]
| new_dataset | 0.965753 |
cs/0010014 | Sergei Skorik | Sergei Skorik and Frederic Berthommier | On a cepstrum-based speech detector robust to white noise | 4 pages pdf format, requires Acrobat Reader v 4.0 or later | null | null | null | cs.CL cs.CV cs.HC | null | We study effects of additive white noise on the cepstral representation of
speech signals. Distribution of each individual cepstrum coefficient of speech
is shown to depend strongly on noise and to overlap significantly with the
cepstrum distribution of noise. Based on these studies, we suggest a scalar
quantity, V, equal to the sum of weighted cepstral coefficients, which is able
to classify frames containing speech against noise-like frames. The
distributions of V for speech and noise frames are reasonably well separated
above SNR = 5 dB, demonstrating the feasibility of robust speech detector based
on V.
| [
{
"version": "v1",
"created": "Tue, 10 Oct 2000 17:33:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Skorik",
"Sergei",
""
],
[
"Berthommier",
"Frederic",
""
]
]
| new_dataset | 0.982126 |
cs/0010032 | Stefan Brass | Stefan Brass, Juergen Dix, Teodor C. Przymusinski | Super Logic Programs | 47 pages, revised version of the paper submitted 10/2000 | null | null | null | cs.AI cs.LO | null | The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful
nonmonotic formalism introduced by Teodor Przymusinski in 1994. In this paper,
we specialize it to a class of theories called `super logic programs'. We argue
that these programs form a natural generalization of standard logic programs.
In particular, they allow disjunctions and default negation of arbibrary
positive objective formulas.
Our main results are two new and powerful characterizations of the static
semant ics of these programs, one syntactic, and one model-theoretic. The
syntactic fixed point characterization is much simpler than the fixed point
construction of the static semantics for arbitrary AELB theories. The
model-theoretic characterization via Kripke models allows one to construct
finite representations of the inherently infinite static expansions.
Both characterizations can be used as the basis of algorithms for query
answering under the static semantics. We describe a query-answering interpreter
for super programs which we developed based on the model-theoretic
characterization and which is available on the web.
| [
{
"version": "v1",
"created": "Wed, 25 Oct 2000 13:32:51 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Mar 2002 12:12:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Brass",
"Stefan",
""
],
[
"Dix",
"Juergen",
""
],
[
"Przymusinski",
"Teodor C.",
""
]
]
| new_dataset | 0.99607 |
cs/0011010 | Dale E. Parson | Dale Parson, Bryan Schlieder, Paul Beatty | Extension Language Automation of Embedded System Debugging | In M. Ducasse (ed), proceedings of the Fourth International Workshop
on Automated Debugging (AADebug 2000), August 2000, Munich. cs.SE/0010035 | null | null | null | cs.SE cs.PL | null | Embedded systems contain several layers of target processing abstraction.
These layers include electronic circuit, binary machine code, mnemonic assembly
code, and high-level procedural and object-oriented abstractions. Physical and
temporal constraints and artifacts within physically embedded systems make it
impossible for software engineers to operate at a single layer of processor
abstraction. The Luxdbg embedded system debugger exposes these layers to
debugger users, and it adds an additional layer, the extension language layer,
that allows users to extend both the debugger and its target processor
capabilities. Tcl is Luxdbg's extension language. Luxdbg users can apply Tcl to
automate interactive debugging steps, to redirect and to interconnect target
processor input-output facilities, to schedule multiple processor execution, to
log and to react to target processing exceptions, and to automate target system
testing. Inclusion of an extension language like Tcl in a debugger promises
additional advantages for distributed debugging, where debuggers can pass
extension language expressions across computer networks.
| [
{
"version": "v1",
"created": "Mon, 6 Nov 2000 23:16:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Parson",
"Dale",
""
],
[
"Schlieder",
"Bryan",
""
],
[
"Beatty",
"Paul",
""
]
]
| new_dataset | 0.990296 |
cs/0012007 | Yasuhiro Ajiro | Yasuhiro Ajiro and Kazunori Ueda | Kima - an Automated Error Correction System for Concurrent Logic
Programs | In M. Ducasse (ed), proceedings of the Fourth International Workshop
on Automated Debugging (AADEBUG 2000), August 2000, Munich. cs.SE/0010035 | null | null | null | cs.SE cs.PL | null | We have implemented Kima, an automated error correction system for concurrent
logic programs. Kima corrects near-misses such as wrong variable occurrences in
the absence of explicit declarations of program properties. Strong
moding/typing and constraint-based analysis are turning to play fundamental
roles in debugging concurrent logic programs as well as in establishing the
consistency of communication protocols and data types. Mode/type analysis of
Moded Flat GHC is a constraint satisfaction problem with many simple mode/type
constraints, and can be solved efficiently. We proposed a simple and efficient
technique which, given a non-well-moded/typed program, diagnoses the
``reasons'' of inconsistency by finding minimal inconsistent subsets of
mode/type constraints. Since each constraint keeps track of the symbol
occurrence in the program, a minimal subset also tells possible sources of
program errors. Kima realizes automated correction by replacing symbol
occurrences around the possible sources and recalculating modes and types of
the rewritten programs systematically. As long as bugs are near-misses, Kima
proposes a rather small number of alternatives that include an intended
program.
| [
{
"version": "v1",
"created": "Wed, 13 Dec 2000 08:48:06 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jan 2001 13:28:06 GMT"
},
{
"version": "v3",
"created": "Fri, 5 Jan 2001 07:38:41 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ajiro",
"Yasuhiro",
""
],
[
"Ueda",
"Kazunori",
""
]
]
| new_dataset | 0.99166 |
cs/0101002 | David J. Murray | David J. Murray (Lehigh University), Dale E. Parson (Lucent
Technologies) | Automated Debugging In Java Using OCL And JDI | In M. Ducasse (ed), proceedings of the Fourth International Workshop
on Automated Debugging (AADEBUG 2000), August 2000, Munich. See cs.SE/0010035 | null | null | null | cs.SE cs.PL | null | Correctness constraints provide a foundation for automated debugging within
object-oriented systems. This paper discusses a new approach to incorporating
correctness constraints into Java development environments. Our approach uses
the Object Constraint Language ("OCL") as a specification language and the Java
Debug Interface ("JDI") as a verification API. OCL provides a standard language
for expressing object-oriented constraints that can integrate with Unified
Modeling Language ("UML") software models. JDI provides a standard Java API
capable of supporting type-safe and side effect free runtime constraint
evaluation. The resulting correctness constraint mechanism: (1) entails no
programming language modifications; (2) requires neither access nor changes to
existing source code; and (3) works with standard off-the-shelf Java virtual
machines ("VMs"). A prototype correctness constraint auditor is presented to
demonstrate the utility of this mechanism for purposes of automated debugging.
| [
{
"version": "v1",
"created": "Wed, 3 Jan 2001 22:48:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Murray",
"David J.",
"",
"Lehigh University"
],
[
"Parson",
"Dale E.",
"",
"Lucent\n Technologies"
]
]
| new_dataset | 0.988172 |
cs/0101030 | Ming-Yang Kao | Ming-Yang Kao | Tree Contractions and Evolutionary Trees | null | SIAM Journal on Computing, 27(6):1592--1616, December 1998 | null | null | cs.CE cs.DS | null | An evolutionary tree is a rooted tree where each internal vertex has at least
two children and where the leaves are labeled with distinct symbols
representing species. Evolutionary trees are useful for modeling the
evolutionary history of species. An agreement subtree of two evolutionary trees
is an evolutionary tree which is also a topological subtree of the two given
trees. We give an algorithm to determine the largest possible number of leaves
in any agreement subtree of two trees T_1 and T_2 with n leaves each. If the
maximum degree d of these trees is bounded by a constant, the time complexity
is O(n log^2(n)) and is within a log(n) factor of optimal. For general d, this
algorithm runs in O(n d^2 log(d) log^2(n)) time or alternatively in O(n d
sqrt(d) log^3(n)) time.
| [
{
"version": "v1",
"created": "Fri, 26 Jan 2001 21:36:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kao",
"Ming-Yang",
""
]
]
| new_dataset | 0.967106 |
cs/0101035 | Paul M. Aoki | Allison Woodruff, Paul M. Aoki, Amy Hurst, Margaret H. Szymanski | The Guidebook, the Friend, and the Room: Visitor Experience in a
Historic House | null | Extended Abstracts, ACM SIGCHI Conf. on Human Factors in Computing
Systems, Seattle, WA, March 2001, 273-274. ACM Press. | 10.1145/634067.634229 | null | cs.HC | null | In this paper, we describe an electronic guidebook prototype and report on a
study of its use in a historic house. Supported by mechanisms in the guidebook,
visitors constructed experiences that had a high degree of interaction with
three entities: the guidebook, their companions, and the house and its
contents. For example, we found that most visitors played audio descriptions
played through speakers (rather than using headphones or reading textual
descriptions) to facilitate communication with their companions.
| [
{
"version": "v1",
"created": "Sun, 28 Jan 2001 07:14:46 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Feb 2001 04:48:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Woodruff",
"Allison",
""
],
[
"Aoki",
"Paul M.",
""
],
[
"Hurst",
"Amy",
""
],
[
"Szymanski",
"Margaret H.",
""
]
]
| new_dataset | 0.999501 |
cs/0102005 | Hsueh-I. Lu | Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu | Compact Encodings of Planar Graphs via Canonical Orderings and Multiple
Parentheses | 24 pages; 3 figures; a preliminary version appeared in the
Proceedings of ICALP'98, LNCS 1443, pp. 118-129. (The 2nd version contains
some minor changes.) | null | null | null | cs.DS cs.DM | null | Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need
not be connected or simple (i.e., free of multiple edges). We give three sets
of coding schemes for G which all take O(m+n) time for encoding and decoding.
Our schemes employ new properties of canonical orderings for planar graphs and
new techniques of processing strings of multiple types of parentheses.
For applications that need to determine in O(1) time the adjacency of two
nodes and the degree of a node, we use 2m+(5+1/k)n + o(m+n) bits for any
constant k > 0 while the best previous bound by Munro and Raman is 2m+8n +
o(m+n). If G is triconnected or triangulated, our bit count decreases to 2m+3n
+ o(m+n) or 2m+2n + o(m+n), respectively. If G is simple, our bit count is
(5/3)m+(5+1/k)n + o(n) for any constant k > 0. Thus, if a simple G is also
triconnected or triangulated, then 2m+2n + o(n) or 2m+n + o(n) bits suffice,
respectively.
If only adjacency queries are supported, the bit counts for a general G and a
simple G become 2m+(14/3)n + o(m+n) and (4/3)m+5n + o(n), respectively.
If we only need to reconstruct G from its code, a simple and triconnected G
uses roughly 2.38m + O(1) bits while the best previous bound by He, Kao, and Lu
is 2.84m.
| [
{
"version": "v1",
"created": "Wed, 7 Feb 2001 16:46:24 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Feb 2001 13:29:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chuang",
"Richie Chih-Nan",
""
],
[
"Garg",
"Ashim",
""
],
[
"He",
"Xin",
""
],
[
"Kao",
"Ming-Yang",
""
],
[
"Lu",
"Hsueh-I",
""
]
]
| new_dataset | 0.988869 |
cs/0102020 | Theriault Alain | Anja Belz (CCSRC, SRI International) | Multi-Syllable Phonotactic Modelling | 11 pages, 4 tables, 9 figures, workshop | Jason Eisner, Lauri Karttunen and Alain Theriault (eds.),
Finite-State Phonology: Proceedings of the 5th Workshop of the ACL Special
Interest Group in Computational Phonology (SIGPHON), pp. 46-56. Luxembourg,
August 2000 | null | null | cs.CL | null | This paper describes a novel approach to constructing phonotactic models. The
underlying theoretical approach to phonological description is the
multisyllable approach in which multiple syllable classes are defined that
reflect phonotactically idiosyncratic syllable subcategories. A new
finite-state formalism, OFS Modelling, is used as a tool for encoding,
automatically constructing and generalising phonotactic descriptions.
Language-independent prototype models are constructed which are instantiated on
the basis of data sets of phonological strings, and generalised with a
clustering algorithm. The resulting approach enables the automatic construction
of phonotactic models that encode arbitrarily close approximations of a
language's set of attested phonological forms. The approach is applied to the
construction of multi-syllable word-level phonotactic models for German,
English and Dutch.
| [
{
"version": "v1",
"created": "Thu, 22 Feb 2001 21:05:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Belz",
"Anja",
"",
"CCSRC, SRI International"
]
]
| new_dataset | 0.992283 |
cs/0102030 | Roberto Bagnara | Patricia M. Hill, Roberto Bagnara, Enea Zaffanella | Soundness, Idempotence and Commutativity of Set-Sharing | 48 pages | null | null | null | cs.PL | null | It is important that practical data-flow analyzers are backed by reliably
proven theoretical results. Abstract interpretation provides a sound
mathematical framework and necessary generic properties for an abstract domain
to be well-defined and sound with respect to the concrete semantics. In logic
programming, the abstract domain Sharing is a standard choice for sharing
analysis for both practical work and further theoretical study. In spite of
this, we found that there were no satisfactory proofs for the key properties of
commutativity and idempotence that are essential for Sharing to be well-defined
and that published statements of the soundness of Sharing assume the
occurs-check. This paper provides a generalization of the abstraction function
for Sharing that can be applied to any language, with or without the
occurs-check. Results for soundness, idempotence and commutativity for abstract
unification using this abstraction function are proven.
| [
{
"version": "v1",
"created": "Tue, 27 Feb 2001 14:54:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hill",
"Patricia M.",
""
],
[
"Bagnara",
"Roberto",
""
],
[
"Zaffanella",
"Enea",
""
]
]
| new_dataset | 0.970581 |
cs/0103013 | Masaki Murata | Masaki Murata, Masao Utiyama, Qing Ma, Hiromi Ozaku, and Hitoshi
Isahara | CRL at Ntcir2 | 11 pages. Computation and Language. This paper describes our results
of information retrieval in the NTCIR2 contest | null | null | null | cs.CL | null | We have developed systems of two types for NTCIR2. One is an enhenced version
of the system we developed for NTCIR1 and IREX. It submitted retrieval results
for JJ and CC tasks. A variety of parameters were tried with the system. It
used such characteristics of newspapers as locational information in the CC
tasks. The system got good results for both of the tasks. The other system is a
portable system which avoids free parameters as much as possible. The system
submitted retrieval results for JJ, JE, EE, EJ, and CC tasks. The system
automatically determined the number of top documents and the weight of the
original query used in automatic-feedback retrieval. It also determined
relevant terms quite robustly. For EJ and JE tasks, it used document expansion
to augment the initial queries. It achieved good results, except on the CC
tasks.
| [
{
"version": "v1",
"created": "Mon, 12 Mar 2001 09:36:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Murata",
"Masaki",
""
],
[
"Utiyama",
"Masao",
""
],
[
"Ma",
"Qing",
""
],
[
"Ozaku",
"Hiromi",
""
],
[
"Isahara",
"Hitoshi",
""
]
]
| new_dataset | 0.999694 |
cs/0103018 | Claudio Gutierrez | Volker Diekert, Claudio Gutierrez, Christian Hagenah | The Existential Theory of Equations with Rational Constraints in Free
Groups is PSPACE-Complete | 45 pages. LaTeX source | null | null | null | cs.DS cs.LO | null | It is known that the existential theory of equations in free groups is
decidable. This is a famous result of Makanin. On the other hand it has been
shown that the scheme of his algorithm is not primitive recursive. In this
paper we present an algorithm that works in polynomial space, even in the more
general setting where each variable has a rational constraint, that is, the
solution has to respect a specification given by a regular word language. Our
main result states that the existential theory of equations in free groups with
rational constraints is PSPACE-complete. We obtain this result as a corollary
of the corresponding statement about free monoids with involution.
| [
{
"version": "v1",
"created": "Mon, 26 Mar 2001 15:58:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Diekert",
"Volker",
""
],
[
"Gutierrez",
"Claudio",
""
],
[
"Hagenah",
"Christian",
""
]
]
| new_dataset | 0.998099 |
cs/0104006 | Menno van Zaanen | Menno van Zaanen | ABL: Alignment-Based Learning | 7 pages | Proceedings of the 18th International Conference on Computational
Linguistics (COLING); Saarbrucken, Germany. pages 961-967 | null | null | cs.LG cs.CL | null | This paper introduces a new type of grammar learning algorithm, inspired by
string edit distance (Wagner and Fischer, 1974). The algorithm takes a corpus
of flat sentences as input and returns a corpus of labelled, bracketed
sentences. The method works on pairs of unstructured sentences that have one or
more words in common. When two sentences are divided into parts that are the
same in both sentences and parts that are different, this information is used
to find parts that are interchangeable. These parts are taken as possible
constituents of the same type. After this alignment learning step, the
selection learning step selects the most probable constituents from all
possible constituents.
This method was used to bootstrap structure on the ATIS corpus (Marcus et
al., 1993) and on the OVIS (Openbaar Vervoer Informatie Systeem (OVIS) stands
for Public Transport Information System.) corpus (Bonnema et al., 1997). While
the results are encouraging (we obtained up to 89.25 % non-crossing brackets
precision), this paper will point out some of the shortcomings of our approach
and will suggest possible solutions.
| [
{
"version": "v1",
"created": "Tue, 3 Apr 2001 14:20:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"van Zaanen",
"Menno",
""
]
]
| new_dataset | 0.99778 |
cs/0105005 | Llu\'is Padr\'o | J. Daud\'e, L. Padr\'o and G. Rigau (TALP Research Center, Universitat
Polit\`ecnica de Catalunya) | A Complete WordNet1.5 to WordNet1.6 Mapping | 6 pages, 5 figures. To appear in proceedings of NAACL'01 Workshop on
WordNet and Other Lexical Resources | null | null | null | cs.CL | null | We describe a robust approach for linking already existing lexical/semantic
hierarchies. We use a constraint satisfaction algorithm (relaxation labelling)
to select --among a set of candidates-- the node in a target taxonomy that
bests matches each node in a source taxonomy. In this paper we present the
complete mapping of the nominal, verbal, adjectival and adverbial parts of
WordNet 1.5 onto WordNet 1.6.
| [
{
"version": "v1",
"created": "Fri, 4 May 2001 08:55:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Daudé",
"J.",
"",
"TALP Research Center, Universitat\n Politècnica de Catalunya"
],
[
"Padró",
"L.",
"",
"TALP Research Center, Universitat\n Politècnica de Catalunya"
],
[
"Rigau",
"G.",
"",
"TALP Research Center, Universitat\n Politècnica de Catalunya"
]
]
| new_dataset | 0.972665 |
cs/0105014 | Wen Chen | W. Chen | Errata and supplements to: Orthonormal RBF Wavelet and Ridgelet-like
Series and Transforms for High-Dimensional Problems | Welcome any comments to [email protected] | null | null | null | cs.NA cs.CE | null | In recent years some attempts have been done to relate the RBF with wavelets
in handling high dimensional multiscale problems. To the author's knowledge,
however, the orthonormal and bi-orthogonal RBF wavelets are still missing in
the literature. By using the nonsingular general solution and singular
fundamental solution of differential operator, recently the present author,
refer. 3, made some substantial headway to derive the orthonormal RBF wavelets
series and transforms. The methodology can be generalized to create the RBF
wavelets by means of the orthogonal convolution kernel function of various
integral operators. In particular, it is stressed that the presented RBF
wavelets does not apply the tensor product to handle multivariate problems at
all.
This note is to correct some errata in reference 3 and also to supply a few
latest advances in the study of orthornormal RBF wavelet transforms.
| [
{
"version": "v1",
"created": "Mon, 7 May 2001 16:53:05 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.98824 |
cs/0105023 | Dupuy Sylvain | Sylvain Dupuy, Arjan Egges, Vincent Legendre and Pierre Nugues | Generating a 3D Simulation of a Car Accident from a Written Description
in Natural Language: the CarSim System | 8 pages, ACL 2001, Workshop on Temporal and Spatial Information
Processing | null | null | null | cs.CL | null | This paper describes a prototype system to visualize and animate 3D scenes
from car accident reports, written in French. The problem of generating such a
3D simulation can be divided into two subtasks: the linguistic analysis and the
virtual scene generation. As a means of communication between these two
modules, we first designed a template formalism to represent a written accident
report. The CarSim system first processes written reports, gathers relevant
information, and converts it into a formal description. Then, it creates the
corresponding 3D scene and animates the vehicles.
| [
{
"version": "v1",
"created": "Mon, 14 May 2001 09:05:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dupuy",
"Sylvain",
""
],
[
"Egges",
"Arjan",
""
],
[
"Legendre",
"Vincent",
""
],
[
"Nugues",
"Pierre",
""
]
]
| new_dataset | 0.999083 |
cs/0106014 | Viacheslav Wolfengagen | Viacheslav Wolfengagen | L.T.Kuzin: Research Program | 10 pages | Proceedings of the 1st International Workshop on Computer Science
and Information Technologies CSIT'99. Moscow, Russia, January 18--22, 1999.
Vol. 1, pp. 97--106 | null | null | cs.DM cs.AI cs.SE | null | Lev T. Kuzin (1928--1997) is one of the founders of modern cybernetics and
information science in Russia. He was awarded and honored the USSR State Prize
for inspiring vision into the future of technical cybernetics and his invention
and innovation of key technologies.
The last years he interested in the computational models of geometrical and
algebraic nature and their applications in various branches of computer science
and information technologies. In the recent years the interest in computation
models based on object notion has grown tremendously stimulating an interest to
Kuzin's ideas. This year of 50th Anniversary of Cybernetics and on the occasion
of his 70th birthday on September 12, 1998 seems especially appropriate for
discussing Kuzin's Research Program.
| [
{
"version": "v1",
"created": "Fri, 8 Jun 2001 17:42:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wolfengagen",
"Viacheslav",
""
]
]
| new_dataset | 0.99594 |
cs/0106032 | David Eppstein | David Eppstein | Hinged Kite Mirror Dissection | 8 pages, 7 figures | null | null | null | cs.CG math.MG | null | Any two polygons of equal area can be partitioned into congruent sets of
polygonal pieces, and in many cases one can connect the pieces by flexible
hinges while still allowing the connected set to form both polygons. However it
is open whether such a hinged dissection always exists. We solve a special case
of this problem, by showing that any asymmetric polygon always has a hinged
dissection to its mirror image. Our dissection forms a chain of kite-shaped
pieces, found by a circle-packing algorithm for quadrilateral mesh generation.
A hinged mirror dissection of a polygon with n sides can be formed with O(n)
kites in O(n log n) time.
| [
{
"version": "v1",
"created": "Wed, 13 Jun 2001 20:42:09 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eppstein",
"David",
""
]
]
| new_dataset | 0.999431 |
cs/0106046 | Floris Geerts | Floris Geerts | Expressing the cone radius in the relational calculus with real
polynomial constraints | 9 pages | null | null | null | cs.DB cs.LO | null | We show that there is a query expressible in first-order logic over the reals
that returns, on any given semi-algebraic set A, for every point a radius
around which A is conical. We obtain this result by combining famous results
from calculus and real algebraic geometry, notably Sard's theorem and Thom's
first isotopy lemma, with recent algorithmic results by Rannou.
| [
{
"version": "v1",
"created": "Thu, 21 Jun 2001 16:33:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Geerts",
"Floris",
""
]
]
| new_dataset | 0.993661 |
cs/0107011 | Angelo Monti | Andrea E.F. Clementi, Angelo Monti, and Riccardo Silvestri | Distributed Broadcast in Wireless Networks with Unknown Topology | 27 pages, 1 figure, 1 table | null | null | null | cs.DS cs.DM | null | A multi-hop synchronous wirelss network is said to be unknown if the nodes
have no knowledge of the topology. A basic task in wireless network is that of
broadcasting a message (created by a fixed source node) to all nodes of the
network. The multi-broadcast that consists in performing a set of r independent
broadcasts. In this paper, we study the completion and the termination time of
distributed protocols for both the (single) broadcast and the multi-broadcast
operations on unknown networks as functions of the number of nodes n, the
maximum eccentricity D, the maximum in-degree Delta, and the congestion c of
the networks. We establish new connections between these operations and some
combinatorial concepts, such as selective families, strongly-selective families
(also known as superimposed codes), and pairwise r-different families. Such
connections, combined with a set of new lower and upper bounds on the size of
the above families, allow us to derive new lower bounds and new distributed
protocols for the broadcast and multi-broadcast operations. In particular, our
upper bounds are almost tight and improve exponentially over the previous
bounds when D and Delta are polylogarithmic in n. Network topologies having
``small'' eccentricity and ``small'' degree (such as bounded-degree expanders)
are often used in practice to achieve efficient communication.
| [
{
"version": "v1",
"created": "Fri, 6 Jul 2001 16:18:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Clementi",
"Andrea E. F.",
""
],
[
"Monti",
"Angelo",
""
],
[
"Silvestri",
"Riccardo",
""
]
]
| new_dataset | 0.998239 |
cs/0107015 | Pontus Svenson | Pontus Svenson | From Neel to NPC: Colouring Small Worlds | 4 pages, 6 figures | null | null | null | cs.CC cond-mat.stat-mech | null | In this note, we present results for the colouring problem on small world
graphs created by rewiring square, triangular, and two kinds of cubic (with
coordination numbers 5 and 6) lattices. As the rewiring parameter p tends to 1,
we find the expected crossover to the behaviour of random graphs with
corresponding connectivity. However, for the cubic lattices there is a region
near p=0 for which the graphs are colourable. This could in principle be used
as an additional heuristic for solving real world colouring or scheduling
problems. Small worlds with connectivity 5 and p ~ 0.1 provide an interesting
ensemble of graphs whose colourability is hard to determine. For square
lattices, we get good data collapse plotting the fraction of colourable graphs
against the rescaled parameter parameter $p N^{-\nu}$ with $\nu = 1.35$. No
such collapse can be obtained for the data from lattices with coordination
number 5 or 6.
| [
{
"version": "v1",
"created": "Wed, 11 Jul 2001 12:13:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Svenson",
"Pontus",
""
]
]
| new_dataset | 0.999757 |
cs/0107034 | Judith Beumer | Elizabeth D. Dolan | NEOS Server 4.0 Administrative Guide | 45 pages including front matter, 3 figures | null | null | ANL/MCS-TM-250 | cs.DC | null | The NEOS Server 4.0 provides a general Internet-based client/server as a link
between users and software applications. The administrative guide covers the
fundamental principals behind the operation of the NEOS Server, installation
and trouble-shooting of the Server software, and implementation details of
potential interest to a NEOS Server administrator. The guide also discusses
making new software applications available through the Server, including areas
of concern to remote solver administrators such as maintaining security,
providing usage instructions, and enforcing reasonable restrictions on jobs.
The administrative guide is intended both as an introduction to the NEOS Server
and as a reference for use when running the Server.
| [
{
"version": "v1",
"created": "Thu, 26 Jul 2001 15:19:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dolan",
"Elizabeth D.",
""
]
]
| new_dataset | 0.997313 |
cs/0107035 | Andrei S. Lopatenko | A. Lopatenko | Semantic Web Content Accessibility Guidelines for Current Research
Information Systems (CRIS) | 25 pages | Second Interim Report of Extencion Centre, Vienna University of
Technology, 2001 | null | null | cs.NI cs.DL | null | The most exciting challenge for CRIS is to create a service for research
information which should be wide-spread, distributed and actual like Google,
but at the same time structured, trusted, with a complex search and navigation
similar to today CRIS application. The core technology for such a "new" CRIS is
the semantic web technology to integrate database contents with HTML and XML
web pages for being provided to the research interested public. One (at the
moment the best) possible way is to use RDF (Resource Description Framework)
which is also recommended by the W3 consortium.
| [
{
"version": "v1",
"created": "Sun, 29 Jul 2001 18:50:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lopatenko",
"A.",
""
]
]
| new_dataset | 0.995615 |
cs/0108002 | Paul Vitanyi | Sibsankar Haldar (Bell Labs) and Paul Vitanyi (CWI and University of
Amsterdam) | Bounded Concurrent Timestamp Systems Using Vector Clocks | LaTeX source, 35 pages; To apper in: J. Assoc. Comp. Mach | null | null | null | cs.DC | null | Shared registers are basic objects used as communication mediums in
asynchronous concurrent computation. A concurrent timestamp system is a higher
typed communication object, and has been shown to be a powerful tool to solve
many concurrency control problems. It has turned out to be possible to
construct such higher typed objects from primitive lower typed ones. The next
step is to find efficient constructions. We propose a very efficient wait-free
construction of bounded concurrent timestamp systems from 1-writer multireader
registers. This finalizes, corrects, and extends, a preliminary bounded
multiwriter construction proposed by the second author in 1986. That work
partially initiated the current interest in wait-free concurrent objects, and
introduced a notion of discrete vector clocks in distributed algorithms.
| [
{
"version": "v1",
"created": "Thu, 2 Aug 2001 17:13:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Haldar",
"Sibsankar",
"",
"Bell Labs"
],
[
"Vitanyi",
"Paul",
"",
"CWI and University of\n Amsterdam"
]
]
| new_dataset | 0.991861 |
cs/0108015 | Jeffrey M. Rosenfeld | Jeffrey M. Rosenfeld | Spiders and Crawlers and Bots, Oh My: The Economic Efficiency and Public
Policy of Contracts that Restrict Data Collection | 29th TPRC Conference, 2001 | null | null | TPRC-2001-XXX | cs.CY | null | Recent trends reveal the search by companies for a legal hook to prevent the
undesired and unauthorized copying of information posted on websites. In the
center of this controversy are metasites, websites that display prices for a
variety of vendors. Metasites function by implementing shopbots, which extract
pricing data from other vendors' websites. Technological mechanisms have proved
unsuccessful in blocking shopbots, and in response, websites have asserted a
variety of legal claims. Two recent cases, which rely on the troublesome
trespass to chattels doctrine, suggest that contract law may provide a less
demanding legal method of preventing the search of websites by data robots. If
blocking collection of pricing data is as simple as posting an online contract,
the question arises whether this end result is desirable and legally viable.
| [
{
"version": "v1",
"created": "Wed, 22 Aug 2001 23:34:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rosenfeld",
"Jeffrey M.",
""
]
]
| new_dataset | 0.967686 |
cs/0108019 | Judith Beumer | E. Ong, E. Lusk, and W. Gropp | Scalable Unix Commands for Parallel Processors: A High-Performance
Implementation | 9 pages, 2 figures | in Recent Advances in Parallel Virtual Machine and Message Passing
Interface, eds. Y. Cotronis and J. Dongarra, Lecture Notes in Computer
Science, Vol. 2131, Springer-Verlag, pp. 410-418, Sept. 2001. | null | ANL/MCS-P885-0601 | cs.DC | null | We describe a family of MPI applications we call the Parallel Unix Commands.
These commands are natural parallel versions of common Unix user commands such
as ls, ps, and find, together with a few similar commands particular to the
parallel environment. We describe the design and implementation of these
programs and present some performance results on a 256-node Linux cluster. The
Parallel Unix Commands are open source and freely available.
| [
{
"version": "v1",
"created": "Mon, 27 Aug 2001 15:54:41 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ong",
"E.",
""
],
[
"Lusk",
"E.",
""
],
[
"Gropp",
"W.",
""
]
]
| new_dataset | 0.999202 |
cs/0109010 | Bonnie Webber | Bonnie Webber, Matthew Stone, Aravind Joshi and Alistair Knott | Anaphora and Discourse Structure | 45 pages, 17 figures. Revised resubmission to Computational
Linguistics | null | null | null | cs.CL | null | We argue in this paper that many common adverbial phrases generally taken to
signal a discourse relation between syntactically connected units within
discourse structure, instead work anaphorically to contribute relational
meaning, with only indirect dependence on discourse structure. This allows a
simpler discourse structure to provide scaffolding for compositional semantics,
and reveals multiple ways in which the relational meaning conveyed by adverbial
connectives can interact with that associated with discourse structure. We
conclude by sketching out a lexicalised grammar for discourse that facilitates
discourse interpretation as a product of compositional rules, anaphor
resolution and inference.
| [
{
"version": "v1",
"created": "Sun, 9 Sep 2001 16:41:59 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Sep 2002 18:13:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Webber",
"Bonnie",
""
],
[
"Stone",
"Matthew",
""
],
[
"Joshi",
"Aravind",
""
],
[
"Knott",
"Alistair",
""
]
]
| new_dataset | 0.999535 |
cs/0109021 | Milton L. Mueller | Milton L. Mueller | Competing DNS Roots: Creative Destruction or Just Plain Destruction? | null | null | null | TPRC-2001-029 | cs.CY | null | The Internet Domain Name System (DNS) is a hierarchical name space that
enables the assignment of unique, mnemonic identifiers to Internet hosts and
the consistent mapping of these names to IP addresses. The root of the domain
name system is the top of the hierarchy and is currently managed by a
quasi-private centralized regulatory authority, the Internet Corporation for
Assigned Names and Numbers (ICANN). This paper identifies and discusses the
economic and policy issues raised by competing DNS roots. The paper provides a
precise definition of root-competition and shows that multiple roots are a
species of standards competition, in which network externalities play a major
role. The paper performs a structural analysis of the different forms that
competing DNS roots can take and their effects on end-user compatibility. It
then explores the policy implications of the various forms of competition.
The thesis of the paper is that root competition is caused by a severe
disjunction between the demand for and supply of top-level domain names. ICANN
has authorized a tiny number of new top-level domains (7) and subjected their
operators to excruciatingly slow and expensive contractual negotiations. The
growth of alternate DNS roots is an attempt to bypass that bottleneck. The
paper arrives at the policy conclusion that competition among DNS roots should
be permitted and is a healthy outlet for inefficiency or abuses of power by the
dominant root administrator.
| [
{
"version": "v1",
"created": "Mon, 17 Sep 2001 22:01:01 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Sep 2001 23:01:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mueller",
"Milton L.",
""
]
]
| new_dataset | 0.992323 |
cs/0109032 | Gerald Painkras | James Katz, Ronald E. Rice, and Philip Aspden | The Internet, 1995-2000: Access, Civic Involvement, and Social
Interaction | 29th TPRC Conference, 2001 | null | null | TPRC-2001-015 | cs.CY | null | Our research, which began fielding surveys in 1995, and which have been
repeated with variation in 1996, 1997 and 2000, was apparently the first to use
national random telephone survey methods to track social and community aspects
of Internet use, and to compare users and non-users. It also seems to be among
the first that used these methods to compare users with non-users in regards to
communication, social and community issues. The work has been largely supported
by grants from the Markle Foundation of New York City as well as the Robert
Wood Johnson Foundation.
Abridged, see full text for complete abstract.
| [
{
"version": "v1",
"created": "Tue, 18 Sep 2001 16:29:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Katz",
"James",
""
],
[
"Rice",
"Ronald E.",
""
],
[
"Aspden",
"Philip",
""
]
]
| new_dataset | 0.976767 |
cs/0109037 | Mark A. Lemley | Mark A. Lemley | Antitrust, Intellectual Property and Standard-Setting Organizations | 29th TPRC Conference 2001 | null | null | TPRC-2001-001 | cs.CY | null | Standard-setting organizations (SSOs) regularly encounter situations in which
one or more companies claim to own proprietary rights that cover a proposed
industry standard. The industry cannot adopt the standard without the
permission of the intellectual property owner (or owners).
How SSOs respond to those who assert intellectual property rights is
critically important. Whether or not private companies retain intellectual
property rights in group standards will determine whether a standard is "open"
or "closed." It will determine who can sell compliant products, and it may well
influence whether the standard adopted in the market is one chosen by a group
or one offered by a single company. SSO rules governing intellectual property
rights will also affect how standards change as technology improves.
Given the importance of SSO rules governing intellectual property rights,
there has been surprisingly little treatment of SSOs or their intellectual
property rules in the legal literature. My aim in this article is to fill that
void. To do so, I have surveyed the intellectual property policies of dozens of
SSOs, primarily but not exclusively in the computer networking and
telecommunications industries.
| [
{
"version": "v1",
"created": "Thu, 20 Sep 2001 00:15:10 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lemley",
"Mark A.",
""
]
]
| new_dataset | 0.999105 |
cs/0109040 | Srikanta Bedathur J. | B. J. Srikanta, Jayant Haritsa and Udaysankar Sen | The Building of BODHI, a Bio-diversity Database System | 29 pages, 5 figures | null | null | TR-2001-02 | cs.DB q-bio.PE | null | We have recently built a database system called BODHI, intended to store
plant bio-diversity information. It is based on an object-oriented modeling
approach and is developed completely around public-domain software. The unique
feature of BODHI is that it seamlessly integrates diverse types of data,
including taxonomic characteristics, spatial distributions, and genetic
sequences, thereby spanning the entire range from molecular to organism-level
information. A variety of sophisticated indexing strategies are incorporated to
efficiently access the various types of data, and a rule-based query processor
is employed for optimizing query execution. In this paper, we report on our
experiences in building BODHI and on its performance characteristics for a
representative set of queries.
| [
{
"version": "v1",
"created": "Thu, 20 Sep 2001 12:27:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Srikanta",
"B. J.",
""
],
[
"Haritsa",
"Jayant",
""
],
[
"Sen",
"Udaysankar",
""
]
]
| new_dataset | 0.998783 |
cs/0109043 | Harmeet Sawhney | Hokyu Lee and Harmeet Sawhney | PUC Autonomy and Policy Innovation: Local Telephone Competition in
Arkansas and New York | 29th TPRC Conference, 2001 | null | null | TPRC-2001-026 | cs.CY | null | In the pre-divestiture era, the regulatory environment in the U.S. was fairly
uniform and harmonious with the FCC setting the course and the accommodative
state PUCs making corresponding changes in their own policies. The divestiture
fractured this monolithic system as it forced the PUCs to respond to new forces
unleashed in their own backyards. Soon there was great diversity in the overall
regulatory landscape. Within this new environment, there is considerable
disparity among the PUCs in terms of their ability to implement new ideas. This
paper seeks to understand the structural factors that influence the latitude of
regulatory action by PUCs via a comparative study of local telephone
competition policy making in Arkansas and New York. The analysis suggests that
the presence or absence of countervailing forces determines the relative
autonomy the PUCs enjoy and thereby their ability to introduce new ideas into
their states.
| [
{
"version": "v1",
"created": "Fri, 21 Sep 2001 17:14:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lee",
"Hokyu",
""
],
[
"Sawhney",
"Harmeet",
""
]
]
| new_dataset | 0.962022 |
cs/0109048 | Patricia Aufderheide | Patricia Aufderheide | Competition and Commons: The Post-Telecom Act Public Interest, in and
after the AOLTW Merger | 29th TPRC Conference, 2001 | null | null | TPRC-2001-2030 | cs.CY | null | In asserting a competitive market environment as a justification for
regulatory forbearance, the Telecommunications Act of 1996 finally articulated
a clear standard for the FCC's public interest standard, one of the most
protean concepts in communications. This seeming clarity has not, however,
inhibited intense political conflict over the term. This paper examines public
and regulatory debate over the AOL Time Warner merger as an example of the way
in which the linkage between competitions and commons policy becomes relevant
to communications policy, particularly in relation to mass media, and discusses
interpretations of the public interest in the current FCC. The paper proposes
that the Telecom Act's goal of fostering economic competition among information
service providers, and the democratic ideal of nurturing public relationships
and behaviors can be linked. Competition policy that creates the opportunity
for untrammeled interactivity also provides a sine qua non to nurture the
social phenomenon of the commons. The linked concepts of competition and
commons could also provide useful ways to interpret the public interest in
policy arenas as spectrum allocation and intellectual property.
| [
{
"version": "v1",
"created": "Sat, 22 Sep 2001 19:25:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Aufderheide",
"Patricia",
""
]
]
| new_dataset | 0.995455 |
cs/0109049 | Walter S. Baer | Walter S. Baer | Signing Initiative Petitions Online: Possibilities, Problems and
Prospects | 29th TPRC Conference, 2001 | null | null | TPRC-2001-2054 | cs.CY | null | Many people expect the Internet to change American politics, most likely in
the direction of increasing direct citizen participation and forcing government
officials to respond more quickly to voter concerns. A recent California
initiative with these objectives would authorize use of encrypted digital
signatures over the Internet to qualify candidates, initiatives, and other
ballot measures. Proponents of Internet signature gathering say it will
significantly lower the cost of qualifying initiatives and thereby reduce the
influence of organized, well-financed interest groups. They also believe it
will increase both public participation in the political process and public
understanding about specific measures. However, opponents question whether
Internet security is adequate to prevent widespread abuse and argue that the
measure would create disadvantages for those who lack access to the Internet.
Beyond issues of security, cost, and access lie larger questions about the
effects of Internet signature gathering on direct democracy. Would it encourage
greater and more informed public participation in the political process? Or
would it flood voters with ballot measures and generally worsen current
problems with the initiative process itself? Because we lack good data on these
questions, answers to them today are largely conjectural. We can be fairly
sure, however, that Internet petition signing, like Internet voting, will have
unintended consequences.
| [
{
"version": "v1",
"created": "Sat, 22 Sep 2001 22:57:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Baer",
"Walter S.",
""
]
]
| new_dataset | 0.997353 |
cs/0109062 | Gerald Painkras | Rajni Gupta | India Attempts to Give a Jump-start to its Derailed Telecommunications
Liberalization Process | 29th TPRC Conference, 2001 | null | null | null | cs.CY | null | After the 1991 economic policy made a shift from a closed economic model to a
market-oriented model. The government invited private sector to participate in
reforming its telecom sector. However, the government took a half-hearted
approach in overhauling the legal and regulatory regime, suitable for
competitive regime or in framing the 1994 Telecom Policy.
Competition was allowed in cellular and basis services. The ministry and the
incumbent (DOT) issued licenses to their competitors. Lack of transparency in
issuing licenses and unrealistic license fee derailed the reforms process and
led to wasteful litigation. The courts did not support the regulator and
virtually made its role redundant.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 14:20:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gupta",
"Rajni",
""
]
]
| new_dataset | 0.978775 |
cs/0109063 | Richard Cawley | Richard Cawley | Universal service, specific services on generic networks, some logic
begins to emerge in the policy area | 29th TPRC Conference, 2001 | null | null | TPRC-2001-046 | cs.CY | null | It has proved to be difficult to translate the lessons from the literature on
universal service into the policy framework because of political interests and
regulatory capture. Neither the USA or Europe has made a very good job of
devising a clean framework and the WTO agreement is sparing in this area. A
number of pressures in the European context have enabled a more systematic
approach to emerge, that exploits the academic work. They include the need for
the European regulatory framework to encompass E. European countries where
network development and income levels are much lower, the desire to encompass
Internet within the universal service regulatory framework, a willingness to
design a framework that covers all communications networks and remove the
telecommunications bias, thereby forcing issues of economic neutrality to the
fore. The paper systematically goes through a number of key areas and
principles of regulation and how they are being designed to deal with a range
of national situations. They include, defining the scope of universal service
and the principles by which it might be modified in the light of technological
and economic developments; incorporating latitude for intervention outside this
defined scope, defining incentive and designation methods to encourage the
efficient supply of elements of universal service obligations, interpreting
affordability in the context of price and income levels that diverge
considerably, requiring both allocative efficiency and competitive neutrality,
formulating alternative financing methods including general government
financing and value added tax type methods which can co-exist and provide
comparative policy yardsticks.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 14:56:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cawley",
"Richard",
""
]
]
| new_dataset | 0.959584 |
cs/0109074 | Susan Oberlander | Susan Oberlander | Indicators of Independence in Regulatory Commissions | 29th TPRC Conference, 2001 This revision has minor editorial changes | null | null | TPRC-2001-048 | cs.CY | null | Independent regulatory commissions such as the Federal Communications
Commission (FCC) must produce policies that reflect technical expertise, legal
precedent, and stakeholder input. Given these situational imperatives, how does
the FCC implement independence in its decision-making? This research explicates
some of the underlying rules, resources, and relationships within the
environment in which the agency is embedded that influence agency work
practices to operationalize independence. Research such as this may be helpful
in the creation of new, or for assessment of existing, regulatory commissions,
but only if great attention is paid not only to institutional structure, but
also to the practice of staff in the agency.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 18:54:27 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Oct 2001 19:54:53 GMT"
},
{
"version": "v3",
"created": "Mon, 22 Oct 2001 20:19:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Oberlander",
"Susan",
""
]
]
| new_dataset | 0.987217 |
cs/0109075 | A. Michael Froomkin | A. Michael Froomkin and Mark A. Lemley | ICANN and Antitrust | 29th TPRC Conference, 2001 | null | null | TPRC-2001-041 | cs.CY | null | The Internet Corporation for Assigned Names and Numbers (ICANN) is a private
non-profit company which, pursuant to contracts with the US government, acts as
the de facto regulator for DNS policy. ICANN decides what TLDs will be made
available to users, and which registrars will be permitted to offer those TLDs
for sale. In this article we focus on a hitherto-neglected implication of
ICANN's assertion that it is a private rather than a public actor: its
potential liability under the U.S. antitrust laws, and the liability of those
who transact with it. ICANN argues that it is not as closely tied to the
government as NSI and IANA were in the days before ICANN was created. If this
is correct, it seems likely that ICANN will not benefit from the antitrust
immunity those actors enjoyed. Some of ICANN's regulatory actions may restrain
competition, e.g. its requirement that applicants for new gTLDs demonstrate
that their proposals would not enable competitive (alternate) roots and ICANN's
preventing certain types of non-price competition among registrars (requiring
the UDRP). ICANN's rule adoption process might be characterized as
anticompetitive collusion by existing registrars, who are likely not be subject
to the Noerr-Pennington lobbying exemption. Whether ICANN has in fact violated
the antitrust laws depends on whether it is an antitrust state actor, whether
the DNS is an essential facility, and on whether it can shelter under
precedents that protect standard-setting bodies. If (as seems likely) a private
ICANN and those who petition it are subject to antitrust law, everyone involved
in the process needs to review their conduct with an eye towards legal
liability. ICANN should act very differently with respect to both the UDRP and
the competitive roots if it is to avoid restraining trade.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 19:25:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Froomkin",
"A. Michael",
""
],
[
"Lemley",
"Mark A.",
""
]
]
| new_dataset | 0.999509 |
cs/0109090 | Sharon Strover | Sharon Strover, Michael Oden, Nobuya Inagaki | Telecommunications and rural economies: Findings from the Appalachian
region | 29th TPRC Conference | null | null | TPRC-2001-080 | cs.CY | null | This research investigates the relationship between telecommunications
infrastructure, economic conditions, and federal and state policies and
initiatives. It presents a detailed look at the telecommunications environment
of the Appalachian region, particularly focusing on broadband technologies. A
strong, positive association exists between telecommunications infrastructure
and economic status. The effects of federal and state universal service
policies are examined, as well as some of the ways states have leveraged their
own infrastructure to improve telecommunications capabilities in their region.
Other state and local telecommunications-related programs are noted.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 21:50:05 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Strover",
"Sharon",
""
],
[
"Oden",
"Michael",
""
],
[
"Inagaki",
"Nobuya",
""
]
]
| new_dataset | 0.999505 |
cs/0109091 | Craig McTaggart | Craig McTaggart | E PLURIBUS ENUM: Unifying International Telecommunications Networks and
Governance | 29th TPRC Conference, 2001 | null | null | TPRC-2001-064 | cs.CY cs.NI | null | ENUM effectively bridges the telephone and Internet worlds by placing
telephone numbers from the ITU Rec. E.164 public telecommunication numbering
plan into the Internet Domain Name System (DNS) as domain names. ENUM
potentially presents significant public policy issues at both the domestic and
international levels. Ultimately, it should not matter whether ENUM is
approached as a telecommunications issue or an Internet issue because: (1) they
are becoming the same thing technically, and (2) they engage the same global
public interests. For the same reasons as apply to traditional
telecommunications, and even to the Internet itself, public oversight of ENUM
naming, numbering, and addressing resources is justified both by technical
necessity and the interests of consumer protection (particularly personal
privacy) and competition at higher service layers. A single, coordinated global
DNS domain for at least Tier 0 (the international level) of the ENUM names
hierarchy should be designated by public authorities. Many of the technical
characteristics and policy considerations relevant at the ENUM Tier 0 and 1
zones are also directly applicable to the Internet's IP address space and DNS
root (or Tier 0) zone - key shared elements of the Internet's logical
infrastructure. Despite the fundamentally international nature of the
Internet's logical infrastructure layer, and the purported privatization of
administration of its IP address space and the DNS, Internet governance is not
yet truly international. The ENUM policy debate illustrates the need for
authoritative international public oversight of public communications network
logical infrastructure, including that of traditional telecommunications, the
Internet, and ENUM.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 21:53:55 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Oct 2001 19:26:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"McTaggart",
"Craig",
""
]
]
| new_dataset | 0.999399 |
cs/0109096 | Tony Christensen | Tony Christensen, Peter McCormick | CyberCampaigns and Canadian Politics: Still Waiting? | 29th TPRC Conference, 2001 | null | null | TPRC-2001-058 | cs.CY | null | The early election call in the fall of 2000 provided the perfect opportunity
to study the impact the Internet has had on election campaigning in Canada.
With the explosion of use the Net has seen since the 1997 general election,
Canadian federal parties stood at the threshold of a new age in election
campaigning. Pundits such as Rheingold (1993) have argued that the Internet
will provide citizens with a way to bypass traditional media and gain
unmediated access to each parties political message as well as providing a
forum for citizens to engage the parties, and each other in deliberative
debate.
Through a longitudinal analysis of party web pages and telephone interviews
with party staffers, we analyze the role the Internet played in the election
campaigns of Canada's federal parties. Our findings indicate that the parties
are still focusing on providing online features that talk at the voter instead
of engaging them in any type of meaningful discourse. Most of these sites were
exceptionally similar in their structure and in the type of content they
provided. Generally, these sites served as digital archives for campaign
material created with other media in mind and despite the multimedia
capabilities of the Internet, these sites tended to be overwhelmingly text
oriented. In line with Stromer-Galley's (2000) discussion of why candidates in
the U.S. avoid online interaction, we also argue that little incentive exists
to motivate parties to engage in any meaningful interaction with voters online.
| [
{
"version": "v1",
"created": "Mon, 24 Sep 2001 22:42:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Christensen",
"Tony",
""
],
[
"McCormick",
"Peter",
""
]
]
| new_dataset | 0.996428 |
cs/0109102 | Eli Noam | Eli M. Noam | The Next Frontier for Openness: Wireless Communications | 29th TPRC Conference, 2001 | null | null | TPRC-2001-094 | cs.CY | null | For wireless communications, the FCC has fostered competition rather than
openness. This has permitted the emergence of vertically integrated end-to-end
providers, creating problems of reduced hardware innovation, software
applications, user choice, and content access. To deal with these emerging
issues and create multi-level forms of competition, one policy is likely to
suffice: a Carterfone for wireless, coupled with more unlicensed spectrum.
| [
{
"version": "v1",
"created": "Tue, 25 Sep 2001 00:27:34 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Sep 2001 02:16:33 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Oct 2001 22:37:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Noam",
"Eli M.",
""
]
]
| new_dataset | 0.999363 |
cs/0109107 | Dan L. Burk | Dan L. Burk and Mark A. Lemley | Is Patent Law Technology Specific? | 29th TPRC Conference, 2001 | null | null | TPRC-2001-002 | cs.CY | null | Although patent law purports to cover all manner of technologies, we have
noticed recent divergence in the standards applied to biotechnology and to
software patents: the Federal Circuit has applied a very permissive standard of
obviousness in biotechnology, but a highly restrictive disclosure requirement.
The opposite holds true for software patents, which seems to us exactly
contrary to sound policy for either industry. These patent standards are
grounded in the legal fiction of the "person having ordinary skill in the art"
or PHOSITA. We discuss the appropriateness of the PHOSITA standard, concluding
that it properly lends flexibility to the patent system. We then discuss the
difficulty of applying this standard in different industries, offering
suggestions as to how it might be modified to avoid the problems seen in
biotechnology and software patents.
| [
{
"version": "v1",
"created": "Tue, 25 Sep 2001 18:25:36 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Sep 2001 18:18:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Burk",
"Dan L.",
""
],
[
"Lemley",
"Mark A.",
""
]
]
| new_dataset | 0.990578 |
cs/0109113 | Kyle Nicholas | Kyle Nicholas | Digital Arroyos: An Examination of State Policy and Regulated Market
Boundaries in Constructing Rural Internet Access | 29th TPRC Conference, 2001 | null | null | TPRC-2001-XXX | cs.CY | null | This focused study on state-level policy and access patterns contributes to a
fuller understanding of how these invisible barriers work to structure access
and define rural communities. Combining both quantitative and qualitative data,
this study examines the role of geo-policy barriers in one of the largest and
most rural states in the nation.
Expanded Area Service policies are state policies wherein phone customers can
expand their local calling area. Because useful Internet access requires a
flat-price connection, EAS policies can play a crucial role in connecting
citizens to one another. EAS policies (including Texas') tend to vary along
five dimensions (community of interest, customer scope, directionality, pricing
mechanism and policy scope). EAS policies that rely on regulated market
boundaries for definition can generate gross inequities in rural Internet
access. Interviews with Internet Service Providers in a case study of 25 rural
communities reveals that LATA and exchange boundaries, along with
geographically restricted infrastructure investments, curtail service provision
in remote areas. A statistical analysis of 1300 telephone exchanges, including
208 rural telephone exchanges in Texas reveals that the farther a community
lies from a metropolitan area the less likely they are to have reliable
Internet access
| [
{
"version": "v1",
"created": "Tue, 25 Sep 2001 18:15:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Nicholas",
"Kyle",
""
]
]
| new_dataset | 0.997952 |
cs/0110005 | Hirotada Kobayashi | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai | Two-way Quantum One-counter Automata | LaTeX2e, 14 pages, 3 figures | null | null | null | cs.CC quant-ph | null | After the first treatments of quantum finite state automata by Moore and
Crutchfield and by Kondacs and Watrous, a number of papers study the power of
quantum finite state automata and their variants. This paper introduces a model
of two-way quantum one-counter automata (2Q1CAs), combining the model of
two-way quantum finite state automata (2QFAs) by Kondacs and Watrous and the
model of one-way quantum one-counter automata (1Q1CAs) by Kravtsev. We give the
definition of 2Q1CAs with well-formedness conditions. It is proved that 2Q1CAs
are at least as powerful as classical two-way deterministic one-counter
automata (2D1CAs), that is, every language L recognizable by 2D1CAs is
recognized by 2Q1CAs with no error. It is also shown that several
non-context-free languages including {a^n b^{n^2}} and {a^n b^{2^n}} are
recognizable by 2Q1CAs with bounded error.
| [
{
"version": "v1",
"created": "Tue, 2 Oct 2001 11:51:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Yamasaki",
"Tomohiro",
""
],
[
"Kobayashi",
"Hirotada",
""
],
[
"Imai",
"Hiroshi",
""
]
]
| new_dataset | 0.999294 |
cs/0110010 | Zhe Dang | Zhe Dang | Pushdown Timed Automata: a Binary Reachability Characterization and
Safety Verification | 30 pages | null | null | null | cs.LO | null | We consider pushdown timed automata (PTAs) that are timed automata (with
dense clocks) augmented with a pushdown stack. A configuration of a PTA
includes a control state, dense clock values and a stack word. By using the
pattern technique, we give a decidable characterization of the binary
reachability (i.e., the set of all pairs of configurations such that one can
reach the other) of a PTA. Since a timed automaton can be treated as a PTA
without the pushdown stack, we can show that the binary reachability of a timed
automaton is definable in the additive theory of reals and integers. The
results can be used to verify a class of properties containing linear relations
over both dense variables and unbounded discrete variables. The properties
previously could not be verified using the classic region technique nor
expressed by timed temporal logics for timed automata and CTL$^*$ for pushdown
systems. The results are also extended to other generalizations of timed
automata.
| [
{
"version": "v1",
"created": "Tue, 2 Oct 2001 22:47:41 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dang",
"Zhe",
""
]
]
| new_dataset | 0.996517 |
cs/0110014 | Steven Bird | Steven Bird, Gary Simons, Chu-Ren Huang | The Open Language Archives Community and Asian Language Resources | 8 pages, 2 figures | Proceedings of the Workshop on Language Resources in Asia, 6th
Natural Language Processing Pacific Rim Symposium (NLPRS), Tokyo, November
2001 | null | null | cs.CL cs.DL | null | The Open Language Archives Community (OLAC) is a new project to build a
worldwide system of federated language archives based on the Open Archives
Initiative and the Dublin Core Metadata Initiative. This paper aims to
disseminate the OLAC vision to the language resources community in Asia, and to
show language technologists and linguists how they can document their tools and
data in such a way that others can easily discover them. We describe OLAC and
the OLAC Metadata Set, then discuss two key issues in the Asian context:
language classification and multilingual resource classification.
| [
{
"version": "v1",
"created": "Wed, 3 Oct 2001 12:45:41 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bird",
"Steven",
""
],
[
"Simons",
"Gary",
""
],
[
"Huang",
"Chu-Ren",
""
]
]
| new_dataset | 0.969363 |
cs/0110018 | Robert Cannon | Robert Cannon | ENUM: The Collision of Telephony and DNS Policy | 29th TPRC Conference, 2001 | null | null | TPRC-2001-XXX | cs.GL | null | ENUM marks either the convergence or collision of the public telephone
network with the Internet. ENUM is an innovation in the domain name system
(DNS). It starts with numerical domain names that are used to query DNS name
servers. The servers respond with address information found in DNS records.
This can be telephone numbers, email addresses, fax numbers, SIP addresses, or
other information. The concept is to use a single number in order to obtain a
plethora of contact information.
By convention, the Internet Engineering Task Force (IETF) ENUM Working Group
determined that an ENUM number would be the same numerical string as a
telephone number. In addition, the assignee of an ENUM number would be the
assignee of that telephone number. But ENUM could work with any numerical
string or, in fact, any domain name. The IETF is already working on using E.212
numbers with ENUM. [Abridged]
| [
{
"version": "v1",
"created": "Thu, 4 Oct 2001 17:35:18 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Oct 2001 21:02:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cannon",
"Robert",
""
]
]
| new_dataset | 0.955782 |
cs/0110038 | Paul Vitanyi | Joel Seiferas (University of Rochester) and Paul Vitanyi (CWI and
University of Amsterdam) | Counting is Easy | null | J. Seiferas and P.M.B. Vitanyi, Counting is easy, J. Assoc. Comp.
Mach. 35 (1988), pp. 985-1000 | null | null | cs.CC cs.DS | null | For any fixed $k$, a remarkably simple single-tape Turing machine can
simulate $k$ independent counters in real time. Informally, a counter is a
storage unit that maintains a single integer (initially 0), incrementing it,
decrementing it, or reporting its sign (positive, negative, or zero) on
command. Any automaton that responds to each successive command as a counter
would is said to simulate a counter. (Only for a sign inquiry is the response
of interest, of course. And zeroness is the only real issue, since a simulator
can readily use zero detection to keep track of positivity and negativity in
finite-state control. In this paper we describe a remarkably simple real-time
simulation, based on just five simple rewriting rules, of any fixed number $k$
of independent counters. On a Turing machine with a single, binary work tape,
the simulation runs in real time, handling an arbitrary counter command at each
step. The space used by the simulation can be held to $(k+\epsilon) \log_2 n$
bits for the first $n$ commands, for any specified $\epsilon > 0$.
| [
{
"version": "v1",
"created": "Thu, 18 Oct 2001 13:21:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Seiferas",
"Joel",
"",
"University of Rochester"
],
[
"Vitanyi",
"Paul",
"",
"CWI and\n University of Amsterdam"
]
]
| new_dataset | 0.984417 |
cs/0110039 | Paul Vitanyi | Tao Jiang (McMaster University), Joel Seiferas (Rochester University),
and Paul Vitanyi (CWI and University of Amsterdam) | Two heads are better than two tapes | LaTeX, 16 pages. The final journal paper contains minor corrections
as well as some extra typos, but, also, some clarifying figures. A close copy
to that can be downloaded from http://www.cwi.nl/~paulv/complexity.html | T. Jiang, J. Seiferas and P.M.B. Vitanyi, Two heads are better
than two tapes, J. Assoc. Comp. Mach., 44:2(1997), 237--256 | null | null | cs.CC | null | We show that a Turing machine with two single-head one-dimensional tapes
cannot recognize the set {x2x'| x \in {0,1}^* and x' is a prefix of x} in real
time, although it can do so with three tapes, two two-dimensional tapes, or one
two-head tape, or in linear time with just one tape. In particular, this
settles the longstanding conjecture that a two-head Turing machine can
recognize more languages in real time if its heads are on the same
one-dimensional tape than if they are on separate one-dimensional tapes.
| [
{
"version": "v1",
"created": "Thu, 18 Oct 2001 14:58:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jiang",
"Tao",
"",
"McMaster University"
],
[
"Seiferas",
"Joel",
"",
"Rochester University"
],
[
"Vitanyi",
"Paul",
"",
"CWI and University of Amsterdam"
]
]
| new_dataset | 0.996559 |
cs/0110052 | Nandlal L. Sarda | N. L. Sarda and Ankur Jain | Mragyati : A System for Keyword-based Searching in Databases | null | null | null | null | cs.DB | null | The web, through many search engine sites, has popularized the keyword-based
search paradigm, where a user can specify a string of keywords and expect to
retrieve relevant documents, possibly ranked by their relevance to the query.
Since a lot of information is stored in databases (and not as HTML documents),
it is important to provide a similar search paradigm for databases, where users
can query a database without knowing the database schema and database query
languages such as SQL. In this paper, we propose such a database search system,
which accepts a free-form query as a collection of keywords, translates it into
queries on the database using the database metadata, and presents query results
in a well-structured and browsable form. Th eysytem maps keywords onto the
database schema and uses inter-relationships (i.e., data semantics) among the
referred tables to generate meaningful query results. We also describe our
prototype for database search, called Mragyati. Th eapproach proposed here is
scalable, as it does not build an in-memory graph of the entire database for
searching for relationships among the objects selected by the user's query.
| [
{
"version": "v1",
"created": "Thu, 25 Oct 2001 08:55:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Sarda",
"N. L.",
""
],
[
"Jain",
"Ankur",
""
]
]
| new_dataset | 0.998155 |
cs/0110054 | Joseph O'Rourke | Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph
O'Rourke | Vertex-Unfoldings of Simplicial Manifolds | 12 pages, 7 figures, 10 references. Significant improvement of arXive
cs.CG/0107023 | null | null | Smith Technical Report 072 | cs.CG cs.DM | null | We present an algorithm to unfold any triangulated 2-manifold (in particular,
any simplicial polyhedron) into a non-overlapping, connected planar layout in
linear time. The manifold is cut only along its edges. The resulting layout is
connected, but it may have a disconnected interior; the triangles are connected
at vertices, but not necessarily joined along edges. We extend our algorithm to
establish a similar result for simplicial manifolds of arbitrary dimension.
| [
{
"version": "v1",
"created": "Sat, 27 Oct 2001 13:34:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Eppstein",
"David",
""
],
[
"Erickson",
"Jeff",
""
],
[
"Hart",
"George W.",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.998266 |
cs/0110059 | Joseph O'Rourke | Melody Donoso and Joseph O'Rourke | Nonorthogonal Polyhedra Built from Rectangles | 19 pages, 20 figures. Revised version makes two corrections: The
statement of the old Lemma 14 was incorrect. It has been corrected and merged
with Lemma 13 now. Second, Figure 19 (a skew quadrilateral) was incorrect,
and is now removed. It played no substantive role in the proofs | null | null | Smith Technical Report 073, Oct. 2001; revised May 2002 | cs.CG cs.DM | null | We prove that any polyhedron of genus zero or genus one built out of
rectangular faces must be an orthogonal polyhedron, but that there are
nonorthogonal polyhedra of genus seven all of whose faces are rectangles. This
leads to a resolution of a question posed by Biedl, Lubiw, and Sun [BLS99].
| [
{
"version": "v1",
"created": "Mon, 29 Oct 2001 19:26:05 GMT"
},
{
"version": "v2",
"created": "Tue, 7 May 2002 12:45:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Donoso",
"Melody",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.999089 |
cs/0111011 | Giovambattista Ianni | Giovambattista Ianni | Sintesi di algoritmi con SKY | In italian | null | null | Unical Math. Dept. TR 11-2001 | cs.LO | null | This paper describes the semantics and ideas about SKY, a logic programming
language intended in order to specify algorithmic strategies for the evaluation
of problems.
| [
{
"version": "v1",
"created": "Tue, 6 Nov 2001 17:02:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ianni",
"Giovambattista",
""
]
]
| new_dataset | 0.973491 |
cs/0111023 | Martin Pokorny | M. Pokorny (1), M. Brooks (1), B. Glendenning (1), G. Harris (1), R.
Heald (1), F. Stauffer (1), J. Pisano (1) ((1) NRAO) | Distributed Control System for the Test Interferometer of the ALMA
Project | Submitted to ICALEPCS'01, San Jose, USA, November 2001, (THAT004) 3
pages, LaTeX | eConf C011127 (2001) THAT004 | null | null | cs.DC physics.ins-det | null | The control system (TICS) for the test interferometer being built to support
the development of the Atacama Large Millimeter Array (ALMA)will itself be a
prototype for the final ALMA array, providing a test for the distributed
control system under development. TICS will be based on the ALMA Common
Software (ACS) (developed at the European Southern Observatory), which provides
CORBA-based services and a device management framework for the control
software.
Simple device controllers will run on single board computers, one of which
(known as an LCU) is located at each antenna; whereas complex, compound device
controllers may run on centrally located computers. In either circumstance,
client programs may obtain direct CORBA references to the devices and their
properties. Monitor and control requests are sent to devices or properties,
which then process and forward the commands to the appropriate hardware devices
as required. Timing requirements are met by tagging commands with (future)
timestamps synchronized to a timing pulse, which is regulated by a central
reference generator, and is distributed to all hardware devices in the array.
Monitoring is provided through a publish/subscribe CORBA-based service.
| [
{
"version": "v1",
"created": "Fri, 9 Nov 2001 00:33:54 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Dec 2001 21:16:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pokorny",
"M.",
"",
"NRAO"
],
[
"Brooks",
"M.",
"",
"NRAO"
],
[
"Glendenning",
"B.",
"",
"NRAO"
],
[
"Harris",
"G.",
"",
"NRAO"
],
[
"Heald",
"R.",
"",
"NRAO"
],
[
"Stauffer",
"F.",
"",
"NRAO"
],
[
"Pisano",
"J.",
"",
"NRAO"
]
]
| new_dataset | 0.998919 |
cs/0111028 | Taurel | JM. Chaize, A. Goetz, WD. Klotz, J. Meyer, M. Perez, E. Taurel, P.
Verdier | The ESRF TANGO control system status | 3 pages | eConf C011127 (2001) TUAP004 | null | null | cs.DC | null | TANGO is an object oriented control system toolkit based on CORBA presently
under development at the ESRF. IN this paper, the TANGO philosophy is briefly
presented. All the existing tools developed around TANGO will also be
presented. This include a code genrator, a WEB interface to TANGO objects, an
administration tool and an interface to LabView. Finally, an xample of a TANGO
device server for OPC device is given.
| [
{
"version": "v1",
"created": "Fri, 9 Nov 2001 14:29:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chaize",
"JM.",
""
],
[
"Goetz",
"A.",
""
],
[
"Klotz",
"WD.",
""
],
[
"Meyer",
"J.",
""
],
[
"Perez",
"M.",
""
],
[
"Taurel",
"E.",
""
],
[
"Verdier",
"P.",
""
]
]
| new_dataset | 0.999209 |
cs/0111031 | Robert W. Carey | Robert W. Carey, Kirby W. Fong, Randy J. Sanchez, Joseph D. Tappero,
John P. Woodruff | Large-Scale Corba-Distributed Software Framework for Nif Controls | 5 pages, 0 figures, ICALEPCS '01 | eConf C011127 (2001) THAI001 | null | THAI001 | cs.DC | null | The Integrated Computer Control System (ICCS) is based on a scalable software
framework that is distributed over some 325 computers throughout the NIF
facility. The framework provides templates and services at multiple levels of
abstraction for the construction of software applications that communicate via
CORBA (Common Object Request Broker Architecture). Various forms of
object-oriented software design patterns are implemented as templates to be
extended by application software. Developers extend the framework base classes
to model the numerous physical control points, thereby sharing the
functionality defined by the base classes. About 56,000 software objects each
individually addressed through CORBA are to be created in the complete ICCS.
Most objects have a persistent state that is initialized at system start-up and
stored in a database. Additional framework services are provided by centralized
server programs that implement events, alerts, reservations, message logging,
database/file persistence, name services, and process management. The ICCS
software framework approach allows for efficient construction of a software
system that supports a large number of distributed control points representing
a complex control application.
| [
{
"version": "v1",
"created": "Fri, 9 Nov 2001 16:40:09 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Carey",
"Robert W.",
""
],
[
"Fong",
"Kirby W.",
""
],
[
"Sanchez",
"Randy J.",
""
],
[
"Tappero",
"Joseph D.",
""
],
[
"Woodruff",
"John P.",
""
]
]
| new_dataset | 0.96048 |
cs/0111044 | Sheng Peng | S. Peng, R. Lambiase, B. Oerter, J. Smith | SNS Standard Power Supply Interface | PDF File | eConf C011127 (2001) THAP052 | null | null | cs.OH | null | The SNS has developed a standard power supply interface for the approximately
350 magnet power supplies in the SNS accumulator ring, Linac and transport
lines. Power supply manufacturers are providing supplies compatible with the
standard interface. The SNS standard consists of a VME based power supply
controller module (PSC) and a power supply interface unit (PSI) that mounts on
the power supply. Communication between the two is via a pair of multimode
fibers. This PSI/PSC system supports one 16-bit analog reference, four 16-bit
analog readbacks, fifteen digital commands and sixteen digital status bits in a
single fiber-isolated module. The system can send commands to the supplies and
read data from them synchronized to an external signal at up to a 10KHz rate.
The PSC time stamps and stores this data in a circular buffer so historical
data leading up to a fault event can be analyzed. The PSC contains a serial
port so that local testing of hardware can be accomplished with a laptop. This
paper concentrates on the software being provided to control the power supply.
It includes the EPICS driver; software to test hardware and power supplies via
the serial port and VME interface.
| [
{
"version": "v1",
"created": "Fri, 16 Nov 2001 20:33:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Peng",
"S.",
""
],
[
"Lambiase",
"R.",
""
],
[
"Oerter",
"B.",
""
],
[
"Smith",
"J.",
""
]
]
| new_dataset | 0.956598 |
cs/0111046 | AbdelAli Ed-Dbali | AbdelAli Ed-Dbali (1), Pierre Deransart (2), Mariza A. S. Bigonha (3),
Jose de Siqueira (3), Roberto da S. Bigonha (3) ((1) LIFO - University of
Orleans - France, (2) INRIA Rocquencourt - France, (3) DCC - UFMG - Brazil) | HyperPro An integrated documentation environment for CLP | In A. Kusalik (ed), Proceedings of the Eleventh International
Workshop on Logic Programming Environments (WLPE'01), December 1, 2001,
Paphos, Cyprus. cs.PL/0111042 | null | null | null | cs.PL cs.SE | null | The purpose of this paper is to present some functionalities of the HyperPro
System. HyperPro is a hypertext tool which allows to develop Constraint Logic
Programming (CLP) together with their documentation. The text editing part is
not new and is based on the free software Thot. A HyperPro program is a Thot
document written in a report style. The tool is designed for CLP but it can be
adapted to other programming paradigms as well. Thot offers navigation and
editing facilities and synchronized static document views. HyperPro has new
functionalities such as document exportations, dynamic views (projections),
indexes and version management. Projection is a mechanism for extracting and
exporting relevant pieces of code program or of document according to specific
criteria. Indexes are useful to find the references and occurrences of a
relation in a document, i.e., where its predicate definition is found and where
a relation is used in other programs or document versions and, to translate
hyper-texts links into paper references. It still lack importation facilities.
| [
{
"version": "v1",
"created": "Mon, 19 Nov 2001 16:50:49 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ed-Dbali",
"AbdelAli",
""
],
[
"Deransart",
"Pierre",
""
],
[
"Bigonha",
"Mariza A. S.",
""
],
[
"de Siqueira",
"Jose",
""
],
[
"Bigonha",
"Roberto da S.",
""
]
]
| new_dataset | 0.96336 |
cs/0111056 | Joerg Rothe | J\"org Rothe | Some Facets of Complexity Theory and Cryptography: A Five-Lectures
Tutorial | 57 pages, 17 figures, Lecture Notes for the 11th Jyvaskyla Summer
School | ACM Computing Surveys, volume 34, issue 4, pp. 504--549, December
2002 | null | null | cs.CC cs.CR | null | In this tutorial, selected topics of cryptology and of computational
complexity theory are presented. We give a brief overview of the history and
the foundations of classical cryptography, and then move on to modern
public-key cryptography. Particular attention is paid to cryptographic
protocols and the problem of constructing the key components of such protocols
such as one-way functions. A function is one-way if it is easy to compute, but
hard to invert. We discuss the notion of one-way functions both in a
cryptographic and in a complexity-theoretic setting. We also consider
interactive proof systems and present some interesting zero-knowledge
protocols. In a zero-knowledge protocol one party can convince the other party
of knowing some secret information without disclosing any bit of this
information. Motivated by these protocols, we survey some complexity-theoretic
results on interactive proof systems and related complexity classes.
| [
{
"version": "v1",
"created": "Wed, 21 Nov 2001 11:24:27 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Dec 2002 10:13:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rothe",
"Jörg",
""
]
]
| new_dataset | 0.990564 |
cs/0112009 | Vijay Ramachandran | Ming-Yang Kao and Vijay Ramachandran | DNA Self-Assembly For Constructing 3D Boxes | 15 pages, 3 figures. Extended abstract included in ISAAC 2001
proceedings | Algorithms and Computation, 12th International Symposium, ISAAC
2001 Proceedings. Springer LNCS 2223 (2001): 429-440 | null | null | cs.CC cs.CE | null | We propose a mathematical model of DNA self-assembly using 2D tiles to form
3D nanostructures. This is the first work to combine studies in self-assembly
and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our
model is a more precise superset of their Tile Assembly Model that facilitates
building scalable 3D molecules. Under our model, we present algorithms to build
a hollow cube, which is intuitively one of the simplest 3D structures to
construct. We also introduce five basic measures of complexity to analyze these
algorithms. Our model and algorithmic techniques are applicable to more complex
2D and 3D nanostructures.
| [
{
"version": "v1",
"created": "Sat, 8 Dec 2001 21:36:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kao",
"Ming-Yang",
""
],
[
"Ramachandran",
"Vijay",
""
]
]
| new_dataset | 0.999586 |
cs/0112024 | Thomas Schmidt | B. Feustel, T.C. Schmidt | Media Objects in Time - A Multimedia Streaming System | 9 pdf pages | Computer Networks 37,6 (2001), pp. 729 - 737 | null | null | cs.NI cs.MM | null | The widespread availability of networked multimedia potentials embedded in an
infrastructure of qualitative superior kind gives rise to new approaches in the
areas of teleteaching and internet presentation: The distribution of
professionally styled multimedia streams has fallen in the realm of
possibility. This paper presents a prototype - both model and runtime
environment - of a time directed media system treating any kind of
presentational contribution as reusable media object components. The plug-in
free runtime system is based on a database and allows for a flexible support of
static media types as well as for easy extensions by streaming media servers.
The prototypic implementation includes a preliminary Web Authoring platform.
| [
{
"version": "v1",
"created": "Fri, 28 Dec 2001 20:19:09 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Feustel",
"B.",
""
],
[
"Schmidt",
"T. C.",
""
]
]
| new_dataset | 0.989685 |
cs/0202001 | Carlo Zaniolo | Faiz Arni, KayLiang Ong, Shalom Tsur and Haixun Wang, Carlo Zaniolo | The Deductive Database System LDL++ | null | null | null | null | cs.DB cs.AI | null | This paper describes the LDL++ system and the research advances that have
enabled its design and development. We begin by discussing the new nonmonotonic
and nondeterministic constructs that extend the functionality of the LDL++
language, while preserving its model-theoretic and fixpoint semantics. Then, we
describe the execution model and the open architecture designed to support
these new constructs and to facilitate the integration with existing DBMSs and
applications. Finally, we describe the lessons learned by using LDL++ on
various tested applications, such as middleware and datamining.
| [
{
"version": "v1",
"created": "Fri, 1 Feb 2002 05:00:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Arni",
"Faiz",
""
],
[
"Ong",
"KayLiang",
""
],
[
"Tsur",
"Shalom",
""
],
[
"Wang",
"Haixun",
""
],
[
"Zaniolo",
"Carlo",
""
]
]
| new_dataset | 0.976449 |
cs/0202002 | Robert Colvin | Ian Hayes, Robert Colvin, David Hemer, Paul Strooper, Ray Nickson | A Refinement Calculus for Logic Programs | 36 pages, 3 figures. To be published in Theory and Practice of Logic
Programming (TPLP) | null | null | null | cs.SE cs.LO | null | Existing refinement calculi provide frameworks for the stepwise development
of imperative programs from specifications. This paper presents a refinement
calculus for deriving logic programs. The calculus contains a wide-spectrum
logic programming language, including executable constructs such as sequential
conjunction, disjunction, and existential quantification, as well as
specification constructs such as general predicates, assumptions and universal
quantification. A declarative semantics is defined for this wide-spectrum
language based on executions. Executions are partial functions from states to
states, where a state is represented as a set of bindings. The semantics is
used to define the meaning of programs and specifications, including parameters
and recursion. To complete the calculus, a notion of correctness-preserving
refinement over programs in the wide-spectrum language is defined and
refinement laws for developing programs are introduced. The refinement calculus
is illustrated using example derivations and prototype tool support is
discussed.
| [
{
"version": "v1",
"created": "Mon, 4 Feb 2002 01:20:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hayes",
"Ian",
""
],
[
"Colvin",
"Robert",
""
],
[
"Hemer",
"David",
""
],
[
"Strooper",
"Paul",
""
],
[
"Nickson",
"Ray",
""
]
]
| new_dataset | 0.965763 |
cs/0202003 | Paul Vitanyi | Paul Vitanyi (CWI and University of Amsterdam) | Simple Optimal Wait-free Multireader Registers | 11 pages LaTeX, 1 table, 2 pseudo-programs; previous version
published in Proc 16th International Symposium on DIStributed Computing (DISC
2002), Lecture Notes in Computer Science, Vol 2508, Springer-Verlag, Berlin,
118-132. New version eliminates error in the protocol (merges a split scan
operation that proved problematic) and defers the formal proof to a planned
future I/O automaton version | null | null | null | cs.DC | null | Multireader shared registers are basic objects used as communication medium
in asynchronous concurrent computation. We propose a surprisingly simple and
natural scheme to obtain several wait-free constructions of bounded 1-writer
multireader registers from atomic 1-writer 1-reader registers, that is easier
to prove correct than any previous construction. Our main construction is the
first symmetric pure timestamp one that is optimal with respect to the
worst-case local use of control bits; the other one is optimal with respect to
global use of control bits; both are optimal in time.
| [
{
"version": "v1",
"created": "Mon, 4 Feb 2002 17:29:15 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Oct 2002 15:18:47 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Dec 2005 14:32:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vitanyi",
"Paul",
"",
"CWI and University of Amsterdam"
]
]
| new_dataset | 0.980207 |
cs/0202018 | Daniel Lehmann | Daniel Lehmann | Nonmonotonic Logics and Semantics | 28 pages. Misprint corrected 15/04/02 | Journal of Logic and Computation, Vol. 11 No.2, pp.229-256 2001 | null | Leibniz Center for Research in Computer Science TR-98-6 | cs.AI cs.LO math.LO | null | Tarski gave a general semantics for deductive reasoning: a formula a may be
deduced from a set A of formulas iff a holds in all models in which each of the
elements of A holds. A more liberal semantics has been considered: a formula a
may be deduced from a set A of formulas iff a holds in all of the "preferred"
models in which all the elements of A hold. Shoham proposed that the notion of
"preferred" models be defined by a partial ordering on the models of the
underlying language. A more general semantics is described in this paper, based
on a set of natural properties of choice functions. This semantics is here
shown to be equivalent to a semantics based on comparing the relative
"importance" of sets of models, by what amounts to a qualitative probability
measure. The consequence operations defined by the equivalent semantics are
then characterized by a weakening of Tarski's properties in which the
monotonicity requirement is replaced by three weaker conditions. Classical
propositional connectives are characterized by natural introduction-elimination
rules in a nonmonotonic setting. Even in the nonmonotonic setting, one obtains
classical propositional logic, thus showing that monotonicity is not required
to justify classical propositional connectives.
| [
{
"version": "v1",
"created": "Fri, 15 Feb 2002 12:49:11 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Apr 2002 19:49:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lehmann",
"Daniel",
""
]
]
| new_dataset | 0.992008 |
cs/0202024 | Daniel Lehmann | Daniel Lehmann | A note on Darwiche and Pearl | A small unpublished remark on a paper by Darwiche and Pearl | null | null | null | cs.AI | null | It is shown that Darwiche and Pearl's postulates imply an interesting
property, not noticed by the authors.
| [
{
"version": "v1",
"created": "Mon, 18 Feb 2002 15:23:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lehmann",
"Daniel",
""
]
]
| new_dataset | 0.981023 |
cs/0202027 | Naren Ramakrishnan | Alex Verstak, Naren Ramakrishnan, Layne T. Watson, Jian He, Clifford
A. Shaffer, Kyung Kyoon Bae, Jing Jiang, William H. Tranter, Theodore S.
Rappaport | BSML: A Binding Schema Markup Language for Data Interchange in Problem
Solving Environments (PSEs) | null | null | null | null | cs.CE cs.SE | null | We describe a binding schema markup language (BSML) for describing data
interchange between scientific codes. Such a facility is an important
constituent of scientific problem solving environments (PSEs). BSML is designed
to integrate with a PSE or application composition system that views model
specification and execution as a problem of managing semistructured data. The
data interchange problem is addressed by three techniques for processing
semistructured data: validation, binding, and conversion. We present BSML and
describe its application to a PSE for wireless communications system design.
| [
{
"version": "v1",
"created": "Mon, 18 Feb 2002 16:01:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Verstak",
"Alex",
""
],
[
"Ramakrishnan",
"Naren",
""
],
[
"Watson",
"Layne T.",
""
],
[
"He",
"Jian",
""
],
[
"Shaffer",
"Clifford A.",
""
],
[
"Bae",
"Kyung Kyoon",
""
],
[
"Jiang",
"Jing",
""
],
[
"Tranter",
"William H.",
""
],
[
"Rappaport",
"Theodore S.",
""
]
]
| new_dataset | 0.999746 |
cs/0203009 | Judith Beumer | O. S. Matlin, E. Lusk, and W. McCune | SPINning Parallel Systems Software | 19 pages; 8 figures; 3 tables | null | null | ANL/MCS-P921-1201 | cs.LO cs.DC | null | We describe our experiences in using SPIN to verify parts of the Multi
Purpose Daemon (MPD) parallel process management system. MPD is a distributed
collection of processes connected by Unix network sockets. MPD is dynamic:
processes and connections among them are created and destroyed as MPD is
initialized, runs user processes, recovers from faults, and terminates. This
dynamic nature is easily expressible in the SPIN/PROMELA framework but poses
performance and scalability challenges. We present here the results of
expressing some of the parallel algorithms of MPD and executing both simulation
and verification runs with SPIN.
| [
{
"version": "v1",
"created": "Wed, 6 Mar 2002 18:15:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Matlin",
"O. S.",
""
],
[
"Lusk",
"E.",
""
],
[
"McCune",
"W.",
""
]
]
| new_dataset | 0.990851 |
cs/0203017 | Jack H. Lutz | Jack H. Lutz | The Dimensions of Individual Strings and Sequences | 31 pages | null | null | null | cs.CC | null | A constructive version of Hausdorff dimension is developed using constructive
supergales, which are betting strategies that generalize the constructive
supermartingales used in the theory of individual random sequences. This
constructive dimension is used to assign every individual (infinite, binary)
sequence S a dimension, which is a real number dim(S) in the interval [0,1].
Sequences that are random (in the sense of Martin-Lof) have dimension 1, while
sequences that are decidable, \Sigma^0_1, or \Pi^0_1 have dimension 0. It is
shown that for every \Delta^0_2-computable real number \alpha in [0,1] there is
a \Delta^0_2 sequence S such that \dim(S) = \alpha.
A discrete version of constructive dimension is also developed using
termgales, which are supergale-like functions that bet on the terminations of
(finite, binary) strings as well as on their successive bits. This discrete
dimension is used to assign each individual string w a dimension, which is a
nonnegative real number dim(w). The dimension of a sequence is shown to be the
limit infimum of the dimensions of its prefixes.
The Kolmogorov complexity of a string is proven to be the product of its
length and its dimension. This gives a new characterization of algorithmic
information and a new proof of Mayordomo's recent theorem stating that the
dimension of a sequence is the limit infimum of the average Kolmogorov
complexity of its first n bits.
Every sequence that is random relative to any computable sequence of
coin-toss biases that converge to a real number \beta in (0,1) is shown to have
dimension \H(\beta), the binary entropy of \beta.
| [
{
"version": "v1",
"created": "Tue, 12 Mar 2002 20:28:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lutz",
"Jack H.",
""
]
]
| new_dataset | 0.98644 |
cs/0203019 | Rajkumar Buyya | Rajkumar Buyya and Manzur Murshed | GridSim: A Toolkit for the Modeling and Simulation of Distributed
Resource Management and Scheduling for Grid Computing | null | Concurrency and Computation: Practice and Experience, Wiley, May
2002 | null | null | cs.DC | null | Clusters, grids, and peer-to-peer (P2P) networks have emerged as popular
paradigms for next generation parallel and distributed computing. The
management of resources and scheduling of applications in such large-scale
distributed systems is a complex undertaking. In order to prove the
effectiveness of resource brokers and associated scheduling algorithms, their
performance needs to be evaluated under different scenarios such as varying
number of resources and users with different requirements. In a grid
environment, it is hard and even impossible to perform scheduler performance
evaluation in a repeatable and controllable manner as resources and users are
distributed across multiple organizations with their own policies. To overcome
this limitation, we have developed a Java-based discrete-event grid simulation
toolkit called GridSim. The toolkit supports modeling and simulation of
heterogeneous grid resources (both time- and space-shared), users and
application models. It provides primitives for creation of application tasks,
mapping of tasks to resources, and their management. To demonstrate suitability
of the GridSim toolkit, we have simulated a Nimrod-G like grid resource broker
and evaluated the performance of deadline and budget constrained cost- and
time-minimization scheduling algorithms.
| [
{
"version": "v1",
"created": "Thu, 14 Mar 2002 03:44:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Buyya",
"Rajkumar",
""
],
[
"Murshed",
"Manzur",
""
]
]
| new_dataset | 0.996718 |
cs/0203023 | Magnus Boman | David Lyback and Magnus Boman | Agent trade servers in financial exchange systems | 11 pages, 1 figure | null | null | null | cs.CE | null | New services based on the best-effort paradigm could complement the current
deterministic services of an electronic financial exchange. Four crucial
aspects of such systems would benefit from a hybrid stance: proper use of
processing resources, bandwidth management, fault tolerance, and exception
handling. We argue that a more refined view on Quality-of-Service control for
exchange systems, in which the principal ambition of upholding a fair and
orderly marketplace is left uncompromised, would benefit all interested
parties.
| [
{
"version": "v1",
"created": "Tue, 19 Mar 2002 10:05:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lyback",
"David",
""
],
[
"Boman",
"Magnus",
""
]
]
| new_dataset | 0.988558 |
cs/0204002 | Erik Demaine | Erik D. Demaine, Martin L. Demaine, Helena A. Verrill | Coin-Moving Puzzles | 25 pages, 33 figures. To appear in the book More Games of No Chance
edited by Richard Nowakowski and published by MSRI | null | null | null | cs.DM cs.CG cs.GT | null | We introduce a new family of one-player games, involving the movement of
coins from one configuration to another. Moves are restricted so that a coin
can be placed only in a position that is adjacent to at least two other coins.
The goal of this paper is to specify exactly which of these games are solvable.
By introducing the notion of a constant number of extra coins, we give tight
theorems characterizing solvable puzzles on the square grid and
equilateral-triangle grid. These existence results are supplemented by
polynomial-time algorithms for finding a solution.
| [
{
"version": "v1",
"created": "Sun, 31 Mar 2002 01:02:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Verrill",
"Helena A.",
""
]
]
| new_dataset | 0.99706 |
cs/0204006 | Steven Bird | Steven Bird, Kazuaki Maeda, Xiaoyi Ma, Haejoong Lee, Beth Randall, and
Salim Zayat | TableTrans, MultiTrans, InterTrans and TreeTrans: Diverse Tools Built on
the Annotation Graph Toolkit | 7 pages, 7 figures | Proceedings of the Third International Conference on Language
Resources and Evaluation, Paris: European Language Resources Association,
2002 | null | null | cs.CL cs.SD | null | Four diverse tools built on the Annotation Graph Toolkit are described. Each
tool associates linguistic codes and structures with time-series data. All are
based on the same software library and tool architecture. TableTrans is for
observational coding, using a spreadsheet whose rows are aligned to a signal.
MultiTrans is for transcribing multi-party communicative interactions recorded
using multi-channel signals. InterTrans is for creating interlinear text
aligned to audio. TreeTrans is for creating and manipulating syntactic trees.
This work demonstrates that the development of diverse tools and re-use of
software components is greatly facilitated by a common high-level application
programming interface for representing the data and managing input/output,
together with a common architecture for managing the interaction of multiple
components.
| [
{
"version": "v1",
"created": "Wed, 3 Apr 2002 17:18:49 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bird",
"Steven",
""
],
[
"Maeda",
"Kazuaki",
""
],
[
"Ma",
"Xiaoyi",
""
],
[
"Lee",
"Haejoong",
""
],
[
"Randall",
"Beth",
""
],
[
"Zayat",
"Salim",
""
]
]
| new_dataset | 0.978569 |
cs/0204017 | Erik Demaine | Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer | Solitaire Clobber | 14 pages. v2 fixes small typo | null | null | HKUST-TCSC-2002-05 | cs.DM cs.CG cs.GT | null | Clobber is a new two-player board game. In this paper, we introduce the
one-player variant Solitaire Clobber where the goal is to remove as many stones
as possible from the board by alternating white and black moves. We show that a
checkerboard configuration on a single row (or single column) can be reduced to
about n/4 stones. For boards with at least two rows and two columns, we show
that a checkerboard configuration can be reduced to a single stone if and only
if the number of stones is not a multiple of three, and otherwise it can be
reduced to two stones. We also show that in general it is NP-complete to decide
whether an arbitrary Clobber configuration can be reduced to a single stone.
| [
{
"version": "v1",
"created": "Tue, 9 Apr 2002 15:57:59 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jul 2002 21:03:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Fleischer",
"Rudolf",
""
]
]
| new_dataset | 0.99983 |
cs/0204025 | Steven Bird | Steven Bird | Phonology | 27 pages | In Ruslan Mitkov (ed) (2002). Oxford Handbook of Computational
Linguistics | null | null | cs.CL | null | Phonology is the systematic study of the sounds used in language, their
internal structure, and their composition into syllables, words and phrases.
Computational phonology is the application of formal and computational
techniques to the representation and processing of phonological information.
This chapter will present the fundamentals of descriptive phonology along with
a brief overview of computational phonology.
| [
{
"version": "v1",
"created": "Thu, 11 Apr 2002 11:22:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bird",
"Steven",
""
]
]
| new_dataset | 0.988699 |
cs/0204056 | Magnus Boman | Magnus Boman, Markus Bylund, Fredrik Espinoza, Mats Danielson, David
Lyback | Trading Agents for Roaming Users | 5 pages, 1 figure | null | null | null | cs.CE | null | Some roaming users need services to manipulate autonomous processes. Trading
agents running on agent trade servers are used as a case in point. We present a
solution that provides the agent owners with means to upkeeping their desktop
environment, and maintaining their agent trade server processes, via a
briefcase service.
| [
{
"version": "v1",
"created": "Mon, 29 Apr 2002 12:20:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Boman",
"Magnus",
""
],
[
"Bylund",
"Markus",
""
],
[
"Espinoza",
"Fredrik",
""
],
[
"Danielson",
"Mats",
""
],
[
"Lyback",
"David",
""
]
]
| new_dataset | 0.99492 |
cs/0205016 | Han Jing | Jing Han, Jiming Liu and Qingsheng Cai | From Alife Agents to a Kingdom of N Queens | 13 pages, 9 figures, in 1999 international conference of Intelligent
Agent Technology. Nominated for the best paper award | in Jiming Liu and Ning Zhong (Eds.), Intelligent Agent Technology:
Systems, Methodologies, and Tools, page 110-120, The World Scientific
Publishing Co. Pte, Ltd., Nov. 1999 | null | null | cs.AI cs.DS cs.MA | null | This paper presents a new approach to solving N-queen problems, which
involves a model of distributed autonomous agents with artificial life (ALife)
and a method of representing N-queen constraints in an agent environment. The
distributed agents locally interact with their living environment, i.e., a
chessboard, and execute their reactive behaviors by applying their behavioral
rules for randomized motion, least-conflict position searching, and cooperating
with other agents etc. The agent-based N-queen problem solving system evolves
through selection and contest according to the rule of Survival of the Fittest,
in which some agents will die or be eaten if their moving strategies are less
efficient than others. The experimental results have shown that this system is
capable of solving large-scale N-queen problems. This paper also provides a
model of ALife agents for solving general CSPs.
| [
{
"version": "v1",
"created": "Mon, 13 May 2002 10:49:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Han",
"Jing",
""
],
[
"Liu",
"Jiming",
""
],
[
"Cai",
"Qingsheng",
""
]
]
| new_dataset | 0.991642 |
cs/0205017 | Georgios Petasis | Georgios Petasis, Vangelis Karkaletsis, Georgios Paliouras, Ion
Androutsopoulos, Constantine D. Spyropoulos | Ellogon: A New Text Engineering Platform | 7 pages, 9 figures. Will be presented to the Third International
Conference on Language Resources and Evaluation - LREC 2002 | null | null | null | cs.CL | null | This paper presents Ellogon, a multi-lingual, cross-platform, general-purpose
text engineering environment. Ellogon was designed in order to aid both
researchers in natural language processing, as well as companies that produce
language engineering systems for the end-user. Ellogon provides a powerful
TIPSTER-based infrastructure for managing, storing and exchanging textual data,
embedding and managing text processing components as well as visualising
textual data and their associated linguistic information. Among its key
features are full Unicode support, an extensive multi-lingual graphical user
interface, its modular architecture and the reduced hardware requirements.
| [
{
"version": "v1",
"created": "Mon, 13 May 2002 11:18:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Petasis",
"Georgios",
""
],
[
"Karkaletsis",
"Vangelis",
""
],
[
"Paliouras",
"Georgios",
""
],
[
"Androutsopoulos",
"Ion",
""
],
[
"Spyropoulos",
"Constantine D.",
""
]
]
| new_dataset | 0.998567 |
cs/0205019 | Wen Chen | W. Chen | Distance function wavelets - Part I: Helmholtz and convection-diffusion
transforms and series | Welcome any comments to [email protected] | null | null | null | cs.CE cs.NA | null | This report aims to present my research updates on distance function wavelets
(DFW) based on the fundamental solutions and the general solutions of the
Helmholtz, modified Helmholtz, and convection-diffusion equations, which
include the isotropic Helmholtz-Fourier (HF) transform and series, the
Helmholtz-Laplace (HL) transform, and the anisotropic convection-diffusion
wavelets and ridgelets. The latter is set to handle discontinuous and track
data problems. The edge effect of the HF series is addressed. Alternative
existence conditions for the DFW transforms are proposed and discussed. To
simplify and streamline the expression of the HF and HL transforms, a new
dimension-dependent function notation is introduced. The HF series is also used
to evaluate the analytical solutions of linear diffusion problems of arbitrary
dimensionality and geometry. The weakness of this report is lacking of rigorous
mathematical analysis due to the author's limited mathematical knowledge.
| [
{
"version": "v1",
"created": "Tue, 14 May 2002 13:43:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.997901 |
cs/0205027 | Chung-chieh Shan | Chung-chieh Shan (Harvard University) | A variable-free dynamic semantics | 6 pages | Proceedings of the 13th Amsterdam Colloquium, ed. Robert van Rooy
and Martin Stokhof, 204-209 (2001) | null | null | cs.CL | null | I propose a variable-free treatment of dynamic semantics. By "dynamic
semantics" I mean analyses of donkey sentences ("Every farmer who owns a donkey
beats it") and other binding and anaphora phenomena in natural language where
meanings of constituents are updates to information states, for instance as
proposed by Groenendijk and Stokhof. By "variable-free" I mean denotational
semantics in which functional combinators replace variable indices and
assignment functions, for instance as advocated by Jacobson.
The new theory presented here achieves a compositional treatment of dynamic
anaphora that does not involve assignment functions, and separates the
combinatorics of variable-free semantics from the particular linguistic
phenomena it treats. Integrating variable-free semantics and dynamic semantics
gives rise to interactions that make new empirical predictions, for example
"donkey weak crossover" effects.
| [
{
"version": "v1",
"created": "Fri, 17 May 2002 09:33:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Shan",
"Chung-chieh",
"",
"Harvard University"
]
]
| new_dataset | 0.990179 |
cs/0205028 | Steven Bird | Edward Loper and Steven Bird | NLTK: The Natural Language Toolkit | 8 pages, 1 figure, Proceedings of the ACL Workshop on Effective Tools
and Methodologies for Teaching Natural Language Processing and Computational
Linguistics, Philadelphia, July 2002, Association for Computational
Linguistics | null | null | null | cs.CL | null | NLTK, the Natural Language Toolkit, is a suite of open source program
modules, tutorials and problem sets, providing ready-to-use computational
linguistics courseware. NLTK covers symbolic and statistical natural language
processing, and is interfaced to annotated corpora. Students augment and
replace existing components, learn structured programming by example, and
manipulate sophisticated models from the outset.
| [
{
"version": "v1",
"created": "Fri, 17 May 2002 12:51:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Loper",
"Edward",
""
],
[
"Bird",
"Steven",
""
]
]
| new_dataset | 0.996486 |
cs/0205063 | Wen Chen | W. Chen | Distance function wavelets - Part II: Extended results and conjectures | Welcome any comments to [email protected] | null | null | null | cs.CE cs.CG | null | Report II is concerned with the extended results of distance function
wavelets (DFW). The fractional DFW transforms are first addressed relating to
the fractal geometry and fractional derivative, and then, the discrete
Helmholtz-Fourier transform is briefly presented. The Green second identity may
be an alternative devise in developing the theoretical framework of the DFW
transform and series. The kernel solutions of the Winkler plate equation and
the Burger's equation are used to create the DFW transforms and series. Most
interestingly, it is found that the translation invariant monomial solutions of
the high-order Laplace equations can be used to make very simple harmonic
polynomial DFW series. In most cases of this study, solid mathematical analysis
is missing and results are obtained intuitively in the conjecture status.
| [
{
"version": "v1",
"created": "Fri, 24 May 2002 12:07:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.996813 |
cs/0206016 | Wen Chen | W. Chen | Distance function wavelets - Part III: "Exotic" transforms and series | Welcome comments to [email protected] | null | null | null | cs.CE cs.CG | null | Part III of the reports consists of various unconventional distance function
wavelets (DFW). The dimension and the order of partial differential equation
(PDE) are first used as a substitute of the scale parameter in the DFW
transforms and series, especially with the space and time-space potential
problems. It is noted that the recursive multiple reciprocity formulation is
the DFW series. The Green second identity is used to avoid the singularity of
the zero-order fundamental solution in creating the DFW series. The fundamental
solutions of various composite PDEs are found very flexible and efficient to
handle a borad range of problems. We also discuss the underlying connections
between the crucial concepts of dimension, scale and the order of PDE through
the analysis of dissipative acoustic wave propagation. The shape parameter of
the potential problems is also employed as the "scale parameter" to create the
non-orthogonal DFW. This paper also briefly discusses and conjectures the DFW
correspondences of a variety of coordinate variable transforms and series.
Practically important, the anisotropic and inhomogeneous DFW's are developed by
using the geodesic distance variable. The DFW and the related basis functions
are also used in making the kernel distance sigmoidal functions, which are
potentially useful in the artificial neural network and machine learning. As or
even worse than the preceding two reports, this study scarifies mathematical
rigor and in turn unfetter imagination. Most results are intuitively obtained
without rigorous analysis. Follow-up research is still under way. The paper is
intended to inspire more research into this promising area.
| [
{
"version": "v1",
"created": "Mon, 10 Jun 2002 09:01:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.993903 |
cs/0206024 | Denis Popel | Denis V. Popel and Anita Dani | Sierpinski Gaskets for Logic Functions Representation | 7 pages, 8 figures, 3 tables, experiments | ISMVL 2002 Proceedinds | null | null | cs.LO cs.DM | null | This paper introduces a new approach to represent logic functions in the form
of Sierpinski Gaskets. The structure of the gasket allows to manipulate with
the corresponding logic expression using recursive essence of fractals. Thus,
the Sierpinski gasket's pattern has myriad useful properties which can enhance
practical features of other graphic representations like decision diagrams. We
have covered possible applications of Sierpinski gaskets in logic design and
justified our assumptions in logic function minimization (both Boolean and
multiple-valued cases). The experimental results on benchmarks with advances in
the novel structure are considered as well.
| [
{
"version": "v1",
"created": "Sat, 15 Jun 2002 15:44:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Popel",
"Denis V.",
""
],
[
"Dani",
"Anita",
""
]
]
| new_dataset | 0.99581 |
cs/0206035 | Atsushi Fujii | Shigeto Higuchi, Masatoshi Fukui, Atsushi Fujii and Tetsuya Ishikawa | PRIME: A System for Multi-lingual Patent Retrieval | null | Proceedings of MT Summit VIII, pp.163-167, Sep. 2001 | null | null | cs.CL | null | Given the growing number of patents filed in multiple countries, users are
interested in retrieving patents across languages. We propose a multi-lingual
patent retrieval system, which translates a user query into the target
language, searches a multilingual database for patents relevant to the query,
and improves the browsing efficiency by way of machine translation and
clustering. Our system also extracts new translations from patent families
consisting of comparable patents, to enhance the translation dictionary.
| [
{
"version": "v1",
"created": "Mon, 24 Jun 2002 08:00:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Higuchi",
"Shigeto",
""
],
[
"Fukui",
"Masatoshi",
""
],
[
"Fujii",
"Atsushi",
""
],
[
"Ishikawa",
"Tetsuya",
""
]
]
| new_dataset | 0.996839 |
cs/0207006 | Wen Chen | W. Chen | Orthonormal RBF wavelet and ridgelet-like series and transforms for
high-dimensional problems | null | Int. J. Nonlinear Sci. & Numer. Simulation, 2(2), 155-160, 2001 | null | null | cs.SC | null | This paper developed a systematic strategy establishing RBF on the wavelet
analysis, which includes continuous and discrete RBF orthonormal wavelet
transforms respectively in terms of singular fundamental solutions and
nonsingular general solutions of differential operators. In particular, the
harmonic Bessel RBF transforms were presented for high-dimensional data
processing. It was also found that the kernel functions of convection-diffusion
operator are feasible to construct some stable ridgelet-like RBF transforms. We
presented time-space RBF transforms based on non-singular solution and
fundamental solution of time-dependent differential operators. The present
methodology was further extended to analysis of some known RBFs such as the MQ,
Gaussian and pre-wavelet kernel RBFs.
| [
{
"version": "v1",
"created": "Wed, 3 Jul 2002 15:34:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.959987 |
cs/0207009 | Vince Grolmusz | Vince Grolmusz | Computing Elementary Symmetric Polynomials with a Sublinear Number of
Multiplications | 10 pages | null | null | null | cs.CC cs.DM cs.DS | null | Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the
bounded-depth arithmetic circuit model of computation. In this work we prove
that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much
fewer multiplications than over any field, if the coefficients of monomials
$x_{i_1}x_{i_2}... x_{i_k}$ are allowed to be 1 either mod $p_1$ or mod $p_2$
but not necessarily both. More exactly, we prove that for any constant $k$ such
a representation of $S_n^k$ can be computed modulo $p_1p_2$ using only
$\exp(O(\sqrt{\log n}\log\log n))$ multiplications on the most restricted
depth-3 arithmetic circuits, for $\min({p_1,p_2})>k!$. Moreover, the number of
multiplications remain sublinear while $k=O(\log\log n).$ In contrast, the
well-known Graham-Pollack bound yields an $n-1$ lower bound for the number of
multiplications even for the exact computation (not the representation) of
$S_n^2$. Our results generalize for other non-prime power composite moduli as
well. The proof uses the famous BBR-polynomial of Barrington, Beigel and
Rudich.
| [
{
"version": "v1",
"created": "Wed, 3 Jul 2002 14:32:21 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Grolmusz",
"Vince",
""
]
]
| new_dataset | 0.958385 |
cs/0207046 | Alexandre Tessier | Samir Ouis, Narendra Jussien, Patrice Boizumault | COINS: a constraint-based interactive solving system | 15 pages; Alexandre Tessier, editor; WLPE 2002,
http://xxx.lanl.gov/abs/cs.SE/0207052 | null | null | null | cs.SE | null | This paper describes the COINS (COnstraint-based INteractive Solving) system:
a conflict-based constraint solver. It helps understanding inconsistencies,
simulates constraint additions and/or retractions (without any propagation),
determines if a given constraint belongs to a conflict and provides diagnosis
tools (e.g. why variable v cannot take value val). COINS also uses
user-friendly representation of conflicts and explanations.
| [
{
"version": "v1",
"created": "Thu, 11 Jul 2002 16:25:20 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jul 2002 00:35:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ouis",
"Samir",
""
],
[
"Jussien",
"Narendra",
""
],
[
"Boizumault",
"Patrice",
""
]
]
| new_dataset | 0.963322 |
cs/0207048 | Alexandre Tessier | Francois Fages | CLPGUI: a generic graphical user interface for constraint logic
programming over finite domains | 16 pages; Alexandre Tessier, editor; WLPE 2002,
http://xxx.lanl.gov/abs/cs.SE/0207052 | null | null | null | cs.SE | null | CLPGUI is a graphical user interface for visualizing and interacting with
constraint logic programs over finite domains. In CLPGUI, the user can control
the execution of a CLP program through several views of constraints, of finite
domain variables and of the search tree. CLPGUI is intended to be used both for
teaching purposes, and for debugging and improving complex programs of
realworld scale. It is based on a client-server architecture for connecting the
CLP process to a Java-based GUI process. Communication by message passing
provides an open architecture which facilitates the reuse of graphical
components and the porting to different constraint programming systems.
Arbitrary constraints and goals can be posted incrementally from the GUI. We
propose several dynamic 2D and 3D visualizations of the search tree and of the
evolution of finite domain variables. We argue that the 3D representation of
search trees proposed in this paper provides the most appropriate visualization
of large search trees. We describe the current implementation of the
annotations and of the interactive execution model in GNU-Prolog, and report
some evaluation results.
| [
{
"version": "v1",
"created": "Thu, 11 Jul 2002 18:05:59 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jul 2002 00:40:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Fages",
"Francois",
""
]
]
| new_dataset | 0.999661 |
cs/0207062 | Wen Chen | W. Chen | Some addenda on distance function wavelets | null | null | null | null | cs.NA cs.CE | null | This report will add some supplements to the recently finished report series
on the distance function wavelets (DFW). First, we define the general distance
in terms of the Riesz potential, and then, the distance function Abel wavelets
are derived via the fractional integral and Laplacian. Second, the DFW Weyl
transform is found to be a shifted Laplace potential DFW. The DFW Radon
transform is also presented. Third, we present a conjecture on truncation error
formula of the multiple reciprocity Laplace DFW series and discuss its error
distributions in terms of node density distributions. Forth, we point out that
the Hermite distance function interpolation can be used to replace overlapping
in the domain decomposition in order to produce sparse matrix. Fifth, the shape
parameter is explained as a virtual extra axis contribution in terms of the
MQ-type Possion kernel. The report is concluded with some remarks on a range of
other issues.
| [
{
"version": "v1",
"created": "Mon, 15 Jul 2002 19:58:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"W.",
""
]
]
| new_dataset | 0.985913 |
cs/0207077 | Rajkumar Buyya | Jahanzeb Sherwani, Nosheen Ali, Nausheen Lotia, Zahra Hayat, and
Rajkumar Buyya | Libra: An Economy driven Job Scheduling System for Clusters | 13 pages | null | null | Technical Report, July 2002, Dept. of Computer Science and Software
Engineering, The University of Melbourne | cs.DC cs.DS | null | Clusters of computers have emerged as mainstream parallel and distributed
platforms for high-performance, high-throughput and high-availability
computing. To enable effective resource management on clusters, numerous
cluster managements systems and schedulers have been designed. However, their
focus has essentially been on maximizing CPU performance, but not on improving
the value of utility delivered to the user and quality of services. This paper
presents a new computational economy driven scheduling system called Libra,
which has been designed to support allocation of resources based on the users?
quality of service (QoS) requirements. It is intended to work as an add-on to
the existing queuing and resource management system. The first version has been
implemented as a plugin scheduler to the PBS (Portable Batch System) system.
The scheduler offers market-based economy driven service for managing batch
jobs on clusters by scheduling CPU time according to user utility as determined
by their budget and deadline rather than system performance considerations. The
Libra scheduler ensures that both these constraints are met within an O(n)
run-time. The Libra scheduler has been simulated using the GridSim toolkit to
carry out a detailed performance analysis. Results show that the deadline and
budget based proportional resource allocation strategy improves the utility of
the system and user satisfaction as compared to system-centric scheduling
strategies.
| [
{
"version": "v1",
"created": "Mon, 22 Jul 2002 11:35:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Sherwani",
"Jahanzeb",
""
],
[
"Ali",
"Nosheen",
""
],
[
"Lotia",
"Nausheen",
""
],
[
"Hayat",
"Zahra",
""
],
[
"Buyya",
"Rajkumar",
""
]
]
| new_dataset | 0.998394 |
cs/0207079 | Ilia Ponomarenko | D. Grigoriev and I. Ponomarenko | On non-abelian homomorphic public-key cryptosystems | 15 pages, LaTeX | null | null | null | cs.CR | null | An important problem of modern cryptography concerns secret public-key
computations in algebraic structures. We construct homomorphic cryptosystems
being (secret) epimorphisms f:G --> H, where G, H are (publically known) groups
and H is finite. A letter of a message to be encrypted is an element h element
of H, while its encryption g element of G is such that f(g)=h. A homomorphic
cryptosystem allows one to perform computations (operating in a group G) with
encrypted information (without knowing the original message over H).
In this paper certain homomorphic cryptosystems are constructed for the first
time for non-abelian groups H (earlier, homomorphic cryptosystems were known
only in the Abelian case). In fact, we present such a system for any solvable
(fixed) group H.
| [
{
"version": "v1",
"created": "Tue, 23 Jul 2002 07:28:59 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Sep 2002 11:51:17 GMT"
},
{
"version": "v3",
"created": "Wed, 4 Sep 2002 10:12:29 GMT"
},
{
"version": "v4",
"created": "Thu, 14 Nov 2002 10:04:31 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Grigoriev",
"D.",
""
],
[
"Ponomarenko",
"I.",
""
]
]
| new_dataset | 0.992342 |
cs/0207091 | Dina Q. Goldin | Fran\c{c}ois Bry (University of Munich, Germany) | An Almost Classical Logic for Logic Programming and Nonmonotonic
Reasoning | 16 pages. Originally published in proc. PCL 2002, a FLoC workshop;
eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai
(http://floc02.diku.dk/PCL/) | null | null | null | cs.LO | null | The model theory of a first-order logic called N^4 is introduced. N^4 does
not eliminate double negations, as classical logic does, but instead reduces
fourfold negations. N^4 is very close to classical logic: N^4 has two truth
values; implications in N^4 are material, like in classical logic; and negation
distributes over compound formulas in N^4 as it does in classical logic.
Results suggest that the semantics of normal logic programs is conveniently
formalized in N^4: Classical logic Herbrand interpretations generalize
straightforwardly to N^4; the classical minimal Herbrand model of a positive
logic program coincides with its unique minimal N^4 Herbrand model; the stable
models of a normal logic program and its so-called complete minimal N^4
Herbrand models coincide.
| [
{
"version": "v1",
"created": "Thu, 25 Jul 2002 17:40:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bry",
"François",
"",
"University of Munich, Germany"
]
]
| new_dataset | 0.996621 |
cs/0208010 | Jim Gray | Tom Barclay, Jim Gray, Eric Strand, Steve Ekblad, Jeffrey Richter | TerraService.NET: An Introduction to Web Services | original at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-53 | null | null | MSR-TR-2002-53 | cs.DL cs.DB | null | This article explores the design and construction of a geo-spatial Internet
web service application from the host web site perspective and from the
perspective of an application using the web service. The TerraService.NET web
service was added to the popular TerraServer database and web site with no
major structural changes to the database. The article discusses web service
design, implementation, and deployment concepts and design guidelines. Web
services enable applications that aggregate and interact with information and
resources from Internet-scale distributed servers. The article presents the
design of two USDA applications that interoperate with database and web service
resources in Fort Collins Colorado and the TerraService web service located in
Tukwila Washington.
| [
{
"version": "v1",
"created": "Wed, 7 Aug 2002 22:18:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Barclay",
"Tom",
""
],
[
"Gray",
"Jim",
""
],
[
"Strand",
"Eric",
""
],
[
"Ekblad",
"Steve",
""
],
[
"Richter",
"Jeffrey",
""
]
]
| new_dataset | 0.99917 |
cs/0208011 | Jim Gray | Jim Gray, Wyman Chong, Tom Barclay, Alex Szalay, Jan vandenBerg | TeraScale SneakerNet: Using Inexpensive Disks for Backup, Archiving, and
Data Exchange | original at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-54 | null | null | MSR-TR-2002-54 | cs.NI cs.DC | null | Large datasets are most economically trnsmitted via parcel post given the
current economics of wide-area networking. This article describes how the Sloan
Digital Sky Survey ships terabyte scale datasets both within the US and to
Europe and Asia. We 3GT storage bricks (Ghz processor, GB ram, GbpsEthernet, TB
disk) for about 2k$ each. These bricks act as database servers on the LAN. They
are loaded at one site and read at the second site. The paper describes the
bricks, their economics, and some software issues that they raise.
| [
{
"version": "v1",
"created": "Wed, 7 Aug 2002 22:32:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gray",
"Jim",
""
],
[
"Chong",
"Wyman",
""
],
[
"Barclay",
"Tom",
""
],
[
"Szalay",
"Alex",
""
],
[
"vandenBerg",
"Jan",
""
]
]
| new_dataset | 0.996142 |
cs/0208020 | Masaki Murata | Masaki Murata and Hitoshi Isahara | Using the DIFF Command for Natural Language Processing | 10 pages. Computation and Language. This paper is the rough English
translation of our Japanese papar | null | null | null | cs.CL | null | Diff is a software program that detects differences between two data sets and
is useful in natural language processing. This paper shows several examples of
the application of diff. They include the detection of differences between two
different datasets, extraction of rewriting rules, merging of two different
datasets, and the optimal matching of two different data sets. Since diff comes
with any standard UNIX system, it is readily available and very easy to use.
Our studies showed that diff is a practical tool for research into natural
language processing.
| [
{
"version": "v1",
"created": "Tue, 13 Aug 2002 03:39:20 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Murata",
"Masaki",
""
],
[
"Isahara",
"Hitoshi",
""
]
]
| new_dataset | 0.983133 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.