Digital Commons Network^™

On Neurobiological, Neuro-Fuzzy And Statistical Pattern Recognition Techniques, Anupam Joshi, Narendran Ramakrishnan, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Splitting Process Arising In Probabilistic Counting And Other Related Algorithms, Peter Kirschenofer, Helmut Prodinger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Graph-Constructive Approach To Solving Systems Of Geomeric Constraints, Ioannis Fudos, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

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, …

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.

Randomized Approximation Of The Constraint Satisfaction Problem, Hoong Chuin Lau, Osamu Watanabe

Research Collection School Of Computing and Information Systems

We consider the Weighted Constraint Satisfaction Problem (W-CSP) which is a fundamental problem in Artificial Intelligence and a generalization of important combinatorial problems such as MAX CUT and MAX SAT. In this paper, we prove non-approximability properties of W-CSP and give improved approximations of W-CSP via randomized rounding of linear programming and semidefinite programming relaxations. Our algorithms are simple to implement and experiments show that they are run-time efficient.

Customer Feedback Information System For Quality Improvement, Ke Wang

Masters Theses

This research addressed the basic needs for an effective customer feedback information system and the database technology to develop the system. It discussed the system concept and configuration of a typical customer feedback information system, database management technology, programming flow charts, program functions and capabilities. A proposed customer feedback information system consists of customer data inputs, database management system and outputs to various departments in an organization. With a user-friendly interface, database management system serves as an information management tool. It can process the feedback from customers and use the information in decision making. Thus, customer feedback can be promptly …

Design Information Recovery From Legacy System Cobol Source Code: Research On A Reverse Engineering Methodology, Robert Lee Miller

CCAC Theses and Dissertations

Much of the software in the world today was developed from the mid-1960s to the mid- 1970s.This legacy software deteriorates as it is modified to satisfy new organizational requirements. Currently, legacy system maintenance requires more time than new system development. Eventually, legacy systems must be replaced. Identifying their functionality is a critical part of the replacement effort. Recovering functions from source code is difficult because the domain knowledge used to develop the system is not routinely retained. The source code is frequently the only reliable source of functional information.

This dissertation describes functional process information recovery from COBOL source code …

Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang

Computer Science Faculty Publications

The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ (log n) time using n processors in the CREW model.

Volunteer Water Quality Monitoring Programs: An Assessment Of Public Participation As A Means Of Fostering Environmental Stewardship, Christopher Damon

Marine Affairs Theses and Major Papers

Volunteer water quality monitoring organizations from across the country were surveyed (n=516) to determine the relationship between public involvement and the generation of stewardship within the community. Program coordinators were asked first to rate the level of stewardship values within the community, and then respond to questions covering four broad areas of public involvement: pre-existing conditions, public education, volunteer behavior, and communal involvement. For each question, organizations were aggregated by response, and a frequency analysis was performed to discover the most common responses in each of the four public involvement categories. the mean of perceived stewardship values was graphed as …

A Policy-Independent Secure X Server, Kirk Joseph Bittler

Dissertations and Theses

This thesis demonstrates that a secure X system can be designed and implemented to be independent of a particular security policy. The advantages and costs of a separation of security policy and enforcement are examined by developing a large scale application, the DX windowing system, on a DTOS platform. DTOS is a high assurance operating system that isolates policy decisions in a Security Server. A security conscious process, such as DX, eliminates policy considerations from the code. The process instead consults the Security Server and enforces the decisions that server derives from the policy. The DX architecture is described and …

Putting Type Annotations To Work, Martin Odersky, Konstantin Laufer

Computer Science: Faculty Publications and Other Works

We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of first-order unification under a mixed prefix.

Automatic Pcb Inspection Algorithms: A Survey, Madhav Moganti, Fikret Ercal, Cihan H. Dagli, Shou Tsunekawa

Computer Science Faculty Research & Creative Works

