Digital Commons Network^™

Specifying And Proving Properties Of Sentinels, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

This paper presents a technique for specifying and verifying properties of "sentinels," a high-level language construct for synchronizing access to shared resources. Statements in the specification language possess formal temporal semantics. As a prelude to proving the correctness of sentinels, the semantics of constructs used in sentinels is given. The proof technique involves showing that the temporal behavior of a sentinel conforms to that defined by the specification. The methodology is illustrated by applying it to a typical synchronization problem.

Algorithms For Pipe Network Analysis And Their Reliability, Don J. Wood

KWRRI Research Reports

Algorithms for analyzing steady state flow conditions in pipe networks are developed for general applications. The algorithms are based on both loop equations expressed in terms of unknown flowrates and node equations expressed in terms of unknown grades. Five methods, which represent those in significant use today, are presented. An example pipe network is analyzed to illustrate the application of the various algorithms. The various assumptions required for the different methods are presented and the methods are compared within a common framework.

The reliabilities of these commonly employed algorithms for pipe network analysis are investigated by analyzing a large number …

A General Theory Of Automatic Program Synthesis, Carl H. Smith

Department of Computer Science Technical Reports

No abstract provided.

Recommendations For Master's Level Programs In Computer Science: A Report Of The Acm Curriculum Committee On Computer Science, Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John Wesley Hamblen, A. A.J. Hoffmann, Robert Mathis

Computer Science Faculty Research & Creative Works

The ACM Committee on Curriculum in Computer Science has spent two years investigating master's degree programs in Computer Science. This report contains the conclusions of that effort. Recommendations are made concerning the form, entrance requirements, possible courses, staffing levels, intent, library resources, and computing resources required for an academic, professional, or specialized master's degree. These recommendations specify minimum requirements which should be met by any master's programs. The Committee believes that the details of a particular master's program should be determined and continually updated by the faculty involved. A single or a small number of model programs are not as …

A Model For Representing Families Of Programmed System, Walter F. Richy

Department of Computer Science Technical Reports

No abstract provided.

Regular Expressions In A Program Complexity Metric, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

A Complexity Measure Based On Nesting Level, Warren A. Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

A Suggested Course In Introductory Computer Programming, Warren A. Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

Introductory programming courses have long been a popular topic of discussion. Often it is either the only computer course a student takes, or it is the foundation upon which all further training in computer science is built. The usual goal of such a course is to introduce the student to the use of a computer to solve simple problems in his or her particular discipline. Generally, the method of presenting the material may be separated into two distinct schools of thought, which we have termed the "Black Box School of Thought" and the "White Box School of Thought". In this …

Computers, Corporate Division Programs, Your Future, 1981-1982, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

A Simulation Model For Assessing Alternate Strategies For Beef Production With Land, Energy And Economic Constraints, Otto J. Loewer, E. M. Smith, G. Benock, Thomas C. Bridges, Larry G. Wells, Nelson Gay, S. Burgess, L. Springate, David L. Debertin

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed to analyze alternate management strategies and energy and economic constraints. Daily production of beef animals and growing crops is simulated in response to prevailing conditions and system interactions using the GASP IV simulation language. Complete inventories of plant dry matter, animal status, production resources and economic net worth are maintained over the simulation period.

An Analytical Study Of Strategy-Oriented Restructuring Algorithms, Jehan-François Päris, Domenico Ferrari

Department of Computer Science Technical Reports

No abstract provided.

Software Metrics Data Collection, T. J. Yu, Brian A. Nejmeh

Department of Computer Science Technical Reports

No abstract provided.

Metamodeling And Its Application To Queueing Networks, Jeffrey P. Buzen, Subhash C. Agrawal

Department of Computer Science Technical Reports

No abstract provided.

The Configurable, Highly Parallel (Chip) Approach For Signal Processing Applications, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

Optimal Tile Salvage, Francine Berman, Frank Thomsons Leighton, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

Operational Analysis Of Queues With General Service Times, Jeffrey A. Brumfield, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Software Science Revisited: A Critical Analysis Of The Theory And Its Empirical Support, V. Y. Shen, S. D. Conte, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

Improving Virtual Memory Performance By Off-Line Page Clustering, Jehan-Francois Paris

Department of Computer Science Technical Reports

