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

Software Engineering Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 2101 - 2130 of 2211

Full-Text Articles in Software Engineering

Cognitive Evaluation Of Information Modeling Methods, Keng Siau, Yuan Wang May 2007

Cognitive Evaluation Of Information Modeling Methods, Keng Siau, Yuan Wang

Research Collection School Of Computing and Information Systems

In the field of information system engineering, information modeling method is a technique to capture user requirements and to understand system complexity. The importance of information modeling has been recognized by practitioners and researchers, but little has been explored to analyze the available information modeling methods or to evaluate them in terms of their strengths, weaknesses, and effectiveness. This research analyzes six information-modeling methods: use case diagram, rich picture diagram, entity-relationship diagram, Trochim’s concept mapping, repertory grid, and causal mapping. These information-modeling methods are analyzed from a cognitive perspective in order to better understand their nature, the assumptions, and the …


Deckard: Scalable And Accurate Tree-Based Detection Of Code Clones, Lingxiao Jiang, Ghassan Misherghi, Zhendong Su, Stephane Glondu May 2007

Deckard: Scalable And Accurate Tree-Based Detection Of Code Clones, Lingxiao Jiang, Ghassan Misherghi, Zhendong Su, Stephane Glondu

Research Collection School Of Computing and Information Systems

Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. In this paper, we present an efficient algorithm for identifying similar subtrees and apply it to tree representations of source code. Our algorithm is based on a novel characterization of subtrees with numerical vectors in the Euclidean Rn and an efficient algorithm to cluster these vectors w.r.t. the Euclidean distance metric. Subtrees with vectors in one cluster are considered similar. We have implemented our tree similarity algorithm as a clone detection tool called DECKARD …


Experiences With Tracking The Effects Of Changing Requirements On Morphbank: A Web-Based Bioinformatics Application, Subhajit Datta, Robert Van Engelen, David Gaitros, Neelima Jammigumpula Mar 2007

Experiences With Tracking The Effects Of Changing Requirements On Morphbank: A Web-Based Bioinformatics Application, Subhajit Datta, Robert Van Engelen, David Gaitros, Neelima Jammigumpula

Research Collection School Of Computing and Information Systems

In this paper, we present a case study of applying the metrics Mutation Index, Component Set, Dependency Index on Morphbank- a web based bioinformatics application - to track the effects of changing requirements on a software system and suggest design modifications to mitigate such impact. Morphbank is "an open web repository of biological images documenting specimen-based research in comparative anatomy, morphological phylogenetics, taxonomy and related fields focused on increasing our knowledge about biodiversity". This paper discusses the context of the case study, analyzes the results, highlights observations and learning, and mentions directions of future work.


Businessfinder: Harnessing Presence To Enable Live Yellow Pages For Small, Medium And Micro Mobile Businesses, D. Chakraborty, K. Dasgupta, S. Mittal, Archan Misra, C. Oberle, A. Gupta, E. Newmark Jan 2007

Businessfinder: Harnessing Presence To Enable Live Yellow Pages For Small, Medium And Micro Mobile Businesses, D. Chakraborty, K. Dasgupta, S. Mittal, Archan Misra, C. Oberle, A. Gupta, E. Newmark

Research Collection School Of Computing and Information Systems

Applications leveraging network presence in next-generation cellular networks have so far focused on subscription queries, where "presence" information is extracted from specific devices and sent to entities who have subscribed to such presence information. In this article we present BusinessFinder, a service that leverages the underlying cellular presence substrate to provide efficient, on-demand, context-aware matching of customer requests to nomadic micro businesses as well as small and medium businesses having a mobile workforce. Presence, in the context of BusinessFinder, is not simply limited to phone location and device status, but also encompasses dynamic attributes of vendors (both "mobile" and "static"), …


Identifying Difficulties In Learning Uml, Keng Siau, Poi-Peng Loo Dec 2006

Identifying Difficulties In Learning Uml, Keng Siau, Poi-Peng Loo

Research Collection School Of Computing and Information Systems

Despite its recognition as a standard object-oriented modeling language, Unified Modeling Language (UML) has been criticized for such deficiencies as semantic inconsistencies, vagueness, and conflicting notations. the relationship between these deficiencies and the difficulties in the learning process is the focus of this study. A concept mapping technique is used to unveil the learning difficulties and suggestions for alleviating them are provided.


