Şafak Durukan-Odabaşı
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Şafak Durukan-Odabaşı has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Muhammed Ali Aydin
İstanbul Üniversitesi-Cerrahpaşa
2 shared publications - Uğur Odabaşı
Department of Engineering Sciences, Istanbul University-Cerrahpaşa, Istanbul 34320, Türkiye
2 shared publications A. Halim Zaim
Istanbul Commerce Univ, Fac Engn, Dept Elect & Elect Engn, Istanbul, Turkey
1 shared publication- A. Kirca1 shared publication
- Ahmet Çağrı Sarıyıldız
Department of Cybersecurity, Bahçeşehir University, Istanbul 34349, Türkiye
1 shared publication - Begüm Çorbacıoğlu
Department of Cybersecurity, Bahçesehir University, "stanbul, Turkiye
1 shared publication
Latest Publications
- 26 June 2026
- Published by Istanbul Ticaret Universitesi in İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi
- Vol. 25 (49) , 98-118
A COMPARATIVE STUDY OF SMART CONTRACT PROGRAMMING LANGUAGES: SECURITY, PERFORMANCE, AND OPTIMIZATION TRADE-OFFs
Smart contracts have become a fundamental component of blockchain ecosystems, and their reliability is strongly shaped by the programming languages in which they are written. While prior studies have classified vulnerabilities, fewer have quantitatively examined how language design and secure coding practices affect performance and resilience. To address this gap, this study empirically compares Solidity and Vyper under controlled conditions and complements these experiments with a literature-based evaluation of Rust and Move. Test scenarios included deployment, deposits, withdrawals, arithmetic overflow, reentrancy, and transaction origin misuse. For both vulnerable and secure variants in Solidity and Vyper, metrics such as gas consumption, deployment size, and runtime execution time were collected. The results indicate that deployment costs differ substantially between the two languages (Solidity ≈ 177 k gas vs Vyper ≈ 135 k gas, ~24% lower), whereas runtime performance is mixed: deposit calls are nearly identical (Δ ≈ 0.02 ms), whereas withdraw shows a noticeable gap (Δ ≈ 4.97 ms) favoring Vyper; nevertheless, these call-level differences remain small relative to the larger deployment-time gap. Importantly, secure coding practices such as explicit arithmetic checks and the Checks–Effects–Interactions pattern eliminate critical vulnerabilities while adding less than 1% to the overall execution cost. Although Rust and Move are considered through a literature-based review, they illustrate alternative approaches that embed security guarantees directly into the language. Based on these observations, this study proposes a measurable framework to understand how different smart contract programming languages vary in terms of security and efficiency, emphasizing the role of language design and secure coding practices in shaping contract development.
- 26 June 2026
- Published by Istanbul Ticaret Universitesi in İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi
- Vol. 25 (49) , 98-118
A COMPARATIVE STUDY OF SMART CONTRACT PROGRAMMING LANGUAGES: SECURITY, PERFORMANCE, AND OPTIMIZATION TRADE-OFFs
Smart contracts have become a fundamental component of blockchain ecosystems, and their reliability is strongly shaped by the programming languages in which they are written. While prior studies have classified vulnerabilities, fewer have quantitatively examined how language design and secure coding practices affect performance and resilience. To address this gap, this study empirically compares Solidity and Vyper under controlled conditions and complements these experiments with a literature-based evaluation of Rust and Move. Test scenarios included deployment, deposits, withdrawals, arithmetic overflow, reentrancy, and transaction origin misuse. For both vulnerable and secure variants in Solidity and Vyper, metrics such as gas consumption, deployment size, and runtime execution time were collected. The results indicate that deployment costs differ substantially between the two languages (Solidity ≈ 177 k gas vs Vyper ≈ 135 k gas, ~24% lower), whereas runtime performance is mixed: deposit calls are nearly identical (Δ ≈ 0.02 ms), whereas withdraw shows a noticeable gap (Δ ≈ 4.97 ms) favoring Vyper; nevertheless, these call-level differences remain small relative to the larger deployment-time gap. Importantly, secure coding practices such as explicit arithmetic checks and the Checks–Effects–Interactions pattern eliminate critical vulnerabilities while adding less than 1% to the overall execution cost. Although Rust and Move are considered through a literature-based review, they illustrate alternative approaches that embed security guarantees directly into the language. Based on these observations, this study proposes a measurable framework to understand how different smart contract programming languages vary in terms of security and efficiency, emphasizing the role of language design and secure coding practices in shaping contract development.
- Open Access
- 30 March 2026
- Published by AVES YAYINCILIK A.Ş. in Electrica
- Vol. 26, 1-12
Stability and Error Structure Analysis of Generative Adversarial Network–Based Architectures in Time Series Anomaly Detection
The rapid expansion of Internet of Things ecosystems and interconnected network infrastructures has intensi%ed the need for robust time series anomaly-detection methods. Generative adversarial network (GAN)-based approaches have gained increasing attention due to their capacity to model complex data distributions and learn representations of normal system behavior without explicit supervision. However, adversarial training may introduce instability and sensitivity issues, particularly in sequential anomaly-detection tasks. This study presents a controlled comparative evaluation of three GAN-based architectures, GANAD, N-GAN, and Net-GAN, under uni%ed experimental conditions. All models are assessed on the Numenta Anomaly Benchmark arti%cial time series anomaly benchmark using identical preprocessing and an F1-optimized threshold calibration protocol to ensure methodological consistency. Performance is evaluated across ten random seeds using precision, recall, and F1-score to capture both e&ectiveness and robustness. The results reveal distinct architectural behaviors. The reconstruction-driven GANAD model achieves the highest mean F1-score (approximately 0.32) and maintains stable precision across runs, indicating consistent convergence and controlled false-positive rates. In contrast, the discriminator-centric Net-GAN architecture attains near-complete sensitivity (mean recall ! 0.96) but exhibits substantially reduced precision due to elevated false alarm rates. N-GAN demonstrates intermediate performance with greater variability across initializations, re'ecting sensitivity to adversarial training dynamics. These %ndings highlight an intrinsic stability–sensitivity trade-o& in GAN-based anomaly-detection frameworks. The study provides empirical evidence that architectural design fundamentally determines error structure and operational suitability, o&ering practical insights for deployment-oriented anomaly detection in time series environments. Cite this article as: B. Çorbacıoglu and S. D. Odabaşı, "Stability and error structure analysis of generative adversarial network–based architectures in time series anomaly detection," Electrica, 26, 0062, 2026. doi: 10.5152/electrica.2026.26062.
- 30 March 2026
- Published by AVES YAYINCILIK A.Ş. in Electrica
- Vol. 26, 1-12
Open AccessStability and Error Structure Analysis of Generative Adversarial Network–Based Architectures in Time Series Anomaly Detection
The rapid expansion of Internet of Things ecosystems and interconnected network infrastructures has intensi%ed the need for robust time series anomaly-detection methods. Generative adversarial network (GAN)-based approaches have gained increasing attention due to their capacity to model complex data distributions and learn representations of normal system behavior without explicit supervision. However, adversarial training may introduce instability and sensitivity issues, particularly in sequential anomaly-detection tasks. This study presents a controlled comparative evaluation of three GAN-based architectures, GANAD, N-GAN, and Net-GAN, under uni%ed experimental conditions. All models are assessed on the Numenta Anomaly Benchmark arti%cial time series anomaly benchmark using identical preprocessing and an F1-optimized threshold calibration protocol to ensure methodological consistency. Performance is evaluated across ten random seeds using precision, recall, and F1-score to capture both e&ectiveness and robustness. The results reveal distinct architectural behaviors. The reconstruction-driven GANAD model achieves the highest mean F1-score (approximately 0.32) and maintains stable precision across runs, indicating consistent convergence and controlled false-positive rates. In contrast, the discriminator-centric Net-GAN architecture attains near-complete sensitivity (mean recall ! 0.96) but exhibits substantially reduced precision due to elevated false alarm rates. N-GAN demonstrates intermediate performance with greater variability across initializations, re'ecting sensitivity to adversarial training dynamics. These %ndings highlight an intrinsic stability–sensitivity trade-o& in GAN-based anomaly-detection frameworks. The study provides empirical evidence that architectural design fundamentally determines error structure and operational suitability, o&ering practical insights for deployment-oriented anomaly detection in time series environments. Cite this article as: B. Çorbacıoglu and S. D. Odabaşı, "Stability and error structure analysis of generative adversarial network–based architectures in time series anomaly detection," Electrica, 26, 0062, 2026. doi: 10.5152/electrica.2026.26062.
- Open Access
- 24 February 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (5) , 2173
Enterprise E-Mail Classification Using Instruction-Following Large Language Models
Enterprise e-mail corpora contain heterogeneous and domain-specific content that poses challenges for conventional supervised Natural Language Processing (NLP) approaches due to class imbalance, evolving terminology, and limited labeled data. This study examines the use of instruction-following Large Language Models (LLMs) for enterprise e-mail classification under realistic operational conditions. The study evaluates instruction-based classification and semantic enrichment derived from distributional similarity as two complementary approaches for distinguishing technical from nontechnical messages. The approaches are assessed on a large-scale enterprise e-mail corpus and validated using a manually annotated subset. The results indicate that instruction-following LLMs provide stable contextual reasoning across diverse message structures, while semantic enrichment improves coverage of previously unseen technical expressions. Overall, the study presents an applied NLP framework for enterprise e-mail classification, with attention to interpretability, scalability, and robustness in real-world organizational settings.
- 24 February 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (5) , 2173
Open AccessEnterprise E-Mail Classification Using Instruction-Following Large Language Models
Enterprise e-mail corpora contain heterogeneous and domain-specific content that poses challenges for conventional supervised Natural Language Processing (NLP) approaches due to class imbalance, evolving terminology, and limited labeled data. This study examines the use of instruction-following Large Language Models (LLMs) for enterprise e-mail classification under realistic operational conditions. The study evaluates instruction-based classification and semantic enrichment derived from distributional similarity as two complementary approaches for distinguishing technical from nontechnical messages. The approaches are assessed on a large-scale enterprise e-mail corpus and validated using a manually annotated subset. The results indicate that instruction-following LLMs provide stable contextual reasoning across diverse message structures, while semantic enrichment improves coverage of previously unseen technical expressions. Overall, the study presents an applied NLP framework for enterprise e-mail classification, with attention to interpretability, scalability, and robustness in real-world organizational settings.
- Open Access
- 22 January 2026
- Published by AVES YAYINCILIK A.Ş. in Electrica
- Vol. 26 (1) , 1-13
From Traditional to IoT Based: A Generational Taxonomy and Attack Classification of Supervisory Control and Data Acquisition Syste
Supervisory control and data acquisition (SCADA) systems play a crucial role in managing vital infrastructures, including power generation, distribution networks, waste management, and smart manufacturing. Initially designed as isolated and closed systems, SCADA architectures have evolved by integrating advanced information technologies, enabling enhanced remote management and interoperability. However, this integration significantly broadens the attack surface, increasing vulnerabilities to sophisticated cyber threats that can lead to severe environmental, human, and economic consequences, thus posing a substantial risk to national security. This study systematically categorizes SCADA systems into distinct generations based on core features, including communication protocols, auditing, and integration levels, and emphasizes the necessity of generationspecific vulnerability analyses. By grouping SCADA systems into two main generational categories, the research provides a structured framework for understanding differing security risks and guiding the development of tailored cybersecurity solutions, such as intrusion detection and prevention systems. This generational approach offers critical insights for both academic inquiry and practical defense strategies, facilitating more effective risk mitigation and resilience building in SCADA systems amid an increasingly complex cyber threat landscape. Cite this article as: M. Y. Yağcı, Ş. Durukan-Odabaşı and M. A. Aydın, “From traditional to IoT based: A generational taxonomy and attack classification of supervisory control and data acquisition systems,” Electrica, 2026, 26, 0173, doi: 10.5152/electrica.2026.25173.
- 22 January 2026
- Published by AVES YAYINCILIK A.Ş. in Electrica
- Vol. 26 (1) , 1-13
Open AccessFrom Traditional to IoT Based: A Generational Taxonomy and Attack Classification of Supervisory Control and Data Acquisition Syste
Supervisory control and data acquisition (SCADA) systems play a crucial role in managing vital infrastructures, including power generation, distribution networks, waste management, and smart manufacturing. Initially designed as isolated and closed systems, SCADA architectures have evolved by integrating advanced information technologies, enabling enhanced remote management and interoperability. However, this integration significantly broadens the attack surface, increasing vulnerabilities to sophisticated cyber threats that can lead to severe environmental, human, and economic consequences, thus posing a substantial risk to national security. This study systematically categorizes SCADA systems into distinct generations based on core features, including communication protocols, auditing, and integration levels, and emphasizes the necessity of generationspecific vulnerability analyses. By grouping SCADA systems into two main generational categories, the research provides a structured framework for understanding differing security risks and guiding the development of tailored cybersecurity solutions, such as intrusion detection and prevention systems. This generational approach offers critical insights for both academic inquiry and practical defense strategies, facilitating more effective risk mitigation and resilience building in SCADA systems amid an increasingly complex cyber threat landscape. Cite this article as: M. Y. Yağcı, Ş. Durukan-Odabaşı and M. A. Aydın, “From traditional to IoT based: A generational taxonomy and attack classification of supervisory control and data acquisition systems,” Electrica, 2026, 26, 0173, doi: 10.5152/electrica.2026.25173.
- Open Access
The λ-Fold Spectrum Problem for the Oriented Pentagons
A D-decomposition of a directed graph G is a collection of arc-disjoint subgraphs of G, each isomorphic to D, such that every arc of G belongs to exactly one subgraph. The -fold spectrum problem for a directed graph D asks for the set of all integers v such that the -fold complete symmetric directed graph admits a D-decomposition. A five-cycle (pentagon) has 4 non-isomorphic orientations. The -fold spectrum problem has been solved for one of these oriented pentagons. In this paper, we provide a complete solution for each of the remaining three orientations, proving that the necessary and sufficient condition is in all cases.Open AccessThe λ-Fold Spectrum Problem for the Oriented Pentagons
A D-decomposition of a directed graph G is a collection of arc-disjoint subgraphs of G, each isomorphic to D, such that every arc of G belongs to exactly one subgraph. The -fold spectrum problem for a directed graph D asks for the set of all integers v such that the -fold complete symmetric directed graph admits a D-decomposition. A five-cycle (pentagon) has 4 non-isomorphic orientations. The -fold spectrum problem has been solved for one of these oriented pentagons. In this paper, we provide a complete solution for each of the remaining three orientations, proving that the necessary and sufficient condition is in all cases. - Open Access
The λ-Fold Spectrum Problem for the Orientations of the Eight-Cycle
A D-decomposition of a graph (or digraph) G is a partition of the edge set (or arc set) of G into subsets, where each subset induces a copy of the fixed graph D. Graph decomposition finds motivation in numerous practical applications, particularly in the realm of symmetric graphs, where these decompositions illuminate intricate symmetrical patterns within the graph, aiding in various fields such as network design, and combinatorial mathematics, among various others. Of particular interest is the case where G is , the -fold complete symmetric digraph on v vertices, that is, the digraph with directed edges in each direction between each pair of vertices. For a given digraph D, the set of all values v for which has a D-decomposition is called the -fold spectrum of D. An eight-cycle has 22 non-isomorphic orientations. The -fold spectrum problem has been solved for one of these oriented cycles. In this paper, we provide a complete solution to the -fold spectrum problem for each of the remaining 21 orientations.Open AccessThe λ-Fold Spectrum Problem for the Orientations of the Eight-Cycle
A D-decomposition of a graph (or digraph) G is a partition of the edge set (or arc set) of G into subsets, where each subset induces a copy of the fixed graph D. Graph decomposition finds motivation in numerous practical applications, particularly in the realm of symmetric graphs, where these decompositions illuminate intricate symmetrical patterns within the graph, aiding in various fields such as network design, and combinatorial mathematics, among various others. Of particular interest is the case where G is , the -fold complete symmetric digraph on v vertices, that is, the digraph with directed edges in each direction between each pair of vertices. For a given digraph D, the set of all values v for which has a D-decomposition is called the -fold spectrum of D. An eight-cycle has 22 non-isomorphic orientations. The -fold spectrum problem has been solved for one of these oriented cycles. In this paper, we provide a complete solution to the -fold spectrum problem for each of the remaining 21 orientations. - Open Access
- 28 September 2018
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 26 (5) , 2448-2464
A dynamic channel assignment method for multichannel multiradio wireless mesh networks
- 28 September 2018
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 26 (5) , 2448-2464
Open AccessA dynamic channel assignment method for multichannel multiradio wireless mesh networks