Physical Sciences and Mathematics Commons^™

Software Productivity, Harlan D. Mills

The Harlan D. Mills Collection

No abstract provided.

Principles Of Computer Programming: A Mathematical Approach, Harlan D. Mills, Victor R. Basili, John D. Gannon, Richard D. Hamlet

The Harlan D. Mills Collection

No abstract provided.

The Magical Computer, David Morgan Lochhead

Dr. David Morgan Lochhead

David Lochhead's speech: "Two years ago, I had the privilege of giving the opening address at the first CAMCON. I opened that address by posing the question "Does God love Computers?" Today I would like to start with a related question. What makes computers loveable? "

Metaprolog User Manual, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

MetaProlog is a logic-based programming language which subsumes the full Prolog language. This implementation is an incremental compiler (which also looks and feels like an interpreter) supporting meta-level constructs that are usually provided by the underlying architecture in other systems and are not directly available to the user. The most obvious feature of MetaProlog is the ability to handle multiple databases (referred to as theories) at the same time. In contrast to ordinary Prolog’s single-theory database, a MetaProlog database is a collection of theories. A theory is a first-class object and can be passed around as the value of a …

Metaprolog Design And Implementation, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

Many researchers in the area of logic programming have recognized the limits of logic languages such as Prolog and suggested a meta level approach as an alternative. Some of the main drawbacks cited are the control strategy, the presence of a single database, and the ad hoc extensions to the base logic programming paradigm to allow the dynamic modification of the database. The MetaProlog language, which includes Prolog and some of its metalanguage, deals with some of these problems. In this paper, the design and implementation of MetaProlog are described and the changes to the Warren Abstract Machine (WAM) on …

Theft Of Information In The Take-Grant Protection Model, Matt Bishop

Computer Science Technical Reports

(Revised 5/90). Questions of information flow are in many ways more important than questions of access control, because the goal of many security policies is to thwart the unauthorized release of information, not merely the illicit obtaining of access rights to that information. The Take-Grant Protection Model is an excellent theoretical tool for examining such issues because conditions necessary and sufficienct for information to flow between tow objects, and for rights to object to be obtained or stolen, are known. In this paper we extend these results by examinig the question of information flow from an object the owner of …

An Application Of A Fast Data Encryption Standard Implementation, Matt Bishop

Computer Science Technical Reports

The Data Encryption Standard is used as the basis for the UNIX password encryption scheme. Some of the security of that scheme depends on the speed of the implementation. This paper presents a mathematical formulation of a fast implementation of the DES in software, discusses how the mathematics can be translated into code, and then analyzes the UNIX password scheme to show how these results can be used to implement it. Experimental results are provided for several computers to show that the given method speeds up the computation of a password by roughly 20 times (depending on the specific computer).

Distributed Algorithms For Selection In Sets, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Connected Component Labeling Algorithms On The Mpp, Susanne E. Hambrusch, Lynn Tewinkel

Department of Computer Science Technical Reports

No abstract provided.

Ua8 Wku Administrative Software Project, Wku Information Technology

WKU Archives Records

Outline of project to upgrade software in WKU's administrative offices and brief overview of Information Technology history.

Ua35/11 Wku Student Honors Research Bulletin, Wku University Honors Program

WKU Archives Records

The Western Kentucky University Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers represent work done by students from throughout the university.

• Kesselring, Marcia. Attitudes Toward the Need for Computer Literacy
• Tuck, Janna & Karen Wiggins. Methylation and Confirmation of PGE
• Lewis, Gloria. John Donne's Attitude Toward Love
• Johnson, Linda. International Telecommunications Trade with Japan
• Sharpe, Greg. Precipitation Patterns in Bowling Green, Kentucky, 1980-1985
• Smith, Sandy. Religion and the Media: Alliance or War?
• Bell, Suzanne. Early Secret Involvement of the United States Military in Cambodia
• Scariot, Linda. Parental Divorce and Childhood Emotional Disturbances
• Daniel, Janice. …

A Fast Fault Simulation Algorithm For Combinational Circuits, Wuudiann Ke, Sharad C. Seth, Bhargab B. Bhattacharya

CSE Conference and Workshop Papers

The performance of a fast fault simulation algorithm for combinational circuits, such as the critical path tracing method, is determined primarily by the efficiency with which it can deduce the detectability of stem faults (stem analysis). We propose a graph based approach to perform stem analysis. A dynamic data structure, called the criticality constraint graph, is used during the backward pass to carry information related to self masking and multiple-path sensitization of stem faults. The structure is updated in such a way that when stems are reached their criticality can be found by looking at the criticality constraints on their …

Test Generation By Fault Sampling, Vishwani Agrawal, Hassan Farhat, Sharad C. Seth

CSE Conference and Workshop Papers

