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

Numerical Analysis and Scientific Computing Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1021 - 1050 of 1060

Full-Text Articles in Numerical Analysis and Scientific Computing

Zbroker: A Query Routing Broker For Z39.50 Databases, Yong Lin, Jian Xu, Ee Peng Lim, Wee-Keong Ng Nov 1999

Zbroker: A Query Routing Broker For Z39.50 Databases, Yong Lin, Jian Xu, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user's information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and …

Go to article

Wedagen: A Synthetic Web Database Generator, Pallavi Priyardarshini, Fengqiong Qin, Ee Peng Lim, Wee-Keong Ng Sep 1999

Wedagen: A Synthetic Web Database Generator, Pallavi Priyardarshini, Fengqiong Qin, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

At the Centre for Advanced Information Systems (CAIS), a Web warehousing system is being developed to store and manipulate Web information. The system named WHOWEDA (WareHouse Of WEb DAta) stores extracted Web information as Web tables and provides several Web operators, eg. Web join, Web select, global coupling, etc., to manipulate Web tables. During the implementation of WHOWEDA, it is necessary to perform systematic testing on the system and to evaluate its system performance. While it is possible for WHOWEDA to be tested or evaluated using actual Web pages downloaded from WWW, the amount of time required for such testing …

Go to article

Locating Web Information Using Web Checkpoints, Aik Kee Luah, Wee-Keong Ng, Ee Peng Lim, Wee Peng Lee, Yinyan Cao Sep 1999

Locating Web Information Using Web Checkpoints, Aik Kee Luah, Wee-Keong Ng, Ee Peng Lim, Wee Peng Lee, Yinyan Cao

Research Collection School Of Computing and Information Systems

Conventional search engines locate information by letting users establish a single web checkpoint1. By specifying one or more keywords, users direct search engines to return a set of documents that contain those keywords. From the documents (links) returned by search engines, user proceed to further probe the WWW from there. Hence, these initial set of documents (contingent upon the occurrence of keyword(s)) serve as a web checkpoint. Generally, these links are numerous and may not result in much fruitful searches. By establishing multiple web checkpoints, a richer and controllable search procedure can be constructed to obtain more relevant Web information. …

Go to article

Non-Repudiation In An Agent-Based E-Commerce System, Chin Chuan Liew, Wee-Keong Ng, Ee Peng Lim, Beng Suang Tan, Kok-Leong Ong Sep 1999

Non-Repudiation In An Agent-Based E-Commerce System, Chin Chuan Liew, Wee-Keong Ng, Ee Peng Lim, Beng Suang Tan, Kok-Leong Ong

Research Collection School Of Computing and Information Systems

Abecos is an agent-based e-commerce system under development at the Nanyang Technological University. A key factor in making this system usable in practice is strict security controls. One aspect of security is the provision of non-repudiation services. As protocols for non-repudiation have focused on -message non-repudiation, its adaptation to afford non-repudiation in a communication session for two agents in Abecos is inefficient. In this work, we investigate and propose a protocol for enforcing non-repudiation in a session. The protocol is believed to be applicable in any e-commerce system; agent- or not agent-based.

Go to article

Cluster-Based Database Selection Techniques For Routing Bibliographic Queries, Jian Xu, Ee Peng Lim, Wee-Keong Ng Aug 1999

Cluster-Based Database Selection Techniques For Routing Bibliographic Queries, Jian Xu, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

In this paper, we focus on the database selection problem in the context of a global digital library consisting of a large number of online bibliographic servers. Each server hosts a bibliographic database that contains bibliographic records each of which consists of text values for a number of pre-defined bibliographic attributes such as title, author, call number, subject, etc.. Each bibliographic database supports user queries on the bibliographic attributes. Since bibliographic records are relatively small in size, we only consider bibliographic databases that support boolean queries on the bibliographic attributes, and the query results are not ranked. While focusing on …

Go to article

Resource Scheduling In A High-Performance Multimedia Server, Hwee Hwa Pang, Bobby Jose, M. S. Krishnan Mar 1999

Resource Scheduling In A High-Performance Multimedia Server, Hwee Hwa Pang, Bobby Jose, M. S. Krishnan

Research Collection School Of Computing and Information Systems

