Digital Commons Network^™

Strange B Baryon Production And Lifetime In Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

In a data sample of approximately four million hadronic Z decays recorded with the ALEPH detector from 1990 to 1995, a search for the strange b baryon Ξb is performed with a study of Ξ-lepton correlations. Forty-four events with same sign Ξ−ℓ− combinations are found whereas 8.4 are expected based on the rate of opposite sign Ξ−ℓ+ combinations. This significant excess is interpreted as evidence for Ξb semileptonic decays. The measured product branching ratio is Br(b → Ξb) × Br(Ξb→ XcXℓ−νℓ) × Br(Xc→ Ξ−X′) = (5.4±1.1(stat) ± 0.8(syst)) × 10−4 per lepton species, averaged over electrons and muons, with Xc …

An On-The-Fly Decoding Technique For Reed-Solomon Codes, Yuan Xing Lee, Robert H. Deng, Eng Hean Koh

Research Collection School Of Computing and Information Systems

An on-the-fly error correction technique for double-byte-error-correction (DBEC) and triple-byte-error-detection (TBED) Reed-Solomon (RS) codes is presented in this paper. This new algorithm finds number of byte-errors (single byte-error, double-byte errors, and triple-byte errors) by simply testing the values of a few syndrome functions, and locates and corrects the byte-errors directly without using the standard iterative algorithms for finding the error location polynomial. More importantly, it neither suffers from malfunctions incurred in Deng-Costello algorithm (1987), nor requires syndrome re-calculation as in Koksal-Yucel's modification (1992). It is also much more simpler and faster than the original Deng-Costello algorithm. It has found applications …

Ua12/2/1 College Heights Herald, Vol. 72, No. 4, Wku Student Affairs

WKU Administration Documents

WKU campus newspaper reporting campus, athletic and Bowling Green, Kentucky news.

Regular features include:

• Just a Second
• Campus Line
• For the Record / Crime Reports
• People Poll
• Sports
• Diversions
• Movie Reviews
• Classifieds

Articles in this issue:

• Lucas, Fred. Parties Seeking Identity – U.S. Presidential Campaign
• Stamper, John. Tobacco Road – A Journey to the Harvest
• Leonard, Kim. Kristen Miller Makes Plan to Drive Party-Goers Home
• Leonard, Kim. Student Government Association Gives More Money to Campus Clubs
• Night Owls Can Now Flock to the Library
• Bradley, Ryan. Commentary Didn’t Have Facts Straight
• Esposito, Mike. Voters Offered Two Major Differences
• Howard, Jake. …

Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time solutions to all three problems. Such results are implausible if the placement of terminals is entirely unrestricted; in fact, the size of the output for the feasible offset problem may be Ω(n^2). The linear-time …

Greedy Algorithms For The Shortest Common Superstring That Are Asymptotically Optimal, Alan Frieze, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Numerical Methods For Derivative Securities Models, Konstantinos N. Pantazopoulos, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

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

Computer Science Technical Reports

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 …

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …

Measurement Of The Mass Of The Λb Baryon, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

On The Existence Of Schedules That Are Near-Optimal For Both Makespan And Total Weighted Completion Time, Cliff Stein, Joel Wein

Computer Science Technical Reports

We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding variants of this theorem with improved constants, and give some algorithmic consequences of the technique.

Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi

Kno.e.sis Publications

The huge number of autonomous and heterogeneous data repositories accessible on the “global information infrastructure” makes it impossible for users to be aware of the locations structure/organization, query languages and semantics of the data in various repositories. There is a critical need to complement current browsing, navigational and information retrieval techniques with a strategy that focuses on information content and semantics. In any strategy that focuses on information content, the most critical problem is that of different vocabularies used to describe similar information across domains. We discuss a scalable approach for vocabulary sharing. The objects in the repositories are represented …

Elimination Of All-Optical Cycles In Wavelength-Routed Optical Networks, Jason Iness, Byrav Ramamurthy, Biswanath Mukherjee, Krishna Bala

School of Computing: Faculty Publications

A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended …

On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen

Research Collection Lee Kong Chian School Of Business

A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number …

On Mobile Systems And Disconnected Browsing Of Distributed Information, Anupam Joshi, Sanjiva Weerawarana, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Automatic Identification Of Icosahedral Virus Particles In Electron Micrographs, Ioana Maria Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

A Peak Finding Strategy For Multi- Dimensional Scalar Fields With Applications To X-Ray Crystallography, Calin R. Costian, Ioana M. Boier Martin, Dan C. Marinescu, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Study Of The B0sb0s Oscillation Frequency Using D-S ℓ+ Combinations In Z Decays, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

A lower limit on the oscillation frequency of the B s 0 B s 0 system is obtained from approximately four million hadronic Z decays accumulated using the ALEPH detector at LEP from 1991 to 1995. Leptons are combined with opposite sign D s − candidates reconstructed in seven different decay modes as evidence of semileptonic B s 0 decays. Criteria designed to ensure precise proper time reconstruction select 277D s − ℓ + combinations. The initial state of these B s 0 candidates is determined using an algorithm optimized to efficiently utilise the tagging information available for each event. …

