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

Digital Commons Network™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 9631 - 9660 of 10474

Full-Text Articles in Entire DC Network

Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo Jul 2005

Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normalized cut (NC). Initially, OM is employed to measure the visual similarity between all pairs of events under the one-to-one mapping constraint among video shots. Then, news events are represented as a complete weighted graph and NC is carried out to globally and optimally partition the graph into event clusters. Finally, based on the cluster size and globality of events, hot events can be automatically detected and selected as the summaries of …

Go to article

Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe Jul 2005

Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe

Research Collection School Of Computing and Information Systems

Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users themselves) and making periodic decisions based on such monitoring. POMDPs appear well suited to enable agents to address these challenges, given the uncertain environment and cost of actions, but optimal policy generation for POMDPs is computationally expensive. This paper introduces three key techniques to speedup POMDP policy generation that exploit the notion of progress or dynamics in personal assistant domains. Policy computation is restricted to the belief space polytope that remains …

Go to article

Middleware Architecture For Evaluation And Selection Of 3rd Party Web Services For Service Providers, Dipanjan Chakraborty, Suraj K. Jaiswal, Archan Misra, Amit A. Nanavati Jul 2005

Middleware Architecture For Evaluation And Selection Of 3rd Party Web Services For Service Providers, Dipanjan Chakraborty, Suraj K. Jaiswal, Archan Misra, Amit A. Nanavati

Research Collection School Of Computing and Information Systems

This paper presents an architecture to facilitate efficient evaluation and selection of 3rd party Web services for service providers. Most service provider architectures have primarily focused on providing Web service front ends to legacy systems, aggregating and delivering services via workflows. These architectures primarily considered static business contracts between the service provider and its (Web-service enabled) business partners. This approach makes these architectures inflexible to variations in business requirement, partners' performance and customer requirements. Our architecture provides a flexible means for service providers to optimize business performance. Based on the historical performance, extant context, and optimising business rules, the appropriate …

Go to article

The Effect Of Remanufacturing On Procurement Decisions For Resellers In Secondary Markets, Andreas Robotis, Shantanu Bhattacharya, Luk N. Van Wassenhove Jun 2005

The Effect Of Remanufacturing On Procurement Decisions For Resellers In Secondary Markets, Andreas Robotis, Shantanu Bhattacharya, Luk N. Van Wassenhove

Research Collection Lee Kong Chian School Of Business

The role of remanufacturing as a competitive tool for firms has been reflected in a number of studies to show that remanufacturing can reduce the unit cost of production by reusing components. However, the fact that remanufacturing can be used as a strategic tool for serving secondary markets as well has not been acknowledged in the literature. In this paper, we study the use of remanufacturing as a tool to serve secondary markets. Specifically, we model the case of a reseller who procures used products based on an older generation of technology from an advanced market and then uses one …

Go to article

Trade, Capital Accumulation And Structural Unemployment: An Empirical Study Of The Singapore Economy, Hiau Looi Kee, Hian Teck Hoon Jun 2005

Trade, Capital Accumulation And Structural Unemployment: An Empirical Study Of The Singapore Economy, Hiau Looi Kee, Hian Teck Hoon

Research Collection School Of Economics

This paper studies the factors responsible for the secular decline of Singapore's unemployment rate over the period 1966-2000 in an environment of low and stable inflation rates. We introduce wage bargaining and unions into a specific-factors, two-sector economy with an export sector and a non-tradable sector to obtain an endogenous natural unemployment rate. Increases in the relative export price and capital stock in the export sector are predicted to reduce structural unemployment. These hypotheses could not be rejected based on structural estimations and co-integration regressions. Empirically, capital accumulation in the export sector explains most of the decline in Singapore's unemployment …

Go to article

Learning Outcomes Oriented Assessment Methods In An Active Learning Environment, Arcot Desai Narasimhalu Jun 2005

Learning Outcomes Oriented Assessment Methods In An Active Learning Environment, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Singapore Management University uses interactive seminar style teaching in class rooms. Most of its students hail from Singapore and are generally new to active learning and constructive participation in the seminar style classes. This paper reports findings from a freshmen first term course titled IS 101: Seminar for ISM Majors.

Go to article

Knowledge Management Mechanisms Of Financial Service Sites, Fiona Fui-Hoon Nah, Keng Siau, Y. Tian Jun 2005

Knowledge Management Mechanisms Of Financial Service Sites, Fiona Fui-Hoon Nah, Keng Siau, Y. Tian

Research Collection School Of Computing and Information Systems