Dcma: A Label-Switching Mac For Efficient Packet Forwarding In Multi-Hop Wireless Networks, Arup Acharya, Sachin Ganu, Archan Misra Nov 2006

Dcma: A Label-Switching Mac For Efficient Packet Forwarding In Multi-Hop Wireless Networks, Arup Acharya, Sachin Ganu, Archan Misra

Research Collection School Of Computing and Information Systems

This paper addresses the problem of efficient packet forwarding in a multihop, wireless "mesh" network. We present an efficient interface contained forwarding (ICF) architecture for a "wireless router," i.e., a forwarding node with a single wireless network interface card (NIC) in a multihop wireless network that allows a packet to be forwarded entirely within the NIC of the forwarding node without requiring per-packet intervention by the node's CPU. To effectively forward packets in a pipelined fashion without incurring the 802.11-related overheads of multiple independent channel accesses, we specify a slightly modified version of the 802.11 MAC, called data driven cut-through …


Low-Latency Broadcast In Multirate Wireless Mesh Networks, Chun Tung Chou, Archan Misra, Junaid Qadir Nov 2006

Low-Latency Broadcast In Multirate Wireless Mesh Networks, Chun Tung Chou, Archan Misra, Junaid Qadir

Research Collection School Of Computing and Information Systems

In a multirate wireless network, a node can dynamically adjust its link transmission rate by switching between different modulation schemes. In the current IEEE802.11a/b/g standards, this rate adjustment is defined for unicast traffic only. In this paper, we consider a wireless mesh network (WMN), where a node can dynamically adjust its link-layer multicast rates to its neighbors, and address the problem of realizing low-latency network-wide broadcast in such a mesh. We first show that the multirate broadcast problem is significantly different from the single-rate case. We will then present an algorithm for achieving low-latency broadcast in a multirate mesh which …


Smartic: Towards Building An Accurate, Robust And Scalable Specification Miner, David Lo, Siau-Cheng Khoo Nov 2006

Smartic: Towards Building An Accurate, Robust And Scalable Specification Miner, David Lo, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Improper management of software evolution, compounded by imprecise, and changing requirements, along with the “short time to market ” requirement, commonly leads to a lack of up-to-date specifications. This can result in software that is characterized by bugs, anomalies and even security threats. Software specification mining is a new technique to address this concern by inferring specifications automatically. In this paper, we propose a novel API specification mining architecture called SMArTIC (Specification Mining Architecture with Trace fIltering and Clustering) to improve the accuracy, robustness and scalability of specification miners. This architecture is constructed based on two hypotheses: (1) Erroneous traces …


Design And Analysis Of A Class-Aware Recursive Loop Scheduler For Class-Based Scheduling, Raphael Rom, Moshe Sidi, Hwee-Pink Tan Oct 2006

Design And Analysis Of A Class-Aware Recursive Loop Scheduler For Class-Based Scheduling, Raphael Rom, Moshe Sidi, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the existing notion of smoothness based on balancedness, we propose a variance-based metric which is more intuitive and easier to compute.

We propose a recursive loop scheduler for a class-based scheduling scenario based on an optimal weighted round-robin scheduler. We show that it achieves very good allocation smoothness with almost no degradation in intra-class fairness. In addition, we also demonstrate the equivalence between our proposed metric and the balancedness-based metric.


Minimum Latency Broadcasting In Multi-Radio Multi-Channel Multi-Rate Wireless Meshes, Junaid Qadir, Archan Misra, Chun Tung Chou Sep 2006

Minimum Latency Broadcasting In Multi-Radio Multi-Channel Multi-Rate Wireless Meshes, Junaid Qadir, Archan Misra, Chun Tung Chou

Research Collection School Of Computing and Information Systems

We address the problem of minimizing the worst-case broadcast delay in multi-radio multi-channel multi-rate (MR2-MC) wireless mesh networks (WMN). The problem of 'efficient' broadcast in such networks is especially challenging due to the numerous interrelated decisions that have to be made. The multi-rate transmission capability of WMN nodes, interference between wireless transmissions, and the hardness of optimal channel assignment adds complexity to our considered problem. We present four heuristic algorithms to solve the minimum latency broadcast problem for such settings and show that the 'best' performing algorithms usually adapt themselves to the available radio interfaces and channels. We also study …


