Digital Commons Network^™

Qos And Reliability Models For Network Computing, Ladislau Bölöni, Kyung Koo Jun, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein

Dartmouth Scholarship

Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.

Our main contribution is to give approximation algorithms …

Updated Measurement Of The Τ Lepton Lifetime, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A new measurement of the mean lifetime of the τ lepton is presented. Three different analysis methods are applied to a sample of 90000 τ pairs, collected in 1993 and 1994 with the ALEPH detector at LEP. The average of this measurement and those previously published by ALEPH is ττ = 290.1±1.5±1.1fs.

Searches For Scalar Top And Scalar Bottom Quarks At Lep2, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Searches for scalar top and bottom quarks have been performed with data collected by the ALEPH detector at LEP. The data sample consists of 21.7 pb−1 taken at √ s = 161, 170, and 172 GeV and 5.7 pb−1 taken at √ s = 130 and 136 GeV. No evidence for scalar top quarks or scalar bottom quarks was found in the channels ˜t → cχ, ˜t → bℓν˜, and b˜ → bχ. For the channel ˜t → cχ a limit of 67 GeV/c 2 has been set on the scalar top quark mass, independent of the mixing angle between …

Tertiary Storage In Multimedia Systems: Staging Or Direct Access?, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Multimedia applications that are required to manipulate large collections of objects are becoming increasingly common. Moreover, the size of multimedia objects, which are already huge, are getting even bigger as the resolution of output devices improve. As a result, many multimedia storage systems are not likely to be able to keep all of their objects disk-resident. Instead, a majority of the less popular objects have to be off-loaded to tertiary storage to keep costs down. The speed at which objects can be accessed from tertiary storage is thus an important consideration. In this paper, we propose an adaptive data retrieval …

Simulation Study Of Learning Automata Games In Automated Highway Systems, Cem Unsal, Pushkin Kachroo, John S. Bay

Electrical & Computer Engineering Faculty Research

One of the most important issues in Automated Highway System (AHS) deployment is intelligent vehicle control. While the technology to safely maneuver vehicles exists, the problem of making intelligent decisions to improve a single vehicle’s travel time and safety while optimizing the overall traffic flow is still a stumbling block. We propose an artificial intelligence technique called stochastic learning automata to design an intelligent vehicle path controller. Using the information obtained by on-board sensors and local communication modules, two automata are capable of learning the best possible (lateral and longitudinal) actions to avoid collisions. This learning method is capable of …

An Integrated Environment For Problem Solving And Program Development, Fadi Pierre Deek

Dissertations

A framework for an integrated problem solving and program development environment that addresses the needs of students learning programming is proposed. Several objectives have been accomplished: defining the tasks required for program development and a literature review to determine the actual difficulties involved in learning those tasks. A comprehensive Study of environments and tools developed to support the learning of problem solving and programming was then performed, covering programming environments, debugging aids, intelligent tutoring systems, and intelligent programming environments. This was followed by a careful analysis and critique of these systems, which uncovered the limitations that have prevented them from …

Interactive And Batch Creation Of Oodb Medical Vocabularies, Muhammad Arif

Theses

Controlled vocabularies are becoming popular for knowledge representation and querying. They are particularly helpful in the medical field since they can unify disparate terminologies and provide information in a compact, comprehensible manner. In this thesis, we present a mechanism to create OODB controlled medical vocabularies from flat-file format. We also describe a tool by which a user can interactively create, edit and browse the vocabulary. For better understanding of the structure of the vocabulary we designed our interface as a graphical editor and browser. The user of this interface will typically be a medical expert who either wants to add …

Structured Document Comparison And Scientific Data Mining On The World Wide Web, Philip B. Johnson

Theses

The usefulness and accessibility of programs and systems have become important issues for users and researchers alike. A program's usefulness can lw measured by the frequency with which it is used. From the author's or maintainer's point of view, the frequency of usage can be determined by how often a request for the software is received. In the past, a user became aware of a particular tool through various means, and contacted the author or maintainer to obtain a copy of it. This presented difficulties, ranging from language barriers to machine incompatibilities to control of the use of the program. …

Testing Statistical Significance In Sequence Classification Algorithms, Tom Tien-Hua Shih

