Results 121 to 130 of about 58,673 (168)

Multiparametric quantification of bacterial cells using digital holographic microscopy. [PDF]

Sci Rep
Cano Á, Sanz-Jiménez A, Malvar O, Ruz JJ, Kosaka PM, García-López S, Calleja M, Tamayo J.   +7 more
europepmc   +1 more source

Analysis and prediction of hydrogen relative permeability in underground storage systems using machine learning. [PDF]

Sci Rep
Amjadi A, Kord S.
europepmc   +1 more source

Heuristic computational approach for nonlinear reaction-diffusion kinetics in catalytic systems. [PDF]

Sci Rep
Jamshed S, Shoaib M, Ahmad H, Awwad FA, Ismail EAA, Yousaf N.   +5 more
europepmc   +1 more source

Effect of ammonium hydroxide modification of ZIF-8 nanoparticles on hexavalent chromium removal from aqueous solution. [PDF]

Sci Rep
Rakshitha KM, Giridhar R, Prathima B, Sainath K.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Constant solutions of polynomial equations

International Journal of Control, 1991
Abstract A necessary and sufficient condition is given for the equation AX + BY = C in polynomial matrices to have a constant solution pair X, Y and also for X to be non-singular. A sufficient condition is then established under which the equation with A and B fixed has a constant solution for each C from a given class. Applications to the construction
VLADIMÍR KUČERA, PETR ZAGALAK
openaire   +1 more source

John constants for polynomials

Complex Variables, Theory and Application: An International Journal, 1996
Let g be some set of non-constant analytic functions in the unit disk D, and for f e dg define The quantity where g u is the set of univalent functions in g, is called the John constant of g. We discuss where T k consists of the trinomials In particular, we find We also establish a conjecture of Rahman and Szynal for univalent trinomials in T ...
openaire   +1 more source

Polynomial Constants Are Decidable

2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs.
Markus Müller-Olm, Helmut Seidl
openaire   +1 more source