This paper reports an algorithm for deletion of blends (or fillets) from Boundary Representation (B-rep) solid models. Blend deletion is usually performed as the first step in feature recognition since it simplifies the model for recognition of volumetric features. The algorithm handles several blend types that include face-face, face-edge and vertex blends. It also handles interactions of blen...

the myelodysplastic syndrome (mds) is a highly heterogenous disorder and karyotype analysis is helpful for diagnostic and prognostic estimation. deletion in long arm chromosome 6 (6q del) as a sole abnormality is a rare event in mds. this is the first case report of del (6q) as the only observed diagnostic change in iran. we also reviewed the literature of this cytogenetic lesion.

This work investigates the parameterized complexity of three related graph modification problems. Given a directed graph, a distinguished vertex, and a positive integer k, Minimum Indegree Deletion asks for a vertex subset of size at most k whose removal makes the distinguished vertex the only vertex with minimum indegree. Minimum Degree Deletion is analogously defined, but deals with undirecte...

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...

In this paper, we consider the problem of maintaining the centdians in a fully dynamic forest. A centdian is a location in the given network which minimizes a convex combination of the longest distance and the sum of distances from all clients to it. A fully dynamic forest is a forest, i.e., a set of trees, in which the following operations are allowed: to insert an edge between different trees...

CARMIL is an approximately 1,370-amino-acid cytoskeletal scaffold that has crucial roles in cell motility and tissue development through interactions with cytoskeletal effectors and regulation of capping protein at the leading edge. However, the mechanism of CARMIL leading edge localization is unknown. Here we show that CARMIL interacts directly with the plasma membrane through its amino-termin...

We study provably effective and efficient data reduction for a class of NP-hard graph modification problems based on vertex degree properties. We show fixed-parameter tractability for NP-hard graph completion (that is, edge addition) cases while we show that there is no hope to achieve analogous results for the corresponding vertex or edge deletion versions. Our algorithms are based on transfor...

An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance from G to G is the smallest number of edge-operations needed to modify G into a graph from G. In this paper, we fix a graph H and consider Forb(n,H), the set of all graphs on n vertices that have no induced copy of H. We ...

A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on n vertices is at most ⌊ n2 4 ⌋ and the extremal graph is the complete bipartite graph Kb 2 c,d 2 e. In the series papers [8–10], the Murty-Simon Conjecture stated by Haynes et al. is not th...