Zobrazeno 1 - 10
of 28 386
pro vyhledávání: '"Sharifi, P."'
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:
Lecouturier, Emmanuel, Wang, Jun
Let $N$ and $p$ be prime numbers $\geq 5$ such that $p$ divides $N-1$. Let $I$ be Mazur's Eisenstein ideal of level $N$ and $H_+$ be the plus part of $H_1(X_0(N), \mathbf{Z}_p)$ for the complex conjugation. We give a conjectural explicit description
Externí odkaz:
http://arxiv.org/abs/1910.03205
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:
Würger, Alois
Publikováno v:
Soft Matter, 2016, 12, 331
In a recent paper, Sharifi-Mood et al. study colloidal particles trapped at a liquid interface with opposite principal curvatures $c_{1}=-c_{2}$. In the theory part, they claim that the trapping energy vanishes at second order in $\Delta c=c_{1}-c_{2
Externí odkaz:
http://arxiv.org/abs/1601.04056
This paper presents a novel reinforcement learning framework for trajectory tracking of unmanned aerial vehicles in cluttered environments using a dual-agent architecture. Traditional optimization methods for trajectory tracking face significant comp
Externí odkaz:
http://arxiv.org/abs/2410.23571
Neural Architecture Search (NAS) methods autonomously discover high-accuracy neural network architectures, outperforming manually crafted ones. However, The NAS methods require high computational costs due to the high dimension search space and the n
Externí odkaz:
http://arxiv.org/abs/2410.22487
Autor:
Drijvers, Manu, Gretler, Tim, Harchol, Yotam, Klenze, Tobias, Maric, Ognjen, Neamtu, Stefan, Pignolet, Yvonne-Anne, Rumenov, Rostislav, Sharifi, Daniel, Shoup, Victor
Byzantine fault tolerant (BFT) protocol descriptions often assume application-layer networking primitives, such as best-effort and reliable broadcast, which are impossible to implement in practice in a Byzantine environment as they require either unb
Externí odkaz:
http://arxiv.org/abs/2410.22080
Autor:
Hajiaghayi, MohammadTaghi, Jahan, Shayan Chashm, Sharifi, Mohammad, Shin, Suho, Springer, Max
The online bipartite matching problem, extensively studied in the literature, deals with the allocation of online arriving vertices (items) to a predetermined set of offline vertices (agents). However, little attention has been given to the concept o
Externí odkaz:
http://arxiv.org/abs/2410.19163
Autor:
Sharifi, Mehran
Publikováno v:
J Math Techniques Comput Math, 3(10), 1-14 (2024)
The study of Large-Eddy Simulations (LES) in turbulent flows continues to be a critical area of research, particularly in understanding the behavior of small-scale turbulence structures and their impact on resolved scales. In this study, we focus on
Externí odkaz:
http://arxiv.org/abs/2410.16753
Autor:
Sharifi, Mehran
Publikováno v:
J Math Techniques Comput Math, 3(10), 01-20 (2024)
This study presents an efficient algebraic scheme known as MULES for sharp interface advection, verified against various schemes including first-order upwind, second-order central, van Leer flux limiter, and Geometric Volume-of-Fluid (VOF). Two probl
Externí odkaz:
http://arxiv.org/abs/2410.16754