5796465
A hierarchical strategy for testing Web-based applications and ensuring their reliability
After examining the specific problems of testing and quality assurance for Web-based applications, we propose a strategy by integrating existing testing techniques and reliability analyses in a hierarchical framework. This strategy combines various usage models for statistical testing to perform high level testing and to guide selective testing of critical and frequently used subparts or components using traditional coverage-based structural testing. Reliability analysis and risk identification form an integral part of this strategy to help assure and improve the overall reliability for Web-based applications. Some preliminary results are included to demonstrate the general viability and effectiveness of our approach.
37559798
Measurement and continuous improvement of software reliability throughout software life-cycle
Abstract Software reliability is one of the most important aspects of software quality. However, most of the existing techniques focus on the system testing and other late stages of development life-cycle. Therefore, they are not effective for early problem identification and reliability improvement. This paper describes our recent work in establishing predictive linkage between software reliability and other entities that we can measure and control early in the development cycle, and using such predictive relations to drive continuous reliability improvement.
8007887
An application of decision theory for the evaluation of software prototypes
Abstract There is a need to quantify management decision making in software development. To this end, this article presents an application of concepts from economic decision theory to an aspect of this problem currently under study by many in the software engineering community—how to prototype a design and evaluate the effectiveness of this prototype. The role of prototyping as an experimental tool is analyzed and techniques for defining what to prototype and when it is cost effective are introduced. We demonstrate some of these decision theory techniques to define a model that management can use to select solutions from a set of alternative designs.
35577154
Tool support for software measurement, analysis and improvement
This paper presents our strategy, implementation, and experience with tool support for software measurement, analysis, and quality improvement in a commercial software development environment. The activities that need to be supported include: 1) gathering software product and process measurements, 2) analyzing measurement data, and 3) using the results to assess and improve software quality. We employed existing internal tools, commercial off-the-shelf tools, and new tools that we developed to gather and analyze data, and presented results. These tools were tailored to fit the application environments and were integrated through common rules, multiple purpose tools, and utility programs. This approach has been used successfully in supporting software measurement and quality improvement for several large commercial software products developed in the IBM Software Solutions Toronto Laboratory.
33942395
Measuring and Modeling Usage and Reliability for Statistical Web Testing
Statistical testing and reliability analysis can be used effectively to assure quality for Web applications. To support this strategy, we extract Web usage and failure information from existing Web logs. The usage information is used to build models for statistical Web testing. The related failure information is used to measure the reliability of Web applications and the potential effectiveness of statistical Web testing. We applied this approach to analyze some actual Web logs. The results demonstrated the viability and effectiveness of our approach.
16987100
Measuring Prime Program Complexity
Abstract This paper uses the prime program decomposition of a program as the basis for a measure that closely correlates with our intuitive notion of program complexity. This measure is based upon the information theory ideas of randomness and entropy such that results about structured programming, data abstractions, and other programming paradigms can be stated in quantitative terms, and empirical means can be used to validate the assumptions used to develop the model. As a graph-based model, it can be applied to several graphical examples as extensions not otherwise available to source-code based models. This paper introduces the measure, derives several properties for it, and gives some simple examples to demonstrate that the measure is a plausible approximation of our notions concerning structured programming.
16178189
Super-resolution Imaging Using Grid Computing
The super-resolution (SR) imaging is to overcome the inherent limitations of the image acquisition systems to produce high-resolution images from their low-resolution counterparts. In our recent work, the Markov chain Monte Carlo (MCMC) technique has been successfully developed and shown as a promising stochastic approach for addressing the SR problem. However, the MCMC SR approach requires substantial amounts of computational resources, for it not only needs to generate a huge number of samples, but also requires an exhaustive search for obtaining an optimal prior image model. To tackle the above computation challenge, Grid computing is introduced for tackling the SR problem in this paper. The computationally- intensive MCMC SR task is broke down into a set of independent and small sub-tasks, which are further distributed and implemented in the grid computing environment. Their respective results are finally assembled to produce a high-resolution image as the final result of the entire MCMC SR task. Experiments are conducted to show that grid computing can effectively accelerating the execution time of the MCMC SR algorithm.
31406629
Fingerprint Matching with Registration Pattern Inspection
The "registration pattern" between two fingerprints is the optimal registration of each part of one fingerprint with respect to the other fingerprint. Registration patterns generated from imposter's matching attempts are different from those patterns from genuine matching attempts, although they may share some similarities in the aspect of minutiae. In this paper, we present an algorithm that utilizes minutiae, associate ridges and orientation fields to determine the registration pattern between two fingerprints and match them. The proposed matching scheme has two stages. An offline, training stage, derives a genuine registration pattern base from a set of genuine matching attempts. Then, an online matching stage registers the two fingerprints and determines the registration pattern. Only if the pattern makes a genuine one, a further fine matching is conducted. The genuine registration pattern base was derived using a set of fingerprints extracted from the NIST Special Database 24. The algorithm has been tested on the second FVC2002 database. Experimental results demonstrate the performance of the proposed algorithm.
15872261
Identifying Direct Causal Effects in Linear Models
This paper deals with the problem of identifying direct causal effects in recursive linear structural equation models. Using techniques developed for graphical causal models, we show that a model can be decomposed into a set of submodels such that the identification problem can be solved independently in each submodel. We provide a new identification method that identifies causal effects by solving a set of algebraic equations.
10434536
Identifying Linear Causal Effects
This paper concerns the assessment of linear cause-effect relationships from a combination of observational data and qualitative causal structures. The paper shows how techniques developed for identifying causal effects in causal Bayesian networks can be used to identify linear causal effects, and thus provides a new approach for assessing linear causal effects in structural equation models. Using this approach the paper develops a systematic procedure for recognizing identifiable direct causal effects.
3092732
Inequality Constraints in Causal Models with Hidden Variables
We present a class of inequality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network, in which some of the variables remain unmeasured. We derive bounds on causal effects that are not directly measured in randomized experiments. We derive instrumental inequality type of constraints on nonexperimental distributions. The results have applications in testing causal models with observational or experimental data.