Exploring foci of
2025-07-16
Active Learning‐Driven Inverse Design of Polyurethane Foams for <scp>EV</scp> Battery Applications
2025-07-16 • Michael R. Hoffmann, Sudarsan M. Pai, Rodrigo Q. Albuquerque, Simon Kastl, Holger Ruckdäschel
ABSTRACT The rapid evolution of the electric vehicle (EV) industry demands advanced materials for battery protection, with polyurethane (PUR) foams emerging as a promising solution due to their thermal insulation, mechanical adaptability, and fire resistance properties. This study introduces an active learning‐driven inverse design (AL‐ID) framework, leveraging machine learning (ML) to systematically optimize PUR foam compositions exhibiting desired density and mechanical strength. AL was employed to iteratively r…
Outline Of Machine Learning
Quantum Machine Learning
List Of Active German Navy Ships
Association Rule Learning
Torch (Machine Learning)
Learning
List Of Active Indian Military Aircraft
List Of Active Duty United States Four-Star Officers
Learning To Crawl
Exploring foci of
2025-02-06
Drawings of complete multipartite graphs up to triangle flips
2025-02-06 • Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael R. Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the rotations of all vertices and crossings. A drawing is simple if each pair of edges has at most one common point. Gioan's Theorem states that for any two simple drawings of the complete graph $K_n$ with the same crossing edge pairs, one drawing can be transformed into the other …
Rock Drawings In Valcamonica
Complete Works
Complete Unknown
The Complete Collected Poems Of Maya Angelou
A Complete Unknown
The Complete Works Of William Shakespeare (Abridged)
Google Drawings
Complete Blood Count
Complete Androgen Insensitivity Syndrome
Exploring foci of
2025-06-27
Inhibition of Urea Hydrolysis in Human Urine for Resource and Energy Recovery: Pharmaceuticals and Their Metabolites as Co-Existing Anticatalyzers
2025-06-27 • H. Chi, Minshu Chen, Wei Yang, LI Ya, Shuhui Sun, Hualin Wang, Xuejing Yang, Michael R. Hoffmann, Lei Guo
Urine, which has a high concentration of urea, can be used as a sustainable resource for nutrient recovery and sustainable energy. However, urea undergoes hydrolysis, catalyzed by urease, generating ammonia and carbon dioxide. As ammonia is released during hydrolysis in stored urine, the pH rises progressively until the pKa of ammonium is reached (i.e., 9.3). At elevated pH levels, struvite and other related precipitates are formed. These reactions lower the efficiency of ammonia and urea nitrogen recovery and oft…
Hydrolysis
Competitive Inhibition
Blood Urea Nitrogen
Urea Breath Test
Urea-Formaldehyde
Lateral Inhibition
Urea
Uncompetitive Inhibition
Atp Hydrolysis
Exploring foci of
2024-10-28
Scalable Ir-Doped NiFe2O4/TiO2 Heterojunction Anode for Decentralized Saline Wastewater Treatment and H2 Production
2024-10-28 • Sukhwa Hong, Jiseon Kim, Jaebeom Park, Sunmi Im, Michael R. Hoffmann, Kangwoo Cho
Abstract Wastewater electrolysis cells (WECs) for decentralized wastewater treatment/reuse coupled with H 2 production can reduce the carbon footprint associated with transportation of water, waste, and energy carrier. This study reports Ir-doped NiFe 2 O 4 (NFI, ~ 5 at% Ir) spinel layer with TiO 2 overlayer (NFI/TiO 2 ), as a scalable heterojunction anode for direct electrolysis of wastewater with circumneutral pH in a single-compartment cell. In dilute (0.1 M) NaCl solutions, the NFI/TiO 2 marks superior activit…
Scalable Link Interface
Exploring foci of
2024-08-28
On $k$-planar Graphs without Short Cycles
2024-08-28 • Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael R. Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to which the forbidden substructures are $3$-cycles, $4$-cycles or both of them (i.e., girth $\ge 5$). For all three settings and all $k\in\{1,2,3\}$, we present lower and upper bounds on the maximum number of edges in any $k$-planar graph on $n$ vertices. Our bounds are of the form …
A World Without Heroes
Without Warning (21 Savage, Offset And Metro Boomin Album)
Games Without Frontiers (Song)
How To Succeed In Business Without Really Trying (Musical)
No Taxation Without Representation
The Man Without Qualities
Without Me (Halsey Song)
World Without End (Follett Novel)
Not Without My Daughter (Book)