Tolga Ünlü

Tolga Ünlü

PhD

About

5
Publications
376
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
12
Citations
Introduction
Tolga Ünlü has completed his PhD research at the Division of Cyber Security, Abertay University. He investigated methodologies and techniques to integrate intrusion detection and response capabilities into web applications to make the attack-aware.
Skills and Expertise
Software Security
Software Engineering
Intrusion Detection
Education
September 2015 - July 2016
Abertay University
Abertay University
Field of study
  • Ethical Hacking and Computer Security
September 2012 - July 2013
Abertay University
Abertay University
Field of study
  • Computing and Networks
October 2009 - March 2014
Kempten University of Applied Sciences
Kempten University of Applied Sciences
Field of study
  • Computer Science

Publications

Publications (5)
View
View
View
A Taxonomy of Approaches for Integrating Attack Awareness in Applications
Preprint
Full-text available
  • May 2020
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...
View
Figure 1. Symmetric, undirected and weighted graph
Figure 2. Overview evolutionary algorithms [?]
Figure 3. Genetic Algorithm flow [?]
Figure 5. Genotype representation [?]
+3 Figure 7. Genetic Algorithm Operators [?]
A Comparison of Genetic Operators and Ant Colony Systems on Solving the Traveling Salesman Problem A Comparison of Genetic Operators and Ant Colony Systems on Solving the Traveling Salesman Problem
Preprint
Full-text available
  • Feb 2015
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...
View

Network

Cited
View All
Cited By
View All