Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Mousavi, Hamid"'
Autor:
Mousavi, Hamid
Publikováno v:
Comptes Rendus. Mathématique, Vol 358, Iss 9-10, Pp 1097-1099 (2021)
In this paper we show that a finite group $G$ with Quaternion Sylow $2$-subgroup is $2$-nilpotent if, either $3\nmid |G|$ or $G$ is solvable and the order of its Sylow $2$-subgroup is strictly greater than $16$.
Externí odkaz:
https://doaj.org/article/006c40ba1ddd4c7387872e054ace06b8
Autor:
Dastborhan, Nasrin, Mousavi, Hamid
Let $\mathfrak{Nil}$ be the class of nilpotent groups and $G$ be a group. We call $G$ a meta-$\mathfrak{Nil}$-Hamiltonian group if any of its non-$\mathfrak{Nil}$ subgroups is normal. Also, we call $G$ a para-$\mathfrak{Nil}$-Hamiltonian group if $G$
Externí odkaz:
http://arxiv.org/abs/2311.00352
GTFLAT, as a game theory-based add-on, addresses an important research question: How can a federated learning algorithm achieve better performance and training efficiency by setting more effective adaptive weights for averaging in the model aggregati
Externí odkaz:
http://arxiv.org/abs/2212.04103
Let $G$ be a finite group, and let $x$ be an element of $G$. Denote by $\Sol_G(x)$ the set of all $y \in G$ such that the group generated by $x$ and $y$ is soluble. We investigate the influence of $\Sol_G(x)$ on the structure of $G$.
Comment: 9
Comment: 9
Externí odkaz:
http://arxiv.org/abs/2210.11564
Publikováno v:
ACM Transactions on Embedded Computing Systems, Vol. 22, No. 5s, Article 105. Publication date: September 2023
The deployment of Deep Neural Networks (DNNs) on edge devices is hindered by the substantial gap between performance requirements and available processing power. While recent research has made significant strides in developing pruning methods to buil
Externí odkaz:
http://arxiv.org/abs/2207.06968
Autor:
MOUSAVI, HAMID1 hmousavi@tabrizu.ac.ir
Publikováno v:
International Journal of Group Theory. Jun2024, Vol. 13 Issue 2, p173-188. 16p.
Publikováno v:
Journal of Machine Learning Research, 24(285), 1-59 (2023)
Latent variable models (LVMs) represent observed variables by parameterized functions of latent variables. Prominent examples of LVMs for unsupervised learning are probabilistic PCA or probabilistic SC which both assume a weighted linear summation of
Externí odkaz:
http://arxiv.org/abs/2003.02214
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.
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.
Autor:
Jamali, Alireza, Mousavi, Hamid
Let $G$ be a finite group. We let $\f{m}(G)$ and $\sig(G)$ denote the number of maximal subgroups of $G$ and the least positive integer $n$ such that $G$ is written as the union of $n$ proper subgroups, respectively. In this paper we determine the st
Externí odkaz:
http://arxiv.org/abs/math/0507391