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

Physical Sciences and Mathematics Commons™

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

2006

Research Collection School Of Computing and Information Systems

Discipline
Keyword

Articles 1 - 30 of 112

Full-Text Articles in Physical Sciences and Mathematics

Supply Chain Information Sharing In A Macro Prediction Market, Zhiling Guo, Fang Fang, Andrew B. Whinston Dec 2006

Supply Chain Information Sharing In A Macro Prediction Market, Zhiling Guo, Fang Fang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

This paper aims to address supply chain partners' incentives for information sharing from an information systems design perspective. Specifically, we consider a supply chain characterized by N geographically distributed retailers who order a homogeneous product from one manufacturer. Each retailer's demand risk consists of two parts: a systematic risk part that affects all retailers and an idiosyncratic risk part that only has a local effect. We propose a macro prediction market to effectively elicit and aggregate useful information about systematic demand risk. We show that such information can be used to achieve accurate demand forecast sharing and better channel coordination …

Go to article

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Composition, Jialie Shen, John Shepherd, Ngu Ahh Dec 2006

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Composition, Jialie Shen, John Shepherd, Ngu Ahh

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to constructing music descriptors to support efficient content-based music retrieval and classification. The system applies multiple musical properties combined with a hybrid architecture based on principal component analysis (PCA) and a multilayer perceptron neural network. This architecture enables straightforward incorporation of multiple musical feature vectors, based on properties such as timbral texture, pitch, and rhythm structure, into a single low-dimensioned vector that is more effective for classification than the larger individual feature vectors. The use of supervised training enables incorporation of human musical perception that further enhances the classification process. We compare …

Go to article

Formal Analysis And Systematic Construction Of Two-Factor Authentication Scheme, Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng Dec 2006

Formal Analysis And Systematic Construction Of Two-Factor Authentication Scheme, Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng

Research Collection School Of Computing and Information Systems

One of the most commonly used two-factor authentication mechanisms is based on smart card and user’s password. Throughout the years, there have been many schemes proposed, but most of them have already been found flawed due to the lack of formal security analysis. On the cryptanalysis of this type of schemes, in this paper, we further review two recently proposed schemes and show that their security claims are invalid. To address the current issue, we propose a new and simplified property set and a formal adversarial model for analyzing the security of this type of schemes. We believe that the …

Go to article

On The Lower Bound Of Local Optimums In K-Means Algorithms, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung Dec 2006

On The Lower Bound Of Local Optimums In K-Means Algorithms, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Set-Based Cascading Approaches For Magnetic Resonance (Mr) Image Segmentation (Scamis), Jiang Liu, Tze-Yun Leong, Kin Ban Chee, Boon Pin Tan, Borys Shuter, Shih Chang Wang Dec 2006

Set-Based Cascading Approaches For Magnetic Resonance (Mr) Image Segmentation (Scamis), Jiang Liu, Tze-Yun Leong, Kin Ban Chee, Boon Pin Tan, Borys Shuter, Shih Chang Wang

Research Collection School Of Computing and Information Systems

This paper introduces Set-based Cascading Approach for Medical Image Segmentation (SCAMIS), a new methodology for segmentation of medical imaging by integrating a number of algorithms. Existing approaches typically adopt the pipeline methodology. Although these methods provide promising results, the results generated are still susceptible to over-segmentation and leaking. In our methodology, we describe how set operations can be utilized to better overcome these problems. To evaluate the effectiveness of this approach, Magnetic Resonance Images taken from a teaching hospital research programme have been utilised, to reflect the real world quality needed for testing in patient datasets. A comparison between the …

Go to article

Rapid Identification Of Column Heterogeneity, Bing Tian Dai, Nick Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubramanian Dec 2006

Rapid Identification Of Column Heterogeneity, Bing Tian Dai, Nick Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubramanian

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith Dec 2006

Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith

Research Collection School Of Computing and Information Systems

The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …

Go to article

Dynamic Multi-Linked Negotiations In Multi-Echelon Production Scheduling Networks, Hoong Chuin Lau, Guan Li Soh, Wee Chong Wan Dec 2006

