Variability, Rigidity and the Nesting Problem

Theoria ◽  
2019 ◽  
Author(s):  
Olga Poller
Keyword(s):  
Nesting Problem

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

2020 ◽  
Vol 13 (4) ◽  
pp. 572-578 ◽  
Author(s):  
Mamdouh Alenezi ◽  
Mohammad Zarour ◽  
Mohammed Akour
Keyword(s):  
Open Source Software ◽  
Correlation Coefficients ◽  
Software Systems ◽  
Software Cost ◽  
Software Complexity ◽  
Complexity Metrics ◽  
Cyclomatic Complexity ◽  
Code Refactoring ◽  
Nesting Problem ◽  
The Relationship

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).

Research on Ship Parts Nesting with Immune Ant Colony Algorithm

2011 ◽  
Vol 291-294 ◽  
pp. 2393-2396
Author(s):  
Xiang Qiang Zhong ◽  
Li Dong Liang
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Matching Method ◽  
Pretreatment Method ◽  
Nesting Problem

A kind of method with immune ant colony algorithm (IACA) was applied for ship parts nesting problems. Graphics coding and pretreatment method of ship parts were proposed. A method of combination and filling transformed ship parts nesting problem into orthogonal rectangular nesting problem. An automatic nesting system was realized by use of remaining rectangular matching method and orthogonal approach grafting algorithm. A specific example was given according to the proposed algorithm, the nesting results prove that it is feasible for ship parts optimization nesting problem with IACA.

A pairwise exact placement algorithm for the irregular nesting problem

2015 ◽  
Vol 29 (11) ◽  
pp. 1177-1189 ◽  
Author(s):  
André Kubagawa Sato ◽  
Thiago de Castro Martins ◽  
Marcos de Sales Guerra Tsuzuki
Keyword(s):  
Nesting Problem ◽  
Placement Algorithm

The Development of an Automatic Leather Nesting System

2014 ◽  
Vol 800-801 ◽  
pp. 398-401
Author(s):  
Liang Zhou ◽  
Feng Hou ◽  
Chuan Rui Zhu ◽  
Liang Li
Keyword(s):  
Nesting Problem ◽  
Material Utilization

To solve the problem of irregular leather nesting, a “Revolution-Rotation” algorithm is put forward on the base of heurism search in this paper. The system can be applied in nesting problem in both regular and irregular motherboard, and can achieve the balance of material utilization and nesting efficiency.

Sign in / Sign up

Export Citation Format

Share Document