Cotunneling in the \nu = 5/2 fractional quantum Hall regime

We show that cotunneling in the 5/2 fractional quantum Hall regime allows us to test the Moore-Read wave function, proposed for this regime, and to probe the nature of the fractional charge carriers. We calculate the cotunneling current for electrons that tunnel between two quantum Hall edge states via a quantum dot and for quasiparticles with fractional charges e/4 and e/2 that tunnel via an antidot. While electron cotunneling is strongly suppressed, the quasiparticle tunneling shows signatures characteristic of the Moore-Read state. For comparison, we also consider cotunneling between Laughlin states, and find that electron transport between Moore-Read states and between Laughlin states at filling factor 1/3 have identical voltage dependences

High-resolution in situ hybridization analysis on the chromosomal interval 61C7-61C8 of Drosophila melanogaster reveals interbands as open chromatin domains

Eukaryotic chromatin is organized in contiguous domains that differ in protein binding, histone modifications, transcriptional activity, and in their degree of compaction. Genome-wide comparisons suggest that, overall, the chromatin organization is similar in different cells within an organism. Here, we compare the structure and activity of the 61C7-61C8 interval in polytene and diploid cells of Drosophila. By in situ hybridization on polytene chromosomes combined with high-resolution microscopy, we mapped the boundaries of the 61C7-8 interband and of the 61C7 and C8 band regions, respectively. Our results demonstrate that the 61C7-8 interband is significantly larger than estimated previously. This interband extends over 20 kbp and is in the range of the flanking band domains. It contains several active genes and therefore can be considered as an open chromatin domain. Comparing the 61C7-8 structure of Drosophila S2 cells and polytene salivary gland cells by ChIP for chromatin protein binding and histone modifications, we observe a highly consistent domain structure for the proximal 13 kbp of the domain in both cell types. However, the distal 7 kbp of the open domain differs in protein binding and histone modification between both tissues. The domain contains four protein-coding genes in the proximal part and two noncoding transcripts in the distal part. The differential transcriptional activity of one of the noncoding transcripts correlates with the observed differences in the chromatin structure between both tissues. The significance of our findings for the organization and structure of open chromatin domains will be discussed

Lifelong learning in evolving graphs with limited labeled data and unseen class detection

Large-scale graph data in the real-world are often dynamic rather than static. The data are changing with new nodes, edges, and even classes appearing over time, such as in citation networks and research-and-development collaboration networks. Graph neural networks (GNNs) have emerged as the standard method for numerous tasks on graph-structured data. In this work, we employ a two-step procedure to explore how GNNs can be incrementally adapted to new unseen graph data. First, we analyze the verge between transductive and inductive learning on standard benchmark datasets. After inductive pretraining, we add unlabeled data to the graph and show that the models are stable. Then, we explore the case of continually adding more and more labeled data, while considering cases, where not all past instances are annotated with class labels. Furthermore, we introduce new classes while the graph evolves and explore methods that automatically detect instances from previously unseen classes. In order to deal with evolving graphs in a principled way, we propose a lifelong learning framework for graph data along with an evaluation protocol. In this framework, we evaluate representative GNN architectures. We observe that implicit knowledge within model parameters becomes more important when explicit knowledge, i.e., data from past tasks, is limited. We find that in open-world node classification, the data from surprisingly few past tasks are sufficient to reach the performance reached by remembering data from all past tasks. In the challenging task of unseen class detection, we find that using a weighted cross-entropy loss is important for stabilit

Analysis and Expansion of the Role of the Escherichia coli Protein ProQ

The decrease in proline transport by the proline porter ProP in a Delta proQ strain has been well documented; however, the reason for this phenotype remains undefined. Previous studies have speculated that ProQ facilitates translation of proP mRNA. Here, we demonstrate that ProQ is enriched in the polysome fractions of sucrose gradient separations of E. coli lysates and the 30S fractions of lysates separated under conditions causing ribosomal subunit dissociation. Thus, ProQ is a bona fide ribosome associated protein. Analysis of proQ constructs lacking predicted structural domains implicates the N-terminal domain in ribosome association. Association with the ribosome appears to be mediated by an interaction with the mRNA being translated, as limited treatment of lysates with Micrococcal Nuclease maintains ribosome integrity but disrupts ProQ localization with polysomes. ProQ also fails to robustly bind to mRNA-free 70S ribosomes in vitro. Interestingly, deletion of proP does not disrupt the localization of ProQ with translating ribosomes, and deletion of proP in combination with the proU operon has no effect on ProQ localization. We also demonstrate that ProQ is necessary for robust biofilm formation, and this phenotype is independent of ProP. Binding studies were carried out using tryptophan fluorescence and in vitro transcribed proP mRNAs. proP is transcribed from two differentially regulated promoters, and ProQ interacts with proP mRNA transcribed from both promoters, as well as a control mRNA with similar affinities. In total, these data suggest that ProQ is positioned to function as a novel translational regulator, and its cellular role extends beyond its effects on proline uptake by ProP

Multi-resolution image analysis for vehicle detection

Proceeding of: Second Iberian Conference, IbPRIA 2005, Estoril, Portugal, June 7-9, 2005Computer Vision can provide a great deal of assistance to Intelligent Vehicles. In this paper an Advanced Driver Assistance Systems for Vehicle Detection is presented. A geometric model of the vehicle is defined where its energy function includes information of the shape and symmetry of the vehicle and the shadow it produces. A genetic algorithm finds the optimum parameter values. As the algorithm receives information from a road detection module some geometric restrictions can be applied. A multi-resolution approach is used to speed up the algorithm and work in realtime. Examples of real images are shown to validate the algorithm.Publicad

Advances in the Surface Passivation of Silicon Solar Cells

AbstractThe surface passivation properties of aluminium oxide (Al2O3) on crystalline Si are compared with the traditional passivation system of silicon nitride (SiNx). It is shown that Al2O3 has fundamental advantages over SiNx when applied to the rear of p-type silicon solar cells as well as to the p+ emitter of n-type silicon solar cells. Special emphasis is paid to the transfer of Al2O3 into industrial solar cell production. We compare different Al2O3 deposition techniques suitable for mass production such as ultrafast spatial atomic layer deposition, inline plasma-enhanced chemical vapour deposition and reactive sputtering. Finally, we review the most recent cell results with Al2O3 passivation and give a brief outlook on the future prospects of Al2O3 in silicon solar cell production

Reproducibility of parallel preconditioned conjugate gradient in hybrid programming environments

