نتایج جستجو برای: mean distance and diameter additionally

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

Journal: :بیهوشی و درد 0
فرناد ایمانی farnad imani, mehran rezvani, poupak rahimzadeh, mahmoudreza alebouyeh علیرضا عبدالله زاده بقایی

aim and background:   one of interventional procedure in pain specialty is stellate ganglion block. in this study we tried to show more on the sonoanatomy of the area, including the diameter of longus coli muscle and the distance between sixth cervical transverse process and the surface of skin. obviously, understanding different anatomical locations can help to more successful block and avoid ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اصفهان - دانشکده زبانهای خارجی 1390

this study was conducted to investigate the impact of podcasts as a learning and teaching tool on iranian efl learners’ motivation for listening as well as on their listening comprehension ability. the study also investigated the learners’ perception towards listening to podcasts and examined whether the learners were likely to accept podcasts. out of fifty-five intermediate learners studying e...

پایان نامه :0 1374

the following null hypothesis was proposed: h : there is no significant difference between the use of semantically or communicatively translates scientific texts. to test the null hypothesis, a number of procedures were taken first, two passages were selected form soyrcebooks of food and nutrition industry and gardening deciplines. each, in turn, was following by a number of comprehension quest...

Journal: Nanomedicine Journal 2016

Objective(s): In this study, drug loaded electrospun nanofibrous mats were prepared and drug release and mechanism from prepared nanofibers were investigated.  Materials and Methods: Paclitaxel (PTX) loaded polylactic acid (PLA) nanofibers were prepared by electrospinning. The effects of process parameters, such as PTX concentration, tip to collector distance, voltage, temperature and flow rate...

Journal: :Electr. J. Comb. 2000
Miguel Angel Fiol

A graph Γ with diameter d is strongly distance-regular if Γ is distanceregular and its distance-d graph Γd is strongly regular. The known examples are all the connected strongly regular graphs (i.e. d = 2), all the antipodal distanceregular graphs, and some distance-regular graphs with diameter d = 3. The main result in this paper is a characterization of these graphs (among regular graphs with...

Journal: :journal of dental research, dental clinics, dental prospects 0
fariba saleh saber nader abolfazli maryam kohsoltani

background and aims. the condensation silicone impression materials are available, but there is little knowledge of their accuracy after disinfection. the objective of this study was to evaluate the effect of the disinfection by spray atomization on dimensional accuracy of condensation silicone impressions. materials and methods. impressions were made on a stainless steel master model containin...

2002
Tyler E. Nordgren

We present observations of the galactic cepheids η Aql and ζ Gem. Our observations are able to resolve the diameter changes associated with pulsation. This allows us to determine the distance to the Cepheids independent of photometric observations. We determine a distance to η Aql of 320 ± 32 pc, and a distance to ζ Gem of 362±38 pc. These observations allow us to calibrate surface brightness r...

2002
Tyler E. Nordgren

We present observations of the galactic cepheids η Aql and ζ Gem. Our observations are able to resolve the diameter changes associated with pulsation. This allows us to determine the distance to the Cepheids independent of photometric observations. We determine a distance to η Aql of 320 ± 32 pc, and a distance to ζ Gem of 362±38 pc. These observations allow us to calibrate surface brightness r...

Journal: :Des. Codes Cryptography 2017
Victor Diego Miguel Angel Fiol

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. A graph Γ = (V,E) with diameter D is distance meanregular when, for given u ∈ V , the averages of the intersection numbers ai(u, v), bi(u, v), and ci(u, v) (defined as usual), computed over all vertices v at distance i = 0, 1, . . . , D from u, do...

Journal: :Australasian J. Combinatorics 2001
Selma Djelloul Mekkia Kouider

In this paper we study the average distance in weighted graphs. More precisely, we consider assignments of families of non-negative weights to the edges. The aim is to maximise (minimise, respectively) the average distance in the resulting weighted graph. Two variants of the problem are considered depending on whether the collection of weights is fixed or not. The main results of this paper are...

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

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