Photon and neutron production as in-situ diagnostics of proton-boron fusion

Short-pulse, ultra high-intensity lasers have opened new regimes for studying fusion plasmas and creating novel ultra-short ion beams and neutron sources. Diagnosing the plasma in these experiments is important for optimizing the fusion yield but difficult due to the picosecond time scales, 10s of micron-cubed volumes and high densities. We propose to use the yields of photons and neutrons produced by parallel reactions involving the same reactants to diagnose the plasma conditions and predict the yields of specific reactions of interest. In this work, we focus on verifying the yield of the high-interest aneutronic proton-boron fusion reaction $^{11}{B}(p,2\alpha){}^4{He}$, which is difficult to measure directly due to the short stopping range of the produced $\alpha$s in most materials. We identify promising photon-producing reactions for this purpose and compute the ratios of the photon yield to the $\alpha$ yield as a function of plasma parameters. In beam fusion experiments, the ${}^{11}{C}$ yield is an easily-measurable observable to verify the $\alpha$ yield. In light of our results, improving and extending measurements of the cross sections for these parallel reactions are important steps to gaining greater control over these laser-driven fusion plasmas.Comment: 23 pages, 7 figures, revtex forma

One-variable word equations in linear time

In this paper we consider word equations with one variable (and arbitrary many appearances of it). A recent technique of recompression, which is applicable to general word equations, is shown to be suitable also in this case. While in general case it is non-deterministic, it determinises in case of one variable and the obtained running time is O(n + #_X log n), where #_X is the number of appearances of the variable in the equation. This matches the previously-best algorithm due to D\k{a}browski and Plandowski. Then, using a couple of heuristics as well as more detailed time analysis the running time is lowered to O(n) in RAM model. Unfortunately no new properties of solutions are shown.Comment: submitted to a journal, general overhaul over the previous versio

Azimuthal clumping instabilities in a ZZ-pinch wire array

A simple model is constructed to evaluate the temporal evolution of azimuthal clumping instabilities in a cylindrical array of current-carrying wires. An analytic scaling law is derived, which shows that randomly seeded perturbations evolve at the rate of the fastest unstable mode, almost from the start. This instability is entirely analogous to the Jeans instability in a self-gravitating disk, where the mutual attraction of gravity is replaced by the mutual attraction among the current-carrying wires.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/87765/2/052701_1.pd

The role of anode and cathode plasmas in high power ion diode performance

We describe measurements, modeling, and mitigation experiments on the effects of anode and cathode plasmas in applied-B ion diodes. We have performed experiments with electrode conditioning and cleaning techniques including RF discharges, anode heating, cryogenic cathode cooling and anode surface coatings that have been successful in mitigating some of the effects of electrode contamination on ion diode performance on both the SABRE and PBFA accelerators. We are developing sophisticated spectroscopic diagnostic techniques that allow us to measure the electric and magnetic fields in the A-K gap, we compare these measured fields with those predicted by our 3-D particle-in-cell (PIC) simulations of ion diodes, and we measure anode and cathode plasma densities and expansion velocities. We are continuing to develop E-M simulation codes with fluid-PIC hybrid models for dense plasmas, in order to understand the role of electrode plasmas in ion diode performance. Our strategy for improving high power ion diode performance is to employ and expand our capabilities in measuring and modeling A-K gap plasmas and leverage our increased knowledge into an increase in total ion beam brightness to High Yield Facility (HYF) levels

Hot dense capsule implosion cores produced by z-pinch dynamic hohlraum radiation

Hot dense capsule implosions driven by z-pinch x-rays have been measured for the first time. A ~220 eV dynamic hohlraum imploded 1.7-2.1 mm diameter gas-filled CH capsules which absorbed up to ~20 kJ of x-rays. Argon tracer atom spectra were used to measure the Te~ 1keV electron temperature and the ne ~ 1-4 x10^23 cm-3 electron density. Spectra from multiple directions provide core symmetry estimates. Computer simulations agree well with the peak compression values of Te, ne, and symmetry, indicating reasonable understanding of the hohlraum and implosion physics.Comment: submitted to Phys. Rev. Let

Attacks on quantum key distribution protocols that employ non-ITS authentication

We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key consumption, is not Information-Theoretically Secure (ITS) since for each message the eavesdropper has intercepted she is able to send a different message from a set of messages that she can calculate by finding collisions of a cryptographic hash function. However, when this authentication code was introduced it was shown to prevent straightforward Man-In-The-Middle (MITM) attacks against QKD protocols. In this paper, we prove that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message. Based on this fact we present extended MITM attacks against different versions of BB84 QKD protocols using the addressed authentication code; for three protocols we describe every single action taken by the adversary. For all protocols the adversary can obtain complete knowledge of the key, and for most protocols her success probability in doing so approaches unity. Since the attacks work against all authentication methods which allow to calculate colliding messages, the underlying building blocks of the presented attacks expose the potential pitfalls arising as a consequence of non-ITS authentication in QKD-postprocessing. We propose countermeasures, increasing the eavesdroppers demand for computational power, and also prove necessary and sufficient conditions for upgrading the discussed authentication code to the ITS level.Comment: 34 page

Longest Common Abelian Factors and Large Alphabets

Two strings X and Y are considered Abelian equal if the letters of X can be permuted to obtain Y (and vice versa). Recently, Alatabbi et al. (2015) considered the longest common Abelian factor problem in which we are asked to find the length of the longest Abelian-equal factor present in a given pair of strings. They provided an algorithm that uses O(σn2) time and O(σn) space, where n is the length of the pair of strings and σ is the alphabet size. In this paper we describe an algorithm that uses O(n2log2nlog∗n) time and O(nlog2n) space, significantly improving Alatabbi et al.’s result unless the alphabet is small. Our algorithm makes use of techniques for maintaining a dynamic set of strings under split, join, and equality testing (Melhorn et al., Algorithmica 17(2), 1997)

Caterpillar structures in single-wire Z-pinch experiments

A series of experiments have been performed on single-wire Z pinches (1–2 kA, 20 kV, pulse length 500 ns; Al, Ag, W, or Cu wire of diameter 7.5–50 μm, length 2.5 cm). Excimer laser absorption photographs show expansion of metallic plasmas on a time scale of order 100 ns. The edge of this plasma plume begins to develop structures resembling a caterpillar only after the current pulse reaches its peak value. The growth of these caterpillar structures is shown to be consistent with the Rayleigh–Taylor instability of the decelerating plasma plume front at the later stage of the current pulse. © 2003 American Institute of Physics.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/71205/2/APPLAB-83-24-4915-1.pd

Engineering Art Galleries

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this survey, we describe this work, show the chronology of developments, and compare current algorithms, including two unpublished versions, in an exhaustive experiment. Furthermore, we show what core algorithmic ingredients have led to recent successes