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 6961 - 6990 of 8567

Full-Text Articles in Entire DC Network

On Challenges In Evaluating Malware Clustering, Peng Li, Limin Liu, Debin Gao, Michael K Reiter Sep 2010

On Challenges In Evaluating Malware Clustering, Peng Li, Limin Liu, Debin Gao, Michael K Reiter

Research Collection School Of Computing and Information Systems

Malware clustering and classification are important tools that enable analysts to prioritize their malware analysis efforts. The recent emergence of fully automated methods for malware clustering and classification that report high accuracy suggests that this problem may largely be solved. In this paper, we report the results of our attempt to confirm our conjecture that the method of selecting ground-truth data in prior evaluations biases their results toward high accuracy. To examine this conjecture, we apply clustering algorithms from a different domain (plagiarism detection), first to the dataset used in a prior work's evaluation and then to a wholly new …


Comprehensive Evaluation Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Aditya Budi Sep 2010

Comprehensive Evaluation Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Aditya Budi

Research Collection School Of Computing and Information Systems

In statistics and data mining communities, there have been many measures proposed to gauge the strength of association between two variables of interest, such as odds ratio, confidence, Yule-Y, Yule-Q, Kappa, and gini index. These association measures have been used in various domains, for example, to evaluate whether a particular medical practice is associated positively to a cure of a disease or whether a particular marketing strategy is associated positively to an increase in revenue, etc. This paper models the problem of locating faults as association between the execution or non-execution of particular program elements with failures. There have been …


An Automated Approach For Finding Variable-Constant Pairing Bugs, Julia Lawall, David Lo Sep 2010

An Automated Approach For Finding Variable-Constant Pairing Bugs, Julia Lawall, David Lo

Research Collection School Of Computing and Information Systems

Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically depends on the correct usage of these values. Nevertheless, compilers for the languages typically used in implementing operating systems provide little support for checking the usage of named constants. This affects correctness, when a constant is used in a context where its value is meaningless, and software maintenance, when a constant has the right value for its usage context but the wrong name. We propose a hybrid program-analysis and data-mining based approach to identify …


Embellishing Text Search Queries To Protect User Privacy, Hwee Hwa Pang, Xuhua Ding, Xiaokui Xiao Sep 2010

Embellishing Text Search Queries To Protect User Privacy, Hwee Hwa Pang, Xuhua Ding, Xiaokui Xiao

Research Collection School Of Computing and Information Systems

Users of text search engines are increasingly wary that their activities may disclose confidential information about their business or personal profiles. It would be desirable for a search engine to perform document retrieval for users while protecting their intent. In this paper, we identify the privacy risks arising from semantically related search terms within a query, and from recurring highspecificity query terms in a search session. To counter the risks, we propose a solution for a similarity text retrieval system to offer anonymity and plausible deniability for the query terms, and hence the user intent, without degrading the system’s precision-recall …


Context-Aware Query Recommendations, Alexandros Ntoulas, Heasoo Hwang, Lise Getoor, Stelios Paparizos, Hady Wirawan Lauw Sep 2010

Context-Aware Query Recommendations, Alexandros Ntoulas, Heasoo Hwang, Lise Getoor, Stelios Paparizos, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Described is a search-related technology in which context information regarding a user's prior search actions is used in making query recommendations for a current user action, such as a query or click. To determine whether each set or subset of context information is relevant to the user action, data obtained from a query log is evaluated. More particularly, a query transition (query-query) graph and a query click (query-URL) graph are extracted from the query log; vectors are computed for the current action and each context/sub-context and evaluated against vectors in the graphs to determine current action-to-context similarity. Also described is …


Semi-Supervised Distance Metric Learning For Collaborative Image Retrieval And Clustering, Steven C. H. Hoi, Wei Liu, Shih-Fu Chang Aug 2010

Semi-Supervised Distance Metric Learning For Collaborative Image Retrieval And Clustering, Steven C. H. Hoi, Wei Liu, Shih-Fu Chang

Research Collection School Of Computing and Information Systems

