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 10081 - 10110 of 10474

Full-Text Articles in Entire DC Network

Video Partitioning By Temporal Slice Coherency, Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin Aug 2001

Video Partitioning By Temporal Slice Coherency, Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a novel approach for video partitioning by detecting three essential types of camera breaks, namely cuts, wipes, and dissolves. The approach is based on the analysis of temporal slices which are extracted from the video by slicing through the sequence of video frames and collecting temporal signatures. Each of these slices contains both spatial and temporal information from which coherent regions are indicative of uninterrupted video partitions separated by camera breaks. Properties could further be extracted from the slice for both the detection and classification of camera breaks. For example, cut and wipes are detected by color-texture properties, …

Go to article

A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo Aug 2001

A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo

Research Collection School Of Computing and Information Systems

A distributed intelligent agent-based framework that supports fourth-party logistics optimization under a web-based e-Commerce environment has been proposed in this paper. In the framework, customer job requests come through an e-Procurement service. These requests are consolidated and pushed to the e-Market Place service periodically. The e-Market Place then serves as a broker that allows intelligent agents to bid to serve these requests optimally in real-time by solving multiple instances of underlying logistics optimization problem. The resulting system was implemented based on the Java 2 Enterprise Edition (J2EE) platform using distributed system technology for communication between objects.

Go to article

Autoconfiguration, Registration And Mobility Management For Pervasive Computing, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das Aug 2001

Autoconfiguration, Registration And Mobility Management For Pervasive Computing, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das

Research Collection School Of Computing and Information Systems

In the vision of pervasive computing, users will exchange information and control their environments from anywhere using various wireline/wireless networks and computing devices. We believe that current protocols, such as DHCP, PPP, and Mobile IP, must be enhanced to support pervasive network access. In particular, this article identifies three fundamental functions: autoconfiguration, registration, and mobility management, that need such enhancements. Realizing that the IP autoconfiguration capabilities must be extended to configure routers and large dynamic networks, we first describe our autoconfiguration solution based on the dynamic configuration and distribution protocol (DCDP). Second, we discuss why providing user-specific services over a …

Go to article

Application-Centric Analysis Of Ip-Based Mobility Management Techniques, Archan Misra, Subir Das, Prathima Agrawal Jul 2001

Application-Centric Analysis Of Ip-Based Mobility Management Techniques, Archan Misra, Subir Das, Prathima Agrawal

Research Collection School Of Computing and Information Systems

This paper considers three applications—VoIP, mobile Web access and mobile server-based data transfers—and evaluates the applicability of various IP-based mobility management mechanisms. We first survey the features and characteristics of various IP mobility protocols, such as MIPv4, MIPv6, MIP-RO, SIP, CIP, HAWAII, MIP-RR and IDMP, and then evaluate their utility on an application-specific basis. The diversity in the mobility-related requirements ensures that no single mobility solution is universally applicable. We recommend a hierarchical mobility architecture. The framework uses our Dynamic Mobility Agent (DMA) architecture for managing intra-domain mobility and multiple application-based binding protocols for supporting inter-domain mobility. Thus, we recommend …

Go to article

Recent Advances In Content-Based Video Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang Jul 2001

Recent Advances In Content-Based Video Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this paper, we present major issues in video parsing, abstraction, retrieval and semantic analysis. We discuss the success, the difficulties and the expectations in these areas. In addition, we identify important opened problems that can lead to more sophisticated ways of video content analysis. For video parsing, we discuss topics in video partitioning, motion characterization and object segmentation. The success in video parsing, in general, will have a great impact on video representation and retrieval. We present three levels of abstracting video content by scene, keyframe and key object representations. These representation schemes in overall serve as a good …

Go to article

Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu Jul 2001

Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu

Research Collection School Of Computing and Information Systems

With the rapid growth of broadband infrastructure, it is thought that the bottleneck for video-on-demand service through Internet is being cleared. However, digital video content protection and consumers privacy protection emerge as new major obstacles. In this paper we propose an online video distribution system with strong content security and privacy protection. We mainly focus on the study of security and privacy problems related to the system. Besides presenting the new system, we intensively discuss some relevant cryptographic issues, such as content protection, private information retrieval, super-speed encryption/decryption for video, and PKC with fast decryption etc. The paper can be …