Dynamic Multi-Linked Negotiations In Multi-Echelon Production Scheduling Networks, Hoong Chuin Lau, Guan Li Soh, Wee Chong Wan

Research Collection School Of Computing and Information Systems

In this paper, we are concerned with scheduling resources in a multi-tier production/logistics system for multi-indenture goods. Unlike classical production scheduling problems, the problem we study is concerned with local utilities which are private. We present an agent model and investigate an efficient scheme for handling multi-linked agent negotiations. With this scheme we attempt to overcome the drawbacks of sequential negotiations and negotiation parameter settings. Our approach is based on embedding a credit-based negotiation protocol within a local search scheduling algorithm. We demonstrate the computational efficiency and effectiveness of the approach in solving a real-life dynamic production scheduling problem which …

Go to article

Measuring Qualities Of Articles Contributed By Online Communities, Ee Peng Lim, Ba-Quy Vuong, Hady W. Lauw, Aixin Sun Dec 2006

Measuring Qualities Of Articles Contributed By Online Communities, Ee Peng Lim, Ba-Quy Vuong, Hady W. Lauw, Aixin Sun

Research Collection School Of Computing and Information Systems

Using open source Web editing software (e.g., wiki), online community users can now easily edit, review and publish articles collaboratively. While much useful knowledge can be derived from these articles, content users and critics are often concerned about their qualities. In this paper, we develop two models, namely basic model and peer review model, for measuring the qualities of these articles and the authorities of their contributors. We represent collaboratively edited articles and their contributors in a bipartite graph. While the basic model measures an article's quality using both the authorities of contributors and the amount of contribution from each …

Go to article

Designing Web Sites For Customer Loyalty Across Business Domains: A Multilevel Analysis, S. Mithas, Narayanasamy Ramasubbu, M. S. Krishnan, C. Fornell Dec 2006

Designing Web Sites For Customer Loyalty Across Business Domains: A Multilevel Analysis, S. Mithas, Narayanasamy Ramasubbu, M. S. Krishnan, C. Fornell

Research Collection School Of Computing and Information Systems

Web Sites are important components of Internet strategy for organizations. This paper develops a theoretical model for understanding the effect of Web site design elements on customer loyalty to a Web site. We show the relevance of the business domain of a Web site to gain a contextual understanding of relative importance of Web site design elements. We use a hierarchical linear modeling approach to model multilevel and cross-level interactions that have not been explicitly considered in previous research. By analyzing, data on more than 12,000 online customer surveys for 43 Web sites in several business domains, we find that …

Go to article

Online Advertising By The Comparison Challenge Approach, Jae Wong Lee, Jae Kyu Lee Dec 2006

Online Advertising By The Comparison Challenge Approach, Jae Wong Lee, Jae Kyu Lee

Research Collection School Of Computing and Information Systems

To enhance the effectiveness of online comparisons from a manufacturer's point of view, we develop a framework for the comparison challenge approach. To develop the comparison challenge framework, we analyze 12 factors that determine the characteristics of comparison and propose models of valuable comparison challenges using the CompareMe and CompareThem strategies. We demonstrate the approaches with the example of PC selection. To help plan the comparison challenges, we formulate a mathematical programming model that maximizes the total value of comparison under the constraints of comparison opportunity and budgetary limitation. The model is applied to eight comparison scenarios, and its performance …

Go to article

Clique Percolation For Finding Naturally Cohesive And Overlapping Document Clusters, Wei Gao, Kam-Fai Wong, Yunqing Xia, Ruifeng Xu Dec 2006

Clique Percolation For Finding Naturally Cohesive And Overlapping Document Clusters, Wei Gao, Kam-Fai Wong, Yunqing Xia, Ruifeng Xu

Research Collection School Of Computing and Information Systems

