Physical Sciences and Mathematics Commons^™

Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this papel; we investigate video shots retrieval based on the analysis of temporal slice images. Temporal slices are a set of2D images extracted along the time dimension of image sequences. They encode rich set of motion clues for shot similarity measure. Because motion is depicted as texture orientation in temporal slices, we utilize various texture features such as tensor histogram, Gabor feature, and the statistical feature of co-occurrence matrix extracted directly from slices for motion description and retrieval. In this way, motion retrieval can be treated in a similar way as texture retrieval problem. Experimental results indicate that the …

A Performance Study Of Lam And Mpich On An Smp Cluster, Brian Patrick Kearns

Dissertations and Theses

Many universities and research laboratories have developed low cost clusters, built from Commodity-Off-The-Shelf (COTS) components and running mostly free software. Research has shown that these types of systems are well-equipped to handle many problems requiring parallel processing. The primary components of clusters are hardware, networking, and system software. An important system software consideration for clusters is the choice of the message passing library.

MPI (Message Passing Interface) has arguably become the most widely used message passing library on clusters and other parallel architectures, due in part to its existence as a standard. As a standard, MPI is open for anyone …

A Soap-Oriented Component-Based Framework Supporting Device-Independent Multimedia Web Services, Jia Zhang, Jen-Yao Chung

Jia Zhang

No abstract provided.

Supervisory Control And Data Acquisition (Scada) Systems, George H. Baker, Allan Berg

George H Baker

Our critical national infrastructure systems have become almost universally dependent upon computer-based control systems technically referred to as supervisory control and data acquisition (SCADA) systems. SCADA systems evolved from the telemetry and event-alarm systems developed in the early days of utilities. With the widespread use of SCADA systems, computers have become the "basis element" for much of our critical infrastructure. Thus, the disruption of controlling computer terminals and networks due to natural disasters, electric power failure, accidents or malicious activity can have catastrophic consequences.

Proofs Of Soundness And Strong Normalization For Linear Memory Types, Heng Huang, Chris Hawblitzel

Computer Science Technical Reports

Efficient low-level systems need more control over memory than safe high-level languages usually provide. As a result, run-time systems are typically written in unsafe languages such as C. This report describes an abstract machine designed to give type-safe code more control over memory. It includes complete definitions and proofs.

Oral History Interview With Laszlo A. Belady, Philip L. Frana

Philip L Frana

Belady discusses his early life and education in Hungary, escape to West Germany during the 1956 revolution, and work as a draftsman at Ford Motor Company in Cologne and as an aerodynamics engineer at Dassault in Paris. Belady covers his 1961 immigration into the United States, where he joined International Business Machines and did early work in operating systems, virtual machine architectures, program behavior modeling, memory management, computer graphics, Asian character sets, and data security. He also ...

Exact Formulae For The Lovasz Theta Function Of Sparse Circulant Graphs, Valentino Crespi

Computer Science Technical Reports

The Lovasz theta function has attracted a lot of attention for its connection with diverse issues, such as communicating without errors and computing large cliques in graphs. Indeed this function enjoys the remarkable property of being computable in polynomial time, despite being sandwitched between clique and chromatic number, two well known hard to compute quantities. In this paper I provide a closed formula for the Lovasz function of a specific class of sparse circulant graphs thus generalizing Lovasz results on cycle graphs (circulant graphs of degree 2).

Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 8/16/02- 11/15/02, Yitung Chen, Randy Clarksean, Darrell Pepper

Separations Campaign (TRP)

Two activities are proposed in this Phase I task: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model is the start of an integrated approach to the analysis of the materials separations associated with the AAA Program. A second portion of the project is to streamline and improve an integral part of the overall systems model, which is the software package AMUSE. AMUSE analyzes the UREX process and other related solvent extraction processes and defines many of the process streams that are integral …

Measuring Packet Reordering, John M. Bellardo, Stefan Savage

Computer Science and Software Engineering

The Internet architecture provides an unsequenced datagram delivery service. Nevertheless, many higher-layer protocols, such as TCP, assume that packets are usually delivered in sequence, and consequently suffer significant degradation when packets are reordered in flight. While there have been several recent proposals to create protocols that adapt to reordering, evaluating their effectiveness requires understanding the dynamics of the reordering processes prevalent in the Internet. Unfortunately, Internet packet sequencing is a poorly characterized and understudied behavior. This failing can be largely attributed to the lack of accurate and universally applicable methods for measuring packet reordering. In this paper, we describe a …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 2, November 2002, 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.

Design And Implementation Of Interactive Tutorials For Data Structures, Ross Gore, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

The Tutorial Generation Toolkit (TGT) is a set of Java classes that supports authoring of interactive tutorial applications. This paper describes extensions to the capabilities of the TGT and several new tutorials aimed at the Data Structures course which were built using the toolkit.

Evaluating Probabilistic Queries Over Imprecise Data, Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabhakar

Department of Computer Science Technical Reports

No abstract provided.

Modeling The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo

Faculty Publications

