1,045 research outputs found

    Distributive Lattices, Polyhedra, and Generalized Flow

    Full text link
    A D-polyhedron is a polyhedron PP such that if x,yx,y are in PP then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full characterization of the bounding hyperplanes of D-polyhedra. Aside from being a nice combination of geometric and order theoretic concepts, D-polyhedra are a unifying generalization of several distributive lattices which arise from graphs. In fact every D-polyhedron corresponds to a directed graph with arc-parameters, such that every point in the polyhedron corresponds to a vertex potential on the graph. Alternatively, an edge-based description of the point set can be given. The objects in this model are dual to generalized flows, i.e., dual to flows with gains and losses. These models can be specialized to yield some cases of distributive lattices that have been studied previously. Particular specializations are: lattices of flows of planar digraphs (Khuller, Naor and Klein), of α\alpha-orientations of planar graphs (Felsner), of c-orientations (Propp) and of Δ\Delta-bonds of digraphs (Felsner and Knauer). As an additional application we exhibit a distributive lattice structure on generalized flow of breakeven planar digraphs.Comment: 17 pages, 3 figure

    Calcitonin receptor-like receptor is expressed on gastrointestinal immune cells

    Get PDF
    Background/Aims: Pharmacological and morphological studies suggest that the gut mucosal immune system and local neuropeptide-containing neurones interact. We aimed to determine whether gut immune cells are targets for calcitonin gene-related peptide (CGRP), which has potent immune regulatory properties. Methods: Using density gradient centrifugation, rat lamina propria mononuclear cells (LP-MNCs) and intra-epithelial lymphocytes (IELs) were isolated. RT-PCR was employed for the detection of mRNA of rat calcitonin receptor-like receptor (CRLR), which is considered to represent the pharmacologically defined CGRP receptor-1 subtype, as well as mRNA of the receptor activity-modifying proteins, which are essential for CRLR function and determine ligand specificity. A radioreceptor assay was employed for the detection of specific CGRP binding sites. Results: RT-PCR and DNA sequencing showed that LP-MNCs and IELs express CRLR. Incubation of isolated LP-MNCs with radiolabelled alphaCGRP revealed the existence of specific binding sites for CGRP. Conclusion: These novel data indicate that mucosal immune cells of the rat gut are a target for CGRP and provide significant evidence that CGRP functions as an immune regulator in the gut mucosa. Copyright (C) 2002 S. Karger AG, Basel

    Minimum-Cost Coverage of Point Sets by Disks

    Full text link
    We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (t_j) and radii (r_j) that cover a given set of demand points Y in the plane at the smallest possible cost. We consider cost functions of the form sum_j f(r_j), where f(r)=r^alpha is the cost of transmission to radius r. Special cases arise for alpha=1 (sum of radii) and alpha=2 (total area); power consumption models in wireless network design often use an exponent alpha>2. Different scenarios arise according to possible restrictions on the transmission centers t_j, which may be constrained to belong to a given discrete set or to lie on a line, etc. We obtain several new results, including (a) exact and approximation algorithms for selecting transmission points t_j on a given line in order to cover demand points Y in the plane; (b) approximation algorithms (and an algebraic intractability result) for selecting an optimal line on which to place transmission points to cover Y; (c) a proof of NP-hardness for a discrete set of transmission points in the plane and any fixed alpha>1; and (d) a polynomial-time approximation scheme for the problem of computing a minimum cost covering tour (MCCT), in which the total cost is a linear combination of the transmission cost for the set of disks and the length of a tour/path that connects the centers of the disks.Comment: 10 pages, 4 figures, Latex, to appear in ACM Symposium on Computational Geometry 200

    Tularemia - possible increase and new risk factors

    Get PDF
    Purpose: Tularemia is a zoonotic disease caused by the bacterium Francisella tularensis. In Europe each year approximately 1200 human cases are reported. Four subspecies are currently known: tularensis (the most virulent form), holarctica (the most widespread form), mediasiatic, and novicida. In Austria Francisella tularensis supsp. holarctica is endemic in the eastern part of the country (Lower Austria and Burgenland), and is known to have a 5-year cycle. Zoonotic transmission from pet species in Europe has only been described in Norway due to a cat bite, as well as after an accidental exposure to the disease while spaying a cat. In 2014 first reports of clinically ill dogs were reported from Norway. Methods & Materials: As hunting with dogs has a long tradition in Austria, and as there are endemic areas for the disease a first serological screening of 80 hunting dogs used in the hunt for European brown hares (Lepus europaeus) was conducted. Results: Of these 80 dogs 5 tested positive for tularemia (6.25%, CI 2.1% - 14%). One positive dog had shown some clinical symptoms, however this female dog also tested positive for Brucella canis. Conclusion: This result shows that dogs not only have contact to the pathogen, but also seroconvert. The occurrence of the disease is thought to increase in the next years due to our changing climate, and this year there is a new hotspot of the disease in Austria (i.e. Salzburg). These changes, as well as the result of this study highlight the need to raise the awareness level of the disease, its possible increase and new risk factors

    Whole-brain metallomic analysis of the common marmoset (: Callithrix jacchus)

    Get PDF
    © 2017 The Royal Society of Chemistry. Despite the importance of transition metals for normal brain function, relatively little is known about the distribution of these elemental species across the different tissue compartments of the primate brain. In this study, we employed laser ablation-inductively coupled plasma-mass spectrometry on PFA-fixed brain sections obtained from two adult common marmosets. Concurrent cytoarchitectonic, myeloarchitectonic, and chemoarchitectonic measurements allowed for identification of the major neocortical, archaecortical, and subcortical divisions of the brain, and precise localisation of iron, manganese, and zinc concentrations within each division. Major findings across tissue compartments included: (1) differentiation of white matter tracts from grey matter based on manganese and zinc distribution; (2) high iron concentrations in the basal ganglia, cortex, and substantia nigra; (3) co-localization of high concentrations of iron and manganese in the primary sensory areas of the cerebral cortex; and (4) high manganese in the hippocampus. The marmoset has become a model species of choice for connectomic, aging, and transgenic studies in primates, and the application of metallomics to these disciplines has the potential to yield high translational and basic science value

    Covers of acts over monoids II

    Full text link
    In 1981 Edgar Enochs conjectured that every module has a flat cover and finally proved this in 2001. Since then a great deal of effort has been spent on studying different types of covers, for example injective and torsion free covers. In 2008, Mahmoudi and Renshaw initiated the study of flat covers of acts over monoids but their definition of cover was slightly different from that of Enochs. Recently, Bailey and Renshaw produced some preliminary results on the `other' type of cover and it is this work that is extended in this paper. We consider free, divisible, torsion free and injective covers and demonstrate that in some cases the results are quite different from the module case

    The endomorphisms monoids of graphs of order n with a minimum degree n − 3

    No full text
    We characterize the endomorphism monoids, End(G), of the generalized graphs G of order n with a minimum degree n − 3. Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of G are given
    corecore