Social Network Dynamics For Open Source Software Projects, Y. Long, Keng Siau Aug 2006

Social Network Dynamics For Open Source Software Projects, Y. Long, Keng Siau

Research Collection School Of Computing and Information Systems

Drawing on social network theories and previous studies, this research is an initial effort to explore the dynamics of the social network structure in Open Source Software (OSS) teams. Three projects were selected from SourceForge.net in term of their similarities as well as their differences. Monthly data were extracted from the bug tracking system in order to achieve a longitudinal view of the interaction pattern of each project. Social network analysis was used to generate the indices of network structure. The finding suggests that the interaction pattern of OSS projects evolves from a single hub at the beginning to a …


Generalized On-Demand Service Architecture For Interactive Applications [Us 2006/0168107 A1], Rajesh K. Balan, Paul C. Castro, Maria R. Ebling, Archan Misra Jul 2006

Generalized On-Demand Service Architecture For Interactive Applications [Us 2006/0168107 A1], Rajesh K. Balan, Paul C. Castro, Maria R. Ebling, Archan Misra

Research Collection School Of Computing and Information Systems

A method, system, and computer program for executing a network-based distributed application. An infrastructure is described that includes application containers configured to execute an application instance of the distributed application and measure quality of service metrics for the application instance. Workload management elements form a decentralized workload management layer. The workload management layer is configured to assign a workload to application containers based on the quality of service metrics received by the application containers.


Osprey: A Practical Type System For Validating Dimensional Unit Correctness Of C Programs, Lingxiao Jiang, Zhendong Su May 2006

Osprey: A Practical Type System For Validating Dimensional Unit Correctness Of C Programs, Lingxiao Jiang, Zhendong Su

Research Collection School Of Computing and Information Systems

Misuse of measurement units is a common source of errors in scientific applications, but standard type systems do not prevent such errors. Dimensional analysis in physics can be used to manually detect such errors in physical equations. It is, however, not feasible to perform such manual analysis for programs computing physical equations because of code complexity. In this paper, we present a type system to automatically detect potential errors involving measurement units. It is constraint-based: we model units as types and flow of units as constraints. However, standard type checking algorithms are not powerful enough to handle units because of …


Efficient Querying And Resource Management Using Distributed Presence Information In Converged Networks, Dipanjan Chakraborty, Koustuv Dasgupta, Archan Misra May 2006

Efficient Querying And Resource Management Using Distributed Presence Information In Converged Networks, Dipanjan Chakraborty, Koustuv Dasgupta, Archan Misra

Research Collection School Of Computing and Information Systems

Next-generation converged networks shall deliver many innovative services over the standardized SIPbased IMS signaling infrastructure. Several such services exploit the joint presence information of a consumer, i.e. SIP entity requesting a service, and a vendor, i.e. SIP resource providing a service. Presence information is a collection of contextual attributes (e.g. location, availability, reputation), some of which change dynamically. Moreover, this collective presence information is distributed across multiple presence servers. While performing query matching based on joint presence information, a server usually routes each query to a locally available resource. However, skews in the spatio-temporal distribution of queries and resources may …


Effect Of Changing Requirements: A Tracking Mechanism For The Analysis Workflow, Subhajit Datta, Robert Van Engelen Apr 2006

Effect Of Changing Requirements: A Tracking Mechanism For The Analysis Workflow, Subhajit Datta, Robert Van Engelen

Research Collection School Of Computing and Information Systems

Managing the effects of changing requirements remains one of the greatest challenges of enterprise software development. The iterative and incremental model provides an expedient framework for addressing such concerns. This paper presents a set of metrics - Mutation Index, Component Set, Dependency Index - and a methodology to measure the effects of requirement changes in the analysis workflow from one iteration to another. Results from a sample case study are included to highlight a usage scenario. Future directions of our work based on this mechanism are also discussed.


Efficient Client-To-Server Assignments For Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou Apr 2006

Efficient Client-To-Server Assignments For Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou

Research Collection School Of Computing and Information Systems

