Roger G. Dear

The dynamic scheduling of aircraft in high density terminal areas

Abstract We find the most efficient (airport) runway utilization by using a methodology which we call Constrained Position Shifting (CPS). We examine this methodology from the perspectives of both pilots and air traffic controllers by simulation. The results indicate that significant and equitable improvements in system performance are achieved, especially during peak periods.

Evolution of Web-based Distance Learning Strategies

Strategies for implementing distance learning coursework have evolved and expanded with the growth and maturation of the World Wide Web. The requirements, advantages, and disadvantages of the most common strategies are compared and contrasted. Initially limited to individual efforts, software development has eased the burden of individual faculty and has opened up strategies for greater participation. Institutions attempting large‐scale implementations, however, may find infrastructure requirements overwhelming. An emerging large‐scale strategy involves an institutional partnership with a for‐profit application service provider (ASP). The ASP specializes in total systems solutions for developing and delivering Web‐based distance learning programs. Recent experiences at California State University, Fullerton, with an ASP are discussed.

The development and testing of a new composite random number generator

Abstract We develop and test a new composite random number generator called the Composite Sherif-Dear (CSD) generator. The proposed generator satisfies stringent theoretical criteria for the quality of the sequence it produces; and is easy to understand and implement in a portable way.

On the significance level of the multirelation coefficient

The concept of the multirelation coefficient is defined to describe the closeness of a set of variables to a linear relation. This concept extends the linear correlation between two variables to two or more variables. Parameters of a beta distribution are determined that are utilized to approximate significance levels of the multirelation coefficient for any given number of observations and variables. A generalized Student t distribution is defined. This distribution, which is termed the multirelated t distribution, reduces to the Student t distribution for two variables. It is useful in the determination of the significance level of the multirelation coefficient.

Z-Basic algorithm for collision avoidance system

A Z-Basic prediction algorithm for an aircraft ground-based collision avoidance system is presented. This system searches for mutually overlapping prediction intervals that are influenced by the aircrafts maneuver capabilities and surveillance accuracy. Z-Basic provides a powerful, fast, interactive, simple to use, and inexpensive Basic compiler. The algorithm is applied to a typical terminal airspace situation. The computer program was executed on Macintosh+, and the execution was less than one minute. The program is easy to understand and implement. >

Managing platform conversion in educational institutions

This paper describes a re‐engineering project undertaken by a comprehensive university’s extended education department. The project involved a transition from a decentralized workplace dominated by Macintosh personal computers to an IBM PC/clone‐based client/server environment. Lessons learned during the decision making and platform conversion stages of the project are emphasized. These lessons are applicable to other similar re‐engineering projects.

Extensions to the sherif-dear simple (SDS) theorem in number theory

Abstract We put forward extensions to the Sherif-Dear Simple (SDS) Theorem, prove these extensions by enumeration, and cite some relevant applications. “The essence of research is its freedom.”

Using Walsh Functions to Test a New Composite Sherif-Dear (CSD) Random Number Generator:

A test using Walsh functions is performed to test the quality of the output of a new Composite Sherif-Dear (CSD) random number generator. The Walsh functions based test shows that the output of the (CSD) generator satisfies the criteria of good random number generators.

Evaluation of protocols for availability, reliability and consistency of replicated files

Abstract This paper puts forward a PASCAL simulation model to evaluate the performance of three access policy protocols for replicated files in distributed systems. The three protocols are: static majority consensus voting, dynamic voting and lexicographic dynamic voting. The main objective of these protocols is to ensure the consistency of data in replicated files of distributed systems. The results show that lexicographic dynamic voting performs better than majority consensus and dynamic voting for all cases under study. The dynamic voting outperformed the majority consensus voting when there are four or more copies; the reverse is true when there are three copies. Also, it is found that adding a fourth copy to a basic set of three under the majority consensus voting reduces file availability; whereas adding a fifth copy improves the availability.

An efficient algorithm for testing the quality of the output of random number generators

Abstract This paper presents an efficient method and a computer program utilizing Walsh functions to test the quality of the output of a random number generator. The computer program is written in ZBasic and consists of six segments: (1) PMMLCG RANDOM NUMBER GENERATOR FUNCTION — This segment defines the portable Prime Modulus Multiplicative Linear Congruential Generator that is used as part of the Composite Sherif Dear (CSD) Random Number Generator, which is under study and testing in this paper; (2) INITIAL VARIABLE INPUT/HEADER OUTPUT — This segment requests user input for the experiment and prepares the output file with header information; (3) CSD RANDOM NUMBER GENERATOR SAMPLES — This segment generates multiple samples of the CSD Random Number Generator each with the desired sample size. The generated values are offset by 0·5; (4) DETERMINE THE WALSH TRANSFORM — This segment determines the Walsh Transform using a Manz Sequency Ordered In-Place Algorithm for the given sample; (5) DETERMINE THE KOLMOGOROV-SMIRNOV SAMPLE STATISTIC — This segment computes the Kolmogorov-Smirnov sample statistic on the scaled Walsh Transform; (6) SAMPLING COMPLETE-SUMMARIZE RESULTS — This segment summarizes the results for all samples and places the results into an output file. The Walsh functions based test shows that the output of the (CDS) random number generator satisfies the criteria of good random number generators.