In situ PCR for Mycobacterium tuberculosis in endoscopic mucosal biopsy specimens of intestinal tuberculosis and Crohn disease

Tuberculosis and Crohn disease are granulomatous disorders affecting the intestinal tract with similar clinical manifestations and pathologic features. We evaluated the use of in situ polymerase chain reaction (PCR) using Mycobacterium tuberculosis complex-specific primers for IS61 10 to differentiate these 2 disorders in archival mucosal biopsy specimens. In situ PCR was positive in 6 of 20 tuberculosis biopsy specimens and I of 20 Crohn disease biopsy specimens. Staining was localized to a site of granulomatous inflammation in 3 of the tuberculosis specimens and in the Crohn, disease specimen. In the other tuberculosis biopsy specimens, positive staining was localized to inflammatory granulation tissue and to a focus of intact mucosa without granulomatous inflammation. The presence of M tuberculosis DNA in Crohn disease could be due to coexisting latent tuberculosis or indicate a role for these bacteria in triggering an abnormal immune response. Therefore, in situ PCR is potentially useful to differentiate intestinal tuberculosis from Crohn disease, if the sensitivity is improved

A connection between circular colorings and periodic schedules

AbstractWe show that there is a curious connection between circular colorings of edge-weighted digraphs and periodic schedules of timed marked graphs. Circular coloring of an edge-weighted digraph was introduced by Mohar [B. Mohar, Circular colorings of edge-weighted graphs, J. Graph Theory 43 (2003) 107–116]. This kind of coloring is a very natural generalization of several well-known graph coloring problems including the usual circular coloring [X. Zhu, Circular chromatic number: A survey, Discrete Math. 229 (2001) 371–410] and the circular coloring of vertex-weighted graphs [W. Deuber, X. Zhu, Circular coloring of weighted graphs, J. Graph Theory 23 (1996) 365–376]. Timed marked graphs G→ [R.M. Karp, R.E. Miller, Properties of a model for parallel computations: Determinancy, termination, queuing, SIAM J. Appl. Math. 14 (1966) 1390–1411] are used, in computer science, to model the data movement in parallel computations, where a vertex represents a task, an arc uv with weight cuv represents a data channel with communication cost, and tokens on arc uv represent the input data of task vertex v. Dynamically, if vertex u operates at time t, then u removes one token from each of its in-arc; if uv is an out-arc of u, then at time t+cuv vertex u places one token on arc uv. Computer scientists are interested in designing, for each vertex u, a sequence of time instants {fu(1),fu(2),fu(3),…} such that vertex u starts its kth operation at time fu(k) and each in-arc of u contains at least one token at that time. The set of functions {fu:u∈V(G→)} is called a schedule of G→. Computer scientists are particularly interested in periodic schedules. Given a timed marked graph G→, they ask if there exist a period p>0 and real numbers xu such that G→ has a periodic schedule of the form fu(k)=xu+p(k−1) for each vertex u and any positive integer k. In this note we demonstrate an unexpected connection between circular colorings and periodic schedules. The aim of this note is to provide a possibility of translating problems and methods from one area of graph coloring to another area of computer science

Time-dependent correlation functions in a one-dimensional asymmetric exclusion process

We study a one-dimensional anisotropic exclusion process describing particles injected at the origin, moving to the right on a chain of $L$ sites and being removed at the (right) boundary. We construct the steady state and compute the density profile, exact expressions for all equal-time n-point density correlation functions and the time-dependent two-point function in the steady state as functions of the injection and absorption rates. We determine the phase diagram of the model and compare our results with predictions from dynamical scaling and discuss some conjectures for other exclusion models.Comment: LATEX-file, 32 pages, Weizmann preprint WIS/93/01/Jan-P

4-Colorable 6-regular toroidal graphs

AbstractThis paper proves two conjectures of Collins, Fisher and Hutchinson about the chromatic number of some circulant graphs. As a consequence, we characterize 4-colorable 6-regular toroidal graphs