Distributed Virtual Environments (DVEs) are distributed systems that allow multiple geographically distributed clients (users) to interact simultaneously in a computer-generated, shared virtual world. Applications of DVEs can be seen in many areas nowadays, such as online games, military simulations, collaborative designs, etc. To support large-scale DVEs with real-time interactions among thousands or more distributed clients, a geographically distributed server architecture (GDSA) is generally needed, and the virtual world can be partitioned into many distinct zones to distribute the load among the servers. Due to the geographic distributions of clients and servers in such architectures, it is essential to efficiently assign …


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.


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.


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 …


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 …


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 …


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 …


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.


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 …


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 …


Informal Animation Sketching With K-Sketch, Richard C. Davis Oct 2005

Informal Animation Sketching With K-Sketch, Richard C. Davis

Research Collection School Of Computing and Information Systems

Animation is a powerful medium that is accessible to few, because current animation tools are extremely complex. This complexity arises partially from current tools’ focus on precise, often unnecessary details and partially from the difficulty of finding a small but sufficiently powerful set of tool features. We are designing K-Sketch, an informal 2D animation tool that uses sketching and demonstration to radically reduce the time needed to create an animation. Our field studies investigating the needs of current anima-tion tool users and would-be users are helping us to mini-mize complexity by showing us how to prioritize the many possible tool …


And/Or Graph And Search Algorithm For Discovering Composite Web Services, Qianhui (Althea) Liang, Stanley Y. W. Su Oct 2005

And/Or Graph And Search Algorithm For Discovering Composite Web Services, Qianhui (Althea) Liang, Stanley Y. W. Su

Research Collection School Of Computing and Information Systems

This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that can only be satisfied by a composition of Web Services, we identify the service categories that are relevant to the request and dynamically construct an AND/OR graph to capture the input/output dependencies among the Web Services of these service categories. The graph is modified, based on the information provided in the service request. The search algorithm is then …


Low Latency Multimedia Broadcast In Multi-Rate Wireless Meshes, Chun-Tong Chou, Archan Misra Sep 2005

Low Latency Multimedia Broadcast In Multi-Rate Wireless Meshes, Chun-Tong Chou, Archan Misra

Research Collection School Of Computing and Information Systems

In a multi-rate wireless network, a node can dynamically adjust its link transmission rate by switching between different modulation schemes. For the current IEEE802.11a/b/g standards, this rate adjustment is limited to unicast traffic only while multicast and broadcast traffic is always transmitted at the lowest possible rate. In this paper, we consider a novel type of multi-rate mesh networks where a node can dynamically adjust its link layer multicast rates to its neighbours. In particular, we consider the problem of realising low latency network-wide broadcast in this type of multi-rate wireless meshes. We will first show that the multi-rate broadcast …


Forms Of Expression For Designing Visual Languages For Animation, Richard C. Davis, James A. Landay Sep 2005

Forms Of Expression For Designing Visual Languages For Animation, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

We present further steps in our research into visual languages for animation. Animation is a rich mode of communication that is currently accessible to few, because animation systems are complex. Some systems try to make animation simple but put severe limits on users’ creative expression. Our field studies are demonstrating that would-be animators need to express animation in a wide variety of ways. We are developing a taxonomy of forms of expression for animation that will help the designers of visual languages for animation to determine which expressive forms to support. Our end goal is to build animation sketching systems …


Personalization Of Web Services: A Study On The Fit Between Web Tasks And Personalization Mechanisms, Fiona Fui-Hoon Nah, Keng Siau, Min Ling Aug 2005

Personalization Of Web Services: A Study On The Fit Between Web Tasks And Personalization Mechanisms, Fiona Fui-Hoon Nah, Keng Siau, Min Ling

Research Collection School Of Computing and Information Systems

Personalization is increasingly being considered an important ingredient of Web applications. In most cases, personalization techniques and mechanisms are used for tailoring information services to user needs. It is motivated by the recognition that a user has needs, and meeting them successfully is likely to lead to a satisfying relationship and re-use of the Web services offered. However, if the personalization mechanisms do not match the needs depicted by the tasks, it will decrease user satisfaction and performance. In this research, we use the cognitive fit theory to examine the fit between personalization mechanisms and Web tasks.