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 6061 - 6090 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Innovation Stack - Choosing Innovations For Commercialization, Arcot Desai Narasimhalu Aug 2007

Innovation Stack - Choosing Innovations For Commercialization, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

This paper describes a method for enterprises to order the innovations of interest according to a number of parameters including their own business strategy and core competencies. The method takes into account aspects such as ability to create entry barriers and complementary assets. Enterprises can now use this method to both filter out innovations that may not be of interest to them and then order the short listed or selected innovations according to their attractiveness.


Cost-Time Sensitive Decision Tree With Missing Values, Shichao Zhang, Xiaofeng Zhu, Jilian Zhang, Chengqi Zhang Aug 2007

Cost-Time Sensitive Decision Tree With Missing Values, Shichao Zhang, Xiaofeng Zhu, Jilian Zhang, Chengqi Zhang

Research Collection School Of Computing and Information Systems

Cost-sensitive decision tree learning is very important and popular in machine learning and data mining community. There are many literatures focusing on misclassification cost and test cost at present. In real world application, however, the issue of time-sensitive should be considered in cost-sensitive learning. In this paper, we regard the cost of time-sensitive in cost-sensitive learning as waiting cost (referred to WC), a novelty splitting criterion is proposed for constructing cost-time sensitive (denoted as CTS) decision tree for maximal decrease the intangible cost. And then, a hybrid test strategy that combines the sequential test with the batch test strategies is …


Re-Engineering Xid Technologies - From Enterprise To Consumer Markets, Arcot Desai Narasimhalu Aug 2007

Re-Engineering Xid Technologies - From Enterprise To Consumer Markets, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Several studies have addressed the process of taking ideas to markets but few have shared the experiences of start up companies that have reexamined their product strategies and repositioned their products and services for better revenues and profits. This paper reports the efforts related to repositioning of XID technologies, a start up company, into new markets while continuing to exploit its core technical competencies.


Enhanced Security By Os-Oriented Encapsulation In Tpm-Enabled Drm, Yongdong Wu, Feng Bao, Robert H. Deng, Marc Mouffron, Frederic Rousseau Aug 2007

Enhanced Security By Os-Oriented Encapsulation In Tpm-Enabled Drm, Yongdong Wu, Feng Bao, Robert H. Deng, Marc Mouffron, Frederic Rousseau

Research Collection School Of Computing and Information Systems

The Trusted Computing Group (TCG) defines the specifications for the Trusted Platform Module (TPM) and corresponding trust mechanisms that allow a TPM-enabled platform to run only authenticated software. For example, the operating system (OS) can use the facilities provided by the TPM to authenticate a Digital Rights Management (DRM) application before allowing it to run. However TCG does not provide any clear specification on what kind of software can be regarded as trusted and hence be authenticated. In fact it is unlikely that there will be a clear line between the software that should be authenticated and those should not, …


Century: Automated Aspects Of Patient Care, Marion Blount, John Davis, Maria Ebling, Ji Hyun Kim, Kyun Hyun Kim, Kang Yoon Lee, Archan Misra, Se Hun Park, Daby Sow, Young Ju Tak, Min Wang, Karen Witting Aug 2007

Century: Automated Aspects Of Patient Care, Marion Blount, John Davis, Maria Ebling, Ji Hyun Kim, Kyun Hyun Kim, Kang Yoon Lee, Archan Misra, Se Hun Park, Daby Sow, Young Ju Tak, Min Wang, Karen Witting

Research Collection School Of Computing and Information Systems

Remote health monitoring affords the possibility of improving the quality of health care by enabling relatively inexpensive out-patient care. However, remote health monitoring raises new a problem: the potential for data explosion in health care systems. To address this problem, the remote health monitoring systems must be integrated with analysis tools that provide automated trend analysis and event detection in real time. In this paper, we propose an overview of Century, an extensible framework for analysis of large numbers of remote sensor-based medical data streams.


A Genetic Algorithm For Cellular Manufacturing Design And Layout, Xiaodan Wu, Chao-Hsien Chu, Yunfeng Wang, Weili Yan Aug 2007

A Genetic Algorithm For Cellular Manufacturing Design And Layout, Xiaodan Wu, Chao-Hsien Chu, Yunfeng Wang, Weili Yan

Research Collection School Of Computing and Information Systems

Cellular manufacturing (CM) is an approach that can be used to enhance both flexibility and efficiency in today’s small-to-medium lot production environment. The design of a CM system (CMS) often involves three major decisions: cell formation, group layout, and group schedule. Ideally, these decisions should be addressed simultaneously in order to obtain the best results. However, due to the complexity and NP-complete nature of each decision and the limitations of traditional approaches, most researchers have only addressed these decisions sequentially or independently. In this study, a hierarchical genetic algorithm is developed to simultaneously form manufacturing cells and determine the group …


Designing The Value Curve For Your Next Innovation, Arcot Desai Narasimhalu Aug 2007

Designing The Value Curve For Your Next Innovation, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

This paper introduces an additional feature to the strategy canvas and value curve that will make innovation designers more effective. The new feature is to let the innovators carry out the designs of their new innovations taking into account both the cost of improving the quality of a parameter that the users value highly and the savings accrued from the drop in provisioning for parameters that users place less emphasis in an innovation.


An Artificial Immune System Based Approach For English Grammar Correction, Akshat Kumar, Shivashankar B. Nair Aug 2007

An Artificial Immune System Based Approach For English Grammar Correction, Akshat Kumar, Shivashankar B. Nair

Research Collection School Of Computing and Information Systems

Grammar checking and correction comprise of the primary problems in the area of Natural Language Processing (NLP). Traditional approaches fall into two major categories: Rule based and Corpus based. While the former relies heavily on grammar rules the latter approach is statistical in nature. We provide a novel corpus based approach for grammar checking that uses the principles of an Artificial Immune System (AIS).We treat grammatical error as pathogens (in immunological terms) and build antibody detectors capable of detecting grammatical errors while allowing correct constructs to filter through. Our results show that it is possible to detect a range of …


Are You Too Smart For Your Own Good?, M. Thulasidas Aug 2007

Are You Too Smart For Your Own Good?, M. Thulasidas

Research Collection School Of Computing and Information Systems

Knowledge can be a bad thing, if others are taking credit for it. TECHNICAL knowledge is not always a good thing for you in the modern workplace.


Towards Optimal Bag-Of-Features For Object Categorization And Semantic Video Retrieval, Yu-Gang Jiang, Chong-Wah Ngo, Jun Yang Jul 2007

Towards Optimal Bag-Of-Features For Object Categorization And Semantic Video Retrieval, Yu-Gang Jiang, Chong-Wah Ngo, Jun Yang

Research Collection School Of Computing and Information Systems

Bag-of-features (BoF) deriving from local keypoints has recently appeared promising for object and scene classification. Whether BoF can naturally survive the challenges such as reliability and scalability of visual classification, nevertheless, remains uncertain due to various implementation choices. In this paper, we evaluate various factors which govern the performance of BoF. The factors include the choices of detector, kernel, vocabulary size and weighting scheme. We offer some practical insights in how to optimize the performance by choosing good keypoint detector and kernel. For the weighting scheme, we propose a novel soft-weighting method to assess the significance of a visual word …


Improving Memory-Based Collaborative Filtering Using A Factor-Based Approach, Zhenxue Zhang, Dongsong Zhang, Zhiling Guo Jul 2007

Improving Memory-Based Collaborative Filtering Using A Factor-Based Approach, Zhenxue Zhang, Dongsong Zhang, Zhiling Guo

Research Collection School Of Computing and Information Systems

Collaborative Filtering (CF) systems generate recommendations for a user by aggregating item ratings of other like-minded users. The memory-based approach is a common technique used in CF. This approach first uses statistical methods such as Pearson’s Correlation Coefficient to measure user similarities based on their previous ratings on different items. Users will then be grouped into different neighborhood depending on the calculated similarities. Finally, the system will generate predictions on how a user would rate a specific item by aggregating ratings on the item cast by the identified neighbors of his/her. However, current memory-based CF method only measures user similarities …


An Empirical Study On Large-Scale Content-Based Image Retrieval, Yuk Man Wong, Steven C. H. Hoi, Michael R. Lyu Jul 2007

An Empirical Study On Large-Scale Content-Based Image Retrieval, Yuk Man Wong, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

