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

Engineering Commons

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

Articles 1 - 6 of 6

Full-Text Articles in Engineering

Automated Online News Classification With Personalization, Chee-Hong Chan, Aixin Sun, Ee Peng Lim Dec 2001

Automated Online News Classification With Personalization, Chee-Hong Chan, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Classification of online news, in the past, has often been done manually. In our proposed Categorizor system, we have experimented an automated approach to classify online news using the Support Vector Machine (SVM). SVM has been shown to deliver good classification results when ample training documents are given. In our research, we have applied SVM to personalized classification of online news.


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

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


On Clustering And Retrieval Of Video Shots, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang Oct 2001

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

Research Collection School Of Computing and Information Systems

Clustering of video data is an important issue in video abstraction, browsing and retrieval. In this paper, we propose a two-level hierarchical clustering approach by aggregating shots with similar motion and color features. Motion features are computed directly from 20 tensor histograms, while color features are represented by 30 color histograms. Cluster validity analysis is further applied to automatically determine the number of clusters at each level. Video retrieval can then be done directly based on the result of clustering. The proposed approach is found to be useful particularly for sports games, where motion and color are important visual cues …


Video Partitioning By Temporal Slice Coherency, Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin Aug 2001

Video Partitioning By Temporal Slice Coherency, Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a novel approach for video partitioning by detecting three essential types of camera breaks, namely cuts, wipes, and dissolves. The approach is based on the analysis of temporal slices which are extracted from the video by slicing through the sequence of video frames and collecting temporal signatures. Each of these slices contains both spatial and temporal information from which coherent regions are indicative of uninterrupted video partitions separated by camera breaks. Properties could further be extracted from the slice for both the detection and classification of camera breaks. For example, cut and wipes are detected by color-texture properties, …


Analysis Of A New Vehicle Scheduling And Location Problem, Ebru K. Bish, Thin Yin Leong, Chun-Lun Li, Jonathan W. C. Ng, David Simchi-Levi Aug 2001

Analysis Of A New Vehicle Scheduling And Location Problem, Ebru K. Bish, Thin Yin Leong, Chun-Lun Li, Jonathan W. C. Ng, David Simchi-Levi

Research Collection School Of Computing and Information Systems

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP-hard and develop a …


A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo Aug 2001

A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo

Research Collection School Of Computing and Information Systems

A distributed intelligent agent-based framework that supports fourth-party logistics optimization under a web-based e-Commerce environment has been proposed in this paper. In the framework, customer job requests come through an e-Procurement service. These requests are consolidated and pushed to the e-Market Place service periodically. The e-Market Place then serves as a broker that allows intelligent agents to bid to serve these requests optimally in real-time by solving multiple instances of underlying logistics optimization problem. The resulting system was implemented based on the Java 2 Enterprise Edition (J2EE) platform using distributed system technology for communication between objects.