Results 261 to 270 of about 11,592,761 (284)
Some of the next articles are maybe not open access.

A modified surgical method for treating Baker's cyst in children

The Knee, 2008
Surgery for Baker's cysts in children is plagued by high recurrent rate after the operation. In this study, a modified surgical method is developed to avoid the recurrence. Between 1995 and 2002, nine symptomatic Baker's cysts were excised in nine children, including six boys and three girls with a mean age of 5.7 years, were reviewed retrospectively ...
Jian-Chih, Chen   +6 more
openaire   +2 more sources

Baker’s Method

1989
Baker’s method does not actually prove Siegel’s theorem in full generality, but in every case where it applies, it is effective.
openaire   +1 more source

On Baker’s Method

2000
In Chap. 4 we deduced Baker’s Theorems 1.5 and 1.6 from Schneider-Lang’s Criterion. The proof used an extension of Gel’fond’s method in several variables. In Chapters 6 and 7, we extended Schneider’s method in several variables in order to prove the homogeneous transcendence result (Theorem 1.5) as well as quantitative refinements.
openaire   +1 more source

A generalization of the Peano-Baker method

Journal of the Franklin Institute, 1972
Abstract An improvement of the Peano-Baker iterative method (matrizant method) for solving a system of first order linear differential equations with variable coefficients is presented. The new method utilizes the structure of the matrix of coefficients to define iterative schemes which may converge much more rapidly than the traditional method.
openaire   +1 more source

A Double Perturbation Method for Reducing Dynamical Degradation of the Digital Baker Map

International Journal of Bifurcation and Chaos, 2017
The digital Baker map is widely used in different kinds of cryptosystems, especially for image encryption. However, any chaotic map which is realized on the finite precision device (e.g. computer) will suffer from dynamical degradation, which refers to short cycle lengths, low complexity and strong correlations.
Lingfeng Liu   +3 more
openaire   +2 more sources

A method for the detection of Issatchenkia orientalis in a baker's yeast factory

Applied Microbiology and Biotechnology, 1984
A method for the detection of Issatchenkia orientalis (Candida krusei), a contaminant of bakers' yeast, is described. Nine different liquid medium types were compared and maximum specific growth rates for the yeast contaminant were determined in each medium. Issatchenkia orientalis grew fastest in malt extract broth (0,37 h-1) and potato dextrose broth
Tracey R.P.   +2 more
openaire   +2 more sources

Dynkin’s method of computing the terms of the Baker–Campbell–Hausdorff series

Journal of Mathematical Physics, 1989
The infinite series for log(exp X exp Y) for noncommuting X and Y is expressible in terms of iterated commutators of X and Y except for the linear term X+Y. Dynkin derived an explicit expression for the terms as a sum of iterated commutators over a certain set of sequences.
openaire   +2 more sources

An improved method for isolation of crystalline pyrophosphatase from baker's yeast

Archives of Biochemistry and Biophysics, 1961
Abstract Kunitz' original method for the isolation of crystalline pyrophosphatase from baker's yeast has been modified by the incorporation of the technique of alcohol fractionation developed by Heppel and Hilmoe and the simultaneous elimination of the technique of adsorption of impurities by means of calcium phosphate gel. The modified method proved
openaire   +2 more sources

A two-step integration method for seamless gene deletion in baker’s yeast

Analytical Biochemistry, 2013
In this study, we developed a seamless gene deletion method through a two-step integration protocol to construct an industrial baker's yeast with NTH1 deletion. A fusion fragment consisted of the upstream sequence, and the downstream sequence of NTH1 was subcloned into an integrating plasmid containing a URA3 counter-selection marker for excision of ...
Jian, Dong   +6 more
openaire   +2 more sources

Applications of Baker's method. X

1993
Summary: Let \(a,b\) be fixed integers with \(ab\neq 0\). Let \(p\) be a prime, and let \(s_p\) be a primitive \(p\)th root of unity. In this paper, with Baker's method, the author proves that if \(p>C\), then \(a-bs_p\) is never a square, where \(C\) is an effectively computable constant depending only on \(a\) and \(b\).
openaire   +14 more sources

Home - About - Disclaimer - Privacy