نتایج جستجو برای: nuselt number
تعداد نتایج: 1168336 فیلتر نتایج به سال:
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...
it is well known fact that binary relations are generalized mathematical functions. contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. some basic operations on functions such as the inverse and composition are applicable to binary relations as well. depending on the domain or range or both are fuzzy value fuzzy set, i...
the present thesis is going to investigate the theme of despair, darkness and pesimism in philip larkins poetry. larkin is a british poet whose poems were composed in the dark and gloomy years of postwar. so, his poetry contains and reflects the same darkness and despair of his age. a good number of poems form different collections of his poetry are chosen and will be analyzed in the light of t...
در این پایان نامه که بر مبنای مقاله ذیل نوشته می شود، مفهومی از تکامل و یک نوع کامل سازی در غیاب اصل انتخاب شمارا ارائه می شود. این کار ساخت اعداد حقیقی و کامل سازی یک فضای متری را در بر می گیرد. مجموعه اعداد حقیقی به عنوان یک میدان هیتینگ ارشمیدسی کامل که یک شئ پایانی در رسته میدان های هیتینگ ارشمیدسی می باشد، طبقه بندی می شود f. richman, real number and other completions, math. lo...
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید