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 63541 - 63570 of 63830

Full-Text Articles in Entire DC Network

A Compiler Extension Theorem For Lucid, Christoph M. Hoffmann Feb 1977

A Compiler Extension Theorem For Lucid, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


Heuristics For Trie Index Minimization, Douglas E. Comer Feb 1977

Heuristics For Trie Index Minimization, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.


Software For Numerical Computation, John R. Rice Jan 1977

Software For Numerical Computation, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Epistemology To Ontology, Charles R. Hampton Jan 1977

Epistemology To Ontology, Charles R. Hampton

ACMS Journal 2004

This paper argues for mathematicians thinking about the philosophy of math, especially Christians. It briefly sketches the limitations of formalism, intuitionism, and logicism and uses Christian concept of creation to argue that one can take the best of each of these philosophies and avoid the pitfalls. It also argues for the real existence of mathematical objects apart from the human mind.


Recent Problems In The Foundations Of Mathematics, Terence H. Perciante Jan 1977

Recent Problems In The Foundations Of Mathematics, Terence H. Perciante

ACMS Journal 2004

This paper examines the foundational crises that have haunted twentieth-century mathematics, beginning with a brief review of the effects generated by Gauss, Lobachevsky, and Bolyai who each developed non-Euclidean parallel axiom. Though of mathematical interest in their own right, the significance of the new geometries was greatly magnified when it was discerned that they could be used to adequately model physical space, even to the extent that Einstein’s theory of relativity later employed as its model a non-Euclidean geometry developed by Riemann. The question that obviously presented itself was how could any given geometry be called true when it and …


Recent Parallels Between The Philosophy Of Science And Mathematics, Joseph Spradley Jan 1977

Recent Parallels Between The Philosophy Of Science And Mathematics, Joseph Spradley

ACMS Journal 2004

Following World War I European philosophy of science formed an alliance with mathematics culminating in an attitude of certainty and autonomy that rejected all non empirical claims to truth and purported to make all science presupposition less. The rise and fall of logical positivism has been one of the major themes of of twentieth century thought and illustrates the danger of placing too much emphasis on science and mathematics as an ideal for all knowledge. The restriction of rational inquiry to the modes of scientific verification and the processes of mathematical logic was far too confining for the containment of …


Diagnosis Of Faults In Linear Tree Networks, Sharad C. Seth, K. L. Kodandapani Jan 1977

Diagnosis Of Faults In Linear Tree Networks, Sharad C. Seth, K. L. Kodandapani

School of Computing: Faculty Publications

The problem of fault detection and location in tree networks of two input EXCLUSIVE-OR (EOR) gates is considered. The fault model assumes that an EOR gate can change to any other function of its two inputs except the equivalence function. An efficient procedure for single fault location is presented. In the worst case the number of tests necessary to locate single faults is bounded by a linear function of the number of input variables. Constructive upper bounds are obtained for the number of tests to detect multiple faults. Optimality of these bounds is argued and extension of results to other …


Superconcentrators, Nicholas Pippenger Jan 1977

Superconcentrators, Nicholas Pippenger

All HMC Faculty Publications and Research

An $n$-superconcentrator is an acyclic directed graph with $n$ inputs and $n$ outputs for which, for every $r \leqq n$, every set of $r$ inputs, and every set of $r$ outputs, there exists an $r$-flow (a set of $r$ vertex-disjoint directed paths) from the given inputs to the given outputs. We show that there exist $n$-superconcentrators with $39n + O(\log n)$ (in fact, at most $40n$) edges, depth $O(\log n)$, and maximum degree (in-degree plus out-degree) 16.


A Computer Based Information System For The Study Of Multi-Component Populations In South Carolina, Louise Ramsey Andres Jan 1977

A Computer Based Information System For The Study Of Multi-Component Populations In South Carolina, Louise Ramsey Andres

MUSC Theses and Dissertations

The information system accepts data on multi-component populations in South Carolina, and produces distribution maps, histograms, tables and other summary displays. The initial application illustrated is to the population of insects in the family Tabanid in South Carolina. The system is a series of FORTRAN programs written for an IBM System 360 Model 40 under DOS.


Comparison Of Fast Direct Methods For Elliptic Problems, Elias N. Houstis, T. S. Papatheordorou Jan 1977

Comparison Of Fast Direct Methods For Elliptic Problems, Elias N. Houstis, T. S. Papatheordorou

Department of Computer Science Technical Reports

No abstract provided.


Data Base Concepts For System Analysis, Thomas I. M. Ho Jan 1977

Data Base Concepts For System Analysis, Thomas I. M. Ho

Department of Computer Science Technical Reports

No abstract provided.


Reliability Growth Apportionment, James K. Byers Jan 1977

