نتایج جستجو برای: 2 propnol and davies equation
تعداد نتایج: 17266779 فیلتر نتایج به سال:
This paper considers a progressive solitary wave of permanent form in an ideal fluid of constant depth and explores Davies’ approximation [Proc. R. Soc. Lond. A, 208 (1951), pp. 475– 486] with high-order corrections to Levi-Civita’s surface condition for the logarithmic hodograph variable. Using a complex plane that was originally introduced by Packham [Proc. R. Soc. Lond. A, 213 (1952), pp. 23...
The aim of this paper is to provide a self-contained proof general case the coarea inequality, also known as Eilenberg inequality. result known, but we are not aware any place that would be written with all details. based on difficult Davies. Our elementary and does use Davies' theorem. Instead an elegant argument learned from Nazarov through MathOverflow. We obtain some generalizations
The aim of the present study was to investigate the importance of skopos in the translation of political texts from English into Persian. To do this, 30 Iranian translators were conveniently selected and equally divided into the in-house and freelance translators. They were asked to translate a translation test encompassing 10 short political texts that were extracted from English news websites...
The chemiosmotic theory is normally attributed to Peter Mitchell's formulation published in Nature in 1961. However, the essential elements of the theory were published 9 years earlier by Davies and Krebs. Why, then, was this earlier formulation overlooked? The success of Mitchell's theory is examined in comparison with those of Davies and Krebs and of Williams.
An interesting feature of the Davies-Unruh effect is that a uniformly accelerated observer sees an isotropic thermal spectrum of particles even though there is a preferred direction in this context, determined by the direction of the acceleration g. We investigate the thermal fluctuations in the Unruh bath by studying the Brownian motion of particles in the bath, especially as regards to isotro...
This paper considers sufficient conditions for sparse recovery in the sparse multiple measurement vector (MMV) problem for some recently proposed rank aware greedy algorithms. Specifically we consider the compressed sensing framework with random measurement matrices and show that the rank of the measurement matrix in the sparse MMV problem allows such algorithms to reduce the effect of the log ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید