Performance Evaluation of Micropiles as a Ground Improvement Technique for Existing Railway Tracks: Finite-Element and Genetic Programming Approach

2022 ◽  
Vol 22 (3) ◽  
Author(s):  
Randhir Kumar Gupta ◽  
Sowmiya Chawla
Keyword(s):  
Finite Element ◽  
Performance Evaluation ◽  
Genetic Programming ◽  
Ground Improvement ◽  
Programming Approach ◽  
Railway Tracks

scholarly journals Binary Image Classification: A Genetic Programming Approach to the Problem of Limited Training Instances

2016 ◽  
Vol 24 (1) ◽  
pp. 143-182 ◽  
Author(s):  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
Mark Johnston
Keyword(s):  
Computer Vision ◽  
Pattern Recognition ◽  
Genetic Programming ◽  
Visual System ◽  
Image Classification ◽  
Human Visual System ◽  
Binary Classification ◽  
Programming Approach ◽  
Data Sets ◽  
New Class

In the computer vision and pattern recognition fields, image classification represents an important yet difficult task. It is a challenge to build effective computer models to replicate the remarkable ability of the human visual system, which relies on only one or a few instances to learn a completely new class or an object of a class. Recently we proposed two genetic programming (GP) methods, one-shot GP and compound-GP, that aim to evolve a program for the task of binary classification in images. The two methods are designed to use only one or a few instances per class to evolve the model. In this study, we investigate these two methods in terms of performance, robustness, and complexity of the evolved programs. We use ten data sets that vary in difficulty to evaluate these two methods. We also compare them with two other GP and six non-GP methods. The results show that one-shot GP and compound-GP outperform or achieve results comparable to competitor methods. Moreover, the features extracted by these two methods improve the performance of other classifiers with handcrafted features and those extracted by a recently developed GP-based method in most cases.

scholarly journals A NEW LINEAR GENETIC PROGRAMMING APPROACH BASED ON STRAIGHT LINE PROGRAMS: SOME THEORETICAL AND EXPERIMENTAL ASPECTS

2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES
Keyword(s):  
Data Structure ◽  
Genetic Programming ◽  
Computer Programs ◽  
Symbolic Regression ◽  
Programming Approach ◽  
Linear Genetic Programming ◽  
Straight Line ◽  
Structured Representations ◽  
Regression Problems ◽  
Straight Line Programs

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.

scholarly journals A structure-exploiting numbering algorithm for finite elements on extruded meshes, and its performance evaluation in Firedrake

2016 ◽  
Vol 9 (10) ◽  
pp. 3803-3815 ◽  
Author(s):  
Gheorghe-Teodor Bercea ◽  
Andrew T. T. McRae ◽  
David A. Ham ◽  
Lawrence Mitchell ◽  
Florian Rathgeber ◽  
...  
Keyword(s):  
Finite Element ◽  
Performance Evaluation ◽  
Finite Elements ◽  
Aspect Ratio ◽  
Three Dimensional ◽  
Data Layout ◽  
Element System ◽  
Continuous Galerkin ◽  
Performance Penalty ◽  
The Cost

Abstract. We present a generic algorithm for numbering and then efficiently iterating over the data values attached to an extruded mesh. An extruded mesh is formed by replicating an existing mesh, assumed to be unstructured, to form layers of prismatic cells. Applications of extruded meshes include, but are not limited to, the representation of three-dimensional high aspect ratio domains employed by geophysical finite element simulations. These meshes are structured in the extruded direction. The algorithm presented here exploits this structure to avoid the performance penalty traditionally associated with unstructured meshes. We evaluate the implementation of this algorithm in the Firedrake finite element system on a range of low compute intensity operations which constitute worst cases for data layout performance exploration. The experiments show that having structure along the extruded direction enables the cost of the indirect data accesses to be amortized after 10–20 layers as long as the underlying mesh is well ordered. We characterize the resulting spatial and temporal reuse in a representative set of both continuous-Galerkin and discontinuous-Galerkin discretizations. On meshes with realistic numbers of layers the performance achieved is between 70 and 90 % of a theoretical hardware-specific limit.

Sign in / Sign up

Export Citation Format

Share Document