Background: Limb salvaging surgeries are current surgical treatment of extremity bone sarcomas. Resected bonereplacement consists of two main methods; tumor prosthesis versus structural allograft. Biological reconstruction withan allograft is an economic cheap method in young sarcoma patients, however, the surgeons are more convinced withtumor prosthesis replacement.Methods: We evaluated the sh...

AbstractIntroduction Silicone gel breast implants are used for breast reconstruction post mastectomy. In the event of cancer recurrence, the radiation oncologists are forced to irradiate through the prosthesis device. Due to prosthesis higher atomic number dose perturbations occur during treatment. This study determined the influence of silicone gel thickness on the photon beam distribution. Ma...

Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring problem is NP-complete for many subclasses of perfect graphs. In this work we explore the complexity boundary between vertex coloring and list-coloring on such subclasses of perfect graphs, where the former admits polynomia...

In parallel computing, a valid graph coloring yields a lock-free processing of the colored tasks, data points, etc., without expensive synchronization mechanisms. However, coloring is not free and the overhead can be significant. In particular, for the bipartite-graph partial coloring (BGPC) and distance-2 graph coloring (D2GC) problems, which have various use-cases within the scientific comput...

An L(2, 1)-coloring of a graph G is a coloring of G’s vertices with integers in {0, 1, . . . , k} so that adjacent vertices’ colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2, 1)-coloring as a coloring. The span λ(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is λ(G), and the hole index ρ(G) of...

If a graph G contains no subgraph isomorphic to some graph H, then G is called H-free. A coloring of a graph G = (V,E) is a mapping c : V → {1, 2, . . .} such that no two adjacent vertices have the same color, i.e., c(u) 6= c(v) if uv ∈ E; if |c(V )| ≤ k then c is a k-coloring. The Coloring problem is to test whether a graph has a coloring with at most k colors for some integer k. The Precolori...

the finite element method (fem) is one of advanced methods in modeling of solid mechanics used in the design and analyzing of prosthesis in the human body. one of the important factors in designing a femur (the linkage between basin and knee) which is under complicated stresses is to minimize the amount of the stress in the components of the prosthesis due to the body weight. in this research t...

Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of following problems by k: (1) Given a graph G, clique modulator D (a is set vertices, whose removal results in clique) size k for list L(v) colors every v ∈ V(G), decide whether G has proper coloring; (2) pre-coloring λ_P: X → Q ⊆ λ_P can be extended coloring using only from Q. For Problem 1 we des...

Late binding and subtyping create run-time overhead for object-oriented languages. Dynamic typing and multiple inheritance create even more overhead. Static typing and single inheritance lead to two major invariants—of reference and position—that make the implementation as efficient as possible. Coloring is a technique that preserves these invariants for dynamic typing or multiple inheritance a...