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/0402054 | Shujun Li Dr. | Shujun Li, Guanrong Chen and Xuanqin Mou | On the Security of the Yi-Tan-Siew Chaos-Based Cipher | 5 pages, 3 figures, IEEEtrans.cls v 1.6 | IEEE Trans. CAS-II, vol. 51, no. 12, pp. 665-669, 2004 | 10.1109/TCSII.2004.838657 | null | cs.CR cs.PF nlin.CD | null | This paper presents a comprehensive analysis on the security of the
Yi-Tan-Siew chaotic cipher proposed in [IEEE TCAS-I 49(12):1826-1829 (2002)]. A
differential chosen-plaintext attack and a differential chosen-ciphertext
attack are suggested to break the sub-key K, under the assumption that the time
stamp can be altered by the attacker, which is reasonable in such attacks.
Also, some security Problems about the sub-keys $\alpha$ and $\beta$ are
clarified, from both theoretical and experimental points of view. Further
analysis shows that the security of this cipher is independent of the use of
the chaotic tent map, once the sub-key $K$ is removed via the proposed
suggested differential chosen-plaintext attack.
| [
{
"version": "v1",
"created": "Tue, 24 Feb 2004 08:28:21 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Nov 2004 09:47:22 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Dec 2004 07:11:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Shujun",
""
],
[
"Chen",
"Guanrong",
""
],
[
"Mou",
"Xuanqin",
""
]
]
| new_dataset | 0.997983 |
cs/0403021 | Jim Gray | Tom Barclay, Wyman Chong, Jim Gray | A Quick Look at SATA Disk Performance | null | null | null | MSR-TR-2003-70, Oct. 2003 | cs.DB cs.PF | null | We have been investigating the use of low-cost, commodity components for
multi-terabyte SQL Server databases. Dubbed storage bricks, these servers are
white box PCs containing the largest ATA drives, value-priced AMD or Intel
processors, and inexpensive ECC memory. One issue has been the wiring mess, air
flow problems, length restrictions, and connector failures created by seven or
more parallel ATA (PATA) ribbon cables and drives in]a tower or 3U rack-mount
chassis. Large capacity Serial ATA (SATA) drives have recently become widely
available for the PC environment at a reasonable price. In addition to being
faster, the SATA connectors seem more reliable, have a more reasonable length
restriction (1m) and allow better airflow. We tested two drive brands along
with two RAID controllers to evaluate SATA drive performance and reliablility.
This paper documents our results so far.
| [
{
"version": "v1",
"created": "Fri, 12 Mar 2004 10:42:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Barclay",
"Tom",
""
],
[
"Chong",
"Wyman",
""
],
[
"Gray",
"Jim",
""
]
]
| new_dataset | 0.99955 |
cs/0403023 | Abdelhamid S. Abdelhamid | Ahmed A. Belal, Abdelhamid S. Abdelhamid | Secure Transmission of Sensitive data using multiple channels | 5 pages | null | null | null | cs.CR | null | A new scheme for transmitting sensitive data is proposed, the proposed scheme
depends on partitioning the output of a block encryption module using the
Chinese Remainder Theorem among a set of channels. The purpose of using the
Chinese Remainder Theorem is to hide the cipher text in order to increase the
difficulty of attacking the cipher. The theory, implementation and the security
of this scheme are described in this paper.
| [
{
"version": "v1",
"created": "Sun, 14 Mar 2004 19:58:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Belal",
"Ahmed A.",
""
],
[
"Abdelhamid",
"Abdelhamid S.",
""
]
]
| new_dataset | 0.985945 |
cs/0403028 | Manuel Carro | Manuel Carro | An Application of Rational Trees in a Logic Programming Interpreter for
a Procedural Language | LaTeX2e, 13 pages, 2 tables, 11 figures (several of them, text). Yet
unpublished | null | null | null | cs.DS cs.LO | null | We describe here a simple application of rational trees to the implementation
of an interpreter for a procedural language written in a logic programming
language. This is possible in languages designed to support rational trees
(such as Prolog II and its descendants), but also in traditional Prolog, whose
data structures are initially based on Herbrand terms, but in which
implementations often omit the occurs check needed to avoid the creation of
infinite data structures. We provide code implementing two interpreters, one of
which needs non-occurs-check unification, which makes it faster (and more
economic). We provide experimental data supporting this, and we argue that
rational trees are interesting enough as to receive thorough support inside the
language.
| [
{
"version": "v1",
"created": "Tue, 16 Mar 2004 16:48:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Carro",
"Manuel",
""
]
]
| new_dataset | 0.956251 |
cs/0404011 | Francesco Calimeri | G. Ianni, F. Calimeri, A. Pietramala, M.C. Santoro | Parametric external predicates for the DLV System | 10 pages | null | null | null | cs.AI | null | This document describes syntax, semantics and implementation guidelines in
order to enrich the DLV system with the possibility to make external C function
calls. This feature is realized by the introduction of parametric external
predicates, whose extension is not specified through a logic program but
implicitly computed through external code.
| [
{
"version": "v1",
"created": "Mon, 5 Apr 2004 17:15:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ianni",
"G.",
""
],
[
"Calimeri",
"F.",
""
],
[
"Pietramala",
"A.",
""
],
[
"Santoro",
"M. C.",
""
]
]
| new_dataset | 0.993752 |
cs/0404013 | Kevin Lai | Kevin Lai, Bernardo A. Huberman, and Leslie Fine | Tycoon: A Distributed Market-based Resource Allocation System | null | null | null | null | cs.DC cs.MA | null | P2P clusters like the Grid and PlanetLab enable in principle the same
statistical multiplexing efficiency gains for computing as the Internet
provides for networking. The key unsolved problem is resource allocation.
Existing solutions are not economically efficient and require high latency to
acquire resources. We designed and implemented Tycoon, a market based
distributed resource allocation system based on an Auction Share scheduling
algorithm. Preliminary results show that Tycoon achieves low latency and high
fairness while providing incentives for truth-telling on the part of strategic
users.
| [
{
"version": "v1",
"created": "Mon, 5 Apr 2004 19:54:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lai",
"Kevin",
""
],
[
"Huberman",
"Bernardo A.",
""
],
[
"Fine",
"Leslie",
""
]
]
| new_dataset | 0.998681 |
cs/0404018 | Jiyou Jia | Jiyou Jia | NLML--a Markup Language to Describe the Unlimited English Grammar | 15 Pages, 2 Figures, 3 Tables submitted to German Conference for
Artificial Intelligence 2004 Ulm | null | null | null | cs.CL cs.AI | null | In this paper we present NLML (Natural Language Markup Language), a markup
language to describe the syntactic and semantic structure of any grammatically
correct English expression. At first the related works are analyzed to
demonstrate the necessity of the NLML: simple form, easy management and direct
storage. Then the description of the English grammar with NLML is introduced in
details in three levels: sentences (with different complexities, voices, moods,
and tenses), clause (relative clause and noun clause) and phrase (noun phrase,
verb phrase, prepositional phrase, adjective phrase, adverb phrase and
predicate phrase). At last the application fields of the NLML in NLP are shown
with two typical examples: NLOJM (Natural Language Object Modal in Java) and
NLDB (Natural Language Database).
| [
{
"version": "v1",
"created": "Wed, 7 Apr 2004 06:54:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jia",
"Jiyou",
""
]
]
| new_dataset | 0.999684 |
cs/0404025 | Atsushi Fujii | Atsushi Fujii, Makoto Iwayama, and Noriko Kando | Test Collections for Patent-to-Patent Retrieval and Patent Map
Generation in NTCIR-4 Workshop | 4 pages, Proceedings of the 4th International Conference on Language
Resources and Evaluation (to appear) | Proceedings of the 4th International Conference on Language
Resources and Evaluation (LREC-2004), pp.1643-1646, May. 2004. | null | null | cs.CL | null | This paper describes the Patent Retrieval Task in the Fourth NTCIR Workshop,
and the test collections produced in this task. We perform the invalidity
search task, in which each participant group searches a patent collection for
the patents that can invalidate the demand in an existing claim. We also
perform the automatic patent map generation task, in which the patents
associated with a specific topic are organized in a multi-dimensional matrix.
| [
{
"version": "v1",
"created": "Sat, 10 Apr 2004 08:43:31 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Fujii",
"Atsushi",
""
],
[
"Iwayama",
"Makoto",
""
],
[
"Kando",
"Noriko",
""
]
]
| new_dataset | 0.979705 |
cs/0404026 | Darran Nathan | Darran Nathan, Eva Rosdiana, Chua Beng Koon | DAB Content Annotation and Receiver Hardware Control with XML | 6 pages, 7 figures | null | null | null | cs.GL cs.CL | null | The Eureka-147 Digital Audio Broadcasting (DAB) standard defines the 'dynamic
labels' data field for holding information about the transmission content.
However, this information does not follow a well-defined structure since it is
designed to carry text for direct output to displays, for human interpretation.
This poses a problem when machine interpretation of DAB content information is
desired. Extensible Markup Language (XML) was developed to allow for the
well-defined, structured machine-to-machine exchange of data over computer
networks. This article proposes a novel technique of machine-interpretable DAB
content annotation and receiver hardware control, involving the utilisation of
XML as metadata in the transmitted DAB frames.
| [
{
"version": "v1",
"created": "Sun, 11 Apr 2004 08:36:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Nathan",
"Darran",
""
],
[
"Rosdiana",
"Eva",
""
],
[
"Koon",
"Chua Beng",
""
]
]
| new_dataset | 0.998417 |
cs/0404038 | Douglas Powell | D. B. Powell | 2-Sat Sub-Clauses and the Hypernodal Structure of the 3-Sat Problem | 16 pages; 8 figures | null | null | null | cs.CC cs.AI | null | Like simpler graphs, nested (hypernodal) graphs consist of two components: a
set of nodes and a set of edges, where each edge connects a pair of nodes. In
the hypernodal graph model, however, a node may contain other graphs, so that a
node may be contained in a graph that it contains. The inherently recursive
structure of the hypernodal graph model aptly characterizes both the structure
and dynamic of the 3-sat problem, a broadly applicable, though intractable,
computer science problem. In this paper I first discuss the structure of the
3-sat problem, analyzing the relation of 3-sat to 2-sat, a related, though
tractable problem. I then discuss sub-clauses and sub-clause thresholds and the
transformation of sub-clauses into implication graphs, demonstrating how
combinations of implication graphs are equivalent to hypernodal graphs. I
conclude with a brief discussion of the use of hypernodal graphs to model the
3-sat problem, illustrating how hypernodal graphs model both the conditions for
satisfiability and the process by which particular 3-sat assignments either
succeed or fail.
| [
{
"version": "v1",
"created": "Tue, 20 Apr 2004 08:23:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Powell",
"D. B.",
""
]
]
| new_dataset | 0.998784 |
cs/0404041 | Jiyou Jia | Jiyou Jia | NLOMJ--Natural Language Object Model in Java | 11 pages, 1 figure. Submitted to ICICP04 | null | null | null | cs.CL cs.PL | null | In this paper we present NLOMJ--a natural language object model in Java with
English as the experiment language. This modal describes the grammar elements
of any permissible expression in a natural language and their complicated
relations with each other with the concept "Object" in OOP(Object Oriented
Programming). Directly mapped to the syntax and semantics of the natural
language, it can be used in information retrieval as a linguistic method.
Around the UML diagram of the NLOMJ the important classes(Sentence, Clause and
Phrase) and their sub classes are introduced and their syntactic and semantic
meanings are explained.
| [
{
"version": "v1",
"created": "Wed, 21 Apr 2004 06:30:28 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Feb 2006 15:05:13 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Jia",
"Jiyou",
""
]
]
| new_dataset | 0.999297 |
cs/0404051 | Jiang Qiu | Jorge Lobo, Gisela Mendez, Stuart R. Taylor | Knowledge And The Action Description Language A | Appeared in Theory and Practice of Logic Programming, vol. 1, no. 2,
2001 | Theory and Practice of Logic Programming, vol. 1, no. 2, 2001 | null | null | cs.AI | null | We introduce Ak, an extension of the action description language A (Gelfond
and Lifschitz, 1993) to handle actions which affect knowledge. We use sensing
actions to increase an agent's knowledge of the world and non-deterministic
actions to remove knowledge. We include complex plans involving conditionals
and loops in our query language for hypothetical reasoning. We also present a
translation of Ak domain descriptions into epistemic logic programs.
| [
{
"version": "v1",
"created": "Sat, 24 Apr 2004 14:16:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lobo",
"Jorge",
""
],
[
"Mendez",
"Gisela",
""
],
[
"Taylor",
"Stuart R.",
""
]
]
| new_dataset | 0.998125 |
cs/0405015 | Darran Nathan | Darran Nathan, Kelvin Lim Mun Kit, Kelly Choo Hon Min, Philip Wong Jit
Chin, Andreas Weisensee | A High-Level Reconfigurable Computing Platform Software Frameworks | 4 pages, 8 figures | null | null | null | cs.AR | null | Reconfigurable computing refers to the use of processors, such as Field
Programmable Gate Arrays (FPGAs), that can be modified at the hardware level to
take on different processing tasks. A reconfigurable computing platform
describes the hardware and software base on top of which modular extensions can
be created, depending on the desired application. Such reconfigurable computing
platforms can take on varied designs and implementations, according to the
constraints imposed and features desired by the scope of applications. This
paper introduces a PC-based reconfigurable computing platform software
frameworks that is flexible and extensible enough to abstract the different
hardware types and functionality that different PCs may have. The requirements
of the software platform, architectural issues addressed, rationale behind the
decisions made, and frameworks design implemented are discussed.
| [
{
"version": "v1",
"created": "Wed, 5 May 2004 01:56:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Nathan",
"Darran",
""
],
[
"Kit",
"Kelvin Lim Mun",
""
],
[
"Min",
"Kelly Choo Hon",
""
],
[
"Chin",
"Philip Wong Jit",
""
],
[
"Weisensee",
"Andreas",
""
]
]
| new_dataset | 0.983878 |
cs/0405020 | Joel Friedman | Joel Friedman | A proof of Alon's second eigenvalue conjecture and related problems | To appear in Memoirs of the American Mathematical Society. 118 pages.
This newer version should have a two page glossary | null | null | null | cs.DM math.CO | null | In this paper we show the following conjecture of Noga Alon. Fix a positive
integer d>2 and real epsilon > 0; consider the probability that a random
d-regular graph on n vertices has the second eigenvalue of its adjacency matrix
greater than 2 sqrt(d-1) + epsilon; then this probability goes to zero as n
tends to infinity.
We prove the conjecture for a number of notions of random d-regular graph,
including models for d odd. We also estimate the aforementioned probability
more precisely, showing in many cases and models (but not all) that it decays
like a polynomial in 1/n.
| [
{
"version": "v1",
"created": "Wed, 5 May 2004 16:42:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Friedman",
"Joel",
""
]
]
| new_dataset | 0.99038 |
cs/0405022 | Eric Weber | Ryan Harkins, Eric Weber and Andrew Westmeyer | Encryption Schemes using Finite Frames and Hadamard Arrays | 14 pages, 11 figures | null | null | null | cs.CR | null | We propose a cipher similar to the One Time Pad and McEliece cipher based on
a subband coding scheme. The encoding process is an approximation to the One
Time Pad encryption scheme. We present results of numerical experiments which
suggest that a brute force attack to the proposed scheme does not result in all
possible plaintexts, as the One Time Pad does, but still the brute force attack
does not compromise the system. However, we demonstrate that the cipher is
vulnerable to a chosen-plaintext attack.
| [
{
"version": "v1",
"created": "Thu, 6 May 2004 16:33:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Harkins",
"Ryan",
""
],
[
"Weber",
"Eric",
""
],
[
"Westmeyer",
"Andrew",
""
]
]
| new_dataset | 0.997096 |
cs/0405038 | Riccardo Pucella | Riccardo Pucella | Deductive Algorithmic Knowledge | 28 pages. A preliminary version of this paper appeared in the
Proceedings of the 8th International Symposium on Artificial Intelligence and
Mathematics, AI&M 22-2004, 2004 | Journal of Logic and Computation 16 (2), pp. 287-309, 2006 | null | null | cs.AI cs.LO | null | The framework of algorithmic knowledge assumes that agents use algorithms to
compute the facts they explicitly know. In many cases of interest, a deductive
system, rather than a particular algorithm, captures the formal reasoning used
by the agents to compute what they explicitly know. We introduce a logic for
reasoning about both implicit and explicit knowledge with the latter defined
with respect to a deductive system formalizing a logical theory for agents. The
highly structured nature of deductive systems leads to very natural
axiomatizations of the resulting logic when interpreted over any fixed
deductive system. The decision problem for the logic, in the presence of a
single agent, is NP-complete in general, no harder than propositional logic. It
remains NP-complete when we fix a deductive system that is decidable in
nondeterministic polynomial time. These results extend in a straightforward way
to multiple agents.
| [
{
"version": "v1",
"created": "Tue, 11 May 2004 18:01:39 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jun 2005 02:43:07 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Jan 2006 19:08:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pucella",
"Riccardo",
""
]
]
| new_dataset | 0.950844 |
cs/0405042 | Ted Herman | T. Herman, S. Tixeuil | A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor
Networks | null | null | null | TR04-02 University of Iowa Department of Computer Science | cs.DC cs.NI | null | Wireless sensor networks benefit from communication protocols that reduce
power requirements by avoiding frame collision. Time Division Media Access
methods schedule transmission in slots to avoid collision, however these
methods often lack scalability when implemented in \emph{ad hoc} networks
subject to node failures and dynamic topology. This paper reports a distributed
algorithm for TDMA slot assignment that is self-stabilizing to transient faults
and dynamic topology change. The expected local convergence time is O(1) for
any size network satisfying a constant bound on the size of a node
neighborhood.
| [
{
"version": "v1",
"created": "Wed, 12 May 2004 14:53:29 GMT"
},
{
"version": "v2",
"created": "Wed, 19 May 2004 16:59:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Herman",
"T.",
""
],
[
"Tixeuil",
"S.",
""
]
]
| new_dataset | 0.999548 |
cs/0405066 | Riccardo Pucella | Riccardo Pucella and Vicky Weissman | A Logic for Reasoning about Digital Rights | 21 pages. Appeared in the Proceedings of the 15th IEEE Computer
Security Foundations Workshop, pp. 282-294, 2002 | null | null | null | cs.CR cs.LO | null | We present a logic for reasoning about licenses, which are ``terms of use''
for digital resources. The logic provides a language for writing both
properties of licenses and specifications that govern a client's actions. We
discuss the complexity of checking properties and specifications written in our
logic and propose a technique for verification. A key feature of our approach
is that it is essentially parameterized by the language in which the licenses
are written, provided that this language can be given a trace-based semantics.
We consider two license languages to illustrate this flexibility.
| [
{
"version": "v1",
"created": "Tue, 18 May 2004 18:22:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pucella",
"Riccardo",
""
],
[
"Weissman",
"Vicky",
""
]
]
| new_dataset | 0.991504 |
cs/0405081 | Riccardo Pucella | Riccardo Pucella | An Analysis of Lambek's Production Machines | 13 pages, 1 figure | RAIRO Informatique Theorique et Applications, 31 (5), pp. 483-497,
1997 | null | null | cs.LO | null | Lambek's production machines may be used to generate and recognize sentences
in a subset of the language described by a production grammar. We determine in
this paper the subset of the language of a grammar generated and recognized by
such machines.
| [
{
"version": "v1",
"created": "Sun, 23 May 2004 19:22:10 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pucella",
"Riccardo",
""
]
]
| new_dataset | 0.971171 |
cs/0405088 | Jiang Qiu | Paul Tarau, Veronica Dahl | High-Level Networking With Mobile Code And First Order AND-Continuations | Appeared in Theory and Practice of Logic Programming, vol. 1, no. 3,
2001 | Theory and Practice of Logic Programming, vol. 1, no. 3, 2001 | null | null | cs.PL | null | We describe a scheme for moving living code between a set of distributed
processes coordinated with unification based Linda operations, and its
application to building a comprehensive Logic programming based Internet
programming framework. Mobile threads are implemented by capturing first order
continuations in a compact data structure sent over the network. Code is
fetched lazily from its original base turned into a server as the continuation
executes at the remote site. Our code migration techniques, in combination with
a dynamic recompilation scheme, ensure that heavily used code moves up smoothly
on a speed hierarchy while volatile dynamic code is kept in a quickly updatable
form. Among the examples, we describe how to build programmable client and
server components (Web servers, in particular) and mobile agents.
| [
{
"version": "v1",
"created": "Mon, 24 May 2004 12:41:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Tarau",
"Paul",
""
],
[
"Dahl",
"Veronica",
""
]
]
| new_dataset | 0.993118 |
cs/0406012 | Jiang Qiu | Seng Wai Loke, Andrew Davison | Secure Prolog-Based Mobile Code | Appeared in Theory and Practice of Logic Programming, vol. 1, no. 3,
2001 | Theory and Practice of Logic Programming, vol. 1, no. 3, 2001 | null | null | cs.PL | null | LogicWeb mobile code consists of Prolog-like rules embedded in Web pages,
thereby adding logic programming behaviour to those pages. Since LogicWeb
programs are downloaded from foreign hosts and executed locally, there is a
need to protect the client from buggy or malicious code. A security model is
crucial for making LogicWeb mobile code safe to execute. This paper presents
such a model, which supports programs of varying trust levels by using
different resource access policies. The implementation of the model derives
from an extended operational semantics for the LogicWeb language, which
provides a precise meaning of safety.
| [
{
"version": "v1",
"created": "Mon, 7 Jun 2004 07:01:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Loke",
"Seng Wai",
""
],
[
"Davison",
"Andrew",
""
]
]
| new_dataset | 0.999768 |
cs/0407003 | Miguel Mosteiro | Michael A. Bender, Martin Farach-Colton, Miguel Mosteiro | Insertion Sort is O(n log n) | 6 pages, Latex. In Proceedings of the Third International Conference
on Fun With Algorithms, FUN 2004 | null | null | null | cs.DS | null | Traditional Insertion Sort runs in O(n^2) time because each insertion takes
O(n) time. When people run Insertion Sort in the physical world, they leave
gaps between items to accelerate insertions. Gaps help in computers as well.
This paper shows that Gapped Insertion Sort has insertion times of O(log n)
with high probability, yielding a total running time of O(n log n) with high
probability.
| [
{
"version": "v1",
"created": "Thu, 1 Jul 2004 15:50:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bender",
"Michael A.",
""
],
[
"Farach-Colton",
"Martin",
""
],
[
"Mosteiro",
"Miguel",
""
]
]
| new_dataset | 0.973193 |
cs/0407007 | Dirk Leinders | Dirk Leinders (1), Jerzy Tyszkiewicz (2), Jan Van den Bussche (1) ((1)
Limburgs Universitair Centrum, Diepenbeek, Belgium, (2) Institute of
Informatics, Warsaw University, Warsaw, Poland) | The semijoin algebra and the guarded fragment | 11 pages, 2 figures | null | null | null | cs.DB cs.LO | null | The semijoin algebra is the variant of the relational algebra obtained by
replacing the join operator by the semijoin operator. We discuss some
interesting connections between the semijoin algebra and the guarded fragment
of first-order logic. We also provide an Ehrenfeucht-Fraisse game,
characterizing the discerning power of the semijoin algebra. This game gives a
method for showing that certain queries are not expressible in the semijoin
algebra.
| [
{
"version": "v1",
"created": "Fri, 2 Jul 2004 15:44:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Leinders",
"Dirk",
""
],
[
"Tyszkiewicz",
"Jerzy",
""
],
[
"Bussche",
"Jan Van den",
""
]
]
| new_dataset | 0.998104 |
cs/0407020 | Rina Panigrahy | Rina Panigrahy | Minimum Enclosing Polytope in High Dimensions | Submitted to SODA05 | null | null | null | cs.CG | null | We study the problem of covering a given set of $n$ points in a high,
$d$-dimensional space by the minimum enclosing polytope of a given arbitrary
shape. We present algorithms that work for a large family of shapes, provided
either only translations and no rotations are allowed, or only rotation about a
fixed point is allowed; that is, one is allowed to only scale and translate a
given shape, or scale and rotate the shape around a fixed point. Our algorithms
start with a polytope guessed to be of optimal size and iteratively moves it
based on a greedy principle: simply move the current polytope directly towards
any outside point till it touches the surface. For computing the minimum
enclosing ball, this gives a simple greedy algorithm with running time
$O(nd/\eps)$ producing a ball of radius $1+\eps$ times the optimal. This simple
principle generalizes to arbitrary convex shape when only translations are
allowed, requiring at most $O(1/\eps^2)$ iterations. Our algorithm implies that
{\em core-sets} of size $O(1/\eps^2)$ exist not only for minimum enclosing ball
but also for any convex shape with a fixed orientation. A {\em Core-Set} is a
small subset of $poly(1/\eps)$ points whose minimum enclosing polytope is
almost as large as that of the original points. Although we are unable to
combine our techniques for translations and rotations for general shapes, for
the min-cylinder problem, we give an algorithm similar to the one in
\cite{HV03}, but with an improved running time of $2^{O(\frac{1}{\eps^2}\log
\frac{1}{\eps})} nd$.
| [
{
"version": "v1",
"created": "Thu, 8 Jul 2004 19:03:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Panigrahy",
"Rina",
""
]
]
| new_dataset | 0.992128 |
cs/0407051 | G. Gordon Worley III | G Gordon Worley III | Bug shallowness in open-source, Macintosh software | added description of bug shallowness; corrected abstract (5 pages,
PDF only (no LaTeX)) | Worley III, G Gordon. "Bug shallowness in open-source, Macintosh
software". Advanced Developers Hands On Conference 19. 2004 | null | null | cs.SE | null | Central to the power of open-source software is bug shallowness, the relative
ease of finding and fixing bugs. The open-source movement began with Unix
software, so many users were also programmers capable of finding and fixing
bugs given the source code. But as the open-source movement reaches the
Macintosh platform, bugs may not be shallow because few Macintosh users are
programmers. Based on reports from open-source developers, I, however, conclude
that that bugs are as shallow in open-source, Macintosh software as in any
other open-source software.
| [
{
"version": "v1",
"created": "Tue, 20 Jul 2004 13:04:36 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jul 2004 23:08:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Worley",
"G Gordon",
"III"
]
]
| new_dataset | 0.999683 |
cs/0408018 | Viktor Kuncak | Viktor Kuncak, Martin Rinard | On Role Logic | 20 pages. Our later SAS 2004 result builds on this work | null | null | MIT CSAIL 925 | cs.PL cs.LO | null | We present role logic, a notation for describing properties of relational
structures in shape analysis, databases, and knowledge bases. We construct role
logic using the ideas of de Bruijn's notation for lambda calculus, an encoding
of first-order logic in lambda calculus, and a simple rule for implicit
arguments of unary and binary predicates. The unrestricted version of role
logic has the expressive power of first-order logic with transitive closure.
Using a syntactic restriction on role logic formulas, we identify a natural
fragment RL^2 of role logic. We show that the RL^2 fragment has the same
expressive power as two-variable logic with counting C^2 and is therefore
decidable. We present a translation of an imperative language into the
decidable fragment RL^2, which allows compositional verification of programs
that manipulate relational structures. In addition, we show how RL^2 encodes
boolean shape analysis constraints and an expressive description logic.
| [
{
"version": "v1",
"created": "Thu, 5 Aug 2004 23:01:20 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kuncak",
"Viktor",
""
],
[
"Rinard",
"Martin",
""
]
]
| new_dataset | 0.997738 |
cs/0408027 | Henning Christiansen | Henning Christiansen | CHR Grammars | 36 pp. To appear in TPLP, 2005 | null | null | null | cs.CL cs.PL | null | A grammar formalism based upon CHR is proposed analogously to the way
Definite Clause Grammars are defined and implemented on top of Prolog. These
grammars execute as robust bottom-up parsers with an inherent treatment of
ambiguity and a high flexibility to model various linguistic phenomena. The
formalism extends previous logic programming based grammars with a form of
context-sensitive rules and the possibility to include extra-grammatical
hypotheses in both head and body of grammar rules. Among the applications are
straightforward implementations of Assumption Grammars and abduction under
integrity constraints for language analysis. CHR grammars appear as a powerful
tool for specification and implementation of language processors and may be
proposed as a new standard for bottom-up grammars in logic programming.
To appear in Theory and Practice of Logic Programming (TPLP), 2005
| [
{
"version": "v1",
"created": "Thu, 12 Aug 2004 11:15:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Christiansen",
"Henning",
""
]
]
| new_dataset | 0.960739 |
cs/0408029 | Jason Cantarella | Jason Cantarella and Michael Piatek | Tsnnls: A solver for large sparse least squares problems with
non-negative variables | 7 pages, 2 figures | null | null | null | cs.MS | null | The solution of large, sparse constrained least-squares problems is a staple
in scientific and engineering applications. However, currently available codes
for such problems are proprietary or based on MATLAB. We announce a freely
available C implementation of the fast block pivoting algorithm of Portugal,
Judice, and Vicente. Our version is several times faster than Matstoms' MATLAB
implementation of the same algorithm. Further, our code matches the accuracy of
MATLAB's built-in lsqnonneg function.
| [
{
"version": "v1",
"created": "Fri, 13 Aug 2004 21:25:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cantarella",
"Jason",
""
],
[
"Piatek",
"Michael",
""
]
]
| new_dataset | 0.999254 |
cs/0408041 | Ali Eftekhari | Ali Eftekhari | Fractal geometry of literature: first attempt to Shakespeare's works | 26 pages, 7 figures, 3 tables | null | null | null | cs.CL cs.CC | null | It was demonstrated that there is a geometrical order in the structure of
literature. Fractal geometry as a modern mathematical approach and a new
geometrical viewpoint on natural objects including both processes and
structures was employed for analysis of literature. As the first study, the
works of William Shakespeare were chosen as the most important items in western
literature. By counting the number of letters applied in a manuscript, it is
possible to study the whole manuscript statistically. A novel method based on
basic assumption of fractal geometry was proposed for the calculation of
fractal dimensions of the literature. The results were compared with Zipf's
law. Zipf's law was successfully used for letters instead of words. Two new
concepts namely Zipf's dimension and Zipf's order were also introduced. It was
found that changes of both fractal dimension and Zipf's dimension are similar
and dependent on the manuscript length. Interestingly, direct plotting the data
obtained in semi-logarithmic and logarithmic forms also led to a power-law.
| [
{
"version": "v1",
"created": "Tue, 17 Aug 2004 10:14:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eftekhari",
"Ali",
""
]
]
| new_dataset | 0.99913 |
cs/0408044 | Michael Thielscher | Michael Thielscher | FLUX: A Logic Programming Method for Reasoning Agents | null | null | null | null | cs.AI | null | FLUX is a programming method for the design of agents that reason logically
about their actions and sensor information in the presence of incomplete
knowledge. The core of FLUX is a system of Constraint Handling Rules, which
enables agents to maintain an internal model of their environment by which they
control their own behavior. The general action representation formalism of the
fluent calculus provides the formal semantics for the constraint solver. FLUX
exhibits excellent computational behavior due to both a carefully restricted
expressiveness and the inference paradigm of progression.
| [
{
"version": "v1",
"created": "Thu, 19 Aug 2004 14:47:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thielscher",
"Michael",
""
]
]
| new_dataset | 0.99442 |
cs/0408061 | Aristides Vagelatos | Ch. Tsalidis (1), A. Vagelatos (2) and G. Orphanos (1) ((1) Neurosoft
S.A. (2) RACTI) | An electronic dictionary as a basis for NLP tools: The Greek case | Traitement Automatique des Langues Naturelles (TALN) 2004, Fez,
Morocco | null | null | CTI T.R.: 2004.04.03 | cs.CL | null | The existence of a Dictionary in electronic form for Modern Greek (MG) is
mandatory if one is to process MG at the morphological and syntactic levels
since MG is a highly inflectional language with marked stress and a spelling
system with many characteristics carried over from Ancient Greek. Moreover,
such a tool becomes necessary if one is to create efficient and sophisticated
NLP applications with substantial linguistic backing and coverage. The present
paper will focus on the deployment of such an electronic dictionary for Modern
Greek, which was built in two phases: first it was constructed to be the basis
for a spelling correction schema and then it was reconstructed in order to
become the platform for the deployment of a wider spectrum of NLP tools.
| [
{
"version": "v1",
"created": "Thu, 26 Aug 2004 13:17:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Tsalidis",
"Ch.",
""
],
[
"Vagelatos",
"A.",
""
],
[
"Orphanos",
"G.",
""
]
]
| new_dataset | 0.986702 |
cs/0409003 | Karthik Narayanaswami | Parth Bhawalkar, Victor Bigio, Adam Davis, Karthik Narayanaswami, Femi
Olumoko | ScheduleNanny: Using GPS to Learn the User's Significant Locations,
Travel Times and Schedule | 7 pages, 10 figures. Adaptive & Ubiquitous Computing | null | null | null | cs.AI cs.CV cs.HC | null | As computing technology becomes more pervasive, personal devices such as the
PDA, cell-phone, and notebook should use context to determine how to act.
Location is one form of context that can be used in many ways. We present a
multiple-device system that collects and clusters GPS data into significant
locations. These locations are then used to determine travel times and a
probabilistic model of the user's schedule, which is used to intelligently
alert the user. We evaluate our system and suggest how it should be integrated
with a variety of applications.
| [
{
"version": "v1",
"created": "Thu, 2 Sep 2004 15:28:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bhawalkar",
"Parth",
""
],
[
"Bigio",
"Victor",
""
],
[
"Davis",
"Adam",
""
],
[
"Narayanaswami",
"Karthik",
""
],
[
"Olumoko",
"Femi",
""
]
]
| new_dataset | 0.997397 |
cs/0409006 | Dumitru Vulcanov | Dumitru N. Vulcanov, Valentina D. Vulcanov (The West University of
Timisoara, Romania) | Maple+GrTensorII libraries for cosmology | LaTeX LLNCS style, 8 pages, accepted for SYNASC 2004 - 6th
International Symposium on Symbolic and Numeric Algorithms for Scientific
Computing, Timisoara, Romania, September 26-30 2004 | null | null | null | cs.SC gr-qc | null | The article mainly presents some results in using MAPLE platform for computer
algebra and GrTensorII package in doing calculations for theoretical and
numerical cosmology
| [
{
"version": "v1",
"created": "Sat, 4 Sep 2004 12:52:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vulcanov",
"Dumitru N.",
"",
"The West University of\n Timisoara, Romania"
],
[
"Vulcanov",
"Valentina D.",
"",
"The West University of\n Timisoara, Romania"
]
]
| new_dataset | 0.990725 |
cs/0409009 | Dirk Beyer | Dirk Beyer (University of California, Berkeley), Andreas Noack
(Brandenburg University of Technology) | CrocoPat 2.1 Introduction and Reference Manual | 19 pages + cover, 2 eps figures, uses llncs.cls and
cs_techrpt_cover.sty, for downloading the source code, binaries, and RML
examples, see http://www.software-systemtechnik.de/CrocoPat/ | null | null | UCB//CSD-04-1338 | cs.PL cs.DM cs.DS cs.SE | null | CrocoPat is an efficient, powerful and easy-to-use tool for manipulating
relations of arbitrary arity, including directed graphs. This manual provides
an introduction to and a reference for CrocoPat and its programming language
RML. It includes several application examples, in particular from the analysis
of structural models of software systems.
| [
{
"version": "v1",
"created": "Tue, 7 Sep 2004 09:44:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Beyer",
"Dirk",
"",
"University of California, Berkeley"
],
[
"Noack",
"Andreas",
"",
"Brandenburg University of Technology"
]
]
| new_dataset | 0.999525 |
cs/0409031 | Patrick C. McGuire | Patrick C. McGuire, Javier Gomez-Elvira, Jose Antonio
Rodriguez-Manfredi, Eduardo Sebastian-Martinez, Jens Ormo, Enrique
Diaz-Martinez, Helge Ritter, Markus Oesker, Robert Haschke and Joerg Ontrup | Field Geology with a Wearable Computer: First Results of the Cyborg
Astrobiologist System | 7 pages, 6 figures. Submitted to ICRA'2005 (Int'l Conf. on Robotics &
Automation, IEEE), April 18-22, 2005, Barcelona, Spain | null | null | null | cs.CV astro-ph cs.RO | null | We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist. The Cyborg
Astrobiologist platform has thus far been used for testing and development of
these algorithms and systems: robotic acquisition of quasi-mosaics of images,
real-time image segmentation, and real-time determination of interesting points
in the image mosaics. The hardware and software systems function reliably, and
the computer-vision algorithms are adequate for the first field tests. In
addition to the proof-of-concept aspect of these field tests, the main result
of these field tests is the enumeration of those issues that we can improve in
the future, including: dealing with structural shadow and microtexture, and
also, controlling the camera's zoom lens in an intelligent manner. Nonetheless,
despite these and other technical inadequacies, this Cyborg Astrobiologist
system, consisting of a camera-equipped wearable-computer and its
computer-vision algorithms, has demonstrated its ability of finding genuinely
interesting points in real-time in the geological scenery, and then gathering
more information about these interest points in an automated manner.
| [
{
"version": "v1",
"created": "Wed, 15 Sep 2004 15:38:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"McGuire",
"Patrick C.",
""
],
[
"Gomez-Elvira",
"Javier",
""
],
[
"Rodriguez-Manfredi",
"Jose Antonio",
""
],
[
"Sebastian-Martinez",
"Eduardo",
""
],
[
"Ormo",
"Jens",
""
],
[
"Diaz-Martinez",
"Enrique",
""
],
[
"Ritter",
"Helge",
""
],
[
"Oesker",
"Markus",
""
],
[
"Haschke",
"Robert",
""
],
[
"Ontrup",
"Joerg",
""
]
]
| new_dataset | 0.999049 |
cs/0409036 | Manoj Kumar | Sunder Lal and Manoj Kumar | A Directed Signature Scheme and its Applications | 9 Pages, No figures. Presented in the National Conference on
Information Security, New Delhi- India, Jan-2003 | null | null | null | cs.CR | null | This paper presents a directed signature scheme with the property that the
signature can be verified only with the help of signer or signature receiver.
We also propose its applications to share verification of signatures and to
threshold cryptosystems.
| [
{
"version": "v1",
"created": "Sun, 19 Sep 2004 03:12:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lal",
"Sunder",
""
],
[
"Kumar",
"Manoj",
""
]
]
| new_dataset | 0.99889 |
cs/0409046 | Amar Isli | Amar Isli | A TCSP-like decidable constraint language generalising existing cardinal
direction relations | in Proceedings of the ECAI Workshop on Spatial and Temporal
Reasoning, pp. 135-139, Valencia, Spain, 2004 | null | null | null | cs.AI cs.LO | null | We define a quantitative constraint language subsuming two calculi well-known
in QSR (Qualitative Spatial Reasoning): Frank's cone-shaped and
projection-based calculi of cardinal direction relations. We show how to solve
a CSP (Constraint Satisfaction Problem) expressed in the language.
| [
{
"version": "v1",
"created": "Fri, 24 Sep 2004 15:12:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Isli",
"Amar",
""
]
]
| new_dataset | 0.99489 |
cs/0409049 | Manoj Kumar | Sunder lal and Manoj Kumar | A Directed -Threshold Multi-Signature Scheme | 12 pages, no figures | null | null | null | cs.CR | null | In this paper, we propose a Directed Threshold Multi-Signature Scheme. In
this threshold signature scheme, any malicious set of signers cannot
impersonate any other set of signers to forge the signatures. In case of
forgery, it is possible to trace the signing set. This threshold signature
scheme is applicable when the message is sensitive to the signature receiver;
and the signatures are generated by the cooperation of a number of people from
a given group of senders.
| [
{
"version": "v1",
"created": "Sat, 25 Sep 2004 12:53:47 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Oct 2004 14:55:42 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Nov 2004 12:31:27 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"lal",
"Sunder",
""
],
[
"Kumar",
"Manoj",
""
]
]
| new_dataset | 0.979054 |
cs/0409050 | Manoj Kumar | Sunder Lal and Manoj Kumar | Some Applications of Directed Signature Scheme | 12 pages, no figures, this paper provides some application of
directed signature scheme | null | null | null | cs.CR | null | Directed signature scheme is applicable when the signed message contains
information sensitive to the receiver, because only receiver can directly
verify the signature and that he/she can prove its validity to any third party,
whenever necessary. This paper presents two applications of directed signature
scheme. (i) Directed –Delegated Signature Scheme. This scheme combines
the idea of proxy signatures with directed signature scheme. (ii) Allocation of
registration number. This scheme proposes a registration scheme in which the
registration number cannot be forged and misused.
| [
{
"version": "v1",
"created": "Sun, 26 Sep 2004 13:18:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lal",
"Sunder",
""
],
[
"Kumar",
"Manoj",
""
]
]
| new_dataset | 0.999075 |
cs/0410010 | Amit K. Awasthi | Amit K. Awasthi and Sunder Lal | A New Proxy Ring Signature Scheme | RMS 2004, Agra, INDIA | Proceeding of RMS 2004, Page 29 | null | null | cs.CR math.RA | null | The concept of ring signature was introduced by Rivest, Shamir and Tauman.
This signature is considered to be a simplified group signature from which
identity of signer is ambiguous although verifier knows the group to which
signer belong. In this paper we introduce a new proxy ring signature scheme.
| [
{
"version": "v1",
"created": "Tue, 5 Oct 2004 18:58:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Awasthi",
"Amit K.",
""
],
[
"Lal",
"Sunder",
""
]
]
| new_dataset | 0.999002 |
cs/0410011 | Amit K. Awasthi | Amit K Awasthi | Comment on A dynamic ID-based Remote User Authentication Scheme | 3 pages. Available at : http://gfcr.org | Transaction on Cryptology, Vol. 01, Issue 02, Page 15-17, Sep 2004 | null | null | cs.CR | null | Since 1981, when Lamport introduced the remote user authentication scheme
using table, a plenty of schemes had been proposed with tables or without table
using. Recently Das et al. proposed a dynamic id-based remote user
authentication scheme. They claimed that their scheme is secure against
ID-theft, and can resist the reply attacks, forgery attacks, insider attacks an
so on. In this paper we show that Das et al's scheme is completly insecure and
using of this scheme is like an open server access without password.
| [
{
"version": "v1",
"created": "Tue, 5 Oct 2004 21:54:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Awasthi",
"Amit K",
""
]
]
| new_dataset | 0.998098 |
cs/0410022 | Paul Piwek | P. Piwek, B. Krenn, M. Schroeder, M. Grice, S. Baumann and H. Pirker | RRL: A Rich Representation Language for the Description of Agent
Behaviour in NECA | 7 pages, 4 figures | In Proceedings of the AAMAS-02 Workshop ``Embodied conversational
agents - let's specify and evaluate them!'', July 16 2002, Bologna, Italy. | null | null | cs.MM cs.MA | null | In this paper, we describe the Rich Representation Language (RRL) which is
used in the NECA system. The NECA system generates interactions between two or
more animated characters. The RRL is an XML compliant framework for
representing the information that is exchanged at the interfaces between the
various NECA system modules. The full XML Schemas for the RRL are available at
http://www.ai.univie.ac.at/NECA/RRL
| [
{
"version": "v1",
"created": "Mon, 11 Oct 2004 12:34:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Piwek",
"P.",
""
],
[
"Krenn",
"B.",
""
],
[
"Schroeder",
"M.",
""
],
[
"Grice",
"M.",
""
],
[
"Baumann",
"S.",
""
],
[
"Pirker",
"H.",
""
]
]
| new_dataset | 0.999719 |
cs/0410051 | Alex Vinokur | Alex Vinokur | Turing Machine with Faults, Failures and Recovery | 8 pages; C++ Simulator has been developed | null | null | null | cs.LO | null | A Turing machine with faults, failures and recovery (TMF) is described. TMF
is (weakly) non-deterministic Turing machine consisting of five semi-infinite
tapes (Master Tape, Synchro Tape, Backup Tape, Backup Synchro Tape, User Tape)
and four controlling components (Program, Daemon, Apparatus, User).
Computational process consists of three phases (Program Phase, Failure Phase,
Repair Phase). C++ Simulator of a Turing machine with faults, failures and
recovery has been developed.
| [
{
"version": "v1",
"created": "Wed, 20 Oct 2004 12:43:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vinokur",
"Alex",
""
]
]
| new_dataset | 0.999583 |
cs/0410056 | Haibin Wang | Haibin Wang, Florentin Smarandache, Yanqing Zhang, Rajshekhar
Sunderraman | Interval Neutrosophic Logics: Theory and Applications | 18 pages, 4 figures | null | null | null | cs.LO | null | In this paper, we present the interval neutrosophic logics which generalizes
the fuzzy logic, paraconsistent logic, intuitionistic fuzzy logic and many
other non-classical and non-standard logics. We will give the formal definition
of interval neutrosophic propositional calculus and interval neutrosophic
predicate calculus. Then we give one application of interval neutrosophic
logics to do approximate reasoning.
| [
{
"version": "v1",
"created": "Thu, 21 Oct 2004 20:24:28 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Nov 2004 20:18:23 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wang",
"Haibin",
""
],
[
"Smarandache",
"Florentin",
""
],
[
"Zhang",
"Yanqing",
""
],
[
"Sunderraman",
"Rajshekhar",
""
]
]
| new_dataset | 0.954159 |
cs/0410071 | Patrick C. McGuire | Patrick C. McGuire, Jens Ormo, Enrique Diaz-Martinez, Jose Antonio
Rodriguez-Manfredi, Javier Gomez-Elvira, Helge Ritter, Markus Oesker, Joerg
Ontrup, (Centro de Astrobiologia, Madrid; University of Bielefeld) | The Cyborg Astrobiologist: First Field Experience | 29 pages, 10 figures (in press) | Int.J.Astrobiol. 3 (2004) 189-207 | 10.1017/S147355040500220X | null | cs.CV astro-ph cs.AI cs.CE cs.HC cs.RO cs.SE q-bio.NC | null | We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist and
field-astrobiologist. The Cyborg Astrobiologist platform has thus far been used
for testing and development of these algorithms and systems: robotic
acquisition of quasi-mosaics of images, real-time image segmentation, and
real-time determination of interesting points in the image mosaics. The
hardware and software systems function reliably, and the computer-vision
algorithms are adequate for the first field tests. In addition to the
proof-of-concept aspect of these field tests, the main result of these field
tests is the enumeration of those issues that we can improve in the future,
including: first, detection and accounting for shadows caused by 3D jagged
edges in the outcrop; second, reincorporation of more sophisticated
texture-analysis algorithms into the system; third, creation of hardware and
software capabilities to control the camera's zoom lens in an intelligent
manner; and fourth, development of algorithms for interpretation of complex
geological scenery. Nonetheless, despite these technical inadequacies, this
Cyborg Astrobiologist system, consisting of a camera-equipped wearable-computer
and its computer-vision algorithms, has demonstrated its ability of finding
genuinely interesting points in real-time in the geological scenery, and then
gathering more information about these interest points in an automated manner.
| [
{
"version": "v1",
"created": "Wed, 27 Oct 2004 09:14:01 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"McGuire",
"Patrick C.",
""
],
[
"Ormo",
"Jens",
""
],
[
"Diaz-Martinez",
"Enrique",
""
],
[
"Rodriguez-Manfredi",
"Jose Antonio",
""
],
[
"Gomez-Elvira",
"Javier",
""
],
[
"Ritter",
"Helge",
""
],
[
"Oesker",
"Markus",
""
],
[
"Ontrup",
"Joerg",
""
]
]
| new_dataset | 0.999078 |
cs/0411002 | Alex Vinokur | Alex Vinokur | Fibonacci-Like Polynomials Produced by m-ary Huffman Codes for
Absolutely Ordered Sequences | 10 pages, 2 tables | null | null | null | cs.DM math.NT | null | Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely
ordered sequences have been described.
| [
{
"version": "v1",
"created": "Mon, 1 Nov 2004 17:03:38 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vinokur",
"Alex",
""
]
]
| new_dataset | 0.999821 |
cs/0411005 | Manoj Kumar | Sunder Lal and Manoj Kumar | A Directed Threshold - Signature Scheme | 10 Pages, No figures | null | null | null | cs.CR | null | Directed signature is the solution of such problems when the signed message
contains information sensitive to the signature receiver. Generally, in many
application of directed signature, the signer is generally a single person. But
when the message is on behalf of an organization, a valid sensitive message may
require the approval of several people. Threshold signature schemes are used to
solve these problems. This paper presents a threshold directed signature
scheme.
| [
{
"version": "v1",
"created": "Tue, 2 Nov 2004 13:42:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lal",
"Sunder",
""
],
[
"Kumar",
"Manoj",
""
]
]
| new_dataset | 0.999505 |
cs/0411020 | Vedran Kordic | A. Albagul and Wahyudi | Dynamic Modelling and Adaptive Traction Control for Mobile Robots | null | International Journal of Advanced Robotic Systems, Volume 1,
Number 3, September 2004, pp.149-154 | null | null | cs.RO | null | Mobile robots have received a great deal of research in recent years. A
significant amount of research has been published in many aspects related to
mobile robots. Most of the research is devoted to design and develop some
control techniques for robot motion and path planning. A large number of
researchers have used kinematic models to develop motion control strategy for
mobile robots. Their argument and assumption that these models are valid if the
robot has low speed, low acceleration and light load. However, dynamic
modelling of mobile robots is very important as they are designed to travel at
higher speed and perform heavy duty work. This paper presents and discusses a
new approach to develop a dynamic model and control strategy for wheeled mobile
robot which I modelled as a rigid body that roles on two wheels and a castor.
The motion control strategy consists of two levels. The first level is dealing
with the dynamic of the system and denoted as Low level controller. The second
level is developed to take care of path planning and trajectory generation.
| [
{
"version": "v1",
"created": "Mon, 8 Nov 2004 20:44:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Albagul",
"A.",
""
],
[
"Wahyudi",
"",
""
]
]
| new_dataset | 0.983414 |
cs/0411024 | Vedran Kordic | Alex Ellery | Space Robotics Part 2: Space-based Manipulators | null | International Journal of Advanced Robotic Systems, ISSN 1729-8806,
Volume 1, Number 3 (2004), pp.213-216 | null | null | cs.RO | null | In this second of three short papers, I introduce some of the basic concepts
of space robotics with an emphasis on some specific challenging areas of
research that are peculiar to the application of robotics to space
infrastructure development. The style of these short papers is pedagogical and
the concepts in this paper are developed from fundamental manipulator robotics.
This second paper considers the application of space manipulators to on-orbit
servicing (OOS), an application which has considerable commercial application.
I provide some background to the notion of robotic on-orbit servicing and
explore how manipulator control algorithms may be modified to accommodate space
manipulators which operate in the micro-gravity of space.
| [
{
"version": "v1",
"created": "Mon, 8 Nov 2004 20:28:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ellery",
"Alex",
""
]
]
| new_dataset | 0.988841 |
cs/0411025 | Vedran Kordic | Yoseph Bar-Cohen | Bionic Humans Using EAP as Artificial Muscles Reality and Challenges | null | International Journal of Advanced Robotic Systems, ISSN 1729-8806,
Volume 1, Number 3 (2004), pp.217-222 | null | null | cs.RO cs.AI | null | For many years, the idea of a human with bionic muscles immediately conjures
up science fiction images of a TV series superhuman character that was
implanted with bionic muscles and portrayed with strength and speed far
superior to any normal human. As fantastic as this idea may seem, recent
developments in electroactive polymers (EAP) may one day make such bionics
possible. Polymers that exhibit large displacement in response to stimulation
that is other than electrical signal were known for many years. Initially, EAP
received relatively little attention due to their limited actuation capability.
However, in the recent years, the view of the EAP materials has changed due to
the introduction of effective new materials that significantly surpassed the
capability of the widely used piezoelectric polymer, PVDF. As this technology
continues to evolve, novel mechanisms that are biologically inspired are
expected to emerge. EAP materials can potentially provide actuation with
lifelike response and more flexible configurations. While further improvements
in performance and robustness are still needed, there already have been several
reported successes. In recognition of the need for cooperation in this
multidisciplinary field, the author initiated and organized a series of
international forums that are leading to a growing number of research and
development projects and to great advances in the field. In 1999, he challenged
the worldwide science and engineering community of EAP experts to develop a
robotic arm that is actuated by artificial muscles to win a wrestling match
against a human opponent. In this paper, the field of EAP as artificial muscles
will be reviewed covering the state of the art, the challenges and the vision
for the progress in future years.
| [
{
"version": "v1",
"created": "Mon, 8 Nov 2004 20:32:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bar-Cohen",
"Yoseph",
""
]
]
| new_dataset | 0.982249 |
cs/0411028 | Ignatios Souvatzis | Ignatios Souvatzis | A machine-independent port of the SR language run-time system to the
NetBSD operating system | presented at 3rd European BSD Conference, Karlsruhe, Germany, 2004
Oct. 29-31; 4 pages | Juergen Egeling (Ed.): Proceedings of the 3rd European BSD
Conference, Karlsruhe, Germany 2004, p.181 | null | null | cs.DC cs.PL | null | SR (synchronizing resources) is a PASCAL - style language enhanced with
constructs for concurrent programming developed at the University of Arizona in
the late 1980s. MPD (presented in Gregory Andrews' book about Foundations of
Multithreaded, Parallel, and Distributed Programming) is its successor,
providing the same language primitives with a different syntax. The run-time
system (in theory, identical) of both languages provides the illusion of a
multiprocessor machine on a single single- or multi- CPU Unix-like system or a
(local area) network of Unix-like machines. Chair V of the Computer Science
Department of the University of Bonn is operating a laboratory for a practical
course in parallel programming consisting of computing nodes running
NetBSD/arm, normally used via PVM, MPI etc. We are considering to offer SR and
MPD for this, too. As the original language distributions are only targeted at
a few commercial Unix systems, some porting effort is needed, outlined in the
SR porting guide. The integrated POSIX threads support of NetBSD-2.0 should
allow us to use library primitives provided for NetBSD's phtread system to
implement the primitives needed by the SR run-time system, thus implementing 13
target CPUs at once and automatically making use of SMP on VAX, Alpha, PowerPC,
Sparc, 32-bit Intel and 64 bit AMD CPUs.
This paper describes work in progress.
| [
{
"version": "v1",
"created": "Wed, 10 Nov 2004 12:39:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Souvatzis",
"Ignatios",
""
]
]
| new_dataset | 0.999291 |
cs/0411030 | Paolo D'Arco | Pina Bergamo, Paolo D'Arco, Alfredo De Santis, and Ljupco Kocarev | Security of public key cryptosystems based on Chebyshev Polynomials | Submitted for publication | null | null | null | cs.CR | null | Chebyshev polynomials have been recently proposed for designing public-key
systems. Indeed, they enjoy some nice chaotic properties, which seem to be
suitable for use in Cryptography. Moreover, they satisfy a semi-group property,
which makes possible implementing a trapdoor mechanism. In this paper we study
a public key cryptosystem based on such polynomials, which provides both
encryption and digital signature. The cryptosystem works on real numbers and is
quite efficient. Unfortunately, from our analysis it comes up that it is not
secure. We describe an attack which permits to recover the corresponding
plaintext from a given ciphertext. The same attack can be applied to produce
forgeries if the cryptosystem is used for signing messages. Then, we point out
that also other primitives, a Diffie-Hellman like key agreement scheme and an
authentication scheme, designed along the same lines of the cryptosystem, are
not secure due to the aforementioned attack. We close the paper by discussing
the issues and the possibilities of constructing public key cryptosystems on
real numbers.
| [
{
"version": "v1",
"created": "Wed, 10 Nov 2004 15:29:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Bergamo",
"Pina",
""
],
[
"D'Arco",
"Paolo",
""
],
[
"De Santis",
"Alfredo",
""
],
[
"Kocarev",
"Ljupco",
""
]
]
| new_dataset | 0.989168 |
cs/0411043 | Ioan Raicu | Ioan Raicu, Loren Schwiebert, Scott Fowler, Sandeep K.S. Gupta | e3D: An Energy-Efficient Routing Algorithm for Wireless Sensor Networks | Accepted for publication at IEEE ISSNIP 2004 (The International
Conference on Intelligent Sensors, Sensor Networks and Information
Processing), Melbourne, Australia, December 2004. 6 pages | null | null | null | cs.NI | null | One of the limitations of wireless sensor nodes is their inherent limited
energy resource. Besides maximizing the lifetime of the sensor node, it is
preferable to distribute the energy dissipated throughout the wireless sensor
network in order to minimize maintenance and maximize overall system
performance. Any communication protocol that involves synchronization of peer
nodes incurs some overhead for setting up the communication. We introduce a new
algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing
algorithm), and compare it to two other algorithms, namely directed, and random
clustering communication. We take into account the setup costs and analyze the
energy-efficiency and the useful lifetime of the system. In order to better
understand the characteristics of each algorithm and how well e3D really
performs, we also compare e3D with its optimum counterpart and an optimum
clustering algorithm. The benefit of introducing these ideal algorithms is to
show the upper bound on performance at the cost of an astronomical prohibitive
synchronization costs. We compare the algorithms in terms of system lifetime,
power dissipation distribution, cost of synchronization, and simplicity of the
algorithm. Our simulation results show that e3D performs comparable to its
optimal counterpart while having significantly less overhead.
| [
{
"version": "v1",
"created": "Fri, 12 Nov 2004 22:40:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Raicu",
"Ioan",
""
],
[
"Schwiebert",
"Loren",
""
],
[
"Fowler",
"Scott",
""
],
[
"Gupta",
"Sandeep K. S.",
""
]
]
| new_dataset | 0.995753 |
cs/0411053 | Didier Donsez | Areski Flissi (JACQUARD Ur-F Lifl), Philippe Merle (JACQUARD Ur-F
Lifl) | Vers un environnement multi personnalites pour la configuration et le
deploiement d'applications a base de composants logiciels | null | DECOR04 (2004) 3-14 | null | null | cs.NI | null | The multiplication of architecture description languages, component models
and platforms implies a serious dilemma for component based software
architects. On the one hand, they have to choose a language to describe
concrete configurations which will be automatically deployed on execution
platforms. On the other hand, they wish to capitalize their software
architectures independently of any description languages or platforms. To solve
this problem, we propose a multi personalities environment for the
configuration and the deployment of component based applications. This
environment is composed of a core capturing a canonical model of configuration
and deployment, and a set of personalities tailored to languages and platforms.
This paper details the architecture of such an environment and describes the
personalities for the CORBA and Fractal component models.
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 13:08:43 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Flissi",
"Areski",
"",
"JACQUARD Ur-F Lifl"
],
[
"Merle",
"Philippe",
"",
"JACQUARD Ur-F\n Lifl"
]
]
| new_dataset | 0.999643 |
cs/0411055 | Didier Donsez | Laurent Charles, Manuel Vacelet, Mohamed Chaari, Miguel Santana | SDS : Une infrastructure d'installation de logiciels libres pour des
organisations multi-sites | null | DECOR04 (2004) 37-48 | null | null | cs.NI | null | Les developpements logiciels sur les systemes UNIX font de plus en plus appel
aux logiciels libres. Nous proposons une solution de deploiement et de controle
de ces logiciels libres au sein d'une grande organisation. Nous nous attachons
particulierement a resoudre les problemes lies au deploiement multi-sites ainsi
qu'a la gestion de configuration de ces deploiements. L'originalite de notre
approche repose sur sa capacite a etre mise en oeuvre et controlee par les
utilisateurs plutot que par les administrateurs, sans necessiter d'expertise
particuliere, et par les possibilites de deploiement dans des environnements
heterogenes.
-----
Free and open source software is more and more used for software developments
on UNIX systems. We are proposing a solution to control the deployment of free
software in the context of a large corporation, focusing on multi-site
deployment and configuration management. The originality of our approach rests
on its ability to be implemented and controlled by users rather than
administrators, without requiring any particular expertise, and on its facility
to be deployed in heterogeneous environments.
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 13:27:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Charles",
"Laurent",
""
],
[
"Vacelet",
"Manuel",
""
],
[
"Chaari",
"Mohamed",
""
],
[
"Santana",
"Miguel",
""
]
]
| new_dataset | 0.990745 |
cs/0411057 | Didier Donsez | Jasminka Matevska-Meyer, Sascha Olliges, Wilhelm Hasselbring | Runtime Reconfiguration of J2EE Applications | null | DECOR04 (2004) 77-84 | null | null | cs.NI | null | Runtime reconfiguration considered as "applying required changes to a running
system" plays an important role for providing high availability not only of
safety- and mission-critical systems, but also for commercial web-applications
offering professional services. Hereby, the main concerns are maintaining the
consistency of the running system during reconfiguration and minimizing its
down-time caused by the reconfiguration. This paper focuses on the platform
independent subsystem that realises deployment and redeployment of J2EE modules
based on the new J2EE Deployment API as a part of the implementation of our
proposed system architecture enabling runtime reconfiguration of
component-based systems. Our "controlled runtime redeployment" comprises an
extension of hot deployment and dynamic reloading, complemented by allowing for
structural change
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 13:34:06 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Matevska-Meyer",
"Jasminka",
""
],
[
"Olliges",
"Sascha",
""
],
[
"Hasselbring",
"Wilhelm",
""
]
]
| new_dataset | 0.954184 |
cs/0411059 | Didier Donsez | Frederic Briclet (JACQUARD Ur-F Lifl), Christophe Contreras (JACQUARD
Ur-F Lifl), Philippe Merle (JACQUARD Ur-F Lifl) | OpenCCM : une infrastructure a composants pour le deploiement
d'applications a base de composants CORBA | null | DECOR04 (2004) 101-112 | null | null | cs.NI | null | Deployment of software components for building distributed applications
consists of the coordination of a set of basic tasks like uploading component
binaries to the execution sites, loading them in memory, instantiating
components, interconnecting their ports, setting their business and technical
attributes. The automation of the deployment process then requires the presence
of a software infrastructure distributed itself on the different execution
sites. This paper presents the characteristics of such an infrastructure for
the deployment of CORBA component-based applications. This latter is designed
and implemented in the context of our OpenCCM platform, an open source
implementation of the CORBA Component Model. The main characteristic lays on
the fact that this infrastructure is itself designed as a set of CORBA
component assemblies. This allows its dynamic assembly during its deployment
over the execution sites
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 13:35:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Briclet",
"Frederic",
"",
"JACQUARD Ur-F Lifl"
],
[
"Contreras",
"Christophe",
"",
"JACQUARD\n Ur-F Lifl"
],
[
"Merle",
"Philippe",
"",
"JACQUARD Ur-F Lifl"
]
]
| new_dataset | 0.996911 |
cs/0411060 | Didier Donsez | Stephane Frenot (ARES UR-RA) | Gestion du deploiement de composants sur reseau P2P | null | DECOR04 (2004) 113-124 | null | null | cs.NI | null | The deployment of component-based applications relies on a centralized
directory to store the components. This paper describes an approach to
distribute software components to be deployed on a set of peers of a peer to
peer network in order to exploit some associated characteristics (load
balancing, fault-tolerance, self-organisation). The proposed architecture is
situated in the context of OSGI application deployment management. The software
components (bundles) are distributed among a set of nodes participating in the
execution of services. When a node wants to install a component which is not
deployed locally, the component is looked for and installed using a p2p
network.
-----
Le deploiement d'applications a composants repose sur une approche d'annuaire
centralise de stockage des composants. Cet article decrit une approche pour
distribuer les composants logiciels a deployer sur un ensemble de noeuds d'un
reseau pair-a-pair afin de pouvoir exploiter certaines caracteristiques
associees (equilibrage de charge, tolerance de panne, auto-organisation).
L'architecture proposee entre dans le cadre de la gestion du deploiement
d'applications sur le modele OSGi. Les composants logiciels (ou bundles) sont
repartis a travers un ensemble de noeuds participant a l'execution de services.
Lorsqu'un noeud veut installer un composant et si celui-ci n'est pas encore
deploye localement, il est recherche et installe en utilisant un reseau p2p
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 13:36:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Frenot",
"Stephane",
"",
"ARES UR-RA"
]
]
| new_dataset | 0.995076 |
cs/0411062 | Didier Donsez | Didier Donsez (LSR - IMAG), Humberto Cervantes (LSR - IMAG), Mikael
Desertot (LSR - IMAG) | FROGi : Deploiement de composants Fractal sur OSGi | null | DECOR04 (2004) 147-158 | null | null | cs.NI | null | Cet article presente FROGi, une proposition visant a introduire le modele a
composants Fractal a l'interieur de la plateforme de services OSGi. La
motivation derriere ce travail est double. D'un cote, FROGi offre aux
developpeurs de services OSGi un modele a composants extensibles qui facilite
le developpement des bundles ; ces derniers restent toutefois compatibles avec
les bundles "patrimoniaux". D'un autre cote, FROGi beneficie de
l'infrastructure de deploiement que represente OSGi et qui facilite la
realisation du conditionnement et du deploiement de composants Fractal. Dans
FROGi, une application Fractal est conditionnee sous la forme d'un ou plusieurs
bundles et elle peut etre deployee de facon partielle et les activites de
deploiement peuvent avoir lieu de facon continue.
-- This paper presents FROGi, a proposal to introduce the Fractal component
model into the OSGi services platform. There are two motivations for this work.
The first one is to offer a flexible component model to the OSGi developers to
simplify bundle development. Bundles developed with FROGi are nevertheless
compatible with standard bundles. The second motivation is to leverage OSGi's
deployment capabilities to package and deploy Fractal components. In FROGi, a
Fractal application is packaged and delivered as a set of OSGi bundles; such an
application supports partial deployment and additionally, deployment activities
can occur continuously.
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 13:43:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Donsez",
"Didier",
"",
"LSR - IMAG"
],
[
"Cervantes",
"Humberto",
"",
"LSR - IMAG"
],
[
"Desertot",
"Mikael",
"",
"LSR - IMAG"
]
]
| new_dataset | 0.9842 |
cs/0411063 | Christiane Lechner | Christiane Lechner, Dana Alic, Sascha Husa | From Tensor Equations to Numerical Code -- Computer Algebra Tools for
Numerical Relativity | LaTeX llncs style, 9 pages, 1 figure, to appaer in the proceedings of
"SYNASC 2004 - 6th International Symposium on Symbolic and Numeric Algorithms
for Scientific Computing", Timisoara, Romania, September 26-30 2004 | null | null | AEI-2004-108 | cs.SC | null | In this paper we present our recent work in developing a computer-algebra
tool for systems of partial differential equations (PDEs), termed "Kranc". Our
work is motivated by the problem of finding solutions of the Einstein equations
through numerical simulations. Kranc consists of Mathematica based
computer-algebra packages, that facilitate the task of dealing with symbolic
tensorial calculations and realize the conversion of systems of partial
differential evolution equations into parallelized C or Fortran code.
| [
{
"version": "v1",
"created": "Wed, 17 Nov 2004 14:30:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lechner",
"Christiane",
""
],
[
"Alic",
"Dana",
""
],
[
"Husa",
"Sascha",
""
]
]
| new_dataset | 0.995333 |
cs/0411066 | Alex Wiesmaier | V. Karatsiolis, M. Lippert and A. Wiesmaier | Using LDAP Directories for Management of PKI Processes | 9 pages, 1 figure | In Proceedings of Public Key Infrastructure: First European PKI
Workshop: Research and Applications, EuroPKI 2004, volume 3093 of Lecture
Notes in Computer Science, pages 126-134, June 2004 | null | null | cs.CR | null | We present a framework for extending the functionality of LDAP servers from
their typical use as a public directory in public key infrastructures. In this
framework the LDAP servers are used for administrating infrastructure
processes. One application of this framework is a method for providing
proof-of-possession, especially in the case of encryption keys. Another one is
the secure delivery of software personal security environments.
| [
{
"version": "v1",
"created": "Thu, 18 Nov 2004 19:00:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Karatsiolis",
"V.",
""
],
[
"Lippert",
"M.",
""
],
[
"Wiesmaier",
"A.",
""
]
]
| new_dataset | 0.981413 |
cs/0411075 | Darran Nathan | Andreas Weisensee, Darran Nathan | A Self-Reconfigurable Computing Platform Hardware Architecture | 5 pages, 6 figures | null | null | null | cs.AR cs.DC | null | Field Programmable Gate Arrays (FPGAs) have recently been increasingly used
for highly-parallel processing of compute intensive tasks. This paper
introduces an FPGA hardware platform architecture that is PC-based, allows for
fast reconfiguration over the PCI bus, and retains a simple physical hardware
design. The design considerations are first discussed, then the resulting
system architecture designed is illustrated. Finally, experimental results on
the FPGA resources utilized for this design are presented.
| [
{
"version": "v1",
"created": "Sat, 20 Nov 2004 06:31:32 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Weisensee",
"Andreas",
""
],
[
"Nathan",
"Darran",
""
]
]
| new_dataset | 0.999676 |
cs/0411082 | Didier Donsez | Jakub Kornas (SARDES Ur-Ra Imag), Matthieu Leclercq (SARDES Ur-Ra
Imag), Vivien Quema (SARDES Ur-Ra Imag), Jean-Bernard Stefani (SARDES Ur-Ra
Imag) | Support pour la reconfiguration d'implantation dans les applications a
composants Java | null | DECOR04 (2004) 171-184 | null | null | cs.NI | null | Nowadays, numerous component models are used for various purposes: to build
applications, middleware or even operating systems. Those models commonly
support structure reconfiguration, that is modification of application's
architecture at runtime. On the other hand, very few allow implementation
reconfiguration, that is runtime modification of the code of components
building the application. In this article we present the work we performed on
JULIA, a Java-based implementation of the FRACTAL component model, in order for
it to support implementation reconfigurations. We show how we overcame the
limitations of Java class loading mechanism to allow runtime modifications of
components' implementation and interfaces. We also describe the integration of
our solution with the JULIA ADL.
| [
{
"version": "v1",
"created": "Wed, 24 Nov 2004 10:27:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kornas",
"Jakub",
"",
"SARDES Ur-Ra Imag"
],
[
"Leclercq",
"Matthieu",
"",
"SARDES Ur-Ra\n Imag"
],
[
"Quema",
"Vivien",
"",
"SARDES Ur-Ra Imag"
],
[
"Stefani",
"Jean-Bernard",
"",
"SARDES Ur-Ra\n Imag"
]
]
| new_dataset | 0.96356 |
cs/0411093 | Vlady Ravelomanana | Vlady Ravelomanana (LIPN), Loys Thimonier (LARIA) | Forbidden Subgraphs in Connected Graphs | null | null | null | null | cs.DS cs.DM math.CO | null | Given a set $\xi=\{H_1,H_2,...\}$ of connected non acyclic graphs, a
$\xi$-free graph is one which does not contain any member of $% \xi$ as copy.
Define the excess of a graph as the difference between its number of edges and
its number of vertices. Let ${\gr{W}}_{k,\xi}$ be theexponential generating
function (EGF for brief) of connected $\xi$-free graphs of excess equal to $k$
($k \geq 1$). For each fixed $\xi$, a fundamental differential recurrence
satisfied by the EGFs ${\gr{W}}_{k,\xi}$ is derived. We give methods on how to
solve this nonlinear recurrence for the first few values of $k$ by means of
graph surgery. We also show that for any finite collection $\xi$ of non-acyclic
graphs, the EGFs ${\gr{W}}_{k,\xi}$ are always rational functions of the
generating function, $T$, of Cayley's rooted (non-planar) labelled trees. From
this, we prove that almost all connected graphs with $n$ nodes and $n+k$ edges
are $\xi$-free, whenever $k=o(n^{1/3})$ and $|\xi| < \infty$ by means of
Wright's inequalities and saddle point method. Limiting distributions are
derived for sparse connected $\xi$-free components that are present when a
random graph on $n$ nodes has approximately $\frac{n}{2}$ edges. In particular,
the probability distribution that it consists of trees, unicyclic components,
$...$, $(q+1)$-cyclic components all $\xi$-free is derived. Similar results are
also obtained for multigraphs, which are graphs where self-loops and
multiple-edges are allowed.
| [
{
"version": "v1",
"created": "Thu, 25 Nov 2004 09:32:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ravelomanana",
"Vlady",
"",
"LIPN"
],
[
"Thimonier",
"Loys",
"",
"LARIA"
]
]
| new_dataset | 0.99943 |
cs/0412011 | Archil Avaliani | Archil Avaliani | Successful E-Business Systems - Paypal | 6 pages, Accepted at IADIS Conference, Lisbon. But because nobody was
able to present this research paper, it didn't publish in proceedings.
Extended version was written at International University under supervision of
Prof.Keiichi Nakata. Keywords: PayPal, Payment Systems, E-business, Money
Transactions, PayPal Analyses | null | null | null | cs.OH | null | PayPal is an account-based system that allows anyone with an email address to
send and receive online payment s. This service is easy to use for customers.
Members can instantaneously send money to anyone. Recipients are informed by
email that they have received a payment. PayPal is also available to people in
38 countries. This paper starts with introduction to the company and its
services. The information about the history and the current company situation
are covered. Later some interesting and different technical issues are
discussed. The Paper ends with analysis of the company and several future
recommendations.
| [
{
"version": "v1",
"created": "Fri, 3 Dec 2004 02:33:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Avaliani",
"Archil",
""
]
]
| new_dataset | 0.999612 |
cs/0412012 | Joanna Janik | Catherine Oriat (LSR - IMAG) | Jartege: a Tool for Random Generation of Unit Tests for Java Classes | null | null | null | RR-1069-I | cs.PL | null | This report presents Jartege, a tool which allows random generation of unit
tests for Java classes specified in JML. JML (Java Modeling Language) is a
specification language for Java which allows one to write invariants for
classes, and pre- and postconditions for operations. As in the JML-JUnit tool,
we use JML specifications on the one hand to eliminate irrelevant test cases,
and on the other hand as a test oracle. Jartege randomly generates test cases,
which consist of a sequence of constructor and method calls for the classes
under test. The random aspect of the tool can be parameterized by associating
weights to classes and operations, and by controlling the number of instances
which are created for each class under test. The practical use of Jartege is
illustrated by a small case study.
| [
{
"version": "v1",
"created": "Fri, 3 Dec 2004 12:19:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Oriat",
"Catherine",
"",
"LSR - IMAG"
]
]
| new_dataset | 0.999629 |
cs/0412013 | Jean-Christophe Dubacq | Jean-Christophe Dubacq (LIPN, GREYC), Veronique Terrier (GREYC) | Signals for Cellular Automata in dimension 2 or higher | null | LATIN 2002: Theoretical Informatics (2002) 451-464 | null | null | cs.CC cs.DC cs.DM math.CO | null | We investigate how increasing the dimension of the array can help to draw
signals on cellular automata.We show the existence of a gap of constructible
signals in any dimension. We exhibit two cellular automata in dimension 2 to
show that increasing the dimension allows to reduce the number of states
required for some constructions.
| [
{
"version": "v1",
"created": "Fri, 3 Dec 2004 16:35:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Dubacq",
"Jean-Christophe",
"",
"LIPN, GREYC"
],
[
"Terrier",
"Veronique",
"",
"GREYC"
]
]
| new_dataset | 0.994065 |
cs/0412050 | Vedran Kordic | Yongsheng Ou & Yangsheng Xu | Gyroscopically Stabilized Robot: Balance and Tracking | null | International Journal of Advanced Robotic Systems, Volume 1,
Number 1, March 2004, pp.23-32 | null | null | cs.RO | null | The single wheel, gyroscopically stabilized robot - Gyrover, is a dynamically
stable but statically unstable, underactuated system. In this paper, based on
the dynamic model of the robot, we investigate two classes of nonholonomic
constraints associated with the system. Then, based on the backstepping
technology, we propose a control law for balance control of Gyrover. Next,
through transferring the systems states from Cartesian coordinate to polar
coordinate, control laws for point-to-point control and line tracking in
Cartesian space are provided.
| [
{
"version": "v1",
"created": "Sat, 11 Dec 2004 12:38:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ou",
"Yongsheng",
""
],
[
"Xu",
"Yangsheng",
""
]
]
| new_dataset | 0.999515 |
cs/0412052 | Vedran Kordic | Olivier Michel | WebotsTM: Professional Mobile Robot Simulation | null | International Journal of Advanced Robotic Systems, Volume 1,
Number 1, March 2004, pp.39-42 | null | null | cs.RO | null | Cyberbotics Ltd. develops WebotsTM, a mobile robotics simulation software
that provides you with a rapid prototyping environment for modelling,
programming and simulating mobile robots. The provided robot libraries enable
you to transfer your control programs to several commercially available real
mobile robots. WebotsTM lets you define and modify a complete mobile robotics
setup, even several different robots sharing the same environment. For each
object, you can define a number of properties, such as shape, color, texture,
mass, friction, etc. You can equip each robot with a large number of available
sensors and actuators. You can program these robots using your favorite
development environment, simulate them and optionally transfer the resulting
programs onto your real robots. WebotsTM has been developed in collaboration
with the Swiss Federal Institute of Technology in Lausanne, thoroughly tested,
well documented and continuously maintained for over 7 years. It is now the
main commercial product available from Cyberbotics Ltd.
| [
{
"version": "v1",
"created": "Sat, 11 Dec 2004 12:45:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Michel",
"Olivier",
""
]
]
| new_dataset | 0.999757 |
cs/0412055 | Vedran Kordic | Alan P. Kypson and W. Randolph Chitwood Jr | Robotic Applications in Cardiac Surgery | null | International Journal of Advanced Robotic Systems, Volume 1,
Number 2, June 2004, pp.87-92 | null | null | cs.RO | null | Traditionally, cardiac surgery has been performed through a median
sternotomy, which allows the surgeon generous access to the heart and
surrounding great vessels. As a paradigm shift in the size and location of
incisions occurs in cardiac surgery, new methods have been developed to allow
the surgeon the same amount of dexterity and accessibility to the heart in
confined spaces and in a less invasive manner. Initially, long instruments
without pivot points were used, however, more recent robotic telemanipulation
systems have been applied that allow for improved dexterity, enabling the
surgeon to perform cardiac surgery from a distance not previously possible. In
this rapidly evolving field, we review the recent history and clinical results
of using robotics in cardiac surgery.
| [
{
"version": "v1",
"created": "Sat, 11 Dec 2004 12:52:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kypson",
"Alan P.",
""
],
[
"Chitwood",
"W. Randolph",
"Jr"
]
]
| new_dataset | 0.980848 |
cs/0412056 | Vedran Kordic | Nikita Pashenkov & Ryuichi Iwamasa | One-Chip Solution to Intelligent Robot Control: Implementing Hexapod
Subsumption Architecture Using a Contemporary Microprocessor | null | International Journal of Advanced Robotic Systems, Volume 1,
Number 2, June 2004, pp. 93-98 | null | null | cs.RO | null | This paper introduces a six-legged autonomous robot managed by a single
controller and a software core modeled on subsumption architecture. We begin by
discussing the features and capabilities of IsoPod, a new processor for
robotics which has enabled a streamlined implementation of our project. We
argue that this processor offers a unique set of hardware and software
features, making it a practical development platform for robotics in general
and for subsumption-based control architectures in particular. Next, we
summarize original ideas on subsumption architecture implementation for a
six-legged robot, as presented by its inventor Rodney Brooks in 1980s. A
comparison is then made to a more recent example of a hexapod control
architecture based on subsumption. The merits of both systems are analyzed and
a new subsumption architecture layout is formulated as a response. We conclude
with some remarks regarding the development of this project as a hint at new
potentials for intelligent robot design, opened by a recent development in
embedded controller market.
| [
{
"version": "v1",
"created": "Sat, 11 Dec 2004 12:55:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pashenkov",
"Nikita",
""
],
[
"Iwamasa",
"Ryuichi",
""
]
]
| new_dataset | 0.974442 |
cs/0412069 | Vitorino Ramos Dr. | Vitorino Ramos, Jonathan Campbell, John Slater, John Gillespie, Ivan
F. Bendezu, Fionn Murtagh | Swarming around Shellfish Larvae | 11 pages, 4 figures,
http://alfa.ist.utl.pt/~cvrm/staff/vramos/ref_53.html, submitted to IbPRIA
2005, Portugal | null | null | null | cs.AI cs.CV | null | The collection of wild larvae seed as a source of raw material is a major sub
industry of shellfish aquaculture. To predict when, where and in what
quantities wild seed will be available, it is necessary to track the appearance
and growth of planktonic larvae. One of the most difficult groups to identify,
particularly at the species level are the Bivalvia. This difficulty arises from
the fact that fundamentally all bivalve larvae have a similar shape and colour.
Identification based on gross morphological appearance is limited by the
time-consuming nature of the microscopic examination and by the limited
availability of expertise in this field. Molecular and immunological methods
are also being studied. We describe the application of computational pattern
recognition methods to the automated identification and size analysis of
scallop larvae. For identification, the shape features used are binary
invariant moments; that is, the features are invariant to shift (position
within the image), scale (induced either by growth or differential image
magnification) and rotation. Images of a sample of scallop and non-scallop
larvae covering a range of maturities have been analysed. In order to overcome
the automatic identification, as well as to allow the system to receive new
unknown samples at any moment, a self-organized and unsupervised ant-like
clustering algorithm based on Swarm Intelligence is proposed, followed by
simple k-NNR nearest neighbour classification on the final map. Results achieve
a full recognition rate of 100% under several situations (k =1 or 3).
| [
{
"version": "v1",
"created": "Fri, 17 Dec 2004 13:30:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ramos",
"Vitorino",
""
],
[
"Campbell",
"Jonathan",
""
],
[
"Slater",
"John",
""
],
[
"Gillespie",
"John",
""
],
[
"Bendezu",
"Ivan F.",
""
],
[
"Murtagh",
"Fionn",
""
]
]
| new_dataset | 0.999404 |
cs/0412075 | Vitorino Ramos Dr. | Vitorino Ramos, Juan J. Merelo | Self-Organized Stigmergic Document Maps: Environment as a Mechanism for
Context Learning | 10 pages, 5 figures, at
http://alfa.ist.utl.pt/~cvrm/staff/vramos/ref_42.html | in AEB 2002, 1st Spanish Conference on Evolutionary and
Bio-Inspired Algorithms, E. Alba, F. Herrera, J.J. Merelo et al. (Eds.), pp.
284-293, Centro Univ. de Merida, Merida, Spain, 6-8 Feb. 2002 | null | null | cs.AI cs.DC | null | Social insect societies and more specifically ant colonies, are distributed
systems that, in spite of the simplicity of their individuals, present a highly
structured social organization. As a result of this organization, ant colonies
can accomplish complex tasks that in some cases exceed the individual
capabilities of a single ant. The study of ant colonies behavior and of their
self-organizing capabilities is of interest to knowledge retrieval/management
and decision support systems sciences, because it provides models of
distributed adaptive organization which are useful to solve difficult
optimization, classification, and distributed control problems, among others.
In the present work we overview some models derived from the observation of
real ants, emphasizing the role played by stigmergy as distributed
communication paradigm, and we present a novel strategy to tackle unsupervised
clustering as well as data retrieval problems. The present ant clustering
system (ACLUSTER) avoids not only short-term memory based strategies, as well
as the use of several artificial ant types (using different speeds), present in
some recent approaches. Moreover and according to our knowledge, this is also
the first application of ant systems into textual document clustering.
KEYWORDS: Swarm Intelligence, Ant Systems, Unsupervised Clustering, Data
Retrieval, Data Mining, Distributed Computing, Document Maps, Textual Document
Clustering.
| [
{
"version": "v1",
"created": "Fri, 17 Dec 2004 15:47:44 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ramos",
"Vitorino",
""
],
[
"Merelo",
"Juan J.",
""
]
]
| new_dataset | 0.992037 |
cs/0412078 | David Renault | D. Renault | The vertex-transitive TLF-planar graphs | Article : 23 pages, 15 figures Appendix : 13 pages, 72 figures
Submitted to Discrete Mathematics The appendix is accessible at
http://www.labri.fr/~renault/research/research.html | null | null | null | cs.DM | null | We consider the class of the topologically locally finite (in short TLF)
planar vertex-transitive graphs, a class containing in particular all the
one-ended planar Cayley graphs and the normal transitive tilings. We
characterize these graphs with a finite local representation and a special kind
of finite state automaton named labeling scheme. As a result, we are able to
enumerate and describe all TLF-planar vertex-transitive graphs of any given
degree. Also, we are able decide to whether any TLF-planar transitive graph is
Cayley or not.
| [
{
"version": "v1",
"created": "Fri, 17 Dec 2004 16:18:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Renault",
"D.",
""
]
]
| new_dataset | 0.981564 |
cs/0412079 | Vitorino Ramos Dr. | Vitorino Ramos | The MC2 Project [Machines of Collective Conscience]: A possible walk, up
to Life-like Complexity and Behaviour, from bottom, basic and simple
bio-inspired heuristics - a walk, up into the morphogenesis of information | 14 pages, Project at
http://alfa.ist.utl.pt/~cvrm/staff/vramos/MC2.html | at UTOPIA Biennial Art Exposition CATALOGUE, Cascais, Portugal,
July 12-22, 2001 | null | null | cs.AI cs.MM | null | Synergy (from the Greek word synergos), broadly defined, refers to combined
or co-operative effects produced by two or more elements (parts or
individuals). The definition is often associated with the holistic conviction
quote that "the whole is greater than the sum of its parts" (Aristotle, in
Metaphysics), or the whole cannot exceed the sum of the energies invested in
each of its parts (e.g. first law of thermodynamics) even if it is more
accurate to say that the functional effects produced by wholes are different
from what the parts can produce alone. Synergy is a ubiquitous phenomena in
nature and human societies alike. One well know example is provided by the
emergence of self-organization in social insects, via direct or indirect
interactions. The latter types are more subtle and defined as stigmergy to
explain task coordination and regulation in the context of nest reconstruction
in termites. An example, could be provided by two individuals, who interact
indirectly when one of them modifies the environment and the other responds to
the new environment at a later time. In other words, stigmergy could be defined
as a particular case of environmental or spatial synergy. The system is purely
holistic, and their properties are intrinsically emergent and autocatalytic. On
the present work we present a "machine" where there is no precommitment to any
particular representational scheme: the desired behaviour is distributed and
roughly specified simultaneously among many parts, but there is minimal
specification of the mechanism required to generate that behaviour, i.e. the
global behaviour evolves from the many relations of multiple simple behaviours.
| [
{
"version": "v1",
"created": "Fri, 17 Dec 2004 16:28:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ramos",
"Vitorino",
""
]
]
| new_dataset | 0.991078 |
cs/0412081 | Vitorino Ramos Dr. | Vitorino Ramos | Artificial Neoteny in Evolutionary Image Segmentation | 10 pages, 4 figures | SIARP 2000 - 5th IberoAmerican Symp. on Pattern Rec., F. Muge,
Moises P. and R. Caldas Pinto (Eds.), ISBN 972-97711-1-1, pp. 69-78, Lisbon,
Portugal, 11-13 Sep. 2000 | null | null | cs.AI cs.NE | null | Neoteny, also spelled Paedomorphosis, can be defined in biological terms as
the retention by an organism of juvenile or even larval traits into later life.
In some species, all morphological development is retarded; the organism is
juvenilized but sexually mature. Such shifts of reproductive capability would
appear to have adaptive significance to organisms that exhibit it. In terms of
evolutionary theory, the process of paedomorphosis suggests that larval stages
and developmental phases of existing organisms may give rise, under certain
circumstances, to wholly new organisms. Although the present work does not
pretend to model or simulate the biological details of such a concept in any
way, these ideas were incorporated by a rather simple abstract computational
strategy, in order to allow (if possible) for faster convergence into simple
non-memetic Genetic Algorithms, i.e. without using local improvement procedures
(e.g. via Baldwin or Lamarckian learning). As a case-study, the Genetic
Algorithm was used for colour image segmentation purposes by using K-mean
unsupervised clustering methods, namely for guiding the evolutionary algorithm
in his search for finding the optimal or sub-optimal data partition. Average
results suggest that the use of neotonic strategies by employing juvenile
genotypes into the later generations and the use of linear-dynamic mutation
rates instead of constant, can increase fitness values by 58% comparing to
classical Genetic Algorithms, independently from the starting population
characteristics on the search space. KEYWORDS: Genetic Algorithms, Artificial
Neoteny, Dynamic Mutation Rates, Faster Convergence, Colour Image Segmentation,
Classification, Clustering.
| [
{
"version": "v1",
"created": "Fri, 17 Dec 2004 16:44:54 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Ramos",
"Vitorino",
""
]
]
| new_dataset | 0.999419 |
cs/0412093 | Alasdair Earl | A. Earl, P. Clark, S. Thorn | ScotGrid: A Prototype Tier 2 Centre | 4 pages, 4 diagrams. Presented at Computing for High Energy and
Nuclear Physics 2004 (CHEP '04). Interlaken, Switzerland, September 2004 | null | null | null | cs.AR cs.DC | null | ScotGrid is a prototype regional computing centre formed as a collaboration
between the universities of Durham, Edinburgh and Glasgow as part of the UK's
national particle physics grid, GridPP. We outline the resources available at
the three core sites and our optimisation efforts for our user communities. We
discuss the work which has been conducted in extending the centre to embrace
new projects both from particle physics and new user communities and explain
our methodology for doing this.
| [
{
"version": "v1",
"created": "Mon, 20 Dec 2004 11:55:30 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Earl",
"A.",
""
],
[
"Clark",
"P.",
""
],
[
"Thorn",
"S.",
""
]
]
| new_dataset | 0.999748 |
cs/0501009 | Mircea Alexandru Popescu Moscu | Mircea Alexandru Popescu Moscu | On The Liniar Time Complexity of Finite Languages | null | null | null | null | cs.CC | null | The present paper presents and proves a proposition concerning the time
complexity of finite languages. It is shown herein, that for any finite
language (a language for which the set of words composing it is finite) there
is a Turing machine that computes the language in such a way that for any input
of length k the machine stops in, at most, k + 1 steps.
| [
{
"version": "v1",
"created": "Wed, 5 Jan 2005 19:13:05 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Moscu",
"Mircea Alexandru Popescu",
""
]
]
| new_dataset | 0.999235 |
cs/0501012 | Carl Lagoze | Carl Lagoze, Sandy Payette, Edwin Shin, Chris Wilper | Fedora: An Architecture for Complex Objects and their Relationships | 25 pages, 8 figures Draft of submission to Journal of Digital
Libraries Special Issue on Complex Objects | null | null | null | cs.DL cs.MM | null | The Fedora architecture is an extensible framework for the storage,
management, and dissemination of complex objects and the relationships among
them. Fedora accommodates the aggregation of local and distributed content into
digital objects and the association of services with objects. This al-lows an
object to have several accessible representations, some of them dy-namically
produced. The architecture includes a generic RDF-based relation-ship model
that represents relationships among objects and their components. Queries
against these relationships are supported by an RDF triple store. The
architecture is implemented as a web service, with all aspects of the complex
object architecture and related management functions exposed through REST and
SOAP interfaces. The implementation is available as open-source soft-ware,
providing the foundation for a variety of end-user applications for digital
libraries, archives, institutional repositories, and learning object systems.
| [
{
"version": "v1",
"created": "Fri, 7 Jan 2005 17:57:05 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Jan 2005 13:16:45 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Feb 2005 20:13:37 GMT"
},
{
"version": "v4",
"created": "Mon, 7 Mar 2005 15:14:47 GMT"
},
{
"version": "v5",
"created": "Fri, 29 Jul 2005 13:04:31 GMT"
},
{
"version": "v6",
"created": "Tue, 23 Aug 2005 13:26:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lagoze",
"Carl",
""
],
[
"Payette",
"Sandy",
""
],
[
"Shin",
"Edwin",
""
],
[
"Wilper",
"Chris",
""
]
]
| new_dataset | 0.997054 |
cs/0501013 | Shujun Li Dr. | Chengqing Li, Shujun Li, Der-Chyuan Lou and Dan Zhang | On the security of the Yen-Guo's domino signal encryption algorithm
(DSEA) | 11 pages, 5 figures | Journal of Systems and Software, vol. 79, no. 2, pp. 253-258, 2006 | 10.1016/j.jss.2005.04.021 | null | cs.CR cs.MM nlin.CD | null | Recently, a new domino signal encryption algorithm (DSEA) was proposed for
digital signal transmission, especially for digital images and videos. This
paper analyzes the security of DSEA, and points out the following weaknesses:
1) its security against the brute-force attack was overestimated; 2) it is not
sufficiently secure against ciphertext-only attacks, and only one ciphertext is
enough to get some information about the plaintext and to break the value of a
sub-key; 3) it is insecure against known/chosen-plaintext attacks, in the sense
that the secret key can be recovered from a number of continuous bytes of only
one known/chosen plaintext and the corresponding ciphertext. Experimental
results are given to show the performance of the proposed attacks, and some
countermeasures are discussed to improve DSEA.
| [
{
"version": "v1",
"created": "Sat, 8 Jan 2005 15:35:13 GMT"
},
{
"version": "v2",
"created": "Sun, 27 Aug 2006 17:27:34 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Chengqing",
""
],
[
"Li",
"Shujun",
""
],
[
"Lou",
"Der-Chyuan",
""
],
[
"Zhang",
"Dan",
""
]
]
| new_dataset | 0.992067 |
cs/0501014 | Shujun Li Dr. | Shujun Li, Guanrong Chen, Albert Cheung, Bharat Bhargava and Kwok-Tung
Lo | On the Design of Perceptual MPEG-Video Encryption Algorithms | 10 pages, 5 figures, IEEEtran.cls | IEEE Transactions on Circuits and Systems for Video Technology,
vol. 17, no. 2, pp. 214-223, 2007 | 10.1109/TCSVT.2006.888840 | null | cs.MM cs.CR | null | In this paper, some existing perceptual encryption algorithms of MPEG videos
are reviewed and some problems, especially security defects of two recently
proposed MPEG-video perceptual encryption schemes, are pointed out. Then, a
simpler and more effective design is suggested, which selectively encrypts
fixed-length codewords (FLC) in MPEG-video bitstreams under the control of
three perceptibility factors. The proposed design is actually an encryption
configuration that can work with any stream cipher or block cipher. Compared
with the previously-proposed schemes, the new design provides more useful
features, such as strict size-preservation, on-the-fly encryption and multiple
perceptibility, which make it possible to support more applications with
different requirements. In addition, four different measures are suggested to
provide better security against known/chosen-plaintext attacks.
| [
{
"version": "v1",
"created": "Sat, 8 Jan 2005 15:55:30 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Aug 2006 11:30:21 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Mar 2007 17:12:49 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Li",
"Shujun",
""
],
[
"Chen",
"Guanrong",
""
],
[
"Cheung",
"Albert",
""
],
[
"Bhargava",
"Bharat",
""
],
[
"Lo",
"Kwok-Tung",
""
]
]
| new_dataset | 0.979646 |
cs/0502002 | Manoj Kumar | Manoj Kumar | Directed Threshold Multi – Signature Scheme without SDC | 13 pages | null | null | null | cs.CR | null | In this paper, we propose a Directed threshold multisignature scheme without
SDC. This signature scheme is applicable when the message is sensitive to the
signature receiver; and the signatures are generated by the cooperation of a
number of people from a given group of senders. In this scheme, any malicious
set of signers cannot impersonate any other set of signers to forge the
signatures. In case of forgery, it is possible to trace the signing set.
| [
{
"version": "v1",
"created": "Tue, 1 Feb 2005 06:29:56 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kumar",
"Manoj",
""
]
]
| new_dataset | 0.982645 |
cs/0502013 | Robert Hearn | Robert A. Hearn | Amazons is PSPACE-complete | 7 pages, 5 figures. For 2005 Combinatorial Game Theory Workshop at
BIRS | null | null | null | cs.CC cs.GT | null | Amazons is a board game which combines elements of Chess and Go. It has
become popular in recent years, and has served as a useful platform for both
game-theoretic study and AI games research. Buro showed that simple Amazons
endgames are NP-equivalent, leaving the complexity of the general case as an
open problem.
We settle this problem, by showing that deciding the outcome of an n x n
Amazons position is PSPACE-hard. We give a reduction from one of the
PSPACE-complete two-player formula games described by Schaefer. Since the
number of moves in an Amazons game is polynomially bounded (unlike Chess and
Go), Amazons is in PSPACE. It is thus on a par with other two-player,
bounded-move, perfect-information games such as Hex, Othello, and Kayles. Our
construction also provides an alternate proof that simple Amazons endgames are
NP-equivalent.
Our reduction uses a number of amazons polynomial in the input formula
length; a remaining open problem is the complexity of Amazons when only a
constant number of amazons is used.
| [
{
"version": "v1",
"created": "Wed, 2 Feb 2005 18:55:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hearn",
"Robert A.",
""
]
]
| new_dataset | 0.998825 |
cs/0502025 | Hahnsang Kim | Hahnsang Kim, Theirry Turletti, Amar Bouali | EPspectra: A Formal Toolkit for Developing DSP Software Applications | 31 pages | null | null | null | cs.LO cs.SE | null | The software approach to developing Digital Signal Processing (DSP)
applications brings some great features such as flexibility, re-usability of
resources and easy upgrading of applications. However, it requires long and
tedious tests and verification phases because of the increasing complexity of
the software. This implies the need of a software programming environment
capable of putting together DSP modules and providing facilities to debug,
verify and validate the code. The objective of the work is to provide such
facilities as simulation and verification for developing DSP software
applications. This led us to develop an extension toolkit, Epspectra, built
upon Pspectra, one of the first toolkits available to design basic software
radio applications on standard PC workstations. In this paper, we first present
Epspectra, an Esterel-based extension of Pspectra that makes the design and
implementation of portable DSP applications easier. It allows drastic reduction
of testing and verification time while requiring relatively little expertise in
formal verification methods. Second, we demonstrate the use of Epspectra,
taking as an example the radio interface part of a GSM base station. We also
present the verification procedures for the three safety properties of the
implementation programs which have complex control-paths. These have to obey
strict scheduling rules. In addition, Epspectra achieves the verification of
the targeted application since the same model is used for the executable code
generation and for the formal verification.
| [
{
"version": "v1",
"created": "Fri, 4 Feb 2005 15:11:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kim",
"Hahnsang",
""
],
[
"Turletti",
"Theirry",
""
],
[
"Bouali",
"Amar",
""
]
]
| new_dataset | 0.996495 |
cs/0502031 | Riccardo Pucella | Riccardo Pucella | Logic Column 11: The Finite and the Infinite in Temporal Logic | 14 pages | SIGACT News, 36(1), pp. 86-99, 2005 | null | null | cs.LO | null | This article examines the interpretation of the LTL temporal operators over
finite and infinite sequences. This is used as the basis for deriving a sound
and complete axiomatization for Caret, a recent temporal logic for reasoning
about programs with nested procedure calls and returns.
| [
{
"version": "v1",
"created": "Sat, 5 Feb 2005 21:00:13 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Apr 2005 17:51:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pucella",
"Riccardo",
""
]
]
| new_dataset | 0.988996 |
cs/0502068 | John Tromp | John Tromp and Rudi Cilibrasi | Limits of Rush Hour Logic Complexity | null | null | null | null | cs.CC | null | Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation
inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally
or vertically within a parking lot. The authors show how the model supports
polynomial space computation, using certain car configurations as building
blocks to construct boolean circuits for a cpu and memory. They consider the
use of cars of length 3 crucial to their construction, and conjecture that cars
of size 2 only, which we'll call `Size 2 Rush Hour', do not support polynomial
space computation. We settle this conjecture by showing that the required
building blocks are constructible in Size 2 Rush Hour. Furthermore, we consider
Unit Rush Hour, which was hitherto believed to be trivial, show its relation to
maze puzzles, and provide empirical support for its hardness.
| [
{
"version": "v1",
"created": "Tue, 15 Feb 2005 14:22:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Tromp",
"John",
""
],
[
"Cilibrasi",
"Rudi",
""
]
]
| new_dataset | 0.998994 |
cs/0502070 | Erik Demaine | Erik D. Demaine and MohammadTaghi Hajiaghayi | Bidimensionality, Map Graphs, and Grid Minors | 12 pages | null | null | null | cs.DM cs.DS | null | In this paper we extend the theory of bidimensionality to two families of
graphs that do not exclude fixed minors: map graphs and power graphs. In both
cases we prove a polynomial relation between the treewidth of a graph in the
family and the size of the largest grid minor. These bounds improve the running
times of a broad class of fixed-parameter algorithms. Our novel technique of
using approximate max-min relations between treewidth and size of grid minors
is powerful, and we show how it can also be used, e.g., to prove a linear
relation between the treewidth of a bounded-genus graph and the treewidth of
its dual.
| [
{
"version": "v1",
"created": "Wed, 16 Feb 2005 19:01:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Hajiaghayi",
"MohammadTaghi",
""
]
]
| new_dataset | 0.990993 |
cs/0502086 | Pierre-Yves Oudeyer | Pierre-Yves Oudeyer | The Self-Organization of Speech Sounds | null | Journal of Theoretical Biology 233 (2005) Issue 3, Pages 435-449 | null | null | cs.LG cs.AI cs.CL cs.NE cs.RO math.DS | null | The speech code is a vehicle of language: it defines a set of forms used by a
community to carry information. Such a code is necessary to support the
linguistic interactions that allow humans to communicate. How then may a speech
code be formed prior to the existence of linguistic interactions? Moreover, the
human speech code is discrete and compositional, shared by all the individuals
of a community but different across communities, and phoneme inventories are
characterized by statistical regularities. How can a speech code with these
properties form? We try to approach these questions in the paper, using the
"methodology of the artificial". We build a society of artificial agents, and
detail a mechanism that shows the formation of a discrete speech code without
pre-supposing the existence of linguistic capacities or of coordinated
interactions. The mechanism is based on a low-level model of sensory-motor
interactions. We show that the integration of certain very simple and non
language-specific neural devices leads to the formation of a speech code that
has properties similar to the human speech code. This result relies on the
self-organizing properties of a generic coupling between perception and
production within agents, and on the interactions between agents. The
artificial system helps us to develop better intuitions on how speech might
have appeared, by showing how self-organization might have helped natural
selection to find speech.
| [
{
"version": "v1",
"created": "Tue, 22 Feb 2005 09:51:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Oudeyer",
"Pierre-Yves",
""
]
]
| new_dataset | 0.989758 |
cs/0502090 | Achim Streit | A. Streit, D. Erwin, Th. Lippert, D. Mallmann, R. Menday, M. Rambadt,
M. Riedel, M. Romberg, B. Schuller, Ph. Wieder | UNICORE - From Project Results to Production Grids | 21 pages, 3 figures | null | null | null | cs.DC cs.OS | null | The UNICORE Grid-technology provides a seamless, secure and intuitive access
to distributed Grid resources. In this paper we present the recent evolution
from project results to production Grids. At the beginning UNICORE was
developed as a prototype software in two projects funded by the German research
ministry (BMBF). Over the following years, in various European-funded projects,
UNICORE evolved to a full-grown and well-tested Grid middleware system, which
today is used in daily production at many supercomputing centers worldwide.
Beyond this production usage, the UNICORE technology serves as a solid basis in
many European and International research projects, which use existing UNICORE
components to implement advanced features, high level services, and support for
applications from a growing range of domains. In order to foster these ongoing
developments, UNICORE is available as open source under BSD licence at
SourceForge, where new releases are published on a regular basis. This paper is
a review of the UNICORE achievements so far and gives a glimpse on the UNICORE
roadmap.
| [
{
"version": "v1",
"created": "Thu, 24 Feb 2005 14:13:56 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Streit",
"A.",
""
],
[
"Erwin",
"D.",
""
],
[
"Lippert",
"Th.",
""
],
[
"Mallmann",
"D.",
""
],
[
"Menday",
"R.",
""
],
[
"Rambadt",
"M.",
""
],
[
"Riedel",
"M.",
""
],
[
"Romberg",
"M.",
""
],
[
"Schuller",
"B.",
""
],
[
"Wieder",
"Ph.",
""
]
]
| new_dataset | 0.988123 |
cs/0503009 | Valmir Barbosa | R. S. C. Leao, V. C. Barbosa | Minimal chordal sense of direction and circulant graphs | null | Lecture Notes in Computer Science 4162 (2006), 670-680 | 10.1007/11821069_58 | null | cs.DM | null | A sense of direction is an edge labeling on graphs that follows a globally
consistent scheme and is known to considerably reduce the complexity of several
distributed problems. In this paper, we study a particular instance of sense of
direction, called a chordal sense of direction (CSD). In special, we identify
the class of k-regular graphs that admit a CSD with exactly k labels (a minimal
CSD). We prove that connected graphs in this class are Hamiltonian and that the
class is equivalent to that of circulant graphs, presenting an efficient
(polynomial-time) way of recognizing it when the graphs' degree k is fixed.
| [
{
"version": "v1",
"created": "Thu, 3 Mar 2005 12:06:10 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Leao",
"R. S. C.",
""
],
[
"Barbosa",
"V. C.",
""
]
]
| new_dataset | 0.979818 |
cs/0503014 | Christian W. Straka | Christian W. Straka | ADF95: Tool for automatic differentiation of a FORTRAN code designed for
large numbers of independent variables | 24 pages, 2 figures, 4 tables, accepted in Computer Physics
Communications | null | 10.1016/j.cpc.2005.01.011 | null | cs.MS | null | ADF95 is a tool to automatically calculate numerical first derivatives for
any mathematical expression as a function of user defined independent
variables. Accuracy of derivatives is achieved within machine precision. ADF95
may be applied to any FORTRAN 77/90/95 conforming code and requires minimal
changes by the user. It provides a new derived data type that holds the value
and derivatives and applies forward differencing by overloading all FORTRAN
operators and intrinsic functions. An efficient indexing technique leads to a
reduced memory usage and a substantially increased performance gain over other
available tools with operator overloading. This gain is especially pronounced
for sparse systems with large number of independent variables. A wide class of
numerical simulations, e.g., those employing implicit solvers, can profit from
ADF95.
| [
{
"version": "v1",
"created": "Fri, 4 Mar 2005 19:20:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Straka",
"Christian W.",
""
]
]
| new_dataset | 0.963054 |
cs/0503016 | Xiaoming Liu | Xiaoming Liu, Lyudmila Balakireva, Patrick Hochstenbach, Herbert Van
de Sompel | File-based storage of Digital Objects and constituent datastreams:
XMLtapes and Internet Archive ARC files | 12 pages, 1 figures (camera-ready copy for ECDL 2005) | null | null | null | cs.DL | null | This paper introduces the write-once/read-many XMLtape/ARC storage approach
for Digital Objects and their constituent datastreams. The approach combines
two interconnected file-based storage mechanisms that are made accessible in a
protocol-based manner. First, XML-based representations of multiple Digital
Objects are concatenated into a single file named an XMLtape. An XMLtape is a
valid XML file; its format definition is independent of the choice of the
XML-based complex object format by which Digital Objects are represented. The
creation of indexes for both the identifier and the creation datetime of the
XML-based representation of the Digital Objects facilitates OAI-PMH-based
access to Digital Objects stored in an XMLtape. Second, ARC files, as
introduced by the Internet Archive, are used to contain the constituent
datastreams of the Digital Objects in a concatenated manner. An index for the
identifier of the datastream facilitates OpenURL-based access to an ARC file.
The interconnection between XMLtapes and ARC files is provided by conveying the
identifiers of ARC files associated with an XMLtape as administrative
information in the XMLtape, and by including OpenURL references to constituent
datastreams of a Digital Object in the XML-based representation of that Digital
Object.
| [
{
"version": "v1",
"created": "Mon, 7 Mar 2005 23:17:23 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Jun 2005 17:27:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Liu",
"Xiaoming",
""
],
[
"Balakireva",
"Lyudmila",
""
],
[
"Hochstenbach",
"Patrick",
""
],
[
"Van de Sompel",
"Herbert",
""
]
]
| new_dataset | 0.997419 |
cs/0503024 | Dan Tufis I. | Dan Tufis, Radu Ion, Nancy Ide | Fine-Grained Word Sense Disambiguation Based on Parallel Corpora, Word
Alignment, Word Clustering and Aligned Wordnets | 7 pages in Proc. of COLING2005 | In proceedings of the 20th International Conference on
Computational Linguistics, COLING2004, Geneva, 2004, pp. 1312-1318 | null | null | cs.AI cs.CL | null | The paper presents a method for word sense disambiguation based on parallel
corpora. The method exploits recent advances in word alignment and word
clustering based on automatic extraction of translation equivalents and being
supported by available aligned wordnets for the languages in the corpus. The
wordnets are aligned to the Princeton Wordnet, according to the principles
established by EuroWordNet. The evaluation of the WSD system, implementing the
method described herein showed very encouraging results. The same system used
in a validation mode, can be used to check and spot alignment errors in
multilingually aligned wordnets as BalkaNet and EuroWordNet.
| [
{
"version": "v1",
"created": "Thu, 10 Mar 2005 11:49:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Tufis",
"Dan",
""
],
[
"Ion",
"Radu",
""
],
[
"Ide",
"Nancy",
""
]
]
| new_dataset | 0.990806 |
cs/0503048 | Arindam Mitra | Arindam Mitra | Is entanglement necessary to have unconditional security in quantum bit
commitment ? | Pdf. 2 pages. Revised | null | null | null | cs.CR | null | A simple un-entanglement based quantum bit commitment scheme is presented.
Although commitment is unconditionally secure but concealment is not.
| [
{
"version": "v1",
"created": "Mon, 21 Mar 2005 15:20:14 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Nov 2005 15:39:44 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Mar 2006 13:58:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mitra",
"Arindam",
""
]
]
| new_dataset | 0.99439 |
cs/0503069 | Michael Nelson | Michael L. Nelson, Herbert Van de Sompel, Xiaoming Liu, Terry L.
Harrison, Nathan McFarland | mod_oai: An Apache Module for Metadata Harvesting | null | null | null | null | cs.DL | null | We describe mod_oai, an Apache 2.0 module that implements the Open Archives
Initiative Protocol for Metadata Harvesting (OAI-PMH). OAIPMH is the de facto
standard for metadata exchange in digital libraries and allows repositories to
expose their contents in a structured, application-neutral format with
semantics optimized for accurate incremental harvesting. Current
implementations of OAI-PMH are either separate applications that access an
existing repository, or are built-in to repository software packages. mod_oai
is different in that it optimizes harvesting web content by building OAI-PMH
capability into the Apache server. We discuss the implications of adding
harvesting capability to an Apache server and describe our initial experimental
results accessing a departmental web site using both web crawling and OAIPMH
harvesting techniques.
| [
{
"version": "v1",
"created": "Thu, 24 Mar 2005 14:38:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Nelson",
"Michael L.",
""
],
[
"Van de Sompel",
"Herbert",
""
],
[
"Liu",
"Xiaoming",
""
],
[
"Harrison",
"Terry L.",
""
],
[
"McFarland",
"Nathan",
""
]
]
| new_dataset | 0.970199 |
cs/0503073 | Viktor Toth | Viktor Toth | Tensor manipulation in GPL Maxima | 26 pages (some formulae fixed, terminology usage corrected, comments
added on improved tensor contraction algorithm) | null | null | null | cs.SC | null | GPL Maxima is an open-source computer algebra system based on DOE-MACSYMA.
GPL Maxima included two tensor manipulation packages from DOE-MACSYMA, but
these were in various states of disrepair. One of the two packages, CTENSOR,
implemented component-based tensor manipulation; the other, ITENSOR, treated
tensor symbols as opaque, manipulating them based on their index properties.
The present paper describes the state in which these packages were found, the
steps that were needed to make the packages fully functional again, and the new
functionality that was implemented to make them more versatile. A third
package, ATENSOR, was also implemented; fully compatible with the identically
named package in the commercial version of MACSYMA, ATENSOR implements abstract
tensor algebras.
| [
{
"version": "v1",
"created": "Sat, 26 Mar 2005 14:41:49 GMT"
},
{
"version": "v2",
"created": "Wed, 25 May 2005 16:52:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Toth",
"Viktor",
""
]
]
| new_dataset | 0.994473 |
cs/0504018 | Olivier Brunet | Olivier Brunet (Leibniz - IMAG) | A Rule-Based Logic for Quantum Information | null | null | null | null | cs.LO quant-ph | null | In the present article, we explore a new approach for the study of
orthomodular lattices, where we replace the problematic conjunction by a binary
operator, called the Sasaki projection. We present a characterization of
orthomodular lattices based on the use of an algebraic version of the Sasaki
projection operator (together with orthocomplementation) rather than on the
conjunction. We then define of a new logic, which we call Sasaki Orthologic,
which is closely related to quantum logic, and provide a rule-based definition
of this logic.
| [
{
"version": "v1",
"created": "Wed, 6 Apr 2005 08:11:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Brunet",
"Olivier",
"",
"Leibniz - IMAG"
]
]
| new_dataset | 0.98551 |
cs/0504040 | J?r?mie Leguay M. | Jeremie Leguay, Timur Friedman and Vania Conan | DTN Routing in a Mobility Pattern Space | 8 pages, preprint | null | null | null | cs.NI | null | Routing in Delay Tolerant Networks (DTNs) benefits considerably if one can
take advantage of knowledge concerning node mobility. The main contribution of
this paper is the definition of a generic routing scheme for DTNs using a
high-dimensional Euclidean space constructed upon nodes' mobility patterns. For
example, nodes are represented as points having as coordinates their
probability of being found in each possible location. We present simulation
results indicating that such a scheme can be beneficial in a scenario inspired
by studies done on real mobility traces. This work should open the way to
further use of the virtual space formalism in DTN routing.
| [
{
"version": "v1",
"created": "Mon, 11 Apr 2005 17:03:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Leguay",
"Jeremie",
""
],
[
"Friedman",
"Timur",
""
],
[
"Conan",
"Vania",
""
]
]
| new_dataset | 0.996935 |
cs/0504044 | Richard McClatchey | Michael Thomas, Conrad Steenberg, Frank van Lingen, Harvey Newman,
Julian Bunn, Arshad Ali, Richard McClatchey, Ashiq Anjum, Tahir Azim, Waqas
ur Rehman, Faisal Khan, Jang Uk In | JClarens: A Java Framework for Developing and Deploying Web Services for
Grid Computing | 8 pages, 4 figures. Paper at the 3rd IEEE International Conference on
Web Services (ICWS05). Florida, USA. July 2005 | null | null | null | cs.DC | null | High Energy Physics (HEP) and other scientific communities have adopted
Service Oriented Architectures (SOA) as part of a larger Grid computing effort.
This effort involves the integration of many legacy applications and
programming libraries into a SOA framework. The Grid Analysis Environment (GAE)
is such a service oriented architecture based on the Clarens Grid Services
Framework and is being developed as part of the Compact Muon Solenoid (CMS)
experiment at the Large Hadron Collider (LHC) at European Laboratory for
Particle Physics (CERN). Clarens provides a set of authorization, access
control, and discovery services, as well as XMLRPC and SOAP access to all
deployed services. Two implementations of the Clarens Web Services Framework
(Python and Java) offer integration possibilities for a wide range of
programming languages. This paper describes the Java implementation of the
Clarens Web Services Framework called JClarens. and several web services of
interest to the scientific and Grid community that have been deployed using
JClarens.
| [
{
"version": "v1",
"created": "Mon, 11 Apr 2005 21:45:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Thomas",
"Michael",
""
],
[
"Steenberg",
"Conrad",
""
],
[
"van Lingen",
"Frank",
""
],
[
"Newman",
"Harvey",
""
],
[
"Bunn",
"Julian",
""
],
[
"Ali",
"Arshad",
""
],
[
"McClatchey",
"Richard",
""
],
[
"Anjum",
"Ashiq",
""
],
[
"Azim",
"Tahir",
""
],
[
"Rehman",
"Waqas ur",
""
],
[
"Khan",
"Faisal",
""
],
[
"In",
"Jang Uk",
""
]
]
| new_dataset | 0.998729 |
cs/0504073 | Karim Seada | Karim Seada, Ahmed Helmy | Rendezvous Regions: A Scalable Architecture for Resource Discovery and
Service Location in Large-Scale Mobile Networks | null | null | null | null | cs.NI | null | In large-scale wireless networks such as mobile ad hoc and sensor networks,
efficient and robust service discovery and data-access mechanisms are both
essential and challenging. Rendezvous-based mechanisms provide a valuable
solution for provisioning a wide range of services. In this paper, we describe
Rendezvous Regions (RRs) - a novel scalable rendezvous-based architecture for
wireless networks. RR is a general architecture proposed for service location
and bootstrapping in ad hoc networks, in addition to data-centric storage,
configuration, and task assignment in sensor networks. In RR the network
topology is divided into geographical regions, where each region is responsible
for a set of keys representing the services or data of interest. Each key is
mapped to a region based on a hash-table-like mapping scheme. A few elected
nodes inside each region are responsible for maintaining the mapped
information. The service or data provider stores the information in the
corresponding region and the seekers retrieve it from there. We run extensive
detailed simulations, and high-level simulations and analysis, to investigate
the design space, and study the architecture in various environments including
node mobility and failures. We evaluate it against other approaches to identify
its merits and limitations. The results show high success rate and low overhead
even with dynamics. RR scales to large number of nodes and is highly robust and
efficient to node failures. It is also robust to node mobility and location
inaccuracy with a significant advantage over point-based rendezvous mechanisms.
| [
{
"version": "v1",
"created": "Fri, 15 Apr 2005 03:01:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Seada",
"Karim",
""
],
[
"Helmy",
"Ahmed",
""
]
]
| new_dataset | 0.999426 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.