نتایج جستجو برای: cramer d w
تعداد نتایج: 739961 فیلتر نتایج به سال:
The distance d(va,vb) between two vertices of a simple connected graph G is the length shortest path va and vb. Vertices va,vb are considered to be resolved by vertex v if d(va,v)≠d(vb,v). An ordered set W={v1,v2,v3,…,vs}⊆V(G) said resolving for G, any va,vb∈V(G),∃vi∈W∋d(va,vi)≠d(vb,vi). representation with respect W denoted r(v|W) an s-vector(s-tuple) (d(v,v1),d(v,v2),d(v,v3),…,d(v,vs)). Using...
j k a l m ` n c n o b p q o ` a r s t c u v w b m a l x ` y w b a l o ` m x n u o ` a w d l c ` a m d v c x o n b w Y u o x z { l o n b w Y u o x m ` a w | k s a l o q m k k m k v n b w Y c Y m u m a t w y c a t n o w y ` a w d l c ` a m d n b w d o ` ` q l o b o a b c k ` m a m w k ` c b o n c b a m c u u t d w k a b w u u o s Y t a q w n u c t o b ` z X ` m x n u o ` a w d l c ` a m d v c x o...
Shannon[1] and Yavuz[2] estimated the entropy of real documents. This note drives an upper bound of entropy from the power law. Let D be a set of documents and f r(w) be the number of occurrences of a word w in the document. Given an interger k, we denote by F (k) the number of words whose frequency is k, i.e., F (k) = ♯{w ∈ D | f r(w) = k}. The entropy of the document set D is defined by E(D) ...
tumors of t h e male u ret h ra are r a re, co m prising <1% of urolo g ic malignancies. this is a re po rt of a 44-ye a r-old man pre s ented with a 4 -month history of gross initi a l h e maturia and d y s u ri a . af t e r exami n ing the pa t ien t , we found a firm mass ex t ending 1 c m within the p roxim a l bulb a r uret h ra and a pathologic report of moderately differen t iated sq u a...
در این پایان نامه تلاش شده است که از روی سیگنال های نوسانات فشار نسبی استاتیکی، مقادیر ضریب ماندگی و همچنین الگوهای جریان در سرعت های مختلف جریان دوفازی عمودی مایع-مایع پیش بینی شود. مایعات امتزاج ناپذیر انتخاب شده، آب و گازوئیل می باشند. محدوده سرعت ظاهری به کار رفته برای آب 36/1- 14/0 متر بر ثانیه و برای گازوئیل 85/0-057/0 متر بر ثانیه بوده است. با استفاده از عکس برداری سریع از قسمت اصلی آزما...
We introduce the perspex machine which unifies projective geometry and Turing computation and results in a supra-Turing machine. We show two ways in which the perspex machine unifies symbolic and non-symbolic AI. Firstly, we describe concrete geometrical models that map perspexes onto neural networks, some of which perform only symbolic operations. Secondly, we describe an abstract continuum of...
kefiran, extracted from kefir grains, is a water-soluble, glucogalactan containing almost equal amounts of d-glucose and d-galactose residues. throughout this research, kefiran and xanthan were added at concentrations of 3% (w/w flour basis) to two wheat dough samples to investigate the effects on the rheological and physical properties of french bread. physicochemical properties of wheat and i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید