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

Discipline
Keyword
Publication Year
File Type

Articles 6271 - 6300 of 6884

Full-Text Articles in Physical Sciences and Mathematics

Exploiting Self-Adaptive Posture-Based Focus Estimation For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong Nov 2005

Exploiting Self-Adaptive Posture-Based Focus Estimation For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

Head pose plays a special role in estimating a presenter’s focuses and actions for lecture video editing. This paper presents an efficient and robust head pose estimation algorithm to cope with the new challenges arising in the content management of lecture videos. These challenges include speed requirement, low video quality, variant presenting styles and complex settings in modern classrooms. Our algorithm is based on a robust hierarchical representation of skin color clustering and a set of pose templates that are automatically trained. Contextual information is also considered to refine pose estimation. Most importantly, we propose an online learning approach to …

Go to article

Motion-Based Approach For Bbc Rushes Structuring And Characterization, Chong-Wah Ngo, Zailiang Pan Nov 2005

Motion-Based Approach For Bbc Rushes Structuring And Characterization, Chong-Wah Ngo, Zailiang Pan

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Mining Ontological Knowledge From Domain-Specific Text Documents, Xing Jiang, Ah-Hwee Tan Nov 2005

Mining Ontological Knowledge From Domain-Specific Text Documents, Xing Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Traditional text mining systems employ shallow parsing techniques and focus on concept extraction and taxonomic relation extraction. This paper presents a novel system called CRCTOL for mining rich semantic knowledge in the form of ontology from domain-specific text documents. By using a full text parsing technique and incorporating both statistical and lexico-syntactic methods, the knowledge extracted by our system is more concise and contains a richer semantics compared with alternative systems. We conduct a case study wherein CRCTOL extracts ontological knowledge, specifically key concepts and semantic relations, from a terrorism domain text collection. Quantitative evaluation, by comparing with a state-of-the-art …

Go to article

Selective Object Stabilization For Home Video Consumers, Zailiang Pan, Chong-Wah Ngo Nov 2005

Selective Object Stabilization For Home Video Consumers, Zailiang Pan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper describes a unified approach for video stabilization. The essential goal is to stabilize image sequences that consist of moving foreground objects, which appear frequently in today's home videos captured by hand-held consumer cameras. Our proposed techniques mainly, rely on the analysis of;motion content. Three major components area initialization, segmentation and stabilization. In motion initialization, we propose a novel algorithm to efficiently search for the best possible frame in a sequence to start segmentation. Our segmentation algorithm is based on Expectation-Maximization (EM) framework which provides the mechanism for simultaneous estimation of motion models and their layers of support. Based …

Go to article

Accurately Extracting Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai Nov 2005

Accurately Extracting Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

In this paper, we present a principled method for accurately extracting coherent relevant passages of variable lengths using HMMs. We show that with appropriate parameter estimation, the HMM method outperforms a number of strong baseline methods on two data sets.

Go to article

A Threshold-Based Algorithm For Continuous Monitoring Of K Nearest Neighbors, Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao Nov 2005

A Threshold-Based Algorithm For Continuous Monitoring Of K Nearest Neighbors, Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao

Research Collection School Of Computing and Information Systems

Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naïve solution requires the transmission of a large number of rapid data streams corresponding to location updates. Intuitively, current information is necessary only for objects that may influence some query result (i.e., they may be included in the nearest neighbor set of some client). Motivated by this observation, we present a threshold-based algorithm …

Go to article

Query Processing In Spatial Databases Containing Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu Nov 2005

Query Processing In Spatial Databases Containing Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu

Research Collection School Of Computing and Information Systems

Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed …

Go to article

Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda Nov 2005

Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda

Research Collection School Of Computing and Information Systems

