نتایج جستجو برای: jensen operation

تعداد نتایج: 216391  

Journal: :بینا 0
مجید فروردین m farvardin شیراز- مرکز تحقیقات چشم پزشکی پوستچی عباس عطارزاده a atarzadeh شیراز- مرکز تحقیقات چشم پزشکی پوستچی سیدعلی بنی هاشمی a banihashemi شیراز- مرکز تحقیقات چشم پزشکی پوستچی

purpose: to evaluate the results of jensen procedure in correction of ocular deviation in patients with complete sixth nerve palsy. methods: hospital records of patients with complete sixth nerve palsy who underwent jensen procedure at khalili hospital of shiraz during 1993-2002 were studied and results of the operation were evaluated. results: of 18 patients including 14 male and 4 females, 19...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه گیلان - دانشکده علوم انسانی و پایه 1393

چکیده diphyllidea van beneden in carus, 1863 راسته ای است از رده eucestoda که گونه های آن همگی تنها در دریاها زیست کرده و از گونه های مختلف سفره ماهی و یک خانواده از کوسه ماهیان به عنوان میزبان نهایی استفاده می کنند. در این مطالعه گونه ای جدید از جنس coronocestus caira, marques, jensen, kuchta and ivanov, 2013 متعلق به راسته diphyllidea از یک گونه کوسه ماهی به نام iago omanensis (norman) از د...

Journal: :Bulletin of the Korean Mathematical Society 2008

2013
Lu Bai Edwin R. Hancock Lin Han

Riesen and Bunke recently proposed a novel dissimilarity based approach for embedding graphs into a vector space. One drawback of their approach is the computational cost graph edit operations required to compute the dissimilarity for graphs. In this paper we explore whether the Jensen-Shannon divergence can be used as a means of computing a fast similarity measure between a pair of graphs. We ...

Journal: :K&K - Kultur og Klasse 2000

Journal: :Slagmark - Tidsskrift for idéhistorie 2018

2005
John Michael Rassias Matina John Rassias David Eisenbud

In 1941 D.H. Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 D.G. Bourgin was the second author to treat the Ulam problem for additive mappings. In 1982–2005 we established the Hyers–Ulam stability for the Ulam problem of linear and nonlinear mappings. In 1998 S.-M. Jung and in 2002–2005 the authors of this paper investigated the Hyers–Ulam stability of additive ...

Journal: :Math. Program. 1999
András A. Benczúr András Frank

The minimum number of edges of an undirected graph covering a symmetric , supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation. 0. INTRODUCTION T. Watanabe and A. Nakamura 1987] proved a min-max formula for the minimum number of new edges whose addition to a given undirected graph...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید