Digital Commons Network^™

Principles And Realization Strategies Of Intregrating Autonomous Software Systems: Extension Of Multidatabase Transaction Management Techniques, Aidong Zhang, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

General Interior Hermite Collocation Methods For Second Order Elliptic Partial Differential Equations, Yu-Ling Lai, Apostolos Hadjidimos, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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 …

Parameter Tuning For The Max Expert System, Christopher J. Merz, M. J. Pazzani

Computer Science Faculty Research & Creative Works

We investigate methods for tuning numeric parameters in Nynex MAX, a telephone trouble screening expert system. Steepest descent, hillclimbing, and simulated annealing parameter adjustment strategies are applied to the problems of maximizing classification accuracy and minimizing misclassification cost. For both of those optimization problems we evaluate each algorithm''s ability to tune initial parameters for several situations

A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Imprecise requirements are represented by the canonical form in test-score semantics. The concepts of feasibility, satisfiability, and specificity are formalized based on the fuzzy sets. The relationships between requirements are classified to be conflicting and cooperative. A feasible overall requirement can thus be formulated based on the tradeoff analysis of the conflicting requirements by using fuzzy multi-criteria optimization technique

An Improved Characterization Of 1-Step Recoverable Embeddings: Rings In Hypercubes, Jun-Lin Liu, T.J. Sager, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

An embedding is 1-step recoverable if any single fault occurs, the embedding can be reconfigured in one reconfiguration step to maintain the structure of the embedded graph. In this paper we present an efficient scheme to construct this type of 1-step recoverable ring embeddings in the hypercube. Our scheme will guarantee finding a 1-step recoverable embedding of a length-k (even) ring in a d-cube where 6 less than or equal to k less than or equal to (3/4)2/sup d/ and d greater than or equal to 3, provided such an embedding exists. Unlike previously proposed schemes, we solve the general …

Distributed-Memo: Heterogeneously Concurrent Programming With A Shared Directory Of Unordered Queues, William T. O'Connell, George K. Thiruvathukal, Thomas W. Christopher

Computer Science: Faculty Publications and Other Works

Heterogeneously distributed and parallel computing environments are highly dependent on hardware, data migration, and protocols. The result is significant difficulty in software reuse, portability across platforms, and an increased overall development effort. The appearance of a shared directory of unordered queues can be provided by integrating heterogeneous computers transparently. This integration provides a conducive environment for parallel and distributed application development, by abstracting the issues of hardware and communication. Object oriented technology is exploited to provide this seamless environment.

Distributed Memo: A Heterogeneously Distributed And Parallel Software Development Environment, William T. O'Connell, George K. Thiruvathukal, Thomas W. Christopher

Computer Science: Faculty Publications and Other Works

Heterogeneously distributed and parallel computing environments are highly dependent on hardware, data migration, and protocols. The result is significant difficulty in software reuse, portability across platforms, and an increased overall development effort. The appearance of a shared directory of unordered queues can be provided by integrating heterogeneous computers transparently. This integration provides a conducive environment for parallel and distributed application development, by abstracting the issues of hardware and communication. Object oriented technology is exploited to provide this seamless environment.

Software Metrics For Monitoring Software Engineering Projects, Edwin C. Lim

Theses: Doctorates and Masters