Learning a good distance metric plays a vital role in many multimedia retrieval and data mining tasks. For example, a typical content-based image retrieval (CBIR) system often relies on an effective distance metric to measure similarity between any two images. Conventional CBIR systems simply adopting Euclidean distance metric often fail to return satisfactory results mainly due to the well-known semantic gap challenge. In this article, we present a novel framework of Semi-Supervised Distance Metric Learning for learning effective distance metrics by exploring the historical relevance feedback log data of a CBIR system and utilizing unlabeled data when log data are …


Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri Aug 2010

Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri

Research Collection School Of Computing and Information Systems

As human-agent teams get increasingly deployed in the real-world, agent designers need to take into account that humans and agents have different abilities to specify preferences. In this paper, we focus on how human biases in specifying preferences for resources impacts the performance of large, heterogeneous teams. In particular, we model the inclination of humans to simplify their preference functions and to exaggerate their utility for desired resources, and show the effect of these biases on the team performance. We demonstrate this on two different problems, which are representative of many resource allocation problems addressed in literature. In both these …


Architectural Strategy For Digital Platforms: Technological And Organizational Perspectives, Jason Woodard, Joel West Aug 2010

Architectural Strategy For Digital Platforms: Technological And Organizational Perspectives, Jason Woodard, Joel West

Research Collection School Of Computing and Information Systems

different spatial queries such as kNN query, range query and CNN query. A comprehensive experimental study has been conducted to


On The Annotation Of Web Videos By Efficient Near-Duplicate Search, Wan-Lei Zhao, Xiao Wu, Chong-Wah Ngo Aug 2010

On The Annotation Of Web Videos By Efficient Near-Duplicate Search, Wan-Lei Zhao, Xiao Wu, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

With the proliferation of Web 2.0 applications, usersupplied social tags are commonly available in social media as a means to bridge the semantic gap. On the other hand, the explosive expansion of social web makes an overwhelming number of web videos available, among which there exists a large number of near-duplicate videos. In this paper, we investigate techniques which allow effective annotation of web videos from a data-driven perspective. A novel classifier-free video annotation framework is proposed by first retrieving visual duplicates and then suggesting representative tags. The significance of this paper lies in the addressing of two timely issues …


Automatic Generation Of Semantic Fields For Annotating Web Images, Gang Wang, Tat Seng Chua, Chong-Wah Ngo, Yong Cheng Wang Aug 2010

Automatic Generation Of Semantic Fields For Annotating Web Images, Gang Wang, Tat Seng Chua, Chong-Wah Ngo, Yong Cheng Wang

Research Collection School Of Computing and Information Systems

The overwhelming amounts of multimedia contents have triggered the need for automatically detecting the semantic concepts within the media contents. With the development of photo sharing websites such as Flickr, we are able to obtain millions of images with usersupplied tags. However, user tags tend to be noisy, ambiguous and incomplete. In order to improve the quality of tags to annotate web images, we propose an approach to build Semantic Fields for annotating the web images. The main idea is that the images are more likely to be relevant to a given concept, if several tags to the image belong …


On Decision Support For Deliberating With Constraints In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, David H. Wood Aug 2010

On Decision Support For Deliberating With Constraints In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, David H. Wood

Research Collection School Of Computing and Information Systems

This paper introduces the Deliberation Decision Support System (DDSS). The DDSS obtains heuristically (using a genetic algorithm) solutions of interest for constrained optimization models. This is illustrated, without loss of generality, by generalized assignment problems. The DDSS also provides users with graphical tools that support post-solution deliberation for constrained optimization models. The DDSS and this paper, as befits practical concerns, are focused on deliberation with respect to the constraints of the models being used.


An Efficient Signcryption Scheme With Key Privacy And Its Extension To Ring Signcryption, Chung Ki Li, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Sherman S. M. Chow Aug 2010

An Efficient Signcryption Scheme With Key Privacy And Its Extension To Ring Signcryption, Chung Ki Li, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Sherman S. M. Chow

Research Collection School Of Computing and Information Systems

