Digital Commons Network^™

The Topology Dependence Of Charged Particle Multiplicities In Three-Jet Events, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A study of individual jet and whole-event charged particle multiplicities in three-jet events measured in e + e − annihilation at the Z reveals a significant topology dependence. Mean jet multiplicities are inadequately described by jet energies; interjet angles must also be specified. Quantitative tests suggest that it is necessary to use transversemomentum- like scales to describe the data.

Managing World Wide Web Publications, Schubert Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World Wide Web (WWW), with its potential commercial payoff, has resulted in an explosion of information as organizations join in the fray to publish and do business on the Internet. In addition, Intranet, the private corporate WWW‐based network, has also emerged to provide cost‐effective and efficient groupware and information management solutions for organizations. As a result, the HyperText Markup Language used for constructing WWW documents has become a contender for authoring future office documents. Examines the current practices of WWW publishing and highlights its inadequacies and drawbacks. Demonstrates the need and advantages of using …

Faster Ray Tracing Using Adaptive Grids, Thomas W. Sederberg, Krysztof S. Klimaszewski

Faculty Publications

A new hybrid approach is presented which outperforms the regular grid technique in scenes with highly irregular object distributions by a factor of hundreds, and combined with an area interpolator, by a factor of thousands. Much has been said about scene independence of different acceleration techniques and the alleged superiority of one approach over another. Several theoretical and practical studies conducted in the past have led to the same conclusion: a space partitioning method that allows the fastest rendering of one scene often fails with another. Specialization may be the answer. This has always been pursued, consciously or not, in …

Integrated Queries To Existing Bibliographic And Structured Databases, Ee Peng Lim, Ying Lu

Research Collection School Of Computing and Information Systems

It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw upon different forms of data, including bibliographic, text, multimedia, and structured data. In this paper, the problem of integrating existing public bibliographic databases and structured databases which reside at different locations in the network is addressed. Although bibliographic data is semistructured, its attribute set is often determined by an international standard known as MARC. To unify bibliographic and structured data, the well-known SQL was extended to model bibliographic related attributes and queries. In particular, a new data type was …

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the spectral functions of non-strange τ vector current final states is presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years 1991 to 1994. The spectral functions of the dominant two- and four-pion τ decay channels are compared to published results of e + e - annihilation experiments via isospin rotation. A combined fit of the pion form factor from τ decays and e + e - data is performed using different parametrizations. The mass and the width of the ρ ±(770) and the ρ 0(770) are separately determined in order …

Improved Heterogeneous Distance Functions, Tony R. Martinez, D. Randall Wilson

Faculty Publications

Instance-based learning techniques typically handle continuous and linear input values well, but often do not handle nominal input attributes appropriately. The Value Difference Metric (VDM) was designed to find reasonable distance values between nominal attribute values, but it largely ignores continuous attributes, requiring discretization to map continuous values into nominal values. This paper proposes three new heterogeneous distance functions, called the Heterogeneous Value Difference Metric (HVDM), the Interpolated Value Difference Metric (IVDM), and the Windowed Value Difference Metric (WVDM). These new distance functions are designed to handle applications with nominal attributes, continuous attributes, or both. In experiments on 48 applications …

Measurement Of The Τ Lepton Lifetime With The Three-Dimensional Impact Parameter Method, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A new method is presented for the measurement of the mean lepton lifetime using events in which are pair-produced and both's decay to hadrons.

High-Order Object Model Based Software Analysis, Xiaoqing Frank Liu, Hungwen Lin

Computer Science Faculty Research & Creative Works

The integration of object oriented modeling and structured analysis (SA) for developing a well structured object oriented software system is a challenge for requirements analysts and software designers. Some of the existing object oriented modeling techniques adopt approaches that are very different from SA, and others have clumsily stayed with SA after a few modifications. Our High Order Object Modeling Technique (HOOMT) however, attempts to strike a mean between both extremes while at the same time provides an effective modeling method. HOOMT consists of two models, the High Order Object Model and the Object Information Flow Model. By using the …

Rmesh Algorithms For Parallel String Matching, Hsi-Chieh Lee, Fikret Erçal