Go to article

Mobile Commerce: Promises, Challenges And Research Agenda, Keng Siau, Ee Peng Lim Jul 2001

Mobile Commerce: Promises, Challenges And Research Agenda, Keng Siau, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Advances in wireless technology increase the number of mobile device users and give pace to the rapid development of e-commerce using these devices. The new type of e-commerce, conducting transactions via mobile terminals, is called mobile commerce. Due to its inherent characteristics such as ubiquity, personalization, flexibility, and dissemination, mobile commerce promises businesses unprecedented market potential, great productivity, and high profitability. This paper presents an overview of mobile commerce development by examining the enabling technologies, the impact of mobile commerce on the business world, and the implications to mobile commerce providers. The paper also provides an agenda for future research …

Go to article

Gaussian Estimation Of Continuous Time Models Of The Short Term Interest Rate, Jun Yu, Peter C. B. Phillips Jul 2001

Gaussian Estimation Of Continuous Time Models Of The Short Term Interest Rate, Jun Yu, Peter C. B. Phillips

Research Collection School Of Economics

This paper proposes a Gaussian estimator for nonlinear continuous time models of the short term interest rate. The approach is based on a stopping time argument that produces a normalizing transformation facilitating the use of a Gaussian likelihood. A Monte Carlo study shows that the finite sample performance of the proposed procedure offers an improvement over the discrete approximation method proposed by Nowman (1997). An empirical application to U.S. and British interest rates is given.

Go to article

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu Jun 2001

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu

Research Collection School Of Computing and Information Systems

We explore the use of GAs for solving a network optimization problem, the degree-constrained minimum spanning tree problem. We also examine the impact of encoding, crossover, and mutation on the performance of the GA. A specialized repair heuristic is used to improve performance. An experimental design with 48 cells and ten data points in each cell is used to examine the impact of two encoding methods, three crossover methods, two mutation methods, and four networks of varying node sizes. Two performance measures, solution quality and computation time, are used to evaluate the performance. The results obtained indicate that encoding has …

Go to article

Effect Of Exponential Averaging On The Variability Of A Red Queue, Archan Misra, Teunis Ott, John Baras Jun 2001

Effect Of Exponential Averaging On The Variability Of A Red Queue, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper analyzes how using a longer memory of the past queue occupancy in computing the average queue occupancy affects the stability and variability of a RED queue. Extensive simulation studies with both persistent and Web TCP sources are used to study the variance of the RED queue as a function of the memory of the averaging process. Our results show that there is very little performance improvement (and in fact, possibly significant performance degradation) if the length of memory is increased beyond a very small value. Contrary to current practice, our results show that a longer memory reduces the …

Go to article

An Investigation Of Goodwill Accounting Policy Choice Within A Specific Knowledge Framework, Pearl H. N. Tan Jun 2001

An Investigation Of Goodwill Accounting Policy Choice Within A Specific Knowledge Framework, Pearl H. N. Tan

Research Collection School Of Accountancy

This study, using Singapore data, investigates the relationship between Chief Executive Officers' (CEO) specific knowledge and the accounting method choice on capitalisation of goodwill. International Accounting Standard 22 (1987), applicable in Singapore in 1996, the year of the study, permits a choice between capitalisation with subsequent amortisation and immediate write-off of goodwill to reserves. This study proposes a positive relationship between human capital specificity of CEOs and the recognition of purchased goodwill on the balance sheet. Specific knowledge is unique to firms and is acquired through experience. Given that specialised assets arise from firm-specific circumstances, firm-specific knowledge potentially explains the …

Go to article

Implementation And Performance Evaluation Of Telemip, Kaushik Chakraborty, Archan Misra, Subir Das, Anthony J. Mcauley, Ashutosh Dutta, Sajal K. Das Jun 2001

Implementation And Performance Evaluation Of Telemip, Kaushik Chakraborty, Archan Misra, Subir Das, Anthony J. Mcauley, Ashutosh Dutta, Sajal K. Das

Research Collection School Of Computing and Information Systems