No abstract provided.

Recommendations For Master's Level Programs In Computer Science: A Report Of The Acm Curriculum Committee On Computer Science, Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John W. Hamblen, A. A. J. Hoffmann, Robert Mathis

Computer Science Faculty Publications

The ACM Committee on Curriculum in Computer Science has spent two years investigating master's degree programs in Computer Science. This report contains the conclusions of that effort. Recommendations are made concerning the form, entrance requirements, possible courses, staffing levels, intent, library resources, and computing resources required for an academic, professional, or specialized master's degree. These recommendations specify minimum requirements which should be met by any master's programs. The Committee believes that the details of a particular master's program should be determined and continually updated by the faculty involved. A single or a small number of model programs are not as …

The Role Of Technological Change, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

We develop an optimal growth model that includes several important new features. First, technological change is endogenously related to the growth of 'knowledge.' Investment may be directed either towards physical capital or knowledge (or both). Knowledge becomes an effective substitute for scarce resources by increasing the technical efficiency of resource utilization both for consumption and in capital. Nevertheless, a finite quantity resource must be embodied in capital and a finite flow is required for depreciation. Thus, there is an upper limit to technical efficiency and economic growth is thus ultimately limited by the availability of renewable resources. For a simple …

An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett

All Computer Science and Engineering Research

A semantic data model is introduced with the following capabilities: (1) Abstraction mechanisms for aggregation, generalization and classification, (2) Unstratified control of the database content, (3) Refined control of intentional and extensional information, and (4) Extensive semantic consistency checking. The basic features of the model are illustrated through a scenario of interactions between the user and the database system (using the proposed model) for constructing a simple database on technical publications.

Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki

All Computer Science and Engineering Research

We have developed a formal model of a database system that is unusual in that it has the ability to represent information about its own structure and to insure semantic consistency. The model distinguishes general laws from instances of events and objects, but many of its mechanisms serve both categories of information. The model form a substrate upon which an information structure appropriate to neonatology is being developed. Some example queries are shown and a design study for an associative memory suggested by the model is described briefly.

Hierarchical Analysis Of A Distributed Evaluator, Robert M. Keller, Gary Lindstrom

All HMC Faculty Publications and Research

We outline the analysis of a distributed evaluator for an applicative language FGL (Function Graph Language). Our goal is to show that the least fixed point semantics of FGL are faithfully implemented by the hardware evaluator envisioned in the Applicative Multi-Processor System AMPS. Included in the analysis are a formalization of demand-driven computation , the introduction of an intermediate graphic language IGL to aid in our proofs, and discussion of pragmatic issues involved in the AMPS machine language design.

Bounds On The Number Of Samples Needed For Neural Learning, Kishan G. Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper addresses the relationship between the number of hidden layer nodes in a neural network, the complexity of a multi-class discrimination problem, and the number of samples needed for effective learning. Bounds are given for the latter. We show that Ω(min(d,n).M) boundary samples are required for successful classification of M clusters of samples using a 2 hidden layer neural network with d-dimensional inputs and n nodes in the first hidden layer.

Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 2, No. 1, Wku Mathematics & Computer Science

WKU Administration Documents

Newsletter created by the Ogden Computer Laboratory to promote services, courses, hardware, software and student activities.

High Order Methods For Elliptic Partial Differential Equations With Singularities, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Principles, Preferences And Ideals For Computer Arithmetic, Thomas E. Hull, Christian H. Reinsch, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Principles Of Program Design Induced From Experience With Small, Public Programs, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

A Critique Of The Foundations Of Hoare-Style Programming Logics, Michael O'Donnell

Department of Computer Science Technical Reports

No abstract provided.

A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous

Computational Modeling & Simulation Engineering Theses & Dissertations

The Karhunen Loeve Transform has conclusively been shown to be the optimum data compression algorithm for signals belonging to the same second order stationary process. Consequently, researchers have been searching for a fast implementation for the transform. Fast imple­mentation methods similar to those developed for other orthogonal transforms are generally not applicable to the Karhunen Loeve Transform (KLT). Also, since the basis vectors composing the transformation matrix of the KLT are the eigenvectors of the covariance matrix of the input process, they must be computed first. The research re­ ported here is an attempt to reduce the dimensionality of the …