Programming methodology and language implications

2005 ◽  
pp. 531-542 ◽  
Author(s):  
Michael Griffiths
Keyword(s):  
Programming Methodology

scholarly journals On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodology

2021 ◽  
Author(s):  
Sweeney Luis
Keyword(s):  
Genetic Programming ◽  
Dynamic Environment ◽  
Computer Programs ◽  
Hybrid Architecture ◽  
Ant System ◽  
Cartesian Genetic Programming ◽  
Ant Colonies ◽  
Programming Methodology ◽  
Genotype Diversity ◽  
Evolution Proceeds

In this thesis, we design a method that uses Ant Colonies as a Model-based Search to Cartesian Genetic Programming (CGP) to induce computer programs. Candidate problem solutions are encoded using a CGP representation. Ants generate problem solutions guided by pheromone traces of entities and nodes of the CGP representation. The pheromone values are updated based on the paths followed by the best ants, as suggested in the Rank-Based Ant System (ASrank). To assess the evolvability of the system we applied a modified version of the method introduced in [1] to measure rate of evolution which considers variability and neutrality as the major influences in the evolution of a system. Our results show that such method effectively reveals how evolution proceeds under different parameter settings and different environmental scenarios. The proposed hybrid architecture shows high evolvability in a dynamic environment by maintaining a pheromone model that elicits high genotype diversity.

scholarly journals On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodology

2021 ◽  
Author(s):  
Sweeney Luis
Keyword(s):  
Genetic Programming ◽  
Dynamic Environment ◽  
Computer Programs ◽  
Hybrid Architecture ◽  
Ant System ◽  
Cartesian Genetic Programming ◽  
Ant Colonies ◽  
Programming Methodology ◽  
Genotype Diversity ◽  
Evolution Proceeds

In this thesis, we design a method that uses Ant Colonies as a Model-based Search to Cartesian Genetic Programming (CGP) to induce computer programs. Candidate problem solutions are encoded using a CGP representation. Ants generate problem solutions guided by pheromone traces of entities and nodes of the CGP representation. The pheromone values are updated based on the paths followed by the best ants, as suggested in the Rank-Based Ant System (ASrank). To assess the evolvability of the system we applied a modified version of the method introduced in [1] to measure rate of evolution which considers variability and neutrality as the major influences in the evolution of a system. Our results show that such method effectively reveals how evolution proceeds under different parameter settings and different environmental scenarios. The proposed hybrid architecture shows high evolvability in a dynamic environment by maintaining a pheromone model that elicits high genotype diversity.

scholarly journals Shape-programmable magnetic soft matter

2016 ◽  
Vol 113 (41) ◽  
pp. E6007-E6015 ◽  
Author(s):  
Guo Zhan Lum ◽  
Zhou Ye ◽  
Xiaoguang Dong ◽  
Hamid Marvi ◽  
Onder Erin ◽  
...  
Keyword(s):  
Soft Matter ◽  
Computational Method ◽  
Small Scale ◽  
Time Varying ◽  
Programmable Matter ◽  
Fabrication Technique ◽  
Active Materials ◽  
Vast Number ◽  
Programming Methodology ◽  
Magnetically Actuated

Shape-programmable matter is a class of active materials whose geometry can be controlled to potentially achieve mechanical functionalities beyond those of traditional machines. Among these materials, magnetically actuated matter is particularly promising for achieving complex time-varying shapes at small scale (overall dimensions smaller than 1 cm). However, previous work can only program these materials for limited applications, as they rely solely on human intuition to approximate the required magnetization profile and actuating magnetic fields for their materials. Here, we propose a universal programming methodology that can automatically generate the required magnetization profile and actuating fields for soft matter to achieve new time-varying shapes. The universality of the proposed method can therefore inspire a vast number of miniature soft devices that are critical in robotics, smart engineering surfaces and materials, and biomedical devices. Our proposed method includes theoretical formulations, computational strategies, and fabrication procedures for programming magnetic soft matter. The presented theory and computational method are universal for programming 2D or 3D time-varying shapes, whereas the fabrication technique is generic only for creating planar beams. Based on the proposed programming method, we created a jellyfish-like robot, a spermatozoid-like undulating swimmer, and an artificial cilium that could mimic the complex beating patterns of its biological counterpart.

Short Course in FORTRAN Programming Methodology

1993 ◽  
pp. 15-18
Author(s):  
Dietrich Stauffer ◽  
Friedrich W. Hehl ◽  
Nobuyasu Ito ◽  
Volker Winkelmann ◽  
John G. Zabolitzky
Keyword(s):  
Programming Methodology ◽  
Short Course
Sign in / Sign up

Export Citation Format

Share Document