arXiv
(422,153 recursos)
This is one of the most extensive subject based repositories in the world in the field of physics, mathematics, astronomy, computer sciences and quantitative biology. This is the principal site with almost 20 mirror versions around the globe. The site is supported by an extensive collection of information and background documentation. An RSS feed is available for anyone interested in keeping up-to-date with newly added materials.
Mostrando recursos 21 - 40 de 9,277
21.
J2EE Deployment: The JOnAS Case Study - Exertier, Francois
La specification J2EE (Java 2 platform Enterprise Edition) definit une
architecture de serveur d'application Java. Jusqu'a J2EE 1.3, seuls les aspects
de deploiement concernant le developpeur d'applications etaient adresses. Avec
J2EE 1.4, les interfaces et les etapes de deploiement ont ete plus precisement
specifiees dans la specification "J2EE Deployment". JOnAS (Java Open
Application Server) est une plate-forme J2EE developpee au sein du consortium
ObjectWeb. Les aspects deploiement sont en cours de developpement. Cet article
decrit les concepts lies au deploiement dans J2EE, ainsi que les problematiques
levees lors de leur mise en oeuvre pour JOnAS. Il n'a pas pour but de presenter
un travail abouti, mais illustre le deploiement...
22.
Runtime Reconfiguration of J2EE Applications - Matevska-Meyer, Jasminka; Olliges, Sascha; Hasselbring, Wilhelm
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...
23.
Deployment in dynamic environments - Ruiz, Jose L.; Duenas, Juan C.; Usero, Fernando; Diaz, Cristina
Information and communication technologies are moving towards a new stage
where applications will be dynamically deployed, uninstalled, updated and
(re)configured. Several approaches have been followed with the goal of creating
a fully automated and context-aware deployment system. Ideally, this system
should be capable of handling the dynamics of this new situation, without
losing sight of other factors, such as performance, security, availability or
scalability. We will take some of the technologies that follow the principles
of Service Oriented Architectures, SOA, as a paradigm of dynamic environments.
SOA promote the breaking down of applications into sets of loosely coupled
elements, called services. Services can be dynamically bound, deployed,
reconfigured, uninstalled and...
24.
Gestion du deploiement de composants sur reseau P2P - Frenot, Stephane
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...
25.
Lower-Stretch Spanning Trees - Elkin, Michael; Emek, Yuval; Spielman, Daniel A.; Teng, Shang-Hua
We prove that every weighted graph contains a spanning tree subgraph of
average stretch O((log n log log n)^2). Moreover, we show how to construct such
a tree in time O(m log^2 n).
26.
CDN: Content Distribution Network - Peng, Gang
Internet evolves and operates largely without a central coordination, the
lack of which was and is critically important to the rapid growth and evolution
of Internet. However, the lack of management in turn makes it very difficult to
guarantee proper performance and to deal systematically with performance
problems. Meanwhile, the available network bandwidth and server capacity
continue to be overwhelmed by the skyrocketing Internet utilization and the
accelerating growth of bandwidth intensive content. As a result, Internet
service quality perceived by customers is largely unpredictable and
unsatisfactory. Content Distribution Network (CDN) is an effective approach to
improve Internet service quality. CDN replicates the content from the place of
origin to...
27.
Data Path Processing in Fast Programmable Routers - De, Pradipta
Internet is growing at a fast pace. The link speeds are surging toward 40
Gbps with the emergence of faster link technologies. New applications are
coming up which require intelligent processing at the intermediate routers.
Switches and routers are becoming the bottlenecks in fast communication. On one
hand faster links deliver more packets every second and on the other hand
intelligent processing consumes more CPU cycles at the router. The conflicting
goals of providing faster but computationally expensive processing call for new
approaches in designing routers.
This survey takes a look at the core functionalities, like packet
classification, buffer memory management, switch scheduling and output link
scheduling performed by...
28.
Comparing Multi-Target Trackers on Different Force Unit Levels - Sidenbladh, Hedvig; Svenson, Pontus; Schubert, Johan
Consider the problem of tracking a set of moving targets. Apart from the
tracking result, it is often important to know where the tracking fails, either
to steer sensors to that part of the state-space, or to inform a human operator
about the status and quality of the obtained information. An intuitive quality
measure is the correlation between two tracking results based on uncorrelated
observations. In the case of Bayesian trackers such a correlation measure could
be the Kullback-Leibler difference.
We focus on a scenario with a large number of military units moving in some
terrain. The units are observed by several types of sensors and "meta-sensors"
with...
29.
Extremal optimization for sensor report pre-processing - Svenson, Pontus
We describe the recently introduced extremal optimization algorithm and apply
it to target detection and association problems arising in pre-processing for
multi-target tracking.
Here we consider the problem of pre-processing for multiple target tracking
when the number of sensor reports received is very large and arrives in large
bursts. In this case, it is sometimes necessary to pre-process reports before
sending them to tracking modules in the fusion system. The pre-processing step
associates reports to known tracks (or initializes new tracks for reports on
objects that have not been seen before). It could also be used as a pre-process
step before clustering, e.g., in order to test how...
30.
Geographic Routing with Limited Information in Sensor Networks - Subramanian, Sundar; Shakkottai, Sanjay
Geographic routing with greedy relaying strategies have been widely studied
as a routing scheme in sensor networks. These schemes assume that the nodes
have perfect information about the location of the destination. When the
distance between the source and destination is normalized to unity, the
asymptotic routing delays in these schemes are $\Theta(\frac{1}{M(n)}),$ where
M(n) is the maximum distance traveled in a single hop (transmission range of a
radio). In this paper, we consider routing scenarios where nodes have location
errors (imprecise GPS), or where only coarse geographic information about the
destination is available, and only a fraction of the nodes have routing
information. We show that even with...
31.
A Self-Reconfigurable Computing Platform Hardware Architecture - Weisensee, Andreas; Nathan, Darran
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.
32.
Transparent Format Migration of Preserved Web Content - Rosenthal, David S. H.; Lipkis, Thomas; Robertson, Thomas; Morabito, Seth
The LOCKSS digital preservation system collects content by crawling the web
and preserves it in the format supplied by the publisher. Eventually, browsers
will no longer understand that format. A process called format migration
converts it to a newer format that the browsers do understand. The LOCKSS
program has designed and tested an initial implementation of format migration
for Web content that is transparent to readers, building on the content
negotiation capabilities of HTTP.
33.
Gestion Dynamique des Services Techniques pour Modele a Composants - Herault, Colombe; Lecomte, Sylvain
The new applications being intended for more and more heterogeneous
environments, it is necessary to propose solutions of development which answer
in best the necessities of adaptation of new services. Component-based
programming partially answers this aim, allowing easy replacement of software
blocks in order to provide the most adapted version of a component.
Nevertheless, most of the industrial component-based model implementations do
not allow to provide to components the most adapted technical services (naming,
trading, security, transaction, etc.). In this paper, we suggest defining
technical services themselves under the shape of components. We shall detail
our proposition, by basing it on the Fractal component model of Objectweb.
Then, we shall...
34.
Principles for Digital Preservation - Gladney, H. M.
The immense investments in creating and disseminating digitally represented
information have not been accompanied by commensurate effort to ensure the
longevity of information of permanent interest. Asserted difficulties with
long-term digital preservation prove to be largely underestimation of what
technology can provide. We show how to clarify prominent misunderstandings and
sketch a 'Trustworthy Digital Object (TDO)' method that solves all the
published technical challenges.
35.
Inter-Package Dependency Networks in Open-Source Software - LaBelle, Nathan; Wallingford, Eugene
This research analyzes complex networks in open-source software at the
inter-package level, where package dependencies often span across projects and
between development groups. We review complex networks identified at ``lower''
levels of abstraction, and then formulate a description of interacting software
components at the package level, a relatively ``high'' level of abstraction. By
mining open-source software repositories from two sources, we empirically show
that the coupling of modules at this granularity creates a small-world and
scale-free network in both instances.
36.
A Note on the PAC Bayesian Theorem - Maurer, Andreas
We prove general exponential moment inequalities for averages of [0,1]-valued
iid random variables and use them to tighten the PAC Bayesian Theorem. The
logarithmic dependence on the sample count in the enumerator of the PAC
Bayesian bound is halved.
37.
Ranking Pages by Topology and Popularity within Web Sites - Borges, Jose; Levene, Mark
We compare two link analysis ranking methods of web pages in a site. The
first, called Site Rank, is an adaptation of PageRank to the granularity of a
web site and the second, called Popularity Rank, is based on the frequencies of
user clicks on the outlinks in a page that are captured by navigation sessions
of users through the web site. We ran experiments on artificially created web
sites of different sizes and on two real data sets, employing the relative
entropy to compare the distributions of the two ranking methods. For the real
data sets we also employ a nonparametric measure, called Spearman's footrule,
which we...
38.
Jordan Normal and Rational Normal Form Algorithms - Parisse, Bernard; Vaughan, Morgane
In this paper, we present a determinist Jordan normal form algorithms based
on the Fadeev formula: \[(\lambda \cdot I-A) \cdot B(\lambda)=P(\lambda) \cdot
I\] where $B(\lambda)$ is $(\lambda \cdot I-A)$'s comatrix and $P(\lambda)$ is
$A$'s characteristic polynomial. This rational Jordan normal form algorithm
differs from usual algorithms since it is not based on the Frobenius/Smith
normal form but rather on the idea already remarked in Gantmacher that the
non-zero column vectors of $B(\lambda_0)$ are eigenvectors of $A$ associated to
$\lambda_0$ for any root $\lambda_0$ of the characteristical polynomial. The
complexity of the algorithm is $O(n^4)$ field operations if we know the
factorization of the characteristic polynomial (or $O(n^5 \ln(n))$ operations
for...
39.
The Accelerated Euclidean Algorithm - Sedjelmaci, Sidi Mohamed
We present a new GCD algorithm of two integers or polynomials. The algorithm
is iterative and its time complexity is still $O(n \\log^2 n ~ log \\log n)$
for $n$-bit inputs.
40.
Jartege: a Tool for Random Generation of Unit Tests for Java Classes - Oriat, Catherine
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...
21.
