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
11
SUSTAINABLE CITIES AND COMMUNITIES
1
Research Products
15
LIFE ON LAND
1
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
9332/59661
Supervised MSc Theses
3
Supervised PhD Theses
0
WoS Citation Count
123
Scopus Citation Count
194
WoS h-index
5
Scopus h-index
7
Patents
11
Projects
3
WoS Citations per Publication
2.86
Scopus Citations per Publication
4.51
Open Access Source
17
Supervised Theses
3
Google Analytics Visitor Traffic
| 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
Scholarly Output Search Results
Now showing 1 - 10 of 43
Article Comparing Humans and Deep Neural Networks on Face Recognition Under Various Distance and Rotation Viewing Conditions(Journal of Vision, 2023) Fux, Michal; Arslan , Şuayb Şefik; Jang, Hojin; Boix, Xavier; Cooper, Avi; Groth, Matt J; Sinha, PawanHumans possess impressive skills for recognizing faces even when the viewing conditions are challenging, such as long ranges, non-frontal regard, variable lighting, and atmospheric turbulence. We sought to characterize the effects of such viewing conditions on the face recognition performance of humans, and compared the results to those of DNNs. In an online verification task study, we used a 100 identity face database, with images captured at five different distances (2m, 5m, 300m, 650m and 1000m) three pitch values (00 - straight ahead, +/- 30 degrees) and three levels of yaw (00, 45, and 90 degrees). Participants were presented with 175 trials (5 distances x 7 yaw and pitch combinations, with 5 repetitions). Each trial included a query image, from a certain combination of range x yaw x pitch, and five options, all frontal short range (2m) faces. One was of the same identity as the query, and the rest were the most similar identities, chosen according to a DNN-derived similarity matrix. Participants ranked the top three most similar target images to the query image. The collected data reveal the functional relationship between human performance and multiple viewing parameters. Nine state-of-the-art pre-trained DNNs were tested for their face recognition performance on precisely the same stimulus set. Strikingly, DNN performance was significantly diminished by variations in ranges and rotated viewpoints. Even the best-performing network reported below 65% accuracy at the closest distance with a profile view of faces, with results dropping to near chance for longer ranges. The confusion matrices of DNNs were generally consistent across the networks, indicating systematic errors induced by viewing parameters. Taken together, these data not only help characterize human performance as a function of key ecologically important viewing parameters, but also enable a direct comparison of humans and DNNs in this parameter regimeConference Object Citation - WoS: 2Citation - Scopus: 2Implementation of Multi-Threaded Erasure Coding Under Multi-Processing Environments(2016) Arslan, Şuayb ŞefikGalois alan aritmetiği depolama ve iletişim cihazlarını veri kayıplarına karşı korumak için Reed-Solomon silme kodlarının temelini oluşturmaktadır. Galois alan aritmeti^ginin en güncel uygulamaları hızlı Galois alan hesaplamaları yapmamıza imkan sağlayan Intel’in SIMD eklerinde olduğu gibi 128-bitlik işlemci vektör talimatlarına dayanmaktadır. Buna rağmen, bu uygulamalar çoklu–dizin ve çoklu–süreçli ortamlara göre optimize edilmemiştir. Diğer taraftan, sunucuların çoklu istekleri eş zamanlı olarak yerine getirmesi ve donanımın sağladığı tüm paralelliği kodlama yükünü etkili yürütmek için kullanması arzu edilmektedir. Bu makale silme kodlarının çoklu-dizin işlemcilerle çoklu–süreçli ortamlarda nasıl kullanılaca^gının detaylarını sunmakta ve tek dizinli uygulamalara göre emtia mikro işlemciler ve Jerasure 2.0 yazılım kütüphanesini kullanarak önemli ölçüde performans artışının olabileceğini göstermektedir.Article Cooperative Network Coding for Distributed Storage Using Base Stations With Link Constraints(arXiv, 2021) Arslan, Şuayb Şefik; Pourmandi, Massoud; Haytaoğlu, ElifIn this work, we consider a novel distributed data storage/caching scenario in a cellular setting where multiple nodes may fail/depart at the same time. In order to maintain the target reliability, we allow cooperative regeneration of lost nodes with the help of base stations allocated in a set of hierarchical layers. Due to this layered structure, a symbol download from each base station has a different cost, while the link capacities connecting the nodes of the cellular system and the base stations are also limited. In this more practical and general scenario, we present the fundamental trade-off between repair bandwidth cost and the storage space per node. Particularly interesting operating points are the minimum storage as well as bandwidth cost points in this trade-off curve. We provide closed-form expressions for the corresponding bandwidth (cost) and storage space per node for these operating points. Finally, we provide an explicit optimal code construction for the minimum storage regeneration point for a given set of system parameters.Conference Object Citation - WoS: 2Citation - Scopus: 5Mojette Transform Based Ldpc Erasure Correction Codes for Distributed Storage Systems(2017) Arslan, Şuayb Şefik; Normand, Nicolas; Parrein, BenoitMojette Transform (MT) based erasure correction coding possesses extremely efficient encoding/decoding algorithms and demonstrate promising burst erasure recovery performance. MT codes are based on discrete geometry and provide redundancy through creating projections. Projections are made of smaller data structures called bins and are generated from a two dimensional convex-shaped data. For exact data recovery, only a subset of projections are needed by the decoder. We realize that the discrete geometry definition of MT erasure codes corresponds to creating structured/deterministic generator matrices. In this study, we show an alternative Low Density Parity Check (LDPC) code construction methodology through investigating parity check matrices of MT codes which shows sparseness as the blocklength of the code gets large. In a distributed storage setting, we also quantify the repair bandwidth and show that this novel interpretation can be used to facilitate bin-level local repairs.Conference Object Citation - WoS: 2Citation - Scopus: 2Distributed Matrix Multiplication With Mds Array Bp-Xor Codes for Scaling Clusters(IEEE, 2019) Arslan, Şuayb ŞefikThis study presents a novel coded computation technique for distributed matrix-matrix product computation at a massive scale that outperforms well known previous strategies in terms of total execution time. Our method achieves this performance by distributing the encoding operation over the cluster (slave) nodes at the expense of increased master-slave communication. The product computation is performed using MDS array Belief Propagation (BP)-decodable codes based on pure XOR operations. In addition, our scheme is configurable and suited for modern compute node architectures equipped with multiple processing units organized in a hierarchical manner. Assuming the number of backup nodes being sublinear in the size of the product, we shall demonstrate that the proposed scheme achieves order-optimal computation from an end-to-end latency perspective while ensuring acceptable communication requirements that can be addressed by today's high speed network link infrastructures.Article A New Benchmark Dataset for P300 Erp-Based Bci Applications(Academic Press Inc Elsevier Science, 2023) Çakar, Tuna; Özkan, Hüseyin; Musellim, Serkan; Arslan, Suayb S.; Yağan, Mehmet; Alp, NihanBecause of its non-invasive nature, one of the most commonly used event-related potentials in brain -computer interface (BCI) system designs is the P300 electroencephalogram (EEG) signal. The fact that the P300 response can easily be stimulated and measured is particularly important for participants with severe motor disabilities. In order to train and test P300-based BCI speller systems in more realistic high-speed settings, there is a pressing need for a large and challenging benchmark dataset. Various datasets already exist in the literature but most of them are not publicly available, and they either have a limited number of participants or utilize relatively long stimulus duration (SD) and inter-stimulus intervals (ISI). They are also typically based on a 36 target (6 x 6) character matrix. The use of long ISI, in particular, not only reduces the speed and the information transfer rates (ITRs) but also oversimplifies the P300 detection. This leaves a limited challenge to state-of-the-art machine learning and signal processing algorithms. In fact, near-perfect P300 classification accuracies are reported with the existing datasets. Therefore, one certainly needs a large-scale dataset with challenging settings to fully exploit the recent advancements in algorithm design (machine learning and signal processing) and achieve high-performance speller results. To this end, in this article we introduce a new freely-and publicly-accessible P300 dataset obtained using 32-channel EEG, in the hope that it will lead to new research findings and eventually more efficient BCI designs. The introduced dataset comprises 18 participants performing a 40 -target (5 x 8) cued-spelling task, with reduced SD (66.6 ms) and ISI (33.3 ms) for fast spelling. We have also processed, analyzed, and character-classified the introduced dataset and we presented the accuracy and ITR results as a benchmark. The introduced dataset and the codes of our experiments are publicly accessible at https://data .mendeley.com /datasets /vyczny2r4w.(c) 2023 Elsevier Inc. All rights reserved.Article Citation - WoS: 27Citation - Scopus: 30Service-Aware Multi-Resource Allocation in Software-Defined Next Generation Cellular Networks(2018) Arslan, Şuayb Şefik; Zeydan, Engin; Narmanloğlu, ÖmerNetwork slicing is one of the major solutions needed to meet the requirements of next generation cellular networks, under one common network infrastructure, in supporting multiple vertical services provided by mobile network operators. Network slicing makes one shared physical network infrastructure appear as multiple logically isolated virtual networks dedicated to different service types where each Network Slice (NS) benefits from on-demand allocated resources. Typically, the available resources distributed among NSs are correlated and one needs to allocate them judiciously in order to guarantee the service, MNO, and overall system qualities. In this paper, we consider a joint resource allocation strategy that weights the significance of the resources per a given NS by leveraging the correlation structure of different quality-of-service (QoS) requirements of the services. After defining the joint resource allocation problem including the correlation structure, we propose three novel scheduling mechanisms that allocate available network resources to the generated NSs based on different type of services with different QoS requirements. Performance of the proposed schedulers are then investigated through Monte-Carlo simulations and compared with each other as well as against a traditional max-min fairness algorithm benchmark. The results reveal that our schedulers, which have different complexities, outperform the benchmark traditional method in terms of service-based and overall satisfaction ratios, while achieving different fairness index levels.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(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.
