The search task and the system both affect the demand on cognitive resources during information search. In some situations the demands may become too high for a person. This article has a three-fold goal. First, it presents and critiques methods to measure cognitive load. Second, it explores the distribution of load across search task stages. Finally, it seeks to improve our understanding of fa...

The Distributed Scheduling Framework (DSF) is a load distribution (LD) tool built on top of the Mach operating system. It allows the replacement of LD algorithms without the need to shut down the system. It also supports multiple LD algorithms running on the system concurrently so that users can choose a suitable LD algorithm for submitting their tasks according to their choice. Implementing LD...

An unprecedented community outbreak of severe acute respiratory syndrome (SARS) occurred in the Amoy Gardens, a high-rise residential complex in Hong Kong. Droplet, air, contaminated fomites, and rodent pests have been proposed to be mechanisms for transmitting SARS in a short period. We studied nasopharyngeal viral load of SARS patients on admission and their geographic distribution. Higher na...

In this paper, we consider a load-balancing process allocation method for fault-tolerant multicomputer systems that balances the load before as well as after faults start to degrade the performance of the system. In order to be able to tolerate a single fault, each process (primary process) is duplicated (i.e., has a backup process). The backup process executes on a diierent processor from the ...

The success of a Web service is largely dependent on its responsiveness (i.e., its availability and timeliness) in the delivery of the information its users (clients) require. A practical approach to the provision of responsive Web services, recently proposed in the literature [7], is based on introducing redundancy in the service implementation, namely by replicating the service across a numbe...

This paper presents a comprehensive analysis and comparisons of the performances of the two commonly used models under different situations for distribution load flow. Investigations reveal that the computational efficiencies of both the models are more or less close over a wide range of loading condition. However, model 2 is less sensitive to model 1 for increase in loading conditions, reducti...

Load distribution is a well known critical problem in every distributed system. From operating systems to agent oriented applications it is not difficult to find cases where processing nodes are overloaded when, at the same time, other peers present low levels of activity. In agent oriented applications, where the appeal to cooperation is almost a constant event, these unbalanced situations may...

Here we describe an object-oriented language based on finegrained parallelism. This language, called DinnerBell, is based on single-assignment rule and data driven execution. We use messageJoin as a synchronization mechanism. DinnerBell is implemented using micro-message technique. DinnerBell also uses a new method called object-oriented load distribution. This method works like a macro data fl...

An anteroposterior radiograph oftheleg to include the hip and ankle, taken with the patient standing, provides an estimate ofthe line ofload-bearing at the knee. Gait analysis may be used to determine the way in which the load in the knee is shared between the medial and lateral compartments during normal walking. A comparison ofthe results from the two methods, carried out on a group of47 pati...

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depends on the cost distribution function p(c) (c) . In the strong disorder limit, where p(c) (c) approximately c(-1) , the load distribution follows a power law both in the Erdös-Rényi (ER) rand...