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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 7681 - 7710 of 8651

Full-Text Articles in Entire DC Network

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


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


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 …


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 …


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 …


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 …


Can Uml Be Simplified? Practitioner Use Of Uml In Separate Domains, J. Erickson, Keng Siau Jun 2007

Can Uml Be Simplified? Practitioner Use Of Uml In Separate Domains, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

UML’s complexity is regularly criticized by practitioners and researchers alike, who argue that such complexity is a considerable detriment to the adoption and use of UML in the field. Attempts have been made to assess and/or measure UML’s complexity in a number of ways. Erickson and Siau proposed that a subset (kernel) of UML, composed of the most important constructs, could be equated with the complexity that practitioners face when using the modeling language. This research extends Erickson and Siau’s work by proposing a UML kernel in three application areas, real-time, webbased and enterprise systems. Compared to other modeling methods …


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 …


A Time-And-Value Centric Provenance Model And Architecture For Medical Event Streams, Marion Bllount, John Davis, Archan Misra, Daby Sow, Min Wang Jun 2007

A Time-And-Value Centric Provenance Model And Architecture For Medical Event Streams, Marion Bllount, John Davis, Archan Misra, Daby Sow, Min Wang

Research Collection School Of Computing and Information Systems

Provenance becomes a critical requirement for healthcare IT infrastructures, especially when pervasive biomedical sensors act as a source of raw medical streams for large-scale, automated clinical decision support systems. Medical and legal requirements will make it obligatory for such systems to answer queries regarding the underlying data samples from which output alerts are derived, the IDs of the processing components used and the privileges of the individuals and software components accessing the medical data. Unfortunately, existing models of either annotation or process based provenance are designed for transaction-oriented systems and do not satisfy the unique requirements for systems processing high-volume, …


Teaching "Global Project Management" With Distributed Team Projects, Randy Weinberg, Benjamin Gan Jun 2007

Teaching "Global Project Management" With Distributed Team Projects, Randy Weinberg, Benjamin Gan

Research Collection School Of Computing and Information Systems

The education of rising professionals must keep pace with changing forces of globalization and the realities of distributed work. Students who understand the basics of global project management, teamwork and collaboration are likely to find themselves at a competitive advantage over those who do not. This article describes the experiences in an undergraduate course called Global Project Management offered concurrently at two universities, one in the U.S. and one in Singapore, and incorporating collaborative student projects.


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 …


Time Capsule Signature: Efficient And Provably Secure Constructions, Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng Jun 2007

Time Capsule Signature: Efficient And Provably Secure Constructions, Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng

Research Collection School Of Computing and Information Systems

Time Capsule Signature, first formalized by Dodis and Yum in Financial Cryptography 2005, is a digital signature scheme which allows a signature to bear a (future) time t so that the signature will only be valid at time t or later, when a trusted third party called time server releases time-dependent information for checking the validity of a time capsule signature. Also, the actual signer of a time capsule signature has the privilege to make the signature valid before time t.In this paper, we provide a new security model of time capsule signature such that time server is not required …


A More Natural Way To Construct Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang Jun 2007

A More Natural Way To Construct Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang

Research Collection School Of Computing and Information Systems

Constructing identification schemes is one of the fundamental problems in cryptography, and is very useful in practice. An identity-based identification (IBI) scheme allows a prover to identify itself to a public verifier who knows only the claimed identity of the prover and some common information. In this paper, we propose a simple and efficient framework for constructing IBI schemes. Unlike some related framework which constructs IBI schemes from some standard identification schemes, our framework is based on some more fundamental assumptions on intractable problems. Depending on the features of the underlying intractable problems presumed in our framework, we can derive …


Intelligence Through Interaction: Towards A Unified Theory For Learning, Ah-Hwee Tan, Gail A. Carpenter, Stephen Grossberg Jun 2007

Intelligence Through Interaction: Towards A Unified Theory For Learning, Ah-Hwee Tan, Gail A. Carpenter, Stephen Grossberg

Research Collection School Of Computing and Information Systems

Machine learning, a cornerstone of intelligent systems, has typically been studied in the context of specific tasks, including clustering (unsupervised learning), classification (supervised learning), and control (reinforcement learning). This paper presents a learning architecture within which a universal adaptation mechanism unifies a rich set of traditionally distinct learning paradigms, including learning by matching, learning by association, learning by instruction, and learning by reinforcement. In accordance with the notion of embodied intelligence, such a learning theory provides a computational account of how an autonomous agent may acquire the knowledge of its environment in a real-time, incremental, and continuous manner. Through a …


The Multi-Agent Data Collection In Hla-Based Simulation System, Heng-Jie Song, Zhi-Qi Shen, Chunyan Miao, Ah-Hwee Tan, Guo-Peng Zhao Jun 2007

