Emergence of self-replicating structures in a cellular automata space

Past cellular automata models of self-replication have always been initialized with an original copy of the structure that will replicate, and have been based on a transition function that only works for a single, specific structure. This article demonstrates for the first time that it is possible to create cellular automata models in which a self-replicating structure emerges from an initial state having a random density and distribution of individual components. These emergent self-replicating structures employ a fairly general rule set that can support the replication of structures of different sizes and their growth from smaller to larger ones. This rule set also allows “random” interactions of self-replicating structures with each other and with other structures within the cellular automata space. Systematic simulations show that emergence and growth of replicants occurs often and is essentially independent of the cellular space size, initial random pattern of components, and initial density of components, over a broad range of these parameters. The number of replicants and the total number of components they incorporate generally approach quasi-stable values with time.     

Fairness in Scheduling

On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper we explore the issue in settings where there are long-lived processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system. For any such instance we develop a notion ofdesiredload of a process, which is a function of the tasks it participates in. Theunfairnessof a system is the maximum, taken over all processes, of the difference between the desired load and the actual load.An example of such a setting is thecarpool problemsuggested by Fagin and Williams [IBM Journal of Research and Development27(2) (1983), 133–139]. In this problem, a set ofnpeople form a carpool. On each day a subset of the people arrive and one of them is designated as the driver. A scheduling rule is required so that the driver will be determined in a “fair” way.We investigate this problem under various assumptions on the input distribution. We also show that the carpool problems can capture several other problems of fairness in scheduling.     

A Network Simulation of High-congestion Road-traffic Flows in Cities with Marine Container Terminals

Port cities where marine cargo terminals are located are generally near urban areas characterized by high-congestion road traffic. Changes in cargo traffic volumes into a marine terminal, or in the surrounding traffic arteries, which carry this traffic, can significantly affect the terminal's operations. Conversely, activity at the terminal can have an impact on the traffic levels and congestion for a considerable distance from the terminal. This paper demonstrates a methodology useful for studying the impact of road traffic flows on marine container terminals located in highly congested areas. This model was developed at the request of the Virginia Center for World Trade and was used to answer three planning questions in the port of Hampton Roads, Virginia, USA-what would be the impact of: opening a new section of interstate highway, a projected doubling of container traffic at one terminal, and a daily unit train in the vicinity of another terminal. The problem was made more challenging by limited data-collection funds. None the less, the model was deemed valid by a panel of traffic experts and officials from several major state and private agencies involved in marine traffic management. The model results were subsequently a factor in two major decisions related to terminal management.     

Constructing one-parameter families of elliptic curves with moderate rank

We give several new constructions for moderate rank elliptic curves over Q(T). In particular we construct infinitely many rational elliptic surfaces (not in Weierstrass form) of rank 6 over Q using polynomials of degree two in T. While our method generates linearly independent points, we are able to show the rank is exactly 6 without having to verify the points are independent. The method generalizes; however, the higher rank surfaces are not rational, and we need to check that the constructed points are linearly independent.