18396642
Defect handling in medium and large open source projects
Open source projects have resulted in numerous high-quality, widely used products. Understanding the defect-handling strategies such projects employ can help us use the publicly accessible defect data from these projects to provide valuable quality-improvement feedback and to better understand the defect characteristics for a wider variety of software products. We conducted a survey to understand defect handling in selected open source projects and compared the particular approaches taken in different projects. We focused on defect handling instead of the broader quality assurance activities other researchers have previously reported. Our results provided quantitative evidence about the current practice of defect handling in an important subset of open source projects.
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.
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.
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.
10468208
Measurement and defect modeling for a legacy software system
This paper analyzes the quality of a large-scale legacy software system using selected metrics. Quality measurements include defect information collected during product development and in-field operation. Other software metrics include measurements on various product and process attributes, including design, size, change, and complexity. Preliminary analyses revealed the high degree of skew in our data and a weak correlation between defects and software metrics. Tree-based models were then used to uncover relationships between defects and software metrics, and to identify high-defect modules together with their associated measurement characteristics. As results presented in tree forms are natural to the decision process and are easy to understand, tree-based modeling is shown to be suitable for change solicitation and useful in guiding remedial actions for quality improvement.
14909770
Early measurement and improvement of software quality
The paper combines relevant research in software reliability engineering and software measurement to develop an integrated approach for the early measurement and improvement of software quality. Recent research in these areas is extended 1) to select appropriate software measures based on. A formal model, 2) to construct tree-based reliability models for early problem identification and quality improvement, and 3) to develop tools to support industrial applications. Initial results applying this approach to several IBM products demonstrated the applicability and effectiveness of this approach.
4621823
On the Testable Implications of Causal Models with Hidden Variables
The validity of a causal model can be tested only if the model imposes constraints on the probability distribution that governs the generated data. In the presence of unmeasured variables, causal models may impose two types of constraints: conditional independencies, as read through the d-separation criterion, and functional constraints, for which no general criterion is available. This paper offers a systematic way of identifying functional constraints and, thus, facilitates the task of testing causal models as well as inferring such models from data.
12486810
A new class of biorthogonal wavelet systems for image transform coding
We construct general biorthogonal Coifman wavelet systems, a new class of compactly supported biorthogonal wavelet systems with vanishing moments equally distributed for a scaling function and wavelet pair. A time-domain design method is employed and closed-form expressions for the impulse responses and the frequency responses of the corresponding dual filters are derived. The resulting filter coefficients are all dyadic fractions, which is an attractive feature in the realization of multiplication-free discrete wavelet transform. Even-ordered systems in this family are symmetric, which correspond to linear-phase dual filters. In particular, three filterbanks (FBs) in this family are systematically verified to have competitive compression potential to the 9-7 tap biorthogonal wavelet FB by Cohen et al., which is currently the most widely used one in the field of wavelet transform coding. In addition, the proposed FB's have much smaller computational complexity in terms of floating-point operations required in transformation, and therefore indicate a better tradeoff between compression performance and computational complexity.
14734990
Reversible data-embedding with a hierarchical structure
Reversible data-embedding embeds data into a digital content (such as digital image, audio or video) such that an authorized party could decode the embedded data and completely restore the original content. In this paper, we present a hierarchically structured, multi-layer algorithm for digital images. Its basic component is an invertible sharpen filter called the difference expansion. The embedding capacity of this algorithm is substantially higher than results reported in previous reversible data-embedding algorithms. The visual quality of images after data-embedding is also among the best in the literature.
34795143
Automatic Fingerprint Identification Using Cluster Algorithm
46662719
A minutiae matching algorithm in fingerprint verification
Fingerprint matching is one of the most important problems in AFIS. In general, we use minutiae such as ridge endings and ridge bifurcation to represent a fingerprint and do fingerprint matching through minutiae matching. We propose a minutiae matching algorithm which modified Jain et al.'s algorithm (1997). Our algorithm can better distinguish two images from different fingers and is more robust to nonlinear deformation. Experiments done on a set of fingerprint images captured with an inkless scanner shows that our algorithm is fast and has high accuracy.