Supporting Search For Reusable Software Objects, T. Isakowitz, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Prior research has shown that achieving high levels of software reuse in the presence of repository and object-based computer-aided software engineering (CASE) development methods presents interesting human, managerial and technical challenges. This article presents research that seeks to enhanced software development performance through reuse. We propose automated support for developers who search large repositories for the appropriate reusable software objects. We characterize search for repository objects in terms of a multistage model involving screening, identification, and the subsequent choice between new object construction or reusable object implementation. We propose automated support tools, including ORCA, a software Object Reuse Classification Analyzer, …

Measurement Of Hadron And Lepton-Pair Production From E+E- Annihilation At Centre-Of-Mass Energies Of 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Knowledge Discovering For Document Classification Using Tree Matching In Texpros, Ching-Song Wei

Dissertations

This dissertation describes a knowledge-based system for classifying documents based upon the layout structure and conceptual information extracted from the content of the document. The spatial elements in a document are laid out in rectangular blocks which are represented by nodes in an ordered labelled tree, called the "layout structure tree" (L-S Tree). Each leaf node of a L-S Tree points to its corresponding block content. A knowledge Acquisition Tool (KAT) is devised to create a Document Sample Tree from L-S Tree, in which each of its leaves contains a node content conceptually describing its corresponding block content. Then, applying …

Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan

Dissertations

This dissertation presents a general hypertext model (GHMI) supporting integration of hypertext and information systems through dynamic mapping. Information systems integrated based on this model benefit from hypertext function-alities (such as linking, backtracking, history, guided tours, annotations, etc.) while preserving their own computation capabilities. Although systems supporting integration of hypertext and interface-oriented information systems do exist in hypertext literature, there is no existing model or system effectively supporting integration of hypertext and computation-oriented information systems. GHMI makes its major contributions by both extending and specifying the well-known Dexter Hypertext Reference Model. GHMI extends the Dexter model to overcome its limitations. …

Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu

Dissertations

A recurring problem with high-performance computing is that advanced architectures generally achieve only a small fraction of their peak performance on many portions of real applications sets. The Amdahl's law corollary of this is that such architectures often spend most of their time on tasks (codes/algorithms and the data sets upon which they operate) for which they are unsuited. Heterogeneous Computing (HC) is needed in the mid 90's and beyond due to ever increasing super-speed requirements and the number of projects with these requirements. HC is defined as a special form of parallel and distributed computing that performs computations using …

A Brief Introduction To Formal Methods, Paul E. Black, Kelly M. Hall, Michael D. Jones, Trent N. Larson, Phillip J. Windley

Faculty Publications

As hardware designs grow in size and complexity, current design methods are proving less adequate. Current methods for specification, design, and test are typically empirical or informal, that is, they are based on experience and argument. Formal methods are solidly based on mathematical logic systems and precise rules of inference. Formal methods offer a discipline which complements current methods so designers can successfully meet the demand for high performance systems. Formal methods covers a broad and diverse set of techniques aimed at improving computer correctness. This paper explains the role of specifications and implementation models in formal methods, and different …

Mobile Agents For Mobile Computing, Robert Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko

Computer Science Technical Reports

Mobile agents are programs that can move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents have the potential to provide a convenient, efficient and robust programming paradigm for distributed applications, particularly when partially connected computers are involved. Partially connected computers include mobile computers such as laptops and personal digital assistants as well as modem-connected home computers, all of which are often disconnected from the network. In this paper, we describe the design and implementation of our mobile-agent system, Agent Tcl, …

Probabilistic Analysis Of The Median Rule: Asymptotics And Applications, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

The solution of integer optimization problems by relaxation methods consists of three parts. First, the discrete problem is converted into a continuous optimization problem, which is generally more tractable. Second, the relaxed problem is solved efficiently, yielding a optimal solution in the continuous space. Finally, an assignment procedure is used to map this solution to a "suitable" discrete solution. One heuristic - we call it the relaxation heuristic - that often guides the choice and design of assignment algorithms is: "given a continuous optimal solution, the corresponding integer optimal solution is likely to be nearby" (with respect to some well …

The Use Of Non-Commutative Algebra In Cryptographically Secure Pseudo-Random Number Generators, Brian M. Mckeever

Honors Theses

This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis provides a description of the performance of these generators.

Dartflow: A Workflow Management System On The Web Using Transportable Agents, Ting Cai, Peter A. Gloor, Saurab Nog

Computer Science Technical Reports

Workflow management systems help streamline business processes and increase productivity. This paper describes the design and implementation of the DartFlow workflow management system. DartFlow uses Web-browser embedded Java applets as its front end and transportable agents as the backbone. While Java applets provide a safe and platform independent GUI, the use of transportable agents makes DartFlow highly flexible and scalable. This paper describes the design and implementation of DartFlow, as well as a workflow application that exploits DartFlow's agent-based design.

The Galley Parallel File System, Nils Nieuwejaar, David Kotz

Computer Science Technical Reports

Most current multiprocessor file systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/O requirements of parallel scientific applications. Many multiprocessor file systems provide applications with a conventional Unix-like interface, allowing the application to access multiple disks transparently. This interface conceals the parallelism within the file system, increasing the ease of programmability, but making it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. In addition to providing an insufficient interface, most current multiprocessor file systems are optimized for a different …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 5, May 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Dynamic Scheduling Of Process Groups, Kuei Yu Wang, Dan C. Marinescu, Octavian F. Carbunar

Department of Computer Science Technical Reports

No abstract provided.