In this paper, we present our implementation of TeleMIP a two-level architecture for IP based mobility management TeleMIP essentially uses an Intra-Domain Mobility Management Protocol IDMP for managing mobility within a domain and Mobile IP for supporting inter-domain global mobility. Unlike other proposed schemes for intra-domain mobility management IDMP uses two care of addresses for mobility management The global care of address is relatively stable and identifies the mobile nodes current domain[1] while the local care of address changes every time the mobile changes subnets and identifies the mobiles current point of attachment. The paper describes our TeleMIP implementation based …

Go to article

The Next Wave In Erp Implementation, Keng Siau, Y. Tian May 2001

The Next Wave In Erp Implementation, Keng Siau, Y. Tian

Research Collection School Of Computing and Information Systems

Although the benefits of ERP are obvious, the risks and costs associated with it are very high. Some problems in implementing ERP system are documented, but the real challenge comes from the Internet and E-business. ERP is an enterprise wide system whose purpose is to achieve internal efficiency, while E-business cuts across different enterprises and extends the individual value chain into an Internet based, dynamic process aimed at maximizing external efficiency. To survive the E-business challenge, the arguably single, and also the best, solution for ERP systems is to integrate with E-business applications, which we call ERP II. By properly …

Go to article

Idmp-Based Fast Handoffs And Paging In Ip-Based Cellular Networks, Archan Misra, Subir Das, Ashutosh Dutta, Sajal K. Das May 2001

Idmp-Based Fast Handoffs And Paging In Ip-Based Cellular Networks, Archan Misra, Subir Das, Ashutosh Dutta, Sajal K. Das

Research Collection School Of Computing and Information Systems

We consider the use of our previously proposed Intra-Domain Mobility Management Protocol (IDMP) in fourth-generation mobile networks. On evaluating the heterogeneous access technologies, cellular layouts, and application characteristics of 4G environments, we realize a need to reduce both handoff latency and the frequency of mobility-related signaling. We first present IDMP's fast intradomain handoff mechanism that uses a duration-limited proactive packet multicasting solution. We quantify the expected buffering requirements of our proposed multicasting scheme for typical 4G network characteristics and compare it with alternative IP-based fast handoff solutions. We also present a paging scheme under IDMP that replicates the current cellular …

Go to article

Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan Apr 2001

Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a class of predictive self-organizing neural networks known as Adaptive Resonance Associative Map (ARAM) for classification of free-text documents. Whereas most sta- tistical approaches to text categorization derive classification knowledge based on training examples alone, ARAM performs supervised learn- ing and integrates user-defined classification knowledge in the form of IF-THEN rules. Through our experiments on the Reuters-21578 news database, we showed that ARAM performed reasonably well in mining categorization knowledge from sparse and high dimensional document feature space. In addition, ARAM predictive accuracy and learning efficiency can be improved by incorporating a set of rules derived from …

Go to article

Tcp Hack: Tcp Header Checksum Option To Improve Performance Over Lossy Links, Rajesh Krishna Balan, Boon Peng Lee, Renjish Kumar, Jacob Lillykutty, Winston Seah, A. L. Ananda Apr 2001

Tcp Hack: Tcp Header Checksum Option To Improve Performance Over Lossy Links, Rajesh Krishna Balan, Boon Peng Lee, Renjish Kumar, Jacob Lillykutty, Winston Seah, A. L. Ananda

Research Collection School Of Computing and Information Systems

Wireless networks have become increasingly common and an increasing number of devices are communicating with each other over lossy links. Unfortunately, TCP performs poorly over lossy links as it is unable to differentiate the loss due to packet corruption from that due to congestion. We present an extension to TCP which enables TCP to distinguish packet corruption from congestion in lossy environments resulting in improved performance. We refer to this extension as the HeAder ChecKsum option (HACK). We implemented our algorithm in the Linux kernel and performed various tests to determine its effectiveness. Our results have shown that HACK performs …

Go to article

Topic Detection, Tracking, And Trend Analysis Using Self-Organizing Neural Networks, Kanagasabai Rajaraman, Ah-Hwee Tan Apr 2001

Topic Detection, Tracking, And Trend Analysis Using Self-Organizing Neural Networks, Kanagasabai Rajaraman, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

We address the problem of Topic Detection and Tracking (TDT) and subsequently detecting trends from a stream of text documents. Formulating TDT as a clustering problem in a class of self-organizing neural networks, we propose an incremental clustering algorithm. On this setup we show how trends can be identified. Through experimental studies, we observe that our method enables discovering interesting trends that are deducible only from reading all relevant documents.

