A Comparison of Two Invagination Techniques for Pancreatojejunostomy after Pancreatoduodenectomy

Background. The aim of the study was to compare two invagination techniques for pancreatojejunostomy after pancreatoduodenectomy. Methods. For effective prevention of the development of pancreatic leakage, we modified invagination technique that we term the “serous touch.” We analysed the diameter of the main pancreatic duct, the texture of the remnant pancreas, the method of the reconstruction, pancreatic external drainage, anastomotic procedure time, histopathological examination, and postoperative complications. Results. Fifty-two patients underwent pancreatoduodenectomy with pancreatojejunostomy using “serous touch” technique (ST group) and 52 classic pancreatojejunostomy (C group). In the ST group one patient (1.9%) was diagnosed as grade B pancreatic fistula, and no patient experienced fistula grade A or C. In the C group 6 patients (11.5%) were diagnosed as fistula grade A, 1 (1.9%) patient as fistula grade B, and 1 (1.9%) patient as fistula grade C. There was a significant statistical difference in incidents of pancreatic fistula (P<0.05) and no statistical difference in other postoperative complications or mortality in comparison group. Anastomosis time was statistically shorter in the ST group. Conclusions. “Serous touch” technique appeared to be easy, safe, associated with fewer incidences of pancreatic fistulas, and less time consuming in comparison with classical pancreatojejunostomy

Nitrated α–Synuclein Immunity Accelerates Degeneration of Nigral Dopaminergic Neurons

The neuropathology of Parkinson's disease (PD) includes loss of dopaminergic neurons in the substantia nigra, nitrated alpha-synuclein (N-alpha-Syn) enriched intraneuronal inclusions or Lewy bodies and neuroinflammation. While the contribution of innate microglial inflammatory activities to disease are known, evidence for how adaptive immune mechanisms may affect the course of PD remains obscure. We reasoned that PD-associated oxidative protein modifications create novel antigenic epitopes capable of peripheral adaptive T cell responses that could affect nigrostriatal degeneration.Nitrotyrosine (NT)-modified alpha-Syn was detected readily in cervical lymph nodes (CLN) from 1-methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP) intoxicated mice. Antigen-presenting cells within the CLN showed increased surface expression of major histocompatibility complex class II, initiating the molecular machinery necessary for efficient antigen presentation. MPTP-treated mice produced antibodies to native and nitrated alpha-Syn. Mice immunized with the NT-modified C-terminal tail fragment of alpha-Syn, but not native protein, generated robust T cell proliferative and pro-inflammatory secretory responses specific only for the modified antigen. T cells generated against the nitrated epitope do not respond to the unmodified protein. Mice deficient in T and B lymphocytes were resistant to MPTP-induced neurodegeneration. Transfer of T cells from mice immunized with N-alpha-Syn led to a robust neuroinflammatory response with accelerated dopaminergic cell loss.These data show that NT modifications within alpha-Syn, can bypass or break immunological tolerance and activate peripheral leukocytes in draining lymphoid tissue. A novel mechanism for disease is made in that NT modifications in alpha-Syn induce adaptive immune responses that exacerbate PD pathobiology. These results have implications for both the pathogenesis and treatment of this disabling neurodegenerative disease

Role of cyclooxygenase-2 gene polymorphisms in pancreatic carcinogenesis

AIM: To evaluate the clinical significance of -765G/C and -1195G/A cyclooxygenase-2 (COX-2) gene polymorphisms in patients with pancreatic cancer (PC)

Dualizability And Graph Algebras

. We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is either complete or bipartite complete (or a single point). 1. Introduction This paper serves two purposes: it provides a characterization of finite graph algebras which are dualizable, and it elaborates some techniques which promise to be useful in establishing that various finite algebras are not dualizable. Those techniques are also applied herein to sharpen some existing nondualizability results. It turns out that a finite graph algebra is dualizable if and only if each connected component of the underlying graph is either complete or complete bipartite (or a single point). This in turn is known to be equivalent to the graph algebra having a finitely axiomatizable equational theory. Graph algebras were introduced by C. Shallon in her dissertation [26] as a general framework for constructing finite algebras ..