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

Physical Sciences and Mathematics Commons

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 6871 - 6900 of 7446

Full-Text Articles in Physical Sciences and Mathematics

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


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 …


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 …


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.


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 …


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 …


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 …


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 …


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 …


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 …


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 …


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 …


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 …


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 …


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.


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 …


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 …


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 …


Transient Response Of Arrow Vcsels, Chyng Wen Tee, S. F. Yu, R. V. Penty, I. H. White Feb 2005

Transient Response Of Arrow Vcsels, Chyng Wen Tee, S. F. Yu, R. V. Penty, I. H. White

Research Collection Lee Kong Chian School Of Business

The transient response of antiresonant reflecting optical waveguide (ARROW) vertical-cavity surface-emitting lasers (VCSELs) is analyzed. It is found that under current modulation, the radiation loss of the transverse-leaky mode decreases during the state of the lasers but increases during the state. Numerical analysis shows that this variation in radiation loss is due to the carrier-induced refractive-index depression that arises from spatial-hole-burning of carrier concentration. It is noted that the increment in radiation loss during the state can be used to prevent net modal gain of the transverse-leaky mode from reacquiring threshold after turn-off. Hence, a new method to design ARROW, …


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 …


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 …


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 …


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.


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 …


Human Mental Models Of Humanoid Robots, Sau-Lai Lee, Ivy Yee-Man Lau, Sara Kiesler, Chi-Yue Chiu Jan 2005

Human Mental Models Of Humanoid Robots, Sau-Lai Lee, Ivy Yee-Man Lau, Sara Kiesler, Chi-Yue Chiu

Research Collection School of Social Sciences

Effective communication between a person and a robot may depend on whether there exists a common ground of understanding between the two. In two experiments modelled after human-human studies we examined how people form a mental model of a robot's factual knowledge. Participants estimated the robot's knowledge by extrapolating from their own knowledge and from information about the robot's origin and language. These results suggest that designers of humanoid robots must attend not only to the social cues that robots emit but also to the information people use to create mental models of a robot.


Applying Scenario-Based Design And Claim Analysis To The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Ming Yin, Natalie Lee-San Pang, Patricia Bao-Bao Wong Jan 2005

Applying Scenario-Based Design And Claim Analysis To The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Ming Yin, Natalie Lee-San Pang, Patricia Bao-Bao Wong

Research Collection School Of Computing and Information Systems

This paper describes the application of Carroll’s scenario-based design and claims analysis as a means of refinement to the initial design of a digital library of geographical resources (GeogDL) to prepare Singapore students to take a national examination in geography. GeogDL is built on top of G-Portal, a digital library providing services over geospatial and georeferenced Web content. Beyond improving the initial design of GeogDL, a main contribution of the paper is making explicit the use of Carroll’s strong theory-based but undercapitalized scenario-based design and claims analysis that inspired recommendations for the refinement of GeogDL. The paper concludes with an …


Security Of An Ill-Posed Operator Based Scheme For Image Authentication, Yongdong Wu, Robert H. Deng Jan 2005

Security Of An Ill-Posed Operator Based Scheme For Image Authentication, Yongdong Wu, Robert H. Deng

Research Collection School Of Computing and Information Systems

This letter analyzes the security of an image authentication scheme which exploits the instability of an ill-posed operator. Since the ill-posed operator produces only a limited number of authentic images regardless of the number of watermarks, an attacker can impersonate an image owner to generate authentic images at a high probability. Our experiments demonstrate that our attack is both practical and effective.


Ontology-Assisted Mining Of Rdf Documents, Tao Jiang, Ah-Hwee Tan Jan 2005

Ontology-Assisted Mining Of Rdf Documents, Tao Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Resource description framework (RDF) is becoming a popular encoding language for describing and interchanging metadata of web resources. In this paper, we propose an Apriori-based algorithm for mining association rules (AR) from RDF documents. We treat relations (RDF statements) as items in traditional AR mining to mine associations among relations. The algorithm further makes use of a domain ontology to provide generalization of relations. To obtain compact rule sets, we present a generalized pruning method for removing uninteresting rules. We illustrate a potential usage of AR mining on RDF documents for detecting patterns of terrorist activities. Experiments conducted based on …


Robust Temporal Constraint Networks, Hoong Chuin Lau, Thomas Ou, Melvyn Sim Jan 2005

Robust Temporal Constraint Networks, Hoong Chuin Lau, Thomas Ou, Melvyn Sim

Research Collection School Of Computing and Information Systems

In this paper, we propose the Robust Temporal Constraint Network (RTCN) model for simple temporal constraint networks where activity durations are bounded by random variables. The problem is to determine whether such temporal network can be executed with failure probability less than a given 0 ≤ E ≤ 1 for each possible instantiation of the random variables, and if so. how one might find a feasible schedule with each given instantiation. The advantage of our model is that one can vary the value of ∊ to control the level of conservativeness of the solution. We present a computationally tractable and …


Partnering For Perfection: An Economics Perspective On B2b Electronic Market Strategic Alliances, Qizhi Dai, Robert J. Kauffman Jan 2005

Partnering For Perfection: An Economics Perspective On B2b Electronic Market Strategic Alliances, Qizhi Dai, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

New technological innovations have made it possible for new intermediaries to create value in business processes that involve the procurement of manufacturing and services supplies. Associated with these innovations is the emergence of business-to-business (B2B) electronic markets. These act as digital intermediaries that aim to reduce the transaction costs and mitigate the risks inherent in procurement. They improve buyers’ capabilities to search for attractive prices and also serve to increase the liquidity of sellers’ products. In this chapter, the authors explore the evolution of B2B e-market firms in terms of the strategies they employ to “perfect” their value propositions and …