Zobrazeno 1 - 10
of 7 155
pro vyhledávání: '"A Pankratov"'
Autor:
Ladeynov, Dmitry A., Pankratov, Andrey L., Revin, Leonid S., Gordeeva, Anna V., Ilichev, Evgeny V.
We demonstrate that the performance of threshold detectors based on Al Josephson junctions can be significantly improved by exploiting the phase diffusion regime. When the escape dynamics of the detector switches to this regime, a decrease in both -
Externí odkaz:
http://arxiv.org/abs/2405.04426
We study the Renting Servers in the Cloud problem (RSiC) in multiple dimensions. In this problem, a sequence of multi-parameter jobs must be scheduled on servers that can be rented on-demand. Each job has an arrival time, a finishing time, and a mult
Externí odkaz:
http://arxiv.org/abs/2404.15444
Autor:
Pankratov, A. L., Gordeeva, A. V., Chiginev, A. V., Revin, L. S., Blagodatkin, A. V., Crescini, N., Kuzmin, L. S.
When measuring electromagnetic radiation of frequency $f$, the most sensitive detector is the one that counts the single quanta of energy $h f$. Single photon detectors (SPDs) were demonstrated from $\gamma$-rays to infrared wavelengths, and extendin
Externí odkaz:
http://arxiv.org/abs/2404.10434
Demand-aware communication networks are networks whose topology is optimized toward the traffic they need to serve. These networks have recently been enabled by novel optical communication technologies and are investigated intensively in the context
Externí odkaz:
http://arxiv.org/abs/2403.03724
We study the truck-drone cooperative delivery problem in a setting where a single truck carrying a drone travels at constant speed on a straight-line trajectory/street. Delivery to clients located in the plane and not on the truck's trajectory is per
Externí odkaz:
http://arxiv.org/abs/2402.00829
Virtual networks are an innovative abstraction that extends cloud computing concepts to the network: by supporting bandwidth reservations between compute nodes (e.g., virtual machines), virtual networks can provide a predictable performance to distri
Externí odkaz:
http://arxiv.org/abs/2311.05474
We study temporal analogues of the Unrestricted Vertex Separator problem from the static world. An $(s,z)$-temporal separator is a set of vertices whose removal disconnects vertex $s$ from vertex $z$ for every time step in a temporal graph. The $(s,z
Externí odkaz:
http://arxiv.org/abs/2309.14185
Publikováno v:
Alexandria Engineering Journal, Vol 107, Iss , Pp 215-224 (2024)
In NOMA achieving fairness in data transmission for all users is one of the key challenges. It implies a fair allocation of resources among users according to a given criterion. NOMA systems are based on the discreteness of the data source, since the
Externí odkaz:
https://doaj.org/article/7524d60b1755476786e3739a7abf87aa
Autor:
Anastasiia V. Gracheva, Andrey O. Drokov, Daria I. Smirnova, Darya M. Khokhlova, Ekaterina R. Korchevaya, Andrey A. Pankratov, Galina V. Trunova, Varvara A. Khokhlova, Maria S. Vorontsova, Irina A. Leneva, Oksana A. Svitich, Vitaly V. Zverev, Evgeny B. Faizuloev
Publikováno v:
Журнал микробиологии, эпидемиологии и иммунобиологии, Vol 101, Iss 4, Pp 470-482 (2024)
Introduction. Animal models for SARS-CoV-2 infection, reproducing the clinical features of COVID-19 in humans, are important tools for studying the pathogenesis of the disease, transmission of the pathogen and are indispensable for testing antiviral
Externí odkaz:
https://doaj.org/article/67b3e4c1e1c640dc852ad3f8d140bbbc
Autor:
Li, Yaqiao, Pankratov, Denis
This paper studies the online vector bin packing (OVBP) problem and the related problem of online hypergraph coloring (OHC). Firstly, we use a double counting argument to prove an upper bound of the competitive ratio of $FirstFit$ for OVBP. Our proof
Externí odkaz:
http://arxiv.org/abs/2306.11241