Zobrazeno 1 - 10
of 2 973
pro vyhledávání: '"Nadimi, A."'
Autor:
Nadimi, Esmaeil S., Braun, Jan-Matthias, Schelde-Olesen, Benedicte, Prudhomme, Emile, Blanes-Vidal, Victoria, Baatrup, Gunnar
Despite recent surge of interest in deploying colon capsule endoscopy (CCE) for early diagnosis of colorectal diseases, there remains a large gap between the current state of CCE in clinical practice, and the state of its counterpart optical colonosc
Externí odkaz:
http://arxiv.org/abs/2406.09761
Autor:
Nadimi, Bardia, Zheng, Hao
This paper proposes a novel method for automatically inferring message flow specifications from the communication traces of a system-on-chip (SoC) design that captures messages exchanged among the components during a system execution. The inferred me
Externí odkaz:
http://arxiv.org/abs/2405.12426
Augmenting the balanced residue number system moduli-set $\{m_1=2^n,m_2=2^n-1,m_3=2^n+1\}$, with the co-prime modulo $m_4=2^{2n}+1$, increases the dynamic range (DR) by around 70%. The Mersenne form of product $m_2 m_3 m_4=2^{4n}-1$, in the moduli-se
Externí odkaz:
http://arxiv.org/abs/2404.08228
Autor:
Nadimi, Bardia, Zheng, Hao
Recently, there has been a surging interest in using large language models (LLMs) for Verilog code generation. However, the existing approaches are limited in terms of the quality of the generated Verilog code. To address such limitations, this paper
Externí odkaz:
http://arxiv.org/abs/2404.08029
We propose a coherent transceiver architecture able to transmit information and enhance the security of the optical network by identifying other optical systems and subsystems. Simulations show that identification is obtained with sufficient reliabil
Externí odkaz:
http://arxiv.org/abs/2404.05278
Machine unlearning has garnered significant attention due to its ability to selectively erase knowledge obtained from specific training data samples in an already trained machine learning model. This capability enables data holders to adhere strictly
Externí odkaz:
http://arxiv.org/abs/2403.07611
\noindent A paired coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_1$ and $V_2$, neither of which is a paired dominating set but whose union $V_1 \cup V_2$ is a paired dominating set. A paired coalition partition (abbrevia
Externí odkaz:
http://arxiv.org/abs/2402.10842
Autor:
Hillaire, Keith D., Nithyanandam, Praneshnandan, Song, Minyung, Nadimi, Sahar Rashid, Kiani, Abolfazl, Dickey, Michael D., Daniels, Karen E.
When in a pristine state, gallium and its alloys have the largest interfacial tensions of any liquid at room temperature. Nonetheless, applying as little as 0.8 V of electric potential across eutectic gallium indium (EGaIn) placed within aqueous NaOH
Externí odkaz:
http://arxiv.org/abs/2310.19298
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-12 (2024)
A paired coalition in a graph [Formula: see text] consists of two disjoint sets of vertices [Formula: see text] and [Formula: see text], neither of which is a paired dominating set but whose union [Formula: see text] is a paired dominating set. A pai
Externí odkaz:
https://doaj.org/article/f9c2197239ab4fae840964ac2c1e17b6
Modeling system-level behaviors of intricate System-on-Chip (SoC) designs is crucial for design analysis, testing, and validation. However, the complexity and volume of SoC traces pose significant challenges in this task. This paper proposes an appro
Externí odkaz:
http://arxiv.org/abs/2308.03523