Supporting continuous media data-such as video and audio-imposes stringent demands on the retrieval performance of a multimedia server. In this paper, we propose and evaluate a set of data placement and retrieval algorithms to exploit the full capacity of the disks in a multimedia server. The data placement algorithm declusters every object over all of the disks in the server-using a time-based declustering unit-with the aim of balancing the disk load. As for runtime retrieval, the quintessence of the algorithm is to give each disk advance notification of the blocks that have to be fetched in the impending time periods, …

Go to article

Harp: A Distributed Query System For Legacy Public Libraries And Structured Databases, Ee Peng Lim, Ying Lu Jan 1999

Harp: A Distributed Query System For Legacy Public Libraries And Structured Databases, Ee Peng Lim, Ying Lu

Research Collection School Of Computing and Information Systems

The main purpose of a digital library is to facilitate users easy access to enormous amount of globally networked information. Typically, this information includes preexisting public library catalog data, digitized document collections, and other databases. In this article, we describe the distributed query system of a digital library prototype system known as HARP. In the HARP project, we have designed and implemented a distributed query processor and its query front-end to support integrated queries to preexisting public library catalogs and structured databases. This article describes our experiences in the design of an extended Sequel (SQL) query language known as HarpSQL. …

Go to article

Tuple Source Relational Model: A Source-Aware Data Model For Multidatabases, Ee Peng Lim, Roger Hsiang-Li Chiang, Yinyan Cao Dec 1998

Tuple Source Relational Model: A Source-Aware Data Model For Multidatabases, Ee Peng Lim, Roger Hsiang-Li Chiang, Yinyan Cao

Research Collection School Of Computing and Information Systems

In some integration projects, complete integration of database instances may not be necessary. It may also be too costly and impossible to do so due to poor local data quality and insufficient instance-level knowledge. In this research, we study how multidatabases with global schemas should be represented and manipulated when the data instances from the local databases do not require to be fully integrated. We propose the tuple source (TS) relational model to represent multidatabases under such an integration requirement. This model extends the classical relational model by augmenting every relation with a source attribute to identify the local database …

Go to article

Web Warehousing System: Design And Issues, Wee-Keong Ng, Ee Peng Lim, Sourav S. Bhowmick, Sanjay Kumar Madria Nov 1998

Web Warehousing System: Design And Issues, Wee-Keong Ng, Ee Peng Lim, Sourav S. Bhowmick, Sanjay Kumar Madria

Research Collection School Of Computing and Information Systems

The World Wide Web is a distributed global information resource. It contains a large amount of information that have been placed on the web independently by different organizations and thus, related information may appear across different web sites. To manage and access heterogeneous information on WWW, we have started a project of building a web warehouse, called Whoweda (Warehouse of Web Data). Currently, our work on building a web warehousing system has focused on building a data model and designing a web algebra. In this paper, we discuss design and research issues in a web warehousing system. The issues include …

Go to article

Information Coupling In Web Databases, Sourav S. Bhowmick, Wee-Keong Ng, Ee Peng Lim Nov 1998

Information Coupling In Web Databases, Sourav S. Bhowmick, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Web information coupling refers to an association of topically related web documents. This coupling is initiated explicitly by a user in a web warehouse specially designed for web information. Web information coupling provides the means to derive additional, useful information from the WWW. In this paper, we discuss and show how two web operators, i.e., global web coupling and local web coupling, are used to associate related web information from the WWW and also from multiple web tables in a web warehouse. This paper discusses various issues in web coupling such as coupling semantics, coupling-compability, and coupling evaluation.

Go to article

A Global Object Model For Accommodating Instance Heterogeneities, Ee Peng Lim, Roger Hsiang-Li Chiang Nov 1998

A Global Object Model For Accommodating Instance Heterogeneities, Ee Peng Lim, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

To completely address database integration problems in the context of multidatabase [10] and data warehousing systems, one has to examine various integration and query requirements. Due to various reasons such as poor data quality in local databases, ongoing local database updates, and instance heterogeneities, some instance differences have to be accommodated by the integrated databases. We have therefore proposed a new object-oriented global data model, called OORA, that can accommodate attribute and relationship instance heterogeneities in the integrated database. In addition, the OORA model has been designed to allow database integrators and end users to query both the local and …

Go to article

