Absolute calibration of the LOPES antenna system

Radio emission in extensive air showers arises from an interaction with the geomagnetic field and is subject of theoretical studies. This radio emission has advantages for the detection of high energy cosmic rays compared to secondary particle or fluorescence measurement methods. Radio antennas like the LOPES30 antenna system are suited to investigate this emission process by detecting the radio pulses. The characteristic observable parameters like electric field strength and pulse length require a calibration which was done with a reference radio source resulting in an amplification factor representing the system behavior in the environment of the KASCADE-Grande experiment. Knowing the amplification factor and the gain of the LOPES antennas LOPES30 is calibrated absolutely for systematic analyses of the radio emission.Comment: 5 pages, Proceedings of International Workshop on Acoustic and Radio EeV Neutrino detection Activities: ARENA, May 17-19, 2005, DESY Zeuthe

Single-qubit unitary gates by graph scattering

We consider the effects of plane-wave states scattering off finite graphs, as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite tails are attached at arbitrary points of a given graph, representing the input and output registers of a single qubit. For a range of momentum eigenstates, we enumerate all of the graphs with up to $n=9$ vertices for which the scattering implements a single-qubit gate. As $n$ increases, the number of new unitary operations increases exponentially, and for $n>6$ the majority correspond to rotations about axes distributed roughly uniformly across the Bloch sphere. Rotations by both rational and irrational multiples of $\pi$ are found.Comment: 8 pages, 7 figure

Supporting induction: relationships count

This article examines the structural changes to the induction of teachers in Scotland using the perceptions of a group of final year student teachers. This group would be the first probationer teachers to experience revised arrangements for new teacher induction in 37 years. Their preferences and concerns are highlighted, as the new procedures roll out in schools nationwide, in an attempt to stress the importance of relationships to the success of the induction scheme. The argument put forward in this article is based on the notion that personal intelligence is central to effective relationships and therefore crucially important in the context of this mentoring relationship. The views of our sample provide evidence to suggest that the quality of interactions between the mentor and the probationer teacher are paramount in providing a good induction experience. These views are substantiated by experiences in England and in induction literature elsewhere. A synthesis of this evidence is used to make recommendations for those involved in supporting induction in schools, local authorities or teacher education institutions

Fast Label Extraction in the CDAWG

The compact directed acyclic word graph (CDAWG) of a string $T$ of length $n$ takes space proportional just to the number $e$ of right extensions of the maximal repeats of $T$, and it is thus an appealing index for highly repetitive datasets, like collections of genomes from similar species, in which $e$ grows significantly more slowly than $n$. We reduce from $O(m\log{\log{n}})$ to $O(m)$ the time needed to count the number of occurrences of a pattern of length $m$, using an existing data structure that takes an amount of space proportional to the size of the CDAWG. This implies a reduction from $O(m\log{\log{n}}+\mathtt{occ})$ to $O(m+\mathtt{occ})$ in the time needed to locate all the $\mathtt{occ}$ occurrences of the pattern. We also reduce from $O(k\log{\log{n}})$ to $O(k)$ the time needed to read the $k$ characters of the label of an edge of the suffix tree of $T$, and we reduce from $O(m\log{\log{n}})$ to $O(m)$ the time needed to compute the matching statistics between a query of length $m$ and $T$, using an existing representation of the suffix tree based on the CDAWG. All such improvements derive from extracting the label of a vertex or of an arc of the CDAWG using a straight-line program induced by the reversed CDAWG.Comment: 16 pages, 1 figure. In proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017). arXiv admin note: text overlap with arXiv:1705.0864

Course-based Science Research Promotes Learning in Diverse Students at Diverse Institutions

Course-based research experiences (CREs) are powerful strategies for spreading learning and improving persistence for all students, both science majors and nonscience majors. Here we address the crucial components of CREs (context, discovery, ownership, iteration, communication, presentation) found across a broad range of such courses at a variety of academic institutions. We also address how the design of a CRE should vary according to the background of student participants; no single CRE format is perfect. We provide a framework for implementing CREs across multiple institutional types and several disciplines throughout the typical four years of undergraduate work, designed to a variety of student backgrounds. Our experiences implementing CREs also provide guidance on overcoming barriers to their implementation

Low-energy electron scattering from methanol and ethanol

Measured and calculated differential cross sections for elastic (rotationally unresolved) electron scattering from two primary alcohols, methanol (CH3OH) and ethanol (C2H5OH), are reported. The measurements are obtained using the relative flow method with helium as the standard gas and a thin aperture as the collimating target gas source. The relative flow method is applied without the restriction imposed by the relative flow pressure conditions on helium and the unknown gas. The experimental data were taken at incident electron energies of 1, 2, 5, 10, 15, 20, 30, 50, and 100 eV and for scattering angles of 5°–130°. There are no previous reports of experimental electron scattering differential cross sections for CH3OH and C2H5OH in the literature. The calculated differential cross sections are obtained using two different implementations of the Schwinger multichannel method, one that takes all electrons into account and is adapted for parallel computers, and another that uses pseudopotentials and considers only the valence electrons. Comparison between theory and experiment shows that theory is able to describe low-energy electron scattering from these polyatomic targets quite well

Improved Bounds on Quantum Learning Algorithms

In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that for any class C of Boolean functions, the number of quantum black-box queries which are required to exactly identify an unknown function from C is $O(\frac{\log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$, where $\hat{\gamma}^{C}$ is a combinatorial parameter of the class C. We essentially resolve this conjecture in the affirmative by giving a quantum algorithm that, for any class C, identifies any unknown function from C using $O(\frac{\log |C| \log \log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$ quantum black-box queries. We consider a range of natural problems intermediate between the exact learning problem (in which the learner must obtain all bits of information about the black-box function) and the usual problem of computing a predicate (in which the learner must obtain only one bit of information about the black-box function). We give positive and negative results on when the quantum and classical query complexities of these intermediate problems are polynomially related to each other. Finally, we improve the known lower bounds on the number of quantum examples (as opposed to quantum black-box queries) required for $(\epsilon,\delta)$-PAC learning any concept class of Vapnik-Chervonenkis dimension d over the domain $\{0,1\}^n$ from $\Omega(\frac{d}{n})$ to $\Omega(\frac{1}{\epsilon}\log \frac{1}{\delta}+d+\frac{\sqrt{d}}{\epsilon})$. This new lower bound comes closer to matching known upper bounds for classical PAC learning.Comment: Minor corrections. 18 pages. To appear in Quantum Information Processing. Requires: algorithm.sty, algorithmic.sty to buil