In Information Processing Letters (2006), Tan pointed out that the anonymous signcryption scheme proposed by Yang, Wong and Deng (YWD) in ISC 2005 provides neither confidentiality nor anonymity. However, no discussion has been made on how a secure scheme can be made and there is no secure scheme available to date. In this paper, we propose a modification of YWD scheme which resolves the security issues of the original scheme without sacrificing its high efficiency and simple design. Indeed, we show that our scheme achieves confidentiality, existential unforgeability and anonymity with more precise reduction bounds. We also give a variation …


Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau Aug 2010

Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.


Investigating Perceptions Of A Location-Based Annotation System, Huynh Nhu Hop Quach, Khasfariyati Razikin, Dion Hoe-Lian Goh, Thi Nhu Quynh Kim, Tan Phat Pham, Yin-Leng Theng, Ee-Peng Lim Aug 2010

Investigating Perceptions Of A Location-Based Annotation System, Huynh Nhu Hop Quach, Khasfariyati Razikin, Dion Hoe-Lian Goh, Thi Nhu Quynh Kim, Tan Phat Pham, Yin-Leng Theng, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

We introduce MobiTOP, a Web-based system for organizing and retrieving hierarchical location-based annotations. Each annotation contains multimedia content (such as text, images, video) associated with a location, and users are able to annotate existing annotations to an arbitrary depth, in effect creating a hierarchy. An evaluation was conducted on a group of potential users to ascertain their perceptions of the usability of the application. The results were generally positive and the majority of the participants saw MobiTOP as a useful platform to share location-based information. We conclude with implications of our work and opportunities for future research.


A Probabilistic Approach To Personalized Tag Recommendation, Meiqun Hu, Ee Peng Lim, Jing Jiang Aug 2010

A Probabilistic Approach To Personalized Tag Recommendation, Meiqun Hu, Ee Peng Lim, Jing Jiang

Research Collection School Of Computing and Information Systems

In this work, we study the task of personalized tag recommendation in social tagging systems. To reach out to tags beyond the existing vocabularies of the query resource and of the query user, we examine recommendation methods that are based on personomy translation, and propose a probabilistic framework for incorporating translations by similar users (neighbors). We propose to use distributional divergence to measure the similarity between users in the context of personomy translation, and examine two variations of such similarity measures. We evaluate the proposed framework on a benchmark dataset collected from BibSonomy, and compare with personomy translation methods based …


The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau Aug 2010

The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Physician scheduling is the assignment of physicians to perform different duties in the hospital timetable. In this paper, the goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We present a mathematical programming model to represent the problem as a bi-objective optimization problem. Three different methods based on ε–Constraint Method, Weighted-Sum Method and HillClimbing algorithm are proposed. These methods were tested on a real case from the Surgery Department of a large local government hospital, as well as on randomly generated problem instances. The strengths and weaknesses of the …


A New Hardware-Assisted Pir With O(N) Shuffle Cost, Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong Wang Aug 2010

A New Hardware-Assisted Pir With O(N) Shuffle Cost, Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong Wang

Research Collection School Of Computing and Information Systems

Since the concept of private information retrieval (PIR) was first formalized by Chor et al., various constructions have been proposed with a common goal of reducing communication complexity. Unfortunately, none of them is suitable for practical settings mainly due to the prohibitively high cost for either communications or computations. The booming of the Internet and its applications, especially, the recent trend in outsourcing databases, fuels the research on practical PIR schemes. In this paper, we propose a hardware-assisted PIR scheme with a novel shuffle algorithm. Our PIR construction entails O(n) offline computation cost, and constant online operations and O(log n) …


A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham Aug 2010

A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham

Research Collection School Of Computing and Information Systems

In both the commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information. In this paper we address the threat of information leakage that often accompanies such information flows. We focus on domains with one information source (sender) and many information sinks (recipients) where: (i) sharing is mutually beneficial for the sender and the recipients, (ii) leaking a shared information is beneficial to the recipients but undesirable to the sender, and (iii) information sharing decisions of the sender are determined using imperfect monitoring of the (un)intended information leakage by the recipients.We make two key …


Messaging Behavior Modeling In Mobile Social Networks, Byung-Won On, Ee Peng Lim, Jing Jiang, Freddy Tat Chua Chua, Viet-An Nguyen, Loo Nin Teow Aug 2010

