نتایج جستجو برای: magic f polymer gel dosimeter
تعداد نتایج: 505553 فیلتر نتایج به سال:
Introduction: Magnetic resonance imaging dependent polymer gel dosimetry is a technique that offers unique advantages for implementing increasingly complex radiotherapy procedures, due to the high spatial resolution and volumetric dosimetry capabilities. The technique involves the estimation of radiation dose distribution based on the changes in MR relaxation parameters caused by radiation indu...
Excessive water production through fractures become an important problem in oil exploration of fractured reservoirs. For this purpose, polymer gels were prepared by crosslinking of aqueous solutions of polymer and crosslinker for the purpose of water management in high water cut fractured reservoirs. A copolymer of sulfonated polyacrylamide was used as polymer and chromium triacetate (Cr(OA...
Polymer gels are regarded as a potential dosimeter for independent validation of absorbed doses in clinical radiotherapy. Several imaging modalities have been used to convert radiation-induced polymerization to absorbed doses from a macro-scale viewpoint. This study developed a novel dose conversion mechanism by texture analysis of scanning electron microscopy (SEM) images. The modified N-isopr...
A (p,q) graph G is called super edge-magic if there exists a bijective function f from V (G) ∪ E(G) to {1, 2,. .. , p + q} such that f (x) + f (xy) + f (y) is a constant k for every edge xy of G and f (V (G)) = {1, 2,. .. , p}. Furthermore, the super edge-magic deficiency of a graph G is either the minimum nonnegative integer n such that G ∪ nK 1 is super edge-magic or +∞ if there exists no suc...
Z k-magic labelings of fans and wheels with magic-value zero Abstract Let A be a non-trivial abelian group and A * = A − {0}. A graph is A-magic if there exists an edge labeling using elements of A * which induces a constant vertex labeling of the graph. For fan graphs F n and wheel graphs W n , we determine the sets of numbers k ∈ N, where F n and W n have Z k-magic labelings with magic-value 0.
Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer k such that ∑ u∈N(v) f(u) = k for all v ∈ V, where N(v) is the open neighborhood of v. The constant k is called the magic constant of the labeling f . Any graph which admits a distance magic labeling is called a distance magic graph. In this pape...
One of treatment planning techniques with Leksell GammaPlan (LGP) for Gamma Knife stereotactic radiosurgery (GKSRS) uses multiple matrices with multiple dose prescriptions. Computational complexity increases when shots are placed in multiple matrices with different grid sizes. Hence, the experimental validation of LGP calculated dose distributions is needed for those cases. For the current stud...
Abstract. For any non-trivial abelian group A under addition a graph G is said to be A-magic if there exists a labeling f : E(G) → A − {0} such that, the vertex labeling f defined as f(v) = ∑ f(uv) taken over all edges uv incident at v is a constant. An A-magic graph G is said to be Zk-magic graph if the group A is Zk, the group of integers modulo k and these graphs are referred as k-magic grap...
The aim of the present study was to formulate and evaluate nystatin containing thermosensitive mucoadhesive gel for vaginal drug delivery to achieve prolonging the residence time, sustained drug release, enhancing efficacy, decreasing recurrence, and increasing patient compliance in the treatment for vaginal candidiasis. Here nystatin (1%) as a model drug. A 3 full factorial design was employed...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید