نتایج جستجو برای: filling arrangement
تعداد نتایج: 72375 فیلتر نتایج به سال:
Graphene, a single layer of carbon atoms bonded in a hexagonal lattice, is the thinnest, strongest, and stiffest known material and an excellent conductor of heat and electricity. However, these superior properties have yet to be realized for graphene-derived macroscopic structures such as graphene fibers. We report the fabrication of graphene fibers with high thermal and electrical conductivit...
Background: Presence of artifacts, caused by dental filling high-Z materials (DFM), on intensity-modulated radiation therapy (IMRT) treatment plan CT images may lead to uncertainty in head and neck calculated dose distributions. Hence, the purpose of this study was to investigate the effects of DFM on the IMRT calculated dose distribution and consequent radiobiological derived outcomes for naso...
ویژگی اصلی شبکه های سنسوری بی سیم رادیوآگاه که آنها را از دیگر شبکه های سنسوری متمایز می کند قابلیت آنها در ارسال روی باندهای مشترک و تحت استفاده ی کاربر اولیه می باشد. با فرض اینکه یک باند فرکانسی از طریق یک کاربر اولیه اشغال شده باشد، می توان با به کارگیری تکنیک هایی چون fcm, svd وwater-filling ، بهترین آنتن ها را از میان آنتن های کاربرهای ثانویه ی رادیوآگاه که نوعی از سیستم های چند آنتنه هست...
It is shown that if M is a compact, connected, orientable hyperbolic 3-manifold whose boundary is a torus, and 7‘1, FZ are two slopes on i7M whose associated fillings are respectively a reducible manifold and one containing an essential torus, then the distance between these slopes is bounded above by 4. Under additional hypotheses this bound is improved Consequently the cabling conjecture is s...
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration algorithm for arrangements with a given support, based on the properties of certain greedy pseudoline arrangements and on their connection with sorting networks....
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and spheres in 3d. As expected, the densest packing is achieved with power-law size distributions. We also test the method on homogeneous and on empirical real ...
where τb = κρH is the optical depth of individual clumps or blobs, withH = l/f the “porosity length” for clumps of scale l and volume filling factor f . Note that optically thin blobs (τb ≪ 1) recover the non-porous limit, κeff → κ, whereas the limit of optically thick blobs (τb ≫ 1) has an effective opacity given by the ratio of their area l to mass mb(= l ρ/f = lρH), i.e. κeff → 1/ρH. The eff...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید