Another round with the newest scientific papers using GeneticSharp.

Design and optimization of a GFRP and steel hybrid prestressed SFRC beam based on numerical and analytical approaches

Abstract: Due to corrosion immunity, GFRP bars can be used in combination with steel bars and disposed in arrangements that take advantage of their specific properties. Since steel stirrups are the most susceptible to corrosion, significant advantages can be obtained with their replacement by fiber reinforcement, using Steel Fiber Reinforced Concrete (SFRC), which also allows to decrease the thickness of the beam’s web. In addition, prestressing the flexural reinforcement increases the service load-carrying capacity of the beams and their shear strength. This study highlights the flexural performance of hybrid prestressed GFRP-Steel SFRC beams considering the optimum design provided with the use of a genetic algorithm (GA) on simply supported I-shaped beams. The results show that the proposed GA-based optimization procedure provides an effective approach to obtain the balanced reinforcement ratio for these types of beams. (paper)

Software system for intellectual formation of starting populations

Abstract: The aim of the study. The main goal of the work is to improve existing methods genetic algorithm software development by providing opportunities for the intellectual formation of initial populations at the expense of using a component approach (paper)

Research of lift and transport machine systems plot of processing and food enterprises

Abstract: The work solves the actual problem of increasing efficiency production process of obtaining food products based on formation optimal structures of systems of lifting and transport machines of workshops and sites of processing and food enterprises. (paper)

Automatic refactoring for parallelization

Abstract: In modern software, adaptions like the parallelization are necessary to fully leverage the CPU’s capabilities. However, the parallelization introduces a new range of possible software faults. Thus, assisting utilities like static code analyzers are desirable. For instance, ones that inform engineers about the code fragments that can be safely adapted. This thesis focuses on loops and introduces a conservative approach to verify that these can be parallelized. More specifically, it allows proofing that array accesses do not conflict between iterations. The procedure is a data flow analysis, which proofs the absence of conflicts by employing rules for a selection of binary expressions. Furthermore, its design allows it to profit from various code optimizations automatically. Experimental evaluations show that both, the prototype and the data flow analysis itself, do not incorrectly identify loops as parallelizable. Moreover, it pinpoints that the analysis can correctly identify most of the parallelizable loops, and only a negligible amount requires a more mature approach. (paper)