Digital Commons Network^™

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.

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.

A Generic Software Modeling Framework For Building Heterogeneous Distributed And Parallel Software Systems, William T. O'Connell, George K. Thiruvathukal, Thomas W. Christopher

Computer Science: Faculty Publications and Other Works

Heterogeneous distributed and parallel computing environments are highly dependent on hardware and communication protocols. The result is significant difficulty in software reuse, portability across platforms, interoperability, and an increased overall development effort. A new systems engineering approach is needed for parallel processing systems in heterogeneous environments. The generic modeling framework de-emphasizes platform- specific development while exploiting software reuse (and platform-specific capabilities) with a simple, well defined, and easily integrated set of abstractions providing a high level of heterogeneous interoperability.

Determination Of Budgetary Expertise Among Public School Library Media Specialists In The State Of Florida, Mary Hosken

CCAC Theses and Dissertations

In 1988, Information Power described skills and duties expected of a school library media specialist. These include familiarity with various forms of educational technology, interpersonal social and communication skills, and proficiency in a wide range of planning and management areas. Simultaneously, restructuring, a movement to site-based management, requires new types of skills of Florida's teachers.

While the importance and complexity of the position of library media specialist has increased, there is concern that some practicing professionals do not have training or experience to address these new obligations. As a benchmark of current expertise in non-instructional duties, this research effort attempted …

The Electronic Bulletin Board As A Means Of Professional Communication Among Physics Teachers, Donald L. Mcgarry

CCAC Theses and Dissertations

Teachers of secondary school physics are often physically isolated from their peers; that is, they do not have as much contact with their physics colleagues as they desire. One reason for this physical isolation is the relatively small population of students enrolled in high school physics courses resulting in small numbers of physics teachers per school. Another is that many physics teachers are teaching physics only part time.

One method of communication among teachers has the potential to improve professional communication among physics teachers. This is the computer operated electronic bulletin board system (BBS). Bulletin board systems and variants have …

A Simulated Annealing/Tabu Search Algorithm For The Vehicle Routing Problem, Jeffrey Dale White, Billy E. Gillett

Computer Science Technical Reports

The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was introduced in 1958 by G. B. Dantzig and J. H. Ramser. This thesis creates three algorithms that endeavor to find an optimal solution for each problem tested. Two of the algorithms (Simulated Annealing and Tabu Search) have been used previously to solve this problem. These two solution methods are revisited to discover whether a new approach to creating routes will produce the best-known optimal values every time. New routes are created by forming route neighborhoods and then selecting cities from these neighborhoods for insertion. …

Fault-Tolerant Ring Embeddings In Hypercubes -- A Reconfigurable Approach, Jun-Lin Liu, Bruce M. Mcmillin

Computer Science Technical Reports

We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (without redundant processors and links). The fundamental idea for these schemes is to embed a basic network on the hypercube without fully utilizing the nodes on the hypercube. The remaining nodes can be used as spares to reconfigure the embeddings in case of faults. The result of this research shows that by carefully embedding the application graphs, the topological properties of the embedding can be preserved under fault conditions, and reconfiguration can be carried out efficiently.

In this dissertation, we choose the ring as the basic network …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 10, December 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Domain Analysis And Modeling Of A Model-Based Software Executive, Robert L. Welgan

Theses and Dissertations

This research was adapted the domain analysis techniques of Prieto- Diaz and Tracz to specify a domain analysis process which was used to conduct domain analysis over the domain of software executives. This analysis created a set of informal and formal domain model artifacts. The domain model artifacts were instantiated into two application executive subsystems. These executive subsystems operated in Architect, a domain-oriented application composition system based on the Object-Connection-Update OCU model. This research demonstrated and evaluated execution of the instantiated executive domain model in a series of event-driven and time-driven applications. As a consequence of developing the application executive …

The Development And Use Of An Evaluation Mechanism For The Assessment Of Software Configuration Management Tools, Wayne M. Descheneau, Neil W. Robinson

