Digital Commons Network^™

Using Writing In The Mathematics Classroom, Dr. Barbara J. Rose

ACMS Conference Proceedings 1989

No abstract provided.

Mathematics Between The Lines Of Ecclesiates, Donald A. Joesphson

ACMS Conference Proceedings 1989

No abstract provided.

Writing Across The Curriculum Using Statistics, Carlos A. Pereira

ACMS Conference Proceedings 1989

No abstract provided.

Written Assignments In College Freshman And Sophomore Mathematics Courses, Jean Alliman

ACMS Conference Proceedings 1989

No abstract provided.

Mathematical Modeling In The Classroom, Jefferson Hartzler

ACMS Conference Proceedings 1989

No abstract provided.

The Fourth Dimension And The Theology Of Edwin Abbot Abbott, Thomas F. Banchoff

ACMS Conference Proceedings 1989

No abstract provided.

Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth

Kno.e.sis Publications

A simple model is used to study the effect of fault-tolerance techniques and system design on system availability. A generic multiprocessor architecture is used that can be configured in different ways to study the effect of system architectures. Important parameters studied are different system architectures and hardware fault-tolerance techniques, mean time to failure of basic components, database size and distribution, interconnect capacity, etc. Quantitative analysis compares the relative effect of different parameter values. Results show that the effect of different parameter values on system availability can be very significant. System architecture, use of hardware fault tolerance (particularly mirroring), and data …

Schedule (1989), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1989

A Seventh Conference on Mathematics from a Christian Perspective

Gene B. Chase, Editor

Introduction (1989), Gene B. Chase

ACMS Conference Proceedings 1989

A Seventh Conference on Mathematics from a Christian Perspective

Gene B. Chase, Editor

Strokes For Representing Univariate Vector Field Maps, David Fowler, Colin Ware

Center for Coastal and Ocean Mapping

Particle systems make an excellent tool for creating tracks (which we call strokes) in vector fields. The question addressed in this paper is how such tracks should be made to vary in size and colour in order to reveal properties such as local direction and strength of the field. We find that for strokes that vary from large to small, direction is indicated by the large end. We also find that for strokes that vary in colour, the colour of the background is the most important determinant of perceived direction.

Displaying Correlations Using Position, Motion, Point Size Or Point Colour, Serge Limoges, Colin Ware, William Knight

Center for Coastal and Ocean Mapping

An empirical study is presented which explores the use of motion, point size and grey scales for the display of statistical data; specifically, the perception of correlations between variables. The task is to measure the subject's ability to perceive differences between high correlation and low correlation for a two dimensional plot presented in different ways. One variable is always mapped to position with respect to the x axis while the other is mapped to one of six different display parameters depending on experimental condition; namely: position with respect to the y axis, frequency, phase, and amplitude of oscillation, greyscale value …

Back Propagation With Integer Arithmetic, Takayuki Dan Kimura

All Computer Science and Engineering Research

The present work investigates the significance of arithmetic precision in neural network simulation. Noting that a biological brain consists of a large number of cells of low precision, we try to answer the question: With a fixed size of memory and CPU cycles available for simulation, does a larger sized net with less precision perform better than smaller sized one with higher precision? We evaluate the merits and demerits of using low precision integer arithmetic in simulating backpropagation networks. Two identical backpropagation simulators, ibp and fbp, were constructed on Mac II, ibp with 16 bits integer representations of network parameters …

User's Manual For Ccrc: (Common Lisp Version) Computing Reference Classes Statistical Reasoning Shell V. 2.5, R. P. Loui

All Computer Science and Engineering Research

CCRC implements a subset of Kyburg's rules for statistical inference. The system states from 1961 and is briefly described in "The Reference Class," (H. Kyburg Philosophy of Science 50, 1982). Consult the paper "Computing Reference Classes" (R. Loui, in Kanal, L. and Lemmer, J., Uncertainty in AI, v.1, North-Holland 1987) for a precis of the ideas underlying this program. This document is only the skeleton of a manual. It is designed to get the novice on the program as quickly as possible, and to provide some guidance for advanced questions. This piece of software is the extended version of a …

The Implementation Of A Generalized Database Directory, Claudia Helms-Vaccaro

Masters Theses

This paper presents the use of an index made up of a single B+ tree connected at its leaf nodes to a lower set of B+ trees--a multitree. It may be utilized to index dense or non-dense attributes of a file. An extra benefit of this structure is the ability to store a secondary attribute value for use when searching the index, often decreasing accesses and time required to complete the search.

Improved efficiency over current indices, such as conventional B+ trees or inverted files, is evaluated.

Defeasible Decisions: What The Proposal Is And Isn't, R. P. Loui

All Computer Science and Engineering Research

In two recent papers, I have proposed a description of decision analysis that differs from the Bayesian picture painted by Savage, Jeffrey and other classic authors. Response to this view have been either overly enthusiastic or unduly pessimistic. In this paper I try to place the idea in its proper place, which must be somewhere in between. Looking at decision analysis as defeasible reasoning produces a framework in which planning and decision theory can be integrated, but work on the details has barely begun. It also produces a framework in which the meta-decision regress can be stopped in a reasonable …