Computer Science Faculty Research & Creative Works

String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines, and spelling correction. Especially with the introduction of search engines dealing with tremendous amount of textual information presented on the world wide web and the research on DNA sequencing, this problem deserves special attention and any algorithmic or hardware improvements to speed up the process will benefit these important applications. In this paper, we present three algorithms for string matching on reconfigurable mesh architectures. Given a text T of length n and a pattern P of …

Timestamp-Based Approach For The Detection And Resolution Of Mutual Conflicts In Distributed Systems, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a timestamp based algorithm for the detection of both write-write and read-write conflicts for a single file in distributed systems during network partitions. Our algorithm allows operations to occur in different network partitions simultaneously. When the sites from different partitions merge, the algorithm detects and resolves both read-write and write-write conflicts without taking into account the semantics of the transactions. Once the conflicts have been detected some reconciliation steps for the resolution of conflicts have also been proposed. Our algorithm will be useful in real-time systems where timeliness of operations is more important than response time (delayed commit)

Direct Finite First-Order Model Generation With Negative Constraint Propagation Heuristic, Olga Shumsky, Ralph W. Wilkerson, Fikret Ercal, William W. Mccune

Computer Science Faculty Research & Creative Works

An Automated Finite First-Order Model Generator Has Been Developed. the Problem is Viewed as a First-Order Satisfiability Problem. Most Existing Model Generators Reduce the Problem to Propositional Satisfiability by Converting the Input First-Order Clauses into Propositional Clauses. This Generator, Unlike Others, Stores the Input First-Order Clauses and Solves the Problem Directly. It Uses an Exhaustive Backtracking Algorithm with Weight-Based Splitting. a Negative Constraint Propagation is Implemented to Reduce the Number of Decision Points and Thus to Speed Up the Search. © 1997 ACM.

An Efficient Algorithm For Direct Computation Of Adjacent Block Coefficients In The Transformed Domain, Chaman Sabharwal, Brian Quandt

Computer Science Faculty Research & Creative Works

The current research in many areas of image processing involves operations performed in the compressed domain [Smith and Rowe 1993, Chang 93]. Compressed domain may be DCT, Wavelet, JPEG or MPEG etc. The algorithms for .these transformations may be used for information filtering such as feature extraction and edge detection. The image transformations such as compositing, occluding, and scaling may also be performed in the compressed domain. It is desirable to perform these operations on compressed data directly because the smaller size of data involves less computational complexity. The computation in the compressed domain eliminates the overhead of decoding the …

Low-Degree Graph Partitioning Via Local Search With Applications To Constraint Satisfaction, Max Cut, And Coloring, Magnus M. Halldorsson, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree ∆ that cut at least a k - 1/k (1 + 1/2∆+k-1 ) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a tight analysis of natural local search heuristics for the maximum constraint satisfaction problem. These partitions also imply efficient approximations for several problems on weighted bounded-degree graphs. In particular, we improve the best performance …

A Fast Algorithm For Complete Subcube Recognition, Fikret Erçal, H. J. Burch

Computer Science Faculty Research & Creative Works

The complete subcube recognition problem is defined as, given a collection of available processors on an n-dimensional hypercube, locate a subcube of dimension k that consists entirely of available processors, if one exists. Despite many algorithms proposed so far on this subject, improving the time complexity of this problem remains a challenge. Efficiency limits that can be reached have not been exhausted yet. This paper proposes a novel algorithm to recognize all the overlapping subcubes available on an n-dimensional hypercube whose processors are partially allocated. Given P=2n, as the total number of processors in the hypercube, the new algorithm runs …

Evolutionary Computation Applied To Adaptive Information Filtering, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper, Joost N. Kok

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 the filtering has to adapt too in order to remain effective. Adaptive Information Filtering 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). Weighted trigram analysis is a quick and flexible technique for describing the contents of a document. A novel application …

Keyboardless Visual Programming Using Voice, Handwriting, And Gesture, Jennifer Leopold, A. Ambler

Computer Science Faculty Research & Creative Works

