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 29611 - 29640 of 29743

Full-Text Articles in Entire DC Network

Testing The Coordination Predicate, Janice D. Cuny, Lawrence Synder Aug 1981

Testing The Coordination Predicate, Janice D. Cuny, Lawrence Synder

Department of Computer Science Technical Reports

No abstract provided.


The Csnet User Environment, Peter J. Denning, Douglas E. Comer Jul 1981

The Csnet User Environment, Peter J. Denning, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.


Communicating Spiritual Insights In Mathematics Classes, Verbal Snook Jun 1981

Communicating Spiritual Insights In Mathematics Classes, Verbal Snook

ACMS Conference Proceedings 1981

No abstract provided.


Science As Allegory, Vern Poythress Jun 1981

Science As Allegory, Vern Poythress

ACMS Conference Proceedings 1981

The universe is God’s choral poem, and science is a system of allegories within it. That is the thesis that I propose to expound and defend. Yet it is not a “thesis” at all, if the word “thesis” commits me to a certain kind of strict logical defense. I am not putting forward my thesis that science is allegory as the endpoint of a deductive or inductive argument. Rather, it is a springboard for a program of exploration and reflection that turns upside-down some conventional ways of thinking about science.


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

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

ACMS Conference Proceedings 1981

No abstract provided.


On App Decoding, Carlos R.P. Hartmann, Luther D. Rudolph, Kishan Mehrotra, Guy J. Snedeker Jun 1981

On App Decoding, Carlos R.P. Hartmann, Luther D. Rudolph, Kishan Mehrotra, Guy J. Snedeker

Electrical Engineering and Computer Science - Technical Reports

In this paper we show that APP decoding for a linear code C is optimum not for C, but for a minimum-distance-2 code which contains C as a subcode when the codewords of are transmitted with equal probability. However, APP decoding is shown to be a symptotically optimum for C for high SNR when C is a binary one-step orthogonolizable code with equiprobable codewords transmitted over the AWGN channel.


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 …


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.


Application Of Information Theory To The Construction Of Efficient Decision Trees, Carlos R.P. Hartmann, Pramod Varshney, Kishan Mehrotra, Carl L. Gerberich Mar 1981

Application Of Information Theory To The Construction Of Efficient Decision Trees, Carlos R.P. Hartmann, Pramod Varshney, Kishan Mehrotra, Carl L. Gerberich

Electrical Engineering and Computer Science - Technical Reports

This paper treats the problem of conversion of decision tables to decision trees. In most cases, the construction of optimal decision trees is an NP-complete problem and, therefore, a heuristic approach to this problem is necessary. In our heuristic approach, we apply information theoretic concepts to construct efficient decision trees for decision tables which may include “don’t-care” entries. In contrast to most of the existing heuristic algorithms, our algorithm is systematic and has a sound theoretical justification. The algorithm has low design complexity and yet provides us with near-optimal decision trees.


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.


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 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 …


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

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

College of Engineering and Computing Course Catalogs

No abstract provided.


Vlsi Algorithms For Relational Database Operations, Ching C. Hsiao, Lawrence Snyder Jan 1981

Vlsi Algorithms For Relational Database Operations, Ching C. Hsiao, Lawrence Snyder

Department of Computer Science Technical Reports

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.


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.


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.


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.


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 …


Some Computational Aspects Of Queueing Network Models, Herb Schwetman Dec 1980

Some Computational Aspects Of Queueing Network Models, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.


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

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.


Research In Secure Computing (Final Report), Dorothy E. Denning, Peter J. Denning Aug 1980

Research In Secure Computing (Final Report), Dorothy E. Denning, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


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

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.