This paper presents a novel technique of generating tests from a random sample of faults. The entire fault population of the circuit is randomly divided into two groups. Only one group, usually the smaller one, is used for test generation by the test-generator and fault-simulator programs. This group is known as the sample and its coverage is deterministic. The coverage of faults in the remaining group is similar to that of random vectors and is estimated from the distribution of fault detection probabilities in the circuit. As the sample size increases, the fraction of unsampled faults reduces. At the same …

Knowledge Organization And Inference Engine For The Wvu Face Decision Support System, S. Carrow, R. S. Nutter Jr., R. S. Raman, N. A. Reddy, Y. V. Reddy, R. Larry Grayson

Mining Engineering Faculty Research & Creative Works

The knowledge-based organization for the West Virginia University Face Decision Support System is given, along with the initial development of the associated inference engine. The knowledge base contains generic knowledge about underground coal mines that utilize continuous miners. A typical knowledge entry is given, and the inference engine methodology is explained. The engine utilizes this knowledge with data from monitoring systems and from interaction with the section foreman, to assist in making section management decisions and plans.

Generating Multiple User Interfaces For Multiple Application Domains, Mahesh Hassomal Dodani

Retrospective Theses and Dissertations

This Ph.D. dissertation presents a classification scheme for User Interface Development Environments (UIDEs) based on the multiplicity of user interfaces and application domains that can be supported. The SISD, SIMD and MISD [S= Single, I= user Interface(s), M= Multiple, D= application Domain(s)] generator classes encompass most of the UIDEs described in the literature. A major goal of this research is to allow any user to develop a personalized interface for any interactive application, that is, the development of an MIMD UIDE.

Fundamental to the development of such a UIDE is the complete separation of the user interface component from the …

Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

All HMC Faculty Publications and Research

Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14–30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have shown that Ω(t) connectivity is necessary if the requirement is that all nonfaulty processors decide unanimously, where t is the number of faults to be tolerated. We believe that in forseeable technologies the number of faults will grow with the size of the …

Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger

All HMC Faculty Publications and Research

A new method for constructing wide-sense nonblocking networks is presented. Application of this method yields (among other things) wide-sense nonblocking generalized connectors with n inputs and outputs and size O( n log n ), and with depth k and size O( n^{1 + 1/k} ( log n )^{1 - 1/k} ).

A Parallel Implementation Of Stickel's Ac Unification Algorithm In A Message-Passing Environment, David John Kleikamp

Masters Theses

"Unification algorithms are an essential component of automated reasoning and term rewriting systems. Unification finds a set of substitutions or unifiers that, when applied to variables in two or more terms, make those terms identical or equivalent. Most systems use Robinson's unification algorithm or some variant of it. However, terms containing functions exhibiting properties such as associativity and commutativity may be made equivalent without appearing identical. Systems employing Robinson's unification algorithm must use some mechanism separate from the unification algorithm to reason with such functions. Often this is done by incorporating the properties into a rule base and generating equivalent …

Executable Assertion Development For The Distributed Parallel Environment, Bruce M. Mcmillin, L. M. Ni

Computer Science Faculty Research & Creative Works

The use of executable assertions is a powerful tool with which to perform program verification, provide software fault-tolerance, and provide hardware fault-tolerance via the application-oriented paradigm. The authors show that assertions commonly used in the sequential programming environment are inadequate for the distributed parallel environment. In particular, it is shown that even design-based assertions are myopic and provide inadequate error coverage. In their place, a triad of basic metrics is proposed for certain classes of problems that, when applied beginning with the specification phase of the life cycle, produce assertions that are better suited to the parallel environment. This method …

What Is The Path To Fast Fault Simulation?, Miron Abramovici, Balaji Krishnamurthy, Rob Mathews, Bill Rogers, Michael Schulz, Sharad C. Seth, John Waicukauski

School of Computing: Faculty Publications

Motivated by the recent advances in fast fault simulation techniques for large combinational circuits, a panel discussion has been organized for the 1988 International Test Conference. This paper is a collective account of the position statements offered by the panelists.

Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman

All Computer Science and Engineering Research

The display of three-dimensional medical data is becoming more common, but current hardware and image rendering algorithms do not generally allow real-time interaction with the image by the user. Real-time interactions, such as image rotation, utilize the motion processing capabilities of the human visual system, allowing a better understanding of the structures being imaged. Recent advances in general purpose graphics display equipment could make real-time interaction feasible in clinical setting. We have evaluated the capabilities of one type of advanced display architecture, the PIXAR Imaging Computer, for real-time interaction while displaying three-dimensional medical data as two-dimensional projections. It was discovered …

A Relational Object-Oriented Management System And An Encapsulated Object-Oriented Programming System, Michael L. Nelson

Retrospective Theses and Dissertations

