Physical Sciences and Mathematics Commons^™

Mpj: A Proposed Java Message Passing Api And Environment For High Performance Computing, Mark Baker, Bryan Carpenter

Northeast Parallel Architecture Center

In this paper we sketch out a proposed reference implementation for message passing in Java (MPJ), an MPI-like API from the Message-Passing Working Group of the Java Grande Forum [1,2]. The proposal relies heavily on RMI and Jini for finding computational resources, creating slave processes, and handling failures. User-level communication is implemented efficiently directly on top of Java sockets.

An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa

Electrical Engineering and Computer Science - All Scholarship

The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …

Decision Problems Resulting From Grammatical Inference, Sandor Horvath, Efim Kinber, Arto Salomaa, Sheng Yu

School of Computer Science & Engineering Faculty Publications

Grammatical inference is one of the classical areas of language theory.

Lazy Evaluation And Nondeterminism Make Backus' Fp-Systems More Practical, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Backus' FP-systems are made more practical by introducing into them lazy evaluation and nondeterminism. This is done in the framework of a concrete programming language called FP*. From the one hand, this language is almost as mathematical as FP-systems are. From the other hand, it gives the possibility to manage secondary memory and to develop such applications as, for instance, interactive and distributed file systems. Experimental versions of a compiler and an interpreter for the FP* language are implemented.

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

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 …

Specification Of Synchronizing Processes, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

The formalism of temporal logic has been suggested to be an appropriate tool for expressing the semantics of concurrent programs. This paper is concerned with the application of temporal logic to the specification of factors affecting the synchronization of concurrent processes. Towards this end, we first introduce a model for synchronization and axiomatize its behavior. SYSL, a very high-level language for specifying synchronization properties, is then described. It is designed using the primitives of temporal logic and features constructs to express properties that affect synchronization in a fairly natural and modular fashion. Since the statements in the language have intuitive …

Data Flow Program Graphs, Alan L. Davis, Robert M. Keller

All HMC Faculty Publications and Research

Data flow languages form a subclass of the languages which are based primarily upon function application (i.e., applicative languages). By data flow language we mean any applicative language based entirely upon the notion of data flowing from one function entity to another or any language that directly supports such flowing. This flow concept gives data flow languages the advantage of allowing program definitions to be represented exclusively by graphs. Graphical representations and their applications are the subject of this article.

Specifying And Proving Properties Of Sentinels, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

This paper presents a technique for specifying and verifying properties of "sentinels," a high-level language construct for synchronizing access to shared resources. Statements in the specification language possess formal temporal semantics. As a prelude to proving the correctness of sentinels, the semantics of constructs used in sentinels is given. The proof technique involves showing that the temporal behavior of a sentinel conforms to that defined by the specification. The methodology is illustrated by applying it to a typical synchronization problem.

On Some Dependencies Between Functional Forms In Functional Programming Systems, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

In the present paper, some dependencies between functional forms in functional programming systems are demonstrated. It is shown that any functional form can be expressed by using only the forms composition, condition and construction.

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

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

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 …

Paul Feyerabend, Against Method (Typoscript 1969), Rudolf Kaehr

Rudolf Kaehr

Facsimile of Paul Feyerabend's AGAINST METHOD Original typoscript of Against Methods from 1968 with handwritten corrections. Last sentence, p. 116: "We must take care that it does not lose its ability to make such a choice."

Paul Feyerabend's Telegram, Rudolf Kaehr

Rudolf Kaehr

6-page telegram from Paul Feyerabend (London) to Rolf Kaehr (Westberlin) Telegram 1 I am ill. Please let the seminar continue in my absence. Inform Prof Landmann and Prof Huebner, cancel the hotel reservation and read the following final message to my class on tuesday 1pm: I am sorry that I cannot give what Telegram 2 would have been my last lecture to you. In this lecture I would have elaborated on Verons argument and would have tried to show that it also excludes consience, self expression, identification. Turning back to the empiricist methodology and demand for theoretical unification I would …