Hasil Dan Stabilitas Hasil Biji Kedelai {Glycine Max (L.) Merr.} Galur Harapan Di Lahan Sawah* [Yield and Yield Stability of Soybean {Glycine Max (L.) Merr.} Promising Lines]

Soybean {Glycine max (L.) Merr.} varieties with consistently high yield productivity across environments are expected to maintain its production level per area.The objectives of this experiment are to determine the magnitude of G × E interaction and to identify the stability of eight soybean promising lines across locations. Materials consists of eight soybean promising lines (G100H/SHRW-60-38, SHRW-60/G100H-73, SHRW-60/G100H-68, SHRW-60/G100H-66, G100H/SHRW-34, SHRW-60/G100H-5, SHRW-60/G100H-70 and SHRW-60/G 100 H-75) and two check varieties (Kaba and Wilis). The experiments were done in 16 locations (Lampung Tengah, Yogyakarta, Ngawi, Mojokerto, Pasuruan, Malang, Banyuwangi and Lombok Barat, two locations each) during the period of 2009 to 2011. A randomized completely block design with four replicates was used in each location. AMMI analysis (Additive Main Effects and Multiplicative Interaction) was applied to assess the yield stability of those 10 genotypes, and then interpreted in biplot graphic of seed yield for principal components 1 (IPCA1) with the principal component 2 (IPCA2). Seed yield of the 10 soybean lines ranged from 2.63-3.02 t/ha, with 2.81 t/ha in average. The highest yield was obtained by G6 (SHRW-60/G100H-5), whereas G3 (SHRW-60/G100H-68) had the lowest seed yield.The combined analysis showed that lines, locations, and the interaction of lines and locations (G × L) were significantly different for seed yield.The first four Interaction Principal Component Axes (IPCA1, IPCA2, IPCA3 and IPCA4) were significant and accounted for 85.1% of the total GEI. Lines of G100H/SHRW-60-38 (G1), SHRW-60/G100H-66 (G4) and SHRW-60/G100H-5 (G6) were stable and high yielding, and therefore they are proposed to be released as new varieties. The results of this study also suggested that Kaba and Willis were used as specific-check varieties, due to its site-specific adaptability

A characterization of graphs with rank 5

AbstractThe rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: what is the structure of a connected graph G with rank 5? or equivalently, what is the structure of a connected n-vertex graph G whose adjacency matrix has nullity n-5? In this paper, we completely characterize connected graphs G whose adjacency matrix has rank 5

Anomalous tag diffusion in the asymmetric exclusion model with particles of arbitrary sizes

Anomalous behavior of correlation functions of tagged particles are studied in generalizations of the one dimensional asymmetric exclusion problem. In these generalized models the range of the hard-core interactions are changed and the restriction of relative ordering of the particles is partially brocken. The models probing these effects are those of biased diffusion of particles having size S=0,1,2,..., or an effective negative "size" S=-1,-2,..., in units of lattice space. Our numerical simulations show that irrespective of the range of the hard-core potential, as long some relative ordering of particles are kept, we find suitable sliding-tag correlation functions whose fluctuations growth with time anomalously slow ($t^{{1/3}}$), when compared with the normal diffusive behavior ($t^{{1/2}}$). These results indicate that the critical behavior of these stochastic models are in the Kardar-Parisi-Zhang (KPZ) universality class. Moreover a previous Bethe-ansatz calculation of the dynamical critical exponent $z$, for size $S \geq 0$ particles is extended to the case $S<0$ and the KPZ result $z=3/2$ is predicted for all values of $S \in {Z}$.Comment: 4 pages, 3 figure

Large Deviation Function of the Partially Asymmetric Exclusion Process

The large deviation function obtained recently by Derrida and Lebowitz for the totally asymmetric exclusion process is generalized to the partially asymmetric case in the scaling limit. The asymmetry parameter rescales the scaling variable in a simple way. The finite-size corrections to the universal scaling function and the universal cumulant ratio are also obtained to the leading order.Comment: 10 pages, 2 eps figures, minor changes, submitted to PR