Wireless networks have gained overwhelming popularity over their wired counterpart due to their great flexibility and convenience, but access control of wireless networks has been a serious problem because of the open medium. Passwords remain the most popular way for access control as well as authentication and key exchange. But existing password-based access control protocols are not satisfactory in that they do not provide DoS-resistance or anonymity. In this paper we analyze the weaknesses of an access control protocol using passwords for wireless networks in IEEE LCN 2001, and propose a different access control protocol using passwords for wireless networks. …

Go to article

On Security Notions Of Steganographic Systems, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim Nov 2005

On Security Notions Of Steganographic Systems, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim

Research Collection School Of Computing and Information Systems

We define the notion of pseudoprocessingness to formulate chosen-input-attack, chosen-stego-attack, and key-recovery. We then construct a efficient, provable secure steganographic algorithm against chosen-input-attack and key-recovery. So far as we know, this is the first paper dealing with those security notions.

Go to article

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Kam-Fai Wong, Wei Gao Oct 2005

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Kam-Fai Wong, Wei Gao

Research Collection School Of Computing and Information Systems

Informal language is actively used in network-mediated communication, e.g. chat room, BBS, email and text message. We refer the anomalous terms used in such context as network informal language (NIL) expressions. For example, “஧(ou3)” is used to replace “ᚒ(wo3)” in Chinese ICQ. Without unconventional resource, knowledge and techniques, the existing natural language processing approaches exhibit less effectiveness in dealing with NIL text. We propose to study NIL expressions with a NIL corpus and investigate techniques in processing NIL expressions. Two methods for Chinese NIL expression recognition are designed in NILER system. The experimental results show that pattern matching method produces …

Go to article

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Wong, Wei Gao, Wei Gao Oct 2005

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Wong, Wei Gao, Wei Gao

Research Collection School Of Computing and Information Systems

Informal language is actively used in network-mediated communication, e.g. chat room, BBS, email and text message. We refer the anomalous terms used in such context as network informal language (NIL) expressions. For example, “偶(ou3)” is used to replace “我(wo3)” in Chinese ICQ. Without unconventional resource, knowledge and techniques, the existing natural language processing approaches exhibit less effectiveness in dealing with NIL text. We propose to study NIL expressions with a NIL corpus and investigate techniques in processing NIL expressions. Two methods for Chinese NIL expression recognition are designed in NILER system. The experimental results show that pattern matching method produces …

Go to article

Common Pattern Discovery Using Earth Mover's Distance And Local Flow Maximization, Hung-Khoon Tan, Chong-Wah Ngo Oct 2005

Common Pattern Discovery Using Earth Mover's Distance And Local Flow Maximization, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

In this paper, we present a novel segmentation-insensitive approach for mining common patterns from 2 images. We develop an algorithm using the earth movers distance (EMD) framework, unary and adaptive neighborhood color similarity. We then propose a novel local flow maximization approach to provide the best estimation of location and scale of the common pattern. This is achieved by performing an iterative optimization in search of the most stable flows' centroid. Common pattern discovery is difficult owing to the huge search space and problem domain. We intend to solve this problem by reducing the search space through identifying the location …

Go to article

Managerial Assessments Of E-Business Investment Opportunities: A Field Study, Anandhi S. Bharadwaj, Amrit Tiwana Oct 2005

Managerial Assessments Of E-Business Investment Opportunities: A Field Study, Anandhi S. Bharadwaj, Amrit Tiwana

Research Collection School Of Computing and Information Systems

Managers charged with assessing investment opportunities for information technologies such as e-business projects face considerable uncertainty in their decision-making processes. Contemporary theories of the firm and the normative prescriptions thereof emphasize the potential for such investments to augment firm-level knowledge and relational capabilities. However, prior research has not examined the relative emphases that managers place on the knowledge and relational capability-augmenting characteristics of the e-business investments. In this paper, we develop a model to assess whether managerial evaluations of e-business investment opportunities are consistent with these normative and theoretical prescriptions. A test of the model using survey data on 485 …

Go to article

And/Or Graph And Search Algorithm For Discovering Composite Web Services, Qianhui (Althea) Liang, Stanley Y. W. Su Oct 2005

