Digital Commons Network^™

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

Error Analysis Of Homogeneous Mean Queue And Response Time Estimators, Jeffrey A. Brumfield, Peter J. Denning

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.

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

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

Department of Computer Science Technical Reports

No abstract provided.

Wafer Scale Integration Of Parallel Processors, Kye Sherrick Hedlund

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.

The Notation Of Operational Analysis, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

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.

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

Department of Computer Science Technical Reports

No abstract provided.

A New Ordering Scheme For The Hermite Bicubic Collocation Equations, Wayne R. Dyksen, John R. Rice

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

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 …

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.

Introduction To The Configurable, Highly Parallel (Chip) Computer), Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

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.

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

Department of Computer Science Technical Reports

No abstract provided.

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.