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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 3961 - 3990 of 4258

Full-Text Articles in Entire DC Network

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 …


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.


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 …


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 …


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 …


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.


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


Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou Jun 2004

Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou

Research Collection School Of Computing and Information Systems

While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. We introduce StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence. Unlike other steganographic schemes proposed previously, our construction satisfies the prerequisites of a practical file system in ensuring the integrity of the files and maintaining efficient space utilization. We also propose two schemes for implementing …


Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar Jun 2004

Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar

Research Collection School Of Computing and Information Systems

In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely to be slow. Alternatively if the selection pressure is set too high the system is likely to become stuck in a local optimum due to a loss of diversity in the population. The recent Fitness Uniform Selection Scheme (FUSS) is a conceptually simple but somewhat radical approach to addressing this problem - rather than biasing the selection towards higher fitness, FUSS biases selection towards sparsely populated fitness levels. In …


Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim May 2004

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim

Research Collection School Of Computing and Information Systems

This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.


Toolglasses, Marking Menus, And Hotkeys: A Comparison Of One And Two-Handed Command Selection Techniques, Daniel L. Odell, Richard C. Davis, Andrew Smith, Paul K. Wright May 2004

Toolglasses, Marking Menus, And Hotkeys: A Comparison Of One And Two-Handed Command Selection Techniques, Daniel L. Odell, Richard C. Davis, Andrew Smith, Paul K. Wright

Research Collection School Of Computing and Information Systems

This paper introduces a new input technique, bimanual marking menus, and compares its performance with five other techniques: static toolbars, hotkeys, grouped hotkeys, marking menus, and toolglasses. The study builds on previous work by setting the comparison in a commonly encountered task, shape drawing. In this context, grouped hotkeys and bimanual marking menus were found to be the fastest. Subjectively, the most pre-ferred input method was bimanual marking menus. Toolglass performance was unexpectedly slow, which hints at the importance of low-level toolglass imple-mentation choices.


Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra May 2004

Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra

Research Collection School Of Computing and Information Systems

We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal choice of the transmission power depends on the link distance between the two nodes and the channel characteristics. Typical energy efficient routing techniques use a transmission power such that the received signal power at the destination minimally exceeds a desired threshold signal strength level. In this paper we argue that such a choice of the transmission power does not always lead to optimal energy routes, since it does not consider differences in the receiver noise levels.We …


Phoneme-Based Transliteration Of Foreign Names For Oov Problem, Wei Gao, Kam-Fai Wong, Wai Lam Mar 2004

Phoneme-Based Transliteration Of Foreign Names For Oov Problem, Wei Gao, Kam-Fai Wong, Wai Lam

Research Collection School Of Computing and Information Systems

A proper noun dictionary is never complete rendering name translation from English to Chinese ineffective. One way to solve this problem is not to rely on a dictionary alone but to adopt automatic translation according to pronunciation similarities, i.e. to map phonemes comprising an English name to the phonetic representations of the corresponding Chinese name. This process is called transliteration. We present a statistical transliteration method. An efficient algorithm for aligning phoneme chunks is described. Unlike rule-based approaches, our method is data-driven. Compared to source-channel based statistical approaches, we adopt a direct transliteration model, i.e. the direction of probabilistic estimation …


Efficient Group Pattern Mining Using Data Summarization, Yida Wang, Ee Peng Lim, San-Yih Hwang Mar 2004

Efficient Group Pattern Mining Using Data Summarization, Yida Wang, Ee Peng Lim, San-Yih Hwang

Research Collection School Of Computing and Information Systems

In group pattern mining, we discover group patterns from a given user movement database based on their spatio-temporal distances. When both the number of users and the logging duration are large, group pattern mining algorithms become very inefficient. In this paper, we therefore propose a spherical location summarization method to reduce the overhead of mining valid 2-groups. In our experiments, we show that our group mining algorithm using summarized data may require much less execution time than that using non-summarized data.


Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei Mar 2004

Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei

Research Collection School Of Computing and Information Systems

Users see the database interface as the database system. A good interface enables them to formulate queries better. The semantics communicated through the interface can be classified according to abstraction levels, such as the conceptual and logical levels. With the conceptual interface, interaction is in terms of real-world concepts such as entities, objects and relationships. Current user-database interaction is mainly based on the logical interface, where interaction is in terms of abstract database concepts such as relations and joins. Many researchers argue that end users will perform better with the conceptual interface. This research tested this claim, as well as …


An Information-Theoretic Framework For Optimal Location Tracking In Multi-System 4g Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das Mar 2004

An Information-Theoretic Framework For Optimal Location Tracking In Multi-System 4g Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das

Research Collection School Of Computing and Information Systems

An information-theoretic framework is developed for optimal location management in multisystem, fourth generation (4G) wireless networks. The framework envisions that each individual subsystem operates fairly independently, and does not require public knowledge of individual subnetwork topologies. To capture the variation in paging and location update costs in this heterogeneous environment, the location management problem is formulated in terms of a new concept of weighted entropy. The update process is based on the Lempel-Ziv compression algorithms, which are applied to a vector-valued sequence consisting of both the mobile's movement pattern and its session activity state. Three different tracking strategies which differ …


Clash: A Protocol For Internet-Scale Utility-Oriented Distributed Computing, Archan Misra, Paul Castro, Jinwon Lee Mar 2004

Clash: A Protocol For Internet-Scale Utility-Oriented Distributed Computing, Archan Misra, Paul Castro, Jinwon Lee

Research Collection School Of Computing and Information Systems