And/Or Graph And Search Algorithm For Discovering Composite Web Services, Qianhui (Althea) Liang, Stanley Y. W. Su

Research Collection School Of Computing and Information Systems

This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that can only be satisfied by a composition of Web Services, we identify the service categories that are relevant to the request and dynamically construct an AND/OR graph to capture the input/output dependencies among the Web Services of these service categories. The graph is modified, based on the information provided in the service request. The search algorithm is then …

Go to article

Dsim: A Distance-Based Indexing Method For Genomic Sequences, Xia Cao, Beng-Chin Ooi, Hwee Hwa Pang, Kian-Lee Tan, Anthony K. H. Tung Oct 2005

Dsim: A Distance-Based Indexing Method For Genomic Sequences, Xia Cao, Beng-Chin Ooi, Hwee Hwa Pang, Kian-Lee Tan, Anthony K. H. Tung

Research Collection School Of Computing and Information Systems

In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the genomic sequence database around a set of automatically selected reference words, formed from high-frequency data substrings and substrings in past queries. The compression captures the distance of each non-reference word in the database to some reference word. At runtime, a query is processed by comparing its substrings with the compressed data strings, through their distances to the reference words. We also propose an efficient scheme to incrementally update the reference words and the compressed …

Go to article

Towards Semantic Service Request Of Web Service Composition, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller Oct 2005

Towards Semantic Service Request Of Web Service Composition, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller

Research Collection School Of Computing and Information Systems

When meeting the challenges in automatic and semi-automatic Web service composition, capturing the user's service demand and preferences is as important as knowing what the services can do. This paper discusses the idea of semantic service requests for composite services, and presents a way to model the elements of a composite service request as user preferences and constraints. The model is based on an interactive and iterative strategy meant to obtain the exact requirements from potential service consumers. The markup vocabularies and associated inference mechanism of OWL-S are used as a means to bring semantics to service requests. Language constructs …

Go to article

Informal Animation Sketching With K-Sketch, Richard C. Davis Oct 2005

Informal Animation Sketching With K-Sketch, Richard C. Davis

Research Collection School Of Computing and Information Systems

Animation is a powerful medium that is accessible to few, because current animation tools are extremely complex. This complexity arises partially from current tools’ focus on precise, often unnecessary details and partially from the difficulty of finding a small but sufficiently powerful set of tool features. We are designing K-Sketch, an informal 2D animation tool that uses sketching and demonstration to radically reduce the time needed to create an animation. Our field studies investigating the needs of current anima-tion tool users and would-be users are helping us to mini-mize complexity by showing us how to prioritize the many possible tool …

Go to article

Automatic 3d Face Modeling Using 2d Active Appearance Models, Jianke Zhu, Steven Hoi, Michael R. Lyu Oct 2005

Automatic 3d Face Modeling Using 2d Active Appearance Models, Jianke Zhu, Steven Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Although a lot of promising research findings have been studied on 3D face modeling in the past years, it is still a challenge to generate realistic 3D human face models and facial animations. This paper presents a novel approach to model 3D faces automatically from still images or video sequences without manual interactions. Our proposed scheme comprises three steps. First, we offline construct 3D shape models using Active Appearance Models (AAMs), which saves large computation costs for online modeling. Second, based on the computed 3D shape models, we propose an efficient algorithm to estimate the parameters of 3D pose and …

Go to article

New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen Sep 2005

New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen

Research Collection School Of Computing and Information Systems

This paper presents a class of binary maximum distance separable (MDS) array codes for tolerating disk failures in redundant arrays of inexpensive disks (RAID) architecture based on circular permutation matrices. The size of the information part is m×n, the size of the parity-check part is m×3, and the minimum distance is 4, where n is the number of information disks, the number of parity-check disks is 3, and (m+1) is a prime integer. In practical applications, m can be very large and n is from 20 to 50. The code rate is R=n/(n+3). These codes can be used for tolerating …

