Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

Discipline
Institution
Keyword
Publication Year
Publication
File Type

Articles 241 - 251 of 251

Full-Text Articles in Programming Languages and Compilers

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Z Perspective, Kathleen M. Wabiszewski Dec 1994

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Z Perspective, Kathleen M. Wabiszewski

Theses and Dissertations

This research established a foundation for formalizing the evolution of based object models to theories, part of a dual approach for formally extending object-oriented analysis models using the Z and LARCH languages. For the initial phase, a comprehensive, consistent, and correct Z language parser was implemented within the SOFTWARE REFINERY™ Programming Environment. The Z parser produced abstract syntax trees (ASTs) of objects, thereby forming the basis for analyzing the similarities and differences between the based and LARCH-based object representations. The second phase used the analysis of the two languages to identify fundamental core constructs that consisted of similar syntactic and …


Designing And Implementing An Ada Language Binding Specification For Odmg-93, Stephen R. Lindsay Dec 1994

Designing And Implementing An Ada Language Binding Specification For Odmg-93, Stephen R. Lindsay

Theses and Dissertations

Object-oriented database management systems (ODBMSs) represent the latest advancement in database technology, combining the reusability and maintainability of the object-oriented programming paradigm with the ability to efficiently store and retrieve a wide range of data types as well as code to manipulate stored data. Unfortunately, programmers developing software in the Ada programming language do not have the ability to interface to object databases without significant customized code development. One important reason for this has been the absence of a standard defining the constructs accessing ODBMS functionality. This thesis documents the creation of an Ada language binding to the ODMG-93 standard …


Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Larch Perspective, Catherine J. Lin Dec 1994

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Larch Perspective, Catherine J. Lin

Theses and Dissertations

This research describes the feasibility of developing object-oriented LARCH specifications, part of a dual approach for formally extending object-oriented analysis models using LARCH and Z. The first phase consisted of two steps establishing a set of transformation heuristics for algebraically representing object models and implementing a robust LARCH parser. The LARCH parser produced abstract syntax trees ASTs of objects forming the basis for analyzing the similarities and differences between Z-based and LARCH-based object representations. The second phase used the analysis of LARCH and Z to identify fundamental core constructs in the languages and abstract syntax trees. These core constructs consisted …


Solving The Ranking And Selection Indifference-Zone Formulation For Normal Distributions Using Computer Software, Catherine A. Poston Dec 1993

Solving The Ranking And Selection Indifference-Zone Formulation For Normal Distributions Using Computer Software, Catherine A. Poston

Theses and Dissertations

Ranking and selection procedures are statistical methods used to compare and choose the best among a group of similar statistically distributed populations. The two predominant approaches to solving ranking and selection problems are Guptas subset selection formulation and Bechhofers indifference- zone formulation. For the indifference-zone formulation where the populations have equal sample sizes, Barr and Rizvi developed an integral expression of the probability of correct selection PCS. Given appropriate parameters, the integral expression can be solved to determine the common sample size required to attain a desired PCS. Tables with selected solutions to the integral expression are available for a …


Compiling Ace For Distributed-Memory Machines, Jun Song Nov 1992

Compiling Ace For Distributed-Memory Machines, Jun Song

Dissertations and Theses

Distributed-memory machines offer a very high level of performance, flexibility and scalability. But the memory organization of this kind of machine determines that processes on different processors must communicate explicitly by sending and receiving messages. As a result, the programmer faces the enormously difficult task of detailed planning of algorithm-irrelevant, low-level communication issues. This level of programming resembles writing assembly programs for a sequential machine.

ACE is a message-passing language with abstract communication statements. It was defined by Dr. Jingke Li at Portland State University. The communication in ACE is still explicit, but it is abstracted to a higher level. …


Linda Implementations Using Monitors And Message Passing, Alan L. Leveton Jan 1990

Linda Implementations Using Monitors And Message Passing, Alan L. Leveton

UNF Graduate Theses and Dissertations

Linda is a new parallel programming language that is built around an interprocess communication model called generative communication that differs from previous models in specifying that shared data be added in tuple form to an environment called tuple space, where a tuple exists independently until some process chooses to use it. Interesting properties arise from the model, including space and time uncoupling as well as structured naming. We delineate the essential Linda operations, then discuss the properties of generative communication. We are particularly concerned with implementing Linda on top of two traditional parallel programming paradigms - process communication through globally …


Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison May 1986

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)


Predicting Success In High School Computer Programming, John C. Gevedon Jul 1985

Predicting Success In High School Computer Programming, John C. Gevedon

Graduate Theses and Dissertations

There are great differences in performance among students taking high school programming courses, and instructors debate over what elements contribute to these differences. Some students develop logical thinking abilities and problem solving techniques, while others fail to develop skills beyond memorization of specific terms and procedures. It is not known whether these differences are causally related to the specific educational environment or student backgrounds. Without more information, the factors that actually contribute to the success of high school students in computer programming courses cannot be accurately determined. It was the purpose of this study then to isolate certain student characteristics …


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 Dec 1980

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 …


Determiningeons : A Computer Program For Approximating Lie Generators Admitted By Dynamical Systems, Gregory G. Nagao Jan 1980

Determiningeons : A Computer Program For Approximating Lie Generators Admitted By Dynamical Systems, Gregory G. Nagao

University of the Pacific Theses and Dissertations

As was recognized by same of the most reputable physicists of the world such as Galilee and Einstein, the basic laws of physics must inevitably be founded upon invariance principles. Galilean and special relativity stand as historical landmarks that emphasize this message. It's no wonder that the great developments of modern physics (such as those in elementary particle physics) have been keyed upon this concept.

The modern formulation of classical mechanics (see Abraham and Marsden [1]) is based upon "qualitative" or geometric analysis. This is primarily due to the works of Poincare. Poincare showed the value of such geometric analysis …


Computer Programming, Gary Rice Jan 1970

Computer Programming, Gary Rice

Honors Theses

The chief advantage of the digital computer is that it can be instructed to perform complex or repetitive arithmetical operations in a very short period of time. Any sequence of operations which can be fully analyzed can theoretically be done by a computer. The method of instruction takes the form of various precisely defined computer languages. The programs to be discussed here were written in a Fortran language, Fortran being a contraction of Formula Translation. There are at least four variations of Fortran, but the differences are relatively minor. Fortran is basically intended for scientific and engineering purposes. The programs …