Reliability Growth Apportionment, James K. Byers

Computer Science Faculty Research & Creative Works

A method is presented for apportioning reliability growth to the subsystems that make up a system in order to achieve the required reliability at least cost. Reliability growth apportionment is handled as an s-expected cost minimization problem subject to the constraint of meeting a system reliability requirement. The problem is formulated in terms of Duane's reliability growth model and is solved using geometric programming. The method can be useful in the early stages of system design to determine subsystem reliability growth that will allow a system reliability requirement to be met, and in the latter stages of system design when …


Multi-Dimensional Clustering For Data Base Organizations, J. H. Liou, S. B. Yao Dec 1976

Multi-Dimensional Clustering For Data Base Organizations, J. H. Liou, S. B. Yao

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of A Heuristic For Full Trie Minimization, Douglas E. Comer Dec 1976

Analysis Of A Heuristic For Full Trie Minimization, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.


Efficient Recursive Parsing, Christoph M. Hoffmann Dec 1976

Efficient Recursive Parsing, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


New Perspectives For Information Systems Education, Thomas I. M. Ho Nov 1976

New Perspectives For Information Systems Education, Thomas I. M. Ho

Department of Computer Science Technical Reports

No abstract provided.


Proving Protection Systems Safe, D. E. Denning, P. J. Denning, S. J. Garland, M. A. Harrison, W.L. Ruzzo Nov 1976

Proving Protection Systems Safe, D. E. Denning, P. J. Denning, S. J. Garland, M. A. Harrison, W.L. Ruzzo

Department of Computer Science Technical Reports

No abstract provided.


Real Time Generation Of Min Distance Strings, Peter J. Denning Nov 1976

Real Time Generation Of Min Distance Strings, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


Linear Queries In Statistical Data Bases, M. D. Swartz, D. E. Denning, P. J. Denning Nov 1976

Linear Queries In Statistical Data Bases, M. D. Swartz, D. E. Denning, P. J. Denning

Department of Computer Science Technical Reports

No abstract provided.


Ellpack--A Cooperative Effort For The Study Of Numerical Methods For Elliptic Partial Differential Equations, John R. Rice Oct 1976

Ellpack--A Cooperative Effort For The Study Of Numerical Methods For Elliptic Partial Differential Equations, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann Oct 1976

Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic codes of composite length are introduced.


Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis Oct 1976

Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis

Electrical Engineering and Computer Science - Technical Reports

This paper considers the mathematical principals of lattice theory oriented toward the theory of computation.


Evaluation Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, J. R. Rice Oct 1976

Evaluation Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, J. R. Rice

Department of Computer Science Technical Reports

No abstract provided.


The Terminal Process, Kevin E. Kolis, John B. Lohse, Peter Radtke, Robert Sedlemeyer, Ronald D. Bedford Oct 1976

The Terminal Process, Kevin E. Kolis, John B. Lohse, Peter Radtke, Robert Sedlemeyer, Ronald D. Bedford

Department of Computer Science Technical Reports

No abstract provided.


A Collocation Method For Fredholm Integral Equations Of The Second Kind, Elias N. Houstis, T. S. Papatheordorou Oct 1976

A Collocation Method For Fredholm Integral Equations Of The Second Kind, Elias N. Houstis, T. S. Papatheordorou

Department of Computer Science Technical Reports

No abstract provided.


Predicting The Number Of Bugs Expected In A Program Module, Linda M. Ottenstein, Victor B. Schneider, Maurice H. Halstead Oct 1976

Predicting The Number Of Bugs Expected In A Program Module, Linda M. Ottenstein, Victor B. Schneider, Maurice H. Halstead

Department of Computer Science Technical Reports

No abstract provided.


Terminal Talk - The Wofford Connection - September 1976, Wofford College Computer Center Sep 1976

Terminal Talk - The Wofford Connection - September 1976, Wofford College Computer Center

Terminal Talk

No abstract provided.


Some Data And Observation On Research Publication (A) Numerical Computation, (B) Programming Languages And Systems, John R. Rice Jul 1976

Some Data And Observation On Research Publication (A) Numerical Computation, (B) Programming Languages And Systems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Piecewise Cubic Hermite Interpolation At The Gaussian Points, Elias N. Houstis, T. S. Papatheodorou Jul 1976

Piecewise Cubic Hermite Interpolation At The Gaussian Points, Elias N. Houstis, T. S. Papatheodorou

Department of Computer Science Technical Reports

No abstract provided.


A Program To Count Operators And Operands For Ansi—Fortran Modules, Karl J. Ottenstein Jun 1976

A Program To Count Operators And Operands For Ansi—Fortran Modules, Karl J. Ottenstein

Department of Computer Science Technical Reports

No abstract provided.