Results 61 to 70 of about 409,696 (282)
Coalitional Games in MISO Interference Channels: Epsilon-Core and Coalition Structure Stable Set
, 2014 The multiple-input single-output interference channel is considered. Each transmitter is assumed to know the channels between itself and all receivers perfectly and the receivers are assumed to treat interference as additive noise.
Jorswieck, Eduard, Mochaourab, Rami
core +1 more source
Aging and Cancer, EarlyView.ABSTRACT As global populations age, cancer is increasingly becoming a leading cause of morbidity and mortality among older adults, particularly in low‐ and middle‐income countries (LMICs). Despite accounting for the majority of new cancer cases and deaths, older individuals remain underrepresented in cancer research, clinical guidelines, and health ...
Ibrahim Bidemi Abdullateef +2 more
wiley +1 more source
On the spectral distribution of kinetic energy in large-scale atmospheric flow [PDF]
Nonlinear Processes in Geophysics, 1998 A one-dimensional form of the equation of motion with forcing and dissipation is formulated in the spectral domain and used to make long term integrations from which the spectral distribution of the kinetic energy is determined The forcing in the wave ...
A. Wiin-Nielsen
doaj
Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a private fort and the upper and lower zero forcing irrdedundance numbers $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are defined.
Curtis, Bryan A. +2 more
openaire +2 more sources
Failed zero forcing and critical sets on directed graphs
, 2019 Let $D$ be a simple digraph (directed graph) with vertex set $V(D)$ and arc set $A(D)$ where $n=|V(D)|$, and each arc is an ordered pair of distinct vertices. If $(v,u) \in A(D)$, then $u$ is considered an \emph{out-neighbor} of $v$ in $D$. Initially, we designate each vertex to be either filled or empty.
Adams, Alyssa, Jacob, Bonnie
openaire +3 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Myasthenia gravis (MG) is a rare disorder characterized by fluctuating muscle weakness with potential life‐threatening crises. Timely interventions may be delayed by limited access to care and fragmented documentation. Our objective was to develop predictive algorithms for MG deterioration using multimodal telemedicine data ...
Maike Stein +7 more
wiley +1 more source
IEEE Access, 2018 In a cognitive heterogeneous network (HetNet), cognitive small cell base stations (SBSs) can perceive and utilize the frequency band belonging to massive MIMO enabled macrocell base stations opportunistically.
Zichen Chen, Jiandong Li, Jinjing Huang
doaj +1 more source
Applied Sciences, 2022 The majority of digital images are stored in compressed form. Generally, image classification using convolution neural network (CNN) is done in uncompressed form rather than compressed one.
Baba Fakruddin Ali B H +1 more
doaj +1 more source
Upper bounds on the k-forcing number of a graph [PDF]
, 2014 Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete ...
Amos, David +3 more
core
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
, 2017 The \emph{metric dimension} $\dim(G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen vertices.
Eroh, Linda, Kang, Cong X., Yi, Eunjeong
core +1 more source