Lombardi Drawings of Graphs

We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.Comment: Expanded version of paper appearing in the 18th International Symposium on Graph Drawing (GD 2010). 13 pages, 7 figure

Алгоритм ведения больных с гнойными тубовариальными образованиями

ТАЗОВЫХ ОРГАНОВ ВОСПАЛИТЕЛЬНЫЕ БОЛЕЗНИАЛГОРИТМЫНАГНОЕНИЕБОЛЬНОГО ВЕДЕНИЕ ОПТИМАЛЬНО

STUDI EVALUATIF TENTANG MANAJEMEN SISTEM PERENCANAAN PENYUSUNAN PROGRAM DAN PEN6ANG6ARAN (SP4) PADA IKIP BANDUNG

While many studies have examined the barrier effects of large rivers on animal dispersal and gene flow, few studies have considered the barrier effects of small streams. We used displacement experiments and analyses of genetic population structure to examine the effects of first-order and second-order streams on the dispersal of terrestrial red-backed salamanders, Plethodon cinereus (Green, 1818). We marked red-backed salamanders from near the edges of one first-order stream and one second-order stream, and experimentally displaced them either across the stream or an equal distance farther into the forest. A comparison of return rates indicated that both streams were partial barriers to salamander movement, reducing return rates by approximately 50%. Analysis of six microsatellite loci from paired plots on the same side and on opposite sides of the second-order stream suggested that the stream did contribute to genetic differentiation of salamander populations. Collectively, our results imply that low-order streams do influence patterns of movement and gene flow in red-backed salamanders. We suggest that given the high density of first-order and second-order streams in most landscapes, these features may have important effects on species that, like red-backed salamanders, have limited dispersal and large geographic ranges

Packing and covering immersion models of planar subcubic graphs

A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected planar subcubic graph on $h>0$ edges, $G$ is a graph, and $k$ is a non-negative integer, then either $G$ contains $k$ vertex/edge-disjoint subgraphs, each containing $H$ as an immersion, or $G$ contains a set $F$ of $f(k,h)$ vertices/edges such that $G\setminus F$ does not contain $H$ as an immersion

Characterisation and radioimmunotherapy of L19-SIP, an anti-angiogenic antibody against the extra domain B of fibronectin, in colorectal tumour models

Angiogenesis is a characteristic feature of tumours and other disorders. The human monoclonal antibody L19- SIP targets the extra domain B of fibronectin, a marker of angiogenesis expressed in a range of tumours. The aim of this study was to investigate whole body distribution, tumour localisation and the potential of radioimmunotherapy with the L19-small immunoprotein (SIP) in colorectal tumours. Two colorectal tumour models with highly different morphologies, the SW1222 and LS174T xenografts, were used in this study. Localisation and retention of the L19-SIP antibody at tumour vessels was demonstrated using immunohistochemistry and Cy3-labelled L19-SIP. Whole body biodistribution studies in both tumour models were carried out with 125I-labelled L19-SIP. Finally, 131I-labelled antibody was used to investigate the potential of radioimmunotherapy in SW1222 tumours. Using immunohistochemistry, we confirmed extra domain B expression in the tumour vasculature. Immunofluorescence demonstrated localisation and retention of injected Cy3-labelled L19-SIP at the abluminal side of tumour vessels. Biodistribution studies using a 125I-labelled antibody showed selective tumour uptake in both models. Higher recorded values for localisation were found in the SW1222 tumours than in the LS174T (7.9 vs 6.6 %ID g−1), with comparable blood clearance for both models. Based on these results, a radioimmunotherapy study was performed in the SW1222 xenograft using 131I-Labelled L19-SIP (55.5 MBq), which showed selective tumour uptake, tumour growth inhibition and improved survival. Radio- and fluorescence-labelled L19-SIP showed selective localisation and retention at vessels of two colorectal xenografts. Furthermore, 131I-L19-SIP shows potential as a novel treatment of colorectal tumours, and provides the foundation to investigate combined therapies in the same tumour models

Combination of temozolomide with immunocytokine F16–IL2 for the treatment of glioblastoma

Glioblastoma patients are still not cured by the treatments available at the moment. We investigated the therapeutic properties of temozolomide in combination with F16-IL2, a clinical-stage immunocytokine consisting of human interleukin (IL)-2 fused to the human antibody F16, specific to the A1 domain of tenascin-C

Infinite motion and 2-distinguishability of graphs and groups

A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper subset of X with trivial setwise stabilizer. The motion of an element a in A is the number of points of X that are moved by a, and the motion of the group A is the minimal motion of its nonidentity elements. When A is finite, the Motion Lemma says that if the motion of A is large enough (specifically at least 2 log_2 |A|), then the action is 2-distinguishable. For many situations where X has a combinatorial or algebraic structure, the Motion Lemma implies that the action of Aut(X) on X is 2-distinguishable in all but finitely many instances. We prove an infinitary version of the Motion Lemma for countably infinite permutation groups, which states that infinite motion is large enough to guarantee 2-distinguishability. From this we deduce a number of results, including the fact that every locally finite, connected graph whose automorphism group is countably infinite is 2-distinguishable. One cannot extend the Motion Lemma to uncountable permutation groups, but nonetheless we prove that (under the permutation topology) every closed permutation group with infinite motion has a dense subgroup which is 2-distinguishable. We conjecture an extension of the Motion Lemma which we expect holds for a restricted class of uncountable permutation groups, and we conclude with a list of open questions. The consequences of our results are drawn for orbit equivalence of infinite permutation groups