Digital Commons Network^™

A Systematic Tradeoff Methodology For Acquiring And Validating Imprecise Requirements, J. Yen, Xiaoqing Frank Liu, W. A. Tiao

Computer Science Faculty Research & Creative Works

Requirement analysis is one of the most important phases in a software development process. Existing requirement methodologies are limited in specifying requirements that are usually vague and imprecise, and in supporting tradeoff analysis between the conflicting requirements. In this paper, the elasticity of imprecise requirements is captured using fuzzy logic to facilitate tradeoffs between conflicting requirements. Based on the marginal rate of substitution in decision science, we have developed a systematic approach to elicit the structures and the parameters of imprecise requirements, to validate the scheme for aggregating requirements, and to assess relative priorities of conflicting requirements.

Adaptive Information Filtering As A Means To Overcome Information Overload, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

Information Filtering is concerned with filtering data streams in such a way as to leave only pertinent data (information) to be perused. When the data streams are produced in a changing environment (as most if not all are) the filtering has to adapt too in order to remain effective. Adaptive Information Filtering (AIF) is concerned with filtering in changing environments. The changes may occur both on the transmission side (the nature of the streams can change), and on the reception side (the interest of a user can change). The thesis research described in this paper combines trigram analysis, clustering, and …

Concepts Of Adaptive Information Filtering, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

This paper was written for the project study “Adaptive Information Filtering” at the Department of Computer Science, Leiden University, The Netherlands. The assignment was to write an introduction to Adaptive Information Filtering (AIF), based on the author’s ideas for his M.Sc. thesis, and with as large an audience as possible in mind. In addition to a simple introduction to AIF, this paper should also provide easy introductions to clustering algorithms, evolutionary computation, and n-gram analysis. (Preface, page 2)

Optimization Of The Discriminatory Power Of A Trigram Based Document Clustering Algorithm Using Evolutionary Computation, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

No abstract provided.

The Design And Implementation Of A Toolkit For The Creation Of Virtual Environments, Jesse Kinross-Smith

Theses : Honours

Virtual Reality is a field that is steadily increasing in popularity and interest. New developments in both hardware and software have empowered developers with new devices allowing faster and better quality interaction with virtual environments. However, the emphasis of research in virtual environments has been more concerned with development of new display and input devices, as opposed to the investigation of different methods of interaction that a three-dimensional environment offers. This project designs and implements a three-dimensional, interactive, virtual environment development system upon an existing three-dimensional rendering engine. The aim of the project is to allow users to generate virtual …

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 …

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 …

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 …

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 …

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 …

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 …

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

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.

The Effects Of Conceptual And Logical Interfaces On Visual Query Performance Of End Users, Keng Siau, H. Chan, K. Wei

Research Collection School Of Computing and Information Systems

To the end users, the interface is the system. A better interface not only facilitates end user interaction with the database, it also enables them to formulate queries more efficiently and effectively. Two of the most important user-database interfaces are the conceptual and logical interfaces. With the conceptual interface, the user communicates with tile database system in terms ofentities, objects and relationships. On the other hand, the current user-database interaction is mainly based on the logical interface where the user expresses the queries in terms of relations and join operations. Because the concepts at the logical iliterface are abstract and …

Using Passion System On Lu Factorization, Haluk Rahmi Topcuoglu, Alok Choudhary

Electrical Engineering and Computer Science - Technical Reports

Parallel I/0 subsystems are added to massively parallel computers in order to lessen I/0 bottleneck to some extent. Up to now, a few number of parallel software systems have been designed and implemented to assist programmers in I/0 intensive applications; PASSION is one of them. By providing parallel I/0 support at the language, compiler and run-time level, PASSION system explores the large design space of parallel systems. The target of this paper is to show the performance benefits of using PASSION I/0 libraries at runtime in comparison with using conventional parallel I/0 primitives for high performance parallel I/0 in LU …

Sequence Alignment In Molecular Biology, Alberto Apostolico, Raffaele Fiancarlo

Department of Computer Science Technical Reports

No abstract provided.

Measurement Of The Bs0 Lifetime And Production Rate With Ds- ℓ+ Combinations In Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A precise determination of the effective Bs0→K+K− lifetime can be used to constrain contributions from physics beyond the Standard Model in the Bs0 meson system. Conventional approaches select B meson decay products that are significantly displaced from the B meson production vertex. As a consequence, B mesons with low decay times are suppressed, introducing a bias to the decay time spectrum which must be corrected. This analysis uses a technique that explicitly avoids a lifetime bias by using a neural network based trigger and event selection. Using 1.0fb−1 of data recorded by the LHCb experiment, the effective Bs0→K+K− lifetime is …

Intelligent Control Of Vehicles: Preliminary Results On The Application Of Learning Automata Techniques To Automated Highway System, Cem Unsal, John S. Bay, Pushkin Kachroo

Electrical & Computer Engineering Faculty Research

We suggest an intelligent controller for an automated vehicle to plan its own trajectory based on sensor and communication data received. Our intelligent controller is based on an artificial intelligence technique called learning stochastic automata. The automaton can learn the best possible action to avoid collisions using the data received from on-board sensors. The system has the advantage of being able to work in unmodeled stochastic environments. Simulations for the lateral control of a vehicle using this AI method provides encouraging results.

Automatic Office Document Classification And Information Extraction, Xiaolong Hao

Dissertations