Design And Implementation Of A Maritime Conflict Prediction System, Wee-Keong Ng, Ee Peng Lim, Wen Jing Hsu, Yy Cao Oct 1998

Design And Implementation Of A Maritime Conflict Prediction System, Wee-Keong Ng, Ee Peng Lim, Wen Jing Hsu, Yy Cao

Research Collection School Of Computing and Information Systems

Maritime conflicts have serious impacts on Singapore and the surrounding region both economically and environmentally. This is particularly severe for conflicts such as collisions between large vessels or tankers carrying oil and chemicals. Thus, it is in the interests of the Maritime and Port Authority of Singapore (MPA) to avoid collisions or near-collisions among such vessels navigating through Singapore waters. Existing systems used by MPA predict potential maritime conflicts arising within a short and fixed time horizon. The system produces inconsequential warnings that are often ignored. In this paper, we describe an advanced computerbased system designed to assist in the …

Go to article

Join Processing In Web Databases, Sourav S. Bhowmick, Wee-Keong Ng, Ee Peng Lim Aug 1998

Join Processing In Web Databases, Sourav S. Bhowmick, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Recently, there has been increasing interests in data models and query languages for unstructured data in the World Wide Web. When web data is harnessed in a web warehouse, new and useful information can be derived through appropriate information manipulation. In our web warehousing project, we introduce a new operator called the web join. Like its relational counterpart, web join combines information from two web tables to yield a new web table. This paper discusses various issues in web join such as join semantics, joinability, and join evaluation.

Go to article

Querying Structured Web Resources, Ee Peng Lim, Cheng Hai Tan, Boon Wan Lim, Wee-Keong Ng Jun 1998

Querying Structured Web Resources, Ee Peng Lim, Cheng Hai Tan, Boon Wan Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

To provide query facilities over Web resources, several web search engines such as Yahoo, Altavista, Infoseek, etc. have been developed. Most prominently, web search engines have been used to index all web pages on the Internet. The queries supported by these search engines are mainly designed to reveal web pages that meet the search criteria specified by the users. In this way, the search engines have been used as some kind of discovery tools. The queries supported are known as discovery queries. On the other hand, a web search engine can also be used to index and support queries over …

Go to article

Database Selection Techniques For Routing Bibliographic Queries, Ee Peng Lim, Wee-Keong Ng, Jian Xu, Yinyan Cao Jun 1998

Database Selection Techniques For Routing Bibliographic Queries, Ee Peng Lim, Wee-Keong Ng, Jian Xu, Yinyan Cao

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

An Interlibrary Loan System On The World Wide Web, Schubert Shou Boon Foo, Ee Peng Lim Jan 1998

An Interlibrary Loan System On The World Wide Web, Schubert Shou Boon Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Inter-Library Loan (ILL) service is one of the services provided by libraries that offers users a way to access library resources beyond their affiliated libraries. Additionally, it allows participating libraries to share and maximize their resources. This work examines the ILL process used by libraries in Singapore and proposes that the existing paper-based manual system be replaced by a Web-based ILL system. Such a Web-based system has been successfully designed and implemented at the Nanyang Technological University. The paper presents an overview of the system requirements and architecture, implementation details and demonstrates the feasibility and advantages of the new system.

Go to article

Evaluation Of Information Modeling Methods: A Review, Keng Siau, Matti Rossi Jan 1998

Evaluation Of Information Modeling Methods: A Review, Keng Siau, Matti Rossi

Research Collection School Of Computing and Information Systems

Hundreds of modeling methods are in existence today. Yet practitioners and researchers are zealously "producing" new modeling methods. The "blooming" of modeling methods is not the problem; the lack of standardize techniques for evaluating them is. To further complicate the matter, most of the modeling methods are introduced based on common sense and intuition. Theoretical foundations and empirical evidence are severely lacking. With the current state of affairs, evaluation of modeling methods has become necessary. Comparing modeling methods provides us with the necessary knowledge and understanding on the strengths and weaknesses of each method. This knowledge can also guide us …

Go to article

Source-Aware Multidatabase Query Processing, Ee Peng Lim, Yinyan Cao, Roger Hsiang-Li Chiang May 1997

Source-Aware Multidatabase Query Processing, Ee Peng Lim, Yinyan Cao, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

