Tolga ÜnlüAbertay University | UAD · Division of Cyber Security, School of Design and Informatics
Tolga Ünlü
MSc in Ethical Hacking and Computer Security
About
5
Publications
298
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
4
Citations
Citations since 2017
Introduction
Tolga Ünlü currently does his PhD research at the Division of Cyber Security, Abertay University. His research focuses on investigating methodologies and techniques to integrate intrusion detection and response capabilities into web applications. Further research areas of interest include web development, software development, software testing, intrusion detection, active defense and deception.
Education
September 2015 - July 2016
September 2012 - July 2013
October 2009 - March 2014
Publications
Publications (5)
Software applications are subject to an increasing number of attacks, resulting in data breaches and financial damage. Many solutions have been considered to help mitigate these attacks, such as the integration of attack-awareness techniques. In this paper, we propose a taxonomy illustrating how existing attack awareness techniques can be integrate...
![Figure 2. Overview evolutionary algorithms [?]](profile/Ulrich-Goehner/publication/335572149/figure/fig2/AS:799010650615809@1567510392323/Overview-evolutionary-algorithms_Q320.jpg)
![Figure 3. Genetic Algorithm flow [?]](profile/Ulrich-Goehner/publication/335572149/figure/fig3/AS:799010650595329@1567510392366/Genetic-Algorithm-flow_Q320.jpg)
![Figure 5. Genotype representation [?]](profile/Ulrich-Goehner/publication/335572149/figure/fig4/AS:799010650615810@1567510392387/Genotype-representation_Q320.jpg)
![Figure 7. Genetic Algorithm Operators [?]](profile/Ulrich-Goehner/publication/335572149/figure/fig5/AS:799010650615811@1567510392416/Genetic-Algorithm-Operators_Q320.jpg)
Genetic Algorithms (GA) are an approach to solve combinatorial optimization problems following the law of survival of the fittest. Solutions found by GA evolve through the use of three genetic operators, namely, the selection, crossover and mutation operator. The purpose of this paper is to apply a GA to the Traveling Salesman Problem (TSP) and to...
