On-line construction of position heaps

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the suffixes ordered from left to right. Our construction is based on classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees [Ukkonen, 1995]. Using suffix pointers, the position heap can be extended into the augmented position heap that allows for a linear-time string matching algorithm [Ehrenfeucht et al, 2011].Comment: to appear in Journal of Discrete Algorithm

Avaliação genética de seleções e híbridos de limões cravo, Volkameriano e Rugoso como porta-enxertos para laranjeiras Valência na presença da morte súbita dos citros.

Este estudo teve como objetivo realizar a avaliação genética da produção de frutos, eficiência produtiva e altura de laranjeiras Valência (Citrus sinensis) enxertadas em seleções e híbridos dos limões Cravo (C. limonia), Volkameriano (C. volkameriana) e Rugoso (C. jambhiri), em área endêmica para morte súbita dos citros (MSC). Foram avaliados 36 genótipos desses porta-enxertos, representados por cinco plantas cada, avaliados em cinco safras, do terceiro ao sétimo ano após o plantio. Sete dos genótipos avaliados apresentaram plantas com sintomas de MSC até o sétimo ano: Rangpur Otaheite orange 12901 (859), Rangpur Red Lime D.33.30 (866), Limão-Cravo EEL (871), Rangpur Borneo red (874), Citrus kokhai (1649), Limão-Rugoso 58329 (1655) e Limão- Cravo x Swingle B (1695). Para os genótipos que não manifestaram sintomas da doença, foram estimados parâmetros genéticos e fenotípicos e realizada a predição de valores genéticos dos indivíduos, visando à seleção e ao melhoramento genético para as características citadas, empregando-se o método REML/BLUP (máxima verossimilhança restrita/melhor predição linear não viciada). A análise de produção de frutos de cinco safras mostrou acurácia seletiva de 84,59%, tornando-se desnecessária a avaliação de maior número de safras. A seleção dos sete melhores genótipos proporcionou ganhos genéticos de 11,5% na produção de frutos, enquanto a do melhor genótipo conferiu ganho genético de 16,3%. As maiores médias genéticas preditas (>70,0 kg.pl-1) para produção de frutos foram obtidas pelos genótipos Limão-Cravo- Ipanema (1522), Santa- Bárbara-Red- Lime (884), Limão- Cravo- Limeira (863), Limão- Cravo- Taquaritinga (869), Limão- Rugoso- do -Cabo (1643), Rangpur- Rose Lime (868) e Limão- Cravo- da- Califórnia (1467). Já a acurácia seletiva da eficiência produtiva, para quatro colheitas, foi 77,4%. Para este caráter, as maiores médias genéticas (>8,0 kg.m-3) foram dos genótipos Rangpur- Lime x Trifoliata 3810 (1648), Rangpur- Lime x Trifoliata 5320 (1644), Limão- Cravo x Citrange- Carrizo (1524), Citrus pennivesiculata (880), Limão- Cravo x Trifoliata- Swingle A (1707), Rangpur- Rose- Lemon 124684 (864), Rangpur- Red -Lime D33.47 (867) e Limão- Cravo -Ipanema (1522). Dentre os 10 melhores genótipos para produção de frutos e para eficiência produtiva, apenas três são coincidentes: Rangpur- Rose -Lime (868), Citrus pennivesiculata (880) e Limão- Cravo-Ipanema (1522)

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

Composite repetition-aware data structures

In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targeted to such strings typically depend only on one of these measures. We describe two data structures whose size depends on multiple measures of repetition at once, and that provide competitive tradeoffs between the time for counting and reporting all the exact occurrences of a pattern, and the space taken by the structure. The key component of our constructions is the run-length encoded BWT (RLBWT), which takes space proportional to the number of BWT runs: rather than augmenting RLBWT with suffix array samples, we combine it with data structures from LZ77 indexes, which take space proportional to the number of LZ77 factors, and with the compact directed acyclic word graph (CDAWG), which takes space proportional to the number of extensions of maximal repeats. The combination of CDAWG and RLBWT enables also a new representation of the suffix tree, whose size depends again on the number of extensions of maximal repeats, and that is powerful enough to support matching statistics and constant-space traversal.Comment: (the name of the third co-author was inadvertently omitted from previous version

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

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