Results 81 to 90 of about 1,274,829 (283)

Improving the condition number of estimated covariance matrices

open access: yesTellus: Series A, Dynamic Meteorology and Oceanography, 2020
High dimensional error covariance matrices and their inverses are used to weight the contribution of observation and background information in data assimilation procedures.
Jemima M. Tabeart   +4 more
doaj   +1 more source

Minimum Eigenvalue Based Covariance Matrix Estimation with Limited Samples

open access: yes, 2023
In this paper, we consider the interference rejection combining (IRC) receiver, which improves the cell-edge user throughput via suppressing inter-cell interference and requires estimating the covariance matrix including the inter-cell interference with ...
Qian, Jing, Jin, Juening, Wang, Hao
core  

Interlayer‐Sliding‐Enabled Multiferroicity and Giant Switchable Anomalous Hall Conductivity in RuO2Zn2F2 Bilayer

open access: yesAdvanced Science, EarlyView.
Interlayer sliding in the RuO2Zn2F2 bilayer induces ferroelectricity and enables reversible valley polarization switching. The electric dipole and valley‐resolved band edges are intimately coupled, revealing sliding ferroelectricity as a powerful mechanism for electrical control of valley degrees of freedom in 2D materials.
Djamel Bezzerga   +3 more
wiley   +1 more source

Inverse Eigenvalue Problems for Two Special Acyclic Matrices

open access: yesMathematics, 2016
In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix
Debashish Sharma, Mausumi Sen
doaj   +1 more source

Minimum higher eigenvalues of Laplacians on graphs

open access: yesDuke Mathematical Journal, 1996
If \(G\) is an undirected graph, let \(A\) be the adjacency matrix of \(G\), \(D\) be the diagonal matrix whose \((v,v)\) entry is the degree of \(v\), and \(\Delta=D-A\) be the Laplacian of \(G\). If \(G\) is a connected graph, it is known that the eigenvalues of \(\Delta\) satisfy the condition \(0 ...
openaire   +3 more sources

Ultrafast Optoacoustics Reveals Intricate 3D Anisotropic Elasticity in Nanocrystalline Membranes

open access: yesAdvanced Science, EarlyView.
Ultrafast optoacoustic spectroscopy combined with a Sagnac interferometer enables non‐contact, simultaneous characterization of thickness and the full three‐dimensional anisotropic elastic constants in freestanding nanocrystalline copper membranes. By capturing gigahertz Lamb waves and zero‐group‐velocity resonances followed by SAFE‐GA inversion, the ...
Shuchang Zhang   +11 more
wiley   +1 more source

Counterexample to "Generalized eigenvalue-based stability tests for 2D linear systems: Necessary and sufficient conditions"

open access: yes, 2009
We present a counterexample contradicting the equivalence of statements (i)-(ii) and (iii)-(v) of Theorem 1 of Fu, P., Chen, J., and S.I. Niculescu (2006).
Takaba, Kiyotsugu, Rapisarda, Paolo
core   +1 more source

On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree

open access: yesJournal of Inequalities and Applications, 2017
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj   +1 more source

Zero forcing sets and the minimum rank of graphs [PDF]

open access: yes, 2008
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. This paper introduces a new graph parameter, Z(G)
AIM Minimum Rank – Special Graphs Work Group,
core   +1 more source

StackingNet: Collective Inference Across Independent AI Foundation Models

open access: yesAdvanced Science, EarlyView.
ABSTRACT Artificial intelligence (AI) built on large foundation models has transformed language understanding, computer vision, and reasoning, yet these systems remain isolated and cannot readily share their capabilities. Coordinating the complementary strengths of independently developed, black‐box foundation models is essential for trustworthy ...
Siyang Li   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy