نتایج جستجو برای: cover test

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

پایان نامه :وزارت بهداشت، درمان و آموزش پزشکی - دانشگاه علوم پزشکی و خدمات بهداشتی درمانی استان کرمان 1376

به منظور تعیین شیوع و علل لوچی چشم در دانش آموزان مدارس راهنمایی شهرستان کرمانشاه در بهار سال 1376 (2981) نفر از دانش آموزان مقطع راهنمایی در دو مرحله مقدماتی و تکمیلی مورد معاینه و بررسی قرار گرفتند و در این مطالعه با استفاده از تست cover-un cover test از کل افراد مورد آزمون در معاینات مقدماتی 105 نفر مبتلا به فوریا بودند که در مطالعات بعدی از حیطه آزمون حذف گردیدند و 48 نفر مشکوک به تروپیا بو...

2015
Peter Damaschke

In a general combinatorial search problem with binary tests we are given a set of elements and a hypergraph of possible tests, and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexit...

Journal: :journal of rangeland science 2010
a. mirjalili

in this investigation, the effects of enclosure, restal delayed grazing andcontinued grazing treatments on the production rate and vegetation cover were studied.study area was sadrabad pasture. after selecting three bands (1+1+1=3 hectare area) asthree treatments in the restricted and non restricted area, they were transected to threetransects. then plots (1×2m2 ) were selected to measure the p...

2009
Rongxuan Lim Peggy Frith

The cover test is indispensable when assessing a patient with a suspected squint. This article reviews how the cover test is performed and also the limitations of the cover test. Further, information is provided on how to interpret the clinical signs derived from the cover test. Indeed, much about the squint nature, fixation pattern and fusion strength of the patient can be learnt from the cove...

2013
Manu Basavaraju Mathew C. Francis M. S. Ramanujan Saket Saurabh

In a typical covering problem we are given a universe U of size n, a family S (S could be given implicitly) of sizem and an integer k and the objective is to check whether there exists a subfamily S ′ ⊆ S of size at most k satisfying some desired properties. If S ′ is required to contain all the elements of U then it corresponds to the classical Set Cover problem. On the other hand if we requir...

Journal: :بینا 0
حامد مومنی مقدم h momeni-moghaddam rehabilitation school and health promotion research center, zahedan university of medical sciences, zahedan, iranزاهدان- خیابان آیت اله کفعمی- دانشکده علوم توانبخشی- کلینیک بینایی سنجی دانشگاه علوم پزشکی زاهدان فرشاد عسگری زاده f asgarizadeh rehabilitation school and health promotion research center, zahedan university of medical sciences, zahedan, iranزاهدان- خیابان آیت اله کفعمی- دانشکده علوم توانبخشی- کلینیک بینایی سنجی دانشگاه علوم پزشکی زاهدان مرضیه احسانی m ehsani rehabilitation school and health promotion research center, zahedan university of medical sciences, zahedan, iranزاهدان- خیابان آیت اله کفعمی- دانشکده علوم توانبخشی- کلینیک بینایی سنجی دانشگاه علوم پزشکی زاهدان محدثه امیدبخش پروش m omidbakhsh parush منا مهرآوران m mehravaran

purpose: to compare the effect of different deviation measurement techniques and different lens powers on gradient accommodative convergence to accommodation (ac/a) ratio. methods: we randomly selected 78 eligible students of different majors from zahedan university of medical sciences. following retinoscopy for refractive errors, alternate prism cover test, von graefe and maddox rod without ad...

Journal: :SIAM Journal on Discrete Mathematics 2016

Journal: :American journal of optometry and physiological optics 1983
E Peli G McCormack

The dynamics of unilateral cover test eye movements, never before systematically investigated with an objective recording system, are shown to be more complex than textbook accounts of them. We administered the cover test to nine heterophoric subjects by means of electromechanical occluders. Eye movements were recorded using the infrared photoelectric technique. Saccadic and vergence movements ...

Journal: :Electronic Notes in Discrete Mathematics 1999
M. Hayer Winfried Hochstättler

We describe the structure of the unique minimal test set T for a family of vertex cover problems. The set T corresponds to the Gröbner basis of the binomial ideal for the problem as described in [1]. While T has a surprisingly simple structure, in particular when the underlying graph is complete, it is NP -complete to decide whether the test set contains an improving element for a given feasibl...

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

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