Computer Sciences Commons^™

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs. © 1987, ACM. All Rights Reserved.

Expressive Power In First Order Topology, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A first order representation (f.o.r.) in topology is an assignment of finitary relational structures of the same type to topological spaces in such a way that homeomorphic spaces get sent to isomorphic structures. We first define the notions "one f.o.r. is at least as expressive as another relative to a class of spaces" and "one class of spaces is definable in another relative to an f.o.r.", and prove some general statements. Following this we compare some well-known classes of spaces and first order representations. A principal result is that if X and Y are two Tichonov spaces whose posets of …

Cost-Benefit Analysis Of Computer Systems In Community Hospital Food Service, Beverly Kittle

Loma Linda University Electronic Theses, Dissertations & Projects

Cost containment has always been a major concern to managers. Therefore, any system which decreases costs by reducing labor time is given serious evaluation.

A five week comparison was made between financial record keeping by the manual method and by the computerized method. A continuous time study was utilized to make this comparison.

Over the five weeks, an average overall time savings of 245 minutes for the computerized versus the manual method was observed. The net savings to the institution was 223 minutes per week which translates to approximately $140.00 per month over a 5 year period.

The rapid payback …

Orthodontic Information Systems : A Developmental Study, Gary D. Sheldon

Loma Linda University Electronic Theses, Dissertations & Projects

The intent of this study was to design and implement a computer-based orthodontic system providing an integrated information environment throughout the entire patient treatment process.

Total system integration was achieved by restructuring the entire information gathering process. A complete, evaluation of patient diagnosis and treatment evaluation procedures established five major information categories and a critical information list for proper patient management. Information organization was outlined to provide a logical progression in the information gathering process and patient chart forms were designed to implement this. Defining the computer system's performance identified three functions as follows: 1) entry and editing of individual …

Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Topological Extensions And Subspaces Of Ηα-Sets, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

The η_x-sets of Hausdorff have large compactifications (of cardinality ≽ exp(α); and of cardinality ≽ exp(exp(2^<α)) in the Stone-Čech case). If Q_α denotes the unique (when it exists) η_α -set of cardinality α, then Q_α can be decomposed (= partitioned) into homeomorphs of any prescribed nonempty subspace; moreover the subspaces of Q_α can be characterized as those which arc regular T₁, of cardinality and weight ≼ α, whose topologies are closed under < α intersections.

The Total Negation Of A Topological Property, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

A Bayes Rule For The Symmetric Multiple Comparisons Problem, Aban Nawabi

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Many procedures have been proposed for the symmetric multiple comparisons problem in recent years. These include a "protected" least significant difference procedure due to Fisher (FSD), a multiple range rule by Duncan, and HSD (honest significant difference) procedure by Tukey, and a procedure for testing all contrasts by Scheffe.

The tests which are mentioned above are either comparison-wise or experiment-wise approaches. The probability of Type I error is intended to be a for all comparisons made when an experiment-wise approach is used. Whereas, the probability of Type I error referred to each comparison is a comparison-wise approach. Both approaches can …

Opset Program For Computerized Selection Of Watershed Parameter Values For The Stanford Watershed Model, Earnest Yuan-Shang Liou, L. Douglas James

KWRRI Research Reports

The advent of high-speed electronic computer made it possible to model complex hydrologic processes by mathematical expressions and thereby simulate streamflows from climatological data. The most widely used program is the Stanford Watershed Model, a digital parametric model of the land phase of the hydrologic cycle based on moisture accounting processes. It can be used to simulate annual or longer flow sequences at hourly time intervals. Due to its capability of simulating historical streamflows from recorded climatological data, it has a great potential in the planning and design of water resources systems. However, widespread use of the Stanford Watershed Model …

Rational Arithmetic As A Means Of Matrix Inversion, Jay Roland Peterson

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The solution to a set of simultaneous equations is of the form A^-1 B = X where A^-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A^-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations.

This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination …