Zobrazeno 1 - 10
of 431
pro vyhledávání: '"68M10"'
This work proposes a provably convergent and low complexity optimization algorithm for the maximization of the secrecy energy efficiency in the uplink of a wireless network aided by a Reconfigurable Intelligent Surface (RIS), in the presence of an ea
Externí odkaz:
http://arxiv.org/abs/2406.06983
Autor:
Rybalova, Elena, Semenova, Nadezhda
In this article we consider the influence of a periodic sequence of Gaussian pulses on a chimera state in a ring of coupled FitzHugh-Nagumo systems. We found that on the way to complete spatial synchronization one can observe a number of variations o
Externí odkaz:
http://arxiv.org/abs/2405.06833
Autor:
Chen, Xuzheng, Zhang, Jie, Fu, Ting, Shen, Yifan, Ma, Shu, Qian, Kun, Zhu, Lingjun, Shi, Chao, Zhang, Yin, Liu, Ming, Wang, Zeke
Network speeds grow quickly in the modern cloud, so SmartNICs are introduced to offload network processing tasks, even application logic. However, typical multicore SmartNICs such as BlueFiled-2 are only capable of processing control-plane tasks with
Externí odkaz:
http://arxiv.org/abs/2402.03041
The Zero-touch network and Service Management (ZSM) framework represents an emerging paradigm in the management of the fifth-generation (5G) and Beyond (5G+) networks, offering automated self-management and self-healing capabilities to address the es
Externí odkaz:
http://arxiv.org/abs/2312.04159
Autor:
Dvořák, Tomáš, Gu, Mei-Mei
The burnt pancake graph $BP_n$ is the Cayley graph of the hyperoctahedral group using prefix reversals as generators. Let $\{u,v\}$ and $\{x,y\}$ be any two pairs of distinct vertices of $BP_n$ for $n\geq 4$. We show that there are $u-v$ and $x-y$ pa
Externí odkaz:
http://arxiv.org/abs/2310.18831
Partitioned communication was introduced in MPI 4.0 as a user-friendly interface to support pipelined communication patterns, particularly common in the context of MPI+threads. It provides the user with the ability to divide a global buffer into smal
Externí odkaz:
http://arxiv.org/abs/2308.03930
We study the problem of finding a minimum $k$-critical-bipartite graph of order $(n,m)$: a bipartite graph $G=(U,V;E)$, with $|U|=n$, $|V|=m$, and $n>m>1$, which is $k$-critical-bipartite, and the tuple $(|E|, \Delta_U, \Delta_V)$, where $\Delta_U$ a
Externí odkaz:
http://arxiv.org/abs/2307.07315
Workload prediction in multi-tenant edge cloud platforms (MT-ECP) is vital for efficient application deployment and resource provisioning. However, the heterogeneous application patterns, variable infrastructure performance, and frequent deployments
Externí odkaz:
http://arxiv.org/abs/2306.01507
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or telecommunicat
Externí odkaz:
http://arxiv.org/abs/2305.03381
Autor:
Jaramillo-Velez, Delio, Seccia, Lisa
The v-number of a graded ideal is an algebraic invariant introduced by Cooper et al., and originally motivated by problems in algebraic coding theory. In this paper we study the case of binomial edge ideals and we establish a significant connection b
Externí odkaz:
http://arxiv.org/abs/2304.04898