Results 41 to 50 of about 410,460 (281)

The zero forcing polynomial of a graph

, 2018
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored.
Boyer, Kirk, Brimkov, Boris, English, Sean, Ferrero, Daniela, Keller, Ariel, Kirsch, Rachel, Phillips, Michael, Reinhart, Carolyn   +7 more
core   +1 more source

DropNet: An Improved Dropping Algorithm Based on Neural Networks for Line-of-Sight Massive MIMO

IEEE Access, 2021
In line-of-sight massive MIMO, the downlink channel vectors of few users may become highly correlated. This high correlation limits the sum-rates of systems employing linear precoders.
Amirashkan Farsaei, Alireza Sheikh, Ulf Gustavsson, Alex Alvarado, Frans M. J. Willems   +4 more
doaj   +1 more source

Universally measurable sets in generic extensions [PDF]

, 2009
A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for each such ...
Larson, Paul, Neeman, Itay, Shelah, Saharon   +2 more
core   +2 more sources

Zero forcing for inertia sets

, 2012
Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few "unforced" moves as possible. This leads to a parameter known as the zero forcing number which can be used to give an upper bound for the maximum nullity of a matrix associated with the graph.
Butler, Steve, Grout, Jason, Hall, H. Tracy   +2 more
openaire   +2 more sources

Zero forcing with random sets

Discrete Mathematics
22 pages, 5 ...
Curtis, Bryan, Gan, Luyining, Haddock, Jamie, Lawrence, Rachel, Spiro, Sam   +4 more
openaire   +3 more sources

Recognizable Languages of k-Forcing Automata

Mathematical and Computational Applications
In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs.
Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour, Manuel De la Sen   +3 more
doaj   +1 more source

Closed-Form Power Normalization Methods for a Satellite MIMO System

Sensors, 2022
The paper proposes a new set of normalization techniques for precoding/beamforming matrices applicable to broadband multiuser multiple-input multiple-output (MIMO) satellite systems.
Andrea Segneri, Alejandro Baldominos, George Goussetis, Alberto Mengali, Nelson J. G. Fonseca   +4 more
doaj   +1 more source

Zero forcing number, constrained matchings and strong structural controllability

, 2015
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph.
Delvenne, Jean-Charles, Trefois, Maguy
core   +1 more source

Point-source scalar turbulence [PDF]

, 2007
The statistics of a passive scalar randomly emitted from a point source is investigated analytically. Our attention has been focused on the two-point equal-time scalar correlation function.
ANDREA MAZZINO, ANTONIO CELANI, Basu, Celani, Donsker, Furutsu, MARCO MARTINS AFONSO, Martins fonso, Martins fonso, Novikov   +9 more
core   +2 more sources

A normalised framework for the Zero Emissions Commitment [PDF]

Biogeosciences
The Zero Emissions Commitment (ZEC) measures the transient climate response after carbon emissions cease, defined by whether there is a continued rise or decrease in global surface temperature.
R. G. Williams, P. Goodwin, P. Ceppi, C. D. Jones, C. D. Jones, A. H. MacDougall   +5 more
doaj   +1 more source