Go to article

Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu Sep 2005

Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu

Research Collection School Of Computing and Information Systems

The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [1] is based on an unrealistic assumption that agents are willing to report their options in nondecreasing order of cost. In this paper, we study a generalized OCOP …

Go to article

Security Analysis And Improvement Of Return Routability Protocol, Ying Qiu, Jianying Zhou, Robert H. Deng Sep 2005

Security Analysis And Improvement Of Return Routability Protocol, Ying Qiu, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

Mobile communication plays a more and more important role in computer networks. How to authenticate a new connecting address belonging to a said mobile node is one of the key issues in mobile networks. This paper analyzes the Return Routability (RR) protocol and proposes an improved security solution for the RR protocol without changing its architecture. With the improvement, three types of redirect attacks can be prevented.

Go to article

Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo Sep 2005

Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo

Research Collection School Of Computing and Information Systems

In a rapidly changing environment, the behavior and decision-making power of agents may have to be adaptive with respect to a fluctuating autonomy. In this paper, a centralized fuzzy approach is proposed to sense changes in environmental conditions and translate them to changes in agent autonomy. A distributed coalition formation scheme is then applied to allow agents in the new autonomy to renegotiate to establish schedule consistency. The proposed framework is applied to a real-time logistics control of a military hazardous material storage facility under peace-to-war transition.

Go to article

Low Latency Multimedia Broadcast In Multi-Rate Wireless Meshes, Chun-Tong Chou, Archan Misra Sep 2005

Low Latency Multimedia Broadcast In Multi-Rate Wireless Meshes, Chun-Tong Chou, Archan Misra

Research Collection School Of Computing and Information Systems

In a multi-rate wireless network, a node can dynamically adjust its link transmission rate by switching between different modulation schemes. For the current IEEE802.11a/b/g standards, this rate adjustment is limited to unicast traffic only while multicast and broadcast traffic is always transmitted at the lowest possible rate. In this paper, we consider a novel type of multi-rate mesh networks where a node can dynamically adjust its link layer multicast rates to its neighbours. In particular, we consider the problem of realising low latency network-wide broadcast in this type of multi-rate wireless meshes. We will first show that the multi-rate broadcast …

Go to article

Forms Of Expression For Designing Visual Languages For Animation, Richard C. Davis, James A. Landay Sep 2005

Forms Of Expression For Designing Visual Languages For Animation, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

We present further steps in our research into visual languages for animation. Animation is a rich mode of communication that is currently accessible to few, because animation systems are complex. Some systems try to make animation simple but put severe limits on users’ creative expression. Our field studies are demonstrating that would-be animators need to express animation in a wide variety of ways. We are developing a taxonomy of forms of expression for animation that will help the designers of visual languages for animation to determine which expressive forms to support. Our end goal is to build animation sketching systems …

Go to article

Cuhk At Imageclef 2005: Cross-Language And Cross-Media Image Retrieval, Steven C. H. Hoi, J. Zhu, M. Lyu Sep 2005

Cuhk At Imageclef 2005: Cross-Language And Cross-Media Image Retrieval, Steven C. H. Hoi, J. Zhu, M. Lyu

Research Collection School Of Computing and Information Systems

In this paper, we describe our studies of cross-language and cross-media image retrieval at the ImageCLEF 2005. This is the first participation of our CUHK (The Chinese University of Hong Kong) group at ImageCLEF. The task in which we participated is the “bilingual ad hoc retrieval” task. There are three major focuses and contributions in our participation. The first is the empirical evaluation of language models and smoothing strategies for cross-language image retrieval. The second is the evaluation of cross-media image retrieval, i.e., combining text and visual contents for image retrieval. The last is the evaluation of bilingual image retrieval …

Go to article

Managing Geography Learning Objects Using Personalized Project Spaces In G-Portal, Dion Hoe-Lian Goh, Aixin Sun, Wenbo Zong, Dan Wu, Ee Peng Lim, Yin-Leng Theng, John Hedberg, Chew-Hung Chang Sep 2005