Messaging Behavior Modeling In Mobile Social Networks, Byung-Won On, Ee Peng Lim, Jing Jiang, Freddy Tat Chua Chua, Viet-An Nguyen, Loo Nin Teow

Research Collection School Of Computing and Information Systems

Mobile social networks are gaining popularity with the pervasive use of mobile phones and other handheld devices. In these networks, users maintain friendship links, exchange short messages and share content with one another. In this paper, we study the user behaviors in mobile messaging and friendship linking using the data collected from a large mobile social network service known as myGamma (m.mygamma.com). We distinguish two types of user behaviors: soliciting active responses for an initiated message and responding to an incoming message. We propose various models for the two behaviors also known as engagingness and responsiveness. Our experiments show that …


Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau Aug 2010

Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.


Team Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava Aug 2010

Team Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In this study, we propose a comprehensive performance management tool for measuring and reporting operational activities of teams. This study uses performance data of game players and teams in EverQuest II, a popular MMORPG developed by Sony Online Entertainment, to build performance prediction models for task performing teams. The prediction models provide a projection of task performing team's future performance based on the past performance patterns of participating players on the team as well as team characteristics. While the existing game system lacks the ability to predict team-level performance, the prediction models proposed in this study are expected to be …


Learning Personal Agents With Adaptive Player Modeling In Virtual Worlds, Yilin Kang, Ah-Hwee Tan Aug 2010

Learning Personal Agents With Adaptive Player Modeling In Virtual Worlds, Yilin Kang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

There has been growing interest in creating intelligent agents in virtual worlds that do not follow fixed scripts predefined by the developers, but react accordingly based on actions performed by human players during their interaction. In order to achieve this objective, previous approaches have attempted to model the environment and the user’s context directly. However, a critical component for enabling personalized virtual world experience is missing, namely the capability to adapt over time to the habits and eccentricity of a particular player. To address the above issue, this paper presents a cognitive agent with learning player model capability for personalized …


A Hubel Wiesel Model For Hierarchical Representation Of Concepts In Textual Documents, Kiruthika Ramanathan, Luping Shi, Chong Chong Tow Aug 2010

A Hubel Wiesel Model For Hierarchical Representation Of Concepts In Textual Documents, Kiruthika Ramanathan, Luping Shi, Chong Chong Tow

Research Collection School Of Computing and Information Systems

Hubel Weisel models of the cortex describe visual processing as a hierarchy of increasingly sophisticated representations. While several models exist for image processing, little work has been done with Hubel Weisel models out of the domain of object recognition. In this paper, we describe how such models can be extended to the representation of concepts, resulting in a model that shares several properties with the PDP model of semantic cognition. The model that we propose is also capable of incremental learning, in which the knowledge is stored in the strength of the neuron connections. Degradation of old knowledge occurs as …


Hoare Logic For Graph Programs, Christopher M. Poskitt, Detlef Plump Aug 2010

Hoare Logic For Graph Programs, Christopher M. Poskitt, Detlef Plump

Research Collection School Of Computing and Information Systems

We present a new approach for verifying programs written in GP (for Graph Programs), an experimental programming language for performing computations on graphs at a high level of abstraction. Taking a labelled graph as input, a graph program nondeterministically applies to it a number of graph transformation rules, directed by simple control constructs such as sequential composition and as-long-as-possible iteration. We adapt classical Hoare logic to the domain of graphs, and describe a system of sound proof rules for showing the partial correctness of graph programs.


Cloud Services From A Consumer Perspective, Philip Koehler, Arun Anandasivam, Dan Ma Aug 2010

Cloud Services From A Consumer Perspective, Philip Koehler, Arun Anandasivam, Dan Ma

Research Collection School Of Computing and Information Systems

Although there is an increased attention on Cloud Computing in the academic literature in the recent years, most research work focus on technical aspects of cloud computing. Research on consumers’ preferences for cloud services is limited to studies from consulting and industry companies. This paper fills the gap by empirically identifying consumer preferences for cloud service attributes. Using conjoint methods we reveal the relative importance of different attributes of cloud services. The results help both practitioners and academic researchers to better understand the prerequisites of a successful market introduction of cloud services and to design appropriate services. Moreover, the derived …


