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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6331 - 6360 of 6884

Full-Text Articles in Physical Sciences and Mathematics

Verifying Completeness Of Relational Query Results In Data Publishing, Hwee Hwa Pang, Arpit Jain, Krithi Ramamritham, Kian-Lee Tan Jun 2005

Verifying Completeness Of Relational Query Results In Data Publishing, Hwee Hwa Pang, Arpit Jain, Krithi Ramamritham, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce incorrect query results. In this paper, we introduce a scheme for users to verify that their query results are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values originated from the owner). The scheme supports range selection on key and non-key attributes, project as well as join queries on relational databases. Moreover, the proposed scheme complies with access control policies, is computationally secure, and can be …

Go to article

Tosa: A Near-Optimal Scheduling Algorithm For Multi-Channel Data Broadcast, Baihua Zheng, Xia Xu, Xing Jin, Dik Lun Lee May 2005

Tosa: A Near-Optimal Scheduling Algorithm For Multi-Channel Data Broadcast, Baihua Zheng, Xia Xu, Xing Jin, Dik Lun Lee

Research Collection School Of Computing and Information Systems

Wireless broadcast is very suitable for delivering information to a large user population. In this paper, we concentrate on data allocation methods for multiple broadcast channels. To the best of our knowledge, this is the first allocation model that takes into the consideration of items' access frequencies, items' lengths. and bandwidth of different channels. We first derive the optimal average expected delay for multiple channels for the general case where data access frequencies, data sizes, and channel bandwidths can all be non-uniform. Second, we develop TOSA, a multi-channel allocation method that does not assume a uniform broadcast schedule for data …

Go to article

Mining Mobile Group Patterns: A Trajectory-Based Approach, San-Yih Hwang, Ying-Han Liu, Jeng-Kuen Chiu, Ee Peng Lim May 2005

Mining Mobile Group Patterns: A Trajectory-Based Approach, San-Yih Hwang, Ying-Han Liu, Jeng-Kuen Chiu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we present a group pattern mining approach to derive the grouping information of mobile device users based on a trajectory model. Group patterns of users are determined by distance threshold and minimum time duration. A trajectory model of user movement is adopted to save storage space and to cope with untracked or disconnected location data. To discover group patterns, we propose ATGP algorithm and TVG-growth that are derived from the Apriori and VG-growth algorithms respectively.

Go to article

Dynamically Optimized Context In Recommender Systems, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang May 2005

Dynamically Optimized Context In Recommender Systems, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Traditional approaches to recommender systems have not taken into account situational information when making recommendations, and this seriously limits the relevance of the results. This paper advocates context-awareness as a promising approach to enhance the performance of recommenders, and introduces a mechanism to realize this approach. We present a framework that separates the contextual concerns from the actual recommendation module, so that contexts can be readily shared across applications. More importantly, we devise a learning algorithm to dynamically identify the optimal set of contexts for a specific recommendation task and user. An extensive series of experiments has validated that our …

Go to article

Secure Human Communications Based On Biometrics Signals, Yongdong Wu, Feng Bao, Robert H. Deng May 2005

Secure Human Communications Based On Biometrics Signals, Yongdong Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

User authentication is the first and probably the most challenging step in achieving secure person-to-person communications. Most of the existing authentication schemes require communicating parties either share a secret/password or know each other's public key. In this paper we suggest a novel user authentication scheme that is easy to use and overcomes the requirements of sharing password or public keys. Our scheme allows two human users to perform mutual authentication and have secure communications over an open channel by exchanging biometrics signals (e. g., voice or video signals). In addition to user authentication, our scheme establishes a secret session key …

Go to article

Leveraging Global Resources: A Distributed Process Maturity Framework For Software Product Development, Narayan Ramasubbu, M. S. Krishnan, Prasad Kompalli May 2005

Leveraging Global Resources: A Distributed Process Maturity Framework For Software Product Development, Narayan Ramasubbu, M. S. Krishnan, Prasad Kompalli

Research Collection School Of Computing and Information Systems

Distributed software development is pervasive in the software industry today as companies vie to leverage global resources. However, popular quality and process frameworks don?t specifically address the key processes needed for managing distributed software development. This practitioner-oriented, evolutionary process maturity framework for globally distributed software development features 24 new key process areas essential for managing distributed software product development and for continuously improving product management capabilities. An assessment survey helps practitioners implement the framework. In this article, the authors detail the framework and assessment survey, as well as report their experiences implementing the framework at a leading global firm. The …

Go to article

Minimum Energy Reliable Paths Using Unreliable Wireless Links, Qunfeng Dong, Suman Banerjee, Micah Adler, Archan Misra May 2005

