ANTIGEN-SPECIFIC THYMUS CELL FACTORS IN THE GENETIC CONTROL OF THE IMMUNE RESPONSE TO POLY-(TYROSYL, GLUTAMYL)-POLY-D, L-ALANYL--POLY-LYSYL

The genetic control of the antibody response to a synthetic polypeptide antigen designated poly-L(Tyr, Glu)-poly-D,L-Ala--poly-L-Lys [(T, G)-A--L] has been studied in congenic high responder C3H.SW (H-2b) and low responder C3H/HeJ (H-2k) strains of mice. This response is controlled by the Ir-1 gene and is H-2 linked. The method employed was to study the ability of specifically primed or "educated" T cells of each strain to produce cooperative factors for (T, G)-A--L in vitro. Such factors have been shown to be capable of replacing the requirement for T cells in the thymus-dependent antibody response to (T, G)-A--L in vivo. The T-cell factors produced were tested for their ability to cooperate with B cells of either high or low responder origin by transfer together with bone marrow cells and (T, G)-A--L into heavily irradiated, syngeneic (for bone marrow donor) recipients. Direct anti-(T, G)-A--L plaque-forming cells were measured later in the spleens of the recipients. The results showed that (a) educated T cells of both high and low responder origin produced active cooperative factors to (T, G)-A--L, and no differences between the strains in respect to production of T-cell factors could be demonstrated; and (b) such factors, whether of high or low responder origin, cooperated efficiently with B cells of high responder origin only, and hardly at all with B cells of low responder origin. The conclusion was drawn that the cellular difference between the two strains lies in the responsiveness of their B cells to specific signals or stimuli received from T cells. As far as could be discerned by the methods used, no T-cell defect existed in low responder mice and the expression of the controlling Ir-1 gene was solely at the level of the B cells in this case

Deterministic and Probabilistic Binary Search in Graphs

We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm's task is to identify the target by adaptively querying vertices. In response to querying a node $q$, the algorithm learns either that $q$ is the target, or is given an edge out of $q$ that lies on a shortest path from $q$ to the target. We study this problem in a general noisy model in which each query independently receives a correct answer with probability $p > \frac{1}{2}$ (a known constant), and an (adversarial) incorrect one with probability $1-p$. Our main positive result is that when $p = 1$ (i.e., all answers are correct), $\log_2 n$ queries are always sufficient. For general $p$, we give an (almost information-theoretically optimal) algorithm that uses, in expectation, no more than $(1 - \delta)\frac{\log_2 n}{1 - H(p)} + o(\log n) + O(\log^2 (1/\delta))$ queries, and identifies the target correctly with probability at leas $1-\delta$. Here, $H(p) = -(p \log p + (1-p) \log(1-p))$ denotes the entropy. The first bound is achieved by the algorithm that iteratively queries a 1-median of the nodes not ruled out yet; the second bound by careful repeated invocations of a multiplicative weights algorithm. Even for $p = 1$, we show several hardness results for the problem of determining whether a target can be found using $K$ queries. Our upper bound of $\log_2 n$ implies a quasipolynomial-time algorithm for undirected connected graphs; we show that this is best-possible under the Strong Exponential Time Hypothesis (SETH). Furthermore, for directed graphs, or for undirected graphs with non-uniform node querying costs, the problem is PSPACE-complete. For a semi-adaptive version, in which one may query $r$ nodes each in $k$ rounds, we show membership in $\Sigma_{2k-1}$ in the polynomial hierarchy, and hardness for $\Sigma_{2k-5}$

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs

A (1 + eps)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time. There are strong distance-oracle constructions known for planar graphs (Thorup, JACM'04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC'06). However, these require Omega(eps^{-1} n lg n) space for n-node graphs. We argue that a very low space requirement is essential. Since modern computer architectures involve hierarchical memory (caches, primary memory, secondary memory), a high memory requirement in effect may greatly increase the actual running time. Moreover, we would like data structures that can be deployed on small mobile devices, such as handhelds, which have relatively small primary memory. In this paper, for planar graphs, bounded-genus graphs, and minor-excluded graphs we give distance-oracle constructions that require only O(n) space. The big O hides only a fixed constant, independent of \epsilon and independent of genus or size of an excluded minor. The preprocessing times for our distance oracle are also faster than those for the previously known constructions. For planar graphs, the preprocessing time is O(n lg^2 n). However, our constructions have slower query times. For planar graphs, the query time is O(eps^{-2} lg^2 n). For our linear-space results, we can in fact ensure, for any delta > 0, that the space required is only 1 + delta times the space required just to represent the graph itself

Fixed Point and Aperiodic Tilings

