Computer Sciences Commons^™

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 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 …

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 …

A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

We discuss an extension to the Woody Assembly Language [Cha94] which allows new instructions to be defined. The mechanism is similar to the C language's #define macros, allowing a name to be supplied for a piece of code which will be expanded in line. Provisions are made for writing new non-destructive branching instructions as well as instructions which are simply new names for commonly used bits of code.

A Generalized Expression Optimization Hook For C++ On High-Performance Architectures, David J. Edelsohn

Northeast Parallel Architecture Center

C++ has gained broad acceptance as an object-oriented evolutionary extension to the C language, but it severely constrains methods for operating on class objects by forcing all data manipulation through an interface which assumes that all basic operations can be implemented as they are written: as unary or binary operators. C++ allows great flexibility in the creation of complex data structures which can perform the same functionality as built-in types of many other languages, but unfortunately it does not allow an equivalent level of flexibility so that operators acting on those data types can achieve the same level of efficiency …

Is Oberon As Simple As Possible?, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

The design of the programming language Oberon was led by the quote by Albert Einstein: 'make it as simple as possible, but not simpler'. The objective of this paper is to analyze some design solutions and propose alternatives which could both simplify and strengthen the language without making it simpler than possible. The paper introduces one general concept, the module type, which can be used to represent records, modules, and eventually procedures. Type extension is redefined in terms of component nesting and incomplete designators. As a result, type extension supports multiple inheritance.

Visualizing Electrostatic Phenomena Using Mathematica, Eric Mayes

Journal of the Arkansas Academy of Science

A set of packages for visualizing electrostatic phenomena was developed using Mathematica as a programming language. These packages allow users to plot potential fields, equipotential lines, 2-D and 3-D vector fields in order to gain a visual understanding of electrostatic charges. They would be useful in accompanying undergraduate physics labs pertaining to electrostatics, as they would enable students to connect experiment with mathematics through open-ended visual exploration

A Semantic Framework For Understanding The Behavior Of Modules And Classes In Programming Languages, Mahesh Dodani, Benjamin Kok Siew Gan

Research Collection School Of Computing and Information Systems

Recent trends in programming language design and implementation are aimed at integrating the two most important constructs to combat complexity: modules and classes. Both constructs provide encapsulation, a cornerstone of reliable programming. These constructs differ in their approach to building hierarchies: modules define visibility of components while classes define visibility of functionality. How can modules and classes be effectively integrated within a simple programming language? This question captures the essence of developing semantics of these constructs to ensure that they interact in a meaningful way. This paper develops a formal denotational semantic framework for understanding the interaction between classes and …

Introducing Objects And Parallelism To An Imperative Programming Language, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

The problem of enhancing objects with parallelism has been in the focus of numerous research projects in the recent years, but a satisfactory and commonly accepted solution has not appeared yet. A major problematic point seems to be providing inheritance for parallel objects. The general objective of this paper is to contribute to a better understanding of the language design issues in the area of parallel object-oriented programming (OOP) and, in particular, to design a framework for parallel OOP with multiple inheritance. What makes our proposed framework different from the other parallel OOP languages is its easy to use and …

Study Of The Five-Charged-Pion Decay Of The Τ Lepton, D. Gibaut, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The branching fractions for the five-charged-particle decays of the τ lepton have been measured in e+e− annihilations using the CLEO II detector at the Cornell Electron Storage Ring. Assuming all charged particles to be pions, the results are B(3π−2π+≥0 neutrals ντ)=(0.097±0.005±0.011)%, B(3π−2π+ντ)=(0.077±0.005 ±0.009)%, B(3π−2π+π0ντ)=(0.019±0.004±0.004)%, and B(3π−2π+2π0ντ)B(3π−2π−π0ντ) is measured for the first time by exclusive π0 reconstruction. The results are compared with the predictions from the partially conserved-axial-current and conserved-vector-current hypotheses assuming isospin invariance.

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 …

A Model For Syntactic Control Of Interference, Peter W. O'Hearn

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Two imperative programming language phrases interfere when one writes to a storage variable that the other reads from or writes to. Reynolds has described an elegant linguistic approach to controlling interference in which a refinement of typed λ-calculus is used to limit sharing of storage variables; in particular, different identifiers are required never to interfere. This paper examines semantic foundations of the approach. We describe a category that has (an abstraction of) interference information built into all objects and maps. This information is used to define a “tensor” product whose components are required never to interfere. Environments are defined using …

A Methodology For Developing High Performance Computing Models: Storm-Scale Weather Prediction, Nikos Chrisochoides, Kelvin Droegemeier, Geoffrey C. Fox, Kim Mills, Ming Xue

Northeast Parallel Architecture Center

