Der Heilbronner Bund, 1632-1635.

Includes bibliography.

Is it necessary to re-fuse a non-union of a hallux metatarsophalangeal joint arthrodesis?

BACKGROUND: The standard treatment for a non-union of the hallux metatarsophalangeal joint fusion has been to revise the fusion. Revision fusion is technically more demanding, often involving bone grafting, more substantial fixation and prolonged period of immobilization postoperatively. We present data to suggest that removal of hardware and debridement alone is an alternative treatment option. ---------- MATERIALS AND METHODS: A case note review identified patients with a symptomatic non-union after hallux metatarsophalangeal joint (MTPJ) fusion. It is our practice to offer these patients revision fusion or removal of hardware and debridement. For the seven patients that chose hardware removal and were left with a pseudarthrosis, a matched control group was selected from patients who had had successful fusions. Three outcome scores were used. Hallux valgus and dorsiflexion angles were recorded.---------- RESULTS: One hundred thirty-nine hallux MTPJ arthrodeses were carried out. Fourteen non-unions were identified. The rate of non-union in males and following previous hallux MTPJ surgery was 19% and 24%, respectively. In females undergoing a primary MTPJ fusion, the rate was 2.4%. Twelve non-union patients were reviewed at 27 months (mean). Eleven patients had elected to undergo removal of hardware and debridement. Four patients with pseudarthrosis were unhappy with the results and proceeded to either revision fusion or MTPJ replacement. Seven non-union patients, who had removal of hardware alone, had outcome scores marginally worse compared to those with successful fusions.---------- CONCLUSION: Removal of hardware alone is a reasonable option to offer as a relatively minor procedure following a failed arthrodesis of the first MTPJ. This must be accepted on the proviso that in this study four out of 11 (36%) patients proceeded to a revision first MTPJ fusion or first MTPJ replacement. We also found that the rate of non-union in primary first MTPJ fusion was significantly higher in males and those patients who had undergone previous surgery.

Access to medicine and the dangers of patent linkage : lessons from Bayer Corp v. Union of India

In February 2010, the Delhi High Court delivered its decision in Bayer Corp v Union of India in which Bayer had appealed against an August 2009 decision of the same court. Both decisions prevented Bayer from introducing the concept of patent linkage into India’s drug regulatory regime. Bayer appealed to the Indian Supreme Court, the highest court in India, which agreed on 2 March 2010 to hear the appeal. Given that India is regarded as a global pharmaceutical manufacturer of generic medications, how its judiciary and government perceive their international obligations has a significant impact on the global access to medicines regime. In rejecting the application of patent linkage, the case provides an opportunity for India to further acknowledge its international human rights obligations.

Rabbi Leo Baeck's arrival at La Guardia Airport, New York from London for the Union of American Hebrew Congregations American Jewish Cavalcade Portraits; Groups

Sitting l-r Leo Baeck, Maurice N. Eisendrath, Oscar M. Lazrus; Standing l-r Jane Evans, Henry W. Levy, Saul Elgart, Rabbi Daniel L. Davis, Louis Rittenberg and Leonard H. Spring

Rabbi Leo Baeck's arrival at La Guardia Airport, New York from London for the Union of American Hebrew Congregations American Jewish Cavalcade Portraits; Groups

Sitting l-r Leo Baeck, Maurice N. Eisendrath, Oscar M. Lazrus; Standing l-r Jane Evans, Henry W. Levy, Saul Elgart, Rabbi Daniel L. Davis, Louis Rittenberg and Leonard H. Spring

Leo Baeck with Maurice N. Eisendrath, President of the Union of American Hebrew Congregations Portraits; Groups; Men

Page 24 of the "American Jewish Cavalcade" scrapbook of Leo Baeck in New York found in ROS 10 Folder 3

Leo Baeck with Maurice N. Eisendrath, President of the Union of American Hebrew Congregations Portraits; Groups; Men

Page 24 of the "American Jewish Cavalcade" scrapbook of Leo Baeck in New York found in ROS 10 Folder 3

Leo Baeck speaking, Maurice N. Eisendrath, President of the Union of American Hebrew Congregations, in background Portraits; Groups; Men

Page 23 of the "American Jewish Cavalcade" scrapbook of Leo Baeck in New York found in ROS 10 Folder 3

Leo Baeck with New York Mayor William O'Dwyer and Union of American Hebrew Congregations President Maurice N. Eisendrath, Oscar M. Lazrus and Rabbi Daniel L. Davis Portraits; Groups; Men

Page 12 of the "American Jewish Cavalcade" scrapbook of Leo Baeck in New York found in ROS 10 Folder 3

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Local polynomial convexity of the union of two totally-real surfaces at their intersection

We consider the following question: Let S (1) and S (2) be two smooth, totally-real surfaces in C-2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is S-1 boolean OR S-2 locally polynomially convex at the origin? If T (0) S (1) a (c) T (0) S (2) = {0}, then it is a folk result that the answer is yes. We discuss an obstruction to the presumed proof, and provide a different approach. When dim(R)(T0S1 boolean AND T0S2) = 1, we present a geometric condition under which no consistent answer to the above question exists. We then discuss conditions under which we can expect local polynomial convexity.

Computing Reeb Graphs as a Union of Contour Trees

The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. This paper describes a fast algorithm to compute the Reeb graph of a piecewise-linear (PL) function defined over manifolds and non-manifolds. The key idea in the proposed approach is to maximally leverage the efficient contour tree algorithm to compute the Reeb graph. The algorithm proceeds by dividing the input into a set of subvolumes that have loop-free Reeb graphs using the join tree of the scalar function and computes the Reeb graph by combining the contour trees of all the subvolumes. Since the key ingredient of this method is a series of union-find operations, the algorithm is fast in practice. Experimental results demonstrate that it outperforms current generic algorithms by a factor of up to two orders of magnitude, and has a performance on par with algorithms that are catered to restricted classes of input. The algorithm also extends to handle large data that do not fit in memory.