The Multi-Agent Data Collection In Hla-Based Simulation System, Heng-Jie Song, Zhi-Qi Shen, Chunyan Miao, Ah-Hwee Tan, Guo-Peng Zhao

Research Collection School Of Computing and Information Systems

The High Level Architecture (HLA) for distributed simulation was proposed by the Defense Modeling and Simulation Office of the Department of Defense (DOD) in order to support interoperability among simulations as well as reuse of simulation models. One aspect of reusability is to collect and analyze data generated in simulation exercises, including a record of events that occur during the execution, and the states of simulation objects. In order to improve the performance of existing data collection mechanisms in the HLA simulation system, the paper proposes a multi-agent data collection system. The proposed approach adopts the hierarchical data management/organization mechanism …


A Hybrid Of Plot-Based And Character-Based Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen Jun 2007

A Hybrid Of Plot-Based And Character-Based Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen

Research Collection School Of Computing and Information Systems

Interactive storytelling in the virtual environment attracts a lot of research interests in recent years. Story plot and character are two most important elements of a story. Based on these two elements, currently there are two research directions: plot-based and character-based interactive storytelling. However, plot-based approach lacks the refinement of character behaviors as character-based approach. On the other side, character-based approach does not follow a well organized story plot so that the moral of the story might be distorted. Therefore, there is a need to develop an integrated framework to achieve the balance between conveying story moral and enhancing the …


Assessing Organizational Innovation Capability And Its Effect On E-Commerce Initiatives, Ann L. Fruhling, Keng Siau Jun 2007

Assessing Organizational Innovation Capability And Its Effect On E-Commerce Initiatives, Ann L. Fruhling, Keng Siau

Research Collection School Of Computing and Information Systems

This research uses a qualitative approach to study the innovative capability of two organizations and the effect of innovation on their E-Commerce initiatives, strategies, and outcomes. The Innovation Strategy Model is used in this research to analyze the innovative capability of two organizations. The case study research methodology was selected and two case studies are presented. The research results show that one organization is more innovative than the other in terms of its innovative capability. A post-study follow-up shows that the organization that was high on innovative capability was very successful in their E-Commerce initiative whereas the other organization was …


Usage-Based Versus Flat Pricing For E-Business Services With Differentiated Qos, Zhen Liu, Laura Wynter, Cathy Xia Jun 2007

Usage-Based Versus Flat Pricing For E-Business Services With Differentiated Qos, Zhen Liu, Laura Wynter, Cathy Xia

Research Collection School Of Computing and Information Systems

Design of e-commerce services that are competitive, in such a quickly responding market, requires the analyses of prices and price structures. We present a general model of an e-commerce market that allows us to analyze optimal price structures, both flat and usage-based. Based on the price structure of a major web hosting provider, we consider both single-tier and two-tier (burst-rate) pricing, and our result suggests that the more complex two-tier structure may not be worth the marketing effort, as the firm?s equilibrium profits will not increase through the use of this structure. An essential feature of our approach is that …


Innovation Engine, Arcot Desai Narasimhalu Jun 2007

Innovation Engine, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

This paper describes a meta-model for innovation using an automobile engine as a metaphor. This innovation meta-model is used to manage a collection of innovation models. We develop an algorithm to identify innovations with potential for success using this meta-model. This meta-model can be used by corporations and individuals to identify plausible innovations at any given point in time.


Instance Weighting For Domain Adaptation In Nlp, Jing Jiang, Chengxiang Zhai Jun 2007

Instance Weighting For Domain Adaptation In Nlp, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

Domain adaptation is an important problem in natural language processing (NLP) due to the lack of labeled data in novel domains. In this paper, we study the domain adaptation problem from the instance weighting per- spective. We formally analyze and charac- terize the domain adaptation problem from a distributional view, and show that there are two distinct needs for adaptation, cor- responding to the different distributions of instances and classification functions in the source and the target domains. We then propose a general instance weighting frame- work for domain adaptation. Our empir- ical results on three NLP tasks show that …


Mobile G-Portal Supporting Collaborative Sharing And Learning In Geography Fieldwork: An Empirical Study, Yin-Leng Theng, Kuah-Li Tan, Ee Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo Jun 2007

Mobile G-Portal Supporting Collaborative Sharing And Learning In Geography Fieldwork: An Empirical Study, Yin-Leng Theng, Kuah-Li Tan, Ee Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo

Research Collection School Of Computing and Information Systems

Integrated with G-Portal, a Web-based geospatial digital library of geography resources, this paper describes the implementation of Mobile G-Portal, a group of mobile devices as learning assistant tools supporting collaborative sharing and learning for geography fieldwork. Based on a modified Technology Acceptance Model and a Task-Technology Fit model, an initial study with Mobile G-Portal was conducted involving 39 students in a local secondary school. The findings suggested positive indication of acceptance of Mobile G-Portal for geography fieldwork. The paper concludes with a discussion on technological challenges, recommendations for refinement of Mobile G-Portal, and design implications in general for digital libraries …


