Publikationen an der Fakultät für Mathematik und Naturwissenschaften ab 2019

Anzahl der Treffer: 897
Erstellt: Thu, 25 Apr 2024 23:10:31 +0200 in 0.0918 sec


Eichfelder, Gabriele; Quintana, Ernest
Set-based robust optimization of uncertain multiobjective problems via epigraphical reformulations. - In: European journal of operational research, ISSN 0377-2217, Bd. 313 (2024), 3, S. 871-882

In this paper, we study a method for finding robust solutions to multiobjective optimization problems under uncertainty. We follow the set-based minmax approach for handling the uncertainties which leads to a certain set optimization problem with the strict upper type set relation. We introduce, under some assumptions, a reformulation using instead the strict lower type set relation without sacrificing the compactness property of the image sets. This allows to apply vectorization results to characterize the optimal solutions of these set optimization problems as optimal solutions of a multiobjective optimization problem. We end up with multiobjective semi-infinite problems which can then be studied with classical techniques from the literature.



https://www.sciencedirect.com/science/article/pii/S0377221723007208/pdfft?md5=f5272f8643b0ce953294091001149d0f&pid=1-s2.0-S0377221723007208-main.pdf
Zheng, Yingshuang; Li, Huchao; Jiang, Ting; Jiao, Fei; Li, Jie; Lei, Yong; Tian, Guofeng; Bi, Jinshun; Xuan, Yundong; Li, Liqiang; Ji, Deyang; Hu, Wenping
Interfacial molecular screening of polyimide dielectric towards high-performance organic field-effect transistors. - In: Chinese chemical letters, ISSN 1878-5964, Bd. 35 (2024), 2, 108796

The compatibility of the gate dielectrics with semiconductors is vital for constructing efficient conducting channel for high charge transport. However, it is still a highly challenging mission to clearly clarify the relationship between the dielectric layers and the chemical structure of semiconductors, especially vacuum-deposited small molecules. Here, interfacial molecular screening of polyimide (Kapton) dielectric in organic field-effect transistors (OFETs) is comprehensively studied. It is found that the semiconducting small molecules with alkyl side chains prefer to form a high-quality charge transport layer on polyimide (PI) dielectrics compared with the molecules without alkyl side chains. On this basis, the fabricated transistors could reach the mobility of 1.2 cm2 V−1 s−1 the molecule with alkyl side chains on bare PI dielectric. What is more, the compatible semiconductor and dielectric would further produce a low activation energy (EA) of 3.01 meV towards efficient charge transport even at low temperature (e.g., 100K, 0.9 cm2 V−1 s−1). Our research provides a guiding scheme for the construction of high-performance thin-film field-effect transistors based on PI dielectric layer at room and low temperatures.



https://doi.org/10.1016/j.cclet.2023.108796
Kröger, Jörg; Uchihashi, Takashi
Electron spin finds a fresh excitation. - In: Nature physics, ISSN 1745-2481, Bd. 20 (2024), 1, S. 4-5

The Kondo effect - the screening of an impurity spin by conduction electrons - is a fundamental many-body effect. However, recent experiments combined with simulations have caused a long-standing model system for the single-atom Kondo effect to fail.



https://doi.org/10.1038/s41567-023-02265-3
Böhme, Thomas; Harant, Jochen; Kriesell, Matthias; Mohr, Samuel; Schmidt, Jens M.
Rooted minors and locally spanning subgraphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 105 (2024), 2, S. 209-229

Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present paper, we consider “local” versions of such statements. In 1966, for instance, D. W. Barnette proved that a 3-connected planar graph contains a spanning tree of maximum degree at most 3. A local translation of this statement is that if G is a planar graph, X is a subset of specified vertices of G such that X cannot be separated in G by removing two or fewer vertices of G, then G has a tree of maximum degree at most 3 containing all vertices of X. Our results constitute a general machinery for strengthening statements about k-connected graphs (for 1 ≤ k ≤ 4) to locally spanning versions, that is, subgraphs containing a set X ⊆ V (G) of a (not necessarily planar) graph G in which only X has high connectedness. Given a graph G and X ⊆ V (G), we say M is a minor of G rooted at X, if M is a minor of G such that each bag of M contains at most one vertex of X and X is a subset of the union of all bags. We show that G has a highly connected minor rooted at X if X ⊆ V (G) cannot be separated in G by removing a few vertices of G. Combining these investigations and the theory of Tutte paths in the planar case yields locally spanning versions of six well-known results about degree-bounded trees, Hamiltonian paths and cycles, and 2-connected subgraphs of graphs.



https://doi.org/10.1002/jgt.23012
Beddig, Rebekka S.; Benner, Peter; Dorschky, Ines; Reis, Timo; Schwerdtner, Paul; Voigt, Matthias; Werner, Steffen W. R.
Structure-preserving model reduction for dissipative mechanical systems. - In: Calm, smooth and smart, (2024), S. 209-230