A methodology for developing future generations of a storm-scale weather prediction model for Massively Parallel Processing is described. The forecast model is the Advanced Regional Prediction System (ARPS), a three-dimensional, fully compressible, non-hydrostatic predictive model. In the short term, the computational goals include developing a portable, scalable model for distributed memory SIMD and MIMD architectures, while preserving a high degree of modularity to support rapid design and validation, maintainability, educational goals and operational testing. Longer term computational goals include a parallel adaptive mesh refinement scheme. A FortranD/High Performance Fortran version of the ARPS provides portability in the current version of …

Tau Decays With One Charged Particle Plus Multiple Π0'S, M. Procario, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

With the CLEO-II detector at the Cornell Electron Storage Ring, we have measured branching fractions for tau lepton decay into one-prong final states with multiple π0’s B0hnπ, normalized to the branching fraction for tau decay into one charged particle and a single π0. We find B0h2π/B0hπ=0.345±0.006±0.016, B0h3π/B0hπ=0.041 ±0.003±0.005, and B0h4π/B0hπ=0.006±0.002±0.002.

Intel Nx To Pvm 3.2 Message Passing Conversion Library, Trey Arthur, Michael L. Nelson

Computer Science Faculty Publications

NASA Langley Research Center has developed a library that allows Intel NX message passing codes to be executed under the more popular and widely supported Parallel Virtual Machine (PVM) message passing library. PVM was developed at Oak Ridge National Labs and has become the defacto standard for message passing. This library will allow the many programs that were developed on the Intel iPSC/860 or Intel Paragon in a Single Program Multiple Data (SPMD) design to be ported to the numerous architectures that PVM (version 3.2) supports. Also, the library adds global operations capability to PVM. A familiarity with Intel NX …

An Intelligent Real-Time System Architecture Implemented In Ada, Michael A. Whelan

Theses and Dissertations

Conventional real-time systems are fully deterministic allowing for off-line, optimal, task scheduling under all circumstances. Real-time intelligent systems add non-deterministic task execution times and non- deterministic task sets for scheduling purposes. Non-deterministic task sets force intelligent real-time systems to trade-off execution time with solution quality during run-time and perform dynamic task scheduling. Four basic design considerations addressing those tradeoffs have been identified: control reasoning, focus of attention, parallelism, and algorithm efficacy. Non-real- time intelligent systems contain an environment sensor, a model of the environment, a reasoning process, and a large collection of procedural processes. Real-time intelligent systems add to these …

A Generic Template Extractor (Gentex) In C For Vlsi Design Verification, Kenneth J. Mcclellan Jr.

Theses and Dissertations

The problem of VLSI design verification through circuit extraction was analyzed. The problems of creating a simple template format, the permutability of pins, maintaining connectivity, and performance were focused on. A generic template extractor (GENTEX) was developed in the C programming language for use as a testbed to find solutions to these problems. Six different extraction algorithms were tested with GENTEX and compared based on performance. EDIF translation programs were used to interface with GENTEX on both the input and output sides. One translation program converted an EDIF representation of a schematic into the template format used by GENTEX. The …

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. …

Applying Metrics To Rule-Based Systems, Paul Doyle, Renaat Verbruggen

Other

Since the introduction of software measurement theory in the early seventies it has been accepted that in order to control software it must first be measured. Unambiguous and reproducible measurements are considered to be the most useful in controlling software productivity, costs and quality, and diverse sets of measurements are required to cover all aspects of software. This paper focuses on measures for rule-based language systems and also describes a process for developing measures for other non-standard 3GL development tools. This paper uses KEL as an example and the method allows the re-use of existing measures and indicates if and …

Flattening C++ Classes, Umesh Bellur, Al Villarica, Kevin Shank, Imram Bashir, Doug Lea

Center for Advanced Systems and Engineering

Inheritance with derived classes and virtual functions are key design concepts in C++. Despite this, their use can result in significant degradation of run time performance. We present a class flattening tool, which we believe will help eliminate the overhead associated with virtual functions in C++ programs. A flattener may also prove useful in the reuse, debugging, and understanding of C++ components. This report deals with the issues associated with flattening, and then presents a detailed design of such a tool.

Which Applications Can Use High Performance Fortran And Fortran-D: Industry Standard Data Parallel Languages?, Alok Choudhary, Geoffrey C. Fox, Tomasz Haupt, S. Ranka

Northeast Parallel Architecture Center

In this paper, we present the first, preliminary results of HPF/Fortran-D language analysis based on compiling and running benchmark applications using a prototype implementation of HPF/Fortran-D compiler. The analysis indicate that the HPF is a very convenient tool for programming many applications on massively parallel and/or distributed systems. In addition, we cumulate experience on how to parallelize irregular problems to extend the scope of Fortran-D beyond HPF and suggest future extensions to the Fortran standard.

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.

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.

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 …

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. …

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 …

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.