Theses and Dissertations

This study investigated the development of a mechanism for use in the evaluation of Software Configuration Management SCM tools. An examination of applicable DoD standards identified the SCM requirements that could be levied on a development contractor, and a literature search revealed the functionality common to various automated tools. These two sets of information were organized into a matrix, and for each requirement that was met, the intersection on the matrix of the requirement and each functionality used to meet that requirement was checked. In addition to the matrix, the mechanism consisted of general information about a given tool and …

Constructing Distributed Schedulers Using The Messiahs Interface Language, Steve J. Chapin, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Data Structures And Algorithms For The String Statistics Problem, Alberto Apostolico, Franco P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Extending Multidatabase Transaction Management Techniques To Software Development Environments, Aidong Zhang, Omran Bukhres

Department of Computer Science Technical Reports

No abstract provided.

A View-Based Approach To Relaxing Global Serializability In Multidatabase Systems, Aidong Zhang, Evaggelia Pitoura, Bharat K. Bhargava

Department of Computer Science Technical Reports

No abstract provided.

User-Database Interface: The Effect Of Abstraction Levels On Query Performance, Hock Chuan Chan, Kwok Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

A common classification of data models is based on their abstraction levels: physical, logical and conceptual. The user-database interaction can be similarly classified. For the conceptual-level interaction, the user and the database exchange information on the user's world, e.g., information of entities, relationships, and attributes. For the logical-level interaction, the user and the database communicate based on concepts in the database system, e.g., relations and join operations. We expect users to be familiar with concepts in their world but not the concepts in the database system. This is especially so for infrequent or naive database users. The conceptual level should …

Genetic Algorithms And Their Application To The Protein Folding Problem, Donald J. Brinkman

Theses and Dissertations

The protein folding problem involves the prediction of the secondary and tertiary structure of a molecule given the primary structure. The primary structure defines sequence of amino-acid residues, while the secondary structure describes the local 3-dimensional arrangement of amino-acid residues within the molecule. The relative orientation of the secondary structural motifs, namely the tertiary structure, defines the shape of the entire biomolecule. The exact, mechanism by which a sequence of amino acids protein folds into its 3- dimensional conformation is unknown Current approaches to the protein folding problem include calculus-based methods, systematic search, model building and symbolic methods, random methods …

A Probabilistic Approach To Fault Diagnosis In Linear Lightwave Networks, Robert H. Deng, A. A. Lazar, W. Wang

Research Collection School Of Computing and Information Systems

The application of probabilistic reasoning to fault diagnosis in linear lightwave networks (LLNs) is investigated. The LLN inference model is represented by a Bayesian network (or causal network). An inference algorithm is proposed that is capable of conducting fault diagnosis (inference) with incomplete evidence and on an interactive basis. Two belief updating algorithms are presented which are used by the inference algorithm for performing fault diagnosis. The first belief updating algorithm is a simplified version of the one proposed by Pearl (1988) for singly connected inference models. The second belief updating algorithm applies to multiply connected inference models and is …

Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

We propose a new (and restricted) model for global transactions which allows asynchronous commitment of subtransactions. Our model requires each global transaction to have a fixed structure with update to the data in at most one database. Based on this transaction model, we present two concurrency control algorithms, namely Asynchronous Site Graph and Asynchronous VirtGlobalSG, which employ asynchronous commitment and achieve global serializability. Compared to other proposed algorithms, our algorithms employ asynchronous commitment so as to increase transaction performance. Furthermore, our algorithms do not put restrictions on transaction data access or local histories.

Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh

Computer Science: Faculty Publications and Other Works

We examine the wormhole routing problem in terms of the "congestion" c and "dilation" d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη + cLηlog P) time, where L is the number of flits in a packet, and η = min {d,L]; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat-tree network of area Θ(A) can simulate wormhole routing on any network of comparable area with O(log 3 …