One key challenge in content-based image retrieval (CBIR) is to develop a fast solution for indexing high-dimensional image contents, which is crucial to building large-scale CBIR systems. In this paper, we propose a scalable content-based image retrieval scheme using locality-sensitive hashing (LSH), and conduct extensive evaluations on a large image testbed of a half million images. To the best of our knowledge, there is less comprehensive study on large-scale CBIR evaluation with a half million images. Our empirical results show that our proposed solution is able to scale for hundreds of thousands of images, which is promising for building Web-scale …


Discovering And Exploiting Causal Dependencies For Robust Mobile Context-Aware Recommenders, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang Jul 2007

Discovering And Exploiting Causal Dependencies For Robust Mobile Context-Aware Recommenders, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Acquisition of context poses unique challenges to mobile context-aware recommender systems. The limited resources in these systems make minimizing their context acquisition a practical need, and the uncertainty in the mobile environment makes missing and erroneous context inputs a major concern. In this paper, we propose an approach based on Bayesian networks (BNs) for building recommender systems that minimize context acquisition. Our learning approach iteratively trims the BN-based context model until it contains only the minimal set of context parameters that are important to a user. In addition, we show that a two-tiered context model can effectively capture the causal …


The Business Model Of "Software-As-A-Service", Dan Ma Jul 2007

The Business Model Of "Software-As-A-Service", Dan Ma

Research Collection School Of Computing and Information Systems

The emergence of the software-as-a-service (SaaS) business model has attracted great attentions from both researchers and practitioners. SaaS vendors deliver on-demand information processing services to users, and thus offer computing utility rather than the standalone software itself. In this work, the author propose an analytical model to study the competition between the SaaS and the traditional COTS (commercial off-the-shelf) solutions for software applications. The author show that when software applications become open, modulated, and standardized, the SaaS business model will take a significant market share. In addition, under certain market conditions, offering users an easy exit option through the software …


Near-Duplicate Keyframe Retrieval With Visual Keywords And Semantic Context, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo Jul 2007

Near-Duplicate Keyframe Retrieval With Visual Keywords And Semantic Context, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Near-duplicate keyframes (NDK) play a unique role in large-scale video search, news topic detection and tracking. In this paper, we propose a novel NDK retrieval approach by exploring both visual and textual cues from the visual vocabulary and semantic context respectively. The vocabulary, which provides entries for visual keywords, is formed by the clustering of local keypoints. The semantic context is inferred from the speech transcript surrounding a keyframe. We experiment the usefulness of visual keywords and semantic context, separately and jointly, using cosine similarity and language models. By linearly fusing both modalities, performance improvement is reported compared with the …


Appraisal - Who Needs It?, M. Thulasidas Jul 2007

Appraisal - Who Needs It?, M. Thulasidas

Research Collection School Of Computing and Information Systems

WE GO through this ordeal every year when our boss- es appraise our performance. Our career progression, bonus and salary depend on it. So, we spend sleepless nights agonising over it.


Learning Causal Models For Noisy Biological Data Mining: An Application To Ovarian Cancer Detection, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang Jul 2007

Learning Causal Models For Noisy Biological Data Mining: An Application To Ovarian Cancer Detection, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Undetected errors in the expression measurements from highthroughput DNA microarrays and protein spectroscopy could seriously affect the diagnostic reliability in disease detection. In addition to a high resilience against such errors, diagnostic models need to be more comprehensible so that a deeper understanding of the causal interactions among biological entities like genes and proteins may be possible. In this paper, we introduce a robust knowledge discovery approach that addresses these challenges. First, the causal interactions among the genes and proteins in the noisy expression data are discovered automatically through Bayesian network learning. Then, the diagnosis of a disease based on …


Generating Job Schedules For Vessel Operations In A Container Terminal, Thin Yin Leong, Hoong Chuin Lau Jul 2007

Generating Job Schedules For Vessel Operations In A Container Terminal, Thin Yin Leong, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

No abstract provided.


Continuous Medoid Queries Over Moving Objects, Stavros Papadopoulos, Dimitris Sacharidis, Kyriakos Mouratidis Jul 2007

Continuous Medoid Queries Over Moving Objects, Stavros Papadopoulos, Dimitris Sacharidis, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

