scholarly journals A Genetic Algorithm-Based Approach for Composite Metamorphic Relations Construction

Information ◽  
2019 ◽  
Vol 10 (12) ◽  
pp. 392
Author(s):  
Zhenglong Xiang ◽  
Hongrun Wu ◽  
Fei Yu

The test oracle problem exists widely in modern complex software testing, and metamorphic testing (MT) has become a promising testing technique to alleviate this problem. The inference of efficient metamorphic relations (MRs) is the core problem of metamorphic testing. Studies have proven that the combination of simple metamorphic relations can construct more efficient metamorphic relations. In most previous studies, metamorphic relations have been mainly manually inferred by experts with professional knowledge, which is an inefficient technique and hinders the application. In this paper, a genetic algorithm-based approach is proposed to construct composite metamorphic relations automatically for the program to be tested. We use a set of relation sequences to represent a particular class of MRs and turn the problem of inferring composite MRs into a problem of searching for suitable sequences. We then dynamically implement multiple executions of the program and use a genetic algorithm to search for the optimal set of relation sequences. We conducted empirical studies to evaluate our approach using scientific functions in the GNU scientific library (abbreviated as GSL). From the empirical results, our approach can automatically infer high-quality composite MRs, on average, five times more than basic MRs. More importantly, the inferred composite MRs can increase the fault detection capabilities by at least 30 % more than the original metamorphic relations.

2014 ◽  
Vol 10 (1) ◽  
pp. 111
Author(s):  
Rahman Erama ◽  
Retantyo Wardoyo

AbstrakModifikasi Algoritma Genetika pada penelitian ini dilakukan berdasarkan temuan-temuan para peneliti sebelumnya tentang kelemahan Algoritma Genetika. Temuan-temuan yang dimakasud terkait proses crossover sebagai salah satu tahapan terpenting dalam Algoritma Genetika dinilai tidak menjamin solusi yang lebih baik oleh beberapa peneliti. Berdasarkan temuan-temuan oleh beberapa peneliti sebelumnya, maka penelitian ini akan mencoba memodifikasi Algoritma Genetika dengan mengeliminasi proses crossover yang menjadi inti permasalahan dari beberapa peneliti tersebut. Eliminasi proses crossover ini diharapkan melahirkan algoritma yang lebih efektif sebagai alternative untuk penyelesaian permasalahan khususnya penjadwalan pelajaran sekolah.Tujuan dari penelitian ini adalah Memodifikasi Algoritma Genetika menjadi algoritma alternatif untuk menyelesaikan permasalahan penjadwalan sekolah, sehingga diharapkan terciptanya algoritma alternatif ini bisa menjadi tambahan referensi bagi para peneliti untuk menyelesaikan permasalahan penjadwalan lainnya.Algoritma hasil modifikasi yang mengeliminasi tahapan crossover pada algoritma genetika ini mampu memberikan performa 3,06% lebih baik dibandingkan algoritma genetika sederhana dalam menyelesaikan permasalahan penjadwalan sekolah. Kata kunci—algoritma genetika, penjadwalan sekolah, eliminasi crossover  AbstractModified Genetic Algorithm in this study was based on the findings of previous researchers about the weakness of Genetic Algorithms. crossover as one of the most important stages in the Genetic Algorithms considered not guarantee a better solution by several researchers. Based on the findings by previous researchers, this research will try to modify the genetic algorithm by eliminating crossover2 which is the core problem of several researchers. Elimination crossover is expected to create a more effective algorithm as an alternative to the settlement issue in particular scheduling school.This study is intended to modify the genetic algorithm into an algorithm that is more effective as an alternative to solve the problems of school scheduling. So expect the creation of this alternative algorithm could be an additional resource for researchers to solve other scheduling problems.Modified algorithm that eliminates the crossover phase of the genetic algorithm is able to provide 2,30% better performance than standard genetic algorithm in solving scheduling problems school. Keywords—Genetic Algorithm, timetabling school, eliminate crossover


2019 ◽  
pp. 246-256
Author(s):  
A. K. Zholkovsky

