Digital Commons Network^™

A Search Tool To Enhance The Selection And Utilisation Of Reusable Software Modules Within The Object-Oriented Paradigm, Robert H. Cross

Theses: Doctorates and Masters

The affinity for reuse within the object-oriented paradigm may enable high levels of productivity; however, gains will become realisable only if a systems developer has access to tools which aid in the selection of classes. A method for object-oriented analysis and design is detailed and its process is assisted by an object-oriented search tool based on reference and corporate library technology. The search tool contributes to the determination of suitable existing inheritable classes and an explanation of its construction and use is included. A practical demonstration of the method, using the search tool, is elaborated. The thesis demonstrates that text …

Arbitrary Views Of High-Dimensional Space And Data, Andrew Ellerton

Theses : Honours

Computer generated images of three dimensional scenes objects are the result of parallel/perspective projections of the objects onto a two dimensional plane. The computational techniques may be extended to project n-dimensional hyperobjects onto (n-1) dimensions, for n > 3. Projection to one less dimension may be applied recursively for data of any high dimension until that data is two-dimensional, when it may be directed to a computer screen or to some other two-dimensional output device. Arbitrary specification of eye location, target location, field-of-view angles and other parameters provide flexibility, so that data may be viewed-and hence perceived-in previously unavailable ways. However, …

Towards A Model For Software Project Estimating, Stuart Hope

Theses : Honours

The use and development of software is an integral and critical part of modern industrial society. The outcomes of many software development and maintenance projects have been less than satisfactory with significant numbers being over schedule, lacking in functionality and over budget. These problems are the result of poor management of both the process and the product. One of the major problems to overcome in the management of software development projects is the ability to predict the outcomes early in the project when there are a large number of unknowns. The ability to reliably predict the outcomes in a repeatable …

Measurement Of The Λb Polarization In Z Decays, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The Λb polarization in hadronic Z decays is measured in semileptonic decays from the average energies of the charged lepton and the neutrino. In a data sample of approximately 3 million hadronic Z decays collected by the ALEPH detector at LEP between 1991 and 1994, 462 ± 31 Λb candidates are selected using (Λπ+)-lepton correlations. From this event sample, the Λb polarization is measured to be PΛb = −0.23−0.20+0.24(stat.)−0.07+0.08(syst.).

Determination Of Sin2Θw Eff Using Jet Charge Measurements In Hadronic Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The electroweak mixing angle is determined with high precision from measurements of the mean difference between forward and backward hemisphere charges in hadronic decays of the Z. A data sample of 2.5 million hadronic Z decays recorded over the period 1990 to 1994 in the ALEPH detector at LEP is used. The mean charge separation between event hemispheres containing the original quark and antiquark is measured forbb¯bb¯ andcc¯cc¯ events in subsamples selected by their long lifetimes or using fastD*’s. The corresponding average charge separation for light quarks is measured in an inclusive sample from the anticorrelation between charges of opposite …

Improved Measurement Of The B0 And B+ Meson Lifetimes, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

Updated measurements of the B0 and B+ meson lifetimes are presented. From a data sample of 1.72 million hadronic Z0 decays recorded during the period 1991 to 1993, a sample of approximately 1000 semileptonic B meson decays containing a D0, D+ or D*+ has been isolated. From the distribution of decay times in the different samples the lifetimes of the B0 and B+ mesons are determined to be 1.53±0.12±0.08 ps and 1.52±0.14±0.09 ps, respectively, where the first error is statistical and the second systematic. The ratio of the B+ to B0 lifetimes is measured to be 0.99±0.14+0.05−0.04, confirming expectations that …

Tau Leptonic Branching Ratios, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A sample of 62249 τ-pair events is selected from data taken with the ALEPH detector in 1991, 1992 and 1993. The measurement of the branching fractions for τ decays into electrons and muons is presented with emphasis on the study of systematic effects from selection, particle identification and decay classification. The results obtained are: B e = 17.79±0.12(stat)±0.06(syst)(%) and Bμ = 17.31±0.11(stat)±0.05(syst)(%). Combined with the most recent ALEPH determination of the τ lifetime, these results provide a relative measurement of the leptonic couplings in the weak charged current for transverse W bosons: ${cal G}_{ώ}/{cal G}_{e}=1.0002pm 0.0051$ and ${cal G}_{∢u}/{cal G}_{u}=0.9943pm …