Distributed hash table (DHT) overlay networks offer an efficient and robust technique for wire-area data storage and queries. Workload from real applications that use DHT networks will likely exhibit significant skews that can result in bottlenecks and failures that limit the overall scalability of the DHT approach. We present the content and load-aware scalable hashing (CLASH) protocol that can enhance the load distribution behavior of a DHT. CLASH relies on a variable-length identifier key scheme, where the length of any individual key is a function of load. CLASH uses variable-length keys to cluster content-related objects on single nodes to achieve …


A Modeling Framework For Computing Lifetime And Information Capacity In Wireless Sensor Networks, Enrique Duarte-Melo, Mingyan Liu, Archan Misra Mar 2004

A Modeling Framework For Computing Lifetime And Information Capacity In Wireless Sensor Networks, Enrique Duarte-Melo, Mingyan Liu, Archan Misra

Research Collection School Of Computing and Information Systems

In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluidflow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates.


Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis Mar 2004

Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1 , q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query returns the data point p that minimizes the sum of Euclidean distances |pqi| for 1 ≤i ≤3. Assuming that Q fits in memory and P is indexed by an R-tree, we propose several algorithms for finding the group nearest neighbors efficiently. As a second step, …


An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim Mar 2004

An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The huge amount of information available on the Web has attracted many research efforts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in …


Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan Mar 2004

Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage volumes that are accessible over open network. This potentially exposes the data to heightened security risks. We propose two mechanisms, in the context of a steganographic file system, to mitigate the risk of attacks initiated through analyzing data accesses from user applications. The first mechanism is intended to counter attempts to locate data through updates in between snapshots - in short, update analysis. The second mechanism prevents traffic analysis - identifying …


Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat Mar 2004

Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat

Research Collection School Of Computing and Information Systems

This research examines the use of knowledge-based and explanation facilities to support group decision making of experts versus novices. Consistent with predictions from the persuasion literature, our results show that experts exhibit a higher level of criticality and involvement in their area of expertise; this not only decreases their likelihood of being persuaded by a knowledge-based system, but also accounts for a lower group consensus among experts as compared to novices. Novices are more easily persuaded by the system and find the system to be more useful than experts do. This research integrates theories from the persuasion literature to understand …


Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen Mar 2004

Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen

Research Collection School Of Computing and Information Systems

Elucidation of the interaction of proteins with different molecules is of significance in the understanding of cellular processes. Computational methods have been developed for the prediction of protein-protein interactions. But insufficient attention has been paid to the prediction of protein-RNA interactions, which play central roles in regulating gene expression and certain RNA-mediated enzymatic processes. This work explored the use of a machine learning method, support vector machines (SVM), for the prediction of RNA-binding proteins directly from their primary sequence. Based on the knowledge of known RNA-binding and non-RNA-binding proteins, an SVM system was trained to recognize RNA-binding proteins. A total …


Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng Mar 2004

Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Such schemes have been suggested for use in a number of applications, particularly in distributed computing where delegation of rights is quite common. Followed by the first schemes introduced by Mambo, Usuda and Okamoto in 1996, a number of new schemes and improvements have been proposed. In this paper, we present a security analysis of four such schemes newly proposed. By successfully identifying several interesting forgery attacks, we show that …


Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan Mar 2004

Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not necessarily secure, there must be provisions for validating their outputs. This paper proposes a mechanism that creates a verification object (VO) for checking the integrity of each query result produced by an edge server - that values in the result tuples are not tampered with, and that no spurious tuples are introduced. The primary advantages of our proposed mechanism are that the VO is independent of the database size, and that …


Tool Support For Two-Tiered Architectural Design For Automotive Control Systems, Kevin Steppe, Greg Bylenok, David Garlan, Bradley Schmerl, Kanat Abirov, Nataliya Shevchenko Jan 2004

Tool Support For Two-Tiered Architectural Design For Automotive Control Systems, Kevin Steppe, Greg Bylenok, David Garlan, Bradley Schmerl, Kanat Abirov, Nataliya Shevchenko

Research Collection School Of Computing and Information Systems

An attractive approach to architecture-based design is to structure the development process into two tiers. The top tier represents the abstract design (or architecture) of a system in terms of abstract components. The bottom tier refines that design by making specific implementation decisions, such as platform, middleware, and component implementations. While attractive in principle, there has been relatively little industrial-based experience to shed light on problems and solutions involved in such an approach. In this paper we describe our experience in developing tools to introduce a two-tiered model-based approach to the design of Ford Motor Company’s automotive control systems, highlighting …


Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng Jan 2004

Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

No abstract provided.


Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau Jan 2004

Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau

Research Collection School Of Computing and Information Systems

Group Support Systems (GSSs) have emerged as a new type of information system to aid group decision-making. With the proliferation of such systems in organizations, evaluation of GSSs is becoming increasingly important. This paper reports the evaluation of an existing GSS. Our usability framework consists of nine dimensions: visual clarity, consistency, compatibility, informative feedback, explicitness, flexibility and control, error prevention and correction, ease of learning, and ease of use. We make use of the co-discovery method where teams of two participants perform tasks together while being observed. The study involves questionnaires and interview sessions. The strengths and weaknesses of the …


Paper For An Educational Digital Library, Dion Hoe-Lian Goh, Yin-Leng Theng, Ming Yin, Ee Peng Lim Dec 2003

Paper For An Educational Digital Library, Dion Hoe-Lian Goh, Yin-Leng Theng, Ming Yin, Ee Peng Lim

Research Collection School Of Computing and Information Systems

GeogDL is a digital library of geography examination resources designed to assist students in revising for a national geography examination in Singapore. As part of an iterative design process, we carried out participatory design and brainstorming with student and teacher design partners. The first study involved prospective student design partners. In response to the first study, we describe in this paper an implementation of PAPER – Personalised Adaptive Pathways for Exam Resources – a new bundle of personalized, interactive services containing a mock exam and a personal coach. The mock exam provides a simulation of the actual geography examination while …