Continuous Nearest Neighbor Queries Over Sliding Windows, Kyriakos Mouratidis, Dimitris Papadias Jun 2007

Continuous Nearest Neighbor Queries Over Sliding Windows, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly dynamic scenarios, where the queries and the data objects move frequently and arbitrarily. All existing methods, however, assume the Euclidean distance metric. In this paper we study k-NN monitoring in road networks, where the distance between a query and a data object is determined by the length of the shortest path connecting them. We propose two methods that can handle arbitrary object and query moving patterns, as well as fluctuations of edge weights. The first one maintains the query results by processing only updates that may invalidate …


Simplifying Cyber Foraging For Mobile Devices, Rajesh Krishna Balan, Darren Gergle, Mahadev Satyanarayanan, James Herbsleb Jun 2007

Simplifying Cyber Foraging For Mobile Devices, Rajesh Krishna Balan, Darren Gergle, Mahadev Satyanarayanan, James Herbsleb

Research Collection School Of Computing and Information Systems

Cyber foraging is the transient and opportunistic use of compute servers by mobile devices. The short market life of such devices makes rapid modification of applications for remote execution an important problem. We describe a solution that combines a "little language" for cyber foraging with an adaptive runtime system. We report results from a user study showing that even novice developers are able to successfully modify large, unfamiliar applications in just a few hours. We also show that the quality of novice-modified and expert-modified applications are comparable in most cases.


Designing An Experimental Gaming Platform For Trading Grid Resources, Danny Oh, Shih-Fen Cheng, Dan Ma, Ravi Bapna Jun 2007

Designing An Experimental Gaming Platform For Trading Grid Resources, Danny Oh, Shih-Fen Cheng, Dan Ma, Ravi Bapna

Research Collection School Of Computing and Information Systems

This paper describes our current work in designing an experimental gaming platform for simulating the trading of grid resources. The open platform allows researchers in grid economics to experiment with different market structures and pricing models. We would be using a design science approach in the implementation. Key design considerations and an overview of the functional design of the platform are presented and discussed.


Maximizing Broadcast And Multicast Traffic Load Through Link-Rate Diversity In Wireless Mesh Networks, Chun Tung Chou, Bao Hua Liu, Archan Misra Jun 2007

Maximizing Broadcast And Multicast Traffic Load Through Link-Rate Diversity In Wireless Mesh Networks, Chun Tung Chou, Bao Hua Liu, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies some of the fundamental challenges and opportunities associated with the network-layer broadcast and multicast in a multihop multirate wireless mesh network (WMN). In particular, we focus on exploiting the ability of nodes to perform link-layer broadcasts at different rates (with correspondingly different coverage areas). We first show how, in the broadcast wireless medium, the available capacity at a mesh node for a multicast transmission is not just a function of the aggregate pre-existing traffic load of other interfering nodes, but intricately coupled to the actual (sender, receiver) set and the link-layer rate of each individual transmission. We …


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 …


Editors' Introduction To Regular Research Section, Jae Kyu Lee, Patrick Y. K. Chau, Robert J. Kauffman, Norman M. Sadeh Jun 2007

Editors' Introduction To Regular Research Section, Jae Kyu Lee, Patrick Y. K. Chau, Robert J. Kauffman, Norman M. Sadeh

Research Collection School Of Computing and Information Systems

The second section of this issue consists of four regular submissions.In “A New Mobile Payment Scheme for Roaming Services”, Ren-Junn Hwang, Sheng-Hua Shiau and Ding-Far Jan present a new mobile payment scheme that supports anonymity while allowing consumers to roam outside of their home operator’s network.Vasudeva Akula and Daniel A. Menascé’s article on “Two-level Workload Characterization of Online Auctions” analyzes the workload of an online auction site. The analysis reveals the presence of heavy tailed distributions and looks at bidding activity during the closing minutes of auctions. The article suggests that results from this analysis could be used to devise …


Are Radio Sources And Gamma Ray Bursts Luminal Booms?, Manoj Thulasidas Jun 2007

Are Radio Sources And Gamma Ray Bursts Luminal Booms?, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The softening of a Gamma Ray Burst (GRB) afterglow bears remarkable similarities to the frequency evolution in a sonic boom. Atthe front end of the sonic boom cone, the frequency is infinite, much like a GRB. Inside the cone, the frequencyrapidly decreases to infrasonic ranges and the sound source appears at two places at the same time,mimicking the double-lobed radio sources. Although a “luminal” boom violates the Lorentz invarianceand is therefore forbidden, it is tempting to work out the details and compare them with existing data. This temptation is further enhanced by the observed superluminality in the celestial objects associated …