Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

2002

Articles 1 - 30 of 57

Full-Text Articles in Physical Sciences and Mathematics

Crystalclear: Active Visualization Of Association Rules, Hian-Huat Ong, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim Dec 2002

Crystalclear: Active Visualization Of Association Rules, Hian-Huat Ong, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Effective visualization is an important aspect of active data mining. In the context of association rules, this need has been driven by the large amount of rules produced from a run of the algorithm. To be able to address real user needs, the rules need to be summarized and organized so that it can be interpreted and applied in a timely manner. In this paper, we propose two visualization techniques that is an improvement over those used by existing data mining packages. In particular, we address the visualization of "differences" in the set of rules due to incremental changes in …

Go to article

On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang Dec 2002

On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

Based on the analysis of temporal slices, we propose novel approaches for clustering and retrieval of video shots. Temporal slices are a set of two-dimensional (2-D) images extracted along the time dimension of an image volume. They encode rich set of visual patterns for similarity measure. In this paper, we first demonstrate that tensor histogram features extracted from temporal slices are suitable for motion retrieval. Subsequently, we integrate both tensor and color histograms for constructing a two-level hierarchical clustering structure. Each cluster in the top level contains shots with similar color while each cluster in bottom level consists of shots …

Go to article

Vdl: A Language For Active Mining Variants Of Association Rules, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim Dec 2002

Vdl: A Language For Active Mining Variants Of Association Rules, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The popularity of association rules has resulted in several variations being proposed. In each case, additional attributes in the data are considered so as to produce more informative rules. In the context of active mining, different types of rules may be required over a period of time due to knowledge needs or the availability of new attributes. The present approach is the ad-hoc development of algorithms for each variant of rules. This is time consuming and costly, and is a stumping block to the vision of active mining. We argue that knowledge needs and the changing characteristics of the data …

Go to article

Intergenerational Partnerships In The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Natalie Lee-San Pang, Patricia Bao-Bao Wong, Lian-Heong Chua Dec 2002

Intergenerational Partnerships In The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Natalie Lee-San Pang, Patricia Bao-Bao Wong, Lian-Heong Chua

Research Collection School Of Computing and Information Systems

This paper describes the engagement of intergenerational partners in the design of a digital library of geographical resources (GeogDL) to help prepare Singapore students for a national examination in geography. GeogDL is built on top of G-Portal, a digital library providing services over geospatial and georeferenced Web content. Scenario-based design and claims analysis were employed as a means of refinement to the initial design of the GeogDL prototype.

Go to article

Resource Annotation Framework In A Georeferenced And Geospatial Digital Library, Zehua Liu, Ee Peng Lim, Dion Hoe-Lian Goh Dec 2002

Resource Annotation Framework In A Georeferenced And Geospatial Digital Library, Zehua Liu, Ee Peng Lim, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

G-Portal is a georeferenced and geospatial digital library that aims to identify, classify and organize geospatial and georeferenced resources on the web and to provide digital library services for these resources. Annotation service is supported in G-Portal to enable users to contribute content to the digital library. In this paper, we present a resource annotation framework for georeferenced and geospatial digital libraries and discuss its application in G-Portal. The framework is fiexible for managing annotations of heterogeneous web resources. It allows users to contribute not only the annotation content but also the schema of the annotations. Meanwhile, other digital library …

Go to article

A Data Mining Approach To Library New Book Recommendations, San-Yih Hwang, Ee Peng Lim Dec 2002

A Data Mining Approach To Library New Book Recommendations, San-Yih Hwang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we propose a data mining approach to recommending new library books that have never been rated or borrowed by users. In our problem context, users are characterized by their demographic attributes, and concept hierarchies can be defined for some of these demographic attributes. Books are assigned to the base categories of a taxonomy. Our goal is therefore to identify the type of users interested in some specific type of books. We call such knowledge generalized profile association rules. In this paper, we propose a new definition of rule interestingness to prune away rules that are redundant and …

Go to article

Semantic Exploration Of Lecture Videos, Edward Altman, Yu Chen, Wai Chong Low Dec 2002

Semantic Exploration Of Lecture Videos, Edward Altman, Yu Chen, Wai Chong Low

Research Collection School Of Computing and Information Systems

E-Learning is rapidly changing the way that universities and corporations offer education and training. In recent years, the acquisition and distribution of rich media content has been largely automated, However, existing applications are functionally and visually static and remain organized around the delivery media, rather than the knowledge representation and learning tasks of the student. The innovative approach of this system is the extraction of semantically meaningful structures in the lecture combined with text analysis to support task based queries. In this demonstration we will show this combination of pedagogical and content descriptions leads to novel forms of visualization and …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

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 Sep 2002

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

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

Detection Of Slide Transition For Topic Indexing, Chong-Wah Ngo, Ting-Chuen Pong, Thomas S. Huang Aug 2002

Detection Of Slide Transition For Topic Indexing, Chong-Wah Ngo, Ting-Chuen Pong, Thomas S. Huang

Research Collection School Of Computing and Information Systems

This paper presents an automatic and novel approach in detecting the transitions of slides for video sequences of technical lectures. Our approach adopts a foreground vs background segmentation algorithm to separate a presenter from the projected electronic slides. Once a background template is generated, text captions are detected and analyzed. The segmented caption regions as well as background templates together provide salient visual cues to decide whether a slide is flipped and replaced. The partitioning of videos according to slide changes not only structure the content of video according to topics, but also facilitate the synchronization of video, audio and …

