Safak Durukan Odabasi

Dr. Safak Durukan Odabasi

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 August 2025 in SoftwareX
Verified
Journal Article
Open access
MYM.F. Yuce
M.F. Yuce
OKO. Keskin
O. Keskin
EYE. Yerlikaya
E. Yerlikaya
MAM.Y. Akmaz
M.Y. Akmaz
AKA. Kirca
A. Kirca
MAMuhammed Ali AYDIN
Muhammed Ali AYDIN

18 October 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
SOSafak Durukan Odabasi
Safak Durukan Odabasi
UOUğur Odabaşı
Uğur Odabaşı
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 K*λKv*, 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 K*λKv* 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.

24 February 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ASAhmet Çağrı Sarıyıldız
Ahmet Çağrı Sarıyıldız
SOSafak Durukan Odabasi
Safak Durukan Odabasi
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.

22 January 2026 in Electrica
Verified
Journal Article
Open access
PDF file
SOSafak Durukan Odabasi
Safak Durukan Odabasi
MYMeh YA
Meh YA
MAMuhammed Ali AYDIN
Muhammed Ali AYDIN
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.

28 September 2018 in Turkish Journal of Electrical Engineering and Computer Sciences
Verified
Journal Article
Open access
SOSafak Durukan Odabasi
Safak Durukan Odabasi
AZA. Halim Zaim
A. Halim Zaim

26 June 2026 in İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi
Verified
Journal Article
Closed access
HÖHüseyin Ahmet Cemil Özaslan
Hüseyin Ahmet Cemil Özaslan
SOSafak Durukan Odabasi
Safak Durukan Odabasi
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.