Theses

Multiple sequence alignment has proven to be a successful method of representing and organizing of protein sequence data. It is crucial to medical researches on the structure and function of proteins.

There have been numerous tools published on how to abstract meaningful relationship from an unknown sequence and a set of known sequences. One study used a method for discovering active motifs in a set of related protein sequences. These are meaningful knowledge abstracted from the known protein database since most protein families are characterized by multiple local motifs. Another study abstracts knowledge regarding the input sequence using a preconstructed …

Analysis Of The Protocol For The Handover In A Micro-Cell Packet Switched Mobile Network, Anna M. Thomas

Theses

The overlay of microcells over macrocells offers new opportunities and is cost effective, which makes the handover in such a micro-cellular environment an important issue. The objective of this study is to analyze and prove the truthfulness of a new protocol proposed, which guarantees no packet loss during the handoff. The study here emphasizes on the data integrity issue, since it is the key factor affecting the throughput performance of the transport layer. It is shown that usage of the Internet Protocol leads to packet loss in the presence of handover. Simulation results reveal that the proposed new protocol preserves …

Algorithms And Tools For Splicing Junction Donor Recognition In Genomic Dna Sequences, Maisheng Yin

Theses

The consensus sequences at splicing junctions in genomic DNA are required for pre-mRNA breaking and rejoining which must be carried out precisely. Programs currently available for identification or prediction of transcribed sequences from within genomic DNA are far from being powerful enough to elucidate genomic structure completely[4]. In this research, we develop a degenerate pattern match algorithm for 5' splicing site (Donor Site) recognition.. Using the Motif models we developed, we can mine out the degenerate pattern information from the consensus splicing junction sequences. Our experimental results show that, this algorithm can correctly recognize 93% of the total donor sites …

Materialized View Algorithms, Yubo Fan

Dissertations and Theses

A data warehouse is a stand-alone repository of integrated information available for decision support OLAP querying and analysis. Aggregate views can be materialized (stored in disk) to improve query performance in a data warehouse.

Several static and dynamic algorithms for selecting materialized aggregate views (MA V) in a data warehouse are proposed in this thesis. The algorithms are then compared by running a simulation system, which can be configured to compare several algorithms on different type of data warehouses. Simulation results for static algorithms are presented to show that several proposed algorithms perform close to an existing good algorithm (HRU …

The Impact Of Multimedia Training On Mental Models Of Simple Processes, Johnny L. Washington, Erika Rogers

Computer Science and Software Engineering

The purpose of this paper is to describe work in progress on a project which is designed to study how multimedia training may impact people’s mental models of sample processes. A tutorial is under development which helps people learn how to construct an abstract model of the steps needed to produce a letter on a typewriter, and how to change this model when the task moues to a computerized setting. Subjects have been recruited to participate in this study, and the current status of the project is discussed.

Outbreak Agent: Intelligent Wearable Technology For Hazardous Environments, Erika Rogers, Robin R. Murphy, Chris Thompson

Computer Science and Software Engineering

The topic of this paper is a project to design an intelligent agent which supports humans in the domain of hazardous site investigation. This software agent will be integrated into wearable technology which is embedded in the protective clothing worn by the humans. An overview of some of the design issues is presented, with a particular emphasis on the visual problem solving component.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 8, October 1997, 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.

Data Mining, Yongjian Fu

Computer Science Faculty Research & Creative Works

Data mining is the process of identifying interesting patterns from large databases. It is the core part of the knowledge discovery in database (KDD) process. Tasks in data mining are classified into summarization, classification, clustering, association and trend analysis. Data mining techniques are adopted from many research areas including statistics, machine learning, database systems, neural networks, rough sets and visualization. The techniques have been applied successfully in many areas from business to science to sports.

Computing Dense Clusters On-Line For Information Organization, Javed Aslam, Katya Pelekhov, Daniela Rus

Computer Science Technical Reports

We present and analyze the off-line star algorithm for clustering static information systems and the on-line star algorithm for clustering dynamic information systems. These algorithms partition a document collection into a number of clusters that is naturally induced by the collection. We show a lower bound on the accuracy of the clusters produced by these algorithms. We use the random graph model to show that both star algorithms produce correct clusters in time Theta(V + E). Finally, we provide data from extensive experiments.

Approximating Disjoint-Path Problems Using Greedy Algorithms And Packing Integer Programs, Stavros G. Kolliopoulos, Clifford Stein

Computer Science Technical Reports

In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T}$ of connection requests. Every connection request in ${\cal T}$ is a vertex pair $(s_i,t_i),$ $1 \leq i \leq K.$ The objective is to connect a maximum number of the pairs via edge(vertex)-disjoint paths. The edge-disjoint path problem can be generalized to the multiple-source unsplittable flow problem where connection request $i$ has a demand $\rho_i$ and every edge $e$ a capacity $u_e.$ All these problems are NP-hard and have a multitude of applications in areas such as routing, scheduling and bin packing. Given the hardness …