An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals) We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. The flexibility of this construction allows us to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. This property was not known for any of the existing aperiodic tile sets.Comment: v5: technical revision (positions of figures are shifted

Coordination of Catholic Education Implementation Policies in North Sulawesi

This study focuses on one aspect of management, namely the Coordination of Policies for the Implementation of Catholic Education in North Sulawesi (a multi-site study at the Catholic Education Foundation of the Diocese of Manado, the Brothers Don Bosco Foundation for the Manado Representative and the Yoseph Yeemye Foundation for the North Sulawesi Representative). The formulation of the research problem is: 1. How is the coordination of policies for the implementation of Catholic education. 2. How to coordinate the implementation of Catholic education policies. 3. What are the internal and external obstacles in policy coordination and coordination of policy implementation for Catholic education in North Sulawesi, as well as solutions. 4. What are the results of the coordination of the implementation of Catholic education policies in the three foundations. This study uses a qualitative approach with a multi-site study design. Data collection techniques include interviews, observation. and documentation. Data analysis includes the process of flow of activities that occur simultaneously, namely data reduction, data presentation, and drawing conclusions. The results of this study indicate: 1. Coordination of policies for the implementation of Catholic education in the three foundations, carried out in a top-down hierarchy, that all regulations originate from the leadership of the hierarchy or institution, which is then forwarded to the leadership of the institution/unit below it; and then disseminated to all staff of the respective foundation employees. 2. Coordination of the implementation of policies for the implementation of Catholic education in the three foundations, always guided by the universal regulations of the Catholic Church, which are concreted through the vision-mission, statutes, or AD-ART, and the strategic plans of each foundation, all of which become the moral strength, in achieving the goal of a plenary Catholic education. 3. The results of the coordination of the implementation of policies on the implementation of catholic education in the three foundations, are determined and promoted by the KWI Education Commission, through the National Council for Catholic Education, the Catholic Education Council of the Diocese, Congregations/Tarekats, through Catholic educational institutions or foundations, with their vision-mission and spirituality with the Statute , its Articles of Association and Bylaws, are harmonized with various government regulations, through a Christian governance management, evangelization in the field of education. 4. Solutions to overcome external and internal constraints in coordinating the implementation of policies for the implementation of Catholic education at the Catholic Education Foundation of the Catholic Diocese of Manado, the Brothers Don Bosco Foundation in Manado, and the Yosep Yeemye Foundation in North Sulawesi. 5. The results of the coordination of the implementation of policies for the implementation of Catholic education at the Catholic Education Foundation of the Catholic Diocese of Manado, the Brothers Don Bosco Foundation of Manado, and the Yosep Yeemye Foundation of North Sulawesi. Keywords: Coordination, Policy and Implementation, Implementation of Catholic Education DOI: 10.7176/JEP/13-30-06 Publication date:October 31st 202

Ultrametric Logarithm Laws, II

We prove positive characteristic versions of the logarithm laws of Sullivan and Kleinbock-Margulis and obtain related results in Metric Diophantine Approximation.Comment: submitted to Montasefte Fur Mathemati

Weak local rules for planar octagonal tilings

We provide an effective characterization of the planar octagonal tilings which admit weak local rules. As a corollary, we show that they are all based on quadratic irrationalities, as conjectured by Thang Le in the 90s.Comment: 23 pages, 6 figure

Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes

Background: Segmental duplications, or low-copy repeats, are common in mammalian genomes. In the human genome, most segmental duplications are mosaics comprised of multiple duplicated fragments. This complex genomic organization complicates analysis of the evolutionary history of these sequences. One model proposed to explain this mosaic patterns is a model of repeated aggregation and subsequent duplication of genomic sequences. Results: We describe a polynomial-time exact algorithm to compute duplication distance, a genomic distance defined as the most parsimonious way to build a target string by repeatedly copying substrings of a fixed source string. This distance models the process of repeated aggregation and duplication. We also describe extensions of this distance to include certain types of substring deletions and inversions. Finally, we provide an description of a sequence of duplication events as a context-free grammar (CFG). Conclusion: These new genomic distances will permit more biologically realistic analyses of segmental duplications in genomes.

The word and Riemannian metrics on lattices of semisimple groups

Let G be a semisimple Lie group of rank ≥ 2 and Γ an irreducible lattice. Γ has two natural metrics: a metric inherited from a Riemannian metric on the ambient Lie group and a word metric defined with respect to some finite set of generators. Confirming a conjecture of D. Kazhdan (cf. Gromov [Gr2]) we show that these metrics are Lipschitz equivalent. It is shown that a cyclic subgroup of Γ is virtually unipotent if and only if it has exponential growth with respect to the generators of Γ

Convergence of measures on compactifications of locally symmetric spaces

We conjecture that the set of homogeneous probability measures on the maximal Satake compactification of an arithmetic locally symmetric space S=Γ∖G/K is compact. More precisely, given a sequence of homogeneous probability measures on S, we expect that any weak limit is homogeneous with support contained in precisely one of the boundary components (including S itself). We introduce several tools to study this conjecture and we prove it in a number of cases, including when G=SL3(R) and Γ=SL3(Z)