conclusions complete recovery of the hand and finger extension was achieved in nine months. case presentation a 61 year-old man presented with the chief complaint of inability to extend the wrist and the fingers of the left hand which began suddenly the night before admission, following a three-week history of pain, numbness and tingling sensation of the affected extremity. he had no history of...

A new family of interpolatory stationary subdivision schemes is introduced by using radial basis function interpolation. This work extends earlier studies on interpolatory stationary subdivision schemes in two aspects. First, it provides a wider class of interpolatory schemes; each 2L-point interpolatory scheme has the freedom of choosing a degree (say, m) of polynomial reproducing. Depending o...

A new scheme for the reconstruction of large geometric data is presented. It is based on the wellknown radial basis function model combined with an adaptive spatial and functional subdivision associated with a family of functions called partition of unity. This combination offers robust and efficient solution to a great variety of 2D and 3D reconstruction problems, such as the reconstruction of...

Background: Aim of this study was to compare the clinical and radiological long-term outcomes following operativetreatment of comminuted radial head fractures using 1) primary radial head resection arthroplasty, 2) acute radial headresection, or 3) necessary secondary prosthetic removal. Additionally, we evaluated complex radial head fracturescombined with elbow dislocation and verified the hyp...

a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the li...

The paper presents a visualisation of a hierarchical structure discovered in a repository of geographical metadata by clustering. The hierarchical structure is visualised as a radial tree. The clusters at different levels of detail are represented by the vertices and the subset relationship between the clusters by the edges of the tree. The similarity between elements in different clusters is s...

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

We demonstrate a collection of techniques that seek to make the transition between drawings based on two topologically distinct spanning trees of the same graph as clear as possible. As Herman, Melançon, and Marshall note [HMM00], one way to draw a large graph is to extract a spanning tree from it, use a tree layout algorithm [CK95, Ead92, RT81, II90, TM02, GADM04, LY05] to draw the spanning tr...

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...