Ayav, Tolga
Loading...
Profile URL
Name Variants
Ayav, Tolga
Tolga Ayav
Ayav T.
Ayav, T.
Ayav, T
Tolga Ayav
Ayav T.
Ayav, T.
Ayav, T
Job Title
Email Address
tolgaayav@gmail.com
tolgaayav@iyte.edu.tr
tolgaayav@iyte.edu.tr
Main Affiliation
03.04. Department of Computer Engineering
Status
Current Staff
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
1NO POVERTY
0
Research Products
2ZERO HUNGER
0
Research Products
3GOOD HEALTH AND WELL-BEING
0
Research Products
4QUALITY EDUCATION
3
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
2
Research Products
8DECENT WORK AND ECONOMIC GROWTH
0
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
23
Research Products
10REDUCED INEQUALITIES
0
Research Products
11SUSTAINABLE CITIES AND COMMUNITIES
1
Research Products
12RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
13CLIMATE ACTION
0
Research Products
14LIFE BELOW WATER
0
Research Products
15LIFE ON LAND
0
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents
35
Citations
289
h-index
10
Documents
27
Citations
179
Scholarly Output
84
Articles
18
Views / Downloads
346659/130574
Supervised MSc Theses
25
Supervised PhD Theses
3
WoS Citation Count
165
Scopus Citation Count
281
Patents
1
Projects
3
WoS Citations per Publication
1.96
Scopus Citations per Publication
3.35
Open Access Source
73
Supervised Theses
28
| Journal | Count |
|---|---|
| EMO Bilimsel Dergi | 2 |
| European Journal of Human Genetics | 2 |
| International Journal of Software Engineering and Knowledge Engineering | 2 |
| -- 11th International Conference on Computer Technology Applications, ICCTA 2025 -- Vienna -- 213105 | 1 |
| 12th Real-Time Embedded Systems Conference | 1 |
Current Page: 1 / 10
Scopus Quartile Distribution
Competency Cloud
84 results
Scholarly Output Search Results
Now showing 1 - 10 of 84
Doctoral Thesis Location Privacy in Cellular Networks(01. Izmir Institute of Technology, 2022) Yaman, Okan; Ayav, Tolga; Erten, Yusuf Murat; Ayav, Tolga; Erten, Yusuf MuratMany third-party utilities and applications that run on devices used in cellular networks keep track of our location data and share it. This vulnerability affects even the subscribers who use dumbphones. This thesis defines three location tracing attacks which are based on utilizing the background data and compares them with the most relevant known attacks. We have demonstrated that any attacker who knows two associated cells of a subscriber with adequate background data can deduce the intermediate cell IDs. Also, utilizing the Hidden Markov Model (HMM) increases the accuracy of an attack. In this dissertation, we introduced novel accuracy metrics for all the anticipated attacks and exploited these for detailed analysis of the threats in a real-life case, a 5G network. This work demonstrates improvements in the current privacy-preserving methods, including adaptation to 5G, and provides insights into preventing this location privacy breach. Various methods have been proposed to overcome these threats and preserve privacy against possible attacks based on this information. A friendly jamming (FJ) based solution, which offers efficient usage of resources, including computing power and energy, was introduced as a solution for these problems. However, one of the tradeoffs of FJ is its viability. Although some studies try to cope with this challenge, they are complicated and focus on old technologies. We propose a lightweight and flexible FJ scheme to address these challenges. We also demonstrate that our model has the same performance as one of the mentioned studies above in a more straightforward way.Master Thesis A Blockchain Application for Payment and Traffic Management in Smart Vehicles(Izmir Institute of Technology, 2022) Yiğitbaşı, Boğaçhan; Ayav, Tolga; Ayav, TolgaThe proposed solution offers an alternative way to our current retail shopping of fuel fees. It can be applied to any retail shopping process but this phase of the project is considered an initiation of upcoming. The next phases of the project, include full integration with smart cars in order to handle all procedures automatically. In the traditional way, when you buy some gas from a station with your credit card, the station owner pays some fee to his bank and it has to wait for some time to be able to get that money. You as an individual have to expose your identity so they can track your shopping habits and follow your expenses. Sometimes they may offer some loyalty discounts or gifts but with really ridiculous rates. Our system offers a digital payment system based on the Ethereum blockchain. It has its own token called TRANT (Transport Token) and by this token, any client with a digital wallet (Metamask) is able to pay their gas fees without exposing their real identity -only their wallet address-, and get some rewards in terms of TRANT for their loyalties and using our DEX (Decentralized Exchange) exchange them into the ether which can be converted into real fiat money easily. On the other hand, the proposed solution also has some advantages for the other party in this equation such as gas station owners, they immediately get their money at that very first moment without any remittance.Master Thesis Parallelization of a Novel Frequent Itemset Hiding Algorithm on a Cpu-Gpu Platform(Izmir Institute of Technology, 2014) Heye, Samuel Bacha; Ayav, Tolga; Ayav, TolgaData mining is used to extract useful information from large data. But the organizations which mine the data might not be the owner of the data. So, before the owners can make their data accessible for data mining they want to make sure that no sensitive information can be mined from the released data whose discovery by others might harm them. Itemset hiding is one mechanism to prevent the disclosure of sensitive itemsets. In this thesis, a new integer programing based itemset hiding algorithm was developed and a mechanism to speed up the computation time of its implementation was proposed by using parallel computation on Graphical Processing Units (GPUs).Doctoral Thesis Density Grid Based Stream Clustering Algorithm(Izmir Institute of Technology, 2019) Ahmed, Rowanda Daoud; Ayav, Tolga; Ayav, Tolga; Dalkılıç, GökhanRecently as applications produce overwhelming data streams, the need for strategies to analyze and cluster streaming data becomes an urgent and a crucial research area for knowledge discovery. The main objective and the key aim of data stream clustering is to gain insights into incoming data. Recognizing all probable patterns in this boundless data which arrives at varying speeds and structure and evolves over time, is very important in this analysis process. The existing data stream clustering strategies so far, all suffer from different limitations, like the inability to find the arbitrary shaped clusters and handling outliers in addition to requiring some parameter information for data processing. For fast, accurate, efficient and effective handling for all these challenges, we proposed DGStream, a new online-offline grid and density-based stream clustering algorithm. We conducted many experiments and evaluated the performance of DGStream over different simulated databases and for different parameter settings where a wide variety of concept drifts, novelty, evolving data, number and size of clusters and outlier detection are considered. Our algorithm is suitable for applications where the interest lies in the most recent information like stock market, or if the analysis of existing information is required as well as cases where both the old and the recent information are all equally important. The experiments, over the synthetic and real datasets, show that our proposed algorithm outperforms the other algorithms in efficiency.Conference Object Birleşimsel Devreler için Fourier Analizi Tabanlı Otomatik Test Örüntüsü Oluşturma(IEEE, 2015) Ayav, TolgaFourier analysis of boolean functions has attracted great attention from computer scientists in the last decade but it still has few application areas. This work presents a Fourier analysis-based automatic test pattern generation method for combinational circuits.Master Thesis Solving the Course Scheduling Problem by Constraint Programming and Simulated Annealing(Izmir Institute of Technology, 2008) Aycan, Esra; Ayav, TolgaIn this study it has been tackled the NP-complete problem of academic class scheduling (or timetabling). The aim of this thesis is finding a feasible solution for Computer Engineering Department of İzmir Institute of Technology. Hence, a solution method for course timetabling is presented in this thesis, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with different neighbourhood searching algorithms. When the experimental data are obtained it is noticed that according to problem structure, whether the problem is tightened or loosen constrained, the performance of a hybrid approach can change. These different behaviours of the approach are demonstrated by two different timetabling problem instances. In addition to all these, the neighbourhood searching algorithms used in the simulated annealing technique are tested in different combinations and their performances are presented.Conference Object Neuroboscope Sisteminin Model Tabanlı Sınaması(Otomatik Kontrol Türk Milli Komitesi, 2016) Uzun, Bengisu; Ayav, Tolga; Dede, Mehmet İsmet Can; Berker, Mustafa; Işıkay, İlkay; Hanalioğlu, Şahin; Özdemirel, Barbaros; Kiper, Gökhan; Tatlıcıoğlu, Enver; Maaroof, Omar W.; Işıtman, Oğulcan; Ateş, Gizem; Yaşır, AbdullahNeuRoboScope projesinde, endoskopik hipofiz cerrahisinde kullanılan optik-kamera sisteminin, cerrahın kullandığı cerrahi aletleri takip ederek yönlendirilmesini amaçlayan emniyet kritik bir sistemin tasarlanması amaçlanmıştır. Bu bildiri, sistem gereksinimleri üzerinden tüm sistemin modellenmesini ve oluşturulan bu modelin sınanmasını ele almaktadır. Böylece, tasarım evresinden önce tasarımın dayanağı olan sistem gereksinimlerinin doğrulanması hedeflenmiştir. Sistem bir zamanlı otomat ağı olarak modellenmiş ve UPPAAL model sınama aracı kullanılarak, sistemin başta emniyet kritik olmak üzere diğer önemli özellikleri sınanmıştır.Article Citation - WoS: 3Citation - Scopus: 4Full-Exact Approach for Frequent Itemset Hiding(IGI Global Publishing, 2015) Ayav, Tolga; Ergenç, BelginThis paper proposes a novel, exact approach that relies on integer programming for association rule hiding. A large panorama of solutions exists for the complex problem of itemset hiding: from practical heuristic approaches to more accurate exact approaches. Exact approaches provide better solutions while suffering from the lack of performance and existing exact approaches still augment their methods with heuristics to make the problem solvable. In this case, the solution may not be optimum. This work present a full-exact method, without any need for heuristics. Extensive tests are conducted on 10 real datasets to analyze distance and information loss performances of the algorithm in comparison to a former similar algorithm. Since the approach provides the optimum solution to the problem, it should be considered as a reference method.Master Thesis Test Case Generation From Cause Effect Graphs(Izmir Institute of Technology, 2016) Kavzak Ufuktepe, Deniz; Ayav, Tolga; Ayav, TolgaCause-effect graphing is a well-known requirement based testing technique. However, since it was introduced by Myers in 1979, there seems not to have been any sufficiently comprehensive studies to generate test cases from these graphs. Yet there are several methods introduced to generate test cases from Boolean expressions. This thesis proposes to convert cause-effect graphs into Boolean expressions and find out the test sets using test input generation techniques for Boolean expressions, such as MI, MAX-A, CUTPNFP, MUMCUT, Unique MC/DC and Masking MC/DC. Generated test sets are compared by using mutation analysis according to their fault detection capabilities. Myers’ original test generation technique is also implemented and included in the mutation analysis. A tool is created which allows to generate test cases by using the implemented algorithms. The tool gets a “.graphml” file representing a cause- effect graph as an input and gives the generated test set as an output. In addition, mutation analysis can be done with the implemented tool. 14 Requirements of TCAS-II are used as an experiment. Results of the mutation testing for these requirements showed that MUMCUT technique has the highest mutant detection success for all fault types. Moreover, Unique MC/DC technique has detected highest number of mutants per test case.Doctoral Thesis Fourier Analysis Based Testing of Finite State Machines(Izmir Institute of Technology, 2019) Takan, Savaş; Takan, Savaş; Ayav, Tolga; Ayav, TolgaFinite state machine (FSM) is a widely used modeling technique for circuit and software testing. FSM testing is a well-studied topic in the literature and there are several test case generation methods such as W, Wp, UIO, UIOv, DS, HSI and H. Despite the existing methods, there is still a need for alternative techniques with better performance in terms of test suite size, fault detection ratio and test generation time. In this thesis, two new test case generation methods, F and Fw have been proposed. The proposed test generation methods are based on Fourier analysis of Boolean functions. Fourier transformations have been studied extensively in mathematics, computer science and engineering. The proposed F method only tests outputs whereas Fw method also tests the next state with the outputs. In this context, the proposed methods are compared with UIO andWmethods in terms of characteristic, cost, fault detection ratio and effectiveness. The evaluation data are analyzed using T-Test and Hedges’ g. Results show that F and Fw methods outperform the existing methods in terms of the fault detection ratio per test.