As part of the undergraduate course offered by Edith Cowan University, the Department of Computer Science has (as part of a year's study) a software engineering group project. The structure of this project was divided into two units, Software Engineering l and Software Engineering 2. ln Software Engineering 1, students were given the group project where they had to complete and submit the Functional Requirement and Detail System Design documentation. In Software Engineering 2, students commenced with the implementation of the software, testing and documentation. The software was then submitted for assessment and presented to the client. To aid the …

Financial Aid Budget Projection Methodology, Amy N. Baird '94

Honors Projects

The nature of this research project is to make a very strong contribution toward the final goal of completely automating the Financial Aid Office at Illinois Wesleyan University over the next five years.

A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu

Computer Science Faculty Publications

Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=2² nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly …

Visualisation Of Inshore Marine Water Depth Data, Karen Powell

Theses : Honours

The literature review performed as part of this Project concentrated on two objectives. The first objective was the identification of techniques applicable to the visualisation of the inshore marine water depth data obtained from the Department of Marine & Harbours (M&H). The second objective involved examining how colour is best used within data visualisation. The experimentation investigated a simple method for interpreting movement between depth surveys undertaken by M&H. Although it achieved the objective of creating a longer and smoother animation, it was concluded that the movement of the harbour floor was not accurately represented. The Project applied an optical …

The World Wide Web And Technology Transfer At Nasa Langley Research Center, Michael L. Nelson, David J. Bianco

Computer Science Faculty Publications

NASA Langley Research Center (LaRC) began using the World Wide Web (WWW) in the summer of 1993, becoming the first NASA installation to provide a Center-wide home page. This coincided with a reorganization of LaRC to provide a more concentrated focus on technology transfer to both aerospace and non-aerospace industry. Use of the WWW and NCSA Mosaic not only provides automated information dissemination, but also allows for the implementation, evolution and integration of many technology transfer applications. This paper describes several of these innovative applications, including the on-line presentation of the entire Technology Opportunities Showcase (TOPS), an industrial partnering showcase …

Electronic Document Distribution: Design Of The Anonymous Ftp Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich

Computer Science Faculty Publications

An experimental electronic dissemination project, the Langley Technical Report Server (LTRS), has been undertaken to determine the feasibility of delivering Langley technical reports directly to the desktops of researchers worldwide. During the first six months, over 4700 accesses occurred and over 2400 technical reports were distributed. This usage indicates the high level of interest that researchers have in performing literature searches and retrieving technical reports at their desktops. The initial system was developed with existing resources and technology. The reports are stored as files on an inexpensive UNIX workstation and are accessible over the Internet. This project will serve as …

World Wide Web Implementation Of The Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich, David J. Bianco

Computer Science Faculty Publications

On January 14, 1993, NASA Langley Research Center (LaRC) made approximately 130 formal, 'unclassified, unlimited' technical reports available via the anonymous FTP Langley Technical Report Server (LTRS). LaRC was the first organization to provide a significant number of aerospace technical reports for open electronic dissemination. LTRS has been successful in its first 18 months of operation, with over 11,000 reports distributed and has helped lay the foundation for electronic document distribution for NASA. The availability of World Wide Web (WWW) technology has revolutionized the Internet-based information community. This paper describes the transition of LTRS from a centralized FTP site to …

A Strategy For Electronic Dissemination Of Nasa Langley Technical Publications, Donna G. Roper, Mary K. Mccaskill, Scott D. Holland, Joanne L. Walsh, Michael L. Nelson, Susan L. Adkins, Manjula Y. Ambur, Bryan A. Campbell

Computer Science Faculty Publications

To demonstrate NASA Langley Research Center's relevance and to transfer technology to external customers in a timely and efficient manner, Langley has formed a working group to study and recommend a course of action for the electronic dissemination of technical reports (EDTR). The working group identified electronic report requirements (e.g., accessibility, file format, search requirements) of customers in U.S. industry through numerous site visits and personal contacts. Internal surveys were also used to determine commonalities in document preparation methods. From these surveys, a set of requirements for an electronic dissemination system was developed. Two candidate systems were identified and evaluated …

Asymptotically Tight Bounds For Performing Bmmc Permutations On Parallel Disk Systems, Thomas H. Cormen, Thomas Sundquist, Leonard F. Wisniewski

Computer Science Technical Reports

We give asymptotically equal lower and upper bounds for the number of parallel I/O operations required to perform bit-matrix-multiply/complement (BMMC) permutations on parallel disk systems. In a BMMC permutation on N records, where N is a power of 2, each (lg N)-bit source address x maps to a corresponding (lg N)-bit target address y by the matrix equation y = Ax XOR c, where matrix multiplication is performed over GF(2). The characteristic matrix A is (lg N) x (lg N) and nonsingular over GF(2). Under the Vitter-Shriver parallel-disk model with N records, D disks, B records per block, and M …

Job Scheduling In Rings, Perry Fizzano, Clifford Stein, David Karger, Joel Wein

Computer Science Technical Reports

We give distributed approximation algorithms for job scheduling in a ring architecture. In contrast to almost all other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those two processors in the network. As a result, our algorithms must balance both computational load and communication time.

The algorithms are simple, require no global control, and work in a variety of settings. All come with small constant-factor approximation guarantees; the basic algorithm yields schedules of length at most …

Recognizing Plants Using Stochastic L-Systems, Ashok K. Samal, Brian Peterson, David J. Holliday

School of Computing: Conference and Workshop Papers

Recognizing naturally occurring objects has been a difficult task in computer vision. One of the keys to recognizing objects is the development of a suitable model. One type of model, the fractal, has been used successfully to model complex natural objects. A class of fractals, the L-system, has not only been used to model natural plants, but has also aided in their recognition. This research extends the work in plant recognition using L-systems in two ways. Stochastic L-systems are used to model and generate more realistic plants. Furthermore, to handle the complexity of recognition, a learning system is used that …

On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang

Research Collection School Of Computing and Information Systems

It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems based on this equivalence observation, is presented

Identifying Faces Using Multiple Retrievals, Jian Kang Wu, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

During a police investigation, officers often have to sort through hundreds of photographs to identify a suspect. To aid this task, we at the Institute of Systems Science developed and implemented a flexible database system that can retrieve faces using personal information, fuzzy and free-text descriptors, and classification trees.

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.

Exclusive Hadronic B Decays To Charm And Charmonium Final States, Alam, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We have fully reconstructed decays of both B¯0 and B− mesons into final states containing either D, D*, D**, ψ, ψ’, or χc1 mesons. This allows us to obtain new results on many physics topics including branching ratios, tests of the factorization hypothesis, color suppression, resonant substructure, and the B−−B¯0 mass difference.

Measurement Of Cabibbo-Suppressed Decays Of The Τ Lepton, Battle, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Measurement Of The Branching Fraction For D+K-++, Balest, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at the Cornell Electron Storage Ring we have measured the ratio of branching fractions, B(D+K-++)/(D0K-+)=2.350.160.16. Our recent measurement of scrB(D0K-+) then gives scrB(D+K-++)=(9.30.60.8)%.

Measurement Of The Cross Section For Γγ→Pp̄, Artuso, M.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of A New Charmed Strange Meson, Kubota, Y.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of Inclusive B Decays To The Charmed Baryons C++ And C0, Procario, M.; Te Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Precision Measurement Of The Ds*+-Ds+ Mass Difference, Brown, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We have measured the vector-pseudoscalar mass splitting M(D*+s)-M(D+s)=144.22±0.47±0.37 MeV significantly more precisely than the previous world average. We minimize the systematic errors by also measuring the vector-pseudoscalar mass difference M(D*0)-M(D0) using the radiative decay D*0→D0γ, obtaining [M(D*+s)-M(D+s)]-[M(D*0)-M(D0)] =2.09±0.47±0.37 MeV. This is then combined with our previous high-precision measurement of M(D*0)-M(D0), which used the decay D*0→D0π0. We also measure the mass difference M(D+s)-M(D+)=99.5±0.6±0.3 MeV, using the φπ+ decay modes of the D+s and D+ mesons.

Skin Cancer Diagnosis Using Hierarchical Neural Networks And Fuzzy Logic, Hsi-Chieh Lee

Masters Theses

"Skin cancer, the most common cancer in the United States that affects about 600,000 Americans every year, accounts for 1 % of all cancer deaths. Among all, Malignant Melanoma is the most virulent form of skin cancer that is responsible for 75% of all deaths from skin cancer. In 1992, approximately 32,000 people are expected to develop melanoma and about 6,700 will die. However, even malignant melanoma can be treated successfully if detected in the early phase. Therefore, our research goal is to diagnose skin cancer, especially malignant melanoma.

In this study, only the digitized images obtained from color tumor …