Lehigh University

About: Lehigh University is a education organization based out in Bethlehem, Pennsylvania, United States. It is known for research contribution in the topics: Catalysis & Fracture mechanics. The organization has 12684 authors who have published 26550 publications receiving 770061 citations.

Observing Students in Classroom Settings: A Review of Seven Coding Schemes

Abstract: A variety of coding schemes are available for direct observational assessment of student classroom behavior. These instruments have been used for a number of assessment tasks including screening ch...

Liquid medium annealing for fabricating durable perovskite solar cells with improved reproducibility.

Abstract: Solution processing of semiconductors is highly promising for the high-throughput production of cost-effective electronics and optoelectronics. Although hybrid perovskites have potential in various device applications, challenges remain in the development of high-quality materials with simultaneously improved processing reproducibility and scalability. Here, we report a liquid medium annealing (LMA) technology that creates a robust chemical environment and constant heating field to modulate crystal growth over the entire film. Our method produces films with high crystallinity, fewer defects, desired stoichiometry, and overall film homogeneity. The resulting perovskite solar cells (PSCs) yield a stabilized power output of 24.04% (certified 23.7%, 0.08 cm2) and maintain 95% of their initial power conversion efficiency (PCE) after 2000 hours of operation. In addition, the 1-cm2 PSCs exhibit a stabilized power output of 23.15% (certified PCE 22.3%) and keep 90% of their initial PCE after 1120 hours of operation, which illustrates their feasibility for scalable fabrication. LMA is less climate dependent and produces devices in-house with negligible performance variance year round. This method thus opens a new and effective avenue to improving the quality of perovskite films and photovoltaic devices in a scalable and reproducible manner.

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

Abstract: We propose a branch-and-bound algorithm for solving nonconvex quadratically-constrained quadratic programs. The algorithm is novel in that branching is done by partitioning the feasible region into the Cartesian product of two-dimensional triangles and rectangles. Explicit formulae for the convex and concave envelopes of bilinear functions over triangles and rectangles are derived and shown to be second-order cone representable. The usefulness of these new relaxations is demonstrated both theoretically and computationally.

Singular Value Decomposition for Constrained Dynamical Systems

Abstract: On montre que la methode de decomposition des valeurs singulieres est utile dans le probleme de reduction des equations de mouvement pour une classe de systemes dynamiques contraints, a leur dimension minimale