21.2%‐efficient fineline‐printed PERC solar cell with 5 busbar front grid

We evaluate industrial‐type PERC solar cells applying a 5 busbar front grid and fineline‐printed Ag fingers. We obtain finger widths down to 46 µm when using a stencil with 40 µm opening for the finger print, whereas the busbar is printed in a separate printing step with a different Ag paste (dual print). This compares to finger widths of 62 µm to 66 µm when applying print‐on‐print. The 5 busbar front grid with the best dual print process reduces the shadowing loss of the front grid to 4.0% compared to 5.8% for a conventional 3 busbar front grid printed with print‐on‐print. The 1.8% reduction in shadowing loss results in equal parts from the reduced finger width with dual print as well as from a reduced total busbar width of the 5 busbar design. The resulting PERC solar cells with 5 busbars demonstrate independently confirmed conversion efficiencies of 21.2% compared to 20.6% efficiency of the 3 busbar PERC solar cell. The increased conversion efficiency is primarily due to an increased short‐circuit current resulting from the reduced shadowing loss. To our knowledge, 21.2% conversion efficiency is the highest value reported so far for industry typical silicon solar cells with printed metal front and rear contacts. (© 2014 WILEY‐VCH Verlag GmbH &Co. KGaA, Weinheim)     

Novel Carboxyl Esterase Preparations for the Resolution of Linalyl Acetate

 Biocatalytic resolution of the tertiary terpene alcohol (±)-linalool was accomplished via hydrolysis of its corresponding acetate ester using two highly enantiospecific enzymes (E > 100). The latter were identified in a crude cell-free extract of Rhodococcus ruber DSM 43338 and could be separated by (partial) protein purification. Since they showed opposite enantiopreference, they were termed (R)- and (S)-linalyl acetate hydrolase (LAH). The activity and selectivity of the enzyme preparations was markedly dependent on the fermentation conditions.     

Prey for the Proteasome: Targeted Protein Degradation—A Medicinal Chemist's Perspective

Targeted protein degradation (TPD), the ability to control a proteins fate by triggering its degradation in a highly selective and effective manner, has created tremendous excitement in chemical biology and drug discovery within the past decades. The TPD field is spearheaded by small molecule induced protein degradation with molecular glues and proteolysis targeting chimeras (PROTACs) paving the way to expand the druggable space and to create a new paradigm in drug discovery. However, besides the therapeutic angle of TPD a plethora of novel techniques to modulate and control protein levels have been developed. This enables chemical biologists to better understand protein function and to discover and verify new therapeutic targets. This Review gives a comprehensive overview of chemical biology techniques inducing TPD. It explains the strengths and weaknesses of these methods in the context of drug discovery and discusses their future potential from a medicinal chemist's perspective.     

Effect of ZnS shell on the Raman spectra from CdSe nanorods

We investigated the influence of an epitaxially grown ZnS shell on the phonon spectra of CdSe nanorods of different sizes. The CdSe related Raman peaks shift with addition of a ZnS shell. The longitudinal optical phonon shifts slightly due to strain and the low‐energy shoulder shifts stronger, which can be explained within a model for surface optical phonons. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sum List Coloring Graphs

Let G=(V,E) be a graph with n vertices and e edges. The sum choice number of G is the smallest integer p such that there exist list sizes (f(v):v ∈ V) whose sum is p for which G has a proper coloring no matter which color lists of size f(v) are assigned to the vertices v. The sum choice number is bounded above by n+e. If the sum choice number of G equals n+e, then G is sum choice greedy. Complete graphs K_n are sum choice greedy as are trees. Based on a simple, but powerful, lemma we show that a graph each of whose blocks is sum choice greedy is also sum choice greedy. We also determine the sum choice number of K_2,n, and we show that every tree on n vertices can be obtained from K_n by consecutively deleting single edges where all intermediate graphs are sc-greedy.