Digital Commons Network^™

A Universal Method Of Scientific Inquiry, Daniel N. Osherson, Michael Stob, Scott Weinstein

University Faculty Publications and Creative Works

A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of “successful scientific inquiry” is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.

A Case For The Use Of Application Generators In The Creation Of Software For The Hotel Industry, Peter O'Connor, Ciaran Mcdonnell

Conference papers

The article makes the case for the use of Program Generators in producing software for the Hotel and Catering Industry

Software Support For Irregular And Loosely Synchronous Problems, Alok Choudhary, Geoffrey C. Fox, Sanja Ranka, Seema Hiranandani

Northeast Parallel Architecture Center

A large class of scientific and engineering applications may be classified as irregular and loosely synchronous from the perspective of parallel processing. We present a partial classification of such problems. This classification has motivated us to enhance Fortran D to provide language support for irregular, loosely synchronous problems. We present techniques for parallelization of such problems in the context of Fortran D.

Scheduling Regular And Irregular Communication Patterns On The Cm-5, Ravi Ponnusamy, Rajeev Thakur, Alok Choudhary, Geoffrey C. Fox

Northeast Parallel Architecture Center

In this paper, we study the communication characteristics of the CM-5 and the performance effects of scheduling regular and irregular communication patterns on the CM-5. We consider the scheduling of regular communication patterns such as complete exchange and broadcast. We have implemented four algorithms for complete exchange and studied their performances on a 2D FFT algorithm. We have also implemented four algorithms for scheduling irregular communication patterns and studied their performance on the communication patterns of several synthetic as well as real problems such as the conjugate gradient solver and the Euler solver.

Compiling Distribution Directives In A Fortran 90d Compiler, Zeki Bozkus, Alok Choudhary, Geoffrey C. Fox, Sanjay Ranka

Northeast Parallel Architecture Center

Data Partitioning and mapping is one of the most important steps of in writing a parallel program; especially data parallel one. Recently, Fortran D, and subsequently, High Performance Fortran (HPF) have been proposed to allow users to specify data distributions and alignments for arrays in programs. This paper presents the design of a Fortran 90D compiler that takes a Fortran 90D program as input and produces a node program + message passing calls for distributed memory machines. Specifically, we present the design of the Data Partitioning Module that processes the alignment and distribution directives and illustrate what are the important …

The A.D.E. Taxonomy Of Spreadsheet Application Development, Maria Jean Hall

Theses: Doctorates and Masters

Spreadsheets are a major application in end-user computing, one of the fastest growing areas of computing. Studies have shown that 30% of spreadsheet applications contain errors. As major decisions are often made with the assistance of spreadsheets, the control of spreadsheet applications is a matter of concern to enduser developers, managers, EDP auditors and computer professionals.

The application of appropriate controls to the spreadsheet development process requires prior categorisation of the spreadsheet application. The special-purpose A.D.E. (Application, Development, Environment) taxonomy of spreadsheet application development was evolved by mathematical taxonomic methods to categorise spreadsheet development projects to facilitate their management and …

Instructional Use Of Computers For Entry-Level Physical Therapy Education In The United States, Edmund M. Kosmahl

CCAC Theses and Dissertations

Little was known about the value of computer assisted instruction (CAl) for entry-level physical therapy (PT) education. Factors that affect implementation and use of CAl in entry-level PT education had not been identified. Because of this paucity of information, decision-making about the implementation and use of CAl in entry-level PT education had been hampered.

This study used mail questionnaire survey methods to find:

1. The extent of use of computer-assisted instruction (CAl) in entry-level physical therapy (PT) education.
2. The perceived value of CAl compared to more traditional instructional methods for entry-level PT education.
3. What factors affect implementation and use of CAl …

Query Optimization In Oodb, Hwee Hwa Pang, Hongjun Lu, Beng Chin Ooi

Research Collection School Of Computing and Information Systems

