نتایج جستجو برای: complete forcing number
تعداد نتایج: 1492568 فیلتر نتایج به سال:
Linear forcing has been proposed as a useful method for forced isotropic turbulence simulations because it is a physically realistic forcing method with a straightforward implementation in physical-space numerical codes T. S. Lundgren, “Linearly forced isotropic turbulence,” Annual Research Briefs Center for Turbulence Research, Stanford, CA, 2003 , p. 461; C. Rosales and C. Meneveau, “Linear f...
A large number of processes are involved in the chain from emissions of aerosol precursor gases and primary particles to impacts on cloud radiative forcing. Those processes are manifest in a number of relationships that can be expressed as factors dlnX/dlnY driving aerosol effects on cloud radiative forcing. These factors include the relationships between cloud condensation nuclei (CCN) concent...
The probability density function (PDF) of the gas density in turbulent supersonic flows is investigated with high-resolution numerical simulations. In a systematic study, we compare the density statistics of compressible turbulence driven by the usually adopted solenoidal forcing (divergence-free) and by compressive forcing (curl-free). Our results are in agreement with studies using solenoidal...
in this paper, we investigate a damped korteweg-de vries equation with forcing on a periodic domain $mathbb{t}=mathbb{r}/(2pimathbb{z})$. we can obtain that if the forcing is periodic with small amplitude, then the solution becomes eventually time-periodic.
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The problem is NPcomplete, and is contained in many scheduling applications. Based on a polynomial-time heuristic due to Karmarkar and Karp, we present a new algorithm, called Complete Karmarkar Karp (CKK), that optimally sol...
for a graph g, let d(g) be the set of all strong orientations of g. the orientationnumber of g is min {d(d) |d belongs to d(g)}, where d(d) denotes the diameterof the digraph d. in this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید