Browsing by Author "Arslan, Suayb S."

Now showing 1 - 5 of 5

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, Nihan
Because 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.
Citation - WoS: 1
Citation - Scopus: 1
Base Station-Assisted Cooperative Network Coding for Cellular Systems With Link Constraints
(IEEE, 2022) Arslan, Suayb S.; Pourmandi, Massoud; Haytaoglu, Elif
We consider a novel distributed data storage/caching scenario in a cellular network, where multiple nodes may fail/depart simultaneously To meet reliability, we allow cooperative regeneration of lost nodes with the help of base stations allocated in a set of hierarchical layers1. Due to this layered structure, a symbol download from each base station has a different cost, while the link capacities between the nodes of the cellular system and the base stations are also constrained. Under such a setting, we formulate the fundamental trade-off with closed form expressions between repair bandwidth cost and the storage space per node. Particularly, the minimum storage as well as bandwidth cost points are formulated. Finally, we provide an explicit optimal code construction for the minimum storage regeneration point for a special set of system parameters.
Fault-Tolerant Strassen-Like Matrix Multiplication
(IEEE, 2020) Oblokulov, Muhtasham; Arslan, Suayb S.; Guney, Osman B.
In 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.
Citation - Scopus: 1
Improved Bounds on the Moments of Guessing Cost
(IEEE, 2022) Arslan, Suayb S.; Haytaoglu, Elif
Guessing 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.
Citation - Scopus: 2
Ssqem: Semi-Supervised Quantum Error Mitigation
(IEEE, 2022) Sayar, Alperen; Arslan Suayb S.; Çakar Tuna; Arslan, Suayb S.; Cakar, Tuna
One of the fundamental obstacles for quantum computation (especially in noisy intermediate-scale quantum (NISQ) era) to be a near-term reality is the manufacturing gate/measurement technologies that make the system state quite fragile due to decoherence. As the world we live in is quite far away from the ideal, complex particle-level material imperfections due to interactions with the environment are an inevitable part of the computation process. Hence keeping the accurate state of the particles involved in the computation becomes almost impossible. In this study, we posit that any physical quantum computer sys-tem manifests more multiple error source processes as the number of qubits as well as depth of the circuit increase. Accordingly, we propose a semi-supervised quantum error mitigation technique consisting of two separate stages each based on an unsupervised and a supervised machine learning model, respectively. The proposed scheme initially learns the error types/processes and then compensates the error due to data processing and the projective measurement all in the computational basis. © 2022 IEEE.