Intra- and interspecific polymorphisms ofLeishmania donovani andL. tropica minicircle DNA

A pair of degenerate polymerase chain reaction (PCR) primers (LEI-1, TCG GAT CC[C,T] [G,C]TG GGT AGG GGC GT; LEI-2, ACG GAT CC[G,C] [G,C][A,C]C TAT [A,T]TT ACA CC) defining a 0.15-kb segment ofLeishmania minicircle DNA was constructed. These primers amplified not only inter- but also intraspecifically polymorphic sequences. Individual sequences revealed a higher intraspecific than interspecific divergence. It is concluded that individual sequences are of limited relevance for species determination. In contrast, when a data base of 19 different sequences was analyzed in a dendrographic plot, an accurate species differentiation was feasible

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation framework F and a small positive integer k are given. - The Repair problem asks whether a given set of arguments can be modified into an extension by at most k elementary changes (i.e., the extension is of distance k from the given set). - The Adjust problem asks whether a given extension can be modified by at most k elementary changes into an extension that contains a specified argument. - The Center problem asks whether, given two extensions of distance k, whether there is a "center" extension that is a distance at most (k-1) from both given extensions. We study these problems in the framework of parameterized complexity, and take the distance k as the parameter. Our results covers several different semantics, including admissible, complete, preferred, semi-stable and stable semantics

The heavy quark decomposition of the S-matrix and its relation to the pinch technique

We propose a decomposition of the S-matrix into individually gauge invariant sub-amplitudes, which are kinematically akin to propagators, vertices, boxes, etc. This decompsition is obtained by considering limits of the S-matrix when some or all of the external particles have masses larger than any other physical scale. We show at the one-loop level that the effective gluon self-energy so defined is physically equivalent to the corresponding gauge independent self-energy obtained in the framework of the pinch technique. The generalization of this procedure to arbitrary gluonic $n$-point functions is briefly discussed.Comment: 11 uuencoded pages, NYU-TH-94/10/0

Dilution of the magnetic lattice in the Kitaev candidate α\alpha-RuCl3_3 by Rh3+^{3+} doping

Magnetic dilution of a well-established Kitaev candidate system is realized in the substitutional Ru$_{1-x}$Rh$_x$Cl$_3$ series ($x = 0.02-0.6$). Optimized syntheses protocols yield uniformly-doped single crystals and polycrystalline powders that are isostructural to the parental $\alpha$-RuCl$_3$ as per X-ray diffraction. The Rh content $x$ is accurately determined by the quantitative energy-dispersive X-ray spectroscopy technique with standards. We determine the magnetic phase diagram of Ru$_{1-x}$Rh$_x$Cl$_3$ for in-plane magnetic fields from magnetization and specific-heat measurements as a function of $x$ and stacking periodicity, and identify the suppression of the magnetic order at $x \approx 0.2$ towards a disordered phase, which does not show any clear signature of freezing into a spin glass. Comparing with previous studies on the substitution series Ru$_{1-x}$Ir$_x$Cl$_3$, we propose that chemical pressure would contribute to the suppression of magnetic order especially in Ru$_{1-x}$Ir$_x$Cl$_3$ and that the zigzag magnetic ground state appears to be relatively robust with respect to the dilution of the Kitaev--$\Gamma$--Heisenberg magnetic lattice. We also discovered a slight dependence of the magnetic properties on thermal cycling, which would be due to an incomplete structural transition

Compact Labelings For Efficient First-Order Model-Checking

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \emph{nicely locally cwd-decomposable}. This notion generalizes that of a \emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \emph{clique-width} with limited overlaps. We also consider such labelings for \emph{bounded} first-order formulas on graph classes of \emph{bounded expansion}. Some of these results are extended to counting queries

Use of a porous membrane for gas bubble removal in microfluidic channels: physical mechanisms and design criteria

We demonstrate and explain a simple and efficient way to remove gas bubbles from liquid-filled microchannels, by integrating a hydrophobic porous membrane on top of the microchannel. A prototype chip is manufactured in hard, transparent polymer with the ability to completely filter gas plugs out of a segmented flow at rates up to 7.4 microliter/s per mm2 of membrane area. The device involves a bubble generation section and a gas removal section. In the bubble generation section, a T-junction is used to generate a train of gas plugs into a water stream. These gas plugs are then transported towards the gas removal section, where they slide along a hydrophobic membrane until complete removal. The system has been successfully modeled and four necessary operating criteria have been determined to achieve a complete separation of the gas from the liquid. The first criterion is that the bubble length needs to be larger than the channel diameter. The second criterion is that the gas plug should stay on the membrane for a time sufficient to transport all the gas through the membrane. The third criterion is that the gas plug travel speed should be lower than a critical value: otherwise a stable liquid film between the bubble and the membrane prevents mass transfer. The fourth criterion is that the pressure difference across the membrane should not be larger than the Laplace pressure to prevent water from leaking through the membrane

Developmental changes in resting‐state functional networks among individuals with and without internalizing psychopathologies

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/147755/1/da22864.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/147755/2/da22864_am.pd

Treatment of Branch Retinal Vein Occlusion induced Macular Edema with Bevacizumab

BACKGROUND: Branch retinal vein occlusion is a frequent cause of visual loss with currently insufficient treatment options. We evaluate the effect of Bevacizumab (Avastin) treatment in patients with macular edema induced by branch retinal vein occlusion. METHODS: Retrospective analysis of 32 eyes in 32 patients with fluorescein angiography proven branch retinal vein occlusion, macular edema and Bevacizumab treatment. Outcome measures were best corrected visual acuity in logMAR and central retinal thickness in OCT. RESULTS: Visual acuity was significantly better 4 to 6 weeks after Bevacizumab treatment compared to visual acuity prior to treatment (before 0.7 +/- 0.3 and after 0.5 +/- 0.3; mean +/- standard deviation; p < 0.01, paired t-test). Gain in visual acuity was accompanied by a significant decrease in retinal thickness (454 +/- 117 to 305 +/- 129 microm, p < 0.01, paired t-test). Follow up (170, 27 - 418 days; median, range) shows that improvement for both visual acuity and retinal thickness last for several months after Bevacizumab use. CONCLUSION: We present evidence that intravitreal Bevacizumab is an effective and lasting treatment for macular edema after branch retinal vein occlusion