We introduce a multidatabase model to represent the information that derives from different local databases. This model, known as Tuple-Source (TS) relational model, accommodates tuples from different local databases by attaching them with their source information in the global relations which are also known as TS-relations. In other words, a source attribute is implicit in every TS-relation. To manipulate the global relations, we have developed the TSSQL query language and implemented a distributed query processor to process such queries. In this paper, we report our distributed query processing architecture and algorithms. Our architecture consists of a query mediator and a …

Go to article

Distributed Query Processing For Structured And Bibliographic Databases, Ee Peng Lim, Ying Lu Apr 1997

Distributed Query Processing For Structured And Bibliographic Databases, Ee Peng Lim, Ying Lu

Research Collection School Of Computing and Information Systems

To support future digital library systems which draw information from different sources on the internet, we have to provide integrated queries to pre-existing database servers which contain structured, semi-structured and unstructured data. In this paper, we specifically examine the problem of querying both existing structured relational databases and bibliographic databases. By adopting the well-accepted Z39.50 standard protocol to access bibliographic databases in different legacy library systems, we have developed an extended SQL model, known as HarpSQL, to support integrated queries to both SQL databases and bibliographic databases. Using HarpSQL, one can not only query bibliographic databases in an SQL manner, …

Go to article

Integrated Queries To Existing Bibliographic And Structured Databases, Ee Peng Lim, Ying Lu Jan 1997

Integrated Queries To Existing Bibliographic And Structured Databases, Ee Peng Lim, Ying Lu

Research Collection School Of Computing and Information Systems

It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw upon different forms of data, including bibliographic, text, multimedia, and structured data. In this paper, the problem of integrating existing public bibliographic databases and structured databases which reside at different locations in the network is addressed. Although bibliographic data is semistructured, its attribute set is often determined by an international standard known as MARC. To unify bibliographic and structured data, the well-known SQL was extended to model bibliographic related attributes and queries. In particular, a new data type was …

Go to article

A Hypermedia Database To Manage World-Wide-Web Documents, Schubert Shou Boon Foo, Ee Peng Lim Jan 1997

A Hypermedia Database To Manage World-Wide-Web Documents, Schubert Shou Boon Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World-Wide-Web (WWW) with its potential commercial payoff has resulted in an explosion of information as organisations join in to publish and do business on the Internet. A related development, Intranet, which basically uses the same technology to build private corporate WWW-based networks, has emerged to provide cost-effective and efficient groupware and information management solutions for organisations. As a result, the Hyper Text Markup Language (HTML), used for constructing WWW documents, has become a contender for authoring future office documents. With this scenario, this study examines WWW practices and highlights the inadequacy and drawbacks of …

Go to article

Managing World Wide Web Publications, Schubert Foo, Ee Peng Lim Jan 1997

Managing World Wide Web Publications, Schubert Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World Wide Web (WWW), with its potential commercial payoff, has resulted in an explosion of information as organizations join in the fray to publish and do business on the Internet. In addition, Intranet, the private corporate WWW‐based network, has also emerged to provide cost‐effective and efficient groupware and information management solutions for organizations. As a result, the HyperText Markup Language used for constructing WWW documents has become a contender for authoring future office documents. Examines the current practices of WWW publishing and highlights its inadequacies and drawbacks. Demonstrates the need and advantages of using …

Go to article

Low-Degree Graph Partitioning Via Local Search With Applications To Constraint Satisfaction, Max Cut, And Coloring, Magnus M. Halldorsson, Hoong Chuin Lau Jan 1997

Low-Degree Graph Partitioning Via Local Search With Applications To Constraint Satisfaction, Max Cut, And Coloring, Magnus M. Halldorsson, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree ∆ that cut at least a k - 1/k (1 + 1/2∆+k-1 ) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a tight analysis of natural local search heuristics for the maximum constraint satisfaction problem. These partitions also imply efficient approximations for several problems on weighted bounded-degree graphs. In particular, we improve the best performance …

Go to article

Export Database Derivation Approach For Supporting Object-Oriented Wrapper Queries, Ee Peng Lim, Hon-Kuan Lee Dec 1996

Export Database Derivation Approach For Supporting Object-Oriented Wrapper Queries, Ee Peng Lim, Hon-Kuan Lee