Go to article

District Magnitude, Electoral Formula, And The Number Of Parties, Kenneth Benoit Mar 2001

District Magnitude, Electoral Formula, And The Number Of Parties, Kenneth Benoit

Research Collection School of Social Sciences

Duverger's propositions concerning the psychologicaland mechanical consequences of electoral rules have previously beenexamined mainly through the lens of district magnitude,comparing the properties of single-member district pluralityelections with those of multimember proportional representationelections. The empirical consequences of multi-member plurality(MMP) rules, on the other hand, have received scant attention.Theory suggests that the effect of district magnitude on the numberand concentration of parties will differ with regard to whether theallocation rules are plurality-based or proportional. I test thistheory by drawing on a uniquely large-sample dataset where districtmagnitude and electoral formula vary but the basic universe ofpolitical parties is held constant, applying regression analysis …

Go to article

Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng Feb 2001

Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete logarithm problem is hard to solve. Two schemes (the ID-type and the random-type schemes) based on the linear scheme for the Key Predistribution Systems (KPS) and the discrete logarithm problem (DLP) were given. In this paper we show that those two schemes fail to meet the nonrepudiation requirement: with negligible amount of computation, a signature could be forged. For the ID-type signature scheme, any verifier could forge a signature to raise repudiation between that …

Go to article

Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu Feb 2001

Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu

Research Collection School Of Computing and Information Systems

The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modified SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].

Go to article

A Note On The Paper “Resource-Constrained Project Scheduling: Notation, Classification, Models And Methods” By Brucker Et Al., Willy Herroelen, Erik Demeulemeester, Bert De Reyck Feb 2001

A Note On The Paper “Resource-Constrained Project Scheduling: Notation, Classification, Models And Methods” By Brucker Et Al., Willy Herroelen, Erik Demeulemeester, Bert De Reyck

Research Collection Lee Kong Chian School Of Business

The great variety of project scheduling problems studied in the ever growing literature motivated the recent development of classification schemes. In a recent paper (European Journal of Operational Research 112 (1999) 3–41), Brucker et al. make the claim that, so far, no classification scheme exists which is compatible with what is commonly accepted in machine scheduling and introduce a new classification. In this note, we critically review major shortcomings of the suggested scheme which place heavy limitations on its potential use.

Go to article

Pricing Options Using Implied Trees, Kian Guan Lim, Da Zhi Jan 2001

Pricing Options Using Implied Trees, Kian Guan Lim, Da Zhi

Research Collection Lee Kong Chian School Of Business

No abstract provided.

Go to article

Simulation Methodologies For Political Scientists, Kenneth Benoit Jan 2001

Simulation Methodologies For Political Scientists, Kenneth Benoit

Research Collection School of Social Sciences

In this brief article I identify and characterize the variety of simulation methodologies relevant to political science research. Having identified them, I then recount a light-hearted tale of one successful application of a computer simulation to a real world problem of enormous significance. Extending the discussion to other examples, I discuss some of the main issues and benefits in simulation models for political science. Finally, I identify some software tools and additional resources for those who would like to learn more about using simulation methods for their own work.

Go to article

A Framework For Performance And Value Assessment Of E-Business Systems In Corporate Travel Distribution, A.M. Chircu, Robert J. Kauffman Jan 2001

A Framework For Performance And Value Assessment Of E-Business Systems In Corporate Travel Distribution, A.M. Chircu, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

This chapter proposes and illustrates a framework that the authors call the value life cycle for e-commerce systems. Based on recent research results that relate to technology investments in the corporate travel industry and related theoretical and empirical perspectives, the authors lay out the corporate travel e-commerce system solutions value life cycle. The perspective involves estimating the maximum value that that an organization can obtain by implementing an e-commerce system in a specific industry and competitive environment. It also considers multiple factors that act as value contingencies for the implementation process. These create barriers to value accrual and to …

Go to article

Unified Modeling Language: A Complexity Analysis, Keng Siau, Q. Cao Jan 2001

Unified Modeling Language: A Complexity Analysis, Keng Siau, Q. Cao

Research Collection School Of Computing and Information Systems