Techniques for find document clusters mostly depend on models that impose strong explicit and/or implicit priori assumptions. As a consequence, the clustering effects tend to be unnatural and stray away from the intrinsic grouping natures of a document collection. We apply a novel graph-theoretic technique called Clique Percolation Method (CPM) for document clustering. In this method, a process of enumerating highly cohesive maximal document cliques is performed in a random graph, where those strongly adjacent cliques are mingled to form naturally overlapping clusters. Our clustering results can unveil the inherent structural connections of the underlying data. Experiments show that CPM …

Go to article

Query-Based Watermarking For Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan Dec 2006

Query-Based Watermarking For Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

As increasing amount of XML data is exchanged over the internet, copyright protection of this type of data is becoming an important requirement for many applications. In this paper, we introduce a rights protection scheme for XML data based on digital watermarking. One of the main challenges for watermarking XML data is that the data could be easily reorganized by an adversary in an attempt to destroy any embedded watermark. To overcome it, we propose a query-based watermarking scheme, which creates queries to identify available watermarking capacity, such that watermarks could be recovered from reorganized data through query rewriting. The …

Go to article

Continuous Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim Dec 2006

Continuous Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. In these applications, continuous query processing is often required and their efficient evaluation is a critical requirement to be met. Due to the limited power supply for sensor nodes, energy efficiency is a major performance measure in such query evaluation. In this paper, we focus on continuous kNN query processing. We observe that the centralized data storage and monitoring schemes do not favor energy efficiency. We therefore propose a localized scheme to monitor long running nearest neighbor queries in sensor networks. …

Go to article

Plans As Products Of Learning, Samin Karim, Budhitama Subagdja, Liz Sonenberg Dec 2006

Plans As Products Of Learning, Samin Karim, Budhitama Subagdja, Liz Sonenberg

Research Collection School Of Computing and Information Systems

This paper presents motivations and current related work in the field of plan learning. Additionally, two approaches that achieve plan learning are presented. The two presented approaches are centred on the BDI framework of agency and have particular focus on plans, which, alongside goals, are the means to fulfil intentions in most pragmatic and theoretical realisations of the BDI framework. The first approach is a hybrid architecture that combines a BDI plan extractor and executor with a generic low-level learner. The second approach uses hypotheses to suggest incremental refinements of a priori plans. Both approaches achieve plan generation that is …

Go to article

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Combination, Jialie Shen, John Shepherd, Ann H. H. Ngu Dec 2006

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Combination, Jialie Shen, John Shepherd, Ann H. H. Ngu

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to constructing music descriptors to support efficient content-based music retrieval and classification. The system applies multiple musical properties combined with a hybrid architecture based on principal component analysis (PCA) and a multilayer perceptron neural network. This architecture enables straightforward incorporation of multiple musical feature vectors, based on properties such as timbral texture, pitch, and rhythm structure, into a single low-dimensioned vector that is more effective for classification than the larger individual feature vectors. The use of supervised training enables incorporation of human musical perception that further enhances the classification process. We compare …

Go to article

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen Dec 2006

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen

Research Collection School Of Computing and Information Systems

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge lengths are positive real numbers, which …

Go to article

Reputation Stretching In Online Auctions, Jianqing Chen, Mei Lin, Andrew B. Whinston Dec 2006

Reputation Stretching In Online Auctions, Jianqing Chen, Mei Lin, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

Reputation systems are ubiquitously employed in the online marketplaces to provide information on users’ abilities and trustworthiness. We focus particularly on the problem of reputation stretching, the extension of an established reputation into a new market. By examining various factors—market size, the expected performance in the expanding market, and the risk of performance in the expanding market—we characterize conditions that affect bidder’s stretching decision in the expanding market. Moreover, we analyze both the short-term and the long-term expanding cases, and obtain contrasting results in the two settings.

Go to article

Understanding User Perceptions On Usefulness And Usability Of An Integrated Wiki-G-Portal, Yin-Leng Theng, Yuanyuan Li, Ee Peng Lim, Zhe Wang, Dion Hoe-Lian Goh, Chew-Hung Chang, Kalyani Chatterjea, Jun Zhang Nov 2006

Understanding User Perceptions On Usefulness And Usability Of An Integrated Wiki-G-Portal, Yin-Leng Theng, Yuanyuan Li, Ee Peng Lim, Zhe Wang, Dion Hoe-Lian Goh, Chew-Hung Chang, Kalyani Chatterjea, Jun Zhang

