10778870
An empirical performance study for validating a performance analysis approach: PSIM
Performance analysis gains more attention in recent years by researchers who focus their study on the early software development stages to mitigate the risk of redesign as problems emerge later. Previously we proposed PSIM (a performance simulation and modeling tool) that integrated performance properties into software architecture specifications expressed in several major UML diagrams. PSIM models can be transformed into colored GSPN and the colored GSPN models can then be simulated to perform model-based performance evaluation. In this paper we briefly review the PSIM approach and apply it to model a Web-based conferencing system, called M-Net, to derive performance metrics. We then conduct runtime performance testing to the implementation of M-Net and compare the simulation data to runtime testing data. The comparison results show the effectiveness of the PSIM method in predicting system performance and identifying system performance bottlenecks.
17140893
An Aspect-Oriented Approach to Resource Composition in Petri net-based Software Architectural Models
Petri net has been widely used for modeling software systems due to its mathematical soundness and support of various tools. In many cases, performance-related analyses of Petri net for a software system need to consider the resource limitations caused by a specific platform. In terms of aspect-oriented approach, the interference of various resources scattered across a software system can be regarded as a specific concern that is only necessary during its performance-related analysis process. To capture the interactions of resources within the Petri net-based software architectural model, we propose an aspect-oriented resource composition model and the XML-based representation language called the resource extension markup language (ReML) for its description. In our approach, one or more resource composition models can be developed and described in ReML separately from the development of base software architectural models. Through the weaving process, a resource composition model can be applied to extend several Petri net-based software architectural models. The resource weaver generates an augmented Petri net used for analyzing performance characteristics of the extended software architectural model with resource interactions. Our aspect-oriented approach facilitates selecting an optimal or superior resource composition model for a software architectural model, and vice versa, which is illustrated using two exemplary server models
1871945
Specifications in software prototyping
Abstract We explore the use of software specifications for software prototyping. This paper describes a process model for software prototyping, and shows how specifications can be used to support such a process via a cellular mobile phone switch example.
215862843
Genetic Algorithms for Project Management
The scheduling of tasks and the allocation of resource in medium to large-scale development projects is an extremely hard problem and is one of the principal challenges of project management due to...
15614662
Towards increasing web application productivity
In this paper we present and discuss a template/meta-data based partial code generation system supporting web application development. Seamlessly incorporating the recent top-notch technologies, the framework maximally exploits the capabilities of the underlying implementation technologies. Our approach primarily benefits the framework and code developers. In addition, the complete separation of data model, navigation model, and presentation model reflects on a more general conceptual process that would decouple the technique and methodology from its underlying technology choices. The decoupling between the generated code and the code that is necessarily added later on through other development pathways than the generator deals with the incremental changes and adaptations of the models in the face of an operational system, therefore further enhances the extensibility, maintainability, and reusability of the generated applications.
8941164
Supporting agent-based distributed software development through modeling and simulation
In today's software engineering environment, it is becoming increasingly commonplace for team members and stakeholders to be distributed in multiple locations and time zones. Under these circumstances, the coordination of software development activities becomes increasingly more complex. One solution uses mobile agent-based tools to support collaborative software engineering tasks, such as requirements management. Despite the fact that development and validation of such tools would be facilitated by the use of modeling and simulation, very little work relating formal methods to agent-based system development has been performed. This paper therefore presents a hierarchical colored Petri Net (CPN) model as a formal framework for agent-based distributed software development, and demonstrates its usefulness by applying the framework to the development of a requirements management system.
21116848
Optimal 1-edge fault-tolerant designs for ladders
A graph G* is 1-edge fault-tolerant with respect to a graph G, denoted by 1-EFT(G), if every graph obtained by removing any edge from G* contains G. A 1-EFT(G) graph is optimal if it contains the minimum number of edges among all 1-EFT(G) graphs. The kth ladder graph, Lk, is defined to be the cartesian product of the Pk and P2 where Pn is the n-vertex path graph. In this paper, we present several 1-edge fault-tolerant graphs with respect to ladders. Some of these graphs are proven to be optimal.
8773045
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in the design of superior and flexible data stream query processing techniques. We identify two different causes of reference locality: popularity over long time scales and temporal correlations over shorter time scales. An elegant mathematical model is shown to precisely quantify the degree of those sources of locality. Furthermore, we analyze the impact of locality-awareness on achievable performance gains over traditional algorithms on applications such asMAX-subset approximate sliding window join and approximate count estimation. In a comprehensive experimental study, we compare several existing algorithms against our locality-aware algorithms over a number of real datasets. The results validate the usefulness and efficiency of our approach.
9167410
Computing curricula 2001 how will it work for you?
In the fall of 1998, the ACM Education Board and the Educational Activities Board of the IEEE Computer Society appointed representatives to a joint task force to prepare Computing Curricula 2001 (CC2001), the next installment in a series of reports on the undergraduate computer science curriculum that began in 1968 and was then updated in 1978 and 1991. Interim reports on the initial planning of the curriculum were presented at the SIGCSE symposium and the IEEE Frontiers in Education Conference in both 1999 and 2000. The CC2001 Task Force released its first draft report at the 2000 SIGCSE conference and plans to release its penultimate draft at SIGCSE 2001. The purpose of this session is to describe how we expect the recommendations of the report to apply in practice. The panelists represent a range of institutions and can therefore speak to the questions that audience members from similar institutions might have.
14995712
Applying Pattern Mining to Web Information Extraction
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to solve this problem by applying machine learning to automatically generate extractors. For example, WIEN, Stalker, Softmealy, etc. However, this approach still requires human intervention to provide training examples. In this paper, we propose a novel idea to IE, by repeated pattern mining and multiple pattern alignment. The discovery of repeated patterns are realized through a data structure call PAT tree. In addition, incomplete patterns are further revised by pattern alignment to comprehend all pattern instances. This new track to IE involves no human effort and content-dependent heuristics. Experimental results show that the constructed extraction rules can achieves 97 percent extraction over fourteen popular search engines.
17968637
Robust localization of multiple events in sensor networks
Localization of events is a canonical problem for sensor networks, especially for applications such as intrusion detection or neighborhood monitoring. We employ a general sensor model which models various types of sensor nodes. However, traditional triangulation method will be unsolvable when the sensor nodes are positioned on a line. To overcome such ill-conditioned cases, we can use MAP or MMSE methods to estimate event locations. Moreover, to locate multiple simultaneous events and overcome the ill-conditioned case when the sensor nodes are collinear, we need to solve a system of nonlinear equations. We propose a novel method which solves this system of nonlinear equations and multiple-event locations can be found. Experiments and error analysis of the method demonstrate the performance of our methods