How can we effectively acquire, use, and manage knowledge via the Web?

Go to article

Aggregate Nearest Neighbor Queries In Spatial Databases, Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui Jun 2005

Aggregate Nearest Neighbor Queries In Spatial Databases, Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui

Research Collection School Of Computing and Information Systems

Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,...qn, an ANN query outputs the facility p belongs to P that minimizes the sum of distances |pqi| for 1 is less than or equal to i is less than or equal to n that the users have to travel in order to meet there. Similarly, another ANN query may report the point p belongs to P that minimizes the maximum distance that …

Go to article

Mapping The Irish Policy Space: Voter And Party Spaces In Preferential Elections, Kenneth Benoit, Michael Laver Jun 2005

Mapping The Irish Policy Space: Voter And Party Spaces In Preferential Elections, Kenneth Benoit, Michael Laver

Research Collection School of Social Sciences

In this note we map the Irish policy space, locating both voters and parties on the most salient policy dimensions in Ireland. Estimates of the voter locations are based on the Irish National Election Survey (INES), conducted in 2002. Estimates of the party positions are based on an expert survey of party positions conducted by the authors in late 2002. We show that respondent self-placements on a priori policy scales are highly biased and difficult to interpret, and we rely instead on building scale positions for respondents from their answers to relevant attitude questions in the INES. The results provide …

Go to article

Dsi: A Fully Distributed Spatial Index For Wireless Data Broadcast, Wang-Chien Lee, Baihua Zheng Jun 2005

Dsi: A Fully Distributed Spatial Index For Wireless Data Broadcast, Wang-Chien Lee, Baihua Zheng

Research Collection School Of Computing and Information Systems

Recent announcement of the MSN Direct Service has demonstrated the feasibility and industrial interest in utilizing wireless broadcast for pervasive information services. To support location-based services in wireless data broadcast systems, a distributed spatial index (called DSI) is proposed in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that facilitates multiple search paths to be naturally mixed together by sharing links. Moreover, DSI is very resilient in error-prone wireless communication environments. Search algorithms for two classical location-based queries, window queries and kNN queries, based on DSI are presented. Performance evaluation of DSI shows …

Go to article

Conceptual Partitioning: An Efficient Method For Continuous Nearest Neighbor Monitoring, Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimitris Papadias Jun 2005

Conceptual Partitioning: An Efficient Method For Continuous Nearest Neighbor Monitoring, Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for static datasets, the traditional methods do not extend to highly dynamic environments where multiple continuous queries require real-time results, and both objects and queries receive frequent location updates. In this paper we propose conceptual partitioning (CPM), a comprehensive technique for the efficient monitoring of continuous NN queries. CPM achieves low running time by handling location updates only from objects that fall in the vicinity of …

Go to article

Efficient Anonymous Roaming And Its Security Analysis, Guomin Yang, Duncan S. Wong, Xiaotie Deng Jun 2005

Efficient Anonymous Roaming And Its Security Analysis, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

The Canetti-Krawczyk (CK) model uses resuable modular components to construct indistinguishability-based key exchange protocols. The reusability of modular protocol components makes it easier to construct and prove new protocols when compared with other provably secure approaches. In this paper, we build an efficient anonymous and authenticated key exchange protocol for roaming by using the modular approach under the CK-model. Our protocol requires only four message flows and uses only standard cryptographic primitives. We also propose a one-pass counter based MT-authenticator and show its security under the assumption that there exists a MAC which is secure against chosen message attack.

Go to article

On Assigning Place Names To Geography Related Web Pages, Wenbo Zong, Dan Wu, Aixin Sun, Ee Peng Lim, Dion Hoe-Lian Goh Jun 2005

On Assigning Place Names To Geography Related Web Pages, Wenbo Zong, Dan Wu, Aixin Sun, Ee Peng Lim, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

In this paper, we attempt to give spatial semantics to web pages by assigning them place names. The entire assignment task is divided into three sub-problems, namely place name extraction, place name disambiguation and place name assignment. We propose our approaches to address these sub-problems. In particular, we have modified GATE, a well-known named entity extraction software, to perform place name extraction using a US Census gazetteer. A rule-based place name disambiguation method and a place name assignment method capable of assigning place names to web page segments have also been proposed. We have evaluated our proposed disambiguation and assignment …

Go to article

Optimal Sequential Decision Architectures And The Robustness Of Hierarchies And Polyarchies, Winston T. H. Koh Jun 2005

Optimal Sequential Decision Architectures And The Robustness Of Hierarchies And Polyarchies, Winston T. H. Koh