Visual programming languages have facilitated the application development process, improving our ability to express programs, as well as our ability to view, edit and interact with them. Yet even in programming environments, productivity is restricted by the primary input sources: the mouse and the keyboard. As an alternative, we investigate a program development interface which responds to the most natural human communication technologies: voice, handwriting and gesture. Speech- and pen-based systems have yet to find broad acceptance in everyday life because they are insufficiently advantageous to overcome problems with reliability. However, we believe that a visual programming environment with a …

User Defined Prewrites For Increasing Concurrency In Design Databases, Sanjay Kumar Madria, A. Embong

Computer Science Faculty Research & Creative Works

We introduce a prewrite operation before a write operation is performed on design databases, a database that consists of objects as engineering designs. A prewrite operation does not actually make a design but it only makes available the model of the design that the transaction will produce in future. Once the prewrite design by a transaction is announced, the transaction executes a pre-commit operation. After the pre-commit, read operations can access the prewrite design even before the pre-committed transaction has finally made the design and committed. Therefore, our algorithm increases the potential concurrency as compared to the algorithms that permit …

A Concurrency Control Algorithm For An Open And Safe Nested Transaction Model, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a concurrency control algorithm for an open and safe nested transaction model. We use prewrite operations in our model to increase the concurrency. Prewrite operations are modeled as subtransactions in the nested transaction tree. The subtransaction which initiates prewrite subtransactions are modelled as recovery point subtransaction. The recovery point subtransaction can release their locks before its ancestors commit. Thus, our model increases the concurrency in comparison to other nested transaction models. Our model is useful an environment of long-running transactions common in object oriented databases, computer aided design and in the software development process

