Results 261 to 270 of about 1,981,084 (298)

Environmental effectiveness of the National Action Plan to Contain Antimicrobial Resistance: evidence from Chinese soil. [PDF]

Natl Sci Rev
Zhao Y, Liu Z, Chen X, Huang Y, Li S, Mao X, Zheng X, Yao X, Hu B, Zhu L, Zhang T.   +10 more
europepmc   +1 more source

HALA: A Hybrid Dual-Population Optimizer Integrating an Enhanced Artificial Lemming Algorithm and SHADE. [PDF]

Biomimetics (Basel)
Yang H, Huang X.
europepmc   +1 more source

A Hybrid Multi-Strategy Chinese Pangolin Optimization Algorithm and Its Applications. [PDF]

Biomimetics (Basel)
Jia C, Yang Y, Cheng Y, Fu M, Zhou B, Liu J, Liu Y.   +6 more
europepmc   +1 more source

Can Fluconazole Be Used to Treat Non-Resistant Candida (Candidozyma) auris Infections? Preclinical Pharmacokinetic/Pharmacodynamic Data From a Galleria mellonella Infection Model. [PDF]

J Infect Dis
Kroustali V, Pournaras S, Meletiadis J.
europepmc   +1 more source

Minimum rank and minimum trace of covariance matrices

Psychometrika, 1982
This paper considers some mathematical aspects of minimum trace factor analysis (MTFA). The uniqueness of an optimal point of MTFA is proved and necessary and sufficient conditions for a point x to be optimal are established. Finally, some results about the connection between MTFA and the classical minimum rank factor analysis will be presented.
Alexander Shapiro, Shapiro Alexander
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Sign patterns with minimum rank 2 and upper bounds on minimum ranks

Linear and Multilinear Algebra, 2013
A sign pattern (matrix) is a matrix whose entries are from the set {+, −, 0}. The minimum rank (resp., rational minimum rank) of a sign pattern matrix 𝒜 is the minimum of the ranks of the real (resp., rational) matrices whose entries have signs equal to the corresponding entries of 𝒜. The notion of a condensed sign pattern is introduced.
Frank Hall, Yubin Gao, Wei Gao
exaly   +2 more sources

Haemers' Minimum Rank [PDF]

, 2018
Haemers’ minimum rank, η(G), was first defined by Willem Haemers in 1979. He created this graph parameter as an upper bound for the Shannon capacity of a graph, Θ(G), and to answer some questions asked by Lovasz in his famous paper where he determined Θ(C5) = √ 5.
Tims, Geoff
openaire   +3 more sources