In his article, A. Zholkovsky discusses the contemporary detective mini-series Otlichnitsa [A Straight-A Student], which mentions O. Mandelstam’s poem for children A Galosh [Kalosha]: more than a fleeting mention, this poem prompts the characters and viewers alike to solve the mystery of its authorship. According to the show’s plot, the fact that Mandelstam penned the poem surfaces when one of the female characters confesses her involvement in his arrest. Examining this episode, Zholkovsky seeks structural parallels with the show in V. Aksyonov’s Overstocked Packaging Barrels [Zatovarennaya bochkotara] and even in B. Pasternak’s Doctor Zhivago [Doktor Zhivago]: in each of those, a member of the Soviet intelligentsia who has developed a real fascination with some unique but unattainable object is shocked to realize that the establishment have long enjoyed this exotic object without restrictions. We observe, therefore, a typical solution to the core problem of the Soviet, and more broadly, Russian cultural-political situation: the relationship between the intelligentsia and the state, and the resolution is not a confrontation, but reconciliation.


BMC Genomics ◽  
2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Seth Commichaux ◽  
Kiran Javkar ◽  
Padmini Ramachandran ◽  
Niranjan Nagarajan ◽  
Denis Bertrand ◽  
...  

Abstract Background Whole genome sequencing of cultured pathogens is the state of the art public health response for the bioinformatic source tracking of illness outbreaks. Quasimetagenomics can substantially reduce the amount of culturing needed before a high quality genome can be recovered. Highly accurate short read data is analyzed for single nucleotide polymorphisms and multi-locus sequence types to differentiate strains but cannot span many genomic repeats, resulting in highly fragmented assemblies. Long reads can span repeats, resulting in much more contiguous assemblies, but have lower accuracy than short reads. Results We evaluated the accuracy of Listeria monocytogenes assemblies from enrichments (quasimetagenomes) of naturally-contaminated ice cream using long read (Oxford Nanopore) and short read (Illumina) sequencing data. Accuracy of ten assembly approaches, over a range of sequencing depths, was evaluated by comparing sequence similarity of genes in assemblies to a complete reference genome. Long read assemblies reconstructed a circularized genome as well as a 71 kbp plasmid after 24 h of enrichment; however, high error rates prevented high fidelity gene assembly, even at 150X depth of coverage. Short read assemblies accurately reconstructed the core genes after 28 h of enrichment but produced highly fragmented genomes. Hybrid approaches demonstrated promising results but had biases based upon the initial assembly strategy. Short read assemblies scaffolded with long reads accurately assembled the core genes after just 24 h of enrichment, but were highly fragmented. Long read assemblies polished with short reads reconstructed a circularized genome and plasmid and assembled all the genes after 24 h enrichment but with less fidelity for the core genes than the short read assemblies. Conclusion The integration of long and short read sequencing of quasimetagenomes expedited the reconstruction of a high quality pathogen genome compared to either platform alone. A new and more complete level of information about genome structure, gene order and mobile elements can be added to the public health response by incorporating long read analyses with the standard short read WGS outbreak response.


2020 ◽  
Vol 30 (Supplement_5) ◽  
Author(s):  
G Lang

Abstract Background High quality health promotion (HP) depends on a competent workforce for which professional development programmes for practitioners are essential. The “CompHP Core Competencies Framework in HP” defines crucial competency domains but a recent review concluded that the implementation and use of the framework is lacking. The aim was to develop and validate a self-assessment tool for HP competencies, which should help evaluate training courses. Methods A brief self-assessment tool was employed in 2018 in Austria. 584 participants of 77 training courses submitted their post-course assessment (paper-pencil, RR = 78.1%). In addition, longitudinal data are available for 148 participants who filled in a pre-course online questionnaire. Measurement reliability and validity was tested by single factor, bifactor, multigroup, and multilevel CFA. A SEM proved for predictive and concurrent validity, controlling gender and age. Results A bifactor model (X2/df=3.69, RMSEA=.07, CFI=.95, sRMR=.07) showed superior results with a strong general CompHP factor (FL>.65, wH=.90, ECV=.85), configurally invariant for two training programmes. On course level, there was only minimal variance between trainings (ICC<.08). Structurally, there was a significant increase in HP competencies when comparing pre- and post-course measurements (b=.33, p<.01). Participants showed different levels of competencies due to prior knowledge (b=.38, p<.001) and course format (b=.16, p<.06). The total scale had good properties (m = 49.8, sd = 10.3, 95%-CI: 49.0-50.7) and discriminated between groups (eg by training length). Conclusions The results justify the creation of an overall scale to assess core HP competencies. It is recommended to use the scale for evaluating training courses. The work compensates for the lack of empirical studies on the CompHP concept and facilitates a broader empirical application of a uniform competency framework for HP in accordance with international standards in HP and public health. Key messages The self-assessment tool provides a good and compact foundation for assessing HP competencies. It provides a basis for holistic, high quality and sustainable capacity building or development in HP.


Scanning ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Xu Chen ◽  
Tengfei Guo ◽  
Yubin Hou ◽  
Jing Zhang ◽  
Wenjie Meng ◽  
...  

A new scan-head structure for the scanning tunneling microscope (STM) is proposed, featuring high scan precision and rigidity. The core structure consists of a piezoelectric tube scanner of quadrant type (for XY scans) coaxially housed in a piezoelectric tube with single inner and outer electrodes (for Z scan). They are fixed at one end (called common end). A hollow tantalum shaft is coaxially housed in the XY-scan tube and they are mutually fixed at both ends. When the XY scanner scans, its free end will bring the shaft to scan and the tip which is coaxially inserted in the shaft at the common end will scan a smaller area if the tip protrudes short enough from the common end. The decoupled XY and Z scans are desired for less image distortion and the mechanically reduced scan range has the superiority of reducing the impact of the background electronic noise on the scanner and enhancing the tip positioning precision. High quality atomic resolution images are also shown.


Author(s):  
Anak Agung Ngurah Gede Marhendra ◽  
Agung Eko Budiwaspada ◽  
Sangayu Ketut Laksemi Nilotama

<p>Abstract Design of Cemara Ceramics Visual Rebranding Identity aims to produce a concept strategy and visual rebranding of the Cemara Ceramics company and produce a Cemara Ceramics rebranding visual identity design in order to encourage the creation of a new identity image. The method in this design uses a 5-stage Design Thinking approach, namely Empathize, Define, Ideate, Prototype and Test. The result achieved is the design of the new Cemara Ceramics corporate identity. With the use of the design thinking method in this research, various problems related to the company image of Cemara Ceramics can be found. The core problem obtained is how to design a strategy and concept of visual identity rebranding to encourage the creation of a new corporate image of Cemara Ceramics.</p><p>Keywords: visual rebranding identity, concept strategy, design thinking</p><p>Abstrak Perancangan Identitas Visual Rebranding Citra Perusahaan Cemara Ceramics ini bertujuan untuk menghasilkan strategi konsep dan visual rebranding perusahaan Cemara Ceramics serta menghasilkan rancangan identitas visual rebranding Cemara Ceramics dalam rangka mendorong terciptanya citra identitas yang baru. Metode dalam perancangan ini menggunakan pendekatan 5 tahapan Design Thinking yaitu Empathize, Define, Ideate, Prototype dan Test. Hasil yang dicapai yaitu rancangan corporate identity Cemara Ceramics yang baru. Dengan adanya penggunaan metode design thinking pada penelitian ini dapat menemukan berbagai permasalahan terkait citra perusahaan Cemara Ceramics. Permasalahan inti yang didapat yaitu mengenai bagaimana merancang strategi dan konsep identitas visual rebranding untuk mendorong terciptanya citra baru perusahaan Cemara Ceramics.</p><p>Kata kunci: identitas visual rebranding, strategi konsep dan visual, design thinking</p>


2008 ◽  
Vol 31 (2) ◽  
pp. 142-143 ◽  
Author(s):  
Brendan McGonigle ◽  
Margaret Chalmers

AbstractThe “rational bubble” stance espoused in the target article confounds cultural symbolic achievements with individual cognitive competences. With no explicit role for learning, the core rationale for claiming a major functional discontinuity between humans and other species rests on a hybrid formal model LISA (Learning and Inference with Schemas and Analogies) now overtaken by new models of cognitive growth and new empirical studies within an embodied systems stance.


2008 ◽  
Vol 2008 ◽  
pp. 1-6 ◽  
Author(s):  
Tng C. H. John ◽  
Edmond C. Prakash ◽  
Narendra S. Chaudhari

This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.


Sign in / Sign up

Export Citation Format

Share Document