Searcharxiv⌕ Search

arXiv subjects

Mahdi Hasnat Siyam

Publications and source records attributed to Mahdi Hasnat Siyam.

2 recordsLinked to original sources

A Low-Cost ATmega32-Based Embedded System for Automated Patient Queue and Health Data Management in Private Medical Chambers

This paper presents a low-cost, stand-alone embedded system that automates patient queue handling and basic health data acquisition for small private medical chambers. The proposed design separates interaction into two physically distinct modules: a patient's self-service corner for entering basic details and measuring vital signs, and a doctor's corner for reviewing the current patient's information and advancing the queue. A single ATmega32 microcontroller coordinates both modules, interfacing with an LM35 temperature sensor, an XD-58C pulse sensor, matrix keypads for data entry, and dual 16$\times$2 LCDs for guided interaction and clinician-side display. Unlike IoT-first approaches that require continuous connectivity and higher deployment overhead, the system operates offline and provides deterministic local operation suitable for resource-constrained settings. Experimental validation shows temperature readings within $\pm 1^{\circ}$C (LM35 range tested), resting pulse readings within $\pm 3$~BPM, and button-to-display latency below 1.2~s, demonstrating reliable real-time performance under limited hardware resources.

cs.HC↗

Algorithms for Parameterized String Matching with Mismatches

Two strings are considered to have parameterized matching when there exists a bijection of the parameterized alphabet onto itself such that it transforms one string to another. Parameterized matching has application in software duplication detection, image processing, and computational biology. We consider the problem for which a pattern $p$, a text $t$ and a mismatch tolerance limit $k$ is given and the goal is to find all positions in text $t$, for which pattern $p$, parameterized matches with $|p|$ length substrings of $t$ with at most $k$ mismatches. Our main result is an algorithm for this problem with $O(α^2 n\log n + n α^2 \sqrtα \log \left( n α\right))$ time complexity, where $n = |t|$ and $α= |Σ|$ which is improving for $k=\tildeΩ(|Σ|^{5/3})$ the algorithm by Hazay, Lewenstein and Sokol. We also present a hashing based probabilistic algorithm for this problem when $k = 1$ with $O \left( n \log n \right)$ time complexity, which we believe is algorithmically beautiful.

cs.DS↗