Results 71 to 80 of about 1,064,288 (288)

Radiative forcing from aircraft NOx emissions: Mechanisms and seasonal dependence [PDF]

open access: yes, 2004
A chemistry-climate model has been applied to study the radiative forcings generated by aircraft NOx emissions through changes in ozone and methane. Four numerical experiments, where an extra pulse of aircraft NOx was emitted into the model atmosphere ...
Stevenson, David S.; id_orcid   +5 more
core   +1 more source

Zero-Forcing Precoding and Generalized Inverses [PDF]

open access: yesIEEE Transactions on Signal Processing, 2008
We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is given to a specific generalized inverse known as the pseudo-inverse. We begin with the standard design under the assumption of a total power constraint and prove that precoders based on ...
Ami Wiesel   +2 more
openaire   +2 more sources

Self‐Regulated Learning Meets AI: Reinterpreting Self‐Regulation, Co‐Regulation, and Socially Shared Regulation in Human–AI Interaction

open access: yesNew Directions for Adult and Continuing Education, EarlyView.
ABSTRACT Advancing artificial intelligence (AI) has transformed learning and work, yet higher education and professional development programs have not systematically equipped learners for AI‐prevalent environments. This lack of preparation creates uncertainty regarding control, responsibility, trust, and accountability.
Moon‐Heum Cho, Jerusalem Merkebu
wiley   +1 more source

Zero forcing parameters and minimum rank problems [PDF]

open access: yes, 2010
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by G.
Holst, van der, H.   +15 more
core   +1 more source

Constructions of cospectral graphs with different zero forcing numbers [PDF]

open access: yes, 2022
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph.
Cameron, Thomas R.   +13 more
core   +1 more source

Sum Rate Analysis for Precoder Design in Distributed MIMO Systems Over Composite Fading Channels

open access: yesIEEE Access, 2018
In this paper, we consider the distributed multiple-input multiple-output systems which experience both the small-scale and large-scale fading. By employing the Rayleigh-lognormal model to characterize the composite fading channels, we derive the uplink ...
Li Wang   +4 more
doaj   +1 more source

Some product graphs with power dominating number at most 2

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
Let S be a set of vertices of a graph G. Let be the set of vertices built from the closed neighborhood of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in then the remaining neighbor ...
Najibeh Shahbaznejad   +2 more
doaj   +1 more source

Ethical Foreground and Background in Adult Educator Work

open access: yesNew Directions for Adult and Continuing Education, EarlyView.
ABSTRACT Adult educators work in a complex ethical environment. The very act of contributing to the learning of another is fraught with moral overtones. In this paper we consider the ethical dimensions of adult educator practice by distinguishing the ethical features of the context or ‘background’ of practice from the ethical capabilities and decision ...
Steven Hodge, Sonal Nakar
wiley   +1 more source

Propagation time for probabilistic zero forcing [PDF]

open access: yes, 2018
Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing
Hogben, Leslie, Geneson, Jesse
core  

Open global shadow graph and it’s zero forcing number

open access: yes, 2023
Zero forcing number of a graph is the minimum cardinality of the zero forcing set. A zero forcing set is a set of black vertices of minimum cardinality that can colour the entire graph black using the color change rule: each vertex of G is coloured ...
Malur, Raksha, Dominic, Charles
core   +1 more source

Home - About - Disclaimer - Privacy