# Electrical & Computer Engineering Research Works

## Permanent URI for this collection

## Browse

### Browsing Electrical & Computer Engineering Research Works by Author "Arasli, Batuhan"

Now showing 1 - 4 of 4

###### Results Per Page

###### Sort Options

Item Dynamic Infection Spread Model Based Group Testing(MDPI, 2023-01-02) Arasli, Batuhan; Ulukus, SennurGroup testing idea is an efficient approach to detect prevalence of an infection in the test samples taken from a group of individuals. It is based on the idea of pooling the test samples and performing tests to the mixed samples. This approach results in possible reduction in the required number of tests to identify infections. Classical group testing works consider static settings where the infection statuses of the individuals do not change throughout the testing process. In our paper, we study a dynamic infection spread model, inspired by the discrete time SIR model, where infections are spread via non-isolated infected individuals, while infection keeps spreading over time, a limited capacity testing is performed at each time instance as well. In contrast to the classical, static group testing problem, the objective in our setup is not to find the minimum number of required tests to identify the infection status of every individual in the population, but to control the infection spread by detecting and isolating the infections over time by using the given, limited number of tests. In order to analyze the performance of the proposed algorithms, we focus on the average-case analysis of the number of individuals that remain non-infected throughout the process of controlling the infection. We propose two dynamic algorithms that both use given limited number of tests to identify and isolate the infections over time, while the infection spreads, while the first algorithm is a dynamic randomized individual testing algorithm, in the second algorithm we employ the group testing approach similar to the original work of Dorfman. By considering weak versions of our algorithms, we obtain lower bounds for the performance of our algorithms. Finally, we implement our algorithms and run simulations to gather numerical results and compare our algorithms and theoretical approximation results under different sets of system parameters.Item Dynamic SAFFRON: Disease Control Over Time via Group Testing(MDPI, 2022-11-21) Arasli, Batuhan; Ulukus, SennurGroup testing is an efficient algorithmic approach to the infection identification problem, based on mixing the test samples and testing the mixed samples instead of individually testing each sample. In this paper, we consider the dynamic infection spread model that is based on the discrete SIR model, which assumes the disease to be spread over time via infected and non-isolated individuals. In our system, the main objective is not to minimize the number of required tests to identify every infection, but instead, to utilize the available, given testing capacity T at each time instance to efficiently control the infection spread. We introduce and study a novel performance metric, which we coin as 𝜖-disease control time. This metric can be used to measure how fast a given algorithm can control the spread of a disease. We characterize the performance of the dynamic individual testing algorithm and introduce a novel dynamic SAFFRON-based group testing algorithm. We present theoretical results and implement the proposed algorithms to compare their performances.Item Group Testing with a Graph Infection Spread Model(MDPI, 2023-01-12) Arasli, Batuhan; Ulukus, SennurThe group testing idea is an efficient infection identification approach based on pooling the test samples of a group of individuals, which results in identification with less number of tests than individually testing the population. In our work, we propose a novel infection spread model based on a random connection graph which represents connections between n individuals. Infection spreads via connections between individuals, and this results in a probabilistic cluster formation structure as well as non-i.i.d. (correlated) infection statuses for individuals. We propose a class of two-step sampled group testing algorithms where we exploit the known probabilistic infection spread model. We investigate the metrics associated with two-step sampled group testing algorithms. To demonstrate our results, for analytically tractable exponentially split cluster formation trees, we calculate the required number of tests and the expected number of false classifications in terms of the system parameters, and identify the trade-off between them. For such exponentially split cluster formation trees, for zero-error construction, we prove that the required number of tests is 𝑂(log2𝑛) . Thus, for such cluster formation trees, our algorithm outperforms any zero-error non-adaptive group test, binary splitting algorithm, and Hwang’s generalized binary splitting algorithm. Our results imply that, by exploiting probabilistic information on the connections of individuals, group testing can be used to reduce the number of required tests significantly even when the infection rate is high, contrasting the prevalent belief that group testing is useful only when the infection rate is low.Item The Capacity of Private Information Retrieval from Decentralized Uncoded Caching Databases(MDPI, 2019-11-28) Wei, Yi-Peng; Arasli, Batuhan; Banawan, Karim; Ulukus, SennurWe consider the private information retrieval (PIR) problem from decentralized uncoded caching databases. There are two phases in our problem setting, a caching phase, and a retrieval phase. In the caching phase, a data center containing all the K files, where each file is of size L bits, and several databases with storage size constraint 𝜇𝐾𝐿 bits exist in the system. Each database independently chooses 𝜇𝐾𝐿 bits out of the total 𝐾𝐿 bits from the data center to cache through the same probability distribution in a decentralized manner. In the retrieval phase, a user (retriever) accesses N databases in addition to the data center, and wishes to retrieve a desired file privately. We characterize the optimal normalized download cost to be 𝐷∗=∑𝑁+1𝑛=1(𝑁𝑛−1)𝜇𝑛−1(1−𝜇)𝑁+1−𝑛(1+1𝑛+⋯+1𝑛𝐾−1). We show that uniform and random caching scheme which is originally proposed for decentralized coded caching by Maddah-Ali and Niesen, along with Sun and Jafar retrieval scheme which is originally proposed for PIR from replicated databases surprisingly results in the lowest normalized download cost. This is the decentralized counterpart of the recent result of Attia, Kumar, and Tandon for the centralized case. The converse proof contains several ingredients such as interference lower bound, induction lemma, replacing queries and answering string random variables with the content of distributed databases, the nature of decentralized uncoded caching databases, and bit marginalization of joint caching distributions.