In object-oriented databases, relationships are generally maintained explicitly. The partial result of a retrieved object can be used to efficiently retrieve related objects. Instead of optimizing joins as in relational database systems, pointer chasing is optimized in object-oriented database systems. Further, semantics inherent in the object-oriented database, like superclass-subclass relationships and composite-component relationships between object classes, must be realised. In this paper, we describe our initial result in query optimization in an object-oriented database system. Semantic query transformation is used to preprocess the query. semantically optimized query is then translated into a query evaluation plan which comprises method invocations that …

System Design Quality And Efficiency Of System Analysts: An Automated Case Tool Versus A Manual Method, Satomi H. Sugishita

UNF Graduate Theses and Dissertations

The purpose of the current research study is to find out if CASE tools help to increase the software design quality and efficiency of system analysts and designers when they modify a system design document. Results of the experimental data analysis show that only the experience level of subjects had an effect on quality of their work. Results indicated that the design methods, either CASE tools or manual, do not have a significant effect on quality of the modification task nor the efficiency of system analysts and designers.

The Complexity Of Software Testing, J. Paul Myers Jr.

Computer Science Faculty Research

The futility of using a general-purpose metric to characterise 'the' complexity of a program has been argued to support the design of specific metrics for the different stages of the software life-cycle. An analysis of the module testing activity is performed, providing evidence of the absurdity of all-purpose metrics, as well as a methodical means with which to measure testing complexity. Several standard metrics are seen to serve as component measures for the intricacies of testing. The methodology is applied to compare traditional and adaptive means of testing. It is shown that previous informal arguments asserting the superiority of adaptive …

An Investigation Of Ibm Pc Computer Viruses Infection Rates And Types In A Western Australian Environment, Boon Guan Lee

Theses : Honours

In recent years computer viruses have become increasingly significant as a form of computer abuse. By virtue of their reproductive capability, computer viruses can have cumulative and potentially catastrophic effects to the many people who use those affected computers. There is a growing concern in the computing community about these forms of electronic vandalism. This concern arises from the possible damage to stored information on which the work depends and the ensuing disruption of the work-place. Although the vandalism or purposeful abuse by introducing computer viruses to computer systems was originally mainly an American experience, research reports published by the …

Porting Chorus To The Pa-Risc: Building, Debugging, Testing And Validation, Ravi Konuru, Marion Hakanson, Jon Inouye, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This document is part of a series of reports describing the design decisions made in porting the Chorus Operating System to the Hewlett-Packard 9000 Series 800 workstation. This document describes the environment for building the Chorus kernel, the various kernel tests, and the debugging environment used for porting the Chorus operating system to the HP PA-RISC.

The information contained in this paper will be of interest to people who wish to:

• Use the PA-Chorus kernel for development and/or modification, • Know about the build environment for Chorus kernel on PA-RISC, • Know about the PA-Chorus approach to debugging, • …

Program Maintenance And Code Reuse: Object Oriented Versus Procedure Oriented Programming, Beiramali Moradi

Theses

The purpose of this thesis is to address the problem of the increasing cost of program maintenance in the data processing world. On average, programmers today spend 60% of their time in program maintenance and that figure is increasing at an estimated rate of 1 % each year. The cost is staggering and almost every business would like to find ways of reducing maintenance costs. One way to help reduce maintenance and development costs is to improve code reusability. Both maintenance programming and code reusability are the focus of this thesis.

Today's most commonly used programming language style is procedure …

Porting Chorus To The Pa-Risc: Project Overview, Jonathan Walpole, Marion Hakanson, Jon Inouye, Ravi Konuru

Computer Science Faculty Publications and Presentations

This document is part of a series of reports describing the design decisions made in porting the Chorus Operating System to the Hewlett-Packard 9000 Series 800 workstation. This document presents an overview of the project, and outlines the other reports in the series and the relationships between them.

Experimentation With Proof Methods For Non-Horn Sets, Christopher J. Merz, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

Two Resolution Proof Strategies Developed by Peterson Are Implemented by Modifying Otter, an Existing Automated Theorem Prover. the Methods, Lock-T Refutation and LNL-T Refutation, Are Generalizations of Unit Refutation and Input Resolution, Respectively, to Non-Horn Sets and Represent Independent, Equivalent but Opposite Ways of Searching. the Algorithms Used Are based on a Corrected Version of the Foundational Work. the Strategies Have Been Tested on Various Non-Horn Challenge Problems from the Tarskian Geometry and the Non-Obvious Problem, with the Results Being in Some Cases Quite Favorable When Compared to Other Resolution Techniques.

Composite Stock Cutting Through Simulated Annealing, Hanan Lutfiyya, Bruce M. Mcmillin, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Faculty Research & Creative Works

This paper explores the use of Simulated Annealing as an optimization technique for the problem of Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters and performance. © 1992.

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.

Measurement Of The Tau Lepton Electronic Branching Fraction, D. Akerib, M. Thulasidas

Research Collection School Of Computing and Information Systems

The tau lepton electron branching fraction has been measured with the CLEO II detector at the Cornell Electron Storage Ring as Be=0.1749±0.0014±0.0022, with the first error statistical and the second systematic. The measurement involves counting electron-positron annihilation events in which both taus decay to electrons, and normalizing to the number of tau-pair decays expected from the measured luminosity. Detected photons in these events constitute a definitive observation of tau decay radiation.

Measurement Of Τ Decays Involving Η Mesons, M. Artuso, M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Three Letters On Computer Security And Society, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

A Synthesis Technique Of General Petri Nets For Flexible Manufacturing And Multi-Rate Digital Signal Processing, Murthy S. Valluri

Theses

General Petri nets are useful for modeling flexible manufacturing system with multiple robots and workstations [KOH 90] and for multi-rate digital signal processing systems [CHA 91].. A problem of using Petri nets for modeling various systems is the large number of states generated. Various synthesis approaches have been proposed. Most of them do not deal with general Petri nets. Koh et. al. [KOH 90] invented a synthesis technique for generalized Petri nets. The purpose of this thesis is to extend their work by modifying the knitting technique by adding the Arc-Ratio rule.

Representation Of Graphical Deep Knowledge In An Object-Oriented Database System, Prasanna S. Venkatesh

Theses

Object-oriented approaches to the design of complex graphical interfaces have received an enormous impetus in the database and knowledge representation disciplines. As traditional CAD systems store information about all the objects for display purposes but do not store any knowledge for reasoning purposes, they are considered as "knowledge poor" and they cannot support efficient environments for design. In Artificial Intelligence the notion of "Graphical Deep Knowledge" has been proved successful to represent knowledge about objects for display purposes as well as reasoning purposes. To design "knowledge rich" systems which can support better graphical interfaces, the theory of "Graphical Deep Knowledge" …

User Authentication And Related Topics: An Annotated Bibliography, Eugene H. Spafford, Stephen A. Weeber

Department of Computer Science Technical Reports

No abstract provided.

A Note On Many-One And 1-Truth-Table Complete Languages, Steven Homer, Stuart A. Kurtz, James S. Royer

Electrical Engineering and Computer Science - Technical Reports

The polynomial time 1-tt complete sets for EXP and RE are polynomial time many-one complete.

The Combinatorics Of Algebraic Splines, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

An Efficient Neural Algorithm For The Multiclass Problem, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

One connectionist approach to the classification problem, which has gained popularity in recent years, is the use of backpropagation-trained feed-forward neural networks. In practice, however, we find that the rate of convergence of net output error is especially low when training networks for multi-class problems. In this paper, we show that while backpropagation will reduce the Euclidean distance between the actual and desired output vectors, the difference between some of the components of these vectors will actually increase in the first iteration. Furthermore, the magnitudes of subsequent weight changes in each iteration are very small, so that many iterations are …

The Fast Fourier Transform, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

This tutorial discusses the fast Fourier transform, which has numerous applications in signal and image processing. The FFT computes the frequency components of a signal that has been sampled at n points in O( n log n) time. We explain the FFT and illustrate it by examples and Pascal algorithms. We assume that you are familiar with elementary calculus.

Ccis Networking - December 1991, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Parallel Divide And Conquer, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algorithm we derive balanced, parallel versions of quicksort and the fast Fourier transform by substitution of data types, variables and statements. The performance of these algorithms is analyzed and measured on a Computing Surface configured as a tree machine with distributed memory.