Minimum Energy Reliable Paths Using Unreliable Wireless Links, Qunfeng Dong, Suman Banerjee, Micah Adler, Archan Misra

Research Collection School Of Computing and Information Systems

We address the problem of energy-efficient reliable wireless communication in the presence of unreliable or lossy wireless link layers in multi-hop wireless networks. Prior work [1] has provided an optimal energy efficient solution to this problem for the case where link layers implement perfect reliability. However, a more common scenario --- a link layer that is not perfectly reliable, was left as an open problem. In this paper we first present two centralized algorithms, BAMER and GAMER, that optimally solve the minimum energy reliable communication problem in presence of unreliable links. Subsequently we present a distributed algorithm, DAMER, that approximates …

Go to article

Protecting Group Dynamic Information In Large Scale Multicast Groups, Yongdong Wu, Tieyan Li, Robert H. Deng May 2005

Protecting Group Dynamic Information In Large Scale Multicast Groups, Yongdong Wu, Tieyan Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Existing key management schemes can secure group communication efficiently, but are failed on protecting the Group Dynamic Information (GDI) that may undermine group privacy. Recently, Sun et al. proposed a scheme to hide the GDI with batch updating and phantom members inserting so that an adversary is not able to estimate the number of group members. In this paper, we first point out that their scheme is only applicable in departure-only group communication instead of the common conference groups. Secondly, we introduce our method of estimating the group size at a higher confidence level given a prior departure probability. Further, …

Go to article

A New Architecture For User Authentication And Key Exchange Using Password For Federated Enterprises, Yanjiang Yang, Feng Bao, Robert H. Deng May 2005

A New Architecture For User Authentication And Key Exchange Using Password For Federated Enterprises, Yanjiang Yang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

The rapid rise of federated enterprises entails a new way of trust management by the fact that an enterprise can account for partial trust of its affiliating organizations. On the other hand, password has historically been used as a main means for user authentication because of operational simplicity. We are thus motivated to explore the use of short password for user authentication and key exchange in the context of federated enterprises. Exploiting the special structure of a federated enterprise, our proposed new architecture comprises an external server managed by each affiliating organization and a central server managed by the enterprise …

Go to article

Event-Driven Document Selection For Terrorism, Zhen Sun, Ee Peng Lim, Kuiyu Chang, Teng-Kwee Ong, Rohan Kumar Gunaratna May 2005

Event-Driven Document Selection For Terrorism, Zhen Sun, Ee Peng Lim, Kuiyu Chang, Teng-Kwee Ong, Rohan Kumar Gunaratna

Research Collection School Of Computing and Information Systems

In this paper, we examine the task of extracting information about terrorism related events hidden in a large document collection. The task assumes that a terrorism related event can be described by a set of entity and relation instances. To reduce the amount of time and efforts in extracting these event related instances, one should ideally perform the task on the relevant documents only. We have therefore proposed some document selection strategies based on information extraction (IE) patterns. Each strategy attempts to select one document at a time such that the gain of event related instance information is maximized. Our …

Go to article

Information Dissemination Via Wireless Broadcast, Baihua Zheng, Dik Lun Lee May 2005

Information Dissemination Via Wireless Broadcast, Baihua Zheng, Dik Lun Lee

Research Collection School Of Computing and Information Systems

Unrestricted mobility adds a new dimension to data access methodology--- one that must be addressed before true ubiquity can be realized.

Go to article

Live Data Views: Programming Pervasive Applications That Use “Timely” And “Dynamic” Data, Jay Black, Paul Castro, Archan Misra, Jerome White May 2005

Live Data Views: Programming Pervasive Applications That Use “Timely” And “Dynamic” Data, Jay Black, Paul Castro, Archan Misra, Jerome White

Research Collection School Of Computing and Information Systems

In the absence of generic programming abstractions for dynamic data in most enterprise programming environments, individual applications treat data streams as a special case requiring custom programming. With the growing number of live data sources such as RSS feeds, messaging and presence servers, multimedia streams, and sensor data. a general-purpose client-server programming model is needed to easily incorporate live data into applications. In this paper, we present Live Data Views, a programming abstraction that represents live data as a time-windowed view over a set of data streams. Live Data Views allow applications to create and retrieve stateful abstractions of dynamic …

Go to article

Dynamically-Optimized Context In Recommender Systems, Ghim-Eng Yap, Ah-Hwee Tan, Hwee-Hwa Pang May 2005

Dynamically-Optimized Context In Recommender Systems, Ghim-Eng Yap, Ah-Hwee Tan, Hwee-Hwa Pang