Tau Hadronic Branching Ratios, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

From 64492 selected τ-pair events, produced at the Z0 resonance, the measurement of the tau decays into hadrons from a global analysis using 1991, 1992 and 1993 ALEPH data is presented. Special emphasis is given to the reconstruction of photons and π0s, and the removal of fake photons. A detailed study of the systematics entering the π0 reconstruction is also given. A complete and consistent set of tau hadronic branching ratios is presented for 18 exclusive modes. Most measurements are more precise than the present world average. The new level of precision reached allows a stringent test τ-μ, universality in …

Combinatorial Approaches For Hard Problems In Manpower Scheduling, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Manpower scheduling is concerned with the construction of a workers' schedule which meets demands while satisfying given constraints. We consider a manpower scheduling Problem, called the Change Shift Assignment Problem(CSAP). In previous work, we proved that CSAP is NP-hard and presented greedy methods to solve some restricted versions. In this paper, we present combinatorial algorithms to solve more general and realistic versions of CSAP which are unlikely solvable by greedy methods. First, we model CSAP as a fixed-charge network and show that a feasible schedule can be obtained by finding disjoint paths in the network, which can be derived from …

On The Complexity Of Manpower Shift Scheduling, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the shift assignment problem in manpower scheduling, and show that a restricted version of it is NP-hard by a reduction from 3SAT. We then present polynomial algorithms to solve special cases of the problem and show how they can be deployed to solve more complex versions of the shift assignment problem. Our work formally defines the computational intractibility of manpower shift scheduling and thus justifies existing works in developing manpower scheduling systems using combinatorial and heuristic techniques.

Information Engineering Facility (Ief) Computer Aided Software Engineering (Case) For Church Management System, Cynthia T. Dubose

Electronic Dissertations and Theses

No abstract provided.

Designing Dependencies, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

Given a binary recursively enumerable relation R, one or more logic programs over a language L can be constructed and interconnected to produce a dependency relation D on selected predicates within the Herbrand base BL of L isomorphic to R. D can be, optionally, a positive, negative or mixed dependency relation. The construction is applied to representing any effective game of the type introduced by Gurevich and Harrington, which they used to prove Rabin's decision method for S2S, as the dependency relation of a logic program. We allow games over an infinite alphabet of possible moves. We use this representation …

Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan

Kno.e.sis Publications

This paper presents an approach for integrating simulation modeling and analysis capabilities within the workflow management system (WFMS) being developed in the Large Scale Distributed Information Systems (LSDIS) Lab at the University of Georgia. Simulation modeling can be used for studying the efficiency of workflow designs as well as studying the general performance and reliability of WFMSs. We also discuss the importance of using sophisticated monitoring and animation capabilities, and the use of workflow management technology to advance simulation technology itself. Finally, we demonstrate a sample simulation where tasks and task managers are simulated.

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

BITs and PCs Newsletter

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

Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn

Electrical Engineering and Computer Science - Technical Reports

We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs as cellular automata shifts attention from classes of Herbrand models to orbits of Herbrand interpretations. Orbits capture both the declarative, model-theoretic meaning of programs as well as their inferential behavior. Logically and intentionally different programs can produce orbits that simulate each other. Simple examples of such behavior are compellingly exhibited with space-time diagrams of the programs as cellular automata. Construing a program as a cellular automaton leads to a general method for simulating any covered program with a Horn …

Adaptive Methods For Distributed Video Presentation, Crispin Cowan, Shanwei Cen, Jonathan Walpole, Carlton Pu

Computer Science Faculty Publications and Presentations

This paper describes problems and solutions for delivering real-time, multi-media presentations across the Internet. A key characteristic of presentations of continuous media datatypes, such as digital video and audio, is their need for predictable real-time data delivery. For example, an NTSC quality video presentation requires video frames to be displayed every 1/30th of a second. Variations in this display rate can be observable as stalls or glitches in the video stream and reduce the quality of the presentation [6]. Delivering such presentations across the Internet is difficult because highly variable band- width and latency make it difficult to predict the …

Dynamics Of Binary Liquids In Pores, J.C. Lee

Faculty Publications

