Results 1 to 10 of about 50 (49)
Real identifiability vs. complex identifiability [PDF]
Linear and Multilinear Algebra, 2017 Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$. This behavior is quite peculiar when the rank $r$ is submaximal.
Angelini, Elena +2 more
openaire +3 more sources
Identifying opportunities [PDF]
Early Years Educator, 2020 In the first of a three-part guide, Nicola Watson focuses on the statutory changes to the Prime areas of learning and provides advice on how to positively implement them in your practice.
openaire +1 more source
, 2022 Day 1 of my five-week experiment to elaborate on FAIR-enabling services, and I already find myself fallen flat on my face.
openaire +1 more source
The Linacre Quarterly, 2017 Defenders of human, embryonic, destructive stem-cell research and early abortion typically argue for their position by showing that you and I do not come into existence at conception but rather at some point after. Eugene Mills has provided an ingenious argument that you and I could not have come into existence at conception.
openaire +2 more sources
IDENTIFYING CREDIT CRUNCHES [PDF]
Contemporary Economic Policy, 1993 This article identifies four U.S. credit crunches—periods of sharply increased non‐price credit rationing—between 1960 and 1992. Extreme intimidation of banks by the Federal Reserve and U.S. federal government through jawboning and credible threats of increased regulatory oversight caused the crunches of 1966 and 1969.
Raymond E. Owens, Stacey L. Schreft
openaire +2 more sources
Identifiability implies robust identifiability
Proceedings of 32nd IEEE Conference on Decision and Control, 2002 In identification from a deterministic point of view an algorithm is said to be robustly convergent if the true system is regained when the noise level tends to zero. In this paper we introduce a concept close to this performance measure: robust global identifiability. A model structure, i.e.
L. Ljung, T. Glad, T. Andersson
openaire +2 more sources
, 2014 The problem of outliers is well-known in statistics: an outlier is a value that is far from the general distribution of the other observed values, and can often perturb the results of a statistical analysis. Various procedures exist for identifying outliers, in case they need to receive special treatment, which in some cases can be exclusion from ...
Michael Greenacre, H. ÖztaÅŸ Ayhan
openaire +4 more sources
SIAM Journal on Optimization, 2011 Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the promise of reducing an inequality-constrained problem to an equality-constrained problem, in a neighborhood of a solution. We study this issue in the more general setting of composite nonsmooth minimization, in
Lewis, A. S., Wright, S. J.
openaire +3 more sources
Identifying non-identifiability
, 2018 <em> This is a second post in my series on taming divergences in Stan models, see the first post in the series for a general introduction. Also see guide to Stan warnings </em> <strong> Standard caveat: </strong> <em> I am not an expert on Stan, I consider myself just an advanced user who likes to explain things.
openaire +1 more source
Identifier and Identifier Semantics
Abstract The evolvability of a network architecture refers to its ability to be designed and implemented in a flexible and scalable manner, allowing it to adapt to changing needs and technological advancements. In MIN networks [1], network evolution can be realized through the extension of network identifiers.
Hui Li, He Bai
openaire +1 more source