Persistent photovoltage in methylammonium lead iodide perovskite solar cells

Open circuit voltage decay measurements are performed on methylammonium lead iodide (CH3NH3PbI3) perovskite solar cells to investigate the charge carrier recombination dynamics. The measurements are compared to the two reference polymer-fullerene bulk heterojunction solar cells based on P3HT:PC60BM and PTB7:PC70BM blends. In the perovskite devices, two very different time domains of the voltage decay are found, with a first drop on a short time scale that is similar to the organic solar cells. However, two major differences are also observed. 65-70% of the maximum photovoltage persists on much longer timescales, and the recombination dynamics are dependent on the illumination intensity.Comment: 5 pages, 3 figure

Financial doping and financial fair play in European Club football competitions

Addresses the emerging area of manipulation in professional sports by bringing a collection of original contributions together in one volume for the first time Provides an interdisciplinary approach, combining economic, business administrative and legal issues, that enables a complete overview for any scholar interested in the global economics of, and manipulation of sport, in general Presents contributions from world class scholars that are well known in their area

Stability for semilinear parabolic problems in L2 and W1,2

Asymptotic stability is studied for semilinear parabolic problems in L2(Ω) and interpolation spaces. Some known results about stability inW1,2(Ω) are improved for semilinear parabolic systems with mixed boundary conditions. The approach is based on Amann's power extrapolation scales. In the Hilbert space setting, a better understanding of this approach is provided for operators satisfying Kato's square root problem. © European Mathematical Society

Stability for semilinear parabolic problems in L2 and W1,2

Asymptotic stability is studied for semilinear parabolic problems in L2(Ω) and interpolation spaces. Some known results about stability inW1,2(Ω) are improved for semilinear parabolic systems with mixed boundary conditions. The approach is based on Amann's power extrapolation scales. In the Hilbert space setting, a better understanding of this approach is provided for operators satisfying Kato's square root problem. © European Mathematical Society

PROVAL:A framework for comparison of protein sequence embeddings

High throughput sequencing technology leads to a significant increase in the number of generated protein sequences and the anchor database UniProt doubles approximately every two years. This large set of annotated data is used by many bioinformatics algorithms. Searching within these databases, typically without using any annotations, is challenging due to the variable lengths of the entries and the used non-standard comparison measures. A promising strategy to address these issues is to find fixed-length, information-preserving representations of the variable length protein sequences. A systematic algorithmic evaluation of the proposals is however surprisingly missing. In this work, we analyze how different algorithms perform in generating general protein sequence representations and provide a thorough evaluation framework PROVAL. The strategies range from a proximity representation using classical Smith–Waterman algorithm to state-of-the-art embedding techniques by means of transformer networks. The methods are evaluated by, e.g., the molecular function classification, embedding space visualization, computational complexity and the carbon footprint.</p

PROVAL:A framework for comparison of protein sequence embeddings

High throughput sequencing technology leads to a significant increase in the number of generated protein sequences and the anchor database UniProt doubles approximately every two years. This large set of annotated data is used by many bioinformatics algorithms. Searching within these databases, typically without using any annotations, is challenging due to the variable lengths of the entries and the used non-standard comparison measures. A promising strategy to address these issues is to find fixed-length, information-preserving representations of the variable length protein sequences. A systematic algorithmic evaluation of the proposals is however surprisingly missing. In this work, we analyze how different algorithms perform in generating general protein sequence representations and provide a thorough evaluation framework PROVAL. The strategies range from a proximity representation using classical Smith–Waterman algorithm to state-of-the-art embedding techniques by means of transformer networks. The methods are evaluated by, e.g., the molecular function classification, embedding space visualization, computational complexity and the carbon footprint.</p