Managing Geography Learning Objects Using Personalized Project Spaces In G-Portal, Dion Hoe-Lian Goh, Aixin Sun, Wenbo Zong, Dan Wu, Ee Peng Lim, Yin-Leng Theng, John Hedberg, Chew-Hung Chang

Research Collection School Of Computing and Information Systems

The personalized project space is an important feature in G-Portal that supports individual and group learning activities. Within such a space, its owner can create, delete, and organize metadata referencing learning objects on the Web. Browsing and querying are among the functions provided to access the metadata. In addition, new schemas can be added to accommodate metadata of diverse attribute sets. Users can also easily share metadata across different projects using a “copy-and-paste” approach. Finally, a viewer to support offline viewing of personalized project content is also provided.

Go to article

On Organizing And Accessing Geospatial And Georeferenced Web Resources Using The G-Portal System, Zehua Liu, Ee Peng Lim, Yin-Leng Theng, Dion Hoe-Lian Goh, Wee-Keong Ng Sep 2005

On Organizing And Accessing Geospatial And Georeferenced Web Resources Using The G-Portal System, Zehua Liu, Ee Peng Lim, Yin-Leng Theng, Dion Hoe-Lian Goh, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

In order to organise and manage geospatial and georeferenced information on the Web making them convenient for searching and browsing, a digital portal known as G-Portal has been designed and implemented. Compared to other digital libraries, G-Portal is unique for several of its features. It maintains metadata resources in XML with flexible resource schemas. Logical groupings of metadata resources as projects and layers are possible to allow the entire metadata collection to be partitioned differently for users with different information needs. These metadata resources can be displayed in both the classification-based and map-based interfaces provided by G-Portal. G-Portal further incorporates …

Go to article

Translation Initiation Sites Prediction With Mixture Gaussian Models In Human Cdna Sequences, G. Li, Tze-Yun Leong, Louxin Zhang Aug 2005

Translation Initiation Sites Prediction With Mixture Gaussian Models In Human Cdna Sequences, G. Li, Tze-Yun Leong, Louxin Zhang

Research Collection School Of Computing and Information Systems

Translation initiation sites (TISs) are important signals in cDNA sequences. Many research efforts have tried to predict TISs in cDNA sequences. In this paper, we propose to use mixture Gaussian models for TIS prediction. Using both local features and some features generated from global measures, the proposed method predicts TISs with a sensitivity of 98 percent and a specificity of 93.6 percent. Our method outperforms many other existing methods in sensitivity while keeping specificity high. We attribute the improvement in sensitivity to the nature of the global features and the mixture Gaussian models. © 2005 IEEE.

Go to article

Constrained Shortest Path Computation, Manolis Terrovitis, Spiridon Bakiras, Dimitris Papadias, Kyriakos Mouratidis Aug 2005

Constrained Shortest Path Computation, Manolis Terrovitis, Spiridon Bakiras, Dimitris Papadias, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points. In both cases our aim is to compute the shortest path subject to these constraints. Assuming that the dataset is indexed by a data-partitioning method, the proposed techniques initially compute a sub-optimal path by …

Go to article

Web Mining - The Ontology Approach, Ee Peng Lim, Aixin Sun Aug 2005

Web Mining - The Ontology Approach, Ee Peng Lim, Aixin Sun

Research Collection School Of Computing and Information Systems

The World Wide Web today provides users access to extremely large number of Web sites many of which contain information of education and commercial values. Due to the unstructured and semi-structured nature of Web pages and the design idiosyncrasy of Web sites, it is a challenging task to develop digital libraries for organizing and managing digital content from the Web. Web mining research, in its last 10 years, has on the other hand made significant progress in categorizing and extracting content from the Web. In this paper, we represent ontology as a set of concepts and their inter-relationships relevant to …

Go to article

First Prev Next Last