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

Articles 5041 - 5070 of 5707

Full-Text Articles in Entire DC Network

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 …


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 …


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 …


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 …


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 …


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 …


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 …


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 …


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 …


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.


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 …


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 …


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 …


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 …


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 …


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.


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 …


Modeling Architectural Strategy Using Design Structure Networks, C. Jason Woodard May 2007

Modeling Architectural Strategy Using Design Structure Networks, C. Jason Woodard

Research Collection School Of Computing and Information Systems

System architects face the formidable task of purposefully shaping an evolving space of complex designs. Their task s further complicated when they lack full control of the design process, and therefore must anticipate the behavior of other stakeholders, including the designers of component products and competing systems. This paper presents a conceptual tool called a design structure network (DSN) to help architects and design scientists reason effectively about these situations. A DSN is a graphical representation of a system’s design space. DSNs improve on existing representation schemes by providing a compact and intuitive way to express design options—the ability to …


Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong May 2007

Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong

Research Collection School Of Computing and Information Systems

Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network …


Learning To Classify E-Mail, Irena Koprinska, Josiah Poon, James Clark, Jason Yuk Hin Chan May 2007

Learning To Classify E-Mail, Irena Koprinska, Josiah Poon, James Clark, Jason Yuk Hin Chan

Research Collection School Of Computing and Information Systems

In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a supervised learning setting, we investigate the use of random forest for automatic e-mail filing into folders and spam e-mail filtering. We show that random forest is a good choice for these tasks as it runs fast on large and high dimensional databases, is easy to tune and is highly accurate, outperforming popular algorithms such as decision trees, support vector machines and naive Bayes. We introduce a new accurate feature selector with linear time complexity. …


Cognitive Evaluation Of Information Modeling Methods, Keng Siau, Yuan Wang May 2007

Cognitive Evaluation Of Information Modeling Methods, Keng Siau, Yuan Wang

Research Collection School Of Computing and Information Systems

In the field of information system engineering, information modeling method is a technique to capture user requirements and to understand system complexity. The importance of information modeling has been recognized by practitioners and researchers, but little has been explored to analyze the available information modeling methods or to evaluate them in terms of their strengths, weaknesses, and effectiveness. This research analyzes six information-modeling methods: use case diagram, rich picture diagram, entity-relationship diagram, Trochim’s concept mapping, repertory grid, and causal mapping. These information-modeling methods are analyzed from a cognitive perspective in order to better understand their nature, the assumptions, and the …


Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang May 2007

Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Considerable research and experiment results in recent years have shown that the server-proxy-user architecture represents an efficient and scalable new paradigm for multimedia content delivery. However, not much effort has been spent on the security issues in such systems. In this paper, we study data authentication in multimedia content delivery, and in particular, we focus on achieving end-to-end authentication from the multimedia server to end users in the server-proxy-user architecture where intermediary proxies transcode multimedia content dynamically. We present a formal model for the end-to-end authentication problem, and propose a basic construction for generic data modality and prove its security. …


Social Network Structures In Open Source Software Development Teams, Y. Long, Keng Siau Apr 2007

Social Network Structures In Open Source Software Development Teams, Y. Long, Keng Siau

Research Collection School Of Computing and Information Systems

Drawing on social network theories and previous studies, this research examines the dynamics of social network structures in open source software (OSS) teams. Three projects were selected from SourceForge.net in terms of their similarities as well as their differences. Monthly data were extracted from the bug tracking systems in order to achieve a longitudinal view of the interaction pattern of each project. Social network analysis was used to generate the indices of social structure. The finding suggests that the interaction pattern of OSS projects evolves from a single hub at the beginning to a corel periphery model as the projects …


Vulnerability Analysis Of Emap: An Efficient Rfid Mutual Authentication Protocol, Tieyan Li, Robert H. Deng Apr 2007