Suppressing vibrations in mechanical systems, usually described by second-order dynamical models, is a challenging task in mechanical engineering in terms of computational resources even nowadays. One remedy is structure-preserving model order reduction to construct easy-to-evaluate surrogates for the original dynamical system having the same structure. In our work, we present an overview of recently developed structure-preserving model reduction methods for second-order systems. These methods are based on modal and balanced truncation in different variants, as well as on rational interpolation. Numerical examples are used to illustrate the effectiveness of all described methods.



https://doi.org/10.1007/978-3-031-36143-2_11
Espuny Díaz, Alberto; Janzer, Barnabás; Kronenberg, Gal; Lada, Joanna
Long running times for hypergraph bootstrap percolation. - In: European journal of combinatorics, Bd. 115 (2024), 103783, S. 1-18

Consider the hypergraph bootstrap percolation process in which, given a fixed r-uniform hypergraph H and starting with a given hypergraph G0, at each step we add to G0 all edges that create a new copy of H. We are interested in maximising the number of steps that this process takes before it stabilises. For the case where H = Kr+1(r) with r ≥ 3, we provide a new construction for G0 that shows that the number of steps of this process can be of order Θ (nr). This answers a recent question of Noel and Ranganathan. To demonstrate that different running times can occur, we also prove that, if H is K4(3) minus an edge, then the maximum possible running time is 2n − ⌊log2(n−2)⌋ − 6. However, if H is K5(3) minus an edge, then the process can run for Θ (n3) steps.



https://doi.org/10.1016/j.ejc.2023.103783
Eichfelder, Gabriele; Stein, Oliver
Limit sets in global multiobjective optimization. - In: Optimization, ISSN 1029-4945, Bd. 73 (2024), 1, S. 1-27

Inspired by the recently introduced branch-and-bound method for continuous multiobjective optimization problems from G. Eichfelder, P. Kirst, L. Meng, O. Stein [A general branch-and-bound framework for continuous global multiobjective optimization. J Glob Optim. 2021;80:195-227], we study for a general class of branch-and-bound methods in which sense the generated terminal enclosure and the terminal provisional nondominated set approximate the nondominated set when the termination accuracy is driven to zero. Our convergence analysis of the enclosures relies on constructions from the above paper, but is self-contained and also covers the mixed-integer case. The analysis for the provisional nondominated set is based on general convergence properties of the epsilon-nondominated set, and hence it is also applicable to other algorithms which generate such points. Furthermore, we discuss post-processing steps for the terminal enclosure and provide numerical illustrations for the cases of two and three objective functions.



https://doi.org/10.1080/02331934.2022.2092479
Grebinyk, Anna; Prylutska, Svitlana; Grebinyk, Sergii; Prylutskyy, Yuriy; Ritter, Uwe; Matyshevska, Olga; Dandekar, Thomas; Frohme, Marcus
Toward photodynamic cancer chemotherapy with C60-Doxorubicin nanocomplexes. - In: Nanomaterials for photodynamics therapy, (2023), S. 489-522

Recent progress in nanotechnology has attracted interest to a biomedical application of the carbon nanoparticle C60 fullerene (C60) due to its unique structure and versatile biological activity. The dual functionality of C60 as a photosensitizer and a drug nanocarrier sets an opportunity to improve the efficiency of chemotherapeutic drugs for cancer cells. Pristine C60 demonstrates time-dependent accumulation with predominant mitochondrial localization in cancer cells. Nanomolar amounts of C60-drug nanocomplexes in 1:1 and 2:1 molar ratios improve the efficiency of cell treatment, complementing it with photodynamic approach. The cooperative enhancement interactions between mechanisms of chemo- and photodynamic therapies contribute to the obtained synergistic effect (namely “1+1>2”). A strong synergy of treatments arising from the combination of C60-mediated drug delivery and C60 photoexcitation indicates that a combination of chemo- and photodynamic treatments with C60-drug nanoformulations could provide a promising synergetic approach for cancer treatment.



https://doi.org/10.1016/B978-0-323-85595-2.00005-0
Lüdge, Kathy;
Photonic reservoir computing for energy efficient and versatile machine learning application. - In: Proceedings of the Royal Society of Victoria, Bd. 135 (2023), 2, S. 38-40

Time-multiplexed reservoir computing is a machine learning concept which can be realised in photonic hardware systems using only one physical node. The concept can be used for various problems, ranging from classification problems to time-series prediction tasks, while being fast and energy efficient. Here, a theoretical analysis of a reservoir computer realised via delay-coupled semiconductor lasers is presented and the role of the internal system time-scales and the bifurcation structure is discussed. It is further shown that optimal performance can be reached by tailoring the coupling delays to the specific memory requirements of the given task.



https://doi.org/10.1071/rs23006
Jaster, Jonas; Dreßler, Elias; Geitner, Robert; Groß, Gregor Alexander
Synthesis and spectroscopic characterization of furan-2-carbaldehyde-d. - In: Molbank, ISSN 1422-8599, Bd. 2023 (2023), 2, M1654, S. 1-9

Here, we present a protocol for the one-step synthesis of the title compound in quantitative yield using adapted Vilsmeier conditions. The product was characterized by 1H-,2H-,13C-NMR-, as well as IR and Raman spectroscopy. Spectral data are given in detail.



https://doi.org/10.3390/M1654