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

Computer Sciences Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 8431 - 8460 of 9003

Full-Text Articles in Computer Sciences

Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon Sep 2004

Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon

Research Collection School Of Computing and Information Systems

Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In this paper, we present a security analysis of two such schemes: the Huang-Chang convertible signcryption scheme, and the Kwak-Moon group signcryption scheme. Our results show that both schemes are insecure. Specifically, the Huang-Chang scheme fails to provide confidentiality, while the Kwak-Moon scheme does not satisfy the properties of unforgeability, coalition-resistance, and traceability.


A Visual Language For Animating Sketches, Richard C. Davis, James A. Landay Sep 2004

A Visual Language For Animating Sketches, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

We present our research into visual languages for animating sketches. Animation is a rich mode of communication that is currently accessible to few. Simple animation systems exist, but severely restrict the types of motion that can be represented. Our field studies are demonstrating that would-be animators need to coordinate many objects moving in a variety of ways. The visual language described here allows a variety of motions to be defined with hand gestures, and gives visual feedback for coordination of events. This may open up computerized communication to users who think in dynamic visual images.


A Spectroscopy Of Texts For Effective Clustering, Wenyuan Li, Wee-Keong Ng, Kok-Leong Ong, Ee Peng Lim Sep 2004

A Spectroscopy Of Texts For Effective Clustering, Wenyuan Li, Wee-Keong Ng, Kok-Leong Ong, Ee Peng Lim

Research Collection School Of Computing and Information Systems

For many clustering algorithms, such as k-means, EM, and CLOPE, there is usually a requirement to set some parameters. Often, these parameters directly or indirectly control the number of clusters to return. In the presence of different data characteristics and analysis contexts, it is often difficult for the user to estimate the number of clusters in the data set. This is especially true in text collections such as Web documents, images or biological data. The fundamental question this paper addresses is: ldquoHow can we effectively estimate the natural number of clusters in a given text collection?rdquo. We propose to use …


A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim Sep 2004

A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim

Research Collection School Of Computing and Information Systems

While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed …


A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang Sep 2004

A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang

Research Collection School Of Computing and Information Systems

We present a two-level coalition formation approach based on a centralized optimization model on the upper level, and a distributed agent-negotiation model on the lower level. This approach allows us to balance agent self-interests against a high joint utility. Experimental results show that the two-level coalition formation mechanism will increase not only the overall utility of the coalition, but also the individual utility of most participating agents. The results also suggest it is better for the agents to be partially cooperative rather than either fully cooperative or self-interested in our setting.


Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu Aug 2004

Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu

Research Collection School Of Computing and Information Systems

Most CEOs have difficulty relating to the information security investments in their companies. This article presents a summary of a the information security maturity model that the CEOs could use to determine the desired level of investments into information security infrastructure, tools and applications.


Novel Seed Selection For Multiple Objects Detection And Tracking, Zailiang Pan, Chong-Wah Ngo Aug 2004

Novel Seed Selection For Multiple Objects Detection And Tracking, Zailiang Pan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a unified approach for initializing, detecting and tracking of multiple moving objects. Object initialization is achieved through novel seed selection which is adaptively activated, depending on the quality of tracking, to select the best possible frames along the temporal direction for object detection. EM algorithm is then employed to robustly segment and detect multiple objects in a selected frame. Each detected object is represented by an appearance-based model and mean shift tracking procedure is adopted to rapidly and effectively track the target objects.


Graph Based Image Matching, Hui Jiang, Chong-Wah Ngo Aug 2004

Graph Based Image Matching, Hui Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern discovery. These problems have different levels of purpose and difficulties, as a result, often associate with different solutions. In this paper, we propose a novel approach to solve these problems under a unified framework based on graph matching. We first split the images into small blocks and represent each block as a node in a bipartite graph. A maximum weighted bipartite graph matching algorithm is then employed in an iterative way to find the …


Sa&D And Database: Should We Be Researching What We Are Teaching?, Jeffrey B. Parson, Akhilesh. Bajaj, Dinesh Batra, Alan Hevner, Keng Siau Aug 2004

Sa&D And Database: Should We Be Researching What We Are Teaching?, Jeffrey B. Parson, Akhilesh. Bajaj, Dinesh Batra, Alan Hevner, Keng Siau

Research Collection School Of Computing and Information Systems

The panel will examine the reasons for the mismatch between SA&D and database teaching and research. The implication of this mismatch on the MIS academic and practitioner communities will also be discussed and debated.


Theoretical And Practical Complexity Of Uml, J. Erickson, Keng Siau Aug 2004

Theoretical And Practical Complexity Of Uml, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