Research Collection School Of Computing and Information Systems

Traditional approaches to recommender systems have not taken into account situational information when making recommendations, and this seriously limits the relevance of the results. This paper advocates context-awareness as a promising approach to enhance the performance of recommenders, and introduces a mechanism to realize this approach. We present a framework that separates the contextual concerns from the actual recommendation module, so that contexts can be readily shared across applications. More importantly, we devise a learning algorithm to dynamically identify the optimal set of contexts for a specific recommendation task and user. An extensive series of experiments has validated that our …

Go to article

Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan Apr 2005

Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan

Research Collection School Of Computing and Information Systems

Gene expression data generated by DNA microarray experiments have provided a vast resource for medical diagnosis and disease understanding. Most prior work in analyzing gene expression data, however, focuses on predictive performance but not so much on deriving human understandable knowledge. This paper presents a systematic approach for learning and extracting rule-based knowledge from gene expression data. A class of predictive self-organizing networks known as Adaptive Resonance Associative Map (ARAM) is used for modelling gene expression data, whose learned knowledge can be transformed into a set of symbolic IF-THEN rules for interpretation. For dimensionality reduction, we illustrate how the system …

Go to article

Mining Social Network From Spatio-Temporal Events, Hady Wirawan Lauw, Ee Peng Lim, Teck Tim Tan, Hwee Hwa Pang Apr 2005

Mining Social Network From Spatio-Temporal Events, Hady Wirawan Lauw, Ee Peng Lim, Teck Tim Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Knowing patterns of relationship in a social network is very useful for law enforcement agencies to investigate collaborations among criminals, for businesses to exploit relationships to sell products, or for individuals who wish to network with others. After all, it is not just what you know, but also whom you know, that matters. However, finding out who is related to whom on a large scale is a complex problem. Asking every single individual would be impractical, given the huge number of individuals and the changing dynamics of relationships. Recent advancement in technology has allowed more data about activities of individuals …

Go to article

Privacy And Ownership Preserving Of Outsourced Medical Data, Elisa Bertino, Beng Chin Ooi, Yanjiang Yang, Robert H. Deng Apr 2005

Privacy And Ownership Preserving Of Outsourced Medical Data, Elisa Bertino, Beng Chin Ooi, Yanjiang Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

The demand for the secondary use of medical data is increasing steadily to allow for the provision of better quality health care. Two important issues pertaining to this sharing of data have to be addressed: one is the privacy protection for individuals referred to in the data; the other is copyright protection over the data. In this paper, we present a unified framework that seamlessly combines techniques of binning and digital watermarking to attain the dual goals of privacy and copyright protection. Our binning method is built upon an earlier approach of generalization and suppression by allowing a broader concept …

Go to article

Providing Efficient Certification Services Against Active Attacks In Ad Hoc Networks, Bo Zhu, Guilin Wang, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng Apr 2005

Providing Efficient Certification Services Against Active Attacks In Ad Hoc Networks, Bo Zhu, Guilin Wang, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Most of previous research work in key management can only resist passive attacks, such as dropping the certificate request, and are vulnerable under active attacks, such as returning a fake reply to the node requesting the certification service. In this paper, we propose two algorithms to address both security and efficiency issues of certification services in ad hoc networks. Both of the algorithms can resist active attacks. In addition, simulation results show that, compared to the previous works, our second algorithm is not only much faster in a friendly environment, but it also works well in a hostile environment in …

Go to article

Walverine: A Walrasian Trading Agent, Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, Julian L. Schvartzman, Michael P. Wellman Apr 2005

Walverine: A Walrasian Trading Agent, Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, Julian L. Schvartzman, Michael P. Wellman

Research Collection School Of Computing and Information Systems

TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation market game. TAC presents a challenging travel-shopping scenario where agents must satisfy client preferences for complementary and substitutable goods by interacting through a variety of market types. Michigan's entry, Walverine, bases its decisions on a competitive (Walrasian) analysis of the TAC travel economy. Using this Walrasian model, we construct a decision-theoretic formulation of the optimal bidding problem, which Walverine solves in each round of bidding for each good. Walverine's optimal bidding approach, as well as …

Go to article

Integrating User Feedback Log Into Relevance Feedback By Coupled Svm For Content-Based Image Retrieval, Steven C. H. Hoi, Michael R. Lyu, Rong Jin Apr 2005

Integrating User Feedback Log Into Relevance Feedback By Coupled Svm For Content-Based Image Retrieval, Steven C. H. Hoi, Michael R. Lyu, Rong Jin

Research Collection School Of Computing and Information Systems

