Evolution in design of integral leg prosthesis leads to improved outcomes

Developments of surgical attachments for bone-anchored prostheses are slowly but surely winning over the initial disbelief in the orthopedic community. Clearly, this option is becoming accessible to a wide range of individuals with limb loss. Seminal studies have demonstrated that the pioneering procedure relying on screw-type fixation engenders major clinical benefits and acceptable safety. The surgical procedure for press-fit implants, such as the Integral-Leg-Prosthesis (ILP) has been described Dr Aschoff and his team. Some clinical benefits of press-fit implants have been also established. Here, his team is once again taking a leading role by sharing the progression over 15 years of the rate of deep infections for 69 individuals with transfemoral amputation fitted with three successive refined versions of the ILP. By definition, a double-blind randomized clinical trial to test the effect of different fixation’s design is difficult. Alternatively, Juhnke and colleagues are reporting the outcomes of action-research study for a cohort of participants. The first and foremost important outcome of this study is the confirmation that the current design of the IPL and rehabilitation program are altogether leading to an acceptable rate of deep infection and other adverse events (e.g., structural failure of implant, periprosthetic factures). This study is also providing a strong insight onto the effect of major phases in redesign of an implant on the risk of infection. This is an important reminder that the development of a successful osseointegrated implant is unlikely to be immediate but the results of a learning curve made of empirical and sequential changes led by a reflective clinical practice. Clearly, this study provided better understanding of the safety of the ILP surgical and rehabilitation procedure while establishing standards and benchmark data for future studies focusing on design and infection of press-fit implants. Complementary observations of relationship between infection and cofounders such as loading of the prosthesis and prosthetic components used would be beneficial.Further definitive evidences of the clinical benefits with the latest design would be valuable, although an increase in health related quality of life and functional outcomes are likely to be confirmed. Altogether, the authors are providing compelling evidence that bone-anchored attachments particularly those relying on press-fit implants are an established alternative to socket prostheses.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.

Derivation of the solution of certain singular integral equations

It is shown that the a;P?lication of the Poincare-Bertrand fcm~ulaw hen made in a suitable manner produces the s~lutiano f certain singular integral equations very quickly, thc method of arriving at which, otherwise, is too complicaled. Two singular integral equations are considered. One of these quaiions is with a Cauchy-tyge kcrnel arid the other is an equalion which appears in the a a w guide theory and the theory of dishcations. Adifferent approach i? alw made here to solve the singular integralquation> of the waveguide theor? ind this i ~ v o l v eth~e use of the inversion formula of the Cauchy-type singular integral equahn and dudion to a system of TIilberl problems for two unknowns which can be dwupled wry easily to obi& tbe closed form solutim of the irilegral equatlou at band. The methods of the prescnt paper avoid all the complicaled approaches of solving the singular integral equaticn of the waveguide theory knowr todate.

A necessary and sufficient condition for acyclic graphs

This letter gives a new necessary and sufficient condition to determine whether a directed graph is acyclic.

Spectral analysis of finite section normal integral operators

Some continuity and differentiability properties of the eigenvalues and eigenfunctions of finite section normal integral operators are proved. These are the extension of corresponding results for symmetric operators ([4.], 554–566; K. B. Athreya and R. Vittal Rao, to appear; [10.], 463–471.

Kac-Akhiezer formula for normal integral operators

The Kac-Akhiezer formula for finite section normal Wiener-Hopf integral operators is proved. This is an extension of the corresponding result for symmetric operator [2, 3, 4, 5, 6, 7].

Improvement On Brooks Chromatic Bound For A Class Of Graphs

Brooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5−e and H) as an induced subgraph and if Δ(G)greater-or-equal, slanted6 and d(G)<Δ(G), then χ(G)<Δ(G). Also we give examples to show that the hypothesis Δ(G)greater-or-equal, slanted6 can not be non-trivially relaxed and the graph K5−e can not be removed from the hypothesis. Moreover, for a graph G with none of K1,3;K5−e and H as an induced subgraph, we verify Borodin and Kostochka's conjecture that if for a graph G,Δ(G)greater-or-equal, slanted9 and d(G)<Δ(G), then χ(G)<Δ(G).

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

On solitons with half integral charge

Can certain soliton states, with half integral expectation value of charge, be also eigenstates of charge X with half integral eigenvalue? It can be so only with a somewhat sophisticated definition of charge.

Some direct numerical approaches to the solution of the singular nonlinear transonic integral equation

The nonlinear singular integral equation of transonic flow is examined, noting that standard numerical techniques are not applicable in solving it. The difficulties in approximating the integral term in this expression were solved by special methods mitigating the inaccuracies caused by standard approximations. It was shown how the infinite domain of integration can be reduced to a finite one; numerical results were plotted demonstrating that the methods proposed here improve accuracy and computational economy.

Water-wave scattering by two submerged plane vertical barriers-Abel integral-equation approach

The classical problem of surface water-wave scattering by two identical thin vertical barriers submerged in deep water and extending infinitely downwards from the same depth below the mean free surface, is reinvestigated here by an approach leading to the problem of solving a system of Abel integral equations. The reflection and transmission coefficients are obtained in terms of computable integrals. Known results for a single barrier are recovered as a limiting case as the separation distance between the two barriers tends to zero. The coefficients are depicted graphically in a number of figures which are identical with the corresponding figures given by Jarvis (J Inst Math Appl 7:207-215, 1971) who employed a completely different approach involving a Schwarz-Christoffel transformation of complex-variable theory to solve the problem.