A computer simulation is performed to study the dynamics of binary liquids in the pores of Vycor glasses. The pores are modeled with glass walls that form randomly interconnected tunnels. When the relaxation is probed with a particular wavelength, the time autocorrelation function depends on whether or not there is a significant periodic or quasiperiodic structure in the distribution of the walls with that wavelength. If there is not, the relaxation may be fitted as the sum of an exponential term and a nonexponential activated term. If there is, the relaxation shows a long-lasting tail that can be fitted by …

Secure Trapdoor Hash Functions Based On Public-Key Cryptosystems, Gary R. Greenfield, Sarah Agnes Spence

Department of Math & Statistics Technical Report Series

In this paper we systematically consider examples representative of the various families of public-key cryptosystems to see if it would be possible to incorporate them into trapdoor hash functions, and we attempt to evaluate the resulting strengths and weaknesses of the functions we are able to construct. We are motivated by the following question:

Question 1.2 How likely is it that the discoverer of a heretofore unknown public-key cryptosystem could subvert it for use in a plausible secure trapdoor hash algorithm?

In subsequent sections, our investigations will lead to a variety of constructions and bring to light the non-adaptability of …

Kenematic Tolerance Analysis, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Bit-Sequences: A New Cache Invalidation Method In Mobile Environments, Jin Jing, Ahmed K. Elmagarmid, Abdelsalam Helal, Rafael Alonso

Department of Computer Science Technical Reports

No abstract provided.

Partitioned Data Management In Mobile Environments, Ahmed K. Elmagarmid, Jin Jing, Abdelsalam Helal, Rafael Alonso

Department of Computer Science Technical Reports

No abstract provided.

The New Jersey Machine-Code Toolkit, Norman Ramsey, Mary F. Fernáyesndez

Department of Computer Science Technical Reports

No abstract provided.

Lightweight Write Detection And Checkpointing For Fine-Grained Persistence, Antony L. Hosking, J. Eliot B. Moss

Department of Computer Science Technical Reports

No abstract provided.

Sliced Configuration Spaces For Curved Planar Bodies, Elisha Sacks, Chandrajit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Pattern Matching Image Compression: Algorithmic And Empirical Results, Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Inverse Pattern Matching, Amihood Amir, Alberto Apostolico, Moshe Lewenstein

Department of Computer Science Technical Reports

No abstract provided.

Migrant Threads On Process Farms: Parallel Programming With Ariadne*, Edward Mascarenhas, Vernon Rego

Department of Computer Science Technical Reports

No abstract provided.

Objectism 3.0: A Software Architecture For The Development Of Portable Visual Simulation Applications, Shawn M. Hannan

Theses and Dissertations

A visual simulation software architecture is a reusable design for visual simulation applications. This thesis effort was the third stage in an ongoing refinement of such an architecture, named ObjectSim. The primary goals of this stage were to improve the architecture by eliminating its dependence on two platform-specific graphics libraries (named GL and Performer, from Silicon Graphics, Inc.), and to examine the potential for expanding the architecture to accommodate distributed simulations. The effort resulted in a new version of the architecture which allows the development of visual simulation applications which take full advantage of the aforementioned libraries without calling those …

Transforming Algebraically-Based Object Models Into A Canonical Form For Design Refinement, Charles G. Beem

Theses and Dissertations

The understandability of object-oriented design techniques and the rigor of formal methods have improved the state of software development; however, both ideas have limitations. Object-oriented techniques, which are semi-formal, can still result in incorrect designs, while formal methods are complex and require an extensive mathematical background. The two approaches can be coupled, however, to produce designs that are both understandable and verifiable, and to produce executable code. This research proposes an approach where object-oriented models are first represented algebraically in a formal specification language such as LARCH and then transformed into a canonical form suitable for design refinement. In the …

The Application Of Hybridized Genetic Algorithms To The Protein Folding Problem, Robert L. Gaulke

Theses and Dissertations

The protein folding problem consists of attempting to determine the native conformation of a protein given its primary structure. This study examines various methods of hybridizing a genetic algorithm implementation in order to minimize an energy function and predict the conformation (structure) of Met-enkephalin. Genetic Algorithms are semi-optimal algorithms designed to explore and exploit a search space. The genetic algorithm uses selection, recombination, and mutation operators on populations of strings which represent possible solutions to the given problem. One step in solving the protein folding problem is the design of efficient energy minimization techniques. A conjugate gradient minimization technique is …