Relevance feedback has been shown as an important tool to boost the retrieval performance in content-based image retrieval. In the past decade, various algorithms have been proposed to formulate relevance feedback in contentbased image retrieval. Traditional relevance feedback techniques mainly carry out the learning tasks by focusing lowlevel visual features of image content with little consideration on log information of user feedback. However, from a long-term learning perspective, the user feedback log is one of the most important resources to bridge the semantic gap problem in image retrieval. In this paper we propose a novel technique to integrate the log …

Go to article

Proactive Caching For Spatial Queries In Mobile Environments, Haibo Hu, Jianliang Xu, Wing Sing Wong, Baihua Zheng, Dik Lun Lee, Wang-Chien Lee Apr 2005

Proactive Caching For Spatial Queries In Mobile Environments, Haibo Hu, Jianliang Xu, Wing Sing Wong, Baihua Zheng, Dik Lun Lee, Wang-Chien Lee

Research Collection School Of Computing and Information Systems

Semantic caching enables mobile clients to answer spatial queries locally by storing the query descriptions together with the results. However, it supports only a limited number of query types, and sharing results among these types is difficult. To address these issues, we propose a proactive caching model which caches the result objects as well as the index that supports these objects as the results. The cached index enables the objects to be reused for all common types of queries. We also propose an adaptive scheme to cache such an index, which further optimizes the query response time for the best …

Go to article

Video Text Detection And Segmentation For Optical Character Recognition, Chong-Wah Ngo, Chi-Kwong Chan Mar 2005

Video Text Detection And Segmentation For Optical Character Recognition, Chong-Wah Ngo, Chi-Kwong Chan

Research Collection School Of Computing and Information Systems