The importance of the inspection process has been magnified by the requirements of the modern manufacturing environment. In electronics mass-production manufacturing facilities, an attempt is often made to achieve 100% quality assurance of all parts, subassemblies, and finished goods. A variety of approaches for automated visual inspection of printed circuits have been reported over the past two decades. In this survey, algorithms and techniques for the automated inspection of printed circuit boards are examined. A classification tree for these algorithms is presented and the algorithms are grouped according to this classification. This survey concentrates mainly on image analysis and fault …

Tuning Numeric Parameters To Troubleshoot A Telephone-Network Loop, Christopher J. Merz, M. J. Pazzani, A. P. Danyluk

Computer Science Faculty Research & Creative Works

The Nynex Max expert system analyzes the result of an automated electric test on a telephone line and determines the type of problem. However, tuning the system's parameter values can be difficult. The Opti-Max system can automatically set these parameters by analyzing decisions made by experts who troubleshoot problems

Simulation Of Asynchronous Instruction Pipelines, Chia-Hsing Chien, Mark A. Franklin

All Computer Science and Engineering Research

This paper presents the ARAS simulator with which asynchronous instruction pipelines can be modelled, simulated and displayed. ARAS allows one to construct instruction pipelines by preparing various configuration files. Using these files and a number of benchmark programs, performance of the instruction pipelines can be obtained. The performance of asynchronous instruction pipelines can also be compared to synchronous case. Thus, one can decide the optimal design for instruction pipelines in asynchornous or synchronous cases and explore the deisng space of asynchronous instruction pipeline architectures.

Optimal Solution Of Off-Line And On-Line Generalized Caching, Saied Hosseini-Khayat, Jerome R. Cox

All Computer Science and Engineering Research

Network traffic can be reduced significantly if caching is utilized effectively. As an effort in this direction we study the replacement problem that arises in caching of multimedia objects. The size of objects and the cost of cache misses are assumed non-uniform. The non-uniformity of size is inherent in multimedia objects, and the non-uniformity of cost is due to the non-uniformity of size and the fact that the objects are scattered throughout the network. Although a special case of this problem, i.e. the case of uniform size and cost, has been extensively studied, the general case needs a great deal …

An Algorithm For Message Delivery To Mobile Units, Amy L. Murphy, Gruia-Catalin Roman, George Varghese

All Computer Science and Engineering Research

With recent advances in wireless communication and the ubiquity of laptops, mobile computing has become an important research area. An essential problem in mobile computing is the delivery of a message from a source to either a single mobile node, unicast, or to a group of mobile nodes, multicast. Standard solutions used in Mobile IP and cellular phones for the unicast problem rely on tracking the mobile unit. Tracking solutions scale badly when mobile nodes move frequently, and do not generalize well to multicast delivery. Our paper proposes a new message delivery algorithm for micromobility based on a modification of …

Data Compression Based On The Cubic B-Spline Wavelet With Uniform Two-Scale Relation, S. K. Yang, C. H. Cooke

Mathematics & Statistics Faculty Publications

The aim of this paper is to investigate the potential artificial compression which can be achieved using an interval multiresolution analysis based on a semiorthogonal cubic B-spline wavelet. The Chui-Quak [1] spline multiresolution analysis for the finite interval has been modified [2] so as to be characterized by natural spline projection and uniform two-scale relation. Strengths and weaknesses of the semiorthogonal wavelet as regards artificial compression and data smoothing by the method of thresholding wavelet coefficients are indicated.

Application Of Autoregressive Moving Average Linear Prediction Filters To The Characterization Of Solar Wind-Magnetosphere Coupling, Carter N. Borst

Theses and Dissertations

Linear prediction filtering techniques have been used in studying the coupling processes between the solar wind and magnetosphere. The magnetosphere is a complex, dynamic system with at least two independent coupling methods for energy input, driven and unloading. Linear models were built and tested on the Bargatze data set, consisting of over 70 days of geomagnetic indices and solar wind data ordered in 34 intervals of increasing geomagnetic activity. Linear filtering techniques employing single-and multiple-input, autoregressive models predicted values of the magnetic index AL from solar wind data. The impulse response curves of the AL-coupling function groups showed amplitude peaks …

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.

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 …

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.