The best understood 3-manifolds are Haken 3-manifolds; these are manifolds that are irreducible and contain incompressible surfaces. One approach to 3-manifolds is to try to generalize the notion of an incompressible surface. Essential laminations and mapped-in π1-injective surfaces have both been used with some success as substitutes for incompressible surfaces, yielding theorems which apply t...

The Hydractinia allorecognition complex (ARC) was initially identified as a single chromosomal interval using inbred and congenic lines. The production of defined lines necessarily homogenizes genetic background and thus may be expected to obscure the effects of unlinked allorecognition loci should they exist. Here, we report the results of crosses in which inbred lines were out-crossed to wild...

For a continuous function $f : [0,1] \to [0,1]$ we define splitting sequence admitted by $f$ and show that the inverse limit of is an arc if only does not admit sequence.

A technique for multiple deep-inspiration breath-hold (DIBH) volumetric modulated arc therapy (VMAT) for a lung tumor has been proposed with 10 MV flattening-filter-free beams and an image sensor measuring a distance map to thorax surface. Planning CT images were acquired under a DIBH condition and a clinical target volume (CTV) was contoured. This procedure was repeated five times and an inter...

We study the problem of determining the largest d of a non-Denniston maximal arc of degree 2 generated by a fp; 1g-map in PGð2; 2Þ via a recent construction of Mathon [9]. On one hand, we show that there are fp; 1g-maps that generate non-Denniston maximal arcs of degree 2ðmþ1Þ=2, where md 5 is odd. Together with Mathon’s result [9] in the m even case, this shows that there are always fp; 1g-map...

Let Y be the space {z € C: z3 £ [0, 1]} with a metric defined by the arc length. Suppose that / is a continuous map from Y to itself and P is a finite /-invariant subset. In this paper we construct a continuous map C/> from Y to itself satisfying Cp\p = f\p which achieves the infimum topological entropies of continuous maps from Y to itself which agree with / on P .

9] S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their applications to expert systems (with discussion). 13 algorithms currently known for inference in probabilistic networks. IDAGs can also be helpful for constructing a DAG from a given independency model. For the construction of a DAG from an independency model, in 1] an algorithm has...