In this paper, we present approaches to detecting and segmenting text in videos. The proposed video-text-detection technique is capable of adaptively applying appropriate operators for video frames of different modalities by classifying the background complexities. Effective operators such as the repeated shifting operations are applied for the noise removal of images with high edge density. Meanwhile, a text-enhancement technique is used to highlight the text regions of low-contrast images. A coarse-to-fine projection technique is then employed to extract text lines from video frames. Experimental results indicate that the proposed text-detection approach is superior to the machine-learning-based (such as SVM and …

Go to article

Fingerprinting Relational Databases: Schemes And Specialities, Yingjiu Li, Vipin Swarup, Sushil Jajodia Mar 2005

Fingerprinting Relational Databases: Schemes And Specialities, Yingjiu Li, Vipin Swarup, Sushil Jajodia

Research Collection School Of Computing and Information Systems

In this paper, we present a technique for fingerprinting relational data by extending Agrawal et al.'s watermarking scheme. The primary new capability provided by our scheme is that, under reasonable assumptions, it can embed and detect arbitrary bit-string marks in relations. This capability, which is not provided by prior techniques, permits our scheme to be used as a fingerprinting scheme. We then present quantitative models of the robustness properties of our scheme. These models demonstrate that fingerprints embedded by our scheme are detectable and robust against a wide variety of attacks including collusion attacks.

Go to article

Evaluation Of Mpeg-4 Ipmp Extension, Hwee Hwa Pang, Yongdong Wu Mar 2005

Evaluation Of Mpeg-4 Ipmp Extension, Hwee Hwa Pang, Yongdong Wu

Research Collection School Of Computing and Information Systems

MPEG-4 IPMPX (intellectual property management and protection extension) is the latest ISO standard which provides a flexible framework for protecting MPEG streams. The message mechanism of IPMPX enables interoperability among IPMPX-compliant devices no matter which protection methods are embedded. This paper highlights several problems in the message syntax of IPMPX: the tool delivery message IPMP_ToolES_AU is vulnerable to network attack, the authentication message IMP_Mutual_Authentication is incapable of defending against forgery attack, and the configuration message IPMP_SelectiveDecrptionInit is ambiguous and redundant. We propose a number of remedies to those problems, which can be incorporated into a corrigenda to improve the present …

Go to article

Mastaq: A Middleware Architecture For Sensor Applications With Statistical Quality Constraints, Inseok Hwang, Qi Han, Archan Misra Mar 2005

Mastaq: A Middleware Architecture For Sensor Applications With Statistical Quality Constraints, Inseok Hwang, Qi Han, Archan Misra

Research Collection School Of Computing and Information Systems

We present the design goals and functional components of MASTAQ, a data management middleware for pervasive applications that utilize sensor data. MASTAQ allows applications to specify their quality-of information (QoI) preferences (in terms of statistical metrics over the data) independent of the underlying network topology. It then achieves energy efficiency by adaptively activating and querying only the subset of sensor nodes needed to meet the target QoI bounds. We also present a closed-loop feedback mechanism based on broadcasting of activation probabilities, which allows MASTAQ to activate the appropriate number of sensors without requiring any inter-sensor coordination or knowledge of the …

Go to article

Scheduling Queries To Improve The Freshness Of A Website, Haifeng Liu, Wee-Keong Ng, Ee Peng Lim Mar 2005

Scheduling Queries To Improve The Freshness Of A Website, Haifeng Liu, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The World Wide Web is a new advertising medium that corporations use to increase their exposure to consumers. Very large websites whose content is derived from a source database need to maintain a freshness that reflects changes that are made to the base data. This issue is particularly significant for websites that present fast-changing information such as stock-exchange information and product information. In this article, we formally define and study the freshness of a website that is refreshed by a scheduled set of queries that fetch fresh data from the databases. We propose several online-scheduling algorithms and compare the performance …

Go to article

Video Summarization And Scene Detection By Graph Modeling, Chong-Wah Ngo, Yu-Fei Ma, Hong-Jiang Zhang Feb 2005

Video Summarization And Scene Detection By Graph Modeling, Chong-Wah Ngo, Yu-Fei Ma, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this paper, we propose a unified approach for video summarization based on the analysis of video structures and video highlights. Two major components in our approach are scene modeling and highlight detection. Scene modeling is achieved by normalized cut algorithm and temporal graph analysis, while highlight detection is accomplished by motion attention modeling. In our proposed approach, a video is represented as a complete undirected graph and the normalized cut algorithm is carried out to globally and optimally partition the graph into video clusters. The resulting clusters form a directed temporal graph and a shortest path algorithm is proposed …

Go to article

The Effects Of Shilling On Final Bid Prices In Online Auctions, Robert J. Kauffman, Charles A. Wood Jan 2005

The Effects Of Shilling On Final Bid Prices In Online Auctions, Robert J. Kauffman, Charles A. Wood

Research Collection School Of Computing and Information Systems

An increasing number of reports of online auction fraud are of growing concern to auction operators and participants. In this research, we discuss reserve price shilling, where a bidder shills in order to avoid paying auction house fees, rather than to drive up the price of the final bid. We examine the effect that premium bids have upon the final selling price, since they are linked with reserve price shill bids. We use 10,260 eBay auctions during April 2001, and identify 919 auctions involving 322 sellers and 1583 bidders involved in concurrent auctions for the exact same item. We find …

Go to article

Technology Competition And Optimal Investment Timing: A Real Options Perspective, Robert J. Kauffman, X. Li Jan 2005

Technology Competition And Optimal Investment Timing: A Real Options Perspective, Robert J. Kauffman, X. Li

Research Collection School Of Computing and Information Systems

Companies often choose to defer irreversible investments to maintain valuable managerial flexibility in an uncertain world. For some technology-intensive projects, technology uncertainty plays a dominant role in affecting investment timing. This article analyzes the investment timing strategy for a firm that is deciding about whether to adopt one or the other of two incompatible and competing technologies.We develop a continuous-time stochastic model that aids in the determination of optimal timing for managerial adoption within the framework of real options theory. The model captures the elements of the decision-making process in such a way so as to provide managerial guidance in …

Go to article

A Multi-Agent Approach For Solving Optimization Problems Involving Expensive Resources, Hoong Chuin Lau, H. Wang Jan 2005

A Multi-Agent Approach For Solving Optimization Problems Involving Expensive Resources, Hoong Chuin Lau, H. Wang

Research Collection School Of Computing and Information Systems

In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserably. More specifically, we study the class of bin-packing problems. Under our proposed Fine-Grained Agent System scheme, rational agents work both collaboratively and selfishly based on local search and mimic physics-motivated systems. We apply our approach to a generalization of bin-packing - the Inventory Routing Problem with Time Windows - which is an important logistics problem, and demonstrate the efficiency and effectiveness of our approach.

Go to article

Exploring Bit-Difference For Approximate Knn Search In High-Dimensional Databases, Bin Cui, Heng Tao Shen, Jialie Shen, Kian-Lee Tan Jan 2005

Exploring Bit-Difference For Approximate Knn Search In High-Dimensional Databases, Bin Cui, Heng Tao Shen, Jialie Shen, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

In this paper, we develop a novel index structure to support effcient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two points contributes a dominant portion of the overall query response time for memory processing. To reduce the distance computation, we first propose a structure (BID) using BIt-Difference to answer approximate KNN query. The BID employs one bit to represent each feature vector of point and the number of bit-difference is used to prune the further points. To facilitate real dataset which is typically skewed, we enhance …

Go to article

First Prev Next Last