نتایج جستجو برای: ویتامین k2
تعداد نتایج: 9542 فیلتر نتایج به سال:
We present a catalog of 11 multiplanet systems from Campaigns 1 and 2 of the K2 mission. We report the sizes and orbits of 26 planets split between seven two-planet systems and four three-planet systems. These planets stem from a systematic search of the K2 photometry for all dwarf stars observed by K2 in these fields. We precisely characterized the host stars with adaptive optics imaging and a...
The solutions to the Einstein-Klein-Gordon equations without a cosmological constant are investigated for an exponential potential in a Bianchi VI0 metric. There exists a two-parameter family of solutions which have a power-law inflationary behaviour when the exponent of the potential, k, satisfies k2 < 2. In addition, there exists a twoparameter family of singular solutions for all k2 values. ...
این پایان نامه در چهار فصل تنظیم شده است. در فصل اول به تعاریف، مفاهیم و قضایای اولیه مورد نیاز از جمله مجموعه های مرتب و انواع ترتیب، اعداد ترتیبی و اعداد اصلی، تعاریف جبری، pi-حلقه ها، جبر ویل، کرانداری و نظریه تاب موروثی و ... پرداخته ایم. در فصل دوم مفاهیم بعد گلدی و حلقه گلدی را طرح کرده ایم و ثابت کردیم که اگر m یک مدول با بعد گلدی متناهی باشدو k1,k2 زیر مدول های m باشند بطوریکه اشتراک k...
A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG). There are basically two methods used for learning Bayesian network: parameter-learning and structure-learning. One of the most effective structure-learning methods is K2 algorithm. Because the performance of the K2 algorithm depends on node...
Finite obstruction set characterizations for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. In this paper we characterize several families of graphs with small feedback sets, namely k1-Feedback Vertex Set, k2-Feedback Edge Set and (k1,k2){Feedback Vertex/Edge Set, for small integer parameters k1 and k2. Our constructive methods can compute obstruction sets f...
The trunk of a knot in S3, defined by Makoto Ozawa, is a measure of geometric complexity similar to the bridge number or width of a knot. We prove that for any two knots K1 and K2, we have tr(K1#K2)= max{tr(K1), tr(K2)}, confirming a conjecture of Ozawa. Another conjecture of Ozawa asserts that any width-minimizing embedding of a knot K also minimizes the trunk of K. We produce several families...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید