Hand-assisted laparoscopic adrenalectomy: An alternative minimal invasive surgical technique for the adrenal gland

Background: Presently the surgical approach to the adrenal gland is in a state of flux. While the traditional approach to the adrenal gland has been the open transabdominal technique, more recently laparoscopic approaches, particularly via the transabdominal route, have increasingly been utilized. However, laparoscopic intervention for the adrenal gland can be problematic in certain circumstances, particularly for large adrenal masses and in instances of adrenal malignancies. Methods: In this report we describe the use of hand-assisted laparoscopic adrenalectomy as an alternative minimal invasive surgical approach to the adrenal gland. Hand-assisted laparoscopic adrenalectomy using the HandPort system (Smith & Nephew, Sydney, Australia) was undertaken in three patients requiring adrenalectomy for mass lesions including one patient with Conn's syndrome. Results: In all three cases, surgery proceeded promptly and uneventfully. In the present paper, the details of the technique of hand-assisted adrenalectomy are described. This is the first report in the world literature of this new technique for the adrenal gland. Conclusions: Hand-assisted laparoscopic adrenalectomy is an easily performed technique, which can be completed within a short operative time span and which has the advantage of providing intraoperative tactile localization for the adrenal gland. It may be particularly applicable for large adrenal tumours, yet only involves the performance of a small abdominal incision. Postoperative recovery is comparable with that reported for the laparoscopic-only technique. Hand-assisted adrenalectomy is a new technique which has great potential and which warrants further evaluation.

Skolem-type difference sets for cycle systems

Cyclic m-cycle systems of order v are constructed for all m greater than or equal to 3, and all v = 1(mod 2m). This result has been settled previously by several authors. In this paper, we provide a different solution, as a consequence of a more general result, which handles all cases using similar methods and which also allows us to prove necessary and sufficient conditions for the existence of a cyclic m-cycle system of K-v - F for all m greater than or equal to 3, and all v = 2(mod 2m).

Link invariants associated with gauge equivalent solutions of the Yang-Baxter equation: The one-parameter family of minimal typical representations of Uq[gl(2|1)]

In this paper we investigate the construction of state models for link invariants using representations of the braid group obtained from various gauge choices for a solution of the trigonometric Yang-Baxter equation. Our results show that it is possible to obtain invariants of regular isotopy (as defined by Kauffman) which may not be ambient isotopic. We illustrate our results with explicit computations using solutions of the trigonometric Yang-Baxter equation associated with the one-parameter family of minimal typical representations of the quantum superalgebra U-q,[gl(2/1)]. We have implemented MATHEMATICA code to evaluate the invariants for all prime knots up to 10 crossings.

Large sets of large sets of Steiner triple systems of order 9

We describe a direct method of partitioning the 840 Steiner triple systems of order 9 into 120 large sets. The method produces partitions in which all of the large sets are isomorphic and we apply the method to each of the two non-isomorphic large sets of STS(9).

Minimal mutation of the cytoplasmic tail inhibits the ability of E-cadherin to activate Rac but not phosphatidylinositol 3-kinase - Direct evidence of a role for cadherin-activated Rac signaling in adhesion and contact formation

Classic cadherins are adhesion-activated cell signaling receptors. In particular, homophilic cadherin ligation can directly activate Rho family GTPases and phosphatidylinositol 3-kinase (PI3-kinase), signaling molecules with the capacity to support the morphogenetic effects of these adhesion molecules during development and disease. However, the molecular basis for cadherin signaling has not been elucidated, nor is its precise contribution to cadherin function yet understood. One attractive hypothesis is that cadherin-activated signaling participates in stabilizing adhesive contacts ( Yap, A. S., and Kovacs, E. M. ( 2003) J. Cell Biol. 160, 11-16). We now report that minimal mutation of the cadherin cytoplasmic tail to uncouple binding of p120-ctn ablated the ability of E-cadherin to activate Rac. This was accompanied by profound defects in the capacity of cells to establish stable adhesive contacts, defects that were rescued by sustained Rac signaling. These data provide direct evidence for a role of cadherin-activated Rac signaling in contact formation and adhesive stabilization. In contrast, cadherin-activated PI3-kinase signaling was not affected by loss of p120-ctn binding. The molecular requirements for E-cadherin to activate Rac signaling thus appear distinct from those that stimulate PI3-kinase, and we postulate that p120-ctn may play a central role in the E-cadherin-Rac signaling pathway.

Balanced critical sets in Latin squares

In this note we first introduce balanced critical sets and near balanced critical sets in Latin squares. Then we prove that there exist balanced critical sets in the back circulant Latin squares of order 3n for n even. Using this result we decompose the back circulant Latin squares of order 3n, n even, into three isotopic and disjoint balanced critical sets each of size 3n. We also find near balanced critical sets in the back circulant Latin squares of order 3n for n odd. Finally, we examine representatives of each main class of Latin squares of order up to six in order to determine which main classes contain balanced or near balanced critical sets.

A census of critical sets in the Latin squares of order at most six

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is deleted, the remaining set can be embedded, in more than one Latin square of order n.. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the number of main and isotopy classes of these critical sets and classify critical sets from the main classes into various strengths. Some observations are made about the relationship between the numbers of classes, particularly in the 6 x 6 case. Finally some examples are given of each type of critical set.

Two-Dimensional Failure Modeling with Minimal Repair

In this paper, we discuss two-dimensional failure modeling for a system where degradation is due to age and usage. We extend the concept of minimal repair for the one-dimensional case to the two-dimensional case and characterize the failures over a two-dimensional region under minimal repair. An application of this important result to a rnanufacturer's servicing costs for a two-dimensional warranty policy is given and we compare the minimal repair strategy with the strategy of replacement of failure. (C) 2003 Wiley Periodicals, Inc.

An investigation of 2-critical sets in latin squares

In this paper we focus on the existence of 2-critical sets in the latin square corresponding to the elementary abelian 2-group of order 2(n). It has been shown by Stinson and van Rees that this latin square contains a 2-critical set of volume 4(n) - 3(n). We provide constructions for 2-critical sets containing 4(n) - 3(n) + 1 - (2(k-1) + 2(m-1) + 2(n-(k+m+1))) entries, where 1 less than or equal to k less than or equal to n and 1 less than or equal to m less than or equal to n - k. That is, we construct 2-critical sets for certain values less than 4(n) - 3(n) + 1 - 3 (.) 2([n /3]-1). The results raise the interesting question of whether, for the given latin square, it is possible to construct 2-critical sets of volume m, where 4(n) - 3(n) + 1 - 3 (.) 2([n/3]-1) < m < 4(n) - 3(n).

Mixed partitions of sets of triples into small planes

We continue our study of partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. We develop further necessary conditions for the existence of partitions of such sets into copies of PG(2, 2) and copies of AG(2, 3), and deal with the cases v = 13, 14, 15 and 17. These partitions, together with those already known for v = 12, 16 and 18, then become starters for recursive constructions of further infinite families of partitions. (C) 2004 Elsevier B.V. All rights reserved.