Results 161 to 170 of about 414,399 (218)
Intermixing‐Driven Growth of Highly Oriented Indium Phosphide on Black Phosphorus
Advanced Functional Materials, EarlyView.This study demonstrates controlled intermixing and compound formation at the In/black phosphorus (BP) interface, leading to highly oriented InP formation. Comprehensive structural and electrical analyses reveal tunable bandgap behavior governed by competing BP thinning and charge‐transfer effects, underscoring the critical role of interfacial compound ...
Tae Keun Yun +6 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1992
Abstract It has already been shown in (1.1.23) in the Introduction how to use the Stein–Chen method for sums of independent random variables. In Section 2.3, the upper bounds so far derived are applied to dissociated indicator random variables.
A D Barbour, Lars Holst, Svante Janson
openaire +1 more source
Abstract It has already been shown in (1.1.23) in the Introduction how to use the Stein–Chen method for sums of independent random variables. In Section 2.3, the upper bounds so far derived are applied to dissociated indicator random variables.
A D Barbour, Lars Holst, Svante Janson
openaire +1 more source
How many minimal upper bounds of minimal upper bounds
Computing, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2012
Plastic limit analysis is a convenient tool to find approximate solutions of boundary value problems. In general, this analysis is based on two principles associated with the lower bound and upper bound theorems. The latter is used in the present monograph to estimate the limit load for welded structures with and with no crack.
openaire +1 more source
Plastic limit analysis is a convenient tool to find approximate solutions of boundary value problems. In general, this analysis is based on two principles associated with the lower bound and upper bound theorems. The latter is used in the present monograph to estimate the limit load for welded structures with and with no crack.
openaire +1 more source
2002
In Chapter 2, we investigated techniques for proving size lower bounds for restricted classes of circuits (monotonic or constant depth) . Returning to the circuit synthesis problem of Chapter 1, recall that in Section 1.8.4, we showed an O(n) upper bound for circuit size for symmetric boolean functions f ∈ 𝓑 n .
Peter Clote, Evangelos Kranakis
openaire +1 more source
In Chapter 2, we investigated techniques for proving size lower bounds for restricted classes of circuits (monotonic or constant depth) . Returning to the circuit synthesis problem of Chapter 1, recall that in Section 1.8.4, we showed an O(n) upper bound for circuit size for symmetric boolean functions f ∈ 𝓑 n .
Peter Clote, Evangelos Kranakis
openaire +1 more source
1992
In this third chapter, we will prove results giving a geometric upper bound for the singular spectrum, and for the second microsupport along a lagrangian submanifold, of distributions defined as boundary values of convenient ramified functions. The estimates we will obtain will depend just on the geometric data of the problem, that is on the (singular)
openaire +1 more source
In this third chapter, we will prove results giving a geometric upper bound for the singular spectrum, and for the second microsupport along a lagrangian submanifold, of distributions defined as boundary values of convenient ramified functions. The estimates we will obtain will depend just on the geometric data of the problem, that is on the (singular)
openaire +1 more source
Generalized Singleton Type Upper Bounds
IEEE Transactions on Information TheoryzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hao Chen +5 more
openaire +2 more sources
A generalisation of variable upper bounding and generalised upper bounding
European Journal of Operational Research, 1978Abstract Constraints of the form Σx i ⩽ y where the variable y may appear in any number of constraints may be considered to be generalisations both of Generalised Upper Bounds (GUB) and Variable Upper Bounds (VUB). A method of representing such constraints implicity in linear programs is demonstrated.
openaire +2 more sources