Escim: A System For The Investigation Of Meaningful Motion, Siew Hong Yang, Colin Ware

Center for Coastal and Ocean Mapping

A language is described whose purpose is the investigation of meaningful motion using Stimulus Response animation techniques. The language is capable of adjusting the shape, size and velocity of an actor in real-time computer animation. Some results are presented showing how it is possible to generate such behaviours as chasing, avoidance and hitting using this animation technique. A set of primitives are presented which we find invaluable in the control of size, stretch and velocity parameters when attempting to produce fluid and meaningful interactions.

Table Of Contents (1989), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1989

A Seventh Conference on Mathematics from a Christian Perspective

Gene B. Chase, Editor

The Fourth Dimension And The Theology Of Edwin Abbott Abbott, Thomas Banchoff

ACMS Conference Proceedings 1989

This paper is a brief biography of Edwin Abbott Abbott, author of Flatland, and a sketch of the main ideas in the book. It also incorporates some personal reflections.

Interpolation Search For Alphabetic Tables, Loizos Gabriel

Theses

One of the fastest search techniques for uniformly distributed sorted numerical tables is interpolation search. This divide and conquer technique accesses the most probable key rather than the middle key as in binary search and continues to search similarly the appropriate part of the table . In the previous work we proved a lg lg n average number of accesses for interpolation search.

The inefficiency of interpolation search for an alphabetic table is demonstrated by Burton and Lewis and a robust variation suggested by them to improve the efficiency. This inefficiency is expected since such tables are usually far from …

Cascading Lzw Algorithm With Huffman Coding : A Variable To Variable Length Compression Algorithm, Ashish Khandubhai Mehta

Theses

Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length string over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings.

To obtain a variable to variable length coding we choose to cascade the LZW , variable to fixed , coding with the Huffman , fixed …

Program Analysis Tool For Extensive Reverse Software Engineering : A Tool To Understand The Software (Patern), Bubulal R. Rawal

Theses

This thesis describes a computer aided software engineering tool called Program Analysis Tool for Extensive Reverse software eNgineering (PATERN). Conceptually, PATERN provides systems analysts/programmers with a powerful tool independent of programming language, operating system, and programmer style of coding for documenting existing software. PATERN has been tested with C code in the UNIX environment. This thesis also describes the interface between PATERN and two subsystems that interact with PATERN: relational databases and data flow diagram generators. The implementation of these interfaces was investigated using Informix and another software tool, Directed Acyclic Graphs (DAG) for generating hierarchical structure charts and flow …

Towards A Bound For The Compression Of The Lzw Algorithm, Anoop Kumar Srivastava, Shinu Gupta

Theses

The LZW algorithm is a well known efficient adaptive compression algorithm. It is based on constructing a dictionary containing character strings from the text. A number of researchers have attempted to add variations to the original algorithm to achieve higher compression values. In this thesis we attempt to find a bound for the LZW approach. That is, we build a dictionary which gives maximum compression and satisfies prefix property of LZW algorithm.

In order to build such an optimum dictionary, the dynamic programming technique is applied. The final dictionary selected consists of entries which give maximum overall compression and also …

Supporting Value Dependency For Nested Transactions In Interbase, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.

A Virtual Memory Operating System For A Distributed Workstation Environment, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.

Automated Translation Of Digital Logic Equations Into Optimized Vhdl Code, John Evan Stark, George Winston Zobrist

Computer Science Technical Reports

It was desired to develop an algorithm for the automated translation of finite slate machines from state table form to optimized VHDL form. To do this, algorithms arc needed for reducing the state machine to simplest form, making state assignments, producing minimal logic equations to represent the state machine, and producing VHDL code which describes the intended circuit. Various such algorithms were examined and a prototype program written to perform this translation.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Scientific Computing In The Soviet Union, Seymour E. Goodman, William Mchenry, Peter Wolcott

Information Systems and Quantitative Analysis Faculty Publications

In the last decade, the Soviet Union has placed increased emphasis on the development of high-speed computers and networks for use in scientific, economic, and military applications. When Communist Party General Secretary Mikhail Gorbachev labeled supercomputer development a "top priority task for our science and economy" in April, 1987, he added new urgency to the production of machines that would both support activities in these applications and also serve as high-profile standard-bearers for perestroika, his program of restructuring and modernization for the nation. The Soviets have also undertaken some major projects in networking, including the creation of a nationwide packet-switched …

Constructing Trees In Parallel, Mikhail J. Atallah, S. R. Kosaraju, L. L. Larmore, G. L. Miller

Department of Computer Science Technical Reports

No abstract provided.

The Coupon-Collector Problem Revisited, Arnon Boneh, Micha Hofri

Department of Computer Science Technical Reports

No abstract provided.

High Rate Concatenated Coding Systems Using Bandwidth Efficient Trellis Inner Codes, Robert H. Deng, D. J. Costello, Jr.

Research Collection School Of Computing and Information Systems

High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. …