Research Collection School Of Computing and Information Systems

This paper describes a pilot study on Wiki-G-Portal, a project integrating Wikipedia, an online encyclopedia, into G-Portal, a Web-based digital library, of geography resources. Initial findings from the pilot study seemed to suggest positive perceptions on usefulness and usability of Wiki-G-Portal, as well as subjects' attitude and intention to use.

Go to article

Robust Controllability In Temporal Constraint Networks Under Uncertainty, Hoong Chuin Lau, Jia Li, Roland H. C. Yap Nov 2006

Robust Controllability In Temporal Constraint Networks Under Uncertainty, Hoong Chuin Lau, Jia Li, Roland H. C. Yap

Research Collection School Of Computing and Information Systems

Temporal constraint networks are embedded in many planning and scheduling problems. In dynamic problems, a fundamental challenge is to decide whether such a network can be executed as uncertainty is revealed over time. Very little work in this domain has been done in the probabilistic context. In this paper, we propose a Temporal Constraint Network (TCN) model where durations of uncertain activities are represented by random variables. We wish to know whether such a network is robust controllable, i.e. can be executed dynamically within a given failure probability, and if so, how one might find a feasible schedule as the …

Go to article

Modeling Local Interest Points For Semantic Detection And Video Search At Trecvid 2006, Yu-Gang Jiang, Xiaoyong Wei, Chong-Wah Ngo, Hung-Khoon Tan, Wanlei Zhao, Xiao Wu Nov 2006

Modeling Local Interest Points For Semantic Detection And Video Search At Trecvid 2006, Yu-Gang Jiang, Xiaoyong Wei, Chong-Wah Ngo, Hung-Khoon Tan, Wanlei Zhao, Xiao Wu

Research Collection School Of Computing and Information Systems

Local interest points (LIPs) and their features have been shown to obtain surprisingly good results in object detection and recognition. Its effectiveness and scalability, however, have not been seriously addressed in large-scale multimedia database, for instance TRECVID benchmark. The goal of our works is to investigate the role and performance of LIPs, when coupling with multi-modality features, for high-level feature extraction and automatic video search.

Go to article

Dcma: A Label-Switching Mac For Efficient Packet Forwarding In Multi-Hop Wireless Networks, Arup Acharya, Sachin Ganu, Archan Misra Nov 2006

Dcma: A Label-Switching Mac For Efficient Packet Forwarding In Multi-Hop Wireless Networks, Arup Acharya, Sachin Ganu, Archan Misra

Research Collection School Of Computing and Information Systems

This paper addresses the problem of efficient packet forwarding in a multihop, wireless "mesh" network. We present an efficient interface contained forwarding (ICF) architecture for a "wireless router," i.e., a forwarding node with a single wireless network interface card (NIC) in a multihop wireless network that allows a packet to be forwarded entirely within the NIC of the forwarding node without requiring per-packet intervention by the node's CPU. To effectively forward packets in a pipelined fashion without incurring the 802.11-related overheads of multiple independent channel accesses, we specify a slightly modified version of the 802.11 MAC, called data driven cut-through …

Go to article

A Model For Anticipatory Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim Nov 2006

A Model For Anticipatory Event Detection, Qi He, Kuiyu Chang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Event detection is a very important area of research that discovers new events reported in a stream of text documents. Previous research in event detection has largely focused on finding the first story and tracking the events of a specific topic. A topic is simply a set of related events defined by user supplied keywords with no associated semantics and little domain knowledge. We therefore introduce the Anticipatory Event Detection (AED) problem: given some user preferred event transition in a topic, detect the occurence of the transition for the stream of news covering the topic. We confine the events to …

Go to article

Integration Of Wikipedia And A Geography Digital Library, Ee Peng Lim, Zhe Wang, Darwin Sadeli, Yuanyuan Li, Chew-Hung Chang, Kalyani Chatterjea, Dion Hoe-Lian Goh, Yin-Leng Theng, Jun Zhang, Aixin Sun Nov 2006

Integration Of Wikipedia And A Geography Digital Library, Ee Peng Lim, Zhe Wang, Darwin Sadeli, Yuanyuan Li, Chew-Hung Chang, Kalyani Chatterjea, Dion Hoe-Lian Goh, Yin-Leng Theng, Jun Zhang, Aixin Sun

Research Collection School Of Computing and Information Systems

In this paper, we address the problem of integrating Wikipedia, an online encyclopedia, and G-Portal, a web-based digital library, in the geography domain. The integration facilitates the sharing of data and services between the two web applications that are of great value in learning. We first present an overall system architecture for supporting such an integration and address the metadata extraction problem associated with it. In metadata extraction, we focus on extracting and constructing metadata for geo-political regions namely cities and countries. Some empirical performance results will be presented. The paper will also describe the adaptations of G-Portal and Wikipedia …

Go to article

New Paradigm Of Inference Control With Trusted Computing, Yanjiang Yang, Yingjiu Li, Robert H. Deng Nov 2006

New Paradigm Of Inference Control With Trusted Computing, Yanjiang Yang, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query the protected database. As a result, most auditing methods, though rigorously studied, can never be implemented in practice for protecting largescale real-world database systems. To shift this paradigm, we propose a new inference control architecture that will entrust inference control to each users platform, provided that the platform is equipped with trusted computing technology. The trusted computing technology is designed to attest the state of a users platform to the database server, so as to assure the …

Go to article

Low-Latency Broadcast In Multirate Wireless Mesh Networks, Chun Tung Chou, Archan Misra, Junaid Qadir Nov 2006

Low-Latency Broadcast In Multirate Wireless Mesh Networks, Chun Tung Chou, Archan Misra, Junaid Qadir

Research Collection School Of Computing and Information Systems

In a multirate wireless network, a node can dynamically adjust its link transmission rate by switching between different modulation schemes. In the current IEEE802.11a/b/g standards, this rate adjustment is defined for unicast traffic only. In this paper, we consider a wireless mesh network (WMN), where a node can dynamically adjust its link-layer multicast rates to its neighbors, and address the problem of realizing low-latency network-wide broadcast in such a mesh. We first show that the multirate broadcast problem is significantly different from the single-rate case. We will then present an algorithm for achieving low-latency broadcast in a multirate mesh which …

Go to article

Smartic: Towards Building An Accurate, Robust And Scalable Specification Miner, David Lo, Siau-Cheng Khoo Nov 2006

Smartic: Towards Building An Accurate, Robust And Scalable Specification Miner, David Lo, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Improper management of software evolution, compounded by imprecise, and changing requirements, along with the “short time to market ” requirement, commonly leads to a lack of up-to-date specifications. This can result in software that is characterized by bugs, anomalies and even security threats. Software specification mining is a new technique to address this concern by inferring specifications automatically. In this paper, we propose a novel API specification mining architecture called SMArTIC (Specification Mining Architecture with Trace fIltering and Clustering) to improve the accuracy, robustness and scalability of specification miners. This architecture is constructed based on two hypotheses: (1) Erroneous traces …

Go to article

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang Oct 2006

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method …

Go to article

Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang Oct 2006

Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang

Research Collection School Of Computing and Information Systems

This paper presents and elaborates the concept of Web service usage patterns and pattern discovery through service mining. We define three different levels of service usage data: i) user request level, ii) template level and iii) instance level. At each level, we investigate patterns of service usage data and the discovery of these patterns. An algorithm for service pattern discovery at the template level is presented. We show the system architecture of a service-mining enabled service registry repository. Web service patterns, pattern discovery and pattern mining supports the discovery and composition of complex services, which in turn supports the application …

Go to article

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau Oct 2006

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of deciding when and how to perform reallocation of existing spare parts in a multi-echelon reparable item inventory system. We present a mathematical model that solves the problem when there are two reallocation instants, in response to the open challenge post by Cao and Silver(2005) to consider two or more possible reallocations within a replenishment cycle.

Go to article

Next Last