Unified Modeling Language (UML) is the standard visual modeling language for Object Oriented (OO) systems development, but it has been criticized for its complexity, inconsistent semantics, and ambiguous constructs. A set of complexity indices for UML and the nine diagramming techniques in UML was compiled recently. The complexity analysis is formulated based on the number of constructs, associations, roles, and so forth, in a modeling method. We argue that this set of metrics provides an indication of the theoretical complexity of the modeling methods. On the other hand, the theoretical complexity of the modeling methods does not necessarily relate to …

Go to article

Ontologies And Electronic Commerce, Dieter Fensel, Deborah L. Mcguinness, Ellen Schulten, Wee-Keong Ng, Ee Peng Lim, Guanghao Yan Jan 2001

Ontologies And Electronic Commerce, Dieter Fensel, Deborah L. Mcguinness, Ellen Schulten, Wee-Keong Ng, Ee Peng Lim, Guanghao Yan

Research Collection School Of Computing and Information Systems

Ontologies are the first step toward realizing the full power of online e-commerce. Ontologies enable machine-understandable semantics of data, and building this data infrastructure will enable completely new kinds of automated services. Software agents can search for products, form buyer and seller coalitions, negotiate about products, or help automatically configure products and services according to specified user requirements. The combination of machine-processable semantics of data based on ontologies and the development of many specialized reasoning services will bring the Web to its full power. The authors discuss: taxonomies; information sources; future issues; business viewpoints; the e-marketplace; and B2B e-commerce standardisation …

Go to article

Incorporating Window-Based Passage-Level Evidence In Document Retrieval, Wensi Xi, Richard Xu-Rong, Christopher Soo Guan Khoo, Ee Peng Lim Jan 2001

Incorporating Window-Based Passage-Level Evidence In Document Retrieval, Wensi Xi, Richard Xu-Rong, Christopher Soo Guan Khoo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

This study investigated whether document retrieval can be improved if documents are divided into smaller sub-documents or passages and the retrieval score for these passages are incorporated in the final retrieval score for the whole document. The documents were segmented by sliding a window of a certain size across the document and extracting the words displayed each time the window stopped. A retrieval score was calculated for each of the passages extracted and the highest score obtained by a passage of that size was taken as the document’s passage-level score for that window size. A range of window sizes was …

Go to article

Do Stock Returns Follow A Finite Variance Distribution?, Q. M. Shao, H. Yu, Jun Yu Jan 2001

Do Stock Returns Follow A Finite Variance Distribution?, Q. M. Shao, H. Yu, Jun Yu

Research Collection School Of Economics

In this paper we propose a test statistic to discriminate between models with finite variance and models with infinite variance. The test statistic is the ratio of the sample standard deviation and the sample interquartile range. Both asymptotic and finite sample properties of the test statistic are discussed. We show that the test has good power properties against infinite-variance distributions and has small size distortions in finite samples. The statistic is applied to compare the competing models for S&P 500 index returns. Our test cannot reject most distributions with finite variance for both a pre-crash sample and a post-crash sample, …

Go to article

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu Dec 2000

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu

Research Collection School Of Computing and Information Systems

We study a complex optimization problem that arises due to an emerging trend in distribution logistics. The problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. We describe a collaborative approach to solve this problem in real-time. The novelty of our approach lies in the tight algorithmic integration between two sub-problems, and suggests an elegant scheme to deal with other integrated optimization problems of the same nature. For first sub-problem, we will present two algorithms: a complete mathematical model integrating integer programming with constraint …

Go to article

Knowledge Discovery As An Aid To Organizational Creativity, Keng Siau Dec 2000

Knowledge Discovery As An Aid To Organizational Creativity, Keng Siau

Research Collection School Of Computing and Information Systems

Computers can play an important role in the creative process. With the abundance of data and increasing speed of computers, creativity can now be stimulated and enhanced with knowledge mined from available data. The process is known as knowledge discovery or data mining. Knowledge discovery is the process of discovering interesting associations among data in the database. Users in the creativity process can feed on the discovered associations to generate creative solutions. The objective of this paper is to present knowledge discovery as an aid to creativity. The paper first presents the concept of knowledge discovery and then discusses the …

Go to article

First Prev Next Last