Research Collection School Of Computing and Information Systems

Wrappers export the schema and data of existing heterogeneous databases and support queries on them. In the context of cooperative information systems, we present a flexible approach to specify the derivation of object-oriented (OO) export databases from local relational databases. Our export database derivation consists of a set of extent derivation structures (EDS) which defines the extent and deep extent of export classes. Having well-defined semantics, the EDS can be readily used in transforming wrapper queries to local queries. Based on the EDS, we developed a wrapper query evaluation strategy which handles OO queries on the export databases. The strategy …

Go to article

An Evidential Reasoning Approach To Attribute Value Conflict Resolution In Database Integration, Ee Peng Lim, Jaideep Srivastava, Shashi Shekhar Oct 1996

An Evidential Reasoning Approach To Attribute Value Conflict Resolution In Database Integration, Ee Peng Lim, Jaideep Srivastava, Shashi Shekhar

Research Collection School Of Computing and Information Systems

Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel [1] showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. In this paper, we show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. We therefore propose an extended relational model based on Dempster-Shafer theory of evidence [2] to incorporate such uncertain knowledge about the source databases. The extended relation uses evidence sets to represent …

Go to article

On Integrating Existing Bibliographic Databases And Structured Databases, Ying Lu, Ee Peng Lim Aug 1996

On Integrating Existing Bibliographic Databases And Structured Databases, Ying Lu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw different forms of data from them. These data include bibliographic data, text data, multimedia data, and structured data. We address the problem of integrating existing bibliographic and structured databases which reside at different locations in the network. To integrate bibliographic data and structured data, we extended the well-known SQL model to represent bibliographic related attributes and queries. In particular, we have added a new data type to model attributes in the bibliographic database. We have also designed specialized predicates …

Go to article

Supporting Search For Reusable Software Objects, T. Isakowitz, Robert J. Kauffman Jun 1996

Supporting Search For Reusable Software Objects, T. Isakowitz, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Prior research has shown that achieving high levels of software reuse in the presence of repository and object-based computer-aided software engineering (CASE) development methods presents interesting human, managerial and technical challenges. This article presents research that seeks to enhanced software development performance through reuse. We propose automated support for developers who search large repositories for the appropriate reusable software objects. We characterize search for repository objects in terms of a multistage model involving screening, identification, and the subsequent choice between new object construction or reusable object implementation. We propose automated support tools, including ORCA, a software Object Reuse Classification Analyzer, …

Go to article

Specifying Object-Oriented Federated Database From Existing Databases, Ee Peng Lim, M. L. Lim, J. Srivastava Jun 1996

Specifying Object-Oriented Federated Database From Existing Databases, Ee Peng Lim, M. L. Lim, J. Srivastava

Research Collection School Of Computing and Information Systems

In this paper, we present a mapping strategy that is based on a proposed set of DB integration operations. We first define an OO federated DB as a virtual view on multiple OO export DBs. Our DB mapping strategy systematically derives each of the class extents, deep class extents and relationships of the federated DB using an operator tree consisting of the integration operations. This mapping approach differs from the other existing approaches in that it is algebraic based, and is therefore very suitable for implementing federated query processing.

Go to article

Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson Feb 1996

Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson

Research Collection School Of Computing and Information Systems

The objective of entity identification is to determine the correspondence between objective instances from more than one database. This paper examines the problem at the instance level assuming that schema level heterogeneity has been resolved a priori. Soundness and completeness are defined as the desired properties of any entity-identification technique. To achieve soundness, a set of identity and distinctness rules have to be established for the entities in the integrated world. We then propose the use of extended key, which is the union of keys (and possibly other attributes) from the relations to be matched, and its corresponding identity rule …

Go to article

On The Complexity Of Manpower Shift Scheduling, Hoong Chuin Lau Jan 1996

On The Complexity Of Manpower Shift Scheduling, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the shift assignment problem in manpower scheduling, and show that a restricted version of it is NP-hard by a reduction from 3SAT. We then present polynomial algorithms to solve special cases of the problem and show how they can be deployed to solve more complex versions of the shift assignment problem. Our work formally defines the computational intractibility of manpower shift scheduling and thus justifies existing works in developing manpower scheduling systems using combinatorial and heuristic techniques.

Go to article

First Prev Next Last