Systems have become increasingly complex, and as a result development methods have become more complex as well. The unified modeling language (UML) has been criticized for the often cited and sometimes over-whelming complexity it presents to its users, and those seeking to learn to use it. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao (2001) completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee (2002) proposed that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, known as theoretical complexity. This is …


Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim Aug 2004

Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

This paper describes an authorization model for specifying access privileges of users who make requests to access a set of locations in a building or more generally a physical or virtual infrastructure. In the model, primitive locations can be grouped into composite locations and the connectivities among locations are represented in a multilevel location graph. Authorizations are defined with temporal constraints on the time to enter and leave a location and constraints on the number of times users can access a location. Access control enforcement is conducted by monitoring user movement and checking access requests against an authorization database. The …


Deformable Geometry Model Matching By Topological And Geometric Signatures, Kwok-Leung Tam, Rynson W.H. Law, Chong-Wah Ngo Aug 2004

Deformable Geometry Model Matching By Topological And Geometric Signatures, Kwok-Leung Tam, Rynson W.H. Law, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

In this paper, we present a novel method for efficient 3D model comparison. The method matches highly deformed models by comparing topological and geometric features. First, we propose “Bi-directional LSD analysis” to locate reliable topological points and rings. Second, based on these points and rings, a set of bounded regions are extracted as topological features. Third, for each bounded region, we capture additional spatial location, curvature and area distribution as geometric data. Fourth, to model the topological importance of each bounded region, we capture its effective area as weight. By using “Earth Mover Distance” as a distance measure between two …


Packet-Loss Resilient Coding Scheme With Only Xor Operations, Gui Liang Feng, Robert H. Deng, Feng Bao Aug 2004

Packet-Loss Resilient Coding Scheme With Only Xor Operations, Gui Liang Feng, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Application of forward error correction to recover lost packets in higher layers of communication networks is receiving increasing attention. Most of the previous proposals for packet loss recovery use symbol-oriented Reed-Solomon codes operating in symbol erasure-correction mode. A Reed-Solomon code is optimal in the sense that it is maximal distance separable; however, the decoding speed of a Reed-Solomon code is slow since it involves operations over GF(2m) using lookup tables. A packet-oriented (n, k)/(m, l) packet-loss resilient code based on an (n, k) Reed-Solomon code over GF(2m) is given. The code accepts k-packet information sequences and encodes them into n-packet …


Group-Based Relevance Feedback With Support Vector Machine Ensembles, Steven C. H. Hoi, Michael R. Lyu Aug 2004

Group-Based Relevance Feedback With Support Vector Machine Ensembles, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Support vector machines (SVMs) have become one of the most promising techniques for relevance feedback in content-based image retrieval (CBIR). Typical SVM-based relevance feedback techniquessimply apply the strict binary classifications: positive (relevant) class and negative (irrelevant) class. However, in a real-world relevance feedback task, it is more reasonable and practical to assume the data come from multiple positive classes and one negative class. In order to formulate an effective relevance feedback algorithm, we propose a novel group-based relevance feedback scheme constructed with the SVM ensembles technique. Experiments are conducted to evaluate the performance of our proposed scheme and the traditional …


High Accuracy Classification Of Eeg Signal, Wenjie Xu, Cuitai Guan, Chng Eng Siong, S. Ranganatha, Manoj Thulasidas, Jiankang Wu Aug 2004

High Accuracy Classification Of Eeg Signal, Wenjie Xu, Cuitai Guan, Chng Eng Siong, S. Ranganatha, Manoj Thulasidas, Jiankang Wu

Research Collection School Of Computing and Information Systems

Improving classification accuracy is a key issue to advancing brain computer interface (BCI) research from laboratory to real world applications. This article presents a high accuracy EEC signal classification method using single trial EEC signal to detect left and right finger movement. We apply an optimal temporal filter to remove irrelevant signal and subsequently extract key features from spatial patterns of EEG signal to perform classification. Specifically, the proposed method transforms the original EEG signal into a spatial pattern and applies the RBF feature selection method to generate robust feature. Classification is performed by the SVM and our experimental result …


Ica-Fx Features For Classification Of Singing Voice And Instrumental Sound, Tat-Wan Leung, Chong-Wah Ngo, Rynson W. H Lau Aug 2004

Ica-Fx Features For Classification Of Singing Voice And Instrumental Sound, Tat-Wan Leung, Chong-Wah Ngo, Rynson W. H Lau

Research Collection School Of Computing and Information Systems

This paper describes a new approach in locating the segments of singing voice in pop musical songs. Initially, GLR distance measure is employed to temporally detect the boundaries of singing voices and instrumental sounds. ICAFX is then adopted to extract the independent components of acoustic features for SVM classification. Experimental results indicate that ICA-FX can improve the classification performance by significantly reducing the independent components that are not related to class label information.


