http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/60 Post graduate dissertations (Theses) of Computer Science Engineering (CSE) 2026-04-06T08:54:07Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/7309 Quantifying pathological progression from single-cell transcriptomics data Dr. Mohammad Saifur Rahman; Samin Rahman Khan; 0422052003; 006.31/SAM/2025 The surge in single-cell datasets and reference atlases has enabled the comparison of cell states across conditions, yet a gap persists in quantifying pathological shifts from healthy cell states. To address this gap, we introduce single-cell Pathological Shift Scoring (scPSS), which provides a statistical measure for how much a “query” cell from a diseased sample has shifted away from a reference group of healthy cells. In scPSS, the distance of a cell to its k-th nearest reference cell is considered as its pathological shift score. Euclidean distances in the top n principal component space of the gene expressions are used to measure distances between cells. The distribution of shift scores of the reference cells forms a null model. This allows a p-value to be assigned to each query cell’s shift score, quantifying its statistical significance of being in the reference cell group. This makes our method both simple and statistically rigorous. The key strength scPSS is its applicability in a “semi-supervised” setting, where only healthy reference cells are known and diseased-labeled data are not provided for model training. As existing methods do not support cell-level pathological progression measurement in this setting, we adapt state-of-the-art supervised pathological prediction and contrastive models for benchmarking. Comparative evaluations against these adapted models demonstrate our method’s superiority in accuracy and efficiency. Additionally, we have also shown that the aggregation of cell-level pathological scores from scPSS can be used to predict health conditions at the individual level. The code for scPSS is available at https://github.com/SaminRK/scPSS. 2025-06-21T00:00:00Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/7185 Multi-agent code generation approach for competitive problem solving Ali, Dr. Mohammed Eunus; Ashraful Islam, Md.; 0422052007; 005.453/ASH/2025 Code synthesis, which requires a deep understanding of complex natural language (NL) problem descriptions, generation of code instructions for complex algorithms and data structures, and the successful execution of comprehensive unit tests, presents a significant challenge. Thus, while large language models (LLMs) demonstrate impressive proficiency in natural language processing (NLP), their performance in code generation tasks remains limited. In this thesis, we introduce a new approach to code generation tasks leveraging the multi- agent prompting that uniquely replicates the full cycle of program synthesis as observed in human developers. Our framework, MapCoder, consists of four LLM agents specifically designed to emulate the stages of this cycle: recalling relevant examples, planning, code generation, and debugging. After conducting thorough experiments, with multiple LLMs ablations and analyses across eight challenging competitive problem-solving and program synthesis benchmarks—MapCoder showcases remarkable code generation capabilities, achieving their new state-of-the-art (pass@1) results—(HumanEval 93.9%, MBPP 83.1%, APPS 22.0%, CodeContests 28.5%, and xCodeEval 45.3%). Moreover, our method consistently delivers superior performance across various programming languages and varying problem difficulties. We open-source our framework at https://github.com/Md-Ashraful-Pramanik/MapCoder. 2025-01-19T00:00:00Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/7184 Stroke prediction using ensemble learning with clinical and image features Shahriyar, Dr. Rifat; Jannatul Ferdous, Most.; 0417052080; 006.31/JAN/2024 A stroke is a life-threatening brain attack that disrupts blood flow into the brain. As a result, brain cells start to die due to a lack of oxygen and nutrients. After a stroke, every minute is most important. Approximately 1.9 million brain cells die per minute. Early diagnosis of stroke can save the life of a stroke patient or can reduce the permanent damage to the brain. For earlier stroke detection, an initial investigation uses the patient’s clinical information. Then, doctors advise computed tomography images of the brain. If doctors delay diagnosis or may make erroneous diagnoses, this can be a life-threatening issue. For that reason, an automatic diagnosis of stroke from clinical data initially and then finally from a brain CT scan image will be beneficial for stroke patients. For the clinical data, we have applied different machine learning models, such as Logistic Regression, Decision Tree, K-Nearest Neighbour, Ada-Boost, Xg-Boost, and others. In the case of clinical data, three balancing techniques: Random Oversampling, SMOTE, and ADASYN are employed and also record the performance of individual models. For the brain CT image data, we have moderated three pre-trained CNN models named Inceptionv3, MobileNetv2, and Xception by updating the top layer of those models using the transfer learning technique. A new ensemble convolutional neural network model named ENSNET is proposed for automatic brain stroke prediction from brain CT scan images. ENSNET is the average of two improved CNN models named Inceptionv3 and Xception. We have used accuracy, precision, recall, f1- score, confusion matrix, accuracy vs. epoch, loss vs. epoch, and ROC curve as performance evaluation matrices. The accuracy of the moderated Inceptionv3 is 97.48%, the moderated MobileNetv2 is 83.29%, and the moderated Xception is 96.11%. However, when it comes to diagnosing stroke from brain CT scans, the proposed ensemble model ENSNET outperforms the other models, offering 98.86% accuracy, 97.71% precision, 98.46% recall, 98.08% f1-score, and 98.74% AUC. This proposed ensemble model (ENSNET) is validated by using another two datasets. So, the proposed ENSNET model will be beneficial for the health sector in detecting stroke from the brain-computed tomography images of the brain more successfully than other models. 2024-11-24T00:00:00Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/7181 Efficient computation of trip-based group nearest neighbor queries Hashem, Dr. Tanzima; Zaman, Shahiduz; 1018052058; 006.31/SHA/2024 In recent years, organizing group meetups for entertainment or other necessities has gained significant importance, especially given the busy nature of daily schedules. People often combine multiple activities, such as dropping kids off at school, commuting to work, and grocery shopping, while seeking opportunities to meet others. To address this need, we propose a novel query type, the Trip-based Group Nearest Neighbor (T-GNN) query, which identifies the optimal meetup Point of Interest (POI) that aligns with users’ existing trips. An individual trip consists of a sequence of locations, allowing users the flexibility to detour to the meetup POI at any location within the sequence, known as a detour location. Given a set of trips for the users, the query identifies the optimal meetup POI (e.g., restaurants or movie theaters) and detour locations from each user’s trip that minimize the total trip overhead distance. The trip overhead distance refers to the additional distance a user must travel to visit the meetup POI before returning to the next location in their trip. The aggregate of these overhead distances across all users constitutes the total trip overhead distance. The computation time for processing T-GNN queries increases with the number of POIs. To address this, we introduce three pruning methods to eliminate POIs that cannot contribute to the optimal solution. We also develop an efficient approach for processing T-GNN queries in real-time. Extensive experiments validate the performance and effectiveness of the proposed algorithm. 2024-12-18T00:00:00Z