A fault is an error that has effects on system behaviour. A software metric is a value that represents the degree to which software processes work properly and where faults are more probable to occur. In this research, we study the effects of removing redundancy and log transformation based on threshold values for identifying faults-prone classes of software. The study also contains a comparison of the metric values of an original dataset with those after removing redundancy and log transformation. E-learning and system dataset were taken as case studies. The fault ratio ranged from 1%-31% and 0%-10% for the original dataset and 1%-10% and 0%-4% after removing redundancy and log transformation, respectively. These results impacted directly the number of classes detected, which ranged between 1-20 and 1-7 for the original dataset and 1-7 and 0-3) after removing redundancy and log transformation. The Skewness of the dataset was deceased after applying the proposed model. The classified faulty classes need more attention in the next versions in order to reduce the ratio of faults or to do refactoring to increase the quality and performance of the current version of the software.
DBN Rashid, Journal of Education College Wasit University 1(1):412-423, 2007
Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show MoreThe definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then Ais called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
A space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
A class of hyperrings known as divisible hyperrings will be studied in this paper. It will be presented as each element in this hyperring is a divisible element. Also shows the relationship between the Jacobsen Radical, and the set of invertible elements and gets some results, and linked these results with the divisible hyperring. After going through the concept of divisible hypermodule that presented 2017, later in 2022, the concept of the divisible hyperring will be related to the concept of division hyperring, where each division hyperring is divisible and the converse is achieved under conditions that will be explained in the theorem 3.14. At the end of this paper, it will be clear that the goal of this paper is to study the concept
... Show MoreDespite ample research on soft linear spaces, there are many other concepts that can be studied. We introduced in this paper several new concepts related to the soft operators, such as the invertible operator. We investigated some properties of this kind of operators and defined the spectrum of soft linear operator along with a number of concepts related with this definition; the concepts of eigenvalue, eigenvector, eigenspace are defined. Finally the spectrum of the soft linear operator was divided into three disjoint parts.
The general objective of surface shape descriptors techniques is to categorize several surface shapes from collection data. Gaussian (K) and Mean (H) curvatures are the most broadly utilized indicators for surface shape characterization in collection image analysis. This paper explains the details of some descriptions (K and H), The discriminating power of 3D descriptors taken away from 3D surfaces (faces) is analyzed and present the experiment results of applying these descriptions on 3D face (with polygon mesh and point cloud representations). The results shows that Gaussian and Mean curvatures are important to discover unique points on the 3d surface (face) and the experiment result shows that these curvatures are very useful for some
... Show More