نتایج جستجو برای: packing

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

Journal: :bulletin of emergency and trauma 0
mehrzad banihashemi azam safari navid nezafat mahmoodreza tahamtan manica negahdaripour negar azarpira

objective: to evaluate the effect of fibrin perihepatic packing on controlling liver hemorrhage and liver wound healing. methods: in this animal experimental study, 20 adult male sprague dawley rats, weighing 200-220 g, were included. stab wound injury was created by number 15 scalpel, so that bilateral liver capsules and liver tissue were cut, and acute bleeding was accrued. the animals were d...

ژورنال: یافته 2009
دالوند, شبنم , رشیدی, رجب, ساکی, رامش , طرهانی, سکینه , طرهانی, فریبا ,

Background: A large number of students tend to carry school backpacks. Carring heavy backpacks is increasingly putting the students at risk, and may cause long term damage to their growing body. This survey was conducted on Khorramabad primary school students to determine if their backpacks are too heavy and the methods of packing and wearing them, and history of back pain among them. Mater...

ژورنال: طب کار 2013

Background: Different packing materials are used in wet scrubbers that each one has its own advantages and limitations. Common ceramic packing materials have high removal efficiency but they are heavy, fragile and high head loss along the bed. Finding a suitable replacement for these materials has always been concerned by researchers. The objective of the present study was to compare the ...

Journal: :Electr. J. Comb. 1997
Yair Caro Raphael Yuster

Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...

Journal: :Journal of Mathematical Analysis and Applications 2006

Journal: :Discrete Optimization 2021

We continue the study of two recently introduced bin packing type problems, called with clustering, and online delays. A input consists items sizes not larger than 1, goal is to partition or pack them into bins, where total size every valid cannotexceed 1. In also have colors associated them. globally optimal solution can combine different while a clustered only monochromatic bins. The compare ...

Journal: :Discrete Mathematics 1997

Journal: :Nature Reviews Microbiology 2017

Journal: :Archives of Pediatrics & Adolescent Medicine 2003

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

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