In the k-medoid problem, given a dataset P, we are asked to choose kpoints in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points in P and their closest medoid. Finding the optimal k medoids is NP hard, and existing algorithms aim at approximate answers, i.e., they compute medoids that achieve a small, yet not minimal, average distance. Similarly in this paper, we also aim at approximate solutions. We consider, however, the continuous version of the problem, where the points in P move and our task is to maintain the medoid set on-the-fly …


On Searching Continuous Nearest Neighbors In Wireless Data Broadcast Systems, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee Jul 2007

On Searching Continuous Nearest Neighbors In Wireless Data Broadcast Systems, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee

Research Collection School Of Computing and Information Systems

A continuous nearest neighbor (CNN) search, which retrieves the nearest neighbors corresponding to every point in a given query line segment, is important for location-based services such as vehicular navigation and tourist guides. It is infeasible to answer a CNN search by issuing a traditional nearest neighbor query at every point of the line segment due to the large number of queries generated and the overhead on bandwidth. Algorithms have been proposed recently to support CNN search in the traditional client-server systems but not in the environment of wireless data broadcast, where uplink communication channels from mobile devices to the …


Is Interpersonal Trust A Necessary Condition For Organisational Learning?, Siu Loon Hoe Jul 2007

Is Interpersonal Trust A Necessary Condition For Organisational Learning?, Siu Loon Hoe

Research Collection School Of Computing and Information Systems

The organisational behaviour and management literature has devoted a lot attention on various factors affecting organisational learning. While there has been much work done to examine trust in promoting organisational learning, there is a lack of consensus on the specific type of trust involved. The purpose of this paper is to highlight the importance of interpersonal trust in promoting organisational learning and propose a research agenda to test the extent of interpersonal trust on organisational learning. This paper contributes to the existing organisational learning literature by specifying a specific form of trust, interpersonal trust, which promotes organisational learning and proposing …


Continuous Monitoring Of Top-K Queries Over Sliding Windows, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias Jul 2007

Continuous Monitoring Of Top-K Queries Over Sliding Windows, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in conventional databases, the existing methods are inapplicable to highly dynamic environments involving numerous long-running queries. This paper studies continuous monitoring of top-k queries over a fixed-size window W of the most recent data. The window size can be expressed either in terms of the number of active tuples or time units. We propose a general methodology for top-k monitoring that restricts processing to the sub-domains of the workspace …


Efficient Near-Duplicate Keyframe Retrieval With Visual Language Models, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo Jul 2007

Efficient Near-Duplicate Keyframe Retrieval With Visual Language Models, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Near-duplicate keyframe retrieval is a critical task for video similarity measure, video threading and tracking. In this paper, instead of using expensive point-to-point matching on keypoints, we investigate the visual language models built on visual keywords to speed up the near-duplicate keyframe retrieval. The main idea is to estimate a visual language model on visual keywords for each keyframe and compare keyframes by the likelihood of their visual language models. Experiments on a subset of TRECVID-2004 video corpus show that visual language models built on visual keywords demonstrate promising performance for near-duplicate keyframe retrieval, which greatly speed up the retrieval …


Analyzing Feature Trajectories For Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim Jul 2007

Analyzing Feature Trajectories For Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

We consider the problem of analyzing word trajectories in both time and frequency domains, with the specific goal of identifying important and less-reported, periodic and aperiodic words. A set of words with identical trends can be grouped together to reconstruct an event in a completely un-supervised manner. The document frequency of each word across time is treated like a time series, where each element is the document frequency - inverse document frequency (DFIDF) score at one time point. In this paper, we 1) first applied spectral analysis to categorize features for different event characteristics: important and less-reported, periodic and aperiodic; …


Cross-Lingual Query Suggestion Using Query Logs Of Different Languages, Wei Gao, Cheng Niu, Jian-Yun Nie, Ming Zhou, Jian Hu, Kam-Fai Wong, Hsiao-Wuen Hon Jul 2007

Cross-Lingual Query Suggestion Using Query Logs Of Different Languages, Wei Gao, Cheng Niu, Jian-Yun Nie, Ming Zhou, Jian Hu, Kam-Fai Wong, Hsiao-Wuen Hon

Research Collection School Of Computing and Information Systems

