Digital Commons Network^™

Some Computational Aspects Of Queueing Network Models, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.

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 …

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.

A Note On The Semantics Of Looping Programs In Propositional Dynamic Logic, Francine Berman

Department of Computer Science Technical Reports

No abstract provided.

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.

Computing Cyclic List Structures, F. Lockwood Morris, Jennifer Schwarz

Electrical Engineering and Computer Science - Technical Reports

It is argued that list structures containing cycles are useful and unobjectionable Lisp entities. If this is so, it is desirable to have a means of computing them less foreign to the equational-definition style characteristic of Lisp than are the list-structure-altering primitives rplaca and rplacd. A notion is developed of a reasonable system of mutually recursive equations, guaranteed to have a unique solution in list structures. The notion is given in terms of the computations invoked by the equations, without reference to the forms of expressions appearing in them. A variety of programming examples are presented, including a curious implementation …

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.

Programming With Recursion, Dirk Siefkes

Department of Computer Science Technical Reports

No abstract provided.

Low Contention Semaphores And Ready Lists, Peter J. Denning, T. Don Dennis, Jeffrey Brumfield

Department of Computer Science Technical Reports

No abstract provided.

Using The Purdue Procsy Terminal System (Fortran), Bob Brown

Department of Computer Science Technical Reports

No abstract provided.

Using The Purdue Procsy Terminal System (Pascal), Bob Brown

Department of Computer Science Technical Reports

No abstract provided.

On The Evaluation Of Powers And Monomials, Nicholas Pippenger

All HMC Faculty Publications and Research

Let $y_1 , \cdots ,y_p $ be monomials over the indeterminates $x_1 , \cdots ,x_q $. For every $y = (y_1 , \cdots ,y_p )$ there is some minimum number $L(y)$ of multiplications sufficient to compute $y_1 , \cdots ,y_p $ from $x_1 , \cdots ,x_q $ and the identity 1. Let $L(p,q,N)$ denote the maximum of $L(y)$ over all $y$ for which the exponent of any indeterminate in any monomial is at most $N$. We show that if $p = (N + 1^{o(q)} )$ and $q = (N + 1^{o(p)} )$, then $L(p,q,N) = \min \{ p,q\} \log N …

Testing Network-Of-Queues Software, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Models For Verifiers, Francine Berman

Department of Computer Science Technical Reports

No abstract provided.

The Power Of Parallelism Automatic Program Synthesis, Carl H. Smith

Department of Computer Science Technical Reports

No abstract provided.

Is Mathematical Software A Legitimate Research Area?, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Implementing The Mean Value Algorithm For The Solution Of Queueing Network Models, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Modeling Performance Of The B6700: A Case Study, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Program Restructuring In Segmenting Environments, Jehan-François Päris

Department of Computer Science Technical Reports

No abstract provided.

Validating System Models: A Case Study, H. D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Effort Minimization Based On Hierarchical Modularization, S. D. Conte

Department of Computer Science Technical Reports

No abstract provided.

Correction To "Redundancy Optimization Of General Systems", H. Sivaramakrishnan, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Reader Aids-

Purpose: Report a correction

Special math needed: Probability

Results useful to: Reliability Theoreticians

Measuring And Calculating Queue Length Distributions, Jeffrey P. Buzen, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Solution Of General Queueing Networks Using Norton's Theorem, Stephen Tolopka

Department of Computer Science Technical Reports

No abstract provided.

1979 Ellpack Workshop, Progress Report And A Proposal For A 2-Year Program, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Ellpack Network Documentation Preliminary Version, Ron Boisvert, John R. Rice, John Warner

Department of Computer Science Technical Reports

No abstract provided.

Ellpack '78 User's Guide-Preliminary Version, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Fast Lp(K) Analysis, Giovanni Maria Sacco

Department of Computer Science Technical Reports

No abstract provided.