Arslan, Şefik Şuayb
Loading...
Profile URL
Name Variants
Arslan, Şuayb Şefik
Arslan Suayb S.
Arslan, Şuayb Ş.
Arslan , Şuayb Şefik
Arslan Suayb S.
Arslan, Şuayb Ş.
Arslan , Şuayb Şefik
Job Title
Email Address
arslans@mef.edu.tr
Main Affiliation
02.02. Department of Computer Engineering
Status
Current Staff
Website
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
0
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
0
Research Products
8DECENT WORK AND ECONOMIC GROWTH
0
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
0
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
1
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output
43
Articles
17
Views / Downloads
9440/61932
Supervised MSc Theses
0
Supervised PhD Theses
0
WoS Citation Count
127
Scopus Citation Count
197
Patents
11
Projects
3
WoS Citations per Publication
2.95
Scopus Citations per Publication
4.58
Open Access Source
17
Supervised Theses
0
| Journal | Count |
|---|---|
| 26th IEEE Signal Processing and Communications Applications Conference, SIU 2018 | 3 |
| 2021 29th Signal Processing and Communications Applications Conference (SIU) | 2 |
| 2022 7th International Conference on Computer Science and Engineering (UBMK) | 2 |
| IEEE International Symposium on Information Theory (ISIT) -- JUN 26-JUL 01, 2022 -- Espoo, FINLAND | 2 |
| Journal of Vision | 2 |
Current Page: 1 / 7
Scopus Quartile Distribution
Competency Cloud
43 results
Scholarly Output Search Results
Now showing 1 - 10 of 43
Article Citation - WoS: 3Citation - Scopus: 3Exact Construction of Bs-Assisted Mscr Codes With Link Constraints(IEEE Communications Letters, 2021) Arslan, Şuayb ŞefikIt is clear that 5G network resources would be consumed by heavy data traffic owing to increased mobility, slicing, and layered/distributed storage system architecture. The problem is elevated when multiple node failures are repaired to address service quality requirements. Typical approaches include individual or cooperative data regeneration to efficiently utilize the available bandwidth. It is observed that storage systems of 5G and beyond technologies shall have a multi–layer architecture in which base stations (BS) would be present. Moreover, communication with each layer would be subject to various communication costs and link constraints. Under limited BS assistance and cooperation, the trade-off between storage per node and communication bandwidth has been established. In this trade–off, two operating points, namely minimum storage, and bandwidth regeneration are particularly important. In this study, we first identify the optimal number of BS use at the minimum storage regeneration point. An explicit code construction is provided subsequently for the exact minimum storage regeneration whereby each layer may help the repair process subject to a communication link constraint.Conference Object Citation - WoS: 1Citation - Scopus: 1Adaptive Boosting of Dnn Ensembles for Brain-Computer Interface Spellers(IEEE, 2021) Çatak, Yiğit; Aksoy, Can; Özkan, Hüseyin; Güney, Osman Berke; Koç, Emirhan; Arslan, Şuayb ŞefikSteady-state visual evoked potentials (SSVEP) are commonly used in brain computer interface (BCI) applications such as spelling systems, due to their advantages over other paradigms. In this study, we develop a method for SSVEP-based BCI speller systems, using a known deep neural network (DNN), which includes transfer and ensemble learning techniques. We test performance of our method on publicly available benchmark and BETA datasets with leave-one-subject-out procedure. Our method consists of two stages. In the first stage, a global DNN is trained using data from all subjects except one subject that is excluded for testing. In the second stage, the global model is fine-tuned to each subject whose data are used in the training. Combining the responses of trained DNNs with different weights for each test subject, rather than an equal weight, provide better performance as brain signals may differ significantly between individuals. To this end, weights of DNNs are learnt with SAMME algorithm with using data belonging to the test subject. Our method significantly outperforms canonical correlation analysis (CCA) and filter bank canonical correlation analysis (FBCCA) methods.yl-bitirme-projesi.listelement.badge The Passanger Load Factor Prediction of Airline Transport(MEF Üniversitesi, Fen Bilimleri Enstitüsü, 2017) Karakoç, Kalender; Arslan, Şuayb Ş.Turkish Airlines is one of the most preferred leading European air carriers with global network coverage thanks to its strict compliance with flight safety, reliability, product line, service quality and competitiveness. Turkish Airlines maintains its identity as the flag carrier of Turkey.Conference Object Citation - Scopus: 1Improved Bounds on the Moments of Guessing Cost(IEEE, 2022) Arslan, Suayb S.; Haytaoglu, ElifGuessing a random variable with finite or countably infinite support in which each selection leads to a positive cost value has recently been studied within the context of "guessing cost". In those studies, similar to standard guesswork, upper and lower bounds for the rho-th moment of guessing cost are described in terms of the known measure Renyi's entropy. In this study, we non-trivially improve the known bounds using previous techniques along with new notions such as balancing cost. We have demonstrated that the novel lower bound proposed in this work, achieves 5.84%, 18.47% higher values than that of the known lower bound for rho = 1 and rho = 5, respectively. As for the upper bound, the novel expression provides 10.93%, 5.54% lower values than that of the previously presented bounds for rho = 1 and rho = 5, respectively.yl-bitirme-projesi.listelement.badge Loaction Based Recommendation System Using Flickr Geotagged Photos(MEF Üniversitesi, Fen Bilimleri Enstitüsü, 2018) Çakar, Erbil; Arslan, Şuayb Ş.Flickr is a worldwide photo sharing application. In this project, photos with location information provided by Flickr will be used. By utilizing this location information, a recommendation system that recommends users the most suitable photo shooting locations based on their historical data will be designed. During this system design phase, different methodologies will be tried and a research will be conducted on the methods that provide the most appropriate solution to the problem.yl-bitirme-projesi.listelement.badge Humpback Whale Indentification With Convolutional Neural Networks(MEF Üniversitesi, Fen Bilimleri Enstitüsü, 2018) Can, Duygu; Arslan, Şuayb Ş.The migration patterns of humpback whales are tracked with conventional photoidentification techniques for decades. The distinct markings on whale flukes serve as unique fingerprints for these creatures. This study aims to identify humpback whales according to their fluke images using ResNET, a deep neural network architecture to help the conservation efforts for this endangered species by automatizing the process. We experimented with different train/test split schemes and initializations to obtain the best classifying model. Although we were limited with a small sized training set of 200 images, using state-of-the-art image processing and data augmentation methods we obtained a high accuracy of 0.94 for 11 distinct whales. This project is served as an friendly interface to dive deep into the field of image recognition with Convolutional Neural Networks.Article Minimum Repair Bandwidth Ldpc Codes for Distributed Storage Systems(IEEE, 2023) Pourmandi, Massoud; Pusane, Ali Emre; Arslan , Şuayb Şefik; Haytaoğlu, ElifIn distributed storage systems (DSS), an optimal code design must meet the requirements of efficient local data regeneration in addition to reliable data retention. Recently, lowdensity parity-check (LDPC) codes have been proposed as a promising candidate that can secure high data rates as well as low repair bandwidth while maintaining low complexity in data reconstruction. The main objective of this study is to optimize the repair bandwidth characteristics of LDPC code families for a DSS application while meeting the data reliability requirements. First, a data access scenario in which nodes contact other available nodes randomly to download data is examined. Later, a minimum-bandwidth protocol is considered in which nodes make their selections based on the degree numbers of check nodes. Through formulating optimization problems for both protocols, a fundamental trade-off between the decoding threshold and the repair bandwidth is established for a given code rate. Finally, conclusions are confirmed by numerical results showing that irregular constructions have a large potential for establishing optimized LDPC code families for DSS applications.Conference Object Next-Generation Data Storage: Transistor and Dna(Institute of Electrical and Electronics Engineers Inc., 2018) Pusane, Ali E.; Arslan, Şuayb Şefik; Ashrafi, Reza A.With the generation of diverse data growing at exponential rates, investigating better digital storage media is inevitable. Currently, one solution is the utilization of solid-state based memory devices, which offer several desirable characteristics, including very fast write/read operations, scalability, and reduced fabrication costs. However, with the increased need for long term and large storage space, their data retention capabilities drastically decline. Another emerging storage technology on the horizon is the biotechnological based DNA storage, which renders a phenomenal storage capacities. In this paper, basics of these two promising storage technologies are reviewed and their potential future trends are discussed. © 2018 IEEE.Conference Object Fault-Tolerant Strassen-Like Matrix Multiplication(IEEE, 2020) Arslan, Şuayb Şefik; Güney, Osman B.; Oblokulov, MuhtashamIn this study, we propose a simple method for fault-tolerant Strassen-like matrix multiplications. The proposed method is based on using two distinct Strassen-like algorithms instead of replicating a given one. We have realized that using two different algorithms, new check relations arise resulting in more local computations. These local computations are found using computer aided search. To improve performance, special parity (extra) sub-matrix multiplications (PSMMs) are generated (two of them) at the expense of increasing communication/computation cost of the system. Our preliminary results demonstrate that the proposed method outperforms a Strassen-like algorithm with two copies and secures a very close performance to three copy version using only 2 PSMMs, reducing the total number of compute nodes by around 24% i.e., from 21 to 16.Conference Object Citation - WoS: 3Citation - Scopus: 3A Joint Dedupe-Fountain Coded Archival Storage(IEEE, 2017) Arslan, Şuayb Şefik; Göker, Turguy; Wideman, RodAn erasure-coded archival file storage system is presented using a chunk-based deduplication mechanism and fountain codes for space/time efficient operation. Unlike traditional archival storage, this proposal considers the deduplication operation together with correction coding in order to provide a reliable storage solution. The building blocks of deduplication and fountain coding processes are judiciously interleaved to present two novel ideas, reducing memory footprint with weaker hashing and dealing with the increased collisions using correction coding, and applying unequal error protection to deduplicated chunks for increased availability. The combination of these two novel ideas made the performance of the proposed system stand out. For example, it is shown to outperform one of the replication-based as well as RAID data protection schemes. The proposed system also addresses some of the fundamental challenges of today's low-cost deduplicated data storage systems such as hash collisions, disk bottleneck and RAM overflow problems, securing savings up to 90% regular RAM use.
