Bilgisayar Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940
Browse
4 results
Search Results
Article Citation - Scopus: 1A New Benchmark Dataset for P300 Erp-Based Bci Applications(Academic Press Inc Elsevier Science, 2023-04-01) Ç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: 3Citation - Scopus: 3Array Bp-Xor Codes for Hierarchically Distributed Matrix Multiplication(IEEE, 2022-03-01) Arslan, Şuayb ŞefikA novel fault-tolerant computation technique based on array Belief Propagation (BP)-decodable XOR (BP-XOR) codes is proposed for distributed matrix-matrix multiplication. The proposed scheme is shown to be configurable and suited for modern hierarchical compute architectures such as Graphical Processing Units (GPUs) equipped with multiple nodes, whereby each has many small independent processing units with increased core-to-core communications. The proposed scheme is shown to outperform a few of the well–known earlier strategies in terms of total end-to-end execution time while in presence of slow nodes, called stragglers. This performance advantage is due to the careful design of array codes which distributes the encoding operation over the cluster (slave) nodes at the expense of increased master-slave communication. An interesting trade-off between end-to-end latency and total communication cost is precisely described. In addition, to be able to address an identified problem of scaling stragglers, an asymptotic version of array BP-XOR codes based on projection geometry is proposed at the expense of some computation overhead. A thorough latency analysis is conducted for all schemes to demonstrate that the proposed scheme achieves order-optimal computation in both the sublinear as well as the linear regimes in the size of the computed product from an end-to-end delay perspective.Article Citation - WoS: 5Citation - Scopus: 7Founsure 1.0: an Erasure Code Library With Efficient Repair and Update Features(Elsevier, 2021-01-01) Arslan, Şuayb ŞefikFounsure is an open-source software library that implements a multi-dimensional graph-based erasure coding entirely based on fast exclusive OR (XOR) logic. Its implementation utilizes compiler optimizations and multi-threading to generate the right assembly code for the given multi-core CPU architecture with vector processing capabilities. Founsure possesses important features that shall find various applications in modern data storage, communication, and networked computer systems, in which the data needs protection against device, hardware, and node failures. As data size reached unprecedented levels, these systems have become hungry for network bandwidth, computational resources, and average consumed power. To address that, the proposed library provides a three-dimensional design space that trades off the computational complexity, coding overhead, and data/node repair bandwidth to meet different requirements of modern distributed data storage and processing systems. Founsure library enables efficient encoding, decoding, repairs/rebuilds, and updates while all the required data storage and computations are distributed across the network nodes.Article Citation - Scopus: 1On the Distribution of the Threshold Voltage in Multi-Level Cell Flash Memories(Elsevier, 2019-10-01) Pusane, Ali E; Ashrafi, Reza A; Arslan, Şuayb ŞefikIn Multi-Level Cell (MLC) memories, multiple bits of information are packed within the cell to enable higher capacity and lower cost of manufacturing compared to those of the single-level cell flash. However, because of heavy information packing, MLC memories suffer from several error sources including inter-cell interference, retention error, and random telegraph noise which make their lifetime shorter. Having so many error sources that are statistically hard to characterize makes it challenging to properly derive the underlying probability distribution of the sensed threshold voltage, which is vital for finding optimal decision rules to secure better detection performance and hence better lifetime. Although several recent works have already considered this problem, they mostly recourse to few loose assumptions that are far from being realistic. In this study, a more comprehensive/general analysis is conducted to derive the probability density function of the final sensed voltage, and through realistic simplifications, closed form expressions are presented. Extensive computer simulations corroborate the accuracy of the derived analytical expressions, and we think they shall be essential for accurately estimating the reliability and the overall lifetime of modern MLC memories.