Query suggestion aims to suggest relevant queries for a given query, which help users better specify their information needs. Previously, the suggested terms are mostly in the same language of the input query. In this paper, we extend it to cross-lingual query suggestion (CLQS): for a query in one language, we suggest similar or relevant queries in other languages. This is very important to scenarios of cross-language information retrieval (CLIR) and cross-lingual keyword bidding for search engine advertisement. Instead of relying on existing query translation technologies for CLQS, we present an effective means to map the input query of one …


A Multi-Scale Tikhonov Regularization Scheme For Implicit Surface Modeling, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu Jun 2007

A Multi-Scale Tikhonov Regularization Scheme For Implicit Surface Modeling, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape models from large-scale sets of point cloud samples efficiently. In this paper, we propose a fast solution for approximating implicit surfaces based on a multi-scale Tikhonov regularization scheme. The optimization of our scheme is formulated into a sparse linear equation system, which can be efficiently solved by factorization methods. Different from traditional approaches, our scheme does not employ auxiliary off-surface points, which not only saves the computational cost but also avoids the problem …


An Efficient Identity-Based Key Exchange Protocol With Kgs Forward Secrecy For Low-Power Devices, Robert W. Zhu, Guomin Yang, Duncan S. Wong Jun 2007

An Efficient Identity-Based Key Exchange Protocol With Kgs Forward Secrecy For Low-Power Devices, Robert W. Zhu, Guomin Yang, Duncan S. Wong

Research Collection School Of Computing and Information Systems

For an ID-based key exchange (KE) protocol, KGS forward secrecy is about the protection of previously established session keys after the master secret key of the Key Generation Server (KGS) is compromised. This is the strongest notion of forward secrecy that one can provide for an ID-based KE protocol. Among all the comparable protocols, there are only a few of them that provide this level of forward secrecy, and all of these protocols require expensive bilinear pairing operations and map-to-point hash operations that may not be suitable for implementation on low-power devices such as sensors. In this paper, we propose …


Making The ‘Most’ Out Of Rfid Technology: A Research Agenda For The Study Of The Adoption, Use And Impact Of Rfid, John Curtin, Robert J. Kauffman, Frederick J. Riggins Jun 2007

Making The ‘Most’ Out Of Rfid Technology: A Research Agenda For The Study Of The Adoption, Use And Impact Of Rfid, John Curtin, Robert J. Kauffman, Frederick J. Riggins

Research Collection School Of Computing and Information Systems

Radio frequency identification (RFID) technology dramatically increases the ability of the organization to acquire a vast array of data about the location and properties of any entity that can be physically tagged and wirelessly scanned within certain technical limitations. RFID can be applied to a variety of tasks, structures, work systems and contexts along the value chain, including business-to-business logistics, internal operations, business-to-consumer marketing, and after-sales service applications. As industry adoption of RFID increases there is an emerging interest by academic researchers to engage in scholarly investigation to understand how RFID relates to mobility, organizational and systems technologies (MOST). In …


Learning Nonparametric Kernel Matrices From Pairwise Constraints, Steven C. H. Hoi, Rong Jin, Michael R. Lyu Jun 2007

Learning Nonparametric Kernel Matrices From Pairwise Constraints, Steven C. H. Hoi, Rong Jin, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Some kernel learning methods assume the target kernel matrix to be a linear combination of parametric kernel matrices. This assumption again importantly limits the flexibility of the target kernel matrices. The key challenge with nonparametric kernel learning arises from the difficulty in linking the nonparametric kernels to the input patterns. In this paper, we resolve this problem by introducing the graph Laplacian of the observed data as a regularizer when optimizing the kernel matrix with …


Similarity Beyond Distance Measurement, Feng Kang, Rong Jin, Steven C. H. Hoi Jun 2007

Similarity Beyond Distance Measurement, Feng Kang, Rong Jin, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

One of the keys issues to content-based image retrieval is the similarity measurement of images. Images are represented as points in the space of low-level visual features and most similarity measures are based on certain distance measurement between these features. Given a distance metric, two images with shorter distance are deemed to more similar than images that are far away. The well-known problem with these similarity measures is the semantic gap, namely two images separated by large distance could share the same semantic content. In this paper, we propose a novel similarity measure of images that goes beyond the distance …