[EN] The Preconditioned Conjugate Gradient method is often employed for the solution of linear systems of equations arising in numerical simulations of physical phenomena. While being widely used, the solver is also known for its lack of accuracy while computing the residual. In this article, we propose two algorithmic solutions that originate from the ExBLAS project to enhance the accuracy of the solver as well as to ensure its reproducibility in a hybrid MPI + OpenMP tasks programming environment. One is based on ExBLAS and preserves every bit of information until the final rounding, while the other relies upon floating-point expansions and, hence, expands the intermediate precision. Instead of converting the entire solver into its ExBLAS-related implementation, we identify those parts that violate reproducibility/non-associativity, secure them, and combine this with the sequential executions. These algorithmic strategies are reinforced with programmability suggestions to assure deterministic executions. Finally, we verify these approaches on two modern HPC systems: both versions deliver reproducible number of iterations, residuals, direct errors, and vector-solutions for the overhead of less than 37.7% on 768 cores.The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was partially supported by the European Union's Horizon 2020 research, innovation program under the Marie Sklodowska-Curie grant agreement via the Robust project No. 842528 as well as the Project HPC-EUROPA3 (INFRAIA-2016-1-730897), with the support of the H2020 EC RIA Programme; in particular, the author gratefully acknowledges the support of Vicenc comma Beltran and the computer resources and technical support provided by BSC. The researchers from Universitat Jaume I (UJI) and Universitat Polit ' ecnica de Valencia (UPV) were supported by MINECO project TIN2017-82972-R. Maria Barreda was also supported by the POSDOC-A/2017/11 project from the Universitat Jaume I.Iakymchuk, R.; Barreda Vayá, M.; Graillat, S.; Aliaga, JI.; Quintana Ortí, ES. (2020). Reproducibility of parallel preconditioned conjugate gradient in hybrid programming environments. International Journal of High Performance Computing Applications. 34(5):502-518. https://doi.org/10.1177/1094342020932650S502518345Aliaga, J. I., Barreda, M., Flegar, G., Bollhöfer, M., & Quintana-Ortí, E. S. (2017). Communication in task-parallel ILU-preconditioned CG solvers using MPI + OmpSs. Concurrency and Computation: Practice and Experience, 29(21), e4280. doi:10.1002/cpe.4280Bailey, D. H. (2013). High-precision computation: Applications and challenges [Keynote I]. 2013 IEEE 21st Symposium on Computer Arithmetic. doi:10.1109/arith.2013.39Barrett, R., Berry, M., Chan, T. F., Demmel, J., Donato, J., Dongarra, J., … van der Vorst, H. (1994). Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. doi:10.1137/1.9781611971538Burgess, N., Goodyer, C., Hinds, C. N., & Lutz, D. R. (2019). High-Precision Anchored Accumulators for Reproducible Floating-Point Summation. IEEE Transactions on Computers, 68(7), 967-978. doi:10.1109/tc.2018.2855729Carson, E., & Higham, N. J. (2018). Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions. SIAM Journal on Scientific Computing, 40(2), A817-A847. doi:10.1137/17m1140819Collange, S., Defour, D., Graillat, S., & Iakymchuk, R. (2015). Numerical reproducibility for the parallel reduction on multi- and many-core architectures. Parallel Computing, 49, 83-97. doi:10.1016/j.parco.2015.09.001Dekker, T. J. (1971). A floating-point technique for extending the available precision. Numerische Mathematik, 18(3), 224-242. doi:10.1007/bf01397083Demmel, J., & Hong Diep Nguyen. (2013). Fast Reproducible Floating-Point Summation. 2013 IEEE 21st Symposium on Computer Arithmetic. doi:10.1109/arith.2013.9Demmel, J., & Nguyen, H. D. (2015). Parallel Reproducible Summation. IEEE Transactions on Computers, 64(7), 2060-2070. doi:10.1109/tc.2014.2345391Dongarra, J. J., Du Croz, J., Hammarling, S., & Duff, I. S. (1990). A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, 16(1), 1-17. doi:10.1145/77626.79170Fousse, L., Hanrot, G., Lefèvre, V., Pélissier, P., & Zimmermann, P. (2007). MPFR. ACM Transactions on Mathematical Software, 33(2), 13. doi:10.1145/1236463.1236468Hida, Y., Li, X. S., & Bailey, D. H. (s. f.). Algorithms for quad-double precision floating point arithmetic. Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001. doi:10.1109/arith.2001.930115Hunold, S., & Carpen-Amarie, A. (2016). Reproducible MPI Benchmarking is Still Not as Easy as You Think. IEEE Transactions on Parallel and Distributed Systems, 27(12), 3617-3630. doi:10.1109/tpds.2016.2539167IEEE Computer Society (2008) IEEE Standard for Floating-Point Arithmetic. Piscataway: IEEE Standard, pp. 754–2008.Kulisch, U., & Snyder, V. (2010). The exact dot product as basic tool for long interval arithmetic. Computing, 91(3), 307-313. doi:10.1007/s00607-010-0127-7Kulisch, U. (2013). Computer Arithmetic and Validity. doi:10.1515/9783110301793Lawson, C. L., Hanson, R. J., Kincaid, D. R., & Krogh, F. T. (1979). Basic Linear Algebra Subprograms for Fortran Usage. ACM Transactions on Mathematical Software, 5(3), 308-323. doi:10.1145/355841.355847Lutz, D. R., & Hinds, C. N. (2017). High-Precision Anchored Accumulators for Reproducible Floating-Point Summation. 2017 IEEE 24th Symposium on Computer Arithmetic (ARITH). doi:10.1109/arith.2017.20Mukunoki, D., Ogita, T., & Ozaki, K. (2020). Reproducible BLAS Routines with Tunable Accuracy Using Ozaki Scheme for Many-Core Architectures. Lecture Notes in Computer Science, 516-527. doi:10.1007/978-3-030-43229-4_44Nguyen, H. D., & Demmel, J. (2015). Reproducible Tall-Skinny QR. 2015 IEEE 22nd Symposium on Computer Arithmetic. doi:10.1109/arith.2015.28Ogita, T., Rump, S. M., & Oishi, S. (2005). Accurate Sum and Dot Product. SIAM Journal on Scientific Computing, 26(6), 1955-1988. doi:10.1137/030601818Ozaki, K., Ogita, T., Oishi, S., & Rump, S. M. (2011). Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications. Numerical Algorithms, 59(1), 95-118. doi:10.1007/s11075-011-9478-1Priest, D. M. (s. f.). Algorithms for arbitrary precision floating point arithmetic. [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic. doi:10.1109/arith.1991.145549Rump, S. M., Ogita, T., & Oishi, S. (2008). Accurate Floating-Point Summation Part I: Faithful Rounding. SIAM Journal on Scientific Computing, 31(1), 189-224. doi:10.1137/050645671Rump, S. M., Ogita, T., & Oishi, S. (2009). Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest. SIAM Journal on Scientific Computing, 31(2), 1269-1302. doi:10.1137/07068816xRump, S. M., Ogita, T., & Oishi, S. (2010). Fast high precision summation. Nonlinear Theory and Its Applications, IEICE, 1(1), 2-24. doi:10.1587/nolta.1.2Saad, Y. (2003). Iterative Methods for Sparse Linear Systems. doi:10.1137/1.9780898718003Wiesenberger, M., Einkemmer, L., Held, M., Gutierrez-Milla, A., Sáez, X., & Iakymchuk, R. (2019). Reproducibility, accuracy and performance of the Feltor code and library on parallel computer architectures. Computer Physics Communications, 238, 145-156. doi:10.1016/j.cpc.2018.12.00