The purpose of the Relational Object-Oriented Management System (ROOMS) is to show that the relational database scheme is a viable approach for storing objectoriented data. ROOMS is designed so that it can be implemented in any object-oriented language with appropriate I/O commands, or added to any objectoriented database management system that allows userdefined collections of data. Various problems were encountered in developing ROOMS. While these problems have been solved, the best solution is to use the Encapsulated Object-Oriented Programming System (EOOPS) . EOOPS is based upon an inheritance scheme which preserves encapsulation. This encapsulated approach avoids the problems associated with …

Academically-Sponsored Coastal Research Vessels In The New England Region: An Assessment Of Current Management And Implications For The Future, Brendan B. Mcavoy

Marine Affairs Theses and Major Papers

In New England an informal communications network exists between coastal research vessel operating institutions. Vessel scheduling and operational support has been identified as adequate for the current amount of research being conducted within the region. However, societal shift towards coastal regions is prompting an increase in attention to research within the coastal zone. Current and pending federal initiatives are responding to this increased research need. This, in turn, is beginning to impose greater demands on coastal vessel sea-time. Therefore, a strengthening of the region's inter-institutional communications network may be warranted for the future in order to better coordinate coastal research …

Test Generation By Fault Sampling, Vishwani Agrawal, Hassan Farhat, Sharad C. Seth

Mathematics Faculty Publications

This paper presents a novel technique of generating tests from a random sample of faults. The entire fault population of the circuit is randomly divided into two groups. Only one group, usually the smaller one, is used for test generation by the test-generator and fault-simulator programs. This group is known as the sample and its coverage is deterministic. The coverage of faults in the remaining group is similar to that of random vectors and is estimated from the distribution of fault detection probabilities in the circuit. As the sample size increases, the fraction of unsampled faults reduces. At the same …

Automatically Generating Syntax-Directed Editors For Graphical Languages, Farahangiz Arefi

Retrospective Theses and Dissertations

This research is concerned with the automatic generation of syntax-directed editors for graphical programming languages. A specification technique that is used to uniformly define graphical languages along with their syntax-directed editors is developed. The novel aspect of this specification technique, called a general graph transformation system, is that the graphical languages are described by specifying a family of editing operations. In this manner, a language is defined as a dynamic object which, by applying different editing operations, changes from one form to another, each form representing a sentence of the language. In order to demonstrate this process, the language of …

Hardware Algorithms For Data Compression, N. Ranganathan

Retrospective Theses and Dissertations

Data compression is the reduction of redundancy m data representation in order to decrease storage and communication costs. Data compression techniques have been used in practice primarily through software implementations which fail to meet the speed and performance requirements of current and future systems. This Ph.D. dissertation presents a set of hardware algorithms for compression and decompression techniques and the results of detailed simulations performed to quantify the effects of incorporating such hardware in various architectural environments. A new pipelined algorithm for data compression applicable to static binary encoding schemes is presented. A fast hardware algorithm for decompression that uses …

Some Optimally Adaptive Parallel Graph Algorithms On Erew Pram Model, Sajal K. Das

Retrospective Theses and Dissertations

The study of graph algorithms is an important area of research in computer science, since graphs offer useful tools to model many real-world situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms.

Using an exclusive-read and exclusive-write (EREW) parallel random access machine (PRAM) as the computation model with a fixed number of processors, we design and analyze parallel algorithms for seven undirected graph problems, such as, connected components, spanning forest, fundamental cycle set, bridges, bipartiteness, assignment problems, and approximate vertex coloring. For all but the last two problems, the input data structure …

A Coprocessor Design For The Architectural Support Of Non-Numeric Operations, Timothy W. Curry

Retrospective Theses and Dissertations

Computer Science is concerned with the electronic manipulation of information. Continually increasing amounts of computer time are being expended on information that is not numeric. This is represented in part by modem computing requirements such as the block moves associated with context switching and virtual memory management, peripheral device communication, compilers, editors, word processors, databases, and text retrieval. This dissertation examines the traditional support of non-numeric information from a software, firmware, and hardware perspective and presents a coprocessor design to improve the performance of a set of non-numeric operations. Simple micro-coding of operations can provide a degree of performance improvement …

Matrix Methods Of Approximating Classical Predator-Prey Problems, E. Y. Rodin, R. Greenberg, B. Nelson

Computer Science: Faculty Publications and Other Works

No abstract provided.

Resource Sharing: A Study Of Florida's Shared-Used Library Collections, Susan Anderson

CCE Theses and Dissertations

Designed to provide library service for two or more different groups of library users in one library facility, shared-use or joint-use libraries are a unique aspect of library resources sharing. Thirteen examples of shared-use library collections in shared or joint-use library facilities in Florida were examined in this investigation. Special focus was placed on the perceptions of librarians who work in these libraries in order to determine how well the libraries meet the information needs on users and how successful the libraries are in conserving financial resources as a result of combined collections. A design of a special resource collections …