Results 161 to 170 of about 3,573,561 (343)

eCherry: A Modelica Library for Modular Dynamic Modelling of Electrochemical Reactors

Electrochemical Science Advances, EarlyView.
ABSTRACT Electrochemical reactors offer promising pathways for defossilizing the chemical industry. To understand the operation as well as to evaluate and optimise their performance and efficiency, modelling presents a crucial tool. Currently, no comprehensive open‐source library for dynamic modelling of electrochemical reactors exists, and instead ...
Jan F. Pyschik, Katharina M. Ebeling, Georgia Ioanna Prokopou, Michael J. Rix, J. Raphael Seidenberg, Marius B. Kleiner, Matthias Leitl, Alexander Mitsos, Dominik Bongartz   +8 more
wiley   +1 more source

Filtrations on algebraic cycles and homology [PDF]

, 1995
Eric M. Friedlander
openalex   +1 more source

Study on the Temporal and Spatial Evolution Mechanism of Rotating Cavitation in the First Stage Impeller of LNG Submersible Pump With Two‐Stage Splitter Blades

Energy Science &Engineering, EarlyView.
ABSTRACT This study establishes a full‐flow passage numerical model of an LNG submerged pump equipped with two‐stage splitter blades through three‐dimensional modeling. Numerical simulations validated by liquid nitrogen experiments demonstrate that at 1.4 times the design flow rate, the peak efficiency reaches 60.6%, with a maximum head of 194.93 m ...
Songyu Yao, Weibin Zhang, Dingqi Zhang, Qifeng Jiang, Chenyu Wang   +4 more
wiley   +1 more source

CO2 Storage Site Selection: A Comprehensive Review of Current Approaches

Greenhouse Gases: Science and Technology, EarlyView.
ABSTRACT Global warming, driven by increasing anthropogenic greenhouse gas emissions, has emerged as a critical environmental concern. Carbon capture and storage (CCS) technology offers a promising solution for reducing CO2 emissions, but its effectiveness depends on identifying suitable candidates that can ensure safe, long‐term storage of CO2.
Shahryar Rashidi, Seyed Shariatipour, Mohammadreza Bagheri   +2 more
wiley   +1 more source

Strong External Difference Families and Classification of α $\alpha $‐Valuations

Journal of Combinatorial Designs, EarlyView.
ABSTRACT One method of constructing (a2+1,2,a,1) $({a}^{2}+1,2,a,1)$‐SEDFs (i.e., strong external difference families) in Za2+1 ${{\mathbb{Z}}}_{{a}^{2}+1}$ makes use of α $\alpha $‐valuations of complete bipartite graphs Ka,a ${K}_{a,a}$. We explore this approach and we provide a classification theorem which shows that all such α $\alpha $‐valuations ...
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson   +2 more
wiley   +1 more source

Algebraic cycles on Gushel-Mukai varieties

Épijournal de Géométrie Algébrique
We study algebraic cycles on complex Gushel-Mukai (GM) varieties. We prove the generalised Hodge conjecture, the (motivated) Mumford-Tate conjecture, and the generalised Tate conjecture for all GM varieties. We compute all integral Chow groups of GM varieties, except for the only two infinite-dimensional cases (1-cycles on GM fourfolds and 2-cycles on ...
Fu, L., Moonen, B.J.J.
openaire   +3 more sources

Enumeration and Construction of Row‐Column Designs

Journal of Combinatorial Designs, EarlyView.
ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars‐Daniel Öhman   +3 more
wiley   +1 more source

Dr-irreducibility of connected monounary algebras with a cycle [PDF]

, 2000
Danica Jakubı́ková-Studenovská
openalex   +1 more source

On Endomorphism Universality of Sparse Graph Classes

Journal of Graph Theory, EarlyView.
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley   +1 more source

Explicit Formulas for the Complexity of Networks Produced by New Duplicating Corona and Cartesian Product

Journal of Mathematics
One important algebraic invariant in networks is complexity. This invariant ensures the accuracy and dependability of the network. In this paper, we employ a combinatorial approach to determine the graph’s complexity. A fundamental set of building blocks
Mohamed R. Zeen El Deen, Walaa A. Aboamer, Hamed M. El-Sherbiny   +2 more
doaj   +1 more source