Timed inhibition of CDC7 increases CRISPR-Cas9 mediated templated repair.

Repair of double strand DNA breaks (DSBs) can result in gene disruption or gene modification via homology directed repair (HDR) from donor DNA. Altering cellular responses to DSBs may rebalance editing outcomes towards HDR and away from other repair outcomes. Here, we utilize a pooled CRISPR screen to define host cell involvement in HDR between a Cas9 DSB and a plasmid double stranded donor DNA (dsDonor). We find that the Fanconi Anemia (FA) pathway is required for dsDonor HDR and that other genes act to repress HDR. Small molecule inhibition of one of these repressors, CDC7, by XL413 and other inhibitors increases the efficiency of HDR by up to 3.5 fold in many contexts, including primary T cells. XL413 stimulates HDR during a reversible slowing of S-phase that is unexplored for Cas9-induced HDR. We anticipate that XL413 and other such rationally developed inhibitors will be useful tools for gene modification

Iron-filled multiwalled carbon nanotubes surface-functionalized with paramagnetic Gd (III): A candidate dual-functioning MRI contrast agent and magnetic hyperthermia structure

The authors are grateful for the financial support from the Engineering and Physical Science Research Council, UK

Validation of meter-scale surface faulting offset measurements from high-resolution topographic data

Studies of active fault zones have flourished with the availability of high-resolution topographic data, particularly where airborne light detection and ranging (lidar) and structure from motion (SfM) data sets provide a means to remotely analyze submeter-scale fault geomorphology. To determine surface offset at a point along a strike-slip earthquake rupture, geomorphic features (e.g., stream channels) are measured days to centuries after the event. Analysis of these and cumulatively offset features produces offset distributions for successive earthquakes that are used to understand earthquake rupture behavior. As researchers expand studies to more varied terrain types, climates, and vegetation regimes, there is an increasing need to standardize and uniformly validate measurements of tectonically displaced geomorphic features. A recently compiled catalog of nearly 5000 earthquake offsets across a range of measurement and reporting styles provides insight into quality rating and uncertainty trends from which we formulate best-practice and reporting recommendations for remote studies. In addition, a series of public and beginner-level studies validate the remote methodology for a number of tools and emphasize considerations to enhance measurement accuracy and precision for beginners and professionals. Our investigation revealed that (1) standardizing remote measurement methods and reporting quality rating schemes is essential for the utility and repeatability of fault-offset measurements; (2) measurement discrepancies often involve misinterpretation of the offset geomorphic feature and are a function of the investigator’s experience; (3) comparison of measurements made by a single investigator in different climatic regions reveals systematic differences in measurement uncertainties attributable to variation in feature preservation; (4) measuring more components of a displaced geomorphic landform produces more consistently repeatable estimates of offset; and (5) inadequate understanding of pre-event morphology and post-event modifications represents a greater epistemic limitation than the aleatoric limitations of the measurement process