Gesture Tracking And Recognition For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong Aug 2004

Gesture Tracking And Recognition For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

This paper presents a gesture based driven approach for video editing. Given a lecture video, we adopt novel approaches to automatically detect and synchronize its content with electronic slides. The gestures in each synchronized topic (or shot) are then tracked and recognized continuously. By registering shots and slides and recovering their transformation, the regions where the gestures take place can be known. Based on the recognized gestures and their registered positions, the information in slides can be seamlessly extracted, not only to assist video editing, but also to enhance the quality of original lecture video.


Values Of Mobile Technology In Education, Fiona Fui-Hoon Nah, Keng Siau, H. Sheng Aug 2004

Values Of Mobile Technology In Education, Fiona Fui-Hoon Nah, Keng Siau, H. Sheng

Research Collection School Of Computing and Information Systems

Mobile technology shows promise in supporting and improving education and its delivery. Coupled with the use of mobile devices and software/hardware solutions that make it possible to access educational content, students can be exposed to new educational experience. Applications of mobile technology in education can provide many benefits including greater flexibility, more available education resources, as well as greater convenience, accessibility and responsiveness. As a new phenomenon that will be widely used and adopted in the years to come, the values of mobile technology in education should be better understood and researched. This research outlines our empirical study to examine …


Investigating Deception In Cyberspace, Holtjona Galanxhi, Fiona Fui-Hoon Nah Aug 2004

Investigating Deception In Cyberspace, Holtjona Galanxhi, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

The use of anthropomorphic avatars provides Internet users the opportunity and freedom to present their desired identity. As cyberspace becomes a heaven for deceptive behavior, human-computer interaction research will need to be carried out to study and understand these deceptive behaviors. The objective of this research is to investigate the behavior of deceivers and truthtellers in the cyberspace environment and to examine how their intention to deceive may influence the choice of their avatars. The effect of using avatars to support communication will also be studied. This research provides insights on communication and trust issues in avatar environments.


Exploiting Information Theory For Adaptive Mobility And Resource Management In Future Cellular Networks, Abhishek Roy, Sajal K. Das, Archan Misra Aug 2004

Exploiting Information Theory For Adaptive Mobility And Resource Management In Future Cellular Networks, Abhishek Roy, Sajal K. Das, Archan Misra

Research Collection School Of Computing and Information Systems

We utilize tools from information theory to develop adaptive algorithms for two key problems in cellular networks: location tracking and resource management. The use of information theory is motivated by the fundamental observation that overheads in many aspects of mobile computing can be traced to the randomness or uncertainty in an individual user's movement behavior. We present a model-independent information-theoretic approach for estimating and managing this uncertainty, and relate it to the entropy or information content of the user's movement process. Information-theoretic mobility management algorithms are very simple, yet reduce overhead by ∼80 percent in simulated scenarios by optimally adapting …


Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu Jul 2004

Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu

Research Collection School Of Computing and Information Systems

In this paper, we study a logistics problem arising in military transport planning. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We address the following two problems: (1) how many vehicles are at least needed to meet a given service level of requests; and (2) suppose we allow each request to shift its start time by a constant duration, call all the requests be met? A Niche genetic algorithm, together …


Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham Jul 2004

Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on …


An Interactive Learning Environment For A Dynamic Educational Digital Library, Ee Peng Lim, Dion Hoe-Lian Goh, Yin-Leng Theng, Eng-Kai Suen Jul 2004

An Interactive Learning Environment For A Dynamic Educational Digital Library, Ee Peng Lim, Dion Hoe-Lian Goh, Yin-Leng Theng, Eng-Kai Suen

Research Collection School Of Computing and Information Systems

GeogDL is a digital library of geography examination resources designed to assist students in preparing for a national geography examination in Singapore. We describe an interactive learning environment built into GeogDL that consists of four major components. The practice and review module allows students to attempt individual examination questions, the mock exam provides a simulation of the actual geography examination, the trends analysis tool provides an overview of the types of questions asked in previous examinations, while the contributions module allows students and teachers to create and share knowledge within the digital library.


Infosemm: Infosys It Security Maturity Model: A Report, Arcot Desai Narasimhalu, N. Dayasindhu, Raghavan Subramanian Jul 2004

Infosemm: Infosys It Security Maturity Model: A Report, Arcot Desai Narasimhalu, N. Dayasindhu, Raghavan Subramanian

Research Collection School Of Computing and Information Systems

Businesses are faced with a continuing battle related to cyber security related issues ranging from cyber attacks all the way to cyber (information) war. These issues affect result in information, system, reputation, and revenue related risks. These risks arise because of vulnerabilities introduced in three major parts of the enterprise – infrastructure, intelligence and practices. This report provides a rating system for representing the security health of enterprises.


