Universität Stuttgart

Permanent URI for this communityhttps://elib.uni-stuttgart.de/handle/11682/1

Browse

Filters

2010 - 201932020 - 20226

Settings

Subject: search.filters.subject.004Subject: search.filters.subject.510End date: 2022

Search Results

Now showing 1 - 9 of 9
  • Thumbnail Image
    ItemOpen Access
    Schaustücke : Einblicke in wissenschaftliche Sammlungen der Universität Stuttgart
    (Stuttgart : Universität Stuttgart, 2022) Wiatrowski, Frank (Gestaltung, Fotograf); Engstler, Katja Stefanie (Gestaltung); Ceranski, Beate (Vorwort); Rambach, Christiane (Vorwort)
    Die wissenschaftlichen Sammlungen der Universität zeugen von einer langen Lehr- und Forschungstradition. In Fakultäten und Instituten, in der Universitätsbibliothek und im Universitätsarchiv sind vielfältige Sammlungen beheimatet, zum Teil mit ungewöhnlichen oder gar einzigartigen Objekten. Die Broschüre gibt erste Einblicke in diese vielfach versteckte Welt der universitären Sammlungen in Stuttgart.
  • Thumbnail Image
    ItemOpen Access
  • Thumbnail Image
    ItemOpen Access
  • Thumbnail Image
    ItemOpen Access
    Multiscale modeling and simulation of transport processes in porous media
    (2022) Bringedal, Carina; Helmig, Rainer (Prof. Dr.-Ing.)
  • Thumbnail Image
    ItemOpen Access
    Circuit complexity of group theoretic problems
    (2021) Weiß, Armin; Diekert, Volker (Prof. Dr. rer. nat.)
    In dieser kumulativen Habilitationsschrift werden sechs Arbeiten zum Thema "Schaltkreiskomplexität von Gruppentheoretischen Problemen" zusammengefasst. An vorderster Stelle steht hierbei das Wortproblem: Gegeben ein Wort über den Erzeugern einer Gruppe, ist die Frage, ob das Wort das Einselement der Gruppe darstellt. Daneben werden noch weitere Probleme, wie das Konjugationsproblem, das Power-Wortproblem (wie das Wortproblem, aber die Eingabe wird in komprimierter Form gegeben) und das Lösen von Gleichungen betrachtet. Die meisten der hier zusammengefassten Arbeiten betrachten die genannten Probleme für spezielle Klassen von Gruppen und klassifizieren deren Komplexität mit Methoden der Schaltkreiskomplexität. Eine Ausnahme bildet die letzte Arbeit zum Thema Gleichungen: hier liegt der Zusammenhang zur Schaltkreiskomplexität darin, dass sich das Erfüllbarkeitsproblem für Gleichungen in endlichen auslösbaren Gruppen ähnlich verhält wie das Erfüllbarkeitsproblem für CC^0 Schaltkreise.
  • Thumbnail Image
    ItemOpen Access
    Equation satisfiability in solvable groups
    (2022) Idziak, Paweł; Kawałek, Piotr; Krzaczkowski, Jacek; Weiß, Armin
    The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell in (Inf. Comput. 178 (1), 253-262, 10 ) where they showed that this problem is in P for nilpotent groups while it is NP -complete for non-solvable groups. Since then, several results have appeared showing that the problem can be solved in polynomial time in certain solvable groups G having a nilpotent normal subgroup H with nilpotent factor G / H . This paper shows that such a normal subgroup must exist in each finite group with equation satisfiability solvable in polynomial time, unless the Exponential Time Hypothesis fails.
  • Thumbnail Image
    ItemOpen Access
    Coupling DuMuX and DUNE-PDELab to investigate evaporation at the interface between Darcy and Navier-Stokes flow
    (Stuttgart : SimTech - Cluster of Excellence, 2017) Grüninger, Christoph; Fetzer, Thomas; Flemisch, Bernd; Helmig, Rainer
    An implementation of a coupled Navier-Stokes/Darcy model based on different Dune discretization modules is presented. The Darcy model is taken from DuMuX, the Navier-Stokes model is implemented on top of Dune-PDELab, and the coupling is done with help of Dune-MultiDomain together with some project-specific auxiliary code. The Navier-Stokes model features one fluid phase, the Darcy model two fluid phases. Each fluid phase may be composed of two components, in addition, non-isothermal processes are considered. The coupling between free and porous-medium flow uses a sharp interface between both subdomains and conserves mass, momentum, and energy by accounting for the corresponding fluxes across the interface. A cell-centered finite volume method (FVM) is combined with a marker and cell (MAC) scheme. It solves the coupled problem in one monolithic system using a Newton method and a direct linear solver. Numerical results demonstrate the basic functioning and a lab-scale reference application.
  • Thumbnail Image
    ItemOpen Access
    Simulating stochastic processes with variational quantum circuits
    (2022) Fink, Daniel
    Simulating future outcomes based on past observations is a key task in predictive modeling and has found application in many areas ranging from neuroscience to the modeling of financial markets. The classical provably optimal models for stationary stochastic processes are so-called ϵ-machines, which have the structure of a unifilar hidden Markov model and offer a minimal set of internal states. However, these models are not optimal in the quantum setting, i.e., when the models have access to quantum devices. The methods proposed so far for quantum predictive models rely either on the knowledge of an ϵ-machine, or on learning a classical representation thereof, which is memory inefficient since it requires exponentially many resources in the Markov order. Meanwhile, variational quantum algorithms (VQAs) are a promising approach for using near-term quantum devices to tackle problems arising from many different areas in science and technology. Within this work, we propose a VQA for learning quantum predictive models directly from data on a quantum computer. The learning algorithm is inspired by recent developments in the area of implicit generative modeling, where a kernel-based two-sample-test, called maximum mean discrepancy (MMD), is used as a cost function. A major challenge of learning predictive models is to ensure that arbitrarily many time steps can be simulated accurately. For this purpose, we propose a quantum post-processing step that yields a regularization term for the cost function and penalizes models with a large set of internal states. As a proof of concept, we apply the algorithm to a stationary stochastic process and show that the regularization leads to a small set of internal states and a constantly good simulation performance over multiple future time steps, measured in the Kullback-Leibler divergence and the total variation distance.
  • Thumbnail Image
    ItemOpen Access
    Discontinuous Galerkin methods for two-phase flows in porous media
    (2010) Grüninger, Christoph
    In this work two-phase flows in porous media are simulated numerically with Discontinuous Galerkin methods. The three methods Symmetrical Interior Penalty Galerkin method (SIPG), Non-symmetrical Interior Penalty Galerkin method (NIPG) and the scheme from Oden, Babuška and Baumann (OBB) are considered. The terminology and the examples are taken from soil science. First the Richards equation is solved using these methods. Then a two-phase flows problem in the saturation/pressure formation is solved with OBB and NIPG. The numerical methods are implemented using the software toolkit PDELab. They are tested with examples from other publications. Weighted averages for absolute and relative permeabilities are examined.