Physical Sciences and Mathematics Commons^™

Atomic Broadcast In Heterogeneous Distributed Systems, Osman Zeineldine

Computer Science Theses & Dissertations

Communication services have long been recognized as possessing a dominant effect on both performance and robustness of distributed systems. Distributed applications rely on a multitude of protocols for the support of these services. Of crucial importance are multicast protocols. Reliable multicast protocols enhance the efficiency and robustness of distributed systems. Numerous reliable multicast protocols have been proposed, each differing in the set of assumptions adopted, especially for the communication network. These assumptions make each protocol suitable for a specific environment. The presence of different distributed applications that run on different LANs and single distributed applications that span different LANs mandate …

Knowledge Acquisition And Structuring By Multiple Experts In A Group Support Systems Environment, Bernard Lee Lewis

Engineering Management & Systems Engineering Theses & Dissertations

This study addresses the impact of Group Decision Support Systems (GDSS) on expert system development by multiple Domain Experts. Current approaches to building expert systems rely heavily on knowledge acquisition and prototyping by a Knowledge Engineer working directly with the Domain Expert. Although the complexity of knowledge domains and new organizational approaches demand the involvement of multiple experts, standard procedures limit the ability of the Knowledge Engineer to work with more than one expert at a time.

Group Decision Support Systems offer a networked computerized environment for group work activities, in which multiple experts may express their ideas concurrently and …

Electric Field Mapping System With Nanosecond Temporal Rosolution, F. E. Peterkin, R. Block, K. H. Schoenbach

Bioelectrics Publications

The electric field dependence of the absorption coefficient in semi‐insulating GaAs at the absorption edge was measured in a high‐voltage pulsed experiment. Pulse duration was kept below 50 ns in order to avoid thermal effects. A GaAs laser diode was used as a probe light source with wavelength varied from 902 to 911 nm. For fields up to 40 kV/cm the absorption coefficient increased from 3 to 17 cm⁻¹ at 902 nm, with smaller absolute increases evident at the longer wavelengths. Calculation from theory was consistent with this behavior. The spatial variation of the electric field was also recorded …

A Linear-Time Recognition Algorithm For P4-Reducible Graphs, B. Jamison, S. Olariu

Computer Science Faculty Publications

The P₄-reducible graphs are a natural generalization of the well-known class of cographs, with applications to scheduling, computational semantics, and clustering. More precisely, the P₄-reducible graphs are exactly the graphs none of whose vertices belong to more than one chordless path with three edges. A remarkable property of P₄-reducible graphs is their unique tree representation up to isomorphism. In this paper we present a linear-time algorithm to recognize P₄-reducible graphs and to construct their corresponding tree representation.

Software Reliability Issues: An Experimental Approach, Mary Ann Hoppa

Computer Science Theses & Dissertations

In this thesis, we present methodologies involving a data structure called the debugging graph whereby the predictive performance of software reliability models can be analyzed and improved under laboratory conditions. This procedure substitutes the averages of large sample sets for the single point samples normally used as inputs to these models and thus supports scrutiny of their performances with less random input data.

Initially, we describe the construction of an extensive database of empirical reliability data which we derived by testing each partially debugged version of subject software represented by complete or partial debugging graphs. We demonstrate how these data …

Comparing Traditional Statistical Models With Neural Network Models: The Case Of The Relation Of Human Performance Factors To The Outcomes Of Military Combat, William Oliver Hedgepeth

Engineering Management & Systems Engineering Theses & Dissertations

Statistics and neural networks are analytical methods used to learn about observed experience. Both the statistician and neural network researcher develop and analyze data sets, draw relevant conclusions, and validate the conclusions. They also share in the challenge of creating accurate predictions of future events with noisy data.

Both analytical methods are investigated. This is accomplished by examining the veridicality of both with real system data. The real system used in this project is a database of 400 years of historical military combat. The relationships among the variables represented in this database are recognized as being hypercomplex and nonlinear.

The …

Error Estimates And Lipschitz Constants For Best Approximation In Continuous Function Spaces, M. Bartelt, W. Li

Mathematics & Statistics Faculty Publications

We use a structural characterization of the metric projection PG(f), from the continuous function space to its one-dimensional subspace G, to derive a lower bound of the Hausdorff strong unicity constant (or weak sharp minimum constant) for PG and then show this lower bound can be attained. Then the exact value of Lipschitz constant for PG is computed. The process is a quantitative analysis based on the Gâteaux derivative of PG, a representation of local Lipschitz constants, the equivalence of local and global Lipschitz constants for lower semicontinuous mappings, and construction …

A Mathematical Model Of Cycle Chemotherapy, J. C. Panetta, J. Adam

Mathematics & Statistics Faculty Publications

A mathematical model is used to discuss the effects of cycle-specific chemotherapy. The model includes a constraint equation which describes the effects of the drugs on sensitive normal tissue such as bone marrow. This model investigates both pulsed and piecewise-continuous chemotherapeutic effects and calculates the parameter regions of acceptable dose and period. It also identifies the optimal period needed for maximal tumor reduction. Examples are included concerning the use of growth factors and how they can enhance the cell kill of the chemotherapeutic drugs.

An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu

Computer Science Faculty Publications

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.

Linear Time Optimization Algorithms For P4-Sparse Graphs, Beverly Jamison, Stephan Olariu

Computer Science Faculty Publications

Quite often, real-life applications suggest the study of graphs that feature some local density properties. In particular, graphs that are unlikely to have more than a few chordless paths of length three appear in a number of contexts. A graph G is P₄-sparse if no set of five vertices in G induces more than one chordless path of length three. P₄-sparse graphs generalize both the class of cographs and the class of P₄-reducible graphs. It has been shown that P₄-sparse graphs can be recognized in time linear in the size of the …