Structure and mechanism of the iron‐sulfur flavoprotein phthalate dioxygenase reductase

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/154520/1/fsb2009014006.pd

Fast readout algorithm for cylindrical beam position monitors providing good accuracy for particle bunches with large offsets

A simple, analytically correct algorithm is developed for calculating pencil beam coordinates using the signals from an ideal cylindrical particle beam position monitor (BPM) with four pickup electrodes (PUEs) of infinitesimal widths. The algorithm is then applied to simulations of realistic BPMs with finite width PUEs. Surprisingly small deviations are found. Simple empirically determined correction terms reduce the deviations even further. The algorithm is then used to study the impact of beam-size upon the precision of BPMs in the non-linear region. As an example of the data acquisition speed advantage, a FPGA-based BPM readout implementation of the new algorithm has been developed and characterized. Finally,the algorithm is tested with BPM data from the Cornell Preinjector.Comment: 21 pages, 17 figure

On a Tree and a Path with no Geometric Simultaneous Embedding

Two graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ admit a geometric simultaneous embedding if there exists a set of points P and a bijection M: P -> V that induce planar straight-line embeddings both for $G_1$ and for $G_2$. While it is known that two caterpillars always admit a geometric simultaneous embedding and that two trees not always admit one, the question about a tree and a path is still open and is often regarded as the most prominent open problem in this area. We answer this question in the negative by providing a counterexample. Additionally, since the counterexample uses disjoint edge sets for the two graphs, we also negatively answer another open question, that is, whether it is possible to simultaneously embed two edge-disjoint trees. As a final result, we study the same problem when some constraints on the tree are imposed. Namely, we show that a tree of depth 2 and a path always admit a geometric simultaneous embedding. In fact, such a strong constraint is not so far from closing the gap with the instances not admitting any solution, as the tree used in our counterexample has depth 4.Comment: 42 pages, 33 figure

Multi-slit Based Emittance Measurement Study for BNL ERL

N/

High energy Coulomb-scattered electrons for relativistic particle beam diagnostics

A new system used for monitoring energetic Coulomb-scattered electrons as the main diagnostic for accurately aligning the electron and ion beams in the new Relativistic Heavy Ion Collider (RHIC) electron lenses is described in detail. The theory of electron scattering from relativistic ions is developed and applied to the design and implementation of the system used to achieve and maintain the alignment. Commissioning with gold and 3He beams is then described as well as the successful utilization of the new system during the 2015 RHIC polarized proton run. Systematic errors of the new method are then estimated. Finally, some possible future applications of Coulomb-scattered electrons for beam diagnostics are briefly discussed.Comment: 16 pages, 23 figure

Sturmian morphisms, the braid group B_4, Christoffel words and bases of F_2

We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F_2) of automorphisms of the rank two free group F_2 and show that it can be realized as a monoid in the group B_4 of braids on four strings. In the second part we use Christoffel words to construct an explicit basis of F_2 lifting any given basis of the free abelian group Z^2. We further give an algorithm allowing to decide whether two elements of F_2 form a basis or not. We also show that, under suitable conditions, a basis has a unique conjugate consisting of two palindromes.Comment: 25 pages, 4 figure

Baseline suppression problems for high precision measurements using optical beam profile monitors

The use of fluorescent screens (e.g. YAG screens) and Optical Transition Radiation (OTR) screens for beam profile monitors provides a simple and widely used way to obtain detailed two dimensional intensity maps. What makes this possible is the availability of relatively inexpensive CCD cameras. For high precision measurements many possible error contributions need to be considered that have to do with properties of the fluorescent screens and of the CCDs. Saturation effects, reflections within and outside the screen, non-linearities, radiation damage, etc are often mentioned. Here we concentrate on an error source less commonly described, namely erroneous baseline subtraction, which is particularly important when fitting projected images. We show computer simulations as well as measurement results having remarkable sensitivity of the fitted profile widths to even partial suppression of the profile baseline data, which often arises from large pixel-to-pixel variations at low intensity levels. Such inadvertent baseline data suppression is very easy to miss as it is usually not obvious when inspecting projected profiles. In this report we illustrate this effect and discuss possible algorithms to automate the detection of this problem as well as some possible corrective measures