Vulnerability Analysis Of Emap: An Efficient Rfid Mutual Authentication Protocol, Tieyan Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we analyze the security vulnerabilities of EMAP, an efficient RFID mutual authentication protocol recently proposed by Peris-Lopez et al. (2006). We present two effective attacks, a de-synchronization attack and a full-disclosure attack, against the protocol. The former permanently disables the authentication capability of a RFID tag by destroying synchronization between the tag and the RFID reader. The latter completely compromises a tag by extracting all the secret information stored in the tag. The de-synchronization attack can be carried out in just round of interaction in EMAP while the full-disclosure attack is accomplished across several runs of EMAP. …


Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau Mar 2007

Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposed into two subproblems—sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an executable schedule from the semi-schedule via idle-time insertion. Sequencing is strongly NP-hard in general. Although timetabling is polynomial-time solvable, it can become a computational bottleneck if the procedure is executed many times within a larger framework. This paper makes two contributions. We …


Malicious Kgc Attacks In Certificateless Cryptography, Man Ho Au, Jing Chen, Joseph K. Liu, Yi Mu, Duncan S. Wong, Guomin Yang, Guomin Yang Mar 2007

Malicious Kgc Attacks In Certificateless Cryptography, Man Ho Au, Jing Chen, Joseph K. Liu, Yi Mu, Duncan S. Wong, Guomin Yang, Guomin Yang

Research Collection School Of Computing and Information Systems

Identity-based cryptosystems have an inherent key escrow issue, that is, the Key Generation Center (KGC) always knows user secret key. If the KGC is malicious, it can always impersonate the user. Certificateless cryptography, introduced by Al-Riyami and Paterson in 2003, is intended to solve this problem. However, in all the previously proposed certificateless schemes, it is always assumed that the malicious KGC starts launching attacks (so-called Type II attacks) only after it has generated a master public/secret key pair honestly. In this paper, we propose new security models that remove this assumption for both certificateless signature and encryption schemes. Under …


Valuing Information Technology Infrastructures: A Growth Options Approach, Qizhi Dai, Robert J. Kauffman, Salvatore T. March Mar 2007

Valuing Information Technology Infrastructures: A Growth Options Approach, Qizhi Dai, Robert J. Kauffman, Salvatore T. March

Research Collection School Of Computing and Information Systems

Decisions to invest in information technology (IT) infrastructure are often made based on an assessment of its immediate value to the organization. However, an important source of value comes from the fact that such technologies have the potential to be leveraged in the development of future applications. From a real options perspective, IT infrastructure investments create growth options that can be exercised if and when an organization decides to develop systems to provide new or enhanced IT capabilities. We present an analytical model based on real options that shows the process by which this potential is converted into business value, …


Percentage-Based Hybrid Pattern Training With Neural Network Specific Cross Over, Sheng-Uei Guan, Kiruthika Ramanathan Mar 2007

Percentage-Based Hybrid Pattern Training With Neural Network Specific Cross Over, Sheng-Uei Guan, Kiruthika Ramanathan

Research Collection School Of Computing and Information Systems

In this paper, a new weight-setting method is proposed to improve the training time and generalization accuracy of feed-forward neural networks. This method introduces a percentage-based hybrid pattern training (PHP) scheme and aims to provide a solution to the problem dependency of other Genetic Algorithm (GA)-based Neural Network weight-setting methods. A neural network is trained using a neural network specific GA until a certain percentage of the training patterns is learned. The weights thus obtained are used as the initial weights for backpropagation (BP) training, which is then applied to complete the network training. Further improvement to the method was …


Mining Generalized Associations Of Semantic Relations From Textual Web Content, Tao Jiang, Ah-Hwee Tan, We Wang Feb 2007

Mining Generalized Associations Of Semantic Relations From Textual Web Content, Tao Jiang, Ah-Hwee Tan, We Wang

Research Collection School Of Computing and Information Systems

Traditional text mining techniques transform free text into flat bags of words representation, which does not preserve sufficient semantics for the purpose of knowledge discovery. In this paper, we present a two-step procedure to mine generalized associations of semantic relations conveyed by the textual content of Web documents. First, RDF (resource description framework) metadata representing semantic relations are extracted from raw text using a myriad of natural language processing techniques. The relation extraction process also creates a term taxonomy in the form of a sense hierarchy inferred from WordNet. Then, a novel generalized association pattern mining algorithm (GP-Close) is applied …