Research Collection School Of Economics

This paper studies collective decision making in the context of a project selection model. We derive the optimal decision architecture in the presence of marginal decision costs, and investigate the circumstances under which the hierarchy and polyarchy emerge as optimal sequential architectures. Our analysis extends previous results on optimal organizational decision-making to a sequential setting, and further demonstrates the fragility of the hierarchy and polyarchy as optimal architectures.

Go to article

Evaluating G-Portal For Geography Learning And Teaching, Chew-Hung Chang, John G. Hedberg, Yin-Leng Theng, Ee Peng Lim, Tiong-Sa Teh, Dion Hoe-Lian Goh Jun 2005

Evaluating G-Portal For Geography Learning And Teaching, Chew-Hung Chang, John G. Hedberg, Yin-Leng Theng, Ee Peng Lim, Tiong-Sa Teh, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

This paper describes G-Portal, a geospatial digital library of geographical assets, providing an interactive platform to engage students in active manipulation and analysis of information resources and collaborative learning activities. Using a G-Portal application in which students conducted a field study of an environmental problem of beach erosion and sea level rise, we describe a pilot study to evaluate usefulness and usability issues to support the learning of geographical concepts, and in turn teaching.

Go to article

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

Breaking Public Key Cryptosystems On Tamper Resistant Devices In The Presence Of Transient Faults, Feng Bao, Robert H. Deng, Y. Han, A. Jeng, Arcot Desai Narasimhalu, T. Ngair Jun 2005

Breaking Public Key Cryptosystems On Tamper Resistant Devices In The Presence Of Transient Faults, Feng Bao, Robert H. Deng, Y. Han, A. Jeng, Arcot Desai Narasimhalu, T. Ngair

Research Collection School Of Computing and Information Systems

In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant devices. The attack makes use of transient faults and seems applicable to many types of PKCs. In particular, we show how to attack the RSA, the E1Gamal signature scheme, the Schnorr signature scheme, and the DSA. We also present some possible methods to counter the attack.

Go to article

A Semi-Supervised Active Learning Framework For Image Retrieval, Steven Hoi, Michael R. Lyu Jun 2005

A Semi-Supervised Active Learning Framework For Image Retrieval, Steven Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Although recent studies have shown that unlabeled data are beneficial to boosting the image retrieval performance, very few approaches for image retrieval can learn with labeled and unlabeled data effectively. This paper proposes a novel semi-supervised active learning framework comprising a fusion of semi-supervised learning and support vector machines. We provide theoretical analysis of the active learning framework and present a simple yet effective active learning algorithm for image retrieval. Experiments are conducted on real-world color images to compare with traditional methods. The promising experimental results show that our proposed scheme significantly outperforms the previous approaches.

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

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long May 2005

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

The growing interest in e-government raises the question of stages in e-government development. A few stage models for e-government have been proposed. Without a common e-government stage model, different research in e-government may be based on different stage models. This presents a difficulty in comparing and understanding different research results. In this research, we synthesize the existing e-government stage models so that there is a common frame of reference for researchers and practitioners in the area.

Go to article

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long May 2005

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

The growing interest in e-government raises the question of stages in e-government development. A few stage models for e-government have been proposed. Without a common e-government stage model, different research in e-government may be based on different stage models. This presents a difficulty in comparing and understanding different research results. In this research, we synthesize the existing e-government stage models so that there is a common frame of reference for researchers and practitioners in the area.

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

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

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

The Operational Validity Of A Video-Based Situational Judgment Test For Medical College Admissions: Illustrating The Importance Of Matching Predictor And Criterion Construct Domains, Filip Lievens, Tine Buyse, Paul R. Sackett May 2005

The Operational Validity Of A Video-Based Situational Judgment Test For Medical College Admissions: Illustrating The Importance Of Matching Predictor And Criterion Construct Domains, Filip Lievens, Tine Buyse, Paul R. Sackett

Research Collection Lee Kong Chian School Of Business

This study is part of a trend of examining noncognitive predictors, for example, a situational judgment test (SJT), as supplements to cognitive predictors for making college admission decisions. The authors examined criterion data over multiple academic years and universities. The criterion domain was broadly conceptualized, including both cognitive and interpersonal domains. The sample consisted of 7,197 candidates of the Medical and Dental Studies Admission Exam in Belgium. Results confirmed the importance of cognitive predictors. A video-based SJT was differentially valid for predicting overall grade point average for different curricula. The SJT showed incremental validity over cognitively oriented measures for curricula …

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

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

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

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

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

First Prev Next Last