TEXPR.OS (TEXt PROcessing System) is a document processing system (DPS) to support and assist office workers in their daily work in dealing with information and document management. In this thesis, document classification and information extraction, which are two of the major functional capabilities in TEXPROS, are investigated.

Based on the nature of its content, a document is divided into structured and unstructured (i.e., of free text) parts. The conceptual and content structures are introduced to capture the semantics of the structured and unstructured part of the document respectively. The document is classified and information is extracted based on the analyses …

Evaluable Functions In The GöDel Programming Language: Parsing And Representing Rewrite Rules, Janet Vorvick

Dissertations and Theses

The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Gödel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Gödel parser which enables the parsing of evaluable functions in Gödel. As the first part of an extended Gödel, the parser produces output similar to the output from the original Gödel parser, ensuring that Gödel modules are properly handled by the extended-Gödel parser. Parser output is structured to simplify, as much as …

Formal Methods: How, When, And Why They Are Used, Beth Arrowsmith, Bruce Mcmillin, Ralph Wilkerson

Computer Science Technical Reports

Formal methods, theoretically a wonderful concept for ensuring a program's correctness, are not widely used in practice. This dichotomy between what theory advocates and practice might be due to programmers' lack of experience with formal methods. To determine if this was the case, a module on Formal Methods was introduced into a graduate course on distributed systems. This module first introduced the students to the theory of formal methods and then required students to program a distributed problem in CCSP, a subset of CSP, using formal methods. The results were abysmal. Students avoided using formal methods. When they did use …

A Provably Convergent Dynamic Training Method For Multi-Layer Perceptron Networks, Timothy L. Andersen, Tony R. Martinez

Faculty Publications

This paper presents a new method for training multi-layer perceptron networks called DMP1 (Dynamic Multilayer Perceptron 1). The method is based upon a divide and conquer approach which builds networks in the form of binary trees, dynamically allocating nodes and layers as needed. The individual nodes of the network are trained using a genetic algorithm. The method is capable of handling real-valued inputs and a proof is given concerning its convergence properties of the basic model. Simulation results show that DMP1 performs favorably in comparison with other learning algorithms.

Measurement Of The Effective B Quark Fragmentation Function At The Z Resonance, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using a sample of about 1.46 million hadronic Z decays collected between 1991 and 1993 with the ALEPH detector at LEP, the energy distribution of the B0 and B± mesons produced at the Z resonance is measured by reconstructing semileptonic decays B → ℓνℓD(X) or B→ ℓνℓD∗+(X). The charmed mesons are reconstructed through the decay modes D0 → K−π+, D0 → K−π+π−π+, D+ → K−π+π+ and D∗+→ D0π+. The neutrino energy is estimated from the missing energy in the lepton hemisphere. Accounting for B∗ and B∗∗ production, the shape of the scaled energy distribution xE(b) for mesons containing a b …

Measurement Of Αs From Scaling Violations In Fragmentation Functions In E+E- Annihilation, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A study of scaling violations in fragmentation functions performed by the ALEPH collaboration at LEP is presented.

Measurements Of The B Baryon Lifetime, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The average lifetime of b-flavoured baryons measured with the OPAL detector is updated to include data collected between 1990 and 1994 at LEP. Bottom-flavoured baryons that decay semileptonically and produce aΛ baryon are identified through the correlation of the baryon number of theΛ and the electric charge of the lepton. To measure the lifetime, the decay point of the b baryon is estimated by theΛ-lepton vertex, and the observed distribution of decay lengths is fitted simultaneously in 874 right-sign and 384 wrong-sign combinations. In a separate method, the impact parameter distribution of the leptons is fitted in a subset of …

Group Creativity And Technology, Keng Siau

Research Collection School Of Computing and Information Systems

Despite the popularity of brainstorming, research has shown that verbal brainstorming is not always effective in increasing group creativity. On the other hand, its electronic counterpart, electronic brainstorming, appears to produce much better results. Is technology the panacea for group idea generation? This paper first reviews the theory of group creativity and then examines the characteristics of electronic brainstorming that makes it more effective than verbal brainstorming. From the success of electronic brainstorming, it then argues that the use of technology might be the key to overcome the space and time constraints that are commonly faced by creativity groups.

Process Migration For Heterogeneous Distributed Systems, Matt Bishop, Mark Valence, Leonard F. Winiewski

Computer Science Technical Reports

The policies and mechanisms for migrating processes in a distributed system become more complicated in a heterogeneous environment, where the hosts may differ in their architecture and operating systems. These distributed systems include a large quantity and great diversity of resources which may not be fully utilized without the means to migrate processes to the idle resources. In this paper, we present a graph model for single process migration which can be used for load balancing as well as other non-traditional scenarios such as migration during the graceful degradation of a host. The graph model provides the basis for a …

Measurement Of The D*± Cross Section In Two Photon Collisions At Lep, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The inclusive production of D∗± mesons in photon-photon collisions has been measured by the Aleph experiment at LEP with a beam energy of 45 GeV. The D∗+ are detected in their decay to D0π+ with the D0 observed in three separate decay modes: (1) K−π+, (2) K−π+π0 and (3) K−π+π−π+, and analagously for the D∗− modes. A total of 33 events was observed from an integrated luminosity of 73 pb−1 which corresponds to a cross section for Σ(e+e−→ e+e−D∗±X) of 155 ± 33 ± 21 pb. This result is compatible with both the direct production γγ → cc in the …