Digital Commons Network^™

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 …

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 …

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.

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.

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 …

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 …

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 …

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 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 …

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.

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 …

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.

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.

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 …

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.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 1, October 2002, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou

Faculty Publications

Quality of Service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.

Mobile Information Systems – Research Directions On The Conceptual And Logical Level, J. Krogstie, K. Lyytinen, A. Opdahl, B. Pernici, Keng Siau, K. Smolander

Research Collection School Of Computing and Information Systems

This paper discusses new challenges and possible approaches for developing and evolving mobile information systems, with focus on model-based approaches on the conceptual and logical level. We have experienced these new challenges through several research and industrial projects on mobile solutions, usability and model-based approaches over the last years. We summarize the main challenges on how model-based approaches can support the development of mobile information systems that are to be used together with other types of systems, primarily in a professional setting and indicate upcoming research issues in this very dynamic area. We argue that this research area is also …

Cache Invalidation And Replacement Strategies For Location-Dependent Data In Mobile Environments, Baihua Zheng, Jianliang Xu, Dik Lun Lee

Research Collection School Of Computing and Information Systems

Mobile location-dependent information services (LDISs) have become increasingly popular in recent years. However, data caching strategies for LDISs have thus far received little attention. In this paper, we study the issues of cache invalidation and cache replacement for location-dependent data under a geometric location model. We introduce a new performance criterion, called caching efficiency, and propose a generic method for location-dependent cache invalidation strategies. In addition, two cache replacement policies, PA and PAID, are proposed. Unlike the conventional replacement policies, PA and PAID take into consideration the valid scope area of a data value. We conduct a series of simulation …

Bluetooth: An Emerging Technology For Wireless Personal Area Networks, Eric S. Hall, Charles D. Knutson, David K. Vawdrey

Faculty Publications

Look under your desk or behind your computer. See that rat’s nest of wires and cables? Almost every cable or wire that tethers us to our devices (or our devices to one another) is unnecessary. Bluetooth wireless technology promises to reduce the cabling chaos that afflicts us all. Bluetooth is a recently developed technology that uses radio frequency (RF) transceivers to provide point-to-multipoint wireless connectivity within a personal space. Bluetooth was designed for both voice and data communication at low per-unit costs while consuming little power. To achieve the cost and power goals, Bluetooth limits connectivity to a sphere of …

Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Randy Clarksean, Darrell Pepper

Separations Campaign (TRP)

The AAA program is developing technology for the transmutation of nuclear waste to address many of the long-term disposal issues. An integral part of this program is the proposed chemical separations scheme. This process, as envisioned by Argonne National Laboratory (ANL) researchers, will be outlined later in this report.

Nearly all issues related to risks to future generations arising from long-term disposal of such spent nuclear fuel is attributable to ~1% of its content. This 1% is made up primarily of plutonium, neptunium, americium, and curium (the transuranic elements) and long-lived isotopes of iodine and technetium created as products from …

Performance Evaluation Of Linear Hash Structure Model In A Nested Transaction Environment, Malik Ayed Tubaishat, Sanjay Kumar Madria, Bharat Bhargava

Computer Science Faculty Research & Creative Works

We design and implement a linear hash algorithm in nested transaction environment to handle large amount of data with increased concurrency. Nested transactions allow parallel execution of transactions, and handle transaction aborts, thus provides more concurrency and efficient recovery. We use object-oriented methodology in the implementation which helped in designing the programming components independently. In our model, buckets are modeled as objects and linear hash operations are modeled as methods. The papers contribution is novel in the sense that the system, to our knowledge, is the first to implement linear hashing in a nested transactions environment. We have built a …

Personalized Classification For Keyword-Based Category Profiles, Aixin Sun, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

Personalized classification refers to allowing users to define their own categories and automating the assignment of documents to these categories. In this paper, we examine the use of keywords to define personalized categories and propose the use of Support Vector Machine (SVM) to perform personalized classification. Two scenarios have been investigated. The first assumes that the personalized categories are defined in a flat category space. The second assumes that each personalized category is defined within a pre-defined general category that provides a more specific context for the personalized category. The training documents for personalized categories are obtained from a training …

Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert Huijie Deng

Research Collection School Of Computing and Information Systems

At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: 2(d-1)m/2 encryptions are necessary to find a collision, where d and m are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be found with about a.2m encryptions, where a is a small number.

An Environment For Mobile Context-Based Hypermedia Retrieval, James Carswell

Conference papers

This paper proposes a novel solution to querying hyperlinked multimedia cultural heritage datasets based on the user's context. Context in this sense is defined as the user's location in virtual space and the particular mobile device being modeled together with user preferences or profile. The purpose is to automatically push relevant data from the database server to the client based on this comprehensive definition of the user's context. Consideration in regard to which mobile device is currently being modeled is a primary filter for determining what data will be sent and in what format. For example, image data will not …

Safe Robot Driving, Chuck Thorpe, Romuald Aufrere, Justin David Carlson, David Duggins, Terrence W. Fong, Jay Gowdy, John Kozar, Robert Maclachlan, Colin Mccabe, Christoph Mertz, Arne Suppe, Chieh Chih Wang, Teruko Yata

Research Collection School Of Computing and Information Systems

The Navlab group at Carnegie Mellon University has a long history of development of automated vehicles and intelligent systems for driver assistance. The earlier work of the group concentrated on road following, cross-country driving, and obstacle detection. The new focus is on short-range sensing, to look all around the vehicle for safe driving. The current system uses video sensing, laser rangefinders, a novel light-stripe rangefinder, software to process each sensor individually, and a map-based fusion system. The complete system has been demonstrated on the Navlab 11 vehicle for monitoring the environment of a vehicle driving through a cluttered urban environment, …

Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang

Research Collection School Of Computing and Information Systems

In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very …

A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal

Research Collection School Of Computing and Information Systems

A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP …

Intramural, Collaborative Learning Systems, Robert S. Friedman

Theses

This thesis focuses on three related concepts: problem-based collaborative learning; the use of multimedia tools in learning systems; and participatory design as a software engineering methodology to create multimedia tools to be used in learning systems. A literature review of the three areas is followed by an overview of the pedagogical, technological, and business trends that affect the direction of innovation in education, including problem-based learning. A discussion of a software engineering project to develop a multimedia application that enhances the learning of geography skills and puts the programming, interface design and multimedia systems capabilities of college students into action …

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

Separations Campaign (TRP)

Two activities are proposed in this Phase I task: the development of 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 to …