scholarly journals A Study of Class Structural Complexity in Object Oriented Software, Through a Fuzzy Graph Connectivity Analysis

1999 ◽  
Vol 11 (3) ◽  
pp. 521-527
Author(s):  
Hirohisa AMAN ◽  
Torao YANARU ◽  
Masahiro NAGAMATSU ◽  
Kazunori MIYAMOTO
2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Kagiso Mguni ◽  
Yirsaw Ayalew

Software maintenance is an important activity in software development. Some development methodologies such as the object-oriented have contributed in improving maintainability of software. However, crosscutting concerns are still challenges that affect the maintainability of OO software. In this paper, we discuss our case study to assess the extent of maintainability improvement that can be achieved by employing aspect-oriented programming. Aspect-oriented programming (AOP) is a relatively new approach that emphasizes dealing with crosscutting concerns. To demonstrate the maintainability improvement, we refactored a COTS-based system known as OpenBravoPOS using AspectJ and compared its maintainability with the original OO version. We used both structural complexity and concern level metrics. Our results show an improvement of maintainability in the AOP version of OpenBravoPOS.


2019 ◽  
Vol 19 (3) ◽  
pp. 57-73
Author(s):  
Thamer Al-Rousan ◽  
Hasan Abualese

Abstract Simplification of execution traces is peculiarly important in the case of software comprehension. The objective is to make execution traces in ways that are more tractable and less difficult. However, the simplification process is a difficult task, particularly, in object-oriented contexts. Due to coupling, execution traces of object-oriented systems involve the Spaghetti Architectures phenomenon, which is a very complicated structure of dependencies. Therefore, the simplification process needs a well-established approach to be helpful for software comprehension. Otherwise, the simplified execution traces will be informative as their structures will involve several gaps that lead to a misunderstanding process. This research uses decoupling to guide the simplification of object-oriented execution traces. Specifically, decoupling truthfully can decrease the complexity of execution traces without eliminating the trace components and making numerous gaps in the trace structure. Then, decoupling can solve the problem of the Spaghetti Architectures phenomenon. A controlled experiment was conducted to empirically validate the usefulness and effectivity of the suggested work. There was a significant statistical added value demonstrated in the time required and the accurate solutions of the tasks being solved. More precisely, 25% less time required with a 62% more correct solutions were achieved solving the experiment’s comprehension tasks.


Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 424
Author(s):  
Arya Sebastian ◽  
John N Mordeson ◽  
Sunil Mathew

Graph models are fundamental in network theory. But normalization of weights are necessary to deal with large size networks like internet. Most of the research works available in the literature have been restricted to an algorithmic perspective alone. Not much have been studied theoretically on connectivity of normalized networks. Fuzzy graph theory answers to most of the problems in this area. Although the concept of connectivity in fuzzy graphs has been widely studied, one cannot find proper generalizations of connectivity parameters of unweighted graphs. Generalizations for some of the existing vertex and edge connectivity parameters in graphs are attempted in this article. New parameters are compared with the old ones and generalized values are calculated for some of the major classes like cycles and trees in fuzzy graphs. The existence of super fuzzy graphs with higher connectivity values are established for both old and new parameters. The new edge connectivity values for some wider classes of fuzzy graphs are also obtained. The generalizations bring substantial improvements in fuzzy graph clustering techniques and allow a smooth theoretical alignment. Apart from these, a new class of fuzzy graphs called generalized t-connected fuzzy graphs are studied. An algorithm for clustering the vertices of a fuzzy graph and an application related to human trafficking are also proposed.


2021 ◽  
Vol 16 ◽  
pp. 77-82
Author(s):  
Wael Ahmad Alzoubi ◽  
As’ad Mahmoud As’ad Alnaser

In this paper, we introduced some concepts of connectivity in an intuitionistic fuzzy graphs, also we study intuitionistic fuzzy cut vertices and intuitionistic fuzzy bridges in fuzzy graph. Connectivity in complete intuitionistic fuzzy graphs is also studied


2021 ◽  
pp. 121-151
Author(s):  
John N. Mordeson ◽  
Sunil Mathew ◽  
M. Binu

Sign in / Sign up

Export Citation Format

Share Document