Go to article

Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li Aug 2002

Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li

Research Collection School Of Computing and Information Systems

In this paper, we describe how an integrated web‐based application, code‐named FOCI (Flexible Organizer for Competitive Intelligence), can help the knowledge worker in the gathering, organizing, tracking and dissemination of competitive intelligence (CI). It combines the use of a novel user‐configurable clustering, trend analysis and visualization techniques to manage information gathered from the web. FOCI allows its users to define and personalize the organization of the information clusters according to their needs and preferences into portfolios. These personalized portfolios created are saved and can be subsequently tracked and shared with other users. The paper runs through an example to show …

Go to article

Hcl: A Specification Language For Hierarchical Text Classification, Aixin Sun, Ee Peng Lim, Wee-Keong Ng Aug 2002

Hcl: A Specification Language For Hierarchical Text Classification, Aixin Sun, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

Hierarchical text classification refers to assigning text documents to the categories in a given category tree based on their content. With large number of categories organized as a tree, hierarchical text classification helps users to find information more quickly and accurately. Nevertheless, hierarchical text classification methods in the past have often been constructed in a proprietary manner. The construction steps often involve human efforts and are not completely automated. In this paper, we therefore propose a specification language known as HCL (Hierarchical Classification Language) . HCL is designed to describe a hierarchical classification method including the definition of a category …

Go to article

Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono Jul 2002

Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono

Research Collection School Of Computing and Information Systems

The inventory routing problem is one of important and practical problems in logistics. It involves the integration of inventory management and vehicle routing, both of which are known to be NP-hard. In this paper, we combine local search and network flows to solve the inventory management problem, by utilizing the minimum cost flow sub-solutions as a guiding measure for local search. We then integrate with a standard VRPTW solver to present experimental results for the overall inventory routing problem, based on instances extended from the Solomon benchmark problems.

Go to article

A Digital Library For Geography Examination Resources, Lian-Heong Chua, Dion Hoe-Lian Goh, Zehua Liu, Ee Peng Lim, Rebecca Pei-Hui Ang Jul 2002

A Digital Library For Geography Examination Resources, Lian-Heong Chua, Dion Hoe-Lian Goh, Zehua Liu, Ee Peng Lim, Rebecca Pei-Hui Ang

Research Collection School Of Computing and Information Systems

We describe a Web-based application developed above a digital library of geographical resources for Singapore students preparing to take a national examination in geography. The application provides an interactive, non-sequential approach to learning that supplements textbooks.

Go to article

Security Analysis And Improvement Of The Global Key Recovery System, Yanjiang Yang, Feng Bao, Robert H. Deng Jul 2002

Security Analysis And Improvement Of The Global Key Recovery System, Yanjiang Yang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Key recovery is a technology that allows the owner of encrypted data or a trusted third party to recover encrypted data, mostly by reconstructing lost decryption key. In [HLG99], Harn et al proposed a Global Key Recovery System (GKRS) that combines the functions of the key recovery authorities and the public key certification authorities (CAs). Among other features, user-dominance, i.e., a user is allowed to select his own public-private key pair and especially a public element for verifying the validity of the public-private key pair, is considered extremely important by [HLG99] for wide acceptance of GKRS. In this paper, we …

Go to article

Fast Filter-And-Refine Algorithms For Subsequence Selection, Beng-Chin Ooi, Hwee Hwa Pang, Hao Wang, Limsoon Wong, Cui Yu Jul 2002

Fast Filter-And-Refine Algorithms For Subsequence Selection, Beng-Chin Ooi, Hwee Hwa Pang, Hao Wang, Limsoon Wong, Cui Yu

Research Collection School Of Computing and Information Systems

Large sequence databases, such as protein, DNA and gene sequences in biology, are becoming increasingly common. An important operation on a sequence database is approximate subsequence matching, where all subsequences that are within some distance from a given query string are retrieved. This paper proposes a filter-and-refine algorithm that enables efficient approximate subsequence matching in large DNA sequence databases. It employs a bitmap indexing structure to condense and encode each data sequence into a shorter index sequence. During query processing, the bitmap index is used to filter out most of the irrelevant subsequences, and false positives are removed in the …

Go to article

The Case For Cyber Foraging, Rajesh Balan, Jason Flinn, Mahadev Satyanarayanan, Shafeeq Sinnamohideen, Hen-I Yang Jul 2002

The Case For Cyber Foraging, Rajesh Balan, Jason Flinn, Mahadev Satyanarayanan, Shafeeq Sinnamohideen, Hen-I Yang

Research Collection School Of Computing and Information Systems

In this paper, we propose cyber foraging: a mechanism to augment the computational and storage capabilities of mobile devices. Cyber foraging uses opportunistically discovered servers in the environment to improve the performance of interactive applications and distributed file systems on mobile clients. We show how the performance of distributed file systems can be improved by staging data at these servers even though the servers are not trusted. We also show how the performance of interactive applications can be improved via remote execution. Finally, we present VERSUDS: a virtual interface to heteregeneous service discovery protocols that can be used to discover …

Go to article

Next Last