Computer Sciences Commons^™

Electronic Branching Ratio Of The Lepton, R. Ammar, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using data accumulated by the CLEO I detector operating at the Cornell Electron Storage Ring, we have measured the ratio R=Γ(τ→eν¯eντ)Γ1 where Γ1 is the τ decay rate to final states with one charged particle. We find R=0.2231±0.0044±0.0073 where the first error is statistical and the second is systematic. Together with the measured topological one-charged-particle branching fraction, this yields the branching fraction of the τ lepton to electrons, Be=0.192±0.004±0.006.

Isospin Mass Splittings From Precision Measurements Of D*-D Mass Differences, D. Bortoletto, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using the decay modes, D*+→D+π0 and D*0→D0π0, we have measured the D*+−D+ and D*0−D0 mass differences to be 140±0.08±0.06 and 142.12±0.05±0.05 MeV, respectively. Combining these measurements with the Particle Data Group average for the D*+−D0 mass difference, we obtain isospin mass splittings for D*+−Dusp*0 and D+−D0 of 3.32±0.08±0.05 and 4.80±0.10 ±0.06 MeV. We discuss the implications of these measurements for models of isospin mass differences and model-dependent estimates of fD.

Logic Programming In Digital Circuit Design, Joseph W. Eicher

Theses and Dissertations

The design of large, complex digital circuitry requires highly skilled engineers. Much of the time spent by these engineers in the design phase involves tasks that are repetitive, tedious, and slow. If these repetitive tasks are automated, the engineer can spend more time managing the design process and produce a better-quality design in less time. Logic programming can be used to automate design tasks, even those that require a high degree of skill. This thesis investigates several aspects of the digital circuit design process that involve pattern-matching paradigms suitable for encoding in the logic programming language Prolog.

Simulator For Concurrent Processing Data Flow Architectures, Mahyar R. Malekpour

Electrical & Computer Engineering Theses & Dissertations

A software simulator capable of simulating execution of an algorithm graph on a given system under the Algorithm To Architecture Mapping Model (ATAMM) rules is presented in this thesis. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented in this thesis is capable of determining the behavior, performance, and reliability of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of …

Inclusive Production Of The Charmed Baryon C+ From E+E- Annihilations At S=10.55 Gev, P. Avery, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results on inclusive production of the charmed baryon Λc+ from e+e− annihilations at √s=10.5 GeV. Measurements are presented of the inclusive cross section times branching fraction for the continuum production of Λc+ as observed in six different decay modes, and of a new, improved value of the Λc+ mass. The inclusive cross section times the branching fraction into pK−π+ is measured to be 10.0±1.5±1.5 pb summed over all xp. The branching fractions of Λc+ into p¯K0, p¯K0π+π−, Λπ+, Λπ+π−π+, and Ξ−K+π+ relative to that into pK−π+ are measured to be 0.44±0.07±0.05, 0.43±0.12±0.04, 0.18±0.03±0.03, 0.65±0.11±0.12, and 0.15±0.04±0.03, respectively. The …

Automatic Determination Of Recommended Test Combinations For Ada Compilers, James S. Marr

Theses and Dissertations

Ada compilers are validated using the Ada Compiler Validation Capability (ACVC) test suit, containing over 4000 individual test programs. Each test program focuses, to the extent possible, on a single language feature. Despite the advantages of this atomic testing methodology, it is often the unexpected interactions between language features that result in compilation problems. This research investigated techniques to automatically identify recommended combinations of Ada language features for compiler testing. A prototype program was developed to analyze the Ada language grammar specification and generate a list of recommended of features to be tested. The output from this program will be …

An Object Oriented Design And Implementation Of The Idef0 Essential Data Model Using Ada And An Ada Based Expert System, Terry L. Kitchen

Theses and Dissertations

This thesis develops and implements an Ada based object oriented design (OOD) of the IDEF₀ Essential Data Model called the Essential Subsystem, which includes an Ada based expert system for IDEF₀ model syntax checking. IDEF₀ is a graphic approach to system description development by SofTech, Inc. for the U.S. Air Force Program for Integrated Computer Aided Manufacturing (ICAM) and is a subset of the Structured Analysis (SA) language (30, 36). The IDEF₀ Essential Data Model is an entity-relationship (E-R) model of the IDEF₀ language and represents the fundamental (essential) information of an IDEF₀ model. …

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 …

Exclusive And Inclusive Decays Of B Mesons Into Ds Mesons, D. Bortoletto, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We have studied the production of Ds mesons in the decays of B mesons at the Υ(4S) resonance. We report on the first observation of exclusive B-meson decays B->Ds−D*+, B→Ds−D+, and B→Ds−D0. We also present a new measurement of the branching ratio and the momentum spectrum for the inclusive decay B→DsX.

Automatically Generating Functional Tests From Specifications - A Knowledge Based Constraint Logical Programming Approach, Ji Chen

Computer Science Theses & Dissertations

Recent experimental results indicate that functional testing is one of the most effective methods in detecting certain classes of faults. Very little work has been done in automating functional testing. This thesis research develops a method, called hierarchical partition, for automating functional testing. The key to our approach is the utilization of a pre-existing knowledge base about the domain of discourse. Several approaches to knowledge organiza­tion are discussed along with the resulting effects on the quantity and quality of functional tests produced. This research is an application and development of Generic Constraint Logic Programming and the Knowledge Driven …

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 …

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.

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 …

Interfacing The Sdk-85 With Common Laboratory Equipment, Thomas A. Boerjan

Graduate Research Papers

The-SDK-85 is a low-cost microcomputer trainer well-suited for entry and intermediate level programming and also interfacing. From it the fundamentals of digital electronics and computer programming can be taught at the high school and college level. The objectives of this paper are to learn:

1. The basic hardware required for a simple computer trainer.

2. The software necessary to do simple tasks.

3. How to interface the SDK-85 to common laboratory equipment.

4. How industry is using digital electronics.

5. Basic hardware and software troubleshooting • techniques.

6. Instructional methodology to be used with the SDK-85.

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 …