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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6241 - 6270 of 6884

Full-Text Articles in Physical Sciences and Mathematics

Crosscutting Score: An Indicator Metric For Aspect Orientation, Subhajit Datta Mar 2006

Crosscutting Score: An Indicator Metric For Aspect Orientation, Subhajit Datta

Research Collection School Of Computing and Information Systems

Aspect Oriented Programming (AOP) provides powerful techniques for modeling and implementing enterprise software systems. To leverage its full potential, AOP needs to be perceived in the context of existing methodologies such as Object Oriented Programming (OOP). This paper addresses an important question for AOP practitioners - how to decide whether a component is best modeled as a class or an aspect? Towards that end, we present an indicator metric, the Crosscutting Score and a method for its calculation and interpretation. We will illustrate our approach through a sample calculation.

Go to article

Agility Measurement Index: A Metric For The Crossroads Of Software Development Methodologies, Subhajit Datta Mar 2006

Agility Measurement Index: A Metric For The Crossroads Of Software Development Methodologies, Subhajit Datta

Research Collection School Of Computing and Information Systems

Software engineering's journey to maturity has been marked by the advent of different development methodologies. While each paradigm has its context and cognoscenti, project teams are often faced with the choice of one approach over another in the grind of delivering software on time and within budget. In this paper, we briefly review the three major techniques of addressing enterprise software development, namely the Waterfall, Unified and Extreme styles. The metric Agility Measurement Index is then proposed, which helps organizations choose the methodology that best suites a particular project.

Go to article

Tacit Knowledge, Nonaka And Takeuchi Seci Model And Informal Knowledge Processes, Siu Loon Hoe Mar 2006

Tacit Knowledge, Nonaka And Takeuchi Seci Model And Informal Knowledge Processes, Siu Loon Hoe

Research Collection School Of Computing and Information Systems

The organizational behavior and knowledge management literature has devoted a lot attention on how structural knowledge processes enhance learning. There has been little emphasis on the informal knowledge processes and the construct remains undefined. The purpose of this paper is to highlight the importance of informal knowledge processes, propose a definition for these processes and link them to the socialization and internalization processes suggested by Nonaka and Takeuchi in the SECI model. The paper offers a fresh perspective on how informal knowledge processes in organizations help to enhance the organization’s learning capability. It will enable scholars and managers to have …

Go to article

Publicly Verifiable Ownership Protection For Relational Databases, Yingjiu Li, Robert H. Deng Mar 2006

Publicly Verifiable Ownership Protection For Relational Databases, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Today, watermarking techniques have been extended from the multimedia context to relational databases so as to protect the ownership of data even after the data are published or distributed. However, all existing watermarking schemes for relational databases are secret key based, thus require a secret key to be presented in proof of ownership. This means that the ownership can only be proven once to the public (e.g., to the court). After that, the secret key is known to the public and the embedded watermark can be easily destroyed by malicious users. Moreover, most of the existing techniques introduce distortions to …

Go to article

Caps: Energy-Efficient Processing Of Continuous Aggregate Queries In Sensor Networks, Wen Hu, Archan Misra, Rajiv Shorey Mar 2006

Caps: Energy-Efficient Processing Of Continuous Aggregate Queries In Sensor Networks, Wen Hu, Archan Misra, Rajiv Shorey

Research Collection School Of Computing and Information Systems

In this paper, we design and evaluate an energy efficient data retrieval architecture for continuous aggregate queries in wireless sensor networks. We show how the modification of precision in one sensor affects the sample-reporting frequency of other sensors, and how the precisions of a group of sensors may be collectively modified to achieve the target quality of information (QoI) with higher energy-efficiency. The proposed collective adaptive precision setting (CAPS) architecture is then extended to exploit the observed temporal correlation among successive sensor samples for even greater energy efficiency. Detailed simulations with synthetic and real data traces demonstrate how the combination …

Go to article

Threading And Autodocumenting News Videos: A Promising Solution To Rapidly Browse News Topics, Xiao Wu, Chong-Wah Ngo, Qing Li Mar 2006

Threading And Autodocumenting News Videos: A Promising Solution To Rapidly Browse News Topics, Xiao Wu, Chong-Wah Ngo, Qing Li

Research Collection School Of Computing and Information Systems

This paper describes the techniques in threading and autodocumenting news stories according to topic themes. Initially, we perform story clustering by exploiting the duality between stories and textual-visual concepts through a co-clustering algorithm. The dependency among stories of a topic is tracked by exploring the textual-visual novelty and redundancy of stories. A novel topic structure that chains the dependencies of stories is then presented to facilitate the fast navigation of the news topic. By pruning the peripheral and redundant news stories in the topic structure, a main thread is extracted for autodocumentary

Go to article

Scalable Authentication Of Mpeg-4 Streams, Yongdong Wu, Robert H. Deng Feb 2006

Scalable Authentication Of Mpeg-4 Streams, Yongdong Wu, Robert H. Deng

Research Collection School Of Computing and Information Systems

