Distributed file systems that scale by partitioning files and directories among a collection of servers inevitably encounter cross-server operations. A common example is a rename that moves a file from a directory managed by one server to a directory managed by another. Systems that provide the same semantics for cross-server operations as for those that do not span servers traditionally implem...

The Visible Human Slice Server (http://visiblehuman.epfl.ch) started offering its slicing services at the end of June 1998. From that date until the end of May, more than 280’000 slices were extracted from the Visible Man, by laymen interested in anatomy, by students and by specialists. The Slice Server is based one Bi-Pentium PC and 16 disks. It is a scaled down version of a powerful parallel ...

AMMOS2 is an interactive web server for efficient computational refinement of protein-small organic molecule complexes. The AMMOS2 protocol employs atomic-level energy minimization of a large number of experimental or modeled protein-ligand complexes. The web server is based on the previously developed standalone software AMMOS (Automatic Molecular Mechanics Optimization for in silico Screening...

The goal of a network load balancer is to distribute a workload evenly amongst a cluster of back-end servers. At present there are a number of standard request allocation schemes to distribute requests but none of these can guarantee an even load distribution. In order to improve the request allocation decisions made, I present an implementation of a dynamic feedback system as an extension for ...

The Biometric based user authentication systems are highly secured and efficient to use and place total trust on the authentication server where biometric verification data are stored in a central database. Such systems are, prone to dictionary attacks initiated at the server side. Compromise of the authentication server by either outsiders or insiders do all user private data to exposure and m...

We consider a batch arrival queueing system with two phases of service, feedback and K optional vacations under a classical retrial policy. At the arrival epoch, if the server is busy the whole batch joins the orbit. Whereas if the server is free, then one of the arriving customer starts its service immediately and the rest joins the orbit. For each customer, the server provides two phases of s...

In this study, we consider a single server vacation queueing model with optional bulk service and an un-reliable server. A single server provides first essential service (FES) to all arriving customers one by one; apart from essential service, he can also facilitate the additional phase of optional service (OS) in batches of fixed size b(≥ 1), in case when the customers request for it. The serv...

A tandem retrial queue consisting of two stations is studied. The first station has a single server. An input flow at the first station is described by the Markovian Arrival Process ( MAP ). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first sta...

The Personal Server is a small, lightweight, and easy-to-use device that supports personal mobile applications. Instead of relying on a small mobile display, the Personal Server enables seamless interaction with situated displays in the nearby environment. The current prototype is supported by emerging storage, processing, and communication technologies. Because it is carried by the user and do...

We develop a mechanism by which a server can guarantee that client passwords contain a certain amount of (actually random) entropy while not actually knowing these passwords. We define and implement a protocol between a client and server used during password generation. Importantly, while we greatly modify the process of generating a password, the actual day-to-day use of this password is mostl...