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/0606046 | Andreas U. Schmidt | Jan Piechalski and Andreas U. Schmidt | Authorised Translations of Electronic Documents | In: Peer-reviewed Proceedings of the Information Security South
Africa (ISSA) 2006 From Insight to Foresight Conference, 5 to 7 July 2006,
Sandton, South Africa | null | null | null | cs.OH | null | A concept is proposed to extend authorised translations of documents to
electronically signed, digital documents. Central element of the solution is an
electronic seal, embodied as an XML data structure, which attests to the
correctness of the translation and the authorisation of the translator. The
seal contains a digital signature binding together original and translated
document, thus enabling forensic inspection and therefore legal security in the
appropriation of the translation. Organisational aspects of possible
implementation variants of electronic authorised translations are discussed and
a realisation as a stand-alone web-service is presented.
| [
{
"version": "v1",
"created": "Sat, 10 Jun 2006 10:37:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Piechalski",
"Jan",
""
],
[
"Schmidt",
"Andreas U.",
""
]
]
| new_dataset | 0.999497 |
cs/0606089 | William Yurcik | Charis Ermopoulos and William Yurcik | NVision-PA: A Tool for Visual Analysis of Command Behavior Based on
Process Accounting Logs (with a Case Study in HPC Cluster Security) | 25 pages, 13 Figures | null | null | null | cs.CR cs.DC | null | In the UNIX/Linux environment the kernel can log every command process
created by every user with process accounting. Thus process accounting logs
have many potential uses, particularly the monitoring and forensic
investigation of security events. Previous work successfully leveraged the use
of process accounting logs to identify a difficult to detect and damaging
intrusion against high performance computing (HPC) clusters, masquerade
attacks, where intruders masquerade as legitimate users with purloined
authentication credentials. While masqueraders on HPC clusters were found to be
identifiable with a high accuracy (greater than 90%), this accuracy is still
not high enough for HPC production environments where greater than 99% accuracy
is needed.
This paper incrementally advances the goal of more accurately identifying
masqueraders on HPC clusters by seeking to identify features within command
sets that distinguish masqueraders. To accomplish this goal, we created
NVision-PA, a software tool that produces text and graphic statistical
summaries describing input processing accounting logs. We report NVision-PA
results describing two different process accounting logs; one from Internet
usage and one from HPC cluster usage. These results identify the distinguishing
features of Internet users (as proxies for masqueraders) posing as clusters
users. This research is both a promising next step toward creating a real-time
masquerade detection sensor for production HPC clusters as well as providing
another tool for system administrators to use for statistically monitoring and
managing legitimate workloads (as indicated by command usage) in HPC
environments.
| [
{
"version": "v1",
"created": "Tue, 20 Jun 2006 16:53:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ermopoulos",
"Charis",
""
],
[
"Yurcik",
"William",
""
]
]
| new_dataset | 0.970643 |
cs/0606097 | Andrew Krizhanovsky A | A. Krizhanovsky | Synonym search in Wikipedia: Synarcher | 4 pages, 2 figures, Synarcher program is available at
http://synarcher.sourceforge.net | null | null | null | cs.IR cs.DM | null | The program Synarcher for synonym (and related terms) search in the text
corpus of special structure (Wikipedia) was developed. The results of the
search are presented in the form of graph. It is possible to explore the graph
and search for graph elements interactively. Adapted HITS algorithm for synonym
search, program architecture, and program work evaluation with test examples
are presented in the paper. The proposed algorithm can be applied to a query
expansion by synonyms (in a search engine) and a synonym dictionary forming.
| [
{
"version": "v1",
"created": "Thu, 22 Jun 2006 14:17:26 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Jun 2006 05:10:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Krizhanovsky",
"A.",
""
]
]
| new_dataset | 0.991405 |
cs/0607051 | Catherine Recanati | Catherine Recanati (LIPN) | Raisonner avec des diagrammes : perspectives cognitives et
computationnelles | paru initialement comme Rapport LIPN en 2004 | Intellectica 40 (2005) 9-42 | null | null | cs.CL | null | Diagrammatic, analogical or iconic representations are often contrasted with
linguistic or logical representations, in which the shape of the symbols is
arbitrary. The aim of this paper is to make a case for the usefulness of
diagrams in inferential knowledge representation systems. Although commonly
used, diagrams have for a long time suffered from the reputation of being only
a heuristic tool or a mere support for intuition. The first part of this paper
is an historical background paying tribute to the logicians, psychologists and
computer scientists who put an end to this formal prejudice against diagrams.
The second part is a discussion of their characteristics as opposed to those of
linguistic forms. The last part is aimed at reviving the interest for
heterogeneous representation systems including both linguistic and diagrammatic
representations.
| [
{
"version": "v1",
"created": "Tue, 11 Jul 2006 19:13:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Recanati",
"Catherine",
"",
"LIPN"
]
]
| new_dataset | 0.991345 |
cs/0607055 | Akimichi Takemura | Hisayuki Hara and Akimichi Takemura | Boundary cliques, clique trees and perfect sequences of maximal cliques
of a chordal graph | null | null | null | null | cs.DM | null | We characterize clique trees of a chordal graph in their relation to
simplicial vertices and perfect sequences of maximal cliques. We investigate
boundary cliques defined by Shibata and clarify their relation to endpoints of
clique trees. Next we define a symmetric binary relation between the set of
clique trees and the set of perfect sequences of maximal cliques. We describe
the relation as a bipartite graph and prove that the bipartite graph is always
connected. Lastly we consider to characterize chordal graphs from the aspect of
non-uniqueness of clique trees.
| [
{
"version": "v1",
"created": "Tue, 11 Jul 2006 23:14:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hara",
"Hisayuki",
""
],
[
"Takemura",
"Akimichi",
""
]
]
| new_dataset | 0.99922 |
cs/0607141 | Riccardo Pucella | Karl Crary and Robert Harper | Logic Column 16: Higher-Order Abstract Syntax: Setting the Record
Straight | 4 pages | null | null | null | cs.LO | null | This article responds to a critique of higher-order abstract syntax appearing
in Logic Column 14, ``Nominal Logic and Abstract Syntax'', cs.LO/0511025.
| [
{
"version": "v1",
"created": "Mon, 31 Jul 2006 14:15:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Crary",
"Karl",
""
],
[
"Harper",
"Robert",
""
]
]
| new_dataset | 0.991656 |
cs/0608016 | Sebastian Brand | Gregory J. Duck, Peter J. Stuckey, Sebastian Brand | ACD Term Rewriting | 21 pages; 22nd International Conference on Logic Programming
(ICLP'06) | null | null | null | cs.PL cs.SC | null | We introduce Associative Commutative Distributive Term Rewriting (ACDTR), a
rewriting language for rewriting logical formulae. ACDTR extends AC term
rewriting by adding distribution of conjunction over other operators.
Conjunction is vital for expressive term rewriting systems since it allows us
to require that multiple conditions hold for a term rewriting rule to be used.
ACDTR uses the notion of a "conjunctive context", which is the conjunction of
constraints that must hold in the context of a term, to enable the programmer
to write very expressive and targeted rewriting rules. ACDTR can be seen as a
general logic programming language that extends Constraint Handling Rules and
AC term rewriting. In this paper we define the semantics of ACDTR and describe
our prototype implementation.
| [
{
"version": "v1",
"created": "Thu, 3 Aug 2006 02:55:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Duck",
"Gregory J.",
""
],
[
"Stuckey",
"Peter J.",
""
],
[
"Brand",
"Sebastian",
""
]
]
| new_dataset | 0.994468 |
cs/0608026 | Dinesh Kumar | Dinesh Kumar (INRIA Sophia Antipolis), Dhiman Barman, Eitan Altman
(INRIA Sophia Antipolis), Jean-Marc Kelif (FT R&D) | New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS
Downlink | null | null | null | null | cs.NI | null | In 3G UMTS, two main transport channels have been provided for downlink data
transmission: a common FACH channel and a dedicated DCH channel. The
performance of TCP in UMTS depends much on the channel switching policy used.
In this paper, we propose and analyze three new basic threshold-based channel
switching policies for UMTS that we name as QS (Queue Size), FS (Flow Size) and
QSFS (QS & FS combined) policy. These policies significantly improve over a
modified threshold policy in [1] by about 17% in response time metrics. We
further propose and evaluate a new improved switching policy that we call
FS-DCH (at-least flow-size threshold on DCH) policy. This policy is biased
towards short TCP flows of few packets and is thus a cross-layer policy that
improves the performance of TCP by giving priority to the initial few packets
of a flow on the fast DCH channel. Extensive simulation results confirm this
improvement for the case when number of TCP connections is low.
| [
{
"version": "v1",
"created": "Fri, 4 Aug 2006 11:53:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kumar",
"Dinesh",
"",
"INRIA Sophia Antipolis"
],
[
"Barman",
"Dhiman",
"",
"INRIA Sophia Antipolis"
],
[
"Altman",
"Eitan",
"",
"INRIA Sophia Antipolis"
],
[
"Kelif",
"Jean-Marc",
"",
"FT R&D"
]
]
| new_dataset | 0.997199 |
cs/0608027 | Edwin Henneken | E. Henneken, M.J. Kurtz, G. Eichhorn, A. Accomazzi, C.S. Grant, D.
Thompson, E. Bohlen, S.S. Murray | myADS-arXiv - a Tailor-Made, Open Access, Virtual Journal | 4 pages, 2 figures, poster paper to appear in the proceedings of the
LISA V conference | null | null | null | cs.DL astro-ph | null | The myADS-arXiv service provides the scientific community with a one stop
shop for staying up-to-date with a researcher's field of interest. The service
provides a powerful and unique filter on the enormous amount of bibliographic
information added to the ADS on a daily basis. It also provides a complete view
with the most relevant papers available in the subscriber's field of interest.
With this service, the subscriber will get to know the lastest developments,
popular trends and the most important papers. This makes the service not only
unique from a technical point of view, but also from a content point of view.
On this poster we will argue why myADS-arXiv is a tailor-made, open access,
virtual journal and we will illustrate its unique character.
| [
{
"version": "v1",
"created": "Fri, 4 Aug 2006 15:23:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Henneken",
"E.",
""
],
[
"Kurtz",
"M. J.",
""
],
[
"Eichhorn",
"G.",
""
],
[
"Accomazzi",
"A.",
""
],
[
"Grant",
"C. S.",
""
],
[
"Thompson",
"D.",
""
],
[
"Bohlen",
"E.",
""
],
[
"Murray",
"S. S.",
""
]
]
| new_dataset | 0.999128 |
cs/0608031 | Mikio Fujii | Mikio Fujii | Secure Positioning of Mobile Terminals with Simplex Radio Communication | 8 pages, 4 figures | null | null | null | cs.CR | null | With the rapid spread of various mobile terminals in our society, the
importance of secure positioning is growing for wireless networks in
adversarial settings. Recently, several authors have proposed a secure
positioning mechanism of mobile terminals which is based on the geometric
property of wireless node placement, and on the postulate of modern physics
that a propagation speed of information never exceeds the velocity of light. In
particular, they utilize the measurements of the round-trip time of radio
signal propagation and bidirectional communication for variants of the
challenge-and-response. In this paper, we propose a novel means to construct
the above mechanism by use of unidirectional communication instead of
bidirectional communication. Our proposal is based on the assumption that a
mobile terminal incorporates a high-precision inner clock in a tamper-resistant
protected area. In positioning, the mobile terminal uses its inner clock and
the time and location information broadcasted by radio from trusted stations.
Our proposal has a major advantage in protecting the location privacy of mobile
terminal users, because the mobile terminal need not provide any information to
the trusted stations through positioning procedures. Besides, our proposal is
free from the positioning error due to claimant's processing-time fluctuations
in the challenge-and-response, and is well-suited for mobile terminals in the
open air, or on the move at high speed, in terms of practical usage. We analyze
the security, the functionality, and the feasibility of our proposal in
comparison to previous proposals.
| [
{
"version": "v1",
"created": "Mon, 7 Aug 2006 05:49:31 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Fujii",
"Mikio",
""
]
]
| new_dataset | 0.994921 |
cs/0608045 | Fotis Georgatos Drs | Giannis Kouretis, Fotis Georgatos | LiveWN, cpu scavenging in the Grid Era | 4 pages | null | null | null | cs.DC cs.NI | null | The goal of this research is to introduce an easy and versatile way to
provide and use Grid resources without the need of any OS installation or
middleware configuration. At the same time we provide an excellent training
tool for newer Grid users and people that want to experiment, without enforcing
any installation. We have been testing it thoroughly under different
circumstances with firm success.
| [
{
"version": "v1",
"created": "Tue, 8 Aug 2006 15:28:53 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Aug 2006 22:13:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kouretis",
"Giannis",
""
],
[
"Georgatos",
"Fotis",
""
]
]
| new_dataset | 0.997572 |
cs/0608055 | Hao Chen | Hao Chen | MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves | null | null | null | null | cs.CR | null | For a secret sharing scheme, two parameters $d_{min}$ and $d_{cheat}$ are
defined in [12] and [13]. These two parameters measure the error-correcting
capability and the secret-recovering capability of the secret sharing scheme
against cheaters. Some general properties of the parameters have been studied
in [12,[9] and [13]. The MDS secret-sharing scheme was defined in [12] and it
is proved that MDS perfect secret sharing scheme can be constructed for any
monotone access structure. The famous Shamir $(k,n)$ threshold secret sharing
scheme is the MDS with $d_{min}=d_{cheat}=n-k+1$. In [3] we proposed the linear
secret sharing scheme from algebraic-geometric codes. In this paper the linear
secret sharing scheme from AG-codes on elliptic curves is studied and it is
shown that many of them are MDS linear secret sharing scheme.
| [
{
"version": "v1",
"created": "Mon, 14 Aug 2006 01:49:34 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Sep 2006 03:59:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"Hao",
""
]
]
| new_dataset | 0.986698 |
cs/0608092 | Danny Dolev | Ariel Daliot and Danny Dolev | Self-Stabilizing Byzantine Pulse Synchronization | An updated version. The original version appeared as TR-2005-84, The
Hebrew university, Aug. 2005 | null | null | TR-2005-84 | cs.DC | null | The ``Pulse Synchronization'' problem can be loosely described as targeting
to invoke a recurring distributed event as simultaneously as possible at the
different nodes and with a frequency that is as regular as possible. This
target becomes surprisingly subtle and difficult to achieve when facing both
transient and permanent failures. In this paper we present an algorithm for
pulse synchronization that self-stabilizes while at the same time tolerating a
permanent presence of Byzantine faults. The Byzantine nodes might incessantly
try to de-synchronize the correct nodes. Transient failures might throw the
system into an arbitrary state in which correct nodes have no common notion
what-so-ever, such as time or round numbers, and can thus not infer anything
from their own local states upon the state of other correct nodes. The
presented algorithm grants nodes the ability to infer that eventually all
correct nodes will invoke their pulses within a very short time interval of
each other and will do so regularly.
Pulse synchronization has previously been shown to be a powerful tool for
designing general self-stabilizing Byzantine algorithms and is hitherto the
only method that provides for the general design of efficient practical
protocols in the confluence of these two fault models. The difficulty, in
general, to design any algorithm in this fault model may be indicated by the
remarkably few algorithms resilient to both fault models. The few published
self-stabilizing Byzantine algorithms are typically complicated and sometimes
converge from an arbitrary initial state only after exponential or super
exponential time.
| [
{
"version": "v1",
"created": "Thu, 24 Aug 2006 16:07:07 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Aug 2006 03:24:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Daliot",
"Ariel",
""
],
[
"Dolev",
"Danny",
""
]
]
| new_dataset | 0.993725 |
cs/0608096 | Danny Dolev | Ariel Daliot, Danny Dolev and Hanna Parnas | Linear-time Self-stabilizing Byzantine Clock Synchronization | This is a corrected version. The original paper appeared in OPODIS'03 | Proc. of 7th International Conference on Principles of Distributed
Systems (OPODIS'03 La Martinique, France), December, 2003 | null | null | cs.DC | null | Clock synchronization is a very fundamental task in distributed system. It
thus makes sense to require an underlying clock synchronization mechanism to be
highly fault-tolerant. A self-stabilizing algorithm seeks to attain
synchronization once lost; a Byzantine algorithm assumes synchronization is
never lost and focuses on containing the influence of the permanent presence of
faulty nodes. There are efficient self-stabilizing solutions for clock
synchronization as well as efficient solutions that are resilient to Byzantine
faults. In contrast, to the best of our knowledge there is no practical
solution that is self-stabilizing while tolerating the permanent presence of
Byzantine nodes. We present the first linear-time self-stabilizing Byzantine
clock synchronization algorithm. Our deterministic clock synchronization
algorithm is based on the observation that all clock synchronization algorithms
require events for exchanging clock values and re-synchronizing the clocks to
within safe bounds. These events usually need to happen synchronously at the
different nodes. In classic Byzantine algorithms this is fulfilled or aided by
having the clocks initially close to each other and thus the actual clock
values can be used for synchronizing the events. This implies that clock values
cannot differ arbitrarily, which necessarily renders these solutions to be
non-stabilizing. Our scheme suggests using an underlying distributed pulse
synchronization module that is uncorrelated to the clock values.
| [
{
"version": "v1",
"created": "Fri, 25 Aug 2006 03:11:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Daliot",
"Ariel",
""
],
[
"Dolev",
"Danny",
""
],
[
"Parnas",
"Hanna",
""
]
]
| new_dataset | 0.991576 |
cs/0608114 | Benoit Hudzia | Benoit Hudzia and Serge Petiton | Reliable multicast fault tolerant MPI in the Grid environment | null | Benoit Hudzia and Serge Petiton, "Reliable multicast fault
tolerant MPI in the Grid environment", International Conference GRIDnet,
october 2004 | null | null | cs.DC | null | Grid environments have recently been developed with low stretch and overheads
that increase with the logarithm of the number of nodes in the system. Getting
and sending data to/from a large numbers of nodes is gaining importance due to
an increasing number of independent data providers and the heterogeneity of the
network/Grid. One of the key challenges is to achieve a balance between low
bandwidth consumption and good reliability. In this paper we present an
implementation of a reliable multicast protocol over a fault tolerant MPI:
MPICHV2. It can provide one way to solve the problem of transferring large
chunks of data between applications running on a grid with limited network
links. We first show that we can achieve similar performance as the MPICH-P4
implementation by using multicast with data compression in a cluster. Next, we
provide a theoretical cluster organization and GRID network architecture to
harness the performance provided by using multicast. Finally, we present the
conclusion and future work.
| [
{
"version": "v1",
"created": "Tue, 29 Aug 2006 13:14:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hudzia",
"Benoit",
""
],
[
"Petiton",
"Serge",
""
]
]
| new_dataset | 0.954049 |
cs/0608120 | Thierry Cachat | Thierry Cachat (LIAFA) | Controller synthesis & Ordinal Automata | with appendix | Proceedings of the 4th International Symposium on Automated
Technology for Verification and Analysis (ATVA'06) Springer (Ed.) (2006)
215-228 | null | null | cs.GT | null | Ordinal automata are used to model physical systems with Zeno behavior. Using
automata and games techniques we solve a control problem formulated and left
open by Demri and Nowak in 2005. It involves partial observability and a new
synchronization between the controller and the environment.
| [
{
"version": "v1",
"created": "Wed, 30 Aug 2006 09:58:08 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Oct 2006 11:04:54 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cachat",
"Thierry",
"",
"LIAFA"
]
]
| new_dataset | 0.999316 |
cs/0609016 | Tomasz Ciszkowski Mr | Tomasz Ciszkowski, Zbigniew Kotulski | ANAP: Anonymous Authentication Protocol in Mobile Ad hoc Networks | 12 pages, 10th Domestic Conference on Applied Cryptography ENIGMA,
Warsaw, Poland, May 2006, The second author's last name was corrected | null | null | null | cs.CR cs.NI | null | The pervasiveness of wireless communication recently gave mobile ad hoc
networks (MANET) a significant researchers' attention, due to its innate
capabilities of instant communication in many time and mission critical
applications. However, its natural advantages of networking in civilian and
military environments make them vulnerable to security threats. Support for an
anonymity in MANET is an orthogonal to security critical challenge we faced in
this paper. We propose a new anonymous authentication protocol for mobile ad
hoc networks enhanced with a distributed reputation system. The main its
objective is to provide mechanisms concealing a real identity of communicating
nodes with an ability of resist to known attacks. The distributed reputation
system is incorporated for a trust management and malicious behavior detection
in the network. The end-to-end anonymous authentication is conducted in
three-pass handshake based on an asymmetric and symmetric key cryptography.
After successfully finished authentication phase secure and multiple anonymous
data channels are established. The anonymity is guarantied by randomly chosen
pseudonyms owned by a user. Nodes of the network are publicly identified and
are independent of users' pseudonyms. In this paper we presented an example of
the protocol implementation.
| [
{
"version": "v1",
"created": "Tue, 5 Sep 2006 18:21:45 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Sep 2006 14:40:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ciszkowski",
"Tomasz",
""
],
[
"Kotulski",
"Zbigniew",
""
]
]
| new_dataset | 0.998177 |
cs/0609029 | Himanshu Thapliyal | Himanshu Thapliyal and Hamid R. Arabnia | Reversible Programmable Logic Array (RPLA) using Fredkin & Feynman Gates
for Industrial Electronics and Applications | Published in Proceedings of the International Conference on Embedded
Systems and Applications(ESA'06),Las Vegas, U.S.A, June 2006(CSREA Press) | null | null | null | cs.AR | null | In recent years, reversible logic has emerged as a promising computing
paradigm having application in low power CMOS, quantum computing,
nanotechnology, and optical computing. The classical set of gates such as AND,
OR, and EXOR are not reversible. In this paper, the authors have proposed
reversible programmable logic array (RPLA) architecture using reversible
Fredkin and Feynman gates. The proposed RPLA has n inputs and m outputs and can
realize m functions of n variables. In order to demonstrate the design of RPLA,
a 3 input RPLA is designed which can perform any 28 functions using the
combination of 8 min terms (23). Furthermore, the application of the designed 3
input RPLA is shown by implementing the full adder and full subtractor
functions through it.
| [
{
"version": "v1",
"created": "Thu, 7 Sep 2006 14:25:21 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thapliyal",
"Himanshu",
""
],
[
"Arabnia",
"Hamid R.",
""
]
]
| new_dataset | 0.95077 |
cs/0609036 | Himanshu Thapliyal | Himanshu Thapliyal, Hamid R. Arabnia and M.B Srinivas | Reduced Area Low Power High Throughput BCD Adders for IEEE 754r Format | 6 Pages;Published in Proceedings of the 11th International CSI
Computer Conference (CSICC'06), Tehran, Jan 24-26, 2006, pp.59-64 | null | null | null | cs.AR | null | IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and
a major enhancement to the standard is the addition of decimal format. Firstly,
this paper proposes novel two transistor AND and OR gates. The proposed AND
gate has no power supply, thus it can be referred as the Powerless AND gate.
Similarly, the proposed two transistor OR gate has no ground and can be
referred as Groundless OR. Secondly for IEEE 754r format, two novel BCD adders
called carry skip and carry look-ahead BCD adders are also proposed in this
paper. In order to design the carry look-ahead BCD adder, a novel 4 bit carry
look-ahead adder called NCLA is proposed which forms the basic building block
of the proposed carry look-ahead BCD adder. Finally, the proposed two
transistors AND and OR gates are used to provide the optimized small area low
power high throughput circuitries of the proposed BCD adders.
| [
{
"version": "v1",
"created": "Fri, 8 Sep 2006 05:36:20 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thapliyal",
"Himanshu",
""
],
[
"Arabnia",
"Hamid R.",
""
],
[
"Srinivas",
"M. B",
""
]
]
| new_dataset | 0.993644 |
cs/0609051 | Ralf Steinberger | Bruno Pouliquen, Ralf Steinberger, Camelia Ignat, Irina Temnikova,
Anna Widiger, Wajdi Zaghouani, Jan Zizka | Multilingual person name recognition and transliteration | Explains the technology behind the JRC's NewsExplorer application,
which is freely accessible at http://press.jrc.it/NewsExplorer | Journal CORELA - Cognition, Representation, Langage. Numeros
speciaux, Le traitement lexicographique des noms propres. December 2005. ISSN
1638-5748 | null | null | cs.CL cs.IR | null | We present an exploratory tool that extracts person names from multilingual
news collections, matches name variants referring to the same person, and
infers relationships between people based on the co-occurrence of their names
in related news. A novel feature is the matching of name variants across
languages and writing systems, including names written with the Greek, Cyrillic
and Arabic writing system. Due to our highly multilingual setting, we use an
internal standard representation for name representation and matching, instead
of adopting the traditional bilingual approach to transliteration. This work is
part of the news analysis system NewsExplorer that clusters an average of
25,000 news articles per day to detect related news within the same and across
different languages.
| [
{
"version": "v1",
"created": "Mon, 11 Sep 2006 11:08:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pouliquen",
"Bruno",
""
],
[
"Steinberger",
"Ralf",
""
],
[
"Ignat",
"Camelia",
""
],
[
"Temnikova",
"Irina",
""
],
[
"Widiger",
"Anna",
""
],
[
"Zaghouani",
"Wajdi",
""
],
[
"Zizka",
"Jan",
""
]
]
| new_dataset | 0.99705 |
cs/0609058 | Ralf Steinberger | Ralf Steinberger, Bruno Pouliquen, Anna Widiger, Camelia Ignat, Tomaz
Erjavec, Dan Tufis, Daniel Varga | The JRC-Acquis: A multilingual aligned parallel corpus with 20+
languages | A multilingual textual resource with meta-data freely available for
download at http://langtech.jrc.it/JRC-Acquis.html | Proceedings of the 5th International Conference on Language
Resources and Evaluation (LREC'2006), pp. 2142-2147. Genoa, Italy, 24-26 May
2006 | null | null | cs.CL | null | We present a new, unique and freely available parallel corpus containing
European Union (EU) documents of mostly legal nature. It is available in all 20
official EUanguages, with additional documents being available in the languages
of the EU candidate countries. The corpus consists of almost 8,000 documents
per language, with an average size of nearly 9 million words per language.
Pair-wise paragraph alignment information produced by two different aligners
(Vanilla and HunAlign) is available for all 190+ language pair combinations.
Most texts have been manually classified according to the EUROVOC subject
domains so that the collection can also be used to train and test multi-label
classification algorithms and keyword-assignment software. The corpus is
encoded in XML, according to the Text Encoding Initiative Guidelines. Due to
the large number of parallel texts in many languages, the JRC-Acquis is
particularly suitable to carry out all types of cross-language research, as
well as to test and benchmark text analysis software across different languages
(for instance for alignment, sentence splitting and term extraction).
| [
{
"version": "v1",
"created": "Tue, 12 Sep 2006 07:10:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Steinberger",
"Ralf",
""
],
[
"Pouliquen",
"Bruno",
""
],
[
"Widiger",
"Anna",
""
],
[
"Ignat",
"Camelia",
""
],
[
"Erjavec",
"Tomaz",
""
],
[
"Tufis",
"Dan",
""
],
[
"Varga",
"Daniel",
""
]
]
| new_dataset | 0.999616 |
cs/0609061 | Ralf Steinberger | Ralf Steinberger (European Commission - Joint Research Centre) | Cross-lingual keyword assignment | Precursor paper to cs.CL/0609059. The automatic classification system
described here has now matured and is in daily use for document indexing in a
European parliament. See http://langtech.jrc.it/Eurovoc.html for more
details. 8 pages | Proceedings of the XVII Conference of the Spanish Society for
Natural Language Processing (SEPLN-2001). Procesamiento del Lenguaje Natural,
Revista No. 27, pp. 273-280. Jaen, Spain, 12-14 September 2001. ISSN
1135-5948 | null | null | cs.CL cs.IR | null | This paper presents a language-independent approach to controlled vocabulary
keyword assignment using the EUROVOC thesaurus. Due to the multilingual nature
of EUROVOC, the keywords for a document written in one language can be
displayed in all eleven official European Union languages. The mapping of
documents written in different languages to the same multilingual thesaurus
furthermore allows cross-language document comparison. The assignment of the
controlled vocabulary thesaurus descriptors is achieved by applying a
statistical method that uses a collection of manually indexed documents to
identify, for each thesaurus descriptor, a large number of lemmas that are
statistically associated to the descriptor. These associated words are then
used during the assignment procedure to identify a ranked list of those EUROVOC
terms that are most likely to be good keywords for a given document. The paper
also describes the challenges of this task and discusses the achieved results
of the fully functional prototype.
| [
{
"version": "v1",
"created": "Tue, 12 Sep 2006 09:29:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Steinberger",
"Ralf",
"",
"European Commission - Joint Research Centre"
]
]
| new_dataset | 0.998621 |
cs/0609065 | Ralf Steinberger | Bruno Pouliquen, Marco Kimler, Ralf Steinberger, Camelia Ignat, Tamara
Oellinger, Ken Blackler, Flavio Fuart, Wajdi Zaghouani, Anna Widiger,
Ann-Charlotte Forslund, Clive Best (European Commission - Joint Research
Centre) | Geocoding multilingual texts: Recognition, disambiguation and
visualisation | 6 pages | Proceedings of the 5th International Conference on Language
Resources and Evaluation (LREC-2006), pp. 53-58. Genoa, Italy, 24-26 May 2006 | null | null | cs.CL cs.IR | null | We are presenting a method to recognise geographical references in free text.
Our tool must work on various languages with a minimum of language-dependent
resources, except a gazetteer. The main difficulty is to disambiguate these
place names by distinguishing places from persons and by selecting the most
likely place out of a list of homographic place names world-wide. The system
uses a number of language-independent clues and heuristics to disambiguate
place name homographs. The final aim is to index texts with the countries and
cities they mention and to automatically visualise this information on
geographical maps using various tools.
| [
{
"version": "v1",
"created": "Tue, 12 Sep 2006 12:57:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pouliquen",
"Bruno",
"",
"European Commission - Joint Research\n Centre"
],
[
"Kimler",
"Marco",
"",
"European Commission - Joint Research\n Centre"
],
[
"Steinberger",
"Ralf",
"",
"European Commission - Joint Research\n Centre"
],
[
"Ignat",
"Camelia",
"",
"European Commission - Joint Research\n Centre"
],
[
"Oellinger",
"Tamara",
"",
"European Commission - Joint Research\n Centre"
],
[
"Blackler",
"Ken",
"",
"European Commission - Joint Research\n Centre"
],
[
"Fuart",
"Flavio",
"",
"European Commission - Joint Research\n Centre"
],
[
"Zaghouani",
"Wajdi",
"",
"European Commission - Joint Research\n Centre"
],
[
"Widiger",
"Anna",
"",
"European Commission - Joint Research\n Centre"
],
[
"Forslund",
"Ann-Charlotte",
"",
"European Commission - Joint Research\n Centre"
],
[
"Best",
"Clive",
"",
"European Commission - Joint Research\n Centre"
]
]
| new_dataset | 0.999056 |
cs/0609131 | Ran Ren | Ran Ren, Madan mohan Manokar, Yaogang Shi, Baoyu Zheng | A Fast Block Matching Algorithm for Video Motion Estimation Based on
Particle Swarm Optimization and Motion Prejudgment | 10 pages, 12 figures, submitted to ACM Symposium of Applied
Computing(SAC) | null | null | null | cs.MM | null | In this paper, we propose a fast 2-D block-based motion estimation algorithm
called Particle Swarm Optimization - Zero-motion Prejudgment(PSO-ZMP) which
consists of three sequential routines: 1)Zero-motion prejudgment. The routine
aims at finding static macroblocks(MB) which do not need to perform remaining
search thus reduces the computational cost; 2)Predictive image coding and 3)PSO
matching routine. Simulation results obtained show that the proposed PSO-ZMP
algorithm achieves over 10 times of computation less than Diamond Search(DS)
and 5 times less than the recent proposed Adaptive Rood Pattern
Searching(ARPS). Meanwhile the PSNR performances using PSO-ZMP are very close
to that using DS and ARPS in some less-motioned sequences. While in some
sequences containing dense and complex motion contents, the PSNR performances
of PSO-ZMP are several dB lower than that using DS and ARPS but in an
acceptable degree.
| [
{
"version": "v1",
"created": "Sun, 24 Sep 2006 09:55:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ren",
"Ran",
""
],
[
"Manokar",
"Madan mohan",
""
],
[
"Shi",
"Yaogang",
""
],
[
"Zheng",
"Baoyu",
""
]
]
| new_dataset | 0.95565 |
cs/0609141 | Iosif Pinelis | Iosif Pinelis | Polygon Convexity: A Minimal O(n) Test | 14 pages | null | null | null | cs.CG cs.CC math.CO math.MG | null | An O(n) test for polygon convexity is stated and proved. It is also proved
that the test is minimal in a certain exact sense.
| [
{
"version": "v1",
"created": "Mon, 25 Sep 2006 19:23:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pinelis",
"Iosif",
""
]
]
| new_dataset | 0.999667 |
cs/0609143 | Adrian Paschke | Adrian Paschke | ECA-LP / ECA-RuleML: A Homogeneous Event-Condition-Action Logic
Programming Language | Paschke, A.: ECA-LP / ECA-RuleML: A Homogeneous
Event-Condition-Action Logic Programming Language, Int. Conf. on Rules and
Rule Markup Languages for the Semantic Web (RuleML06), Athens, Georgia, USA,
Nov. 2006 | Paschke, A.: ECA-LP / ECA-RuleML: A Homogeneous
Event-Condition-Action Logic Programming Language, Int. Conf. on Rules and
Rule Markup Languages for the Semantic Web (RuleML06), Athens, Georgia, USA,
Nov. 2006 | null | null | cs.AI cs.LO cs.SE | null | Event-driven reactive functionalities are an urgent need in nowadays
distributed service-oriented applications and (Semantic) Web-based
environments. An important problem to be addressed is how to correctly and
efficiently capture and process the event-based behavioral, reactive logic
represented as ECA rules in combination with other conditional decision logic
which is represented as derivation rules. In this paper we elaborate on a
homogeneous integration approach which combines derivation rules, reaction
rules (ECA rules) and other rule types such as integrity constraint into the
general framework of logic programming. The developed ECA-LP language provides
expressive features such as ID-based updates with support for external and
self-updates of the intensional and extensional knowledge, transac-tions
including integrity testing and an event algebra to define and process complex
events and actions based on a novel interval-based Event Calculus variant.
| [
{
"version": "v1",
"created": "Tue, 26 Sep 2006 14:36:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Paschke",
"Adrian",
""
]
]
| new_dataset | 0.995772 |
cs/0609145 | Alexandre d'Aspremont | Alexandre d'Aspremont, Laurent El Ghaoui | A Semidefinite Relaxation for Air Traffic Flow Scheduling | Submitted to RIVF 2007 | null | null | null | cs.CE | null | We first formulate the problem of optimally scheduling air traffic low with
sector capacity constraints as a mixed integer linear program. We then use
semidefinite relaxation techniques to form a convex relaxation of that problem.
Finally, we present a randomization algorithm to further improve the quality of
the solution. Because of the specific structure of the air traffic flow
problem, the relaxation has a single semidefinite constraint of size dn where d
is the maximum delay and n the number of flights.
| [
{
"version": "v1",
"created": "Tue, 26 Sep 2006 15:34:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"d'Aspremont",
"Alexandre",
""
],
[
"Ghaoui",
"Laurent El",
""
]
]
| new_dataset | 0.997822 |
cs/0610006 | Adrian Paschke | Adrian Paschke | A Typed Hybrid Description Logic Programming Language with Polymorphic
Order-Sorted DL-Typed Unification for Semantic Web Type Systems | Full technical report 12/05. Published inn: Proc. of 2nd Int.
Workshop on OWL: Experiences and Directions 2006 (OWLED'06) at ISWC'06,
Athens, Georgia, USA, 2006 | In: Proc. of 2nd Int. Workshop on OWL: Experiences and Directions
2006 (OWLED'06) at ISWC'06, Athens, Georgia, USA, 2006 | null | null | cs.AI | null | In this paper we elaborate on a specific application in the context of hybrid
description logic programs (hybrid DLPs), namely description logic Semantic Web
type systems (DL-types) which are used for term typing of LP rules based on a
polymorphic, order-sorted, hybrid DL-typed unification as procedural semantics
of hybrid DLPs. Using Semantic Web ontologies as type systems facilitates
interchange of domain-independent rules over domain boundaries via dynamically
typing and mapping of explicitly defined type ontologies.
| [
{
"version": "v1",
"created": "Mon, 2 Oct 2006 08:57:54 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Apr 2007 21:36:44 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Paschke",
"Adrian",
""
]
]
| new_dataset | 0.967059 |
cs/0610011 | Alberto Accomazzi | Alberto Accomazzi, Gunther Eichhorn, Michael J. Kurtz, Carolyn S.
Grant, Edwin Henneken, Markus Demleitner, Donna Thompson, Elizabeth Bohlen,
Stephen S. Murray | Creation and use of Citations in the ADS | 9 pages; to be published in the proceedings of the conference
"Library and Information Services V," June 2006, Cambridge, MA, USA | null | null | null | cs.DL astro-ph cs.DB cs.IR | null | With over 20 million records, the ADS citation database is regularly used by
researchers and librarians to measure the scientific impact of individuals,
groups, and institutions. In addition to the traditional sources of citations,
the ADS has recently added references extracted from the arXiv e-prints on a
nightly basis. We review the procedures used to harvest and identify the
reference data used in the creation of citations, the policies and procedures
that we follow to avoid double-counting and to eliminate contributions which
may not be scholarly in nature. Finally, we describe how users and institutions
can easily obtain quantitative citation data from the ADS, both interactively
and via web-based programming tools.
The ADS is available at http://ads.harvard.edu.
| [
{
"version": "v1",
"created": "Tue, 3 Oct 2006 21:29:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Accomazzi",
"Alberto",
""
],
[
"Eichhorn",
"Gunther",
""
],
[
"Kurtz",
"Michael J.",
""
],
[
"Grant",
"Carolyn S.",
""
],
[
"Henneken",
"Edwin",
""
],
[
"Demleitner",
"Markus",
""
],
[
"Thompson",
"Donna",
""
],
[
"Bohlen",
"Elizabeth",
""
],
[
"Murray",
"Stephen S.",
""
]
]
| new_dataset | 0.997241 |
cs/0610020 | William Gilreath | William F. Gilreath | XString: XML as a String | 27-pages, 2-tables | null | null | null | cs.DB | null | Extensible markup language (XML) is a technology that has been much hyped, so
that XML has become an industry buzzword. Behind the hype is a powerful
technology for data representation in a platform independent manner. As a text
document, however, XML suffers from being too bloated, and requires an XML
parser to access and manipulate it. XString is an encoding method for XML, in
essence, a markup language's markup language. XString gives the benefit of
compressing XML, and allows for easy manipulation and processing of XML source
as a very long string.
| [
{
"version": "v1",
"created": "Wed, 4 Oct 2006 23:21:11 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Oct 2006 23:03:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gilreath",
"William F.",
""
]
]
| new_dataset | 0.999759 |
cs/0610029 | Alberto Accomazzi | Carolyn S. Grant, Alberto Accomazzi, Donna Thompson, Edwin Henneken,
Guenther Eichhorn, Michael J. Kurtz, and Stephen S. Murray | Data in the ADS -- Understanding How to Use it Better | 4 pages; submitted to the proceedings of the Library and Information
Services in Astronomy V; to be published by ASP Conference Proceedings | null | null | null | cs.DL cs.DB | null | The Smithsonian/NASA ADS Abstract Service contains a wealth of data for
astronomers and librarians alike, yet the vast majority of usage consists of
rudimentary searches. Hints on how to obtain more focused search results by
using more of the various capabilities of the ADS are presented, including
searching by affiliation. We also discuss the classification of articles by
content and by referee status.
The ADS is funded by NASA Grant NNG06GG68G-16613687.
| [
{
"version": "v1",
"created": "Thu, 5 Oct 2006 18:51:54 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Grant",
"Carolyn S.",
""
],
[
"Accomazzi",
"Alberto",
""
],
[
"Thompson",
"Donna",
""
],
[
"Henneken",
"Edwin",
""
],
[
"Eichhorn",
"Guenther",
""
],
[
"Kurtz",
"Michael J.",
""
],
[
"Murray",
"Stephen S.",
""
]
]
| new_dataset | 0.997687 |
cs/0610048 | Stephen D. Miller | Nathan Keller, Stephen D. Miller, Ilya Mironov, and Ramarathnam
Venkatesan | MV3: A new word based stream cipher using rapid mixing and revolving
buffers | 27 pages, shortened version will appear in "Topics in Cryptology -
CT-RSA 2007" | null | null | null | cs.CR cs.DM math.CO | null | MV3 is a new word based stream cipher for encrypting long streams of data. A
direct adaptation of a byte based cipher such as RC4 into a 32- or 64-bit word
version will obviously need vast amounts of memory. This scaling issue
necessitates a look for new components and principles, as well as mathematical
analysis to justify their use. Our approach, like RC4's, is based on rapidly
mixing random walks on directed graphs (that is, walks which reach a random
state quickly, from any starting point). We begin with some well understood
walks, and then introduce nonlinearity in their steps in order to improve
security and show long term statistical correlations are negligible. To
minimize the short term correlations, as well as to deter attacks using
equations involving successive outputs, we provide a method for sequencing the
outputs derived from the walk using three revolving buffers. The cipher is fast
-- it runs at a speed of less than 5 cycles per byte on a Pentium IV processor.
A word based cipher needs to output more bits per step, which exposes more
correlations for attacks. Moreover we seek simplicity of construction and
transparent analysis. To meet these requirements, we use a larger state and
claim security corresponding to only a fraction of it. Our design is for an
adequately secure word-based cipher; our very preliminary estimate puts the
security close to exhaustive search for keys of size < 256 bits.
| [
{
"version": "v1",
"created": "Tue, 10 Oct 2006 01:23:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Keller",
"Nathan",
""
],
[
"Miller",
"Stephen D.",
""
],
[
"Mironov",
"Ilya",
""
],
[
"Venkatesan",
"Ramarathnam",
""
]
]
| new_dataset | 0.998916 |
cs/0610075 | Marek Czachor | Diederik Aerts, Marek Czachor, Bart De Moor | On Geometric Algebra representation of Binary Spatter Codes | preliminary version | null | null | null | cs.AI quant-ph | null | Kanerva's Binary Spatter Codes are reformulated in terms of geometric
algebra. The key ingredient of the construction is the representation of XOR
binding in terms of geometric product.
| [
{
"version": "v1",
"created": "Thu, 12 Oct 2006 18:48:22 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Oct 2006 13:56:54 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Aerts",
"Diederik",
""
],
[
"Czachor",
"Marek",
""
],
[
"De Moor",
"Bart",
""
]
]
| new_dataset | 0.969102 |
cs/0610078 | Fehmi Ben Abdesslem | Fehmi Ben Abdesslem, Luigi Iannone, Marcelo Dias de Amorim, Katia
Obraczka, Ignacio Solis, and Serge Fdida | Rapid Prototyping over IEEE 802.11 | Changed content. 12 pages | null | null | null | cs.NI | null | This paper introduces Prawn, a tool for prototyping communication protocols
over IEEE 802.11 networks. Prawn allows researchers to conduct both functional
assessment and performance evaluation as an inherent part of the protocol
design process. Since Prawn runs on real IEEE 802.11 nodes, prototypes can be
evaluated and adjusted under realistic conditions. Once the prototype has been
extensively tested and thoroughly validated, and its functional design tuned
accordingly, it is then ready for implementation. Prawn facilitates prototype
development by providing: (i) a set of building blocks that implement common
functions needed by a wide range of wireless protocols (e.g., neighbor
discovery, link quality assessment, message transmission and reception), and
(ii) an API that allows protocol designers to access Prawn primitives. We show
through a number of case studies how Prawn supports prototyping as part of
protocol design and, as a result of enabling deployment and testing under
real-world scenarios, how Prawn provides useful feedback on protocol operation
and performance.
| [
{
"version": "v1",
"created": "Fri, 13 Oct 2006 15:29:44 GMT"
},
{
"version": "v2",
"created": "Sat, 3 Feb 2007 21:41:58 GMT"
},
{
"version": "v3",
"created": "Tue, 22 May 2007 16:24:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Abdesslem",
"Fehmi Ben",
""
],
[
"Iannone",
"Luigi",
""
],
[
"de Amorim",
"Marcelo Dias",
""
],
[
"Obraczka",
"Katia",
""
],
[
"Solis",
"Ignacio",
""
],
[
"Fdida",
"Serge",
""
]
]
| new_dataset | 0.991928 |
cs/0610085 | Farn Wang | Farn Wang | Symbolic Simulation-Checking of Dense-Time Systems | 16 pages, 1 figure | null | null | null | cs.LO cs.SE | null | Intuitively, an (implementation) automata is simulated by a (specification)
automata if every externally observable transition by the implementation
automata can also be made by the specification automata. In this work, we
present a symbolic algorithm for the simulation-checking of timed automatas. We
first present a simulation-checking procedure that operates on state spaces,
representable with convex polyhedra, of timed automatas. We then present
techniques to represent those intermediate result convex polyhedra with zones
and make the procedure an algorithm. We then discuss how to handle Zeno states
in the implementation automata. Finally, we have endeavored to realize the
algorithm and report the performance of our algorithm in the experiment.
| [
{
"version": "v1",
"created": "Fri, 13 Oct 2006 18:02:47 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wang",
"Farn",
""
]
]
| new_dataset | 0.970899 |
cs/0610137 | Silvano Dal Zilio | Lucia Acciai (LIF), Michele Boreale, Silvano Dal Zilio (LIF) | A Concurrent Calculus with Atomic Transactions | 29 pages | null | null | null | cs.LO cs.DC | null | The Software Transactional Memory (STM) model is an original approach for
controlling concurrent accesses to ressources without the need for explicit
lock-based synchronization mechanisms. A key feature of STM is to provide a way
to group sequences of read and write actions inside atomic blocks, similar to
database transactions, whose whole effect should occur atomically. In this
paper, we investigate STM from a process algebra perspective and define an
extension of asynchronous CCS with atomic blocks of actions. Our goal is not
only to set a formal ground for reasoning on STM implementations but also to
understand how this model fits with other concurrency control mechanisms. We
also view this calculus as a test bed for extending process calculi with atomic
transactions. This is an interesting direction for investigation since, for the
most part, actual works that mix transactions with process calculi consider
compensating transactions, a model that lacks all the well-known ACID
properties. We show that the addition of atomic transactions results in a very
expressive calculus, enough to easily encode other concurrent primitives such
as guarded choice and multiset-synchronization (\`{a} la join-calculus). The
correctness of our encodings is proved using a suitable notion of bisimulation
equivalence. The equivalence is then applied to prove interesting ``laws of
transactions'' and to obtain a simple normal form for transactions.
| [
{
"version": "v1",
"created": "Tue, 24 Oct 2006 08:26:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Acciai",
"Lucia",
"",
"LIF"
],
[
"Boreale",
"Michele",
"",
"LIF"
],
[
"Zilio",
"Silvano Dal",
"",
"LIF"
]
]
| new_dataset | 0.997635 |
cs/0610174 | Marko Samer | Marko Samer, Stefan Szeider | A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth | 9 pages, 1 figure | null | null | null | cs.DS cs.CC cs.LO | null | We present an efficient fixed-parameter algorithm for #SAT parameterized by
the incidence treewidth, i.e., the treewidth of the bipartite graph whose
vertices are the variables and clauses of the given CNF formula; a variable and
a clause are joined by an edge if and only if the variable occurs in the
clause. Our algorithm runs in time O(4^k k l N), where k denotes the incidence
treewidth, l denotes the size of a largest clause, and N denotes the number of
nodes of the tree-decomposition.
| [
{
"version": "v1",
"created": "Tue, 31 Oct 2006 12:58:36 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Feb 2007 20:56:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Samer",
"Marko",
""
],
[
"Szeider",
"Stefan",
""
]
]
| new_dataset | 0.99529 |
cs/0611006 | Julian Togelius | Julian Togelius and Simon M. Lucas | Evolving controllers for simulated car racing | Won the CEC 2005 Best Student Paper Award | Proceedings of the 2005 Congress on Evolutionary Computation,
pages 1906-1913 | null | null | cs.NE cs.LG cs.RO | null | This paper describes the evolution of controllers for racing a simulated
radio-controlled car around a track, modelled on a real physical track. Five
different controller architectures were compared, based on neural networks,
force fields and action sequences. The controllers use either egocentric (first
person), Newtonian (third person) or no information about the state of the car
(open-loop controller). The only controller that was able to evolve good racing
behaviour was based on a neural network acting on egocentric inputs.
| [
{
"version": "v1",
"created": "Thu, 2 Nov 2006 00:47:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Togelius",
"Julian",
""
],
[
"Lucas",
"Simon M.",
""
]
]
| new_dataset | 0.9589 |
cs/0611022 | Anurag Ganguli | Anurag Ganguli, Jorge Cortes, Francesco Bullo | Multirobot rendezvous with visibility sensors in nonconvex environments | 21 pages | null | null | null | cs.RO | null | This paper presents a coordination algorithm for mobile autonomous robots.
Relying upon distributed sensing the robots achieve rendezvous, that is, they
move to a common location. Each robot is a point mass moving in a nonconvex
environment according to an omnidirectional kinematic model. Each robot is
equipped with line-of-sight limited-range sensors, i.e., a robot can measure
the relative position of any object (robots or environment boundary) if and
only if the object is within a given distance and there are no obstacles
in-between. The algorithm is designed using the notions of robust visibility,
connectivity-preserving constraint sets, and proximity graphs. Simulations
illustrate the theoretical results on the correctness of the proposed
algorithm, and its performance in asynchronous setups and with sensor
measurement and control errors.
| [
{
"version": "v1",
"created": "Mon, 6 Nov 2006 02:50:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ganguli",
"Anurag",
""
],
[
"Cortes",
"Jorge",
""
],
[
"Bullo",
"Francesco",
""
]
]
| new_dataset | 0.999336 |
cs/0611026 | Susanne Salmon-Alt | Susanne Salmon-Alt (ATILF), Laurent Romary (INRIA Lorraine - LORIA),
Jean-Marie Pierrel (ATILF) | Un mod\`ele g\'en\'erique d'organisation de corpus en ligne: application
\`a la FReeBank | null | Traitement Automatique des Langues (TAL) 45 (2006) 145-169 | null | null | cs.CL | null | The few available French resources for evaluating linguistic models or
algorithms on other linguistic levels than morpho-syntax are either
insufficient from quantitative as well as qualitative point of view or not
freely accessible. Based on this fact, the FREEBANK project intends to create
French corpora constructed using manually revised output from a hybrid
Constraint Grammar parser and annotated on several linguistic levels
(structure, morpho-syntax, syntax, coreference), with the objective to make
them available on-line for research purposes. Therefore, we will focus on using
standard annotation schemes, integration of existing resources and maintenance
allowing for continuous enrichment of the annotations. Prior to the actual
presentation of the prototype that has been implemented, this paper describes a
generic model for the organization and deployment of a linguistic resource
archive, in compliance with the various works currently conducted within
international standardization initiatives (TEI and ISO/TC 37/SC 4).
| [
{
"version": "v1",
"created": "Mon, 6 Nov 2006 14:37:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Salmon-Alt",
"Susanne",
"",
"ATILF"
],
[
"Romary",
"Laurent",
"",
"INRIA Lorraine - LORIA"
],
[
"Pierrel",
"Jean-Marie",
"",
"ATILF"
]
]
| new_dataset | 0.999311 |
cs/0611033 | Maria Naya Plasencia | Maria Naya Plasencia (INRIA Rocquencourt) | Cryptanalyse de Achterbahn-128/80 | null | null | null | null | cs.CR | null | This paper presents two attacks against Achterbahn-128/80, the last version
of one of the stream cipher proposals in the eSTREAM project. The attack
against the 80-bit variant, Achterbahn-80, has complexity 2^{56.32}. The attack
against Achterbahn-128 requires 2^{75.4} operations and 2^{61} keystream bits.
These attacks are based on an improvement of the attack due to Hell and
Johansson against Achterbahn version 2 and also on an algorithm that makes
profit of the short lengths of the constituent registers.
*****
Ce papier pr\'{e}sente deux attaques sur Achterbahn-128/80, la derni\`{e}re
version d'un des algorithmes propos\'{e}s dans le cadre de eSTREAM. L'attaque
sur la version de 80 bits, Achterbahn-80, est en 2^{56.32}. L'attaque sur
Achterbahn-128 a besoin de 2^{75.4} calculs et 2^{61} bits de suite chiffrante.
Ces attaques sont bas\'{e}es sur une am\'{e}lioration de l'attaque propos\'{e}e
par Hell et Johansson sur la version 2 d'Achterbahn et aussi sur un algorithme
qui tire profit des petites longueurs des registres.
| [
{
"version": "v1",
"created": "Wed, 8 Nov 2006 07:48:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Plasencia",
"Maria Naya",
"",
"INRIA Rocquencourt"
]
]
| new_dataset | 0.985519 |
cs/0611087 | Vipul Mathur | Naresh Singhmar, Vipul Mathur, Varsha Apte, D. Manjunath | A Combined LIFO-Priority Scheme for Overload Control of E-commerce Web
Servers | 10 pages, 8 figures, presented at the International Infrastructure
Survivability Workshop (affiliated with the 25th IEEE International Real-Time
Systems Symposium), Lisbon, Portugal, December 2004 | null | null | null | cs.PF | null | E-commerce Web-servers often face overload conditions during which
revenue-generating requests may be dropped or abandoned due to an increase in
the browsing requests. In this paper we present a simple, yet effective,
mechanism for overload control of E-commerce Web-servers. We develop an
E-commerce workload model that separates the browsing requests from
revenue-generating transaction requests. During overload, we apply LIFO
discipline in the browsing queues and use a dynamic priority model to service
them. The transaction queues are given absolute priority over the browsing
queues. This is called the LIFO-Pri scheduling discipline. Experimental results
show that LIFO-Pri dramatically improves the overall Web-server throughput
while also increasing the completion rate of revenue-generating requests. The
Web-server was able to operate at nearly 60% of its maximum capacity even when
offered load was 1.5 times its capacity. Further, when compared to a single
queue FIFO system, there was a seven-fold increase in the number of completed
revenue-generating requests during overload.
| [
{
"version": "v1",
"created": "Fri, 17 Nov 2006 23:43:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Singhmar",
"Naresh",
""
],
[
"Mathur",
"Vipul",
""
],
[
"Apte",
"Varsha",
""
],
[
"Manjunath",
"D.",
""
]
]
| new_dataset | 0.976234 |
cs/0611107 | Adam L. Buchsbaum | Adam L. Buchsbaum, Emden R. Gansner, Cecilia M. Procopiuc, Suresh
Venkatasubramanian | Rectangular Layouts and Contact Graphs | 28 pages, 13 figures, 55 references, 1 appendix | null | null | null | cs.DS cs.DM | null | Contact graphs of isothetic rectangles unify many concepts from applications
including VLSI and architectural design, computational geometry, and GIS.
Minimizing the area of their corresponding {\em rectangular layouts} is a key
problem. We study the area-optimization problem and show that it is NP-hard to
find a minimum-area rectangular layout of a given contact graph. We present
O(n)-time algorithms that construct $O(n^2)$-area rectangular layouts for
general contact graphs and $O(n\log n)$-area rectangular layouts for trees.
(For trees, this is an $O(\log n)$-approximation algorithm.) We also present an
infinite family of graphs (rsp., trees) that require $\Omega(n^2)$ (rsp.,
$\Omega(n\log n)$) area.
We derive these results by presenting a new characterization of graphs that
admit rectangular layouts using the related concept of {\em rectangular duals}.
A corollary to our results relates the class of graphs that admit rectangular
layouts to {\em rectangle of influence drawings}.
| [
{
"version": "v1",
"created": "Tue, 21 Nov 2006 15:03:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Buchsbaum",
"Adam L.",
""
],
[
"Gansner",
"Emden R.",
""
],
[
"Procopiuc",
"Cecilia M.",
""
],
[
"Venkatasubramanian",
"Suresh",
""
]
]
| new_dataset | 0.988896 |
cs/0612047 | Kristina Lerman | Kristina Lerman and Laurie Jones | Social Browsing on Flickr | 8 pages; submitted to the International Conference on Weblogs and
Social Media | null | null | null | cs.HC cs.AI | null | The new social media sites - blogs, wikis, del.icio.us and Flickr, among
others - underscore the transformation of the Web to a participatory medium in
which users are actively creating, evaluating and distributing information. The
photo-sharing site Flickr, for example, allows users to upload photographs,
view photos created by others, comment on those photos, etc. As is common to
other social media sites, Flickr allows users to designate others as
``contacts'' and to track their activities in real time. The contacts (or
friends) lists form the social network backbone of social media sites. We claim
that these social networks facilitate new ways of interacting with information,
e.g., through what we call social browsing. The contacts interface on Flickr
enables users to see latest images submitted by their friends. Through an
extensive analysis of Flickr data, we show that social browsing through the
contacts' photo streams is one of the primary methods by which users find new
images on Flickr. This finding has implications for creating personalized
recommendation systems based on the user's declared contacts lists.
| [
{
"version": "v1",
"created": "Thu, 7 Dec 2006 23:41:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lerman",
"Kristina",
""
],
[
"Jones",
"Laurie",
""
]
]
| new_dataset | 0.996716 |
cs/0612054 | Wojciech Mazurczyk | Wojciech Mazurczyk, Zbigniew Kotulski | Lightweight security mechanism for PSTN-VoIP cooperation | 6 pages, 5 figures | null | null | null | cs.CR cs.MM | null | In this paper we describe a new, lightweight security mechanism for PSTN-VoIP
cooperation that is based on two information hiding techniques: digital
watermarking and steganography. Proposed scheme is especially suitable for
PSTN-IP-PSTN (toll-by-passing) scenario which nowadays is very popular
application of IP Telephony systems. With the use of this mechanism we
authenticate end-to-end transmitted voice between PSTN users. Additionally we
improve IP part traffic security (both media stream and VoIP signalling
messages). Exemplary scenario is presented for SIP signalling protocol along
with SIP-T extension and H.248/Megaco protocol.
| [
{
"version": "v1",
"created": "Fri, 8 Dec 2006 22:05:21 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mazurczyk",
"Wojciech",
""
],
[
"Kotulski",
"Zbigniew",
""
]
]
| new_dataset | 0.994813 |
cs/0612085 | Roberto Bagnara | Roberto Bagnara, Patricia M. Hill, Enea Zaffanella | The Parma Polyhedra Library: Toward a Complete Set of Numerical
Abstractions for the Analysis and Verification of Hardware and Software
Systems | 38 pages, 2 figures, 3 listings, 3 tables | null | null | Quaderno 457 | cs.MS cs.PL | null | Since its inception as a student project in 2001, initially just for the
handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library
has been continuously improved and extended by joining scrupulous research on
the theoretical foundations of (possibly non-convex) numerical abstractions to
a total adherence to the best available practices in software development. Even
though it is still not fully mature and functionally complete, the Parma
Polyhedra Library already offers a combination of functionality, reliability,
usability and performance that is not matched by similar, freely available
libraries. In this paper, we present the main features of the current version
of the library, emphasizing those that distinguish it from other similar
libraries and those that are important for applications in the field of
analysis and verification of hardware and software systems.
| [
{
"version": "v1",
"created": "Mon, 18 Dec 2006 10:15:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bagnara",
"Roberto",
""
],
[
"Hill",
"Patricia M.",
""
],
[
"Zaffanella",
"Enea",
""
]
]
| new_dataset | 0.998525 |
cs/0612119 | Philippe Saux Picart | Cyril Brunie (LACO), Philippe Saux Picart (LM) | Symmetric Subresultants and Applications | null | null | null | null | cs.SC | null | Schur's transforms of a polynomial are used to count its roots in the unit
disk. These are generalized them by introducing the sequence of symmetric
sub-resultants of two polynomials. Although they do have a determinantal
definition, we show that they satisfy a structure theorem which allows us to
compute them with a type of Euclidean division. As a consequence, a fast
algorithm based on a dichotomic process and FFT is designed. We prove also that
these symmetric sub-resultants have a deep link with Toeplitz matrices.
Finally, we propose a new algorithm of inversion for such matrices. It has the
same cost as those already known, however it is fraction-free and consequently
well adapted to computer algebra.
| [
{
"version": "v1",
"created": "Fri, 22 Dec 2006 08:20:11 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Mar 2007 17:49:55 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Brunie",
"Cyril",
"",
"LACO"
],
[
"Picart",
"Philippe Saux",
"",
"LM"
]
]
| new_dataset | 0.994733 |
cs/0612127 | Mohamed Y. Eltabakh | Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref | bdbms -- A Database Management System for Biological Data | This article is published under a Creative Commons License Agreement
(http://creativecommons.org/licenses/by/2.5/.) You may copy, distribute,
display, and perform the work, make derivative works and make commercial use
of the work, but, you must attribute the work to the author and CIDR 2007.
3rd Biennial Conference on Innovative Data Systems Research (CIDR) January
710, 2007, Asilomar, California, USA | null | null | null | cs.DB | null | Biologists are increasingly using databases for storing and managing their
data. Biological databases typically consist of a mixture of raw data,
metadata, sequences, annotations, and related data obtained from various
sources. Current database technology lacks several functionalities that are
needed by biological databases. In this paper, we introduce bdbms, an
extensible prototype database management system for supporting biological data.
bdbms extends the functionalities of current DBMSs to include: (1) Annotation
and provenance management including storage, indexing, manipulation, and
querying of annotation and provenance as first class objects in bdbms, (2)
Local dependency tracking to track the dependencies and derivations among data
items, (3) Update authorization to support data curation via content-based
authorization, in contrast to identity-based authorization, and (4) New access
methods and their supporting operators that support pattern matching on various
types of compressed biological data types. This paper presents the design of
bdbms along with the techniques proposed to support these functionalities
including an extension to SQL. We also outline some open issues in building
bdbms.
| [
{
"version": "v1",
"created": "Fri, 22 Dec 2006 20:32:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eltabakh",
"Mohamed Y.",
""
],
[
"Ouzzani",
"Mourad",
""
],
[
"Aref",
"Walid G.",
""
]
]
| new_dataset | 0.99817 |
cs/0612129 | Bishwaranjan Bhattacharjee | Bishwaranjan Bhattacharjee, Vuk Ercegovac, Joseph Glider, Richard
Golding, Guy Lohman, Volke Markl, Hamid Pirahesh, Jun Rao, Robert Rees,
Frederick Reiss, Eugene Shekita, Garret Swart | Impliance: A Next Generation Information Management Appliance | This article is published under a Creative Commons License Agreement
(http://creativecommons.org/licenses/by/2.5/.) You may copy, distribute,
display, and perform the work, make derivative works and make commercial use
of the work, but, you must attribute the work to the author and CIDR 2007.
3rd Biennial Conference on Innovative Data Systems Research (CIDR) January
710, 2007, Asilomar, California, USA | null | null | null | cs.DB | null | ably successful in building a large market and adapting to the changes of the
last three decades, its impact on the broader market of information management
is surprisingly limited. If we were to design an information management system
from scratch, based upon today's requirements and hardware capabilities, would
it look anything like today's database systems?" In this paper, we introduce
Impliance, a next-generation information management system consisting of
hardware and software components integrated to form an easy-to-administer
appliance that can store, retrieve, and analyze all types of structured,
semi-structured, and unstructured information. We first summarize the trends
that will shape information management for the foreseeable future. Those trends
imply three major requirements for Impliance: (1) to be able to store, manage,
and uniformly query all data, not just structured records; (2) to be able to
scale out as the volume of this data grows; and (3) to be simple and robust in
operation. We then describe four key ideas that are uniquely combined in
Impliance to address these requirements, namely the ideas of: (a) integrating
software and off-the-shelf hardware into a generic information appliance; (b)
automatically discovering, organizing, and managing all data - unstructured as
well as structured - in a uniform way; (c) achieving scale-out by exploiting
simple, massive parallel processing, and (d) virtualizing compute and storage
resources to unify, simplify, and streamline the management of Impliance.
Impliance is an ambitious, long-term effort to define simpler, more robust, and
more scalable information systems for tomorrow's enterprises.
| [
{
"version": "v1",
"created": "Fri, 22 Dec 2006 20:49:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bhattacharjee",
"Bishwaranjan",
""
],
[
"Ercegovac",
"Vuk",
""
],
[
"Glider",
"Joseph",
""
],
[
"Golding",
"Richard",
""
],
[
"Lohman",
"Guy",
""
],
[
"Markl",
"Volke",
""
],
[
"Pirahesh",
"Hamid",
""
],
[
"Rao",
"Jun",
""
],
[
"Rees",
"Robert",
""
],
[
"Reiss",
"Frederick",
""
],
[
"Shekita",
"Eugene",
""
],
[
"Swart",
"Garret",
""
]
]
| new_dataset | 0.982974 |
cs/0612132 | Lokman Meho | Lokman I. Meho, Kiduk Yang | A New Era in Citation and Bibliometric Analyses: Web of Science, Scopus,
and Google Scholar | 49 pages, accepted for publication in the Journal of the American
Society for Information Science and Technology | null | null | null | cs.DL cs.IR | null | Academic institutions, federal agencies, publishers, editors, authors, and
librarians increasingly rely on citation analysis for making hiring, promotion,
tenure, funding, and/or reviewer and journal evaluation and selection
decisions. The Institute for Scientific Information's (ISI) citation databases
have been used for decades as a starting point and often as the only tools for
locating citations and/or conducting citation analyses. ISI databases (or Web
of Science), however, may no longer be adequate as the only or even the main
sources of citations because new databases and tools that allow citation
searching are now available. Whether these new databases and tools complement
or represent alternatives to Web of Science (WoS) is important to explore.
Using a group of 15 library and information science faculty members as a case
study, this paper examines the effects of using Scopus and Google Scholar (GS)
on the citation counts and rankings of scholars as measured by WoS. The paper
discusses the strengths and weaknesses of WoS, Scopus, and GS, their overlap
and uniqueness, quality and language of the citations, and the implications of
the findings for citation analysis. The project involved citation searching for
approximately 1,100 scholarly works published by the study group and over 200
works by a test group (an additional 10 faculty members). Overall, more than
10,000 citing and purportedly citing documents were examined. WoS data took
about 100 hours of collecting and processing time, Scopus consumed 200 hours,
and GS a grueling 3,000 hours.
| [
{
"version": "v1",
"created": "Sat, 23 Dec 2006 14:47:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Meho",
"Lokman I.",
""
],
[
"Yang",
"Kiduk",
""
]
]
| new_dataset | 0.999015 |
cs/0612139 | Alexander Haubold | Alexander Haubold, John R. Kender | Alignment of Speech to Highly Imperfect Text Transcriptions | null | null | null | null | cs.SD cs.MM | null | We introduce a novel and inexpensive approach for the temporal alignment of
speech to highly imperfect transcripts from automatic speech recognition (ASR).
Transcripts are generated for extended lecture and presentation videos, which
in some cases feature more than 30 speakers with different accents, resulting
in highly varying transcription qualities. In our approach we detect a subset
of phonemes in the speech track, and align them to the sequence of phonemes
extracted from the transcript. We report on the results for 4 speech-transcript
sets ranging from 22 to 108 minutes. The alignment performance is promising,
showing a correct matching of phonemes within 10, 20, 30 second error margins
for more than 60%, 75%, 90% of text, respectively, on average.
| [
{
"version": "v1",
"created": "Thu, 28 Dec 2006 06:45:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Haubold",
"Alexander",
""
],
[
"Kender",
"John R.",
""
]
]
| new_dataset | 0.971643 |
cs/0701045 | Iosif Pinelis | Iosif Pinelis | Polygon Convexity: Another O(n) Test | 14 pages; changes: (i) a test for non-strict convexity is added; (ii)
the proofs are gathered in a separate section; (iii) a more detailed abstract
is given | null | null | null | cs.CG cs.DS | null | An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the
plane. An n-gon \P is said to be convex if the boundary of the convex hull of
the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the
edges [V_0,V_1],...,[V_{n-1},V_0]; if at that no three vertices of \P are
collinear then \P is called strictly convex. We prove that an n-gon \P with
n\ge3 is strictly convex if and only if a cyclic shift of the sequence
(\al_0,...,\al_{n-1})\in[0,2\pi)^n of the angles between the x-axis and the
vectors V_1-V_0,...,V_0-V_{n-1} is strictly monotone. A ``non-strict'' version
of this result is also proved.
| [
{
"version": "v1",
"created": "Mon, 8 Jan 2007 18:51:37 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Jan 2007 22:57:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pinelis",
"Iosif",
""
]
]
| new_dataset | 0.997216 |
cs/0701107 | Wim Vanhoof | Hani Girgis, Bharat Jayaraman | JavaTA: A Logic-based Debugger for Java | Paper presented at the 16th Workshop on Logic-based Methods in
Programming Environments (WLPE2006) | null | null | null | cs.PL | null | This paper presents a logic based approach to debugging Java programs. In
contrast with traditional debugging we propose a debugging methodology for Java
programs using logical queries on individual execution states and also over the
history of execution. These queries were arrived at by a systematic study of
errors in object-oriented programs in our earlier research. We represent the
salient events during the execution of a Java program by a logic database, and
implement the queries as logic programs. Such an approach allows us to answer a
number of useful and interesting queries about a Java program, such as the
calling sequence that results in a certain outcome, the state of an object at a
particular execution point, etc. Our system also provides the ability to
compose new queries during a debugging session. We believe that logic
programming offers a significant contribution to the art of object-oriented
programs debugging.
| [
{
"version": "v1",
"created": "Wed, 17 Jan 2007 13:48:49 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Girgis",
"Hani",
""
],
[
"Jayaraman",
"Bharat",
""
]
]
| new_dataset | 0.993755 |
cs/0701128 | M. V. Panduranga Rao | M. V. Panduranga Rao | Interference Automata | 19 pages. A preliminary version appears under the title "On a Model
of Computation based on Optical Interference" in Proc. of the 16-th
Australasian Workshop on Combinatorial Algorithms (AWOCA'05), pp. 249-261 | null | null | null | cs.CC | null | We propose a computing model, the Two-Way Optical Interference Automata
(2OIA), that makes use of the phenomenon of optical interference. We introduce
this model to investigate the increase in power, in terms of language
recognition, of a classical Deterministic Finite Automaton (DFA) when endowed
with the facility of optical interference. The question is in the spirit of
Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis
and J. Watrous, Two-way Finite Automata With Quantum and Classical States,
Theoretical Computer Science, 287 (1), 299-311, (2002)] wherein the classical
DFA is augmented with a quantum component of constant size. We test the power
of 2OIA against the languages mentioned in the above paper. We give efficient
2OIA algorithms to recognize languages for which 2QCFA machines have been shown
to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as
open questions. Finally we show the existence of a language that cannot be
recognized by a 2OIA but can be recognized by an $O(n^3)$ space Turing machine.
| [
{
"version": "v1",
"created": "Mon, 22 Jan 2007 09:14:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rao",
"M. V. Panduranga",
""
]
]
| new_dataset | 0.998585 |
cs/0701147 | Wim Vanhoof | Michael Hanus | A Generic Analysis Environment for Curry Programs | Paper presented at the 16th Workshop on Logic-based Methods in
Programming Environments | null | null | null | cs.PL | null | We present CurryBrowser, a generic analysis environment for the declarative
multi-paradigm language Curry. CurryBrowser supports browsing through the
program code of an application written in Curry, i.e., the main module and all
directly or indirectly imported modules. Each module can be shown in different
formats (e.g., source code, interface, intermediate code) and, inside each
module, various properties of functions defined in this module can be analyzed.
In order to support the integration of various program analyses, CurryBrowser
has a generic interface to connect local and global analyses implemented in
Curry. CurryBrowser is completely implemented in Curry using libraries for GUI
programming and meta-programming.
| [
{
"version": "v1",
"created": "Wed, 24 Jan 2007 06:55:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hanus",
"Michael",
""
]
]
| new_dataset | 0.991623 |
cs/0701161 | Jim Gray | Jim Gray, Charles Levine | Thousands of DebitCredit Transactions-Per-Second: Easy and Inexpensive | null | null | null | MSR-TR-2005-39 | cs.DB cs.PF | null | A $2k computer can execute about 8k transactions per second. This is 80x more
than one of the largest US bank's 1970's traffic - it approximates the total US
1970's financial transaction volume. Very modest modern computers can easily
solve yesterday's problems.
| [
{
"version": "v1",
"created": "Thu, 25 Jan 2007 23:51:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gray",
"Jim",
""
],
[
"Levine",
"Charles",
""
]
]
| new_dataset | 0.99949 |
cs/0701170 | Jim Gray | Katalin Szlavecz, Andreas Terzis, Stuart Ozer, Razvan Musaloiu-E,
Joshua Cogan, Sam Small, Randal Burns, Jim Gray, Alex Szalay | Life Under Your Feet: An End-to-End Soil Ecology Sensor Network,
Database, Web Server, and Analysis Service | null | null | null | MSR TR 2006 90 | cs.DB cs.CE | null | Wireless sensor networks can revolutionize soil ecology by providing
measurements at temporal and spatial granularities previously impossible. This
paper presents a soil monitoring system we developed and deployed at an urban
forest in Baltimore as a first step towards realizing this vision. Motes in
this network measure and save soil moisture and temperature in situ every
minute. Raw measurements are periodically retrieved by a sensor gateway and
stored in a central database where calibrated versions are derived and stored.
The measurement database is published through Web Services interfaces. In
addition, analysis tools let scientists analyze current and historical data and
help manage the sensor network. The article describes the system design, what
we learned from the deployment, and initial results obtained from the sensors.
The system measures soil factors with unprecedented temporal precision.
However, the deployment required device-level programming, sensor calibration
across space and time, and cross-referencing measurements with external
sources. The database, web server, and data analysis design required
considerable innovation and expertise. So, the ratio of computer-scientists to
ecologists was 3:1. Before sensor networks can fulfill their potential as
instruments that can be easily deployed by scientists, these technical problems
must be addressed so that the ratio is one nerd per ten ecologists.
| [
{
"version": "v1",
"created": "Fri, 26 Jan 2007 05:08:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Szlavecz",
"Katalin",
""
],
[
"Terzis",
"Andreas",
""
],
[
"Ozer",
"Stuart",
""
],
[
"Musaloiu-E",
"Razvan",
""
],
[
"Cogan",
"Joshua",
""
],
[
"Small",
"Sam",
""
],
[
"Burns",
"Randal",
""
],
[
"Gray",
"Jim",
""
],
[
"Szalay",
"Alex",
""
]
]
| new_dataset | 0.998384 |
cs/0701173 | Jim Gray | Vik Singh, Jim Gray, Ani Thakar, Alexander S. Szalay, Jordan Raddick,
Bill Boroski, Svetlana Lebedeva, Brian Yanny | SkyServer Traffic Report - The First Five Years | null | null | null | MSR TR-2006-190 | cs.DB cs.CE | null | The SkyServer is an Internet portal to the Sloan Digital Sky Survey Catalog
Archive Server. From 2001 to 2006, there were a million visitors in 3 million
sessions generating 170 million Web hits, 16 million ad-hoc SQL queries, and 62
million page views. The site currently averages 35 thousand visitors and 400
thousand sessions per month. The Web and SQL logs are public. We analyzed
traffic and sessions by duration, usage pattern, data product, and client type
(mortal or bot) over time. The analysis shows (1) the site's popularity, (2)
the educational website that delivered nearly fifty thousand hours of
interactive instruction, (3) the relative use of interactive, programmatic, and
batch-local access, (4) the success of offering ad-hoc SQL, personal database,
and batch job access to scientists as part of the data publication, (5) the
continuing interest in "old" datasets, (6) the usage of SQL constructs, and (7)
a novel approach of using the corpus of correct SQL queries to suggest similar
but correct statements when a user presents an incorrect SQL statement.
| [
{
"version": "v1",
"created": "Fri, 26 Jan 2007 05:22:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Singh",
"Vik",
""
],
[
"Gray",
"Jim",
""
],
[
"Thakar",
"Ani",
""
],
[
"Szalay",
"Alexander S.",
""
],
[
"Raddick",
"Jordan",
""
],
[
"Boroski",
"Bill",
""
],
[
"Lebedeva",
"Svetlana",
""
],
[
"Yanny",
"Brian",
""
]
]
| new_dataset | 0.984389 |
cs/0702010 | Jacques Carette | Jacques Carette | A canonical form for some piecewise defined functions | submitted to ISSAC 2007 | null | null | null | cs.SC cs.MS | null | We define a canonical form for piecewise defined functions. We show that this
has a wider range of application as well as better complexity properties than
previous work.
| [
{
"version": "v1",
"created": "Thu, 1 Feb 2007 17:54:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Carette",
"Jacques",
""
]
]
| new_dataset | 0.990617 |
cs/0702022 | Changjia Chen | Chunxi Li and Changjia Chen | Gnutella: Topology Dynamics On Phase Space | 11 pages, 14 figures | null | null | null | cs.NI | null | In this paper, the topology dynamic of Gnutella is studied through phase
space. The dynamic changes in peer degree are studied as a time series in two
dimensional phase space which is defined as the number of connected leaves and
the number of connected ultras. The reported degrees are concentrated in three
special Software related regions that we named as Ultra Stable Region, Leaf
Stable Region and Transition Belt. A method is proposed to classify degree
traces in phase space into different classes. Connection churn then is studied
along with the churn in degree. It shows that the topological structure of
Gnutella is rather stable in its connection degree but not the topology itself.
The connection drop rate is estimated and the live time of connections is
inferred afterwards. M/M/m/m loss queue system is introduced to model the
degree keeping process in Gnutella. This model revealed that the degree stable
is ensured by large new connection efforts. In other words the stable in
topological structure of Gnutella is a results of essential unstable in its
topology. That opens a challenge to the basic design philosophy of this
network.
| [
{
"version": "v1",
"created": "Sun, 4 Feb 2007 08:12:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Chunxi",
""
],
[
"Chen",
"Changjia",
""
]
]
| new_dataset | 0.996723 |
cs/0702034 | Rama Raghavan | L.Jeganathan and R.Rama | Graph Splicing System | 13 pages,5 figures | null | null | null | cs.DM | null | The string splicing was introduced by Tom Head which stands as an abstract
model for the DNA recombination under the influence of restriction enzymes. The
complex chemical process of three dimensional molecules in three dimensional
space can be modeled using graphs. The graph splicing systems which were
studied so far, can only be applied to a particular type of graphs which could
be interpreted as linear or circular graphs. In this paper, we take a different
and a novel approach to splice two graphs and introduce a splicing system for
graphs that can be applied to all types of graphs. Splicing two graphs can be
thought of as a new operation, among the graphs, that generates many new graphs
from the given two graphs. Taking a different line of thinking, some of the
graph theoretical results of the splicing are studied.
| [
{
"version": "v1",
"created": "Tue, 6 Feb 2007 05:46:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jeganathan",
"L.",
""
],
[
"Rama",
"R.",
""
]
]
| new_dataset | 0.989162 |
cs/0702039 | Xavier Goaoc | Otfried Cheong, Xavier Goaoc (INRIA Lorraine - LORIA), Andreas
Holmsen, Sylvain Petitjean (INRIA Lorraine - LORIA) | Hadwiger and Helly-type theorems for disjoint unit spheres | null | Discrete and Computational Geometry (2006) | null | null | cs.CG | null | We prove Helly-type theorems for line transversals to disjoint unit balls in
$\R^{d}$. In particular, we show that a family of $n \geq 2d$ disjoint unit
balls in $\R^d$ has a line transversal if, for some ordering $\prec$ of the
balls, any subfamily of 2d balls admits a line transversal consistent with
$\prec$. We also prove that a family of $n \geq 4d-1$ disjoint unit balls in
$\R^d$ admits a line transversal if any subfamily of size $4d-1$ admits a
transversal.
| [
{
"version": "v1",
"created": "Wed, 7 Feb 2007 08:29:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cheong",
"Otfried",
"",
"INRIA Lorraine - LORIA"
],
[
"Goaoc",
"Xavier",
"",
"INRIA Lorraine - LORIA"
],
[
"Holmsen",
"Andreas",
"",
"INRIA Lorraine - LORIA"
],
[
"Petitjean",
"Sylvain",
"",
"INRIA Lorraine - LORIA"
]
]
| new_dataset | 0.974633 |
cs/0702054 | Christoph Durr | Christoph Durr and Nguyen Kim Thang | Nash equilibria in Voronoi games on graphs | null | null | null | null | cs.GT cs.DS | null | In this paper we study a game where every player is to choose a vertex
(facility) in a given undirected graph. All vertices (customers) are then
assigned to closest facilities and a player's payoff is the number of customers
assigned to it. We show that deciding the existence of a Nash equilibrium for a
given graph is NP-hard which to our knowledge is the first result of this kind
for a zero-sum game. We also introduce a new measure, the social cost
discrepancy, defined as the ratio of the costs between the worst and the best
Nash equilibria. We show that the social cost discrepancy in our game is
Omega(sqrt(n/k)) and O(sqrt(kn)), where n is the number of vertices and k the
number of players.
| [
{
"version": "v1",
"created": "Fri, 9 Feb 2007 12:12:17 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Apr 2007 14:11:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Durr",
"Christoph",
""
],
[
"Thang",
"Nguyen Kim",
""
]
]
| new_dataset | 0.984875 |
cs/0702074 | Xavier P\'erez-Gim\'enez | Josep Diaz, Dieter Mitsche, Xavier Perez | Dynamic Random Geometric Graphs | null | null | null | null | cs.DM | null | In this work we introduce Dynamic Random Geometric Graphs as a basic rough
model for mobile wireless sensor networks, where communication distances are
set to the known threshold for connectivity of static random geometric graphs.
We provide precise asymptotic results for the expected length of the
connectivity and disconnectivity periods of the network. We believe the formal
tools developed in this work could be of use in future studies in more concrete
settings. In addition, for static random geometric graphs at the threshold for
connectivity, we provide asymptotic expressions on the probability of existence
of components according to their sizes.
| [
{
"version": "v1",
"created": "Tue, 13 Feb 2007 09:00:34 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2007 09:15:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Diaz",
"Josep",
""
],
[
"Mitsche",
"Dieter",
""
],
[
"Perez",
"Xavier",
""
]
]
| new_dataset | 0.99738 |
cs/0702081 | Rick Dale | Rick Dale | Random Sentences from a Generalized Phrase-Structure Grammar Interpreter | Brief paper with source code and examples | null | null | null | cs.CL | null | In numerous domains in cognitive science it is often useful to have a source
for randomly generated corpora. These corpora may serve as a foundation for
artificial stimuli in a learning experiment (e.g., Ellefson & Christiansen,
2000), or as input into computational models (e.g., Christiansen & Dale, 2001).
The following compact and general C program interprets a phrase-structure
grammar specified in a text file. It follows parameters set at a Unix or
Unix-based command-line and generates a corpus of random sentences from that
grammar.
| [
{
"version": "v1",
"created": "Wed, 14 Feb 2007 06:05:20 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dale",
"Rick",
""
]
]
| new_dataset | 0.997787 |
cs/0702094 | Marko Horvat B.Sc.CS-Dipl.Ing. | Darko Fuduric, Marko Horvat and Mario Zagar | Authentication via wireless networks | 5 pages, 6 figures, 1 table, MIPRO Conference in Opatija, Croatia,
2006 | MIPRO, 2006 | null | null | cs.OH | null | Personal authentication is an important process we encounter almost every
day; when we are logging on a computer, entering a company where we work, or a
restricted area, when we are using our plastic credit cards to pay for a
service or to complete some other financial transaction, etc. In each of these
processes of personal authentication some kind of magnetic or optical token is
required. But by using novel technologies like mobile computing and wireless
networking, it is possible to avoid carrying multitude of ID cards or
remembering a number of PIN codes. Article shows how to efficiently
authenticate users via Personal Area Networks (PAN) like Bluetooth or IrDA
using commonplace AES (Rijndel) or MD5 encryption. This method can be
implemented on many types of mobile devices like Pocket PC PDA with Windows CE
(Windows Mobile 2003) real-time operating system, or any other customized OS,
so we will explain all components and key features of such basic system.
| [
{
"version": "v1",
"created": "Fri, 16 Feb 2007 16:46:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Fuduric",
"Darko",
""
],
[
"Horvat",
"Marko",
""
],
[
"Zagar",
"Mario",
""
]
]
| new_dataset | 0.998305 |
cs/0702107 | Charles Robert | Charles A. Robert (LORIA) | AMIEDoT: An annotation model for document tracking and recommendation
service | null | Dans International Joint Conferences on Computer, Information, and
Systems Sciences, and Engineering, (CIS2E 06) (2007) | null | null | cs.IR | null | The primary objective of document annotation in whatever form, manual or
electronic is to allow those who may not have control to original document to
provide personal view on information source. Beyond providing personal
assessment to original information sources, we are looking at a situation where
annotation made can be used as additional source of information for document
tracking and recommendation service. Most of the annotation tools existing
today were conceived for their independent use with no reference to the creator
of the annotation. We propose AMIEDoT (Annotation Model for Information
Exchange and Document Tracking) an annotation model that can assist in document
tracking and recommendation service. The model is based on three parameters in
the acts of annotation. We believe that introducing document parameters, time
and the parameters of the creator of annotation into an annotation process can
be a dependable source to know, who used a document, when a document was used
and for what a document was used for. Beyond document tracking, our model can
be used in not only for selective dissemination of information but for
recommendation services. AMIEDoT can also be used for information sharing and
information reuse.
| [
{
"version": "v1",
"created": "Mon, 19 Feb 2007 15:18:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Robert",
"Charles A.",
"",
"LORIA"
]
]
| new_dataset | 0.983467 |
cs/0702137 | Slavcho Shtrakov | Slavcho Shtrakov | Tree Automata and Essential Subtrees | 9 pages, 2 figures, Sixth International Conference on Discrete
Mathematics and Applications, Bansko, 2001 | Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 51-60 p | null | null | cs.CC cs.DM | null | We introduce essential subtrees for terms (trees) and tree automata . There
are some results concerning independent sets of subtrees and separable sets for
a tree and an automaton.
| [
{
"version": "v1",
"created": "Fri, 23 Feb 2007 13:20:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Shtrakov",
"Slavcho",
""
]
]
| new_dataset | 0.974679 |
cs/0702153 | Kyle Burke | Kyle Burke and Shang-Hua Teng | Games on the Sperner Triangle | 18 pages, 19 figures. Uses paithan.sty | null | null | null | cs.GT cs.CC | null | We create a new two-player game on the Sperner Triangle based on Sperner's
lemma. Our game has simple rules and several desirable properties. First, the
game is always certain to have a winner. Second, like many other interesting
games such as Hex and Geography, we prove that deciding whether one can win our
game is a PSPACE-complete problem. Third, there is an elegant balance in the
game such that neither the first nor the second player always has a decisive
advantage. We provide a web-based version of the game, playable at:
http://cs-people.bu.edu/paithan/spernerGame/ . In addition we propose other
games, also based on fixed-point theorems.
| [
{
"version": "v1",
"created": "Mon, 26 Feb 2007 05:00:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Burke",
"Kyle",
""
],
[
"Teng",
"Shang-Hua",
""
]
]
| new_dataset | 0.99945 |
cs/0703044 | Samuel Thibault | Samuel Thibault (INRIA Futurs), Sebastien Hinderer (INRIA Lorraine -
LORIA) | BrlAPI: Simple, Portable, Concurrent, Application-level Control of
Braille Terminals | null | Dans International Conference on Information and Communication
Technology Accessibility (ICTA) (2007) | null | null | cs.HC | null | Screen readers can drive braille devices for allowing visually impaired users
to access computer environments, by providing them the same information as
sighted users. But in some cases, this view is not easy to use on a braille
device. In such cases, it would be much more useful to let applications provide
their own braille feedback, specially adapted to visually impaired users. Such
applications would then need the ability to output braille ; however, allowing
both screen readers and applications access a wide panel of braille devices is
not a trivial task. We present an abstraction layer that applications may use
to communicate with braille devices. They do not need to deal with the
specificities of each device, but can do so if necessary. We show how several
applications can communicate with one braille device concurrently, with BrlAPI
making sensible choices about which application eventually gets access to the
device. The description of a widely used implementation of BrlAPI is included.
| [
{
"version": "v1",
"created": "Fri, 9 Mar 2007 16:55:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thibault",
"Samuel",
"",
"INRIA Futurs"
],
[
"Hinderer",
"Sebastien",
"",
"INRIA Lorraine -\n LORIA"
]
]
| new_dataset | 0.999338 |
cs/0703067 | Stephen Smith | Stephen L. Smith, Francesco Bullo | Target assignment for robotic networks: asymptotic performance under
limited communication | 2007 ACC paper including proofs; Corrected typos | null | null | null | cs.RO | null | We are given an equal number of mobile robotic agents, and distinct target
locations. Each agent has simple integrator dynamics, a limited communication
range, and knowledge of the position of every target. We address the problem of
designing a distributed algorithm that allows the group of agents to divide the
targets among themselves and, simultaneously, leads each agent to reach its
unique target. We do not require connectivity of the communication graph at any
time. We introduce a novel assignment-based algorithm with the following
features: initial assignments and robot motions follow a greedy rule, and
distributed refinements of the assignment exploit an implicit circular ordering
of the targets. We prove correctness of the algorithm, and give worst-case
asymptotic bounds on the time to complete the assignment as the environment
grows with the number of agents. We show that among a certain class of
distributed algorithms, our algorithm is asymptotically optimal. The analysis
utilizes results on the Euclidean traveling salesperson problem.
| [
{
"version": "v1",
"created": "Wed, 14 Mar 2007 19:20:45 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Mar 2007 19:57:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Smith",
"Stephen L.",
""
],
[
"Bullo",
"Francesco",
""
]
]
| new_dataset | 0.990694 |
cs/0703108 | Sourav Dhar | Sourav Dhar, Rabindranath Bera, K.Mal | Wireless Lan to Support Multimedia Communication Using Spread Spectrum
Technology | URSI 0ctober 22-29 2005, 4pages, 6 figures | null | null | null | cs.NI | null | Wireless LAN is currently enjoying rapid deployment in University
departments, business offices, hospitals and homes. It becomes an inexpensive
technology and allows multiple numbers of the households to simultaneously
access the internet while roaming about the house. In the present work, the
design and development of a wireless LAN is highlighted which utilizes direct
sequence spread spectrum (DSSS) technology at 900MHz RF carrier frequency in
its physical layer. This provides enormous security in the physical layer and
hence it is very difficult to hack or jam the network. The installation cost is
also less due to the use of 900 MHz RF carrier frequency..
| [
{
"version": "v1",
"created": "Thu, 22 Mar 2007 11:07:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dhar",
"Sourav",
""
],
[
"Bera",
"Rabindranath",
""
],
[
"Mal",
"K.",
""
]
]
| new_dataset | 0.998917 |
cs/0703112 | Bharath Ramesh | Bharath Ramesh and Srinidhi Varadarajan | User-level DSM System for Modern High-Performance Interconnection
Networks | 6 pages, 5 figures | null | null | null | cs.DC | null | In this paper, we introduce a new user-level DSM system which has the ability
to directly interact with underlying interconnection networks. The DSM system
provides the application programmer a flexible API to program parallel
applications either using shared memory semantics over physically distributed
memory or to use an efficient remote memory demand paging technique. We also
introduce a new time slice based memory consistency protocol which is used by
the DSM system. We present preliminary results from our implementation on a
small Opteron Linux cluster interconnected over Myrinet.
| [
{
"version": "v1",
"created": "Thu, 22 Mar 2007 19:15:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ramesh",
"Bharath",
""
],
[
"Varadarajan",
"Srinidhi",
""
]
]
| new_dataset | 0.968898 |
cs/0703152 | Ugo Dal Lago | Ugo Dal Lago, Andrea Masini, Margherita Zorzi | Quantum Lambda Calculi with Classical Control: Syntax and Expressive
Power | 25 pages | null | null | null | cs.LO | null | We study an untyped lambda calculus with quantum data and classical control.
This work stems from previous proposals by Selinger and Valiron and by Van
Tonder. We focus on syntax and expressiveness, rather than (denotational)
semantics. We prove subject reduction, confluence and a standardization
theorem. Moreover, we prove the computational equivalence of the proposed
calculus with a suitable class of quantum circuit families.
| [
{
"version": "v1",
"created": "Fri, 30 Mar 2007 08:59:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lago",
"Ugo Dal",
""
],
[
"Masini",
"Andrea",
""
],
[
"Zorzi",
"Margherita",
""
]
]
| new_dataset | 0.980639 |
cs/0703153 | Maurice Margenstern | Maurice Margenstern | The periodic domino problem is undecidable in the hyperbolic plane | null | null | null | null | cs.CG cs.DM | null | In this paper, we consider the periodic tiling problem which was proved
undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov in 1972.
Here, we prove that the same problem for the hyperbolic plane is also
undecidable.
| [
{
"version": "v1",
"created": "Fri, 30 Mar 2007 09:31:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Margenstern",
"Maurice",
""
]
]
| new_dataset | 0.960256 |
cs/0703155 | Amey Karkare | Amey Karkare, Uday Khedker, Amitabha Sanyal | Liveness of Heap Data for Functional Programs | Accepted at Heap Analysis and Verification workshop (HAV 2007), a
satellite workshop of ETAPS 2007 (No formal proceedings for workshop); 15
pages | null | null | null | cs.PL | null | Functional programming languages use garbage collection for heap memory
management. Ideally, garbage collectors should reclaim all objects that are
dead at the time of garbage collection. An object is dead at an execution
instant if it is not used in future. Garbage collectors collect only those dead
objects that are not reachable from any program variable. This is because they
are not able to distinguish between reachable objects that are dead and
reachable objects that are live.
In this paper, we describe a static analysis to discover reachable dead
objects in programs written in first-order, eager functional programming
languages. The results of this technique can be used to make reachable dead
objects unreachable, thereby allowing garbage collectors to reclaim more dead
objects.
| [
{
"version": "v1",
"created": "Fri, 30 Mar 2007 16:06:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Karkare",
"Amey",
""
],
[
"Khedker",
"Uday",
""
],
[
"Sanyal",
"Amitabha",
""
]
]
| new_dataset | 0.992383 |
cs/9809004 | Jim Gray | Jim Gray, Joshua Coates, Chris Nyberg | Performance / Price Sort | Original word file at:
http://research.microsoft.com/~gray/PennySort.doc | null | null | null | cs.DB cs.PF | null | NTsort is an external sort on WindowsNT 5.0. It has minimal functionality but
excellent price performance. In particular, running on mail-order hardware it
can sort 1.5 GB for a penny. For commercially available sorts, Postman Sort
from Robert Ramey Software Development has elapsed time performance comparable
to NTsort, while using less processor time. It can sort 1.27 GB for a penny
(12.7 million records.) These sorts set new price-performance records. This
paper documents this and proposes that the PennySort benchmark be revised to
Performance/Price sort: a simple GB/$ sort metric based on a two-pass external
sort.
| [
{
"version": "v1",
"created": "Wed, 2 Sep 1998 00:49:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gray",
"Jim",
""
],
[
"Coates",
"Joshua",
""
],
[
"Nyberg",
"Chris",
""
]
]
| new_dataset | 0.999573 |
cs/9809010 | Jim Gray | C. Gordon Bell, Jim Gray | The Revolution Yet to Happen | Original document at:
http://research.microsoft.com/~gray/Revolution.doc | null | null | Microsoft Technical report: MSR-TR-98-45 | cs.GL | null | All information about physical objects including humans, buildings,
processes, and organizations will be online. This trend is both desirable and
inevitable. Cyberspace will provide the basis for wonderful new ways to inform,
entertain, and educate people. The information and the corresponding systems
will streamline commerce, but will also provide new levels of personal service,
health care, and automation. The most significant benefit will be a
breakthrough in our ability to remotely communicate with one another using all
our senses.
The ACM and the transistor were born in 1947. At that time the stored program
computer was a revolutionary idea and the transistor was just a curiosity. Both
ideas evolved rapidly. By the mid 1960s integrated circuits appeared --
allowing mass fabrication of transistors on silicon substrates. This allowed
low-cost mass-produced computers. These technologies enabled extraordinary
increases in processing speed and memory coupled with extraordinary price
declines.
The only form of processing and memory more easily, cheaply, and rapidly
fabricated is the human brain. Peter Cohrane (1996) estimates the brain to have
a processing power of around 1000 million-million operations per second, (one
Petaops) and a memory of 10 Terabytes. If current trends continue, computers
could have these capabilities by 2047. Such computers could be 'on body'
personal assistants able to recall everything one reads, hears, and sees.
| [
{
"version": "v1",
"created": "Wed, 2 Sep 1998 19:39:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bell",
"C. Gordon",
""
],
[
"Gray",
"Jim",
""
]
]
| new_dataset | 0.999144 |
cs/9809021 | Frantz Vichot | Francis Wolinski, Frantz Vichot, Olivier Gremont (Informatique
CDC/DTA, Arcueil, France) | Producing NLP-based On-line Contentware | 7 pages, 5 figures | Natural Language Processing & Industrial Applications, Moncton,
NB, Canada, Aug. 1998 | null | null | cs.CL cs.AR | null | For its internal needs as well as for commercial purposes, CDC Group has
produced several NLP-based on-line contentware applications for years. The
development process of such applications is subject to numerous constraints
such as quality of service, integration of new advances in NLP, direct
reactions from users, continuous versioning, short delivery deadlines and cost
control. Following this industrial and commercial experience, malleability of
the applications, their openness towards foreign components, efficiency of
applications and their ease of exploitation have appeared to be key points. In
this paper, we describe TalLab, a powerful architecture for on-line contentware
which fulfils these requirements.
| [
{
"version": "v1",
"created": "Wed, 16 Sep 1998 14:22:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wolinski",
"Francis",
"",
"Informatique\n CDC/DTA, Arcueil, France"
],
[
"Vichot",
"Frantz",
"",
"Informatique\n CDC/DTA, Arcueil, France"
],
[
"Gremont",
"Olivier",
"",
"Informatique\n CDC/DTA, Arcueil, France"
]
]
| new_dataset | 0.961884 |
cs/9809045 | Chunlei Liu | Shivkumar Kalyanaraman, Bobby Vandalore, Raj Jain, Rohit Goyal, Sonia
Fahmy, Seong-Cheol Kim, Sastri Kota | Performance of TCP over ABR with Long-Range Dependent VBR Background
Traffic over Terrestrial and Satellite ATM networks | Proceedings of LCN `98 | null | null | null | cs.NI | null | Compressed video is well known to be self-similar in nature. We model VBR
carrying Long-Range Dependent (LRD), multiplexed MPEG-2 video sources. The
actual traffic for the model is generated using fast-fourier transform of
generate the fractional gaussian noise (FGN) sequence. Our model of compressed
video sources bears similarity to an MPEG-2 Transport Stream carrying video,
i.e., it is long-range dependent and generates traffic in a piecewise-CBR
fashion. We study the effect of such VBR traffic on ABR carrying TCP traffic.
The effect of such VBR traffic is that the ABR capacity is highly variant. We
find that a switch algorithm like ERICA+ can tolerate this variance in ABR
capacity while maintaining high throughput and low delay. We present simulation
results for terrestrial and satellite configurations.
| [
{
"version": "v1",
"created": "Wed, 23 Sep 1998 01:40:13 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kalyanaraman",
"Shivkumar",
""
],
[
"Vandalore",
"Bobby",
""
],
[
"Jain",
"Raj",
""
],
[
"Goyal",
"Rohit",
""
],
[
"Fahmy",
"Sonia",
""
],
[
"Kim",
"Seong-Cheol",
""
],
[
"Kota",
"Sastri",
""
]
]
| new_dataset | 0.975188 |
cs/9809058 | Chunlei Liu | Raj Jain, Shiv Kalyanaraman and Ram Viswanathan | The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt
and Extensions | null | null | null | null | cs.NI | null | The OSU scheme is a rate-based congestion avoidance scheme for ATM networks
using explicit rate indication. This work was one of the first attempts to
define explicit rate switch mechanisms and the Resource Management (RM) cell
format in Asynchronous Transfer Mode (ATM) networks. The key features of the
scheme include explicit rate feedback, congestion avoidance, fair operation
while maintaining high utilization, use of input rate as a congestion metric,
O(1) complexity. This paper presents an overview of the scheme, presents those
features of the scheme that have now become common features of other switch
algorithms and discusses three extensions of the scheme.
| [
{
"version": "v1",
"created": "Wed, 23 Sep 1998 15:09:56 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jain",
"Raj",
""
],
[
"Kalyanaraman",
"Shiv",
""
],
[
"Viswanathan",
"Ram",
""
]
]
| new_dataset | 0.986287 |
cs/9809059 | Chunlei Liu | Shivkumar Kalyanaraman, Raj Jain, Sonia Fahmy, Rohit Goyal, and Bobby
Vandalore | The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks | null | null | null | null | cs.NI | null | We propose an explicit rate indication scheme for congestion avoidance in ATM
networks. In this scheme, the network switches monitor their load on each link,
determining a load factor, the available capacity, and the number of currently
active virtual channels. This information is used to advise the sources about
the rates at which they should transmit. The algorithm is designed to achieve
efficiency, fairness, controlled queueing delays, and fast transient response.
The algorithm is also robust to measurement errors caused due to variation in
ABR demand and capacity. We present performance analysis of the scheme using
both analytical arguments and simulation results. The scheme is being
implemented by several ATM switch manufacturers.
| [
{
"version": "v1",
"created": "Wed, 23 Sep 1998 15:18:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kalyanaraman",
"Shivkumar",
""
],
[
"Jain",
"Raj",
""
],
[
"Fahmy",
"Sonia",
""
],
[
"Goyal",
"Rohit",
""
],
[
"Vandalore",
"Bobby",
""
]
]
| new_dataset | 0.989563 |
cs/9809072 | Chunlei Liu | Shiv Kalyanaraman, Raj Jain, Sonia Fahmy, Rohit Goyal, Jianping Jiang
and Seong-Cheol Kim | Performance of TCP over ABR on ATM backbone and with various VBR traffic
patterns | ICC'97, Montreal, June 1997 | null | null | null | cs.NI | null | We extend our earlier studies of buffer requirements of TCP over ABR in two
directions. First, we study the performance of TCP over ABR in an ATM backbone.
On the backbone, the TCP queues are at the edge router and not inside the ATM
network. The router requires buffer equal to the sum of the receiver window
sizes of the participating TCP connections. Second, we introduce various
patterns of VBR background traffic. The VBR background introduces variance in
the ABR capacity and the TCP traffic introduces variance in the ABR demand.
Some simple switch schemes are unable to keep up with the combined effect of
highly varying demands and highly varying ABR capacity. We present our
experiences with refining the ERICA+ switch scheme to handle these conditions.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 03:15:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kalyanaraman",
"Shiv",
""
],
[
"Jain",
"Raj",
""
],
[
"Fahmy",
"Sonia",
""
],
[
"Goyal",
"Rohit",
""
],
[
"Jiang",
"Jianping",
""
],
[
"Kim",
"Seong-Cheol",
""
]
]
| new_dataset | 0.99813 |
cs/9809080 | Chunlei Liu | Raj Jain, Shiv Kalyanaraman, Ram Viswanathan | The OSU Scheme for Congestion Avoidance in ATM networks Using Explicit
Rate Indication | Proceedings WATM'95 First Workshop on ATM Traffic Management, Paris,
December 1995 (proceedings also to appear in book form) | null | null | null | cs.NI | null | An explicit rate indication scheme for congestion avoidance in computer and
telecommunication networks is proposed. The sources monitor their load and
provide the information periodically to the switches. The switches, in turn,
compute the load level and ask the sources to adjust their rates up or down.
The scheme achieves high link utilization, fair allocation of rates among
contending sources and provides quick convergence. A backward congestion
notification option is also provided. The conditions under which this option is
useful are indicated.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 03:44:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jain",
"Raj",
""
],
[
"Kalyanaraman",
"Shiv",
""
],
[
"Viswanathan",
"Ram",
""
]
]
| new_dataset | 0.988618 |
cs/9809088 | Chunlei Liu | R. Jain | Myths about Congestion Management in High Speed Networks | null | Internetworking: Research and Experience, Volume 3, 1992, pp.
101-113 | null | null | cs.NI | null | Weaknesses in several recently proposed ideas about congestion control and
avoidance in high-speed netwroks are identified. Both sides of the debate
concerning prior reservation of resources versus walk-in service, open-loop
control versus feedback control, rate control versus window control, and
router-based control versus source-based control are presented. The
circumstances under which backpressure is useful or not are discussed, and it
is argued that a single congestion scheme is not sufficient, but that a
combination of several schemes is required for complete congestion management
in a network.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 04:48:52 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jain",
"R.",
""
]
]
| new_dataset | 0.985349 |
cs/9809094 | Chunlei Liu | R. Jain, K. Ramakrishnan, D. Chiu | Congestion Avoidance in Computer Networks with a Connectionless Network
Layer | DEC-TR-506, reprinted in C. Partridge, Ed., "Innovations in
Internetworking," published by Artech House, October 1988 | null | null | null | cs.NI | null | Widespread use of computer networks and the use of varied technology for the
interconnection of computers has made congestion a significant problem.
In this report, we summarize our research on congestion avoidance. We compare
the concept of congestion avoidance with that of congestion control.
Briefly, congestion control is a recovery mechanism, while congestion
avoidance is a prevention mechanism. A congestion control scheme helps the
network to recover from the congestion state while a congestion avoidance
scheme allows a network to operate in the region of low delay and high
throughput with minimal queuing, thereby preventing it from entering the
congested state in which packets are lost due to buffer shortage.
A number of possible alternatives for congestion avoidance were identified.
From these alternatives we selected one called the binary feedback scheme in
which the network uses a single bit in the network layer header to feed back
the congestion information to its users, which then increase or decrease their
load to make optimal use of the resources. The concept of global optimality in
a distributed system is defined in terms of efficiency and fairness such that
they can be independently quantified and apply to any number of resources and
users.
The proposed scheme has been simulated and shown to be globally efficient,
fair, responsive, convergent, robust, distributed, and
configuration-independent.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 05:05:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jain",
"R.",
""
],
[
"Ramakrishnan",
"K.",
""
],
[
"Chiu",
"D.",
""
]
]
| new_dataset | 0.995259 |
cs/9809095 | Chunlei Liu | R. Jain, K. Ramakrishnan | Congestion Avoidance in Computer Networks with a Connectionless Network
Layer, Part I: Concepts, Goals and Methodology | roc. Computer Networking Symposium, Washington, D.C., April 11-13,
1988, pp. 134-143 | null | null | null | cs.NI | null | Congestion is said to occur in the network when the resource demands exceed
the capacity and packets are lost due to too much queuing in the network.
During congestion, the network throughput may drop to zero and the path delay
may become very high. A congestion control scheme helps the network to recover
from the congestion state. A congestion avoidance scheme allows a network to
operate in the region of low delay and high throughput. Such schemes prevent a
network from entering the congested state. Congestion avoidance is a prevention
mechanism while congestion control is a recovery mechanism. We compare the
concept of congestion avoidance with that of flow control and congestion
control. A number of possible alternative for congestion avoidance have been
identified. From these a few were selected for study. The criteria for
selection and goals for these schemes have been described. In particular, we
wanted the scheme to be globally efficient, fair, dynamic, convergent, robust,
distributed, configuration independent, etc. These goals and the test cases
used to verify whether a particular scheme has met the goals have been
described. We model the network and the user policies for congestion avoidance
as a feedback control system. The key components of a generic congestion
avoidance scheme are: congestion detection, congestion feedback, feedback
selector, signal filter, decision function, and increase/decrease algorithms.
These components have been explained.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 05:10:41 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jain",
"R.",
""
],
[
"Ramakrishnan",
"K.",
""
]
]
| new_dataset | 0.996273 |
cs/9809098 | Chunlei Liu | R. Jain | On Caching out-of-order packets in window flow controlled networks | DEC Technical Report DEC-TR-342, January 1985 | null | null | DEC-TR-342 | cs.NI | null | In window flow controlled networks, if a packet is lost the destination has
to decide whether to save (cache) subsequent out-of-order packets. Also, the
source has to decide whether to send just one packet or to send all packets
following it. This leads to four different types of caching schemes.
Simulations show, against our immediate intuition, that regardless of whether
the destination is caching or not, the source should retransmit only one
packet. This paper describes the alternatives to, and provides justification
for, schemes used in Digital Network Architecture and ARPAnet TCP.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 05:23:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jain",
"R.",
""
]
]
| new_dataset | 0.985241 |
cs/9809105 | Thomas Lippert | Thomas Lippert, Nikolay Petkov, Paolo Palazzari, and Klaus Schilling | Hyper-Systolic Matrix Multiplication | 29 pages, 13 figures | null | null | HLRZ1998-59 | cs.MS | null | A novel parallel algorithm for matrix multiplication is presented. The
hyper-systolic algorithm makes use of a one-dimensional processor abstraction.
The procedure can be implemented on all types of parallel systems. It can
handle matrix-vector multiplications as well as transposed matrix products.
| [
{
"version": "v1",
"created": "Thu, 24 Sep 1998 20:56:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lippert",
"Thomas",
""
],
[
"Petkov",
"Nikolay",
""
],
[
"Palazzari",
"Paolo",
""
],
[
"Schilling",
"Klaus",
""
]
]
| new_dataset | 0.998899 |
cs/9810004 | James P. Cohoon | Bruce R. Childers, James P. Cohoon, Jack W. Davidson, Peter Valle | The Design of EzWindows: A Graphics API for an Introductory Programming
Course | 5 pages, 5 figures, conference submission | null | null | null | cs.CY cs.GR | null | Teaching object-oriented programming in an introductory programming course
poses considerable challenges to the instructor. An often advocated approach to
meeting this challenge is the use of a simple, object-oriented graphics
library. We have developed a simple, portable graphics library for teaching
object-oriented programming using C++. The library, EzWindows, allows beginning
programmers to design and write programs that use the graphical display found
on all modern desktop computers. In addition to providing simple graphical
objects such as windows, geometric shapes, and bitmaps, EzWindows provides
facilities for introducing event-based programming using the mouse and timers.
EzWindows has proven to be extremely popular; it is currently in use at over
200 universities, colleges, and high schools. This paper describes the
rationale for EzWindows and its high-level design.
| [
{
"version": "v1",
"created": "Sat, 3 Oct 1998 12:04:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Childers",
"Bruce R.",
""
],
[
"Cohoon",
"James P.",
""
],
[
"Davidson",
"Jack W.",
""
],
[
"Valle",
"Peter",
""
]
]
| new_dataset | 0.997209 |
cs/9810006 | Kersten Barney | Nick McKeown (Stanford University), Martin Izzard (Texas Instruments),
Adisak Mekkittikul (Stanford University), Bill Ellersick (Stanford
University) and Mark Horowitz (Stanford University) | The Tiny Tera: A Packet Switch Core | 13 pages, 10 figures | Hot Interconnects V, Stanford University, August 1996; IEEE Micro
Jan/Feb 1997, pp 26-33 | null | null | cs.NI | null | The objective is to design and build a small, high-bandwidth switch.
| [
{
"version": "v1",
"created": "Mon, 5 Oct 1998 17:50:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"McKeown",
"Nick",
"",
"Stanford University"
],
[
"Izzard",
"Martin",
"",
"Texas Instruments"
],
[
"Mekkittikul",
"Adisak",
"",
"Stanford University"
],
[
"Ellersick",
"Bill",
"",
"Stanford\n University"
],
[
"Horowitz",
"Mark",
"",
"Stanford University"
]
]
| new_dataset | 0.981528 |
cs/9810026 | James K. Huggins | Yuri Gurevich and James K. Huggins | The Railroad Crossing Problem: An Experiment with Instantaneous Actions
and Immediate Reactions | See also the web site at http://www.eecs.umich.edu/gasm/ | Selected papers from CSL'95, ed. H.K. Buening, Springer Lecture
Notes in Computer Science 1092, 1996, 266--290 | null | null | cs.SE | null | We give an evolving algebra solution for the well-known railroad crossing
problem and use the occasion to experiment with agents that perform
instantaneous actions in continuous time and in particular with agents that
fire at the moment they are enabled.
| [
{
"version": "v1",
"created": "Mon, 26 Oct 1998 19:24:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gurevich",
"Yuri",
""
],
[
"Huggins",
"James K.",
""
]
]
| new_dataset | 0.997756 |
cs/9811014 | James K. Huggins | Egon Boerger and James K. Huggins | Abstract State Machines 1988-1998: Commented ASM Bibliography | Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm/ | Formal Specification Column (H. Ehrig, ed.), EATCS Bulletin 64,
February 1998, 105--127 | null | null | cs.SE | null | An annotated bibliography of papers which deal with or use Abstract State
Machines (ASMs), as of January 1998.
| [
{
"version": "v1",
"created": "Mon, 9 Nov 1998 19:32:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Boerger",
"Egon",
""
],
[
"Huggins",
"James K.",
""
]
]
| new_dataset | 0.999164 |
cs/9811021 | Bernardo Kastrup | Bernardo Kastrup | Automatic Hardware Synthesis for a Hybrid Reconfigurable CPU Featuring
Philips CPLDs | 6 pages, 7 figures, PACT '98 Workshop on Reconfigurable Computing | null | null | null | cs.PL cs.AR | null | A high-level architecture of a Hybrid Reconfigurable CPU, based on a
Philips-supported core processor, is introduced. It features the Philips XPLA2
CPLD as a reconfigurable functional unit. A compilation chain is presented, in
which automatic implementation of time-critical program segments in custom
hardware is performed. The entire process is transparent from the programmer's
point of view. The hardware synthesis module of the chain, which translates
segments of assembly code into a hardware netlist, is discussed in details.
Application examples are also presented.
| [
{
"version": "v1",
"created": "Thu, 12 Nov 1998 09:49:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kastrup",
"Bernardo",
""
]
]
| new_dataset | 0.993272 |
cs/9811028 | Shie-Yuan Wang | H.T. Kung and S.Y. Wang | TCP Trunking | postscript file | null | null | null | cs.NI | null | A TCP trunk is an IP tunnel under TCP control, capable of carrying packets
from any number of user flows. By exploiting properties of TCP, a TCP trunk
provides elastic and reliable transmission over a network, and automatically
shares the network fairly with other competing trunks. Moreover, by aggregating
user flows into a single trunk flow, TCP trunking can significantly reduce the
number of flows that the network needs to manage, thereby allowing use of
simplified management to achieve improved perfor mance. For example, when
dealing with only a small number of TCP trunk flows, a router with a simple
FIFO buffer can experience low packet loss rates.
A TCP trunk is a "soft" circuit in the sense that it requires no flow states
to be maintained inside the network. Setting up a TCP trunk involves only
configuring the two end nodes. This is in contrast with traditional methods of
configuring circuits via signaling of network nodes.
A simple packet-dropping mechanism based on packet accounting at the
transmitter of a TCP trunk assures that, when the trunk reduces its bandwidth
in response to network congestion, user TCP flows carried by the trunk will
reduce their bandwidths by the same proportion. Simu lation results have
demonstrated that TCP trunks can provide improved network performance to users,
while achieving high network utilization.
| [
{
"version": "v1",
"created": "Fri, 20 Nov 1998 20:55:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kung",
"H. T.",
""
],
[
"Wang",
"S. Y.",
""
]
]
| new_dataset | 0.998318 |
cs/9901011 | Barry M. Leiner | Barry M. Leiner, Vinton G. Cerf, David D. Clark, Robert E. Kahn,
Leonard Kleinrock, Daniel C. Lynch, Jon Postel, Larry G. Roberts, and Stephen
Wolf | A Brief History of the Internet | null | null | null | null | cs.NI | null | The Internet has revolutionized the computer and communications world like
nothing before. The invention of the telegraph, telephone, radio, and computer
set the stage for this unprecedented integration of capabilities. The Internet
is at once a world-wide broadcasting capability, a mechanism for information
dissemination, and a medium for collaboration and interaction between
individuals and their computers without regard for geographic location.
In this paper, several of us involved in the development and evolution of the
Internet share our views of its origins and history. This is intended to be a
brief, necessarily cursory and incomplete history. This history revolves around
four distinct aspects. There is the technological evolution that began with
early research on packet switching and the ARPANET (and related technologies),
and where current research continues to expand the horizons of the
infrastructure along several dimensions, such as scale, performance, and higher
level functionality. There is the operations and management aspect of a global
and complex operational infrastructure. There is the social aspect, which
resulted in a broad community of Internauts working together to create and
evolve the technology. And there is the commercialization aspect, resulting in
an extremely effective transition of research results into a broadly deployed
and available information infrastructure.
| [
{
"version": "v1",
"created": "Sat, 23 Jan 1999 00:37:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Leiner",
"Barry M.",
""
],
[
"Cerf",
"Vinton G.",
""
],
[
"Clark",
"David D.",
""
],
[
"Kahn",
"Robert E.",
""
],
[
"Kleinrock",
"Leonard",
""
],
[
"Lynch",
"Daniel C.",
""
],
[
"Postel",
"Jon",
""
],
[
"Roberts",
"Larry G.",
""
],
[
"Wolf",
"Stephen",
""
]
]
| new_dataset | 0.992896 |
cs/9901015 | John Watrous | John Watrous | PSPACE has 2-round quantum interactive proof systems | 13 pages | null | null | null | cs.CC quant-ph | null | In this paper we consider quantum interactive proof systems, i.e.,
interactive proof systems in which the prover and verifier may perform quantum
computations and exchange quantum messages. It is proved that every language in
PSPACE has a quantum interactive proof system that requires only two rounds of
communication between the prover and verifier, while having exponentially small
(one-sided) probability of error. It follows that quantum interactive proof
systems are strictly more powerful than classical interactive proof systems in
the constant-round case unless the polynomial time hierarchy collapses to the
second level.
| [
{
"version": "v1",
"created": "Wed, 27 Jan 1999 21:35:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Watrous",
"John",
""
]
]
| new_dataset | 0.9951 |
cs/9902002 | Kuang-hua Chen | Kuang-hua Chen | Automatic Identification of Subjects for Textual Documents in Digital
Libraries | 7 pages, 6 tables | null | null | null | cs.DL cs.CL | null | The amount of electronic documents in the Internet grows very quickly. How to
effectively identify subjects for documents becomes an important issue. In
past, the researches focus on the behavior of nouns in documents. Although
subjects are composed of nouns, the constituents that determine which nouns are
subjects are not only nouns. Based on the assumption that texts are
well-organized and event-driven, nouns and verbs together contribute the
process of subject identification. This paper considers four factors: 1) word
importance, 2) word frequency, 3) word co-occurrence, and 4) word distance and
proposes a model to identify subjects for textual documents. The preliminary
experiments show that the performance of the proposed model is close to that of
human beings.
| [
{
"version": "v1",
"created": "Mon, 1 Feb 1999 11:01:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chen",
"Kuang-hua",
""
]
]
| new_dataset | 0.979426 |
cs/9902004 | Eric Lease Morgan | Eric Lease Morgan | The Alex Catalogue, A Collection of Digital Texts with Automatic Methods
for Acquisition and Cataloging, User-Defined Typography, Cross-searching of
Indexed Content, and a Sense of Community | 9 pages, 2 figures | null | null | null | cs.DL | null | This paper describes the Alex Catalogue of Electronic Texts, the only
Internet-accessible collection of digital documents allowing the user to 1)
dynamically create customized, typographically readable documents on demand, 2)
search the content of one or more documents from the collection simultaneously,
3) create sets of documents from the collection for review and annotation, and
4) publish these sets of annotated documents in turn fostering a sense of
community around the Catalogue. More than a just a collection of links that
will break over time, Alex is an archive of electronic texts providing
unprecedented access to its content and features allowing it to meet the needs
of a wide variety of users and settings. Furthermore, the process of
maintaining the Catalogue is streamlined with tools for automatic acquisition
and cataloging making it possible to sustain the service with a minimum of
personnel.
| [
{
"version": "v1",
"created": "Tue, 2 Feb 1999 14:14:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Morgan",
"Eric Lease",
""
]
]
| new_dataset | 0.984303 |
cs/9902016 | Ye Jian | Michael J. Hu, Ye Jian | Multimedia Description Framework (MDF) for Content Description of
Audio/Video Documents | 20 pages | null | null | null | cs.DL | null | MPEG is undertaking a new initiative to standardize content description of
audio and video data/documents. When it is finalized in 2001, MPEG-7 is
expected to provide standardized description schemes for concise and
unambiguous content description of data/documents of complex media types.
Meanwhile, other meta-data or description schemes, such as Dublin Core, XML,
etc., are becoming popular in different application domains. In this paper, we
propose the Multimedia Description Framework (MDF), which is designated to
accommodate multiple description (meta-data) schemes, both MPEG-7 and
non-MPEG-7, into integrated architecture. We will use examples to show how MDF
description makes use of combined strength of different description schemes to
enhance its expression power and flexibility. We conclude the paper with
discussion of using MDF description of a movie video to search/retrieve
required scene clips from the movie, on the MDF prototype system we have
implemented.
| [
{
"version": "v1",
"created": "Tue, 9 Feb 1999 02:17:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hu",
"Michael J.",
""
],
[
"Jian",
"Ye",
""
]
]
| new_dataset | 0.994875 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.