Complexity and Nesting Evolution in Open Source Software Systems: Experimental Study

Background: Software complexity affects its quality; a complex software is not only difficult to read, maintain and less efficient, but it also can be less secure with many vulnerabilities. Complexity metrics, e.g. cyclomatic complexity and nesting levels, are commonly used to predict and benchmark software cost and efficiency. Complexity metrics are also used to decide if code refactoring is needed. Objective: Software systems with high complexity need more time to develop and test and may lead to bad understandability and more errors. Nesting level in the target structure may result in developing more complex software in what is so-called the nesting problem. Nesting problem should be shortened by rewriting the code or breaking into several functional procedures. Method: In this paper, the relationship between the nesting levels, the cyclomatic complexity, and lines of code (LOC) metrics are measured through several software releases. In order to address how strong a relationship between these factors with the nesting level, correlation coefficients are calculated. Moreover, to examine to what extent the developers are aware of and tackle the nesting problem, the evolution of nesting levels for ten releases of five open sources systems is studied to see if it is improving over successive versions or not. Results: The result shows that the nesting level has variant effects on the cyclomatic complexity and SLOC for the five studied systems. Conclusion: nesting level has the tendency to have a positive correlation with other factors (cyclomatic complexity and LOC).

Nesting Problem of Irregular Shape Based on Motion Simulation

This article discusses cutting and packing problems found in the shipbuilding industry, with the aim of minimizing material wastage. The irregular nesting problem is a variation of such problems in which the container has variable length and fixed width. Nesting of irregular shapes is a combinatorial problem with nondeterministic polynomial complete difficulty. Generally, work on solving such problems is mainly conducted in the fields of geometry and operations research. This study proposes a new method for solving the nesting problem; i.e., shape nesting can be simulated by the motion of discrete bodies in a container with a fixed width. Calculation with the program developed by the authors has been performed, and the results show that the algorithm was able to achieve good compaction for the datasets, and the running time and utility of sheet are satisfied. Results of this study show that the new method based on motion simulation can be a new solution to the shape nesting problem.