Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Amin Saeidi"'
Autor:
Amin Saeidi
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 4, Iss 1, Pp 39-46 (2023)
For a 1-$(v,k,\lambda)$ design $\mathcal{D}$ containing a point $x$, we study the set $I_x$, the intersection of all blocks of $\mathcal{D}$ containing $x$. We use the set $I_x$ together with the Key-Moori Method 2 to construct reduced designs invari
Externí odkaz:
https://doaj.org/article/30842e7f6ff64c00bb762c0a0c5a6c59
This study introduces an innovative approach to classifying various types of Persian rice using image-based deep learning techniques, highlighting the practical application of everyday technology in food categorization. Recognizing the diversity of P
Externí odkaz:
http://arxiv.org/abs/2404.13555
Autor:
Amin Saeidi
Publikováno v:
International Journal of Group Theory, Vol 2, Iss 2, Pp 19-24 (2013)
Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. Suppose that ${rm{Irr}} (G | N)$ is the set of the irreducible characters of $G$ that contain $N$ in their kernels. In this paper, we classify solvable groups $G$ in which the set $ma
Externí odkaz:
https://doaj.org/article/67cf9e606fc34b5b9a8a086c57785932
Autor:
Emami, Amirhosein, Hazrati, Reza, Delshad, Majid Mehrabi, Pouri, Koorosh, Khasraghi, Amin Saeidi, Chobar, Adel Pourghader
Publikováno v:
In Journal of Engineering Research March 2024 12(1):182-191
Publikováno v:
IEEE Transactions on Wireless Communications; November 2024, Vol. 23 Issue: 11 p16404-16420, 17p
Autor:
Amin Saeidi
Publikováno v:
Communications in Algebra. 51:648-656
Autor:
Aboagye, Sylvester, Amin Saeidi, Mohammad, Tabassum, Hina, Tayyar, Yamin, Hossain, Ekram, Yang, Hong-Chuan, Alouini, Mohamed-Slim
Publikováno v:
IEEE Transactions on Communications; 2024, Vol. 72 Issue: 7 p4333-4383, 51p
Autor:
Amin Saeidi
Publikováno v:
Communications in Algebra. 50:2215-2222
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Advances in Mathematics of Communications. 14:603-611
In this paper, using a method of construction of \begin{document}$ 1 $\end{document} -designs which are not necessarily symmetric, introduced by Key and Moori in [ 5 ], we determine a number of \begin{document}$ 1 $\end{document} -designs with intere