Biased Support Vector Machine For Relevance Feedback In Image Retrieval, Steven Hoi, Chi-Hang Chan, Kaizhu Huang, Michael R. Lyu, Irwin King Jul 2004

Biased Support Vector Machine For Relevance Feedback In Image Retrieval, Steven Hoi, Chi-Hang Chan, Kaizhu Huang, Michael R. Lyu, Irwin King

Research Collection School Of Computing and Information Systems

Recently, support vector machines (SVMs) have been engaged on relevance feedback tasks in content-based image retrieval. Typical approaches by SVMs treat the relevance feedback as a strict binary classification problem. However, these approaches do not consider an important issue of relevance feedback, i.e. the unbalanced dataset problem, in which the negative instances largely outnumber the positive instances. For solving this problem, we propose a novel technique to formulate the relevance feedback based on a modified SVM called biased support vector machine (Biased SVM or BSVM). Mathematical formulation and explanations are provided for showing the advantages. Experiments are conducted to evaluate …


A Support-Ordered Trie For Fast Frequent Itemset Discovery, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng Jul 2004

A Support-Ordered Trie For Fast Frequent Itemset Discovery, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

The importance of data mining is apparent with the advent of powerful data collection and storage tools; raw data is so abundant that manual analysis is no longer possible. Unfortunately, data mining problems are difficult to solve and this prompted the introduction of several novel data structures to improve mining efficiency. Here, we critically examine existing preprocessing data structures used in association rule mining for enhancing performance in an attempt to understand their strengths and weaknesses. Our analyses culminate in a practical structure called the SOTrielT (support-ordered trie itemset) and two synergistic algorithms to accompany it for the fast discovery …


An Empirical Investigation On End-Users’ Acceptance Of Enterprise Systems, Fiona Fui-Hoon Nah, Xin Tan, Soon Hing Teh Jul 2004

An Empirical Investigation On End-Users’ Acceptance Of Enterprise Systems, Fiona Fui-Hoon Nah, Xin Tan, Soon Hing Teh

Research Collection School Of Computing and Information Systems

Despite the huge investments by organizations in ERP implementation, maintenance, and user training, ERP implementation failures and less-than-satisfactory productivity improvements are common. End-users’ reluctance or unwillingness to adopt or use the newly implemented ERP system is often cited as one of the main reasons for ERP failures. To examine factors leading to the lack of end-user acceptance of ERP systems, we reviewed the literature on user adoption of IT in mandatory contexts, developed hypotheses to explain ERP user acceptance, and conducted a survey study to test the hypotheses. In particular, we examined end-users’ attitudes toward system use and symbolic adoption, …


Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman Jul 2004

Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman

Research Collection School Of Computing and Information Systems

In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact, convex strategy spaces and continuous, quasiconcave utility functions have symmetric pure-strategy Nash equilibria. Finally, we discuss how to exploit symmetry for more efficient methods of finding Nash equilibria.


Proprietary And Open Systems Adoption In E-Procurement: A Risk-Augmented Transactions Cost Perspective, Robert J. Kauffman, Hamid Mohtadi Jun 2004

Proprietary And Open Systems Adoption In E-Procurement: A Risk-Augmented Transactions Cost Perspective, Robert J. Kauffman, Hamid Mohtadi

Research Collection School Of Computing and Information Systems

We present an economic model that enables the study of incentives for business-to-business (B2B) e-procurement systems investments that permit inventory coordination and improved operational control. We focus on the information technology adoption behavior of firms in the presence of transaction costs, agency costs and information uncertainty. We conclude that it is appropriate to rethink the prior theory and develop an extended transaction-cost theory perspective that incorporates the possibility of shocks. We distinguish among three kinds of B2B e-procurement systems platforms. Proprietary platform procurement systems involve traditional electronic data interchange (EDI) technologies. Open platform procurement systems are associated with e-market Web …


Furthering The Understanding Of Practical Complexity: Identifying A Kernel Of Uml, J. Erickson, Keng Siau Jun 2004

Furthering The Understanding Of Practical Complexity: Identifying A Kernel Of Uml, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

The Unified Modeling Language (UML) was adopted by the Object Management Group as the standard visual modeling language for OO systems development. However, UML has been criticized in the literature for its complexity, inconsistent semantics, and ambiguous constructs. A set of complexity indices for UML in aggregate, and the nine diagramming techniques individually, was compiled recently. Since this set of metrics is based on inclusion of all possible constructs in UML, it thus provides an indication of the theoretical (maximum) complexity of the modeling methods. This paper contends that in practice, developers do not use all of the possible diagrams …