Digital Commons Network^™

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

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 …

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

Design And Use Of A Computerized Test Generating Program, Edward Schaefer, Laurence A. Marschall

Physics and Astronomy Faculty Publications

An easy-to-use set of programs for the computerized generation of multiple-choice and easy examinations in an introductory astronomy course is described. The programs allow the user to establish files of test questions and to rapidly assemble printed copies of examinations suitable for photocopying. Written in ALGOL for a Burroughs B6700 computer, the programs can, in principle, be implemented on large mainframe computers or on microcomputers of a size increasingly available to physics departments. The advantages and costs of computerized test generation are discussed.

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.

An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing

Computer Science Faculty Publications

Let B be a body in R³, and let S denote the boundary of B. The surface S is described by S = {(x, y, z): (x² + Y²)^½= ƒ(z), -1≤ z ≤ I}, where ƒ analytic function that is real and positive on (-1, 1) and ƒ(±1) = 0. An algorithm is described for computing the scattered field due to a plane wave incident field, under Leontovich boundary conditions. The Galerkin method of solution used here leads to a block diagonal matrix involving 2M …

A Follow Up Study Of Printing Management Graduates, Terry Miller

College of Graduate Studies: Theses & Dissertations (1964–2006)

No abstract provided.

A Cooperative Education Program For Technology Majors, Joel Lee Sawyer

College of Graduate Studies: Theses & Dissertations (1964–2006)

Cooperative Education is a method of higher education that combines academic work with practical on-the-job experience. The goal is to prepare students for career opportunities through a balance of theory and related employment with a business or industry. "Thus, the student is provided a unique experience. . . Work that will be profitable to both the student and employer; and experience that will enhance the student's knowledge, personal development and professional preparation" (3, p. 2).

A need has been established to initiate a Cooperative Education Program for the Division of Technology at Georgia Southern College. This study was devoted to …

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

Efficient Employment Of Cohorts Of Labor In The U.S. Economy: An Illustration Of A Method, A. E. Boardman, Steven M. Miller, A. P. Schinnar

Research Collection School Of Computing and Information Systems

This paper presents a model for the analysis of efficient labor force participation in the U.S. economy. Ridge regression estimates of the elasticities of cohorts of labor, classified by sex and occupation, are used in conjunction with wage data to illustrate the derivation of efficient allocation of labor cohorts in five economic sectors. These efficient constructs are compared with actual census data for 1960 and 1970. The results, while tentative, show a trend toward more efficient utilization of labor and greater participation by women in the work force.

Hash-Binary Search: A Fast Technique For Searching An English Spelling Dictionary, Douglas E. Comer, Vincent Y. Shen

Department of Computer Science Technical Reports

No abstract provided.

Optimal 2,3-Trees, Nicholas J. Pippenger, Raymond E. Miller, Arnold L. Rosenberg, Lawrence Snyder

All HMC Faculty Publications and Research

The 2,3-trees that are optimal in the sense of having minimal expected number of nodes visited per access are characterized in terms of their “profiles”. The characterization leads directly to a linear-time algorithm for constructing a K-key optimal 2,3-tree for a sorted list of K keys. A number of results are derived that demonstrate how different in structure these optimal 2,3-trees are from their “average” cousins.

The Total Negation Of A Topological Property, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

A Mechanism For Specifying Parallel Procedures, James Oliver Smith Jr.

Masters Theses

"This thesis presents a mechanism that will provide a semantic and syntactic environment for expressing parallel procedures. This mechanism will be referred to as the Parallel Machine. The parallelism of the Parallel Machine is accomplished through an arbitrary number of specialized computing elements that each implement a single command called a Simultaneous Command. Each Simultaneous Command is capable of determining the occasions for its action by observing conditions within the Parallel Machine. There is no restriction on the number of Simultaneous Commands that can be defined or be simultaneously active. Within a parallel procedure expressed as a set of Simultaneous …

A Graded Bibliography On Macro Systems And Extensible Languages, John R. Metzner

Computer Science Faculty Research & Creative Works

No abstract provided.

Historical Development Of Computer Science At Purdue University, S. D. Conte

Department of Computer Science Technical Reports

No abstract provided.

On The Relative Comprehensibility Of Various Control Structures By Novice Fortran Programmers, C. H. Smith, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

Applications Of Classical Recursion Theory To Computer Science, Carl H. Smith

Department of Computer Science Technical Reports

No abstract provided.

An Inductive Inference Bibliography, Carl H. Smith

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Publication Delays, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

A Programming Language Theorem Which Is Independent Of Peano Arithmetic, Michael O'Donnell

Department of Computer Science Technical Reports

No abstract provided.

A Rapid Algorithm For Reliability Optimization Of Parallel Redundant Systems, Arcot Desai Narasimhalu, H. Sivaramakrishnan

Research Collection School Of Computing and Information Systems

A rapid method is proposed for optimization of reliability of multiconstraint parallel redundant systems. The constraints need not be linear. This method provides good starting values, which are close to the boundary of the feasible region, for the number of redundant units in each subsystem. No proof has been presented to establish the optimality obtained by this method. Yet for examples tried out this method provides optimal or near optimal solutions.

Quantitative Estimates Of Debugging Requirements, Linda M. Ottenstein

Department of Computer Science Technical Reports

No abstract provided.

Sbopt: A Simulation Based Optimization Algorithm, B. A. Dendrou, S. A. Dendrou, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Numerical Methods For Flood Routing Problems, B. A. Dendrou, Elias N. Houstis, T. S. Papathedorou, S. A. Dendrou

Department of Computer Science Technical Reports

No abstract provided.