A prototype mobile-agent application
Mobile agents, a relatively new paradigm for distributed software development, has become an accessible technology in recent years. The potential bene-ts of this paradigm, including the reduction of network bandwidth consumption and latency, promise to revolutionize distributed applications A number of research institutions and industrial entities have engaged in the development of elaborate supporting systems for this technology, and the deployment of its applications can be expected to proliferate. This paper describes a small-scale project under-taken to explore the feasibility of this technology, the technical issues, and its eeects on network applications .

title: Distributed computing
abstract: A distributed computing system consists of a collection autonomous computers connected by a communication network. The motivation for such a distributed system includes resource and load sharing, reduced costs in computation and communication, higher performance and throughput, and increased reliability and availability.

title: A High Population, Fault Tolerant Parallel Raytracer
abstract: We present hierarchical master-slave architecture for performing parallel raytracing algorithms that can support a large population of participating clients and at the same time maintain fault tolerance at the application level. Our design allows for scalability with minimal data redundancy and maximizes the utilization of each client involved in the raytracing process. Our results show that this three-layer system can survive any type or number of client failures, and any non-concurrent server failures, while maintaining a near linear increase in performance with the addition of each new processing client.

title: Deploying the Mobile-Agent Technology in Warehouse Management
abstract: Mobile agents, a relatively new paradigm for distributed software development, has become an accessible technology in recent years. The potential benefits of this paradigm, including the reduction of network bandwidth consumption and latency, promise to revolutionize distributed applications. 
 
This paper describes a proposed project to deploy the mobile agent technology in warehouse management.

title: Applying Design Patterns in Distributing a Genetic Algorithm Application
abstract: -This paper describes an experiment that employs an incremental approach to distribute a genetic algorithm application. The incremental approach allows the application to be initially developed for a standalone system, and then extended to run on multiple systems concurrently. For the extension, design patterns are employed wherever appropriate. The use of design patterns in the experiment is described, and the outcome of the experiment, including quantitative measurements, is presented.

title: On the retention of female computer science students

title: Combinatorial constructions for optimal supersaturated designs
abstract: Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this paper, we focus on a new application of combinatorial design theory in experimental design theory. E ( f NOD ) criterion is used as a measure of non-orthogonality of U-type designs, and a lower bound of E ( f NOD ) which can serve as a benchmark of design optimality is obtained. A U-type design is E ( f NOD )-optimal if its E ( f NOD ) value achieves the lower bound. In most cases, E ( f NOD )-optimal U-type designs are supersaturated. We show that a kind of E ( f NOD )-optimal designs are equivalent to uniformly resolvable designs. Based on this equivalence, several new infinite classes for the existence of E ( f NOD )-optimal designs are then obtained.

title: Sound mobility models
abstract: Simulation has become an indispensable tool in the construction and evaluation of mobile systems. By using mobility models that describe constituent movement, one can explore large systems, producing repeatable results for comparison between alternatives. Unfortunately, the vast majority of mobility models---including all those in which nodal speed and distance or destination are chosen independently---suffer from decay; average speed decreases until converging to some long-term average. Such decay provides an unsound basis for simulation studies that collect results averaged over time, complicating the experimental process.This paper shows via analysis that such decay is inevitable in a wide variety of mobility models, including the most common in use today. We derive a general framework for describing this decay, and apply it to a number of practical cases. Furthermore, this framework allows us to transform any given mobility model into a stationary one: choose initial speeds from the steady-state distribution, and subsequent speeds from the original. This transformation provides sound models for simulation, eliminating variations in average nodal speed.

title: A general framework to construct stationary mobility models for the simulation of mobile networks
abstract: Simulation has become an indispensable tool in the design and evaluation of mobile systems. By using mobility models that describe constituent movement, one can explore large systems, producing repeatable results for comparison between alternatives. In this paper, we show that a large class of mobility models - including all those in which nodal speed and distance or destination are chosen independently - have a transient period in which the average node speed decreases until converging to some long-term average. This speed decay provides an unsound basis for simulation studies that collect results averaged over time, complicating the experimental process. In this paper, we derive a general framework for describing this decay and apply it to a number of cases. Furthermore, this framework allows us to transform a given mobility model into a stationary one by initializing the simulation using the steady-state speed distribution and using the original speed distribution subsequently. This transformation completely eliminates the transient period and the decay in average node speed and, thus, provides sound models for the simulation of mobile systems.

title: The History and Status of Chinese Americans in Librarianship
abstract: This article reviews the brief history of Chinese Americans in the United States and their contributions to librarianship. Despite the hardships and challenges they faced, Chinese American librarians made great contributions to the building of East Asian libraries, to the cataloging of East Asian and Chinese collections, and to the development of library automation. They have advanced information technologies, promoted multicultural and diversity library services, and participated in library management and administration. Chinese Americans are active in library and information science education, in professional associations, in international librarianship, in national library and information services policy making and programming, and national policy making. Pioneers and key figures are identified with their accomplishments. The origin, purpose, programs, and activities of the Chinese American Librarians Association are also described.

title: Optimal controlled flooding search in a large wireless network
abstract: In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated. We derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio between the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lower bounded by 4 among all deterministic search strategies. In this paper we show that by using randomized strategies this ratio is lower bounded by e. We derive an optimal strategy that achieves this lower bound, and discuss its performance under other performance criteria.