Index Catalog // ScholarsArchive@OSU

A study of the resection problem in surveying

Creator:: Rogers, James
Abstract:: Three special cases of the resection problem of surveying are examined and solved. The coordinates of unknown points are found with respect to given points in a rectangular coordinate system. This is accomplished in the case of (a) one unknown point and three given points (Snell's problem), (b) two unknown...
Resource Type:: Masters Thesis
Full Text:: points (Snell's problem), (b) two unknown points and two given points (Hansen's problem), and (c) three

A study of the effect of the choice of pivot elements on round-off errors in Gauss elimination

Creator:: Gunn, Michael Gary
Abstract:: It is established folklore in numerical analysis, for solution of a square system of linear equations by Gauss elimination, that the standard method of choice of pivot elements is to search the entire suppressed matrix for the element largest in absolute value. However, it was felt by the author, that...
Resource Type:: Masters Thesis
Full Text:: for privacy Abstract approved: Dr1 Harry Goheen It is established folklore in numerical analysis

Computation by a Turing machine carried out in a Minsky post tag formalism

Creator:: Henry, Calvin Oscar Leon
Abstract:: This thesis documents a method of proving that Turing machines work for every case, if the construction of the Turing machine is known. Mathematical Induction is used to construct the proof that the Turing machine for binary addition will work in every well-formed case of the input that it receives....
Resource Type:: Masters Thesis
Full Text:: privacy #(Profe or Harry Goheen) This thesis documents a method of proving that Turing machines work

Circuit algebras and some of their properties

Creator:: Driessel, Kenneth Richard
Abstract:: It is well known that two-terminal switching circuits may be represented by boolean formulas. Thus the study of certain switching circuit problems leads to the study of free boolean algebras, in particular to the free boolean algebra on a countably infinite set of generators. An abstract characterization of this algebra...
Resource Type:: Masters Thesis
Full Text:: consequence, n*l = {0, l, Z,' ' ' ,nl for any neN. If A and B are any set, then BA will denote the set of all

Machine algorithms for Boolean matrices

Creator:: Comstock, Dale R.
Resource Type:: Masters Thesis
Full Text:: formulate machine algorithms for answering the question: Is network A equivalent to network B ? That is

Algorithms for the solution of two algebraic equations in two unknowns

Creator:: Holroyd, John Ries
Abstract:: The author develops a new recursive procedure for the evaluation of Sylvester's eliminant. The algorithm is written in the ALGOL 60 language.
Resource Type:: Masters Thesis
Full Text:: ) = n i=0 g(x,y) = s a.(y)x1=0 bi (y)xl= 0 i=0 where ai(y) and b. (y) are polynomials in y

On triangulations of fixed points in the plane

Creator:: Weingarten, Frederick Wesley
Abstract:: A theory of straight line triangulations of points in the plane is developed. A basic transformation is presented, and it is shown that any triangulation may be transformed into any other triangulation which has the same boundary by a finite sequence of the basic transformations. The proof of the transformation...
Resource Type:: Dissertation
Full Text:: FILLIN 43 (b) Storage Schematic for Star(8) 43 III-1 1 (a) Triangles after T-Transform on (1,7) 45 (b

Some computational schemes equivalent to Turing machines

Creator:: Anderson, Sandra Elaine
Abstract:: Computational scheme, equivalence, and Turing machine are defined. Some computational schemes are examined and shown to be equivalent to the computational scheme of a Turing machine.
Resource Type:: Masters Thesis
Full Text:: like to thank Dr. Harry Goheen for his assist- ance in the preparation of this paper. TABLE OF

A proof of the consistency of geometry

Creator:: Jacobs, Michael Jay
Resource Type:: Masters Thesis
Full Text:: are real con- stants and x, y and z are real variables and A B C rank 1 1 = 2. 2 B2 C2

Algebraic methods of analysis and synthesis of contact networks

Creator:: Rashid, Mohammad
Abstract:: The purpose of this paper is to discuss some of the theory of Boolean matrices and apply this theory to construct contact networks by using algebraic methods. The first section of this paper (Chapter I to III) describes Boolean algebra and its properties, the theory of Boolean matrices, and the...
Resource Type:: Capstone Project
Full Text:: wishes to express his sincere gratitude to .Dr. Harry Goheen for his advise and encouragement in this

ScholarsArchive@OSU

A study of the resection problem in surveying

A study of the effect of the choice of pivot elements on round-off errors in Gauss elimination

Computation by a Turing machine carried out in a Minsky post tag formalism

Circuit algebras and some of their properties

Machine algorithms for Boolean matrices

Algorithms for the solution of two algebraic equations in two unknowns

On triangulations of fixed points in the plane

Some computational schemes equivalent to Turing machines

A proof of the consistency of geometry

Algebraic methods of analysis and synthesis of contact networks

Limit your search

Academic Affiliation

Advisor

Commencement Year

Committee Member

Creator

Date

Decade

Degree Field

Degree Level

Degree Name

Language

Non-Academic Affiliation

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

Limit your search