Improved Measurement Of The Bd0 -B̄D0 Oscillation Frequency, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The time dependence of B0 d {B 0 d oscillations is measured by the ALEPH experiment at LEP, using three techniques, two of which are updates of previous measurements. In all cases the charge of the decaying b quark and its decay time are measured in one hemisphere of the event; the quark charge at production is tagged mainly using the opposite hemisphere. The first method uses the charge correlation between a D and a lepton in the opposite hemisphere; if no lepton is present, the produced quark charge is determined from the hemisphere charges. In the second method, the …

Production Of Orbitally Excited Charm Mesons In Semileptonic B Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A sample of 3.6 million hadronic Z decays recorded between 1991 and 1995 with the ALEPH detector at LEP is used to investigate semileptonic decays of B mesons into final states involving orbitally excited charm mesons. Topological vertex criteria are used to search for decays involving narrow D** states as well as wide D** resonances and non-resonant D(*)π final states. The sum of the branching ratios for these processes is measured to be ${⤪ Br}({⩈erline {⤪ B}}⌝ghtarrow {⤪ D}≪ ⫑l^{-}{⩈erline v}) + {⤪ Br}({⩈erline {⤪ B}}⌝ghtarrow {⤪ D}^{⇒t}≪ ⫑l^{-}{⩈erline v})↦op =(2.26 pm 0.29({⤪ stat}) pm 0.33({⤪ syst}))%,$which accounts for a …

A Hypermedia Database To Manage World-Wide-Web Documents, Schubert Shou Boon Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World-Wide-Web (WWW) with its potential commercial payoff has resulted in an explosion of information as organisations join in to publish and do business on the Internet. A related development, Intranet, which basically uses the same technology to build private corporate WWW-based networks, has emerged to provide cost-effective and efficient groupware and information management solutions for organisations. As a result, the Hyper Text Markup Language (HTML), used for constructing WWW documents, has become a contender for authoring future office documents. With this scenario, this study examines WWW practices and highlights the inadequacy and drawbacks of …

On Asymptotics Of Certain Recurrences Arising In Multi-Alphabet Universal Coding, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Export Database Derivation Approach For Supporting Object-Oriented Wrapper Queries, Ee Peng Lim, Hon-Kuan Lee

Research Collection School Of Computing and Information Systems

Wrappers export the schema and data of existing heterogeneous databases and support queries on them. In the context of cooperative information systems, we present a flexible approach to specify the derivation of object-oriented (OO) export databases from local relational databases. Our export database derivation consists of a set of extent derivation structures (EDS) which defines the extent and deep extent of export classes. Having well-defined semantics, the EDS can be readily used in transforming wrapper queries to local queries. Based on the EDS, we developed a wrapper query evaluation strategy which handles OO queries on the export databases. The strategy …

Efficient Parallel Algorithms On Reconfigurable Mesh Architectures, His-Chieh Lee, Fikret Ercal

Computer Science Technical Reports

This dissertation describes a number of novel parallel algorithms for solving maze-routing problems and string matching problems on a proposed reconfigurable mesh architecture.

Section I reviews the field of reconfigurable parallel computing. This includes an introduction to a number of reconfigurable architectures proposed in the literature and a list of references to the current literature on algorithms in the field of reconfigurable computing.

Section II presents a number of time-efficient algorithms to solve the mazerouting problem. Maze-routing algorithms are used in VLSI routing and robot path planning. In that section, definitions for absolute shortest path (ASP), shortest duplex-path (SDP), shortest …

Parallel Fast Multipole Algorithms For N-Body Simulations, Jui-Lin Lu, Daniel Okunbor

Computer Science Technical Reports

The computer simulation of N-Body problems has a wide range of applications. It is known that simulations can take years to complete. This can be greatly improved by using efficient algorithms in force calculations and in applying the computing power of parallel computers to the problem. A tremendous amount of work has been devoted to parallelization of the fast multipole algorithm (FMA) which is one of the fastest algorithms in force calculations. However, most parallel implementations target a specific machine. We developed an efficient communication scheme for parallel FMA in a message passing environment and implemented it by using Message …

Utilizing Bayesian Techniques For User Interface Intelligence, Robert A. Harrington

Theses and Dissertations

The purpose of this research is to study the injection of an intelligent agent into modern user interface technology. This agent is intended to manage the complex interactions between the software system and the user, thus making the complexities transparent to the user. The background study will show that while interesting and promising research exists in the domain of intelligent interface agents, very little research has been published that indicates true success in representing the uncertainty involved in predicting user intent. The interface agent architecture presented in this thesis will offer one solution for solving the problem using a newly …

Implementation Of An Ada95 Crosscompiler For The Real-Time Executive For Military Systems (Rtems), Kendall M. Lemley Jr.

Theses and Dissertations

This thesis represents a continuation of the assessment of the Unified Telerobotics Architecture Project (UTAP), a proposed Air Force standard. This architecture was developed by the NASA Jet Propulsion Laboratory and the National Institute of Standards under contract to the Air Force Materiel Command Robotics and Automation Center of Excellence at Kelly AFB, Texas. Due to operating system constraints, the only UTAP implementation to date has required a separate software interface layer, adding complexity and overhead to the overall system, while reducing portability. This thesis proposes a long term effort to design and implement UTAP-compliant application software devoid of this …

Master Of Science In Computing Technology In Education 1996, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Four-Fermion Production In E+E- Collisions At Centre-Of-Mass Energies Of 130 And 136 Gev, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Four-fermion events have been selected in a data sample of 5.8 pb−1 collected with the aleph detector at centre-of-mass energies of 130 and 136 GeV. The final states ℓ+ℓ−qq, ℓ+ℓ−ℓ+ℓ−, ννqq, and ννℓ+ℓ− have been examined. Five events are observed in the data, in agreement with the Standard Model predictions of 6.67±0.38 events from four-fermion processes and 0.14−0.05+0.19 from background processes.

Effective And Appropriate Use Of Controlled Experimentation In Software Development Research, Mark Alan Johnson

Dissertations and Theses

Although there is a large body of research and publication on software development, only a limited amount of this work includes empirical demonstration of its effectiveness. Yet, it is this empirical understanding which will help move software development from a craft to an engineering discipline. Of the empirical methods for research, controlled experiments are the most commonly thought of in scientific studies, and yet the least used to study software development.

This thesis begins with a brief review of the different empirical methods commonly used to study software development. This review provides a quick introduction to each empirical method, compares …