To support IP multicast, domains must assign a unique multicast address to each application from a limited, globally-shared address space. We examine the performance of several classes of address allocation algorithms withln the context of the MASC architecture. This study is the first of its kind to model the generalized multicast address allocation problem and consider non-contiguous allocation algorithms. We find that prefix-based allocation outperforms our non-contiguous algorithm, despite the apparent advantages of non-contiguous allocation. We also verify the benefits of using worst-fit for new allocations.

Web Classification Using Support Vector Machine, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In web classification, web pages from one or more web sites are assigned to pre-defined categories according to their content. Since web pages are more than just plain text documents, web classification methods have to consider using other context features of web pages, such as hyperlinks and HTML tags. In this paper, we propose the use of Support Vector Machine (SVM) classifiers to classify web pages using both their text and context feature sets. We have experimented our web classification method on the WebKB data set. Compared with earlier Foil-Pilfs method on the same data set, our method has been …

A Pseudo Nearest-Neighbor Approach For Missing Data Recovery On Gaussian Random Data Sets, Xiaolu Huang, Qiuming Zhu

Computer Science Faculty Publications

Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false results. In this paper, we study the effect of a missing data recovery method, namely the pseudo- nearest neighbor substitution approach, on Gaussian distributed data sets that represent typical cases in data discrimination and data mining applications. The error rate of the proposed recovery method is evaluated by comparing the clustering results of the recovered data sets to the clustering results obtained on the originally complete data sets. The results are also compared with …

A Theoretical Framework For The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo, Timothy Singer

Faculty Publications

The multicast address allocation problem requires Internet domains to allocate unique addresses to multicast applications from a globally-shared space. We develop a theoretical framework for multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the address allocation problem and describe several new allocation algorithms that use a hypercube model for address representation.

The Capacity Of Multi-Hop Wireless Networks With Tcp Regulated Traffic, Sorav Bansal, Rajeev Shorey, Shobhit Chugh, Anurag Goel, Kapil Kumar, Archan Misra

Research Collection School Of Computing and Information Systems

We study the dependence of the capacity of multi-hop wireless networks on the transmission range of nodes in the network with TCP regulated traffic. Specifically, we examine the sensitivity of the capacity to the speed of the nodes and the number of TCP connections in an ad hoc network. By incorporating the notion of a minimal acceptable QoS metric (loss) for an individual session, we argue that the QoS-aware capacity is a more accurate model of the TCP-centric capacity of an ad-hoc network. We study the dependence of capacity on the source application (Telnet or FTP) and on the choice …

Predicting Bottleneck Bandwidth Sharing By Generalized Tcp Flows, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each …

Defending Against Redirect Attacks In Mobile Ip, Robert H. Deng, Jianying Zhou, Feng Bao

Research Collection School Of Computing and Information Systems

The route optimization operation in Mobile IP Version 6 (MIPv6) allows direct routing from any correspondent node to any mobile node and thus eliminates the problem of "triangle routing" present in the base Mobile IP Version 4 (MIPv4) protocol. Route optimization, however, requires that a mobile node constantly inform its correspondent nodes about its new care-of addresses by sending them binding update messages. Unauthenticated or malicious binding updates open the door for intruders to perform redirect attacks, i.e., malicious acts which redirect traffic from correspondent nodes to locations chosen by intruders. How to protect binding update messages to defend against …

Mining Of Correlated Rules In Genome Sequences, L. Lin, L. Wong, Tze-Yun Leong, P. S. Lai

Research Collection School Of Computing and Information Systems

With the huge amount of data collected by scientists in the molecular genetics community in recent years, there exists a need to develop some novel algorithms based on existing data mining techniques to discover useful information from genome databases. We propose an algorithm that integrates the statistical method, association rule mining, and classification rule mining in the discovery of allelic combinations of genes that are peculiar to certain phenotypes of diseased patients.

A Visual Tool For Building Logical Data Models Of Websites, Zehua Liu, Wee-Keong Ng, Feifei Li, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Information sources over the WWW contain a large amount of data organized according to different interests and values. Thus, it is important that facilities are there to enable users to extract information of interest in a simple and effective manner. To do this, We propose the Wiccap Data Model, an XML data model that maps Web information sources into commonly perceived logical models, so that information can be extracted automatically according to users' interests. To accelerate the creation of data models, we have implemented a visual tool, called the Mapping Wizard, to facilitate and automate the process of producing Wiccap …

Knowledge Discovery From Texts: A Concept Frame Graph Approach, Kanagasabai Rajaraman, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

We address the text content mining problem through a concept based framework by constructing a conceptual knowledge base and discovering knowledge therefrom. Defining a novel representation called the Concept Frame Graph (CFG), we propose a learning algorithm for constructing a CFG knowledge base from text documents. An interactive concept map visualization technique is presented for user-guided knowledge discovery from the knowledge base. Through experimental studies on real life documents, we observe that the proposed approach is promising for mining deeper knowledge.

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this paper, we present a new framework to automatically group similar shots into one scene, where a scene is generally referred to as a group of shots taken place in the same site. Two major components in this framework are based on the motion characterization and background segmentation. The former component leads to an effective video representation scheme by adaptively selecting and forming keyframes. The later is considered novel in that background reconstruction is incorporated into the detection of scene change. These two components, combined with the color histogram intersection, establish our basic concept on assessing the similarity of …

