Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 27361 - 27390 of 27587

Full-Text Articles in Entire DC Network

Progress Report Operational Analysis Of Queueing Phenomena, Peter J. Denning, Jeffrey P. Buzen Jun 1981

Progress Report Operational Analysis Of Queueing Phenomena, Peter J. Denning, Jeffrey P. Buzen

Department of Computer Science Technical Reports

No abstract provided.


Performance Evaluation: Experimental Computer Science At Its Best, Peter J. Denning May 1981

Performance Evaluation: Experimental Computer Science At Its Best, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


A Hybrid Metric To Measure Software Complexity, Warren Harrison, Kenneth I. Magel May 1981

A Hybrid Metric To Measure Software Complexity, Warren Harrison, Kenneth I. Magel

Computer Science Technical Reports

Software complexity is an important facet of the software development process, especially in regard to maintenance. A number of complexity metrics have been developed to measure the complexity contributed by: program size, flow of control, data structures, or a combination of two or more of these. Several representative measures from each of these groups are described.

A new hybrid complexity metric, the Extended Scope Metric, is presented and compared with other popular complexity metrics. While the new metric appears to be an improvement over existing metrics due to its enhanced context sensitivity and comprehensiveness, conclusive results cannot be determined until …


Ellpack User's Guide Supplement, John R. Rice May 1981

Ellpack User's Guide Supplement, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


The Menu Formation In A Computerized Nutrition System, Kathleen Ann Kostrzewa Apr 1981

The Menu Formation In A Computerized Nutrition System, Kathleen Ann Kostrzewa

Masters Theses

The creation of a diet is a complex process which involves analysis of a number of critical variables. Due to present technology, computers can be used effectively in menu planning and recipe analysis.

The objective of this study is the utilization of the computer to test the major criteria which must be met in order to produce a diet which meets nutritional, cost, and acceptability requirements. In this thesis, the design and implementation of a computerized menu planning system known as the Nutritional Data Base System is presented.


Pmva - Purdue Mean Value Analysis Program User's Guide, Jeff Brumfield Apr 1981

Pmva - Purdue Mean Value Analysis Program User's Guide, Jeff Brumfield

Department of Computer Science Technical Reports

No abstract provided.


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

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 Mar 1981

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 Mar 1981

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 Mar 1981

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 Jan 1981

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

Department of Computer Science Technical Reports

No abstract provided.


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

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 Jan 1981

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 …


The Double Eigenvalue Problem; Including Numerical Solutions, John Gregory, Ralph W. Wilkerson Jan 1981

The Double Eigenvalue Problem; Including Numerical Solutions, John Gregory, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.


Conversion From Data-Flow To Synchronous Execution In Loop Programs, Janice D. Cuny, Lawrence Synder Jan 1981

Conversion From Data-Flow To Synchronous Execution In Loop Programs, Janice D. Cuny, Lawrence Synder

Department of Computer Science Technical Reports

No abstract provided.


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

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 Jan 1981

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

Department of Computer Science Technical Reports

No abstract provided.


Some Results On Perfect, Static-Key Hashing, Eric Dittert, Michael J. O'Donnell Jan 1981

Some Results On Perfect, Static-Key Hashing, Eric Dittert, Michael J. O'Donnell

Department of Computer Science Technical Reports

No abstract provided.


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

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

Department of Computer Science Technical Reports

No abstract provided.


The Response Times Of Priority Classes Under Preemptive Resume In M/G/M Queues, A. B. Bondi, J. P. Buzen Jan 1981

The Response Times Of Priority Classes Under Preemptive Resume In M/G/M Queues, A. B. Bondi, J. P. Buzen

Department of Computer Science Technical Reports

No abstract provided.


Wafer Scale Integration Of Parallel Processors, Kye Sherrick Hedlund Jan 1981

Wafer Scale Integration Of Parallel Processors, Kye Sherrick Hedlund

Department of Computer Science Technical Reports

No abstract provided.


History And Overview Of Csnet, Peter J. Denning, Anthony Hearn, C. William Kern Jan 1981

History And Overview Of Csnet, Peter J. Denning, Anthony Hearn, C. William Kern

Department of Computer Science Technical Reports

No abstract provided.


The Aggregate Server Method For Analyzing Serialization Delays In Computer Systems, Subhash C. Agrawal, Jeffrey P. Buzen Jan 1981

The Aggregate Server Method For Analyzing Serialization Delays In Computer Systems, Subhash C. Agrawal, Jeffrey P. Buzen

Department of Computer Science Technical Reports

No abstract provided.


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

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 Jan 1981

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.


Restruct: A Specification-Driven File Transformation Tool, James D. Arthur, Douglas E. Comer Jan 1981

Restruct: A Specification-Driven File Transformation Tool, James D. Arthur, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.


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

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 Jan 1981

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 …


Dialectical Thermodynamics, Martin Zwick Jan 1981

Dialectical Thermodynamics, Martin Zwick

Complex Systems Faculty Publications and Presentations

A lugubrious, though highly abstract, proposition about sociocultural systems is suggested by a union of dialectical and thermodynamic concepts: systems are invariably flawed, not only because of poor --or absence of -design, or ill will, but because the "closedness" of a system necessarily wars on its "openness," and because the actualization of the organizing principle upon which a system is based brings with it the development of its "shadow," its negation. Reconciliation of these contradictions is not assured.


The Coronary Distribution Zone : Mathematical Modelling Of The Left Ventricular Epicardial Surface For Area Calculation, Three-Dimensional Rotaton And Display, S. Matts E. Sjölander Dec 1980

The Coronary Distribution Zone : Mathematical Modelling Of The Left Ventricular Epicardial Surface For Area Calculation, Three-Dimensional Rotaton And Display, S. Matts E. Sjölander

Loma Linda University Electronic Theses, Dissertations & Projects

A computer model of the left ventricular (LV) epicardial surface was developed from Jang’s truncated ellipsoidal model, which has a minor to major axis ratio of 6:10. The model was applied in calculating the area of a segment of the myocardium, jeopardized by an impending occlusion of its associated artery. The endangered segment of the LV muscle was also visualized in different projections by rotations in three space and graphical displays simulating the three dimensions.

The area formula for the surface of the ideal model , a truncated prolate spheroid, was derived and used in producing maps for manual calculations …