Urinary Reflux - the Physician's Dilemma

Review of published literature on urinary reflu

The Renal Lymphatics - an Important Fluid Transport System

Study of renal lymph fluid transport syste

Perineal Abscess Secondary to Gas Gangrene - Use of Hyperbaric Oxygen as a Therapeutic Adjunct in a Case

Hyperbaric oxygen treatment of perineal abcess in human male with acute urinary tract difficult

On the word problem for SP-categories, and the properties of two-way communication

International audienceThe word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly interpreted as processes which communicate by two-way channels. The maps of an SP-category may also be viewed as a proof theory for a simple logic with a game theoretic intepretation. The cut-elimination procedure for this logic determines equality only up to certain permuting conversions. As the equality classes under these permuting conversions are finite, it is easy to see that equality between cut-free terms (even in the presence of the additive units) is decidable. Unfortunately, this does not yield a tractable decision algorithm as these equivalence classes can contain exponentially many terms. However, the rather special properties of these free categories -- and, thus, of two-way communication -- allow one to devise a tractable algorithm for equality. We show that, restricted to cut-free terms s,t : X --> A, the decision procedure runs in time polynomial on |X||A|, the product of the sizes of the domain and codomain type

Partiality and Container Monads

We investigate monads of partiality in Martin-Löf type theory, following Moggi’s general monad-based method for modelling effectful computations. These monads are often called lifting monads and appear in category theory with different but related definitions. In this paper, we unveil the relationship between containers and lifting monads. We show that the lifting monads usually employed in type theory can be specified in terms of containers. Moreover, we give a precise characterization of containers whose interpretations carry a lifting monad structure. We show that these conditions are tightly connected with Rosolini’s notion of dominance. We provide several examples, putting particular emphasis on Capretta’s delay monad and its quotiented variant, the non-termination monad

Expression of PEG11 and PEG11AS transcripts in normal and callipyge sheep

BACKGROUND: The callipyge mutation is located within an imprinted gene cluster on ovine chromosome 18. The callipyge trait exhibits polar overdominant inheritance due to the fact that only heterozygotes inheriting a mutant paternal allele (paternal heterozygotes) have a phenotype of muscle hypertrophy, reduced fat and a more compact skeleton. The mutation is a single A to G transition in an intergenic region that results in the increased expression of several genes within the imprinted cluster without changing their parent-of-origin allele-specific expression. RESULTS: There was a significant effect of genotype (p < 0.0001) on the transcript abundance of DLK1, PEG11, and MEG8 in the muscles of lambs with the callipyge allele. DLK1 and PEG11 transcript levels were elevated in the hypertrophied muscles of paternal heterozygous animals relative to animals of the other three genotypes. The PEG11 locus produces a single 6.5 kb transcript and two smaller antisense strand transcripts, referred to as PEG11AS, in skeletal muscle. PEG11AS transcripts were detectable over a 5.5 kb region beginning 1.2 kb upstream of the PEG11 start codon and spanning the entire open reading frame. Analysis of PEG11 expression by quantitative PCR shows a 200-fold induction in the hypertrophied muscles of paternal heterozygous animals and a 13-fold induction in homozygous callipyge animals. PEG11 transcripts were 14-fold more abundant than PEG11AS transcripts in the gluteus medius of paternal heterozygous animals. PEG11AS transcripts were expressed at higher levels than PEG11 transcripts in the gluteus medius of animals of the other three genotypes. CONCLUSIONS: The effect of the callipyge mutation has been to alter the expression of DLK1, GTL2, PEG11 and MEG8 in the hypertrophied skeletal muscles. Transcript abundance of DLK1 and PEG11 was highest in paternal heterozygous animals and exhibited polar overdominant gene expression patterns; therefore, both genes are candidates for causing skeletal muscle hypertrophy. There was unique relationship of PEG11 and PEG11AS transcript abundance in the paternal heterozygous animals that suggests a RNA interference mechanism may have a role in PEG11 gene regulation and polar overdominance in callipyge sheep

The Imprinted Retrotransposon-Like Gene PEG11 (RTL1) Is Expressed as a Full-Length Protein in Skeletal Muscle from Callipyge Sheep

peer-reviewedMembers of the Ty3-Gypsy retrotransposon family are rare in mammalian genomes despite their abundance in invertebrates and some vertebrates. These elements contain a gag-pol-like structure characteristic of retroviruses but have lost their ability to retrotranspose into the mammalian genome and are thought to be inactive relics of ancient retrotransposition events. One of these retrotransposon-like elements, PEG11 (also called RTL1) is located at the distal end of ovine chromosome 18 within an imprinted gene cluster that is highly conserved in placental mammals. The region contains several conserved imprinted genes including BEGAIN, DLK1, DAT, GTL2 (MEG3), PEG11 (RTL1), PEG11as, MEG8, MIRG and DIO3. An intergenic point mutation between DLK1 and GTL2 causes muscle hypertrophy in callipyge sheep and is associated with large changes in expression of the genes linked in cis between DLK1 and MEG8. It has been suggested that over-expression of DLK1 is the effector of the callipyge phenotype; however, PEG11 gene expression is also strongly correlated with the emergence of the muscling phenotype as a function of genotype, muscle type and developmental stage. To date, there has been no direct evidence that PEG11 encodes a protein, especially as its anti-sense transcript (PEG11as) contains six miRNA that cause cleavage of the PEG11 transcript. Using immunological and mass spectrometry approaches we have directly identified the full-length PEG11 protein from postnatal nuclear preparations of callipyge skeletal muscle and conclude that its over-expression may be involved in inducing muscle hypertrophy. The developmental expression pattern of the PEG11 gene is consistent with the callipyge mutation causing recapitulation of the normal fetal-like gene expression program during postnatal development. Analysis of the PEG11 sequence indicates strong conservation of the regions encoding the antisense microRNA and in at least two cases these correspond with structural or functional domains of the protein suggesting co-evolution of the sense and antisense genes

Fixed-point elimination in the intuitionistic propositional calculus

It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras are not complete as lattices. The reason is that these extremal fixed-points are definable by formulas of the IPC. Consequently, the $\mu$-calculus based on intuitionistic logic is trivial, every $\mu$-formula being equivalent to a fixed-point free formula. We give in this paper an axiomatization of least and greatest fixed-points of formulas, and an algorithm to compute a fixed-point free formula equivalent to a given $\mu$-formula. The axiomatization of the greatest fixed-point is simple. The axiomatization of the least fixed-point is more complex, in particular every monotone formula converges to its least fixed-point by Kleene's iteration in a finite number of steps, but there is no uniform upper bound on the number of iterations. We extract, out of the algorithm, upper bounds for such n, depending on the size of the formula. For some formulas, we show that these upper bounds are polynomial and optimal

A Metalanguage for Guarded Iteration

Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of guardedness in symmetric monoidal categories, which serves as a unifying framework for various examples from program semantics, process algebra, and beyond. In the present paper, we propose a generic metalanguage for guarded iteration based on combining this notion with the fine-grain call-by-value paradigm, which we intend as a unifying programming language for guarded and unguarded iteration in the presence of computational effects. We give a generic (categorical) semantics of this language over a suitable class of strong monads supporting guarded iteration, and show it to be in touch with the standard operational behaviour of iteration by giving a concrete big-step operational semantics for a certain specific instance of the metalanguage and establishing soundness and (computational) adequacy for this case.Comment: extended version for the special issu