Horizon Occlusion Culling For Real-Time Rendering Of Hierarchical Terrains, Parris K. Egbert, Brandon Lloyd

Faculty Publications

We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional storage, yet leads to 2-4 times improvement in framerate for views with high degrees of occlusion. Our method is based on the well-known occlusion horizon algorithm. We show how to adapt the algorithm for use with hierarchical terrains. The occlusion horizon is constructed as the terrain is traversed in an approximate front to back ordering. Regions of the terrain are compared to the horizon to determine when they are completely occluded from the viewpoint. Culling …

Toward Dynamic Interoperability Of Mobile Agent Systems, Arne Grimstrup, Robert Gray, David Kotz, Maggie Breedy, Marco Carvalho, Thomas Cowin, Daria Chacon, Joyce Barton, Chris Garrett, Martin Hofmann

Dartmouth Scholarship

Mobile agents are an increasingly popular paradigm and in recent years there has been a proliferation of mobile-agent systems. These systems are, however, largely incompatible with each other. In particular, agents cannot migrate to a host that runs a different mobile-agent system. Prior approaches to interoperability have tried to force agents to use a common API and so far none have succeeded. This goal led to our efforts to develop mechanisms that support dynamic runtime interoperability of mobile-agent systems. This paper describes the \em Grid Mobile-Agent System, which allows agents to migrate to different mobile-agent systems.

Oral History Interview With Stephen Cook, Philip L. Frana

Philip L Frana

Cook recounts his early interest in electronics and association with electronic cardiac pacemaker inventor Wilson Greatbatch, and his education at the University of Michigan and Harvard University. He describes his first position as an assistant professor of mathematics at the University of California, Berkeley, and his growing interest in problems of computational complexity preceding an influential 1971 presentation on “The Complexity of Theorem Proving Procedures” at the ACM SIGACT Symposium on the Theory of ...

Biodiversity And Ecosystem Informatics - Bdei - Planning Workshop On Biodiversity And Ecosystem Informatics For The Indian River Lagoon, Florida, Mohamad T. Musavi

University of Maine Office of Research Administration: Grant Reports

This proposal solicits funding to organize and conduct a planning workshop that will establish and facilitate research on the informatics needed to address complex issues of biodiversity and ecosystem processes within the Indian River Lagoon. This workshop will provide the opportunity and resources for collaboration and discussion among scientists from diverse fields of biodiversity, ecological sciences, remote sensing, geographic information systems, computer science and intelligent systems. The topics to be discussed will include investigation of novel computational intelligence techniques for modeling, prediction, analysis and database management of the disparate and complex data for the Indian River Lagoon. The explicit products …

Rf Rendez-Blue: Reducing Power And Inquiry Costs In Bluetooth-Enabled Mobile Systems, Eric S. Hall, Charles D. Knutson, David K. Vawdrey

Faculty Publications

In resource-limited mobile computing devices, Bluetooth wireless technology imposes a weighty burden due to inefficient power utilization and a sluggish device discovery process. Buttressing Bluetooth with Radio Frequency Identification (RFID) technology by performing an operation we call “Rendez-Blue” alleviates these limitations. In the Rendez-Blue process, an RFID signal is used as a cue to “wake-up” a sleeping Bluetooth radio. This ensures that the Bluetooth radio is active only when needed, significantly reducing power consumption. In addition, RFID is used to communicate Bluetooth device information, allowing the user to bypass the traditional 10.24-second discovery process.

Kinematic Path-Planning For Formations Of Mobile Robots With A Nonholonomic Constraint, Timothy D. Barfoot, Christopher M. Clark, Stephen M. Rock, Gabriele M.T. D'Eleuterio

Computer Science and Software Engineering

A method of planning paths for formations of mobile robots with nonholonomic constraints is presented. The kinematics equations presented in this paper allow a general geometrical formation of mobile robots to be maintained while the group as a whole travels an arbitrary path. It is possible to represent a formation of mobile robots by a single entity with the same type of nonholonomic constraint as the individual members. Thus, any path-planner or control method may be used with the formation as would be applied to an individual robot. Equations are developed for changing the geometrical formation and hardware results are …

Sensor-Assisted Video Mapping Of The Seafloor, Yuri Rzhanov, Lloyd C. Huff, Randy G. Cutter Jr., Larry A. Mayer

Center for Coastal and Ocean Mapping

In recent years video surveys have become an increasingly important ground-truthing of acousticseafloor characterization and benthic habitat mapping studies. However, the ground-truthing and detailed characterization provided by video are still typically done using sparse sample imagery supplemented by physical samples. Combining single video frames in a seamless mosaic can provide a tool by which imagery has significant areal coverage, while at the same time showing small fauna and biological features at mm resolution. The generation of such a mosaic is a challenging task due to height variations of the imaged terrain and decimeter scale knowledge of camera position. This paper …