Velocity Estimation Via A Neural Network Enhanced By Classical Detection Algorithms, Zeki Berk Hamşioğlu

Electrical & Computer Engineering Theses & Dissertations

The goal of this research is to show how to solve a velocity estimation problem using a neural network connected to an array of sensors. Motivated by biological studies involving insect vision, the neural network utilized is a member of a class of shunting neural networks. When an object moves across the face of the sensor array, the neural network's pulse response is first temporally located using classical M-ary detection techniques. Both the deterministic and stochastic cases are considered. Then the network's pulse response is post-processed via an existing velocity estimation algorithm based on a Volterra series model of the …

Formal Specification Of Fragmentation And Reassembly In Ipv6, Ibrahim Sahin

Electrical & Computer Engineering Theses & Dissertations

Development and implementation of a networking standard such as the new Internet Protocol (IPv6) is a very difficult process. Different implementations of the standard must be fully compatible to allow different computers to communicate with each other. However, standards are often ambiguous, frequently a result of providing specifications in the English language. A more formal specification could assist in the design of systems. This thesis demonstrates that capability using the Prototype Verification System (PVS).

In this thesis study, a formal specification for fragmentation and reassembly in IPv6 was created to provide a tool for the standardization of IPv6 using PVS. …

Computational Geometry Column 32, Joseph O'Rourke

Computer Science: Faculty Publications

The proof of Dey's new k-set bound is illustrated.

Selecting An Effective Task-Specific Contact Analysis Algorithm, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Interbase (Kb): A Knowledge-Based Multidatabase System For Data Warehousing, Nick Bassiliades, Ioannis Vlahavas, Ahmed K. Elmagarmid, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Some Theory And Practice Of Greedy Off- Line Textual Substitution, Alberto Apostolico, Stefano Lonardi

Department of Computer Science Technical Reports

No abstract provided.

Purdue-On-Line: A Facility And Distributed Learning Framework To Develop And Deliver Internet Based Education, Elias N. Houstis, Ahmed K. Elmagarmid, Sanjiva Weerawarana, Anthony L. Peiris, Nitesh D. Dhanjani, Gordon L. Coppoc, Abdalfattah Y.M. Nour, Lefteris H. Tsoukalas, Don Jones

Department of Computer Science Technical Reports

No abstract provided.

Smart Video Text: An Intelligent Video Database System, F. Kokkoras, H. Jiang, I. Vlahavas, Ahmed K. Elmagarmid, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Efficient Detection Of Unusual Words, Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi

Department of Computer Science Technical Reports

No abstract provided.

E-Device: An Extensible Knowledge Base System With Multiple Rule Support, Nick Bassiliades, Ioannis Vlahavas, Ahmed Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Search For The Standard Model Higgs Boson In E+E- Collisions At √S = 161, 170 And 172 Gev, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The reaction e+ e ! HZ is used to search for the Standard Model Higgs boson. The data sample consists of integrated luminosities of 10:9 pb1 , 1:1 pb1 , and 9:5 pb1 collected by the ALEPH experiment at LEP during 1996, at centre-of-mass energies of 161, 170 and 172 GeV, respectively. No candidate events were found, in agreement with the expected background of 0.84 events from all Standard Model processes. This search results in a 95% C.L. lower limit on the Higgs boson mass of 69:4 GeV=c2 . When combined with earlier ALEPH searches performed at energies at and …