Mining Interaction Behaviors For Email Reply Order Prediction, Byung-Won On, Ee Peng Lim, Jing Jiang, Amruta Purandare, Loo Nin Teow Aug 2010

Mining Interaction Behaviors For Email Reply Order Prediction, Byung-Won On, Ee Peng Lim, Jing Jiang, Amruta Purandare, Loo Nin Teow

Research Collection School Of Computing and Information Systems

In email networks, user behaviors affect the way emails are sent and replied. While knowing these user behaviors can help to create more intelligent email services, there has not been much research into mining these behaviors. In this paper, we investigate user engagingness and responsiveness as two interaction behaviors that give us useful insights into how users email one another. Engaging users are those who can effectively solicit responses from other users. Responsive users are those who are willing to respond to other users. By modeling such behaviors, we are able to mine them and to identify engaging or responsive …


Non-Parametric Kernel Ranking Approach For Social Image Retrieval, Jinfeng Zhuang, Steven C. H. Hoi Jul 2010

Non-Parametric Kernel Ranking Approach For Social Image Retrieval, Jinfeng Zhuang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Social image retrieval has become an emerging research challenge in web rich media search. In this paper, we address the research problem of text-based social image retrieval, which aims to identify and return a set of relevant social images that are related to a text-based query from a corpus of social images. Regular approaches for social image retrieval simply adopt typical text-based image retrieval techniques to search for the relevant social images based on the associated tags, which may suffer from noisy tags. In this paper, we present a novel framework for social image re-ranking based on a non-parametric kernel …


Hybrid Time-Frequency Domain Analysis For Inverter-Fed Induction Motor Fault Detection, T. W. Chua, W. W. Tan, Zhaoxia Wang, C. S. Chang Jul 2010

Hybrid Time-Frequency Domain Analysis For Inverter-Fed Induction Motor Fault Detection, T. W. Chua, W. W. Tan, Zhaoxia Wang, C. S. Chang

Research Collection School Of Computing and Information Systems

The detection of faults in an induction motor is important as a part of preventive maintenance. Stator current is one of the most popular signals used for utility-supplied induction motor fault detection as a current sensor can be installed nonintrusively. In variable speeds operation, the use of an inverter to drive the induction motor introduces noise into the stator current so stator current based fault detection techniques become less reliable. This paper presents a hybrid algorithm, which combines time and frequency domain analysis, for broken rotor bar and bearing fault detection. Cluster information obtained by using Independent Component Analysis (ICA) …


Design And Implementation Of A Middleware For Easy Development And Provision Of Stream-Based Services, Seungwoo Kang, Youngki Lee, Sunghwan Ihm, Souneil Park, Su-Myeon Kim, Junehwa Song Jul 2010

Design And Implementation Of A Middleware For Easy Development And Provision Of Stream-Based Services, Seungwoo Kang, Youngki Lee, Sunghwan Ihm, Souneil Park, Su-Myeon Kim, Junehwa Song

Research Collection School Of Computing and Information Systems

This paper proposes MISSA, a novel middleware to facilitate the development and provision of stream-based services in emerging pervasive environments. The stream-based services utilize voluminous and continuously updated data streams as their input. The characteristics of data streams bring new requirements on the development and provision of the services. To satisfy the requirements, a unique service model and a runtime system are designed in MISSA. The key concept of our service model is to separate service logic from handling data streams. This significantly mitigates the burden on service developers by allowing them to only concentrate on the service logic. Job …


Co-Reranking By Mutual Reinforcement For Image Search, Ting Yao, Tao Mei, Chong-Wah Ngo Jul 2010

Co-Reranking By Mutual Reinforcement For Image Search, Ting Yao, Tao Mei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Most existing reranking approaches to image search focus solely on mining “visual” cues within the initial search results. However, the visual information cannot always provide enough guidance to the reranking process. For example, different images with similar appearance may not always present the same relevant information to the query. Observing that multi-modality cues carry complementary relevant information, we propose the idea of co-reranking for image search, by jointly exploring the visual and textual information. Co-reranking couples two random walks, while reinforcing the mutual exchange and propagation of information relevancy across different modalities. The mutual reinforcement is iteratively updated to constrain …