This paper presents three scalable and efficient schemes for authenticating MPEG-4 streams: the Flat Authentication Scheme, the Progressive Authentication Scheme, and the Hierarchical Authentication Scheme. All the schemes allow authentication of MPEG-4 streams over lossy networks by integrating seamlessly digital signatures and erasure correction coding with MPEG-4's fine granular scalability. A prominent feature of our schemes is their "sign once, verify many ways" property, i.e., they generate only one digital signature per compressed MPEG-4 object group, but allow clients to verify the authenticity of any down-scaled version of the original signed object group.

Go to article

Energy Efficiency And Capacity For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Shorey, Rajeev Gupta, Archan Misra Feb 2006

Energy Efficiency And Capacity For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Shorey, Rajeev Gupta, Archan Misra

Research Collection School Of Computing and Information Systems

We study the performance metrics associated with TCP-regulated traffic in multi-hop, wireless networks that use a common physical channel (e.g., IEEE 802.11). In contrast to earlier analyses, we focus simultaneously on two key operating metrics—the energy efficiency and the transport-layer (TCP) throughput. Using analysis and simulations, we show how these metrics are strongly influenced by the radio transmission range of individual nodes. Due to tradeoffs between the individual packet transmission energy and the likelihood of retransmissions, the total energy consumption is a convex function of the number of hops (and hence, of the transmission range). On the other hand, the …

Go to article

Design Synthesis From Interaction And State-Based Specifications, Jun Sun, Jin Song Dong Jan 2006

Design Synthesis From Interaction And State-Based Specifications, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Interaction-based and state-based modeling are two complementary approaches of behavior modeling. The former focuses on global interactions between system components. The latter concentrates on the internal states of individual components. Both approaches have been proven useful in practice. One challenging and important research objective is to combine the modeling power of both effectively and then use the combination as the basis for automatic design synthesis. We present a combination of interaction-based and state-based modeling, namely, Live Sequence Charts and Z, for system specification. We then propose a way of generating distributed design from the combinations. Our approach handles systems with …

Go to article

The Impact Of Financial Market And Resale Market On Firm Strategies, Zhiling Guo, Andrew B. Whinston Jan 2006

The Impact Of Financial Market And Resale Market On Firm Strategies, Zhiling Guo, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

The ever-increasing use of information technology (IT) in business transactions greatly expands firms? exposure to different electronic markets. This paper provides a framework to understand how firms can leverage different strategies across external financial markets and an internal resale market to improve overall profitability. We develop a model in which a group of risk-averse retailers sell a homogeneous product to their respective uncertain consumer markets. We study a scenario where an internal resale market can be constructed among the retailers and outside financial markets can be used to improve their ability to manage uncertainty. We identify strategies for retailers operating …

Go to article

Grid-Partition Index: A Hybrid Approach To Nearest-Neighbor Queries In Wireless Location-Based Services, Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee Jan 2006

Grid-Partition Index: A Hybrid Approach To Nearest-Neighbor Queries In Wireless Location-Based Services, Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee

Research Collection School Of Computing and Information Systems

Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both ondemand access and periodic broadcast …

Go to article

Towards Better Quality Specification Miners, David Lo, Siau-Cheng Khoo Jan 2006

Towards Better Quality Specification Miners, David Lo, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Softwares are often built without specification. Tools to automatically extract specification from software are needed and many techniques have been proposed. One type of these specifications – temporal API specification – is often specified in the form of automaton (i.e., FSA/PFSA). There have been many work on mining software temporal specification using dynamic analysis techniques; i.e., analysis of software program traces. Unfortunately, the issues of scalability, robustness and accuracy of these techniques have not been comprehensively addressed. In this paper, we describe a framework that enables assessments of the performance of a specification miner in generating temporal specification of software …

Go to article

The Roles Of Digital Libraries In Teaching And Learning Geography, Chew-Hung Chang, John Hedberg, Tiong-Sa Teh, Ee Peng Lim Jan 2006

The Roles Of Digital Libraries In Teaching And Learning Geography, Chew-Hung Chang, John Hedberg, Tiong-Sa Teh, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Adopting a problem-centred approach helps students to learn Geography more effectively as they are able to identify and generalize about where different resources or activities are spatially located and they learn to associate certain patterns and processes with geographical changes. In an era where web-based student-centred inquiry is gaining popularity as a mode of learning Geography, the role of digital libraries as delivery trucks (in Clark’s terminology, 1983) needs to be better understood. An obvious affordance of the digital library is that it organizes information around themes for problems to be solved. This paper describes a developmental project to build …

Go to article

In-Network Join Processing For Sensor Networks, Hai Yu, Ee Peng Lim, Jun Zhang Jan 2006

In-Network Join Processing For Sensor Networks, Hai Yu, Ee Peng Lim, Jun Zhang

Research Collection School Of Computing and Information Systems

Recent advances in hardware and wireless technologies have led to sensor networks consisting of large number of sensors capable of gathering and processing data collectively. Query processing on these sensor networks has to consider various inherent constraints. While simple queries such as select and aggregate queries in wireless sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. In this paper, we present a synopsis join strategy for evaluating join queries in sensor networks with communication efficiency. In this strategy, instead of directly joining two relations distributed in a sensor …

Go to article

Visualization For Analyzing Trajectory-Based Metaheuristic Search Algorithms, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau Jan 2006

Visualization For Analyzing Trajectory-Based Metaheuristic Search Algorithms, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Efficient Mining Of Group Patterns From User Movement Data, Yida Wang, Ee Peng Lim, San-Yih Hwang Jan 2006

Efficient Mining Of Group Patterns From User Movement Data, Yida Wang, Ee Peng Lim, San-Yih Hwang

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location data emitted from mobile devices tracking users. We formally define group pattern as a group of users that are within a distance threshold from one another for at least a minimum duration. To mine group patterns, we first propose two algorithms, namely AGP and VG-growth. In our first set of experiments, it is shown when both the number of users and logging duration are large, AGP and VG-growth are …

Go to article

Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham Jan 2006

Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Today within the multiagent community, we see at least four competing methods to building multiagent systems: beliefdesireintention (BDI), distributed constraint optimization (DCOP), distributed POMDPs, and auctions or game-theoretic methods. While there is exciting progress within each approach, there is a lack of cross-cutting research. This article highlights the various hybrid techniques for multiagent teamwork developed by the teamcore group. In particular, for the past decade, the TEAMCORE research group has focused on building agent teams in complex, dynamic domains. While our early work was inspired by BDI, we will present an overview of recent research that uses DCOPs and distributed …

Go to article

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa Dec 2005

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa

Research Collection School Of Computing and Information Systems

Website archival refers to the task of monitoring and storing snapshots of website(s) for future retrieval and analysis. This task is particularly important for websites that have content changing over time with older information constantly overwritten by newer one. In this paper, we propose WEBARC as a set of software tools to allow users to construct a logical structure for a website to be archived. Classifiers are trained to. determine relevant web pages and their categories, and subsequently used in website downloading. The archival schedule can be specified and executed by a scheduler. A website viewer is also developed to …

Go to article

A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong Dec 2005

A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment and new data are available quickly. To address these three problems, we assume that the major functions of a kind of cells do not change too much in different experiments, and propose a …

Go to article

Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong Dec 2005

Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

It is a frequently encountered problem that new knowledge arrived when making decisions in a dynamic world. Usually, domain experts cannot afford enough time and knowledge to effectively assess and combine both qualitative and quantitative information in these models. Existing approaches can solve only one of two tasks instead of both. We propose a four-step algorithm to integrate multiple probabilistic graphic models, which can effectively update existing models with newly acquired models. In this algorithm, the qualitative part of model integration is performed first, followed by the quantitative combination. We illustrate our method with an example of combining three models. …

Go to article

New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao Dec 2005

New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be …

Go to article

Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang Dec 2005

Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang

Research Collection School Of Computing and Information Systems

It is accepted that digital watermarking is quite relevant in medical imaging. However, due to the special nature of clinical practice, it is often required that watermarking not introduce irreversible distortions to medical images. The electronic clinical atlas has such a need of "lossless" watermarking. We present two tailored reversible watermarking schemes for the clinical atlas by exploiting its inherent characteristics. We have implemented the schemes and our experimental results look very promising.

Go to article

Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra Dec 2005

Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra

Research Collection School Of Computing and Information Systems

Building a distributed middleware infrastructure that provides the low latency required for massively multiplayer games while still maintaining consistency is non-trivial. Previous attempts have used static partitioning or client-based peer-to-peer techniques that do not scale well to a large number of players, perform poorly under dynamic workloads or hotspots, and impose significant programming burdens on game developers. We show that it is possible to build a scalable distributed system, called Matrix, that is easily usable by game developers. We show experimentally that Matrix provides good performance, especially when hotspots occur.

Go to article

Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan Dec 2005

Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan

Research Collection School Of Computing and Information Systems

Addressing resource variation plays an increasingly important role in engineering today's software systems. Research in resource-adaptive applications takes an important step towards addressing this problem. However, existing solutions stop short of addressing the fact that different user tasks often have specific goals of quality of service, and that such goals often entail multiple aspects of quality of service. This paper presents a framework for engineering software systems capable of adapting to resource variations in ways that are specific to the quality goals of each user task. For that, users are empowered to specify their task-specific preferences with respect to multiple …

Go to article

A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao Dec 2005

A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao

Research Collection School Of Computing and Information Systems

The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed …

Go to article

Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng Dec 2005

Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

A forward secure blind signature scheme was proposed by Duc, Cheon and Kim, in ICICS 2003. The security of the scheme was proved to be equivalent to the strong RSA assumption in the random oracle model. In this paper we present an attack to the scheme by forging valid signatures with public keys only. The attack is so efficient that forging a valid signature needs less computation than legally generating a signature, even considering only the user side. Our result implies that the security proof of the scheme must be invalid. Furthermore we point out the fault of the proof …

Go to article

An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra Dec 2005

An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. 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 fluid-flow 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. To compute the expected information capacity under this distribution-based …

Go to article

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan Dec 2005

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …

Go to article

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou Dec 2005

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou

Research Collection School Of Computing and Information Systems

We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.

Go to article

Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng Dec 2005

Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where …

Go to article

First Prev Next Last