<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1771</id>
    <completedYear>2022</completedYear>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>28 Seiten</pageNumber>
    <edition/>
    <issue>5</issue>
    <volume>2022</volume>
    <type>article</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-05-12</completedDate>
    <publishedDate>2022-05-12</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An ICT architecture for enabling ancillary services in Distributed Renewable Energy Sources based on the SGAM framework</title>
    <abstract language="eng">Smart Grids are electrical grids that require a decentralised way of controlling electric power conditioning and thereby control the production and distribution of energy. Yet, the integration of Distributed Renewable Energy Sources (DRESs) in the Smart Grid introduces new challenges with regards to electrical grid balancing and storing of electrical energy, as well as additional monetary costs. Furthermore, the future smart grid also has to take over the provision of Ancillary Services (ASs). In this paper, a distributed ICT infrastructure to solve such challenges, specifically related to ASs in future Smart Grids, is described. The proposed infrastructure is developed on the basis of the Smart Grid Architecture Model (SGAM) framework, which is defined by the European Commission in Smart Grid Mandate M/490. A testbed that provides a flexible, secure, and low-cost version of this architecture, illustrating the separation of systems and responsibilities, and supporting both emulated DRESs and real hardware has been developed. The resulting system supports the integration of a variety of DRESs with a secure two-way communication channel between the monitoring and controlling components. It assists in the analysis of various inter-operabilities and in the verification of eventual system designs. To validate the system design, the mapping of the proposed architecture to the testbed is presented. Further work will help improve the architecture in two directions; first, by investigating specific-purpose use cases, instantiated using this more generic framework; and second, by investigating the effects a realistic number and variety of connected devices within different grid configurations has on the testbed infrastructure.</abstract>
    <parentTitle language="eng">Energy Informatics (2520-8942)</parentTitle>
    <identifier type="issn">2520-8942</identifier>
    <identifier type="doi">10.1186/s42162-022-00189-5</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2022071721175548518669</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:03:39+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">f3542fa8f7ad7fdda438a8e791e7a6e5</enrichment>
    <enrichment key="SourceTitle">Energy Informatics ; (2022) 5:5. - 28 Seiten. - ISSN: 2520-8942</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Armin Stocker</author>
    <author>Ali Alshawish</author>
    <author>Martin Bor</author>
    <author>John Vidler</author>
    <author>Antonios Gouglidis</author>
    <author>Andrew Scott</author>
    <author>Angelos Marnerides</author>
    <author>Hermann De Meer</author>
    <author>David Hutchison</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Ancillary services</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SGAM</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>DRES</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Smart Grid</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Information and Computing Sciences</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="FundingAcknowledgement" number="">Gefördert durch den Open-Access-Publikationsfonds der Universitätsbibliothek Passau.</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1771/s42162-022-00189-5.pdf</file>
  </doc>
  <doc>
    <id>1931</id>
    <completedYear>2025</completedYear>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1069</pageFirst>
    <pageLast>1075</pageLast>
    <pageNumber>7 Seiten</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>62 (2025)</volume>
    <type>article</type>
    <publisherName>Cambridge University Press</publisherName>
    <publisherPlace>Cambridge</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2025-02-14</completedDate>
    <publishedDate>2025-02-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal convergence rates of MCMC integration for functions with unbounded second moment</title>
    <abstract language="eng">We study the Markov chain Monte Carlo estimator for numerical integration for func-&#13;
tions that do not need to be square integrable with respect to the invariant distribution.&#13;
For chains with a spectral gap we show that the absolute mean error for L^p functions,&#13;
with p ∈ (1, 2), decreases like n^(1/p)−1 , which is known to be the optimal rate. This&#13;
improves currently known results where an additional parameter δ &gt; 0 appears and the&#13;
convergence is of order n^((1+δ)/p)−1 .</abstract>
    <parentTitle language="eng">Journal of Applied Probability</parentTitle>
    <identifier type="doi">10.1017/jpr.2024.108</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19310</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="SourceTitle">Journal of Applied Probability ; 62 (2025), 3. - Seiten 1069-1075. - ISSN 1475-6072</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Julian Hofstadler</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Markov chain</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Monte Carlo</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>spectral gap</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>absolute mean error</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">Cambridge University Press</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1931/hofstadler_optimal_convergence_rates.pdf</file>
  </doc>
  <doc>
    <id>1930</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>483</pageFirst>
    <pageLast>508</pageLast>
    <pageNumber>26 Seiten</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>90 (2025)</volume>
    <type>article</type>
    <publisherName>Cambridge University Press</publisherName>
    <publisherPlace>Cambridge</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-09-30</completedDate>
    <publishedDate>2024-09-30</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A parameterized halting problem, Δ0 truth and the MRDP theorem</title>
    <abstract language="eng">We study the parameterized complexity of the problem to decide whether a given natural number n satisfies a given Δ0-formula ϕ(x); the parameter is the size of ϕ. This parameterization focusses attention on instances where n is large compared to the size of ϕ.We show unconditionally that this problem does not belong to the parameterized analogue of AC0. From this we derive that certain natural upper bounds on the complexity of our parameterized problem imply certain separations of classical complexity classes. This connection is obtained via an analysis of a parameterized halting problem. Some of these upper bounds follow assuming that IΔ0 proves the MRDP theorem in a certain weak sense.</abstract>
    <parentTitle language="eng">The Journal of Symbolic Logic (ISSN 1943-5886)</parentTitle>
    <identifier type="doi">10.1017/jsl.2024.44</identifier>
    <identifier type="issn">1943-5886</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19308</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="SourceTitle">The Journal of Symbolic Logic ; 90 (2025), 2. - Seiten 483-508. ISSN 1943-5886</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Yijia Chen</author>
    <author>Moritz Müller</author>
    <author>Keita Yokoyama</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>bounded arithmetical truth</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>parameterized halting</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>descriptive complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>weak arithmetic</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>MRDP theorem</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">Cambridge University Press</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1930/chen_mueller_yokoyama_mrdp_theorem.pdf</file>
  </doc>
  <doc>
    <id>1916</id>
    <completedYear>2025</completedYear>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>565</pageFirst>
    <pageLast>584</pageLast>
    <pageNumber>20 Seiten</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>34 (2025)</volume>
    <type>article</type>
    <publisherName>Cambridge University Press</publisherName>
    <publisherPlace>Cambridge</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2025-05-30</completedDate>
    <publishedDate>2025-05-30</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Tight Hamilton cycles with high discrepancy</title>
    <abstract language="eng">In this paper, we study discrepancy questions for spanning subgraphs of k-uniform hypergraphs. Our main result is that, for any integers k ≥ 3 and r ≥ 2, any r-colouring of the edges of a k-uniform n-vertex hypergraph G with minimum (k−1)-degree δ(G) ≥ (1/2+o(1))n contains a tight Hamilton cycle with high discrepancy, that is, with at least n/r +� (n) edges of one colour. The minimum degree condition is asymptotically best possible and our theorem also implies a corresponding result for perfect matchings.&#13;
Our tools combine various structural techniques such as Turán-type problems and hypergraph shadows with probabilistic techniques such as random walks and the nibble method. We also propose several intriguing problems for future research.</abstract>
    <parentTitle language="eng">Combinatorics, Probability and Computing (1469-2163)</parentTitle>
    <identifier type="doi">10.1017/S0963548325000057</identifier>
    <identifier type="issn">1469-2163</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19166</identifier>
    <enrichment key="SourceTitle">Combinatorics, Probability and Computing ; 43 (2025), 4. - Seiten 565-584. - ISSN 1469-2163</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Lior Gishboliner</author>
    <author>Stefan Glock</author>
    <author>Amedeo Sgueglia</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Discrepancy</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>tight Hamilton cycles</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>random walks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>nibble method</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">Cambridge University Press</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1916/gishboliner_glock_sgueglia_hamilton_cycles.pdf</file>
  </doc>
  <doc>
    <id>1926</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1440</pageFirst>
    <pageLast>1466</pageLast>
    <pageNumber>27 Seiten</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>56 (2024)</volume>
    <type>article</type>
    <publisherName>Cambridge University Press</publisherName>
    <publisherPlace>Cambridge</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-07-25</completedDate>
    <publishedDate>2024-07-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Convergence of hybrid slice sampling via spectral gap</title>
    <abstract language="eng">It is known that the simple slice sampler has robust convergence properties; however, the class of problems where it can be implemented is limited. In contrast, we consider hybrid slice samplers which are easily implementable and where another Markov chain approximately samples the uniform distribution on each slice. Under appropriate assumptions on the Markov chain on the slice, we give a lower bound and an upper bound of the spectral gap of the hybrid slice sampler in terms of the spectral gap of the simple slice sampler. An immediate consequence of this is that the spectral gap and geometric ergodicity of the hybrid slice sampler can be concluded from the spectral gap and geometric ergodicity of the simple version, which is very well understood. These results indicate that robustness properties of the simple slice sampler are inherited by (appropriately designed) easily implementable hybrid versions. We apply the developed theory and analyze a number of specific algorithms, such as the stepping-out shrinkage slice sampling, hit-and-run slice sampling on a class of multivariate targets, and an easily implementable combination of both procedures on multidimensional bimodal densities.</abstract>
    <parentTitle language="eng">Advances in Applied Probability</parentTitle>
    <identifier type="doi">10.1017/apr.2024.16</identifier>
    <identifier type="issn">1475-6064</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19264</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Krzysztof Łatuszyński</author>
    <author>Daniel Rudolf</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Slice sampler</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>spectral gap</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>geometric ergodicity</value>
    </subject>
    <collection role="ddc" number="519">Wahrscheinlichkeiten, angewandte Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">Cambridge University Press</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1926/latuszynski_rudolf_hybrid_slice_sampling.pdf</file>
  </doc>
  <doc>
    <id>1923</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>16 Seiten</pageNumber>
    <edition/>
    <issue>379</issue>
    <volume>2025</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-11-22</completedDate>
    <publishedDate>2024-11-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A stochastic flexibility calculus for uncertainty-aware energy flexibility management</title>
    <abstract language="eng">The increasing share of volatile renewables in power systems requires more reserves to balance forecast errors in renewable generation and power fluctuations. In contrast, common reserves such as gas-fired power plants are phased out, impeding the procurement of sufficient reserves. Alternative reserves, particularly on the demand side, such as battery storage systems, also exhibit some degree of freedom to deviate from their scheduled operating point to supply or consume more or less power, thus providing a flexibility potential. However, demand-side flexibility potentials are generally subject to uncertainties, and so is the generation of volatile renewables. The challenge is incorporating the uncertainties on both sides to procure sufficient (uncertain) flexibility potential in advance. Considering uncertainty is important to avoid additional, drastic measures in real-time to balance generation and demand, such as curtailing renewable generation or load shedding. This work presents a stochastic flexibility calculus that provides an indicator for computing the risk of insufficient flexibility potentials or, conversely, guarantees for sufficient flexibility potentials. Thus, the stochastic flexibility calculus contributes to overcoming the challenge of procuring sufficient flexibility potentials in renewable-based systems. An evaluation based on real data is performed using an example of a renewable energy community consisting of households equipped with photovoltaic power plants and battery storage systems. The newly introduced stochastic flexibility calculus computes the number of households that must operate their battery storage systems flexibly to balance forecast errors locally. The results show that the forecast method significantly influences this number. Some numerical results appear unexpected, as too many flexibility-friendly households can negatively impact the aggregated household flexibility potential.</abstract>
    <parentTitle language="eng">Applied Energy</parentTitle>
    <identifier type="doi">10.1016/j.apenergy.2024.124907</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19233</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Michael Lechl</author>
    <author>Hermann de Meer</author>
    <author>Tim Fürmann</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Stochastic network calculus</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Probabilistic flexibility guarantees</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Power system flexibility</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Renewable energy community</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Uncertainty modeling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Battery storage system</value>
    </subject>
    <collection role="ddc" number="519">Wahrscheinlichkeiten, angewandte Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1923/lechl_meer_fuermann_energy_flexibility.pdf</file>
  </doc>
  <doc>
    <id>1919</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>15 Seiten</pageNumber>
    <edition/>
    <issue>1021</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-28</completedDate>
    <publishedDate>2024-10-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Parameterized complexity of vertex splitting to pathwidth at most 1</title>
    <abstract language="eng">Motivated by the planarization of 2-layered straight-line drawings, we consider the problem of modifying a graph such that the resulting graph has pathwidth at most 1. The problem Pathwidth-One Vertex Explosion (POVE) asks whether such a graph can be obtained using at most 𝑘 vertex explosions, where a vertex explosion replaces a vertex 𝑣 by deg(𝑣) degree-1 vertices, each incident to exactly one edge that was originally incident to 𝑣. For POVE, we give an FPT algorithm with running time 𝑂(4𝑘 ⋅ 𝑚) and an 𝑂(𝑘2) kernel, thereby improving over the 𝑂(𝑘6) kernel by Ahmed et al. [2] in a more general setting. Similarly, a vertex split replaces a vertex 𝑣 by two distinct vertices 𝑣1 and 𝑣2 and distributes the edges originally incident to 𝑣 arbitrarily to 𝑣1 and 𝑣2. Analogously to POVE, we define the problem variant Pathwidth-One Vertex Splitting&#13;
(POVS) that uses the split operation instead of vertex explosions. Here we obtain a linear kernel and an algorithm with running time 𝑂((6𝑘 + 12)𝑘 ⋅ 𝑚). This answers an open question by Ahmed et al. [2].&#13;
Finally, we consider the problem Π-VertexSplitting (Π-VS), which generalizes the problem POVS and asks whether a given graph can be turned into a graph of a specific graph class Π using at most 𝑘 vertex splits. For graph classes Π that can be dfined&#13;
in monadic second-order graph logic (MSO2), we show that the problem Π-VS can be expressed as an MSO2 formula, resulting in an FPT algorithm for Π-VS parameterized by 𝑘 if Π additionally has bounded treewidth. We obtain the same result for the problem variant using vertex explosions.&#13;
&#13;
[2]&#13;
R. Ahmed, S.G. Kobourov, M. Kryven, An FPT algorithm for bipartite vertex splitting, in: P. Angelini, R. von Hanxleden (Eds.), Graph Drawing and Network Visualization -30th International Symposium, GD 2022, in: Lecture Notes in Computer Science, vol.13764, Springer, 2022, pp.261--268.</abstract>
    <parentTitle language="eng">Theoretical Computer Science</parentTitle>
    <identifier type="doi">10.1016/j.tcs.2024.114928</identifier>
    <identifier type="issn">1879-2294</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19195</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Jakob Baumann</author>
    <author>Matthias Pfretzschner</author>
    <author>Ignaz Rutter</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Vertex splitting</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Pathwidth 1</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>2-layer drawing</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1919/baumann_pfretzschner_rutter_vertex_splitting.pdf</file>
  </doc>
  <doc>
    <id>1918</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>206</pageFirst>
    <pageLast>246</pageLast>
    <pageNumber>41 Seiten</pageNumber>
    <edition/>
    <issue>664 B</issue>
    <volume>2025</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-29</completedDate>
    <publishedDate>2024-11-08</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Decomposing finite Z-algebras</title>
    <abstract language="eng">For a finite Z-algebra R, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of R/Ann(R) into directly indecomposable factors under weak hypotheses. The method is based on constructing and decomposing a ring of scalarsS, and then lifting the decomposition ofSto the bilinear map given by the multiplication of R, and finally to R/Ann(R). All steps of the construction are given as explicit algorithms and it is shown that the entire procedure has a probabilistic polynomial time complexity in the bit size of the input, except for the possible need to calculate the prime factorization of an integer. In particular, in the case when Ann(R)=0, these algorithms compute direct decompositions of R into directly indecomposable factors.</abstract>
    <parentTitle language="eng">Journal of Algebra</parentTitle>
    <identifier type="doi">10.1016/j.jalgebra.2024.10.027</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19184</identifier>
    <identifier type="issn">1090-266X</identifier>
    <author>Martin Kreuzer</author>
    <author>Alexei Miasnikov</author>
    <author>Florian Walsh</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Algebra decomposition</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Directly indecomposable factor</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Bilinear map</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Maximal ring of scalars</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Primitive idempotent</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Lie ring</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1918/kreuzer_miasnikov_walsh_decomp_fin_Zalg.pdf</file>
  </doc>
  <doc>
    <id>1915</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>45 Seiten</pageNumber>
    <edition/>
    <issue>458 B</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-25</completedDate>
    <publishedDate>2024-10-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Hamilton cycles in pseudorandom graphs</title>
    <abstract language="eng">Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well-known conjecture in the area states that any d-regular n-vertex graph G whose second largest eigenvalue in absolute value λ(G) is at most d/C, for some universal constant C &gt; 0, has a Hamilton cycle. In this paper, we obtain two main results which make substantial progress towards this problem. Firstly, we settle this conjecture in full when the degree d is at least a small power of n. Secondly, in the general case we show that λ(G) ≤ d/C(log n)1/3 implies the existence of a Hamilton cycle, improving the 20-year old bound of d/ log1−o(1) n of Krivelevich and Sudakov. We use in a novel way a variety of methods, such as a robust Pósa rotation-extension technique, the Friedman-Pippenger tree embedding with rollbacks and the absorbing method, combined with additional tools and ideas.&#13;
Our results have several interesting applications. In particular, they imply the currently best-known bounds on the number of generators which guarantee the Hamiltonicity of random Cayley graphs, which is an important partial case of the well known Hamiltonicity conjecture of Lovász. They can also be used to improve a result of Alon and Bourgain on additive patterns in multiplicative subgroups.</abstract>
    <parentTitle language="eng">Advances in Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.aim.2024.109984</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19151</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Stefan Glock</author>
    <author>David Munhá Correia</author>
    <author>Benny Sudakov</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hamilton cycle</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hamiltonicity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Pseudorandom graph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Expander graph</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1915/glock_correia_sudakov_hamilton_cycles.pdf</file>
  </doc>
  <doc>
    <id>1914</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>92</pageFirst>
    <pageLast>122</pageLast>
    <pageNumber>31 Seiten</pageNumber>
    <edition/>
    <issue>704</issue>
    <volume>2025</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-03</completedDate>
    <publishedDate>2024-10-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The joint spectral radius is pointwise Hölder continuous</title>
    <abstract language="eng">We show that the joint spectral radius is pointwise Hölder continuous. In addition, the joint spectral radius is locally Hölder continuous for ε-inflations. In the two-dimensional case, local Hölder continuity holds on the matrix sets with positive joint spectral radius.</abstract>
    <parentTitle language="eng">Linear Algebra and its Applications</parentTitle>
    <identifier type="issn">1873-1856</identifier>
    <identifier type="doi">10.1016/j.laa.2024.09.016</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19140</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Jeremias Epperlein</author>
    <author>Fabian Wirth</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Joint spectral radius</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hölder continuity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Extremal norm</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1914/epperlein_wirth_joint_spectral_radius.pdf</file>
  </doc>
  <doc>
    <id>1913</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>31 Seiten</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>229 (2025)</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-01</completedDate>
    <publishedDate>2024-10-10</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Differential theory of zero-dimensional schemes</title>
    <abstract language="eng">To study a 0-dimensional scheme |X in |P^n over a perfect field K, we use the module of Kähler differentials (Omega)(^1)(_{R/K}) of its homogeneous coordinate ring R and its exterior powers, the higher modules of Kähler differentials (Omega)(^m)(_{R/K}). One of our main results is a characterization of weakly curvilinear schemes |X by the Hilbert polynomials of the modules (Omega)(^m)(_{R/K}) which allows us to check this property algorithmically without computing the primary decomposition of the vanishing ideal of |X. Further main achievements are precise formulas for the Hilbert functions and Hilbert polynomials of the modules (Omega)(^m)(_{R/K}) for a fat point scheme |X which extend and settle previous partial results and conjectures. Underlying these results is a novel method: we first embed the homogeneous coordinate ring R into its truncated integral closure ~R. Then we use the corresponding map from the module of Kähler differentials (Omega)(^1)(_{R/K}) to (Omega)(^1)(_{~R/K}) to find a formula for the Hilbert polynomial HP((Omega)(^1)(_{R/K})) and a sharp bound for the regularity index ri((Omega)(^1)(_{R/K})). Next we extend this to formulas for the Hilbert polynomials HP((Omega)(^m)(_{R/K})) and bounds for the regularity indices of the higher modules of Kähler differentials. As a further application, we characterize uniformity conditions on |X using the Hilbert functions of the Kähler differential modules of |X and its subschemes.</abstract>
    <parentTitle language="eng">Journal of Pure and Applied Algebra</parentTitle>
    <identifier type="doi">10.1016/j.jpaa.2024.107815</identifier>
    <identifier type="issn">1873-1376</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-19130</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Martin Kreuzer</author>
    <author>Tran N. K. Linh</author>
    <author>Le N. Long</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Kähler differential module</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Zero-dimensional scheme</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Regularity index</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hilbert function</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Curvilinear scheme</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Fat point scheme</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1913/kreuzer_linh_long_differential_theory.pdf</file>
  </doc>
  <doc>
    <id>1765</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>4025</pageFirst>
    <pageLast>4051</pageLast>
    <pageNumber>27 Seiten</pageNumber>
    <edition/>
    <issue>6</issue>
    <volume>7 (2024)</volume>
    <type>article</type>
    <publisherName>MDPI</publisherName>
    <publisherPlace>Basel</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-12-23</completedDate>
    <publishedDate>2024-12-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Power management approach of hybrid energy storage system for electric vehicle charging stations</title>
    <abstract language="eng">The applicability of Hybrid Energy Storage Systems (HESSs) has been shown in multiple application fields, such as Charging Stations (CSs), grid services, and microgrids. HESSs consist of an integration of two or more single Energy Storage Systems (ESSs) to combine the benefits of each ESS and improve the overall system performance. In this work, we propose a novel power management controller called the Hybrid Controller for the efficient HESS’s charging and discharging, considering the State of Charge (SoC) of the HESS and the dynamic supply and load. The Hybrid Controller optimises the use of the HESS, i.e., minimises the amount of energy drawn from and discharged to the grid, thus utilising and prioritising the provided Photovoltaic (PV) power. The performance of our proposal was assessed via simulation using various evaluation metrics, i.e., Autarky, charge/discharge cycle, and Self-Consumption (SC), where we defined 24 scenarios in different locations in Germany.</abstract>
    <parentTitle language="eng">Smart Cities</parentTitle>
    <identifier type="issn">2624-6511</identifier>
    <identifier type="doi">10.3390/smartcities7060156</identifier>
    <identifier type="urn">urn:nbn:de:bvb:m347-opus-6045</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:03:28+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">4973fecd64044681b737f53f62f22798</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Wiem Fekih Hassen</author>
    <author>Luis Schoppik</author>
    <author>Sascha Schiegg</author>
    <author>Armin Gerl</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>HESS</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>RFB</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>lithium battery</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>power distribution</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>OpenEMS</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real load dataset</value>
    </subject>
    <collection role="ddc" number="600">Technik, Technologie</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1765/smartcities-07-00156.pdf</file>
  </doc>
  <doc>
    <id>1832</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>18 Seiten</pageNumber>
    <edition/>
    <issue>6</issue>
    <volume>2023</volume>
    <type>article</type>
    <publisherName>Frontiers</publisherName>
    <publisherPlace>Lausanne</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-11-17</completedDate>
    <publishedDate>2023-11-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Performance analysis of large language models in the domain of legal argument mining</title>
    <abstract language="eng">Generative pre-trained transformers (GPT) have recently demonstrated excellent performance in various natural language tasks. The development of ChatGPT and the recently released GPT-4 model has shown competence in solving complex and higher-order reasoning tasks without further training or fine-tuning. However, the applicability and strength of these models in classifying legal texts in the context of argument mining are yet to be realized and have not been tested thoroughly. In this study, we investigate the effectiveness of GPT-like models, specifically GPT-3.5 and GPT-4, for argument mining via prompting. We closely study the model's performance considering diverse prompt formulation and example selection in the prompt via semantic search using state-of-the-art embedding models from OpenAI and sentence transformers. We primarily concentrate on the argument component classification task on the legal corpus from the European Court of Human Rights. To address these models' inherent non-deterministic nature and make our result statistically sound, we conducted 5-fold cross-validation on the test set. Our experiments demonstrate, quite surprisingly, that relatively small domain-specific models outperform GPT 3.5 and GPT-4 in the F1-score for premise and conclusion classes, with 1.9% and 12% improvements, respectively. We hypothesize that the performance drop indirectly reflects the complexity of the structure in the dataset, which we verify through prompt and data analysis. Nevertheless, our results demonstrate a noteworthy variation in the performance of GPT models based on prompt formulation. We observe comparable performance between the two embedding models, with a slight improvement in the local model's ability for prompt selection. This suggests that local models are as semantically rich as the embeddings from the OpenAI model. Our results indicate that the structure of prompts significantly impacts the performance of GPT models and should be considered when designing them.</abstract>
    <parentTitle language="eng">Frontiers in Artificial Intelligence</parentTitle>
    <identifier type="issn">2624-8212</identifier>
    <identifier type="doi">10.3389/frai.2023.1278796</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18326</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:05:07+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">bc33d6278340e6e7ea08f292129cd362</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Abdullah Al Zubaer</author>
    <author>Michael Granitzer</author>
    <author>Jelena Mitrović</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>natural language processing (NLP)</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>argument mining</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>legal data</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>European Court of Human Rights (ECHR)</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>sequence classification</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>GPT-4</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ChatGPT</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>large language models</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/Data_Sheet_1.PDF</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/Data_Sheet_2.pdf</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/frai-06-1278796-g0001.tif</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/frai-06-1278796-g0002.tif</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/frai-06-1278796-g0003.tif</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/frai-06-1278796-g0004.tif</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/frai-06-1278796-i0001.tif</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1832/frai-06-1278796.pdf</file>
  </doc>
  <doc>
    <id>1834</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>8 Seiten</pageNumber>
    <edition/>
    <issue>8</issue>
    <volume>2023</volume>
    <type>article</type>
    <publisherName>Frontiers</publisherName>
    <publisherPlace>Lausanne</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-12-05</completedDate>
    <publishedDate>2023-12-05</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Is GPT-4 a reliable rater? Evaluating consistency in GPT-4's text ratings</title>
    <abstract language="eng">This study reports the Intraclass Correlation Coefficients of feedback ratings produced by OpenAI's GPT-4, a large language model (LLM), across various iterations, time frames, and stylistic variations. The model was used to rate responses to tasks related to macroeconomics in higher education (HE), based on their content and style. Statistical analysis was performed to determine the absolute agreement and consistency of ratings in all iterations, and the correlation between the ratings in terms of content and style. The findings revealed high interrater reliability, with ICC scores ranging from 0.94 to 0.99 for different time periods, indicating that GPT-4 is capable of producing consistent ratings. The prompt used in this study is also presented and explained.</abstract>
    <parentTitle language="eng">Frontiers in Education</parentTitle>
    <identifier type="issn">2504-284X</identifier>
    <identifier type="doi">10.3389/feduc.2023.1272229</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18348</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:05:10+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">9882582f2b5b4aa7eafdc2fc6c14ae5e</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Veronika Hackl</author>
    <author>Alexandra Elena Müller</author>
    <author>Michael Granitzer</author>
    <author>Maximilian Sailer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>artificial intelligence</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>GPT-4</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>large language model</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>prompt engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>feedback</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>higher education</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="ddc" number="600">Technik, Technologie</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Juristische Fakultät</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="institutes" number="">Sozial- und Bildungswissenschaftliche Fakultät</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1834/feduc-08-1272229-g0001.tif</file>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1834/feduc-08-1272229.pdf</file>
  </doc>
  <doc>
    <id>1740</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>26 Seiten</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>18</volume>
    <type>article</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-24</completedDate>
    <publishedDate>2024-10-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">SAT Solving Using XOR-OR-AND Normal Forms</title>
    <abstract language="eng">This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by XORs of literals. As a first theoretic result, we show that every CNF formula is equisatisfiable to a formula in 2-XNF, i.e., a formula in XNF where each clause involves at most two XORs of literals. Subsequently, we present an algorithm which converts Boolean polynomials efficiently from their Algebraic Normal Form (ANF) to formulas in 2-XNF. Experiments with the cipher ASCON-128 show that cryptographic problems, which by design are based strongly on XOR-operations, can be represented using far fewer variables and clauses in 2-XNF than in CNF. In order to take advantage of this compact representation, new SAT solvers based on input formulas in 2-XNF need to be designed. By taking inspiration from graph-based 2-CNF SAT solving, we devise a new DPLL-based SAT solver for formulas in 2-XNF. Among others, we present advanced pre- and in-processing techniques. Finally, we give timings for random 2-XNF instances and instances related to key recovery attacks on round reduced ASCON-128, where our solver outperforms state-of-the-art alternative solving approaches.</abstract>
    <parentTitle language="eng">Mathematics in Computer Science (ISSN: 1661-8289)</parentTitle>
    <identifier type="issn">1661-8270</identifier>
    <identifier type="issn">1661-8289</identifier>
    <identifier type="doi">10.1007/s11786-024-00594-x</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2502242130589.859216082138</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:02:50+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">33d559075a82ce9f23bfc9cb2b196a16</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Bernhard Andraschko</author>
    <author>Julian Danner</author>
    <author>Martin Kreuzer</author>
    <subject>
      <language>eng</language>
      <type>swd</type>
      <value>-</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SAT solving</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>XOR constraint</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Algebraic normal form</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Implication graph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Cryptographic attack</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>03B70</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>13P15</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>05C90</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>94A60</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1740/11786_2024_Article_594.pdf</file>
  </doc>
  <doc>
    <id>1739</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>85</pageFirst>
    <pageLast>95</pageLast>
    <pageNumber>11 Seiten</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>24</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin/Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-06-12</completedDate>
    <publishedDate>2024-06-12</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Legal Perspectives on Research Data Storage</title>
    <abstract language="eng">Responsibly managing research data has become increasingly important for researchers, especially within the database research community. Despite significant progress in best practices, the state-of-the-art in research data storage is lacking from a legal perspective. We introduce the stakeholders and the dynamic nature of their relationships (such as researchers changing affiliation) and observe that no existing infrastructure for research data storage fully meets their requirements. Therefore, we emphasize the need to design a comprehensive system architecture for research data storage that is aligned with legal considerations from the start, rather than as an afterthought.</abstract>
    <parentTitle language="eng">Datenbank-Spektrum (ISSN: 1618-2162)</parentTitle>
    <identifier type="issn">1618-2162</identifier>
    <identifier type="issn">1610-1995</identifier>
    <identifier type="doi">10.1007/s13222-024-00478-1</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2410012125227.647518861484</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:02:48+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">2bad5ba6ed8f0c48be10e2e8eb00ccee</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Michael Beurskens</author>
    <author>Stefanie Scherzinger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Storage Contract</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Copyright</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Sui Generis Right</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Privacy</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Trade Secrets</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Research Data</value>
    </subject>
    <collection role="ddc" number="340">Recht</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Juristische Fakultät</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1739/13222_2024_Article_478.pdf</file>
  </doc>
  <doc>
    <id>1694</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1711</pageFirst>
    <pageLast>1721</pageLast>
    <pageNumber>11 Seiten</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>36</volume>
    <type>article</type>
    <publisherName>Springer US</publisherName>
    <publisherPlace>New York</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-03-01</completedDate>
    <publishedDate>2024-03-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Vision based process monitoring in wire arc additive manufacturing (WAAM)</title>
    <abstract language="eng">A stable welding process is crucial to obtain high quality parts in wire arc additive manufacturing. The complexity of the process makes it inherently unstable, which can cause various defects, resulting in poor geometric accuracy and material properties. This demands for in-process monitoring and control mechanisms to industrialize the technology. In this work, process monitoring algorithms based on welding camera image analysis are presented. A neural network for semantic segmentation of the welding wire is used to monitor the working distance as well as the horizontal position of the wire during welding and classic image processing techniques are applied to capture spatter formation. Using these algorithms, the process stability is evaluated in real time and the analysis results enable the direction independent closed-loop-control of the manufacturing process. This significantly improves geometric fidelity as well as mechanical properties of the fabricated part and allows the automated production of parts with complex deposition paths including weld bead crossings, curvatures and overhang structures.</abstract>
    <parentTitle language="eng">Journal of Intelligent Manufacturing (ISSN: 1572-8145)</parentTitle>
    <identifier type="issn">0956-5515</identifier>
    <identifier type="issn">1572-8145</identifier>
    <identifier type="doi">10.1007/s10845-023-02287-x</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2405052141549.085870766506</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:01:47+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">20978d6dd03618d6ea6717fe4f856091</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Jan Franke</author>
    <author>Florian Heinrich</author>
    <author>Raven T. Reisch</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Wire arc additive manufacturing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Vision based monitoring</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Machine learning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Nozzle-to-work distance monitoring</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Contact tube wear off detection</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Spatter detection</value>
    </subject>
    <collection role="ddc" number="604">Spezielle Themen</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1694/10845_2024_Article_2287.pdf</file>
  </doc>
  <doc>
    <id>1665</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>545</pageFirst>
    <pageLast>574</pageLast>
    <pageNumber>30 Seiten</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>192</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin/Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-04-03</completedDate>
    <publishedDate>2024-04-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Diophantine conditions in the law of the iterated logarithm for lacunary systems</title>
    <abstract language="eng">It is a classical observation that lacunary function systems exhibit many properties which are typical for systems of independent random variables. However, it had already been observed by Erdős and Fortet in the 1950s that probability theory’s limit theorems may fail for lacunary sums (sum f(n_k x)) if the sequence ((n_k)_{k ge 1}) has a strong arithmetic “structure”. The presence of such structure can be assessed in terms of the number of solutions k, l of two-term linear Diophantine equations (an_k - bn_l = c). As the first author proved with Berkes in 2010, saving an (arbitrarily small) unbounded factor for the number of solutions of such equations compared to the trivial upper bound, rules out pathological situations as in the Erdős–Fortet example, and guarantees that (sum f(n_k x)) satisfies the central limit theorem (CLT) in a form which is in accordance with true independence. In contrast, as shown by the first author, for the law of the iterated logarithm (LIL) the Diophantine condition which suffices to ensure “truly independent” behavior requires saving this factor of logarithmic order. In the present paper we show that, rather surprisingly, saving such a logarithmic factor is actually the optimal condition in the LIL case. This result reveals the remarkable fact that the arithmetic condition required of ((n_k)_{k ge 1}) to ensure that (sum f(n_k x)) shows “truly random” behavior is a different one at the level of the CLT than it is at the level of the LIL: the LIL requires a stronger arithmetic condition than the CLT does.</abstract>
    <parentTitle language="eng">Probability Theory and Related Fields (ISSN: 1432-2064)</parentTitle>
    <identifier type="issn">0178-8051</identifier>
    <identifier type="issn">1432-2064</identifier>
    <identifier type="doi">10.1007/s00440-024-01272-6</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2406190937284.886045166092</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:00:52+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">63680d350f8481f3154bd59828c1f7c4</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Christoph Aistleitner</author>
    <author>Lorenz Frühwirth</author>
    <author>Joscha Prochno</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Lacunary trigonometric sums</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Law of the iterated logarithm</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Diophantine equations</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1665/00440_2024_Article_1272.pdf</file>
  </doc>
  <doc>
    <id>1756</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2317</pageFirst>
    <pageLast>2351</pageLast>
    <pageNumber>35 Seiten</pageNumber>
    <edition/>
    <issue>7</issue>
    <volume>86</volume>
    <type>article</type>
    <publisherName>Springer US</publisherName>
    <publisherPlace>New York</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-04-16</completedDate>
    <publishedDate>2024-04-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Analysing Equilibrium States for Population Diversity</title>
    <abstract language="eng">Population diversity is crucial in evolutionary algorithms as it helps with global exploration and facilitates the use of crossover. Despite many runtime analyses showing advantages of population diversity, we have no clear picture of how diversity evolves over time. We study how the population diversity of (μ+1)algorithms, measured by the sum of pairwise Hamming distances, evolves in a fitness-neutral environment. We give an exact formula for the drift of population diversity and show that it is driven towards an equilibrium state. Moreover, we bound the expected time for getting close to the equilibrium state. We find that these dynamics, including the location of the equilibrium, are unaffected by surprisingly many algorithmic choices. All unbiased mutation operators with the same expected number of bit flips have the same effect on the expected diversity. Many crossover operators have no effect at all, including all binary unbiased, respectful operators. We review crossover operators from the literature and identify crossovers that are neutral towards the evolution of diversity and crossovers that are not.</abstract>
    <parentTitle language="eng">Algorithmica (ISSN: 1432-0541)</parentTitle>
    <identifier type="issn">0178-4617</identifier>
    <identifier type="issn">1432-0541</identifier>
    <identifier type="doi">10.1007/s00453-024-01226-3</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2406282100292.409184699704</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:03:14+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">939da84ea7887c87804b0c3d6b5c6099</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Johannes Lengler</author>
    <author>Andre Opris</author>
    <author>Dirk Sudholt</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Evolutionary algorithms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Runtime analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Diversity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Population dynamics</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1756/00453_2024_Article_1226.pdf</file>
  </doc>
  <doc>
    <id>1752</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>29 Seiten</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>29</volume>
    <type>article</type>
    <publisherName>Springer US</publisherName>
    <publisherPlace>New York</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-06-13</completedDate>
    <publishedDate>2024-06-13</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Studying the explanations for the automated prediction of bug and non-bug issues using LIME and SHAP</title>
    <abstract language="eng">Context&#13;
The identification of bugs within issues reported to an issue tracking system is crucial for triage. Machine learning models have shown promising results for this task. However, we have only limited knowledge of how such models identify bugs. Explainable AI methods like LIME and SHAP can be used to increase this knowledge. &#13;
Objective&#13;
We want to understand if explainable AI provides explanations that are reasonable to us as humans and align with our assumptions about the model’s decision-making. We also want to know if the quality of predictions is correlated with the quality of explanations.&#13;
Methods&#13;
We conduct a study where we rate LIME and SHAP explanations based on their quality of explaining the outcome of an issue type prediction model. For this, we rate the quality of the explanations, i.e., if they align with our expectations and help us understand the underlying machine learning model. &#13;
Results&#13;
We found that both LIME and SHAP give reasonable explanations and that correct predictions are well explained. Further, we found that SHAP outperforms LIME due to a lower ambiguity and a higher contextuality that can be attributed to the ability of the deep SHAP variant to capture sentence fragments. &#13;
Conclusion&#13;
We conclude that the model finds explainable signals for both bugs and non-bugs. Also, we recommend that research dealing with the quality of explanations for classification tasks reports and investigates rater agreement, since the rating of explanations is highly subjective.</abstract>
    <parentTitle language="eng">Empirical Software Engineering (ISSN: 1573-7616)</parentTitle>
    <identifier type="issn">1382-3256</identifier>
    <identifier type="issn">1573-7616</identifier>
    <identifier type="doi">10.1007/s10664-024-10469-1</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2409232103207.812648424894</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:03:08+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">81fd51ce33f98933fe1f545c012c63f4</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Lukas Schulte</author>
    <author>Benjamin Ledel</author>
    <author>Steffen Herbold</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Explainable AI</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>LIME</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SHAP</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Issue type prediction</value>
    </subject>
    <collection role="ddc" number="006">Spezielle Computerverfahren</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1752/10664_2024_Article_10469.pdf</file>
  </doc>
  <doc>
    <id>1887</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>32 Seiten</pageNumber>
    <edition/>
    <issue>288, 1</issue>
    <volume>2025</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-09-14</completedDate>
    <publishedDate>2024-09-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A probabilistic approach to Lorentz balls l(^n)(q,1)</title>
    <abstract language="eng">We develop a probabilistic approach to study the volumetric and geometric properties of unit balls |B(^n)(q,1) of finite-dimensional Lorentz sequence spaces l(^n)(q,1). More precisely, we show that the empirical distribution of a random vector X^(n) uniformly distributed on its volume normalized unit ball converges weakly to a compactly supported symmetric probability distribution with explicitly given density; as a consequence we obtain a weak Poincaré-Maxwell-Borel principle for any fixed number k in |N of coordinates of X^(n) as n grows infinitly. Moreover, we prove a central limit theorem for the largest coordinate of X^(n), demonstrating a quite different behavior than in the case of the l(^n)(q) balls, where a Gumbel distribution appears in the limit. Finally, we prove a Schechtman-Schmuckenschläger type result for the asymptotic volume of intersections of volume normalized l(^n)(q,1) and l(^n)(p) balls.</abstract>
    <parentTitle language="eng">Journal of Functional Analysis (Online ISSN: 1096-0783)</parentTitle>
    <identifier type="doi">10.1016/j.jfa.2024.110682</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18878</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Zakhar Kabluchko</author>
    <author>Joscha Prochno</author>
    <author>Mathias Sonnleitner</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Central limit theorem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Concentration of measure</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Convex body</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Maximum entropy principle</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1887/kabluchko_prochno_sonnleitner_lorentz_balls.pdf</file>
  </doc>
  <doc>
    <id>1881</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>17 Seiten</pageNumber>
    <edition/>
    <issue>85</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-06-03</completedDate>
    <publishedDate>2024-06-12</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient</title>
    <abstract language="eng">We survey recent developments in the field of complexity of pathwise approximation in p-th mean of the solution of a stochastic differential equation at the final time based on finitely many evaluations of the driving Brownian motion. First, we briefly review the case of equations with globally Lipschitz continuous coefficients, for which an error rate of at least 1/2 in terms of the number of evaluations of the driving Brownian motion is always guaranteed by using the equidistant Euler-Maruyama scheme. Then we illustrate that giving up the global Lipschitz continuity of the coefficients may lead to a non-polynomial decay of the error for the Euler-Maruyama scheme or even to an arbitrary slow decay of the smallest possible error that can be achieved on the basis of finitely many evaluations of the driving Brownian motion. Finally, we turn to recent positive results for equations with a drift coefficient that is not globally Lipschitz continuous. Here we focus on scalar equations with a Lipschitz continuous diffusion coefficient and a drift coefficient that satisfies piecewise smoothness assumptions or has fractional Sobolev regularity and we present corresponding complexity results.</abstract>
    <parentTitle language="eng">Journal of Complexity (Online ISSN: 1090-2708)</parentTitle>
    <identifier type="doi">10.1016/j.jco.2024.101870</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18819</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>Thomas Müller-Gronbach</author>
    <author>Larisa Yaroslavtseva</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Stochastic differential equations</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Non-Lipschitz drift coefficient</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Strong approximation in p-th mean</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Lower error bounds</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Error rates</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1881/mueller-gronbach_yaroslavtseva_stoch_diff_equ.pdf</file>
  </doc>
  <doc>
    <id>1872</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>25 Seiten</pageNumber>
    <edition/>
    <issue>536,1</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-01-30</completedDate>
    <publishedDate>2024-02-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Sanov-type large deviations and conditional limit theorems for high-dimensional Orlicz balls</title>
    <abstract language="eng">In this paper, we prove a Sanov-type large deviation principle for the sequence of empirical measures of vectors chosen uniformly at random from an Orlicz ball. From this level-2 large deviation result, in a combination with Gibbs conditioning, entropy maximization and an Orlicz version of the Poincaré-Maxwell-Borel lemma, we deduce a conditional limit theorem for high-dimensional Orlicz balls. In more geometric parlance, the latter shows that if V1 and V2 are Orlicz functions, then random points in the V1-Orlicz ball, conditioned on having a small V2-Orlicz radius, look like an appropriately scaled V2-Orlicz ball. In fact, we show that the limiting distribution in our Poincaré-Maxwell-Borel lemma, and thus the geometric interpretation, undergoes a phase transition depending on the magnitude of the V2-Orlicz radius.</abstract>
    <parentTitle language="eng">Journal of Mathematical Analysis and Applications (Online ISSN: 1096-0813)</parentTitle>
    <identifier type="doi">10.1016/j.jmaa.2024.128169</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18723</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Lorenz Frühwirth</author>
    <author>Joscha Prochno</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Entropy maximization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Gibbs conditioning principle</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Large deviation principle</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Orlicz space</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Poincaré-Maxwell-Borel lemma</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Sanov's theorem</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1872/fruewirth_prochno_sanov-type.pdf</file>
  </doc>
  <doc>
    <id>1870</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>30 Seiten</pageNumber>
    <edition/>
    <issue>124</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-01-14</completedDate>
    <publishedDate>2024-01-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Computing the binomial part of a polynomial ideal</title>
    <abstract language="eng">Given an ideal I in a polynomial ring K[x1,...,xn] over a field K, we present a complete algorithm to compute the binomial part of I, i.e., the subideal Bin(I) of I generated by all monomials and binomials in I. This is achieved step-by-step. First we collect and extend several algorithms for computing exponent lattices in different kinds of fields. Then we generalize them to compute exponent lattices of units in 0-dimensional K-algebras, where we have to generalize the computation of the separable part of an algebra to non-perfect fields in characteristic p. Next we examine the computation of unit lattices in finitely generated K-algebras, as well as their associated characters and lattice ideals. This allows us to calculate Bin(I) when I is saturated with respect to the indeterminates by reducing the task to the 0-dimensional case. Finally, we treat the computation of Bin(I) for general ideals by computing their cellular decomposition and dealing with finitely many special ideals called (s,t)-binomial parts. All algorithms have been implemented in SageMath.</abstract>
    <parentTitle language="eng">Journal of Symbolic Computation (Online ISSN: 1095-855X)</parentTitle>
    <identifier type="doi">10.1016/j.jsc.2024.102298</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18708</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>Martin Kreuzer</author>
    <author>Florian Walsh</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>binomial part</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>binomial ideal</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>exponent lattice</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>cellular decomposition</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1870/kreuzer_walsh_computing_binomial_part.pdf</file>
  </doc>
  <doc>
    <id>1874</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>20 Seiten</pageNumber>
    <edition/>
    <issue>125</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-03-01</completedDate>
    <publishedDate>2024-03-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Stabilized recovery and model reduction for multivariate exponential polynomials</title>
    <abstract language="eng">Recovery of multivariate exponential polynomials, i.e., the multivariate version of Prony's problem, can be stabilized by using more than the minimally needed multiinteger samples of the function. We present an algorithm that takes into account this extra information and prove a backward error estimate for the algebraic recovery method SMILE. In addition, we give a method to approximate data by an exponential polynomial sequence of a given structure as a step in the direction of multivariate model reduction.</abstract>
    <parentTitle language="deu">Journal of Symbolic Computation (Online ISSN: 1095-855X)</parentTitle>
    <identifier type="doi">10.1016/j.jsc.2024.102313</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18748</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Juan Manuel Peña Ferrández</author>
    <author>Thomas Sauer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Prony's method</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Gröbner basis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Backwards error</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Model reduction</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1874/pena_sauer_multiv_exp_polyn.pdf</file>
  </doc>
  <doc>
    <id>1873</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>26 Seiten</pageNumber>
    <edition/>
    <issue>330</issue>
    <volume>2025</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace>Amsterdam</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-02-27</completedDate>
    <publishedDate>2024-03-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation</title>
    <abstract language="eng">Evolutionary algorithms are popular algorithms for multi-objective optimisation (also called Pareto optimisation) as they use a population to store trade-offs between different objectives. Despite their popularity, the theoretical foundation of multi-objective evolutionary optimisation (EMO) is still in its early development. Fundamental questions such as the benefits of the crossover operator are still not fully understood. We provide a theoretical analysis of the well-known EMO algorithms GSEMO and NSGA-II to showcase the possible advantages of crossover: we propose classes of “royal road” functions on which these algorithms cover the whole Pareto front in expected polynomial time if crossover is being used. But when disabling crossover, they require exponential time in expectation to cover the Pareto front. The latter even holds for a large class of black-box algorithms using any elitist selection and any unbiased mutation operator. Moreover, even the expected time to create a single Pareto-optimal search point is exponential. We provide two different function classes, one tailored for one-point crossover and another one tailored for uniform crossover, and we show that some immune-inspired hypermutations cannot avoid exponential optimisation times. Our work shows the first example of an exponential performance gap through the use of crossover for the widely used NSGA-II algorithm and contributes to a deeper understanding of its limitations and capabilities.</abstract>
    <parentTitle language="eng">Artificial Intelligence (Online ISSN: 1872-7921)</parentTitle>
    <identifier type="doi">10.1016/j.artint.2024.104098</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-18732</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Duc-Cuong Dang</author>
    <author>Andre Opris</author>
    <author>Dirk Sudholt</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Evolutionary computation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Runtime analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Recombination</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multi-objective optimisation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Unbiased black-box algorithms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hypermutation</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Elsevier</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1873/dang_opris_sudholt_crossover.pdf</file>
  </doc>
  <doc>
    <id>1753</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>231</pageFirst>
    <pageLast>277</pageLast>
    <pageNumber>47 Seiten</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>209</volume>
    <type>article</type>
    <publisherName>Springer Berlin Heidelberg</publisherName>
    <publisherPlace>Berlin/Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-03-13</completedDate>
    <publishedDate>2024-03-13</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Generalized Nash equilibrium problems with mixed-integer variables</title>
    <abstract language="eng">We consider generalized Nash equilibrium problems (GNEPs) with non-convex strategy spaces and non-convex cost functions. This general class of games includes the important case of games with mixed-integer variables for which only a few results are known in the literature. We present a new approach to characterize equilibria via a convexification technique using the Nikaido–Isoda function. To any given instance of the GNEP, we construct a set of convexified instances and show that a feasible strategy profile is an equilibrium for the original instance if and only if it is an equilibrium for any convexified instance and the convexified cost functions coincide with the initial ones. We develop this convexification approach along three dimensions: We first show that for quasi-linear models, where a convexified instance exists in which for fixed strategies of the opponent players, the cost function of every player is linear and the respective strategy space is polyhedral, the convexification reduces the GNEP to a standard (non-linear) optimization problem. Secondly, we derive two complete characterizations of those GNEPs for which the convexification leads to a jointly constrained or a jointly convex GNEP, respectively. These characterizations require new concepts related to the interplay of the convex hull operator applied to restricted subsets of feasible strategies and may be interesting on their own. Note that this characterization is also computationally relevant as jointly convex GNEPs have been extensively studied in the literature. Finally, we demonstrate the applicability of our results by presenting a numerical study regarding the computation of equilibria for three classes of GNEPs related to integral network flows and discrete market equilibria.</abstract>
    <parentTitle language="eng">Mathematical Programming</parentTitle>
    <identifier type="issn">0025-5610</identifier>
    <identifier type="issn">1436-4646</identifier>
    <identifier type="doi">10.1007/s10107-024-02063-6</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2405152117292.567771401889</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:03:10+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">f82baff6d1ed1740901e4cf82fc38aeb</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Tobias Harks</author>
    <author>Julian Schwarz</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Generalized Nash equilibrium problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-integer nonlinear problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Non-convex games</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Complementarity and equilibrium problems and variational inequalities (finite dimensions)</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Noncooperative games</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="ddc" number="519">Wahrscheinlichkeiten, angewandte Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1753/10107_2024_Article_2063.pdf</file>
  </doc>
  <doc>
    <id>1736</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>827</pageFirst>
    <pageLast>851</pageLast>
    <pageNumber>25 Seiten</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>65</volume>
    <type>article</type>
    <publisherName>Springer Berlin Heidelberg</publisherName>
    <publisherPlace>Berlin/Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-01-31</completedDate>
    <publishedDate>2024-01-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Re-embeddings of affine algebras via Gröbner fans of linear ideals</title>
    <abstract language="eng">Given an affine algebra R=K[x1,⋯,xn]/Iover a field  K , where I is an ideal in the polynomial ring P=K[x1,⋯,xn], we examine the task of effectively calculating re-embeddings of  I , i.e., of presentations R=P′/I′such that P′=K[y1,⋯,ym]has fewer indeterminates. For cases when the number of indeterminates  n is large and Gröbner basis computations are infeasible, we have introduced the method of Z -separating re-embeddings in Kreuzer et al. (J Algebra Appl 21, 2022) and Kreuzer, et al. (São Paulo J Math Sci, 2022). This method tries to detect polynomials of a special shape in  I which allow us to eliminate the indeterminates in the tuple  Z by a simple substitution process. Here we improve this approach by showing that suitable candidate tuples  Z can be found using the Gröbner fan of the linear part of  I . Then we describe a method to compute the Gröbner fan of a linear ideal, and we improve this computation in the case of binomial linear ideals using a cotangent equivalence relation. Finally, we apply the improved technique in the case of the defining ideals of border basis schemes.</abstract>
    <parentTitle language="eng">Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry</parentTitle>
    <identifier type="issn">0138-4821</identifier>
    <identifier type="issn">2191-0383</identifier>
    <identifier type="doi">10.1007/s13366-024-00733-2</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024041316352253862922</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:02:45+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">56cab03bc0ccba079b3d1ebbce02b110</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Martin Kreuzer</author>
    <author>Le Ngoc Long</author>
    <author>Lorenzo Robbiano</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Re-embedding</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimal embedding</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Gröbner fan</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Cotangent space</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Border basis scheme</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="ddc" number="512">Algebra</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1736/13366_2024_Article_733.pdf</file>
  </doc>
  <doc>
    <id>1759</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2043</pageFirst>
    <pageLast>2074</pageLast>
    <pageNumber>32 Seiten</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>390</volume>
    <type>article</type>
    <publisherName>Springer Berlin Heidelberg</publisherName>
    <publisherPlace>Berlin/Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-01-29</completedDate>
    <publishedDate>2024-01-29</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Periods, power series, and integrated algebraic numbers</title>
    <abstract language="eng">Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the polynomial ring over the rationals and evaluate it at a rational number. We follow this path and close these algebraic power series under taking iterated antiderivatives and nearby algebraic and geometric operations. We obtain a system of rings of power series whose coefficients form a countable real closed field. Using techniques from o-minimality we are able to show that every period belongs to this field. In the setting of o-minimality we define exponential integrated algebraic numbers and show that exponential periods and the Euler constant is an exponential integrated algebraic number. Hence they are a good candiate for a natural number system extending the period ring and containing important mathematical constants.</abstract>
    <parentTitle language="eng">Mathematische Annalen</parentTitle>
    <identifier type="issn">0025-5831</identifier>
    <identifier type="issn">1432-1807</identifier>
    <identifier type="doi">10.1007/s00208-024-02802-2</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024040910285674698609</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:03:19+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">57ca53e5b77e95b1cc4eb5c5c13e2f6e</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Tobias Kaiser</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>algebraic geometry</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>algebraic topology</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>algebra</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>associative rings and algebras</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>commutative rings and algebras</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>number theory</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1759/00208_2024_Article_2802.pdf</file>
  </doc>
  <doc>
    <id>1741</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>14 Seiten</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>34</volume>
    <type>article</type>
    <publisherName>Springer US</publisherName>
    <publisherPlace>New York</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-01-19</completedDate>
    <publishedDate>2024-01-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The minimal spherical dispersion</title>
    <abstract language="eng">We prove upper and lower bounds on the minimal spherical dispersion, improving upon previous estimates obtained by Rote and Tichy in (Anz Österreich Akad Wiss Math Nat Kl 132:3–10, 1995). In particular, we see that the inverse N(ε,d)of the minimal spherical dispersion is, for fixed ε&gt;0, linear in the dimension d of the ambient space. We also derive upper and lower bounds on the expected dispersion for points chosen independently and uniformly at random from the Euclidean unit sphere. In terms of the corresponding inverse N~(ε,d), our bounds are optimal with respect to the dependence on ε.</abstract>
    <parentTitle language="eng">The Journal of Geometric Analysis</parentTitle>
    <identifier type="issn">1050-6926</identifier>
    <identifier type="issn">1559-002X</identifier>
    <identifier type="doi">10.1007/s12220-023-01527-z</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2405020842543.936733306281</identifier>
    <enrichment key="opus.import.date">2025-07-29T13:02:51+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">deepgreen</enrichment>
    <enrichment key="opus.import.file">attachment; filename=deposit.zip</enrichment>
    <enrichment key="opus.import.checksum">ee26a9107e56f8b30ac8ccd4fdddc8e7</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Joscha Prochno</author>
    <author>Daniel Rudolf</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Dispersion</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Expected dispersion</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Spherical cap</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Spherical dispersion</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>VC-dimension</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="ddc" number="516">Geometrie</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Import" number="import">Import</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1741/12220_2024_Article_1527.pdf</file>
  </doc>
  <doc>
    <id>1630</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>605</pageFirst>
    <pageLast>614</pageLast>
    <pageNumber>10 Seiten</pageNumber>
    <edition/>
    <issue>6</issue>
    <volume>120</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-04-27</completedDate>
    <publishedDate>2023-04-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Growth of log-analytic functions</title>
    <abstract language="eng">We show that unary log-analytic functions are polynomially bounded. In the higher  dimensional case, globally a log-analytic function can have exponential growth. We show that a log-analytic function is polynomially bounded on a definable set which contains the germ of every ray at infinity.</abstract>
    <parentTitle language="deu">Archiv der Mathematik</parentTitle>
    <identifier type="doi">10.1007/s00013-023-01857-y</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023091614564557203657</identifier>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Tobias Kaiser</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Log-analytic functions</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Polynomially bounded</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Exponential growth</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1630/Kaiser_GrowthOfLog-AnalyticFuncions.pdf</file>
  </doc>
  <doc>
    <id>1628</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>5493</pageFirst>
    <pageLast>5512</pageLast>
    <pageNumber>20 Seiten</pageNumber>
    <edition/>
    <issue>12</issue>
    <volume>296</volume>
    <type>article</type>
    <publisherName>Wiley</publisherName>
    <publisherPlace>Hoboken</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-03-29</completedDate>
    <publishedDate>2023-03-29</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Hölder’s inequality and its reverse — a probabilistic point of view</title>
    <abstract language="eng">In this article, we take a probabilistic look at Hölder's inequality, considering the ratio of terms in the classical Hölder inequality for random vectors in ℝ𝑛. We prove a central limit theorem for this ratio, which then allows us to reverse the inequality up to a multiplicative constant with high probability. The models of randomness include the uniform distribution on 𝓁𝑛𝑝 balls and spheres. We also provide a Berry–Esseen–type result and prove a large and a moderate deviation principle for the suitably normalized Hölder ratio.</abstract>
    <parentTitle language="deu">Mathematische Nachrichten</parentTitle>
    <identifier type="doi">10.1002/mana.202200411</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023062315175042989607</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Lorenz Frühwirth</author>
    <author>Joscha Prochno</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Berry–Esseen bound</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>central limit theorem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hölder’s inequality</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>𝓁 𝑛 𝑝 ball</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>large deviation principle</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>moderate deviation principle</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>reverse inequality</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Wiley</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1628/Fruehwirth_Hoelders-inequality.pdf</file>
  </doc>
  <doc>
    <id>1627</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>33</pageLast>
    <pageNumber>33</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>84</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-04-25</completedDate>
    <publishedDate>2023-04-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Topology of closure systems in algebraic lattices</title>
    <abstract language="eng">Algebraic lattices are spectral spaces for the coarse lower topology. Closure systems in algebraic lattices are studied as subspaces. Connections between order theoretic properties of a closure system and topological properties of the subspace are explored. A closure system is algebraic if and only if it is a patch closed subset of the ambient algebraic lattice. Every subset X in an algebraic lattice P generates a closure system〈X〉P . The closure system〈Y 〉P generated by the patch closure Y of X is the patch closure of〈X〉P. If X is contained in the set of nontrivial prime elements of P then〈X〉P is a frame and is a coherent algebraic frame if X is patch closed in P. Conversely, if the algebraic lattice P is coherent then its set of nontrivial prime elements is patch closed.</abstract>
    <parentTitle language="eng">Algebra universalis</parentTitle>
    <identifier type="doi">10.1007/s00012-023-00815-7</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023090808111682406614</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Niels Schwartz</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Poset</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Complete lattice</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Algebraic lattice</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Frame</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Closure system</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Closure operator</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Spectral space</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Specialization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Coarse lower topology</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Scott topology</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Patch topology</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1627/Schwartz_TopologyOfClosureSystems.pdf</file>
  </doc>
  <doc>
    <id>1636</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>526</pageFirst>
    <pageLast>565</pageLast>
    <pageNumber>40</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>86</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-07-24</completedDate>
    <publishedDate>2023-07-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: why Success Rates Matter</title>
    <abstract language="eng">Evolutionary algorithms (EAs) are general-purpose optimisers that come with several parameters like the sizes of parent and offspring populations or the mutation rate. It is well known that the performance of EAs may depend drastically on these parameters. Recent theoretical studies have shown that self-adjusting parameter control mechanisms that tune parameters during the algorithm run can provably outperform the best static parameters in EAs on discrete problems. However, the majority of these studies concerned elitist EAs and we do not have a clear answer on whether the same mechanisms can be applied for non-elitist EAs. We study one of the best-known parameter control mechanisms, the one-fifth success rule, to control the offspring population size λ in the non-elitist (1, λ) EA. It is known that the (1, λ) EA has a sharp threshold with respect to the choice of λ where the expected runtime on the benchmark function OneMax changes from polynomial to exponential time. Hence, it is not clear whether parameter control mechanisms are able to find and maintain suitable values of λ. For OneMax we show that the answer crucially depends on the success rates (i. e. a one-(s + 1)-th success rule). We prove that, if the success rate is appropriately small, the self-adjusting (1, λ) EA optimises OneMax in O(n) expected generations and O(n log n) expected evaluations, the best possible runtime for any unary unbiased black-box algorithm. A small success rate is crucial: we also show that if the success rate is too large, the algorithm has an exponential runtime on OneMax and other functions with similar characteristics.</abstract>
    <parentTitle language="eng">Algorithmica</parentTitle>
    <identifier type="doi">10.1007/s00453-023-01153-9</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023102616463077837436</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Mario Alejandro Hevia Fajardo</author>
    <author>Dirk Sudholt</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Evolutionary algorithms</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Parameter control</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Theory</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Runtime analysis</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Non-elitism</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1636/Fajardo_SelfAdjustingPopulation.pdf</file>
  </doc>
  <doc>
    <id>1634</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>460</pageFirst>
    <pageLast>470</pageLast>
    <pageNumber>11</pageNumber>
    <edition/>
    <issue>5</issue>
    <volume>140</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-08-04</completedDate>
    <publishedDate>2023-08-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Multi-vector optimization scheme for distributed components in energy islands</title>
    <abstract language="eng">Recent advancements in energy systems, such as the emergence of prosumers and sector coupling approaches, introduce additional flexibilities over multiple energy sectors, such as heating, electricity, and mobility. Due to the complexity of such distributed systems, the optimization of energy allocation is a non-trivial task, especially considering constraints and limitations introduced by distributed devices or sub-systems. Additionally, the variety of devices forces approaches to be highly situational and not universally applicable. In this paper, a two-level optimization scheme is proposed, which aims at reducing the optimization complexity of sector-coupled systems. The multi-vector optimization embedded in the two-level optimization scheme is formulated as a mixed-integer linear problem, optimizing the energy flow between domains, which are modeled as an abstraction of a sector. Distributed devices are modeled as components that represent an abstraction of devices connected to an energy domain. The optimization process is evaluated based on the data from a residential complex in Ghent, Belgium. It shows that the approach is capable of minimizing costs, CO2 emissions, and dependency on external resources.</abstract>
    <parentTitle language="deu">e+i Elektrotechnik und Informationstechnik</parentTitle>
    <identifier type="doi">10.1007/s00502-023-01145-1</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023110413071966670578</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Stepan Gagin</author>
    <author>Michael Bettermann</author>
    <author>Hermann de Meer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Energy optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multi-energy systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Sector coupling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Energy Management</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Systems</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1634/Gagin_MultiVectorOptimization.pdf</file>
  </doc>
  <doc>
    <id>1633</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>8</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>23</volume>
    <type>article</type>
    <publisherName>Wiley</publisherName>
    <publisherPlace>Hoboken</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-09-17</completedDate>
    <publishedDate>2023-09-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Gabor’s “complex signal” revisited: Complexifying frames and bases</title>
    <abstract language="eng">In 1946, Dennis Gabor introduced the analytic signal 𝑓 + 𝑖𝐻𝑓 for real-valued signals 𝑓. Here, 𝐻 is the Hilbert transform. This complexification of functions allows for an analysis of their amplitude and phase information and has ever since given well-interpretable insight into the properties of the signals over time.&#13;
The idea of complexification has been reconsidered with regard to many aspects: examples are the dual tree complex wavelet transform, or via the Riesz transform and the monogenic signal, that is, a multi-dimensional version of the Hilbert transform, which in combination with multi-resolution approaches leads to Riesz wavelets, and others. In this context, we ask two questions:&#13;
- Which pairs of real orthonormal bases (ONBs), Riesz bases, frames and Parseval frames {𝑓 𝑛 } 𝑛∈ℕ and {𝑔 𝑛 } 𝑛∈ℕ can be “rebricked” to complex-valued ones {𝑓𝑛 + 𝑖𝑔 𝑛 } 𝑛∈ℕ?&#13;
- And which real operators A allow for rebricking via the ansatz {𝑓𝑛 + 𝑖𝐴𝑓𝑛 } 𝑛∈ℕ?&#13;
In this short note, we give answers to these questions with regard to a characterization which linear operators A are suitable for rebricking while maintaining the structure of the original real valued family. Surprisingly, the Hilbert transform is not among them.</abstract>
    <parentTitle language="eng">PAMM (Proceedings in Applied Mathematics and Mechanics)</parentTitle>
    <identifier type="doi">10.1002/pamm.202300155</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023091815015485698899</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>Thomas Fink</author>
    <author>Brigitte Forster</author>
    <author>Florian Heinrich</author>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Wiley</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1633/Fink_Gabors-complex-signal.pdf</file>
  </doc>
  <doc>
    <id>1644</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1268</pageFirst>
    <pageLast>1306</pageLast>
    <pageNumber>39</pageNumber>
    <edition/>
    <issue>6</issue>
    <volume>67</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-10-06</completedDate>
    <publishedDate>2023-10-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Toward Online Mobile Facility Location on General Metrics</title>
    <abstract language="eng">We introduce an online variant of mobile facility location (MFL) (introduced by Demaine et al. (SODA 258–267 2007)). We call this new problem online mobile facility location (OMFL). In the OMFL problem, initially, we are given a set of k mobile facilities with their starting locations. One by one, requests are added. After each request arrives, one can make some changes to the facility locations before the subsequent request arrives. Each request is always assigned to the nearest facility. The cost of this assignment is the distance from the request to the facility. The objective is to minimize the total cost, which consists of the relocation cost of facilities and the distance cost of requests to their nearest facilities. We provide a lower bound for the OMFL problem that even holds on uniform metrics. A natural approach to solve the OMFL problem for general metric spaces is to utilize hierarchically well-separated trees (HSTs) and directly solve the OMFL problem on HSTs. In this paper, we provide the first step in this direction by solving a generalized variant of the OMFL problem on uniform metrics that we call G-OMFL. We devise a simple deterministic online algorithm and provide a tight analysis for the algorithm. The second step remains an open question. Inspired by the k-server problem, we introduce a new variant of the OMFL problem that focuses solely on minimizing movement cost. We refer to this variant as M-OMFL. Additionally, we provide a lower bound for M-OMFL that is applicable even on uniform metrics.</abstract>
    <parentTitle language="eng">Theory of Computing Systems</parentTitle>
    <identifier type="doi">10.1007/s00224-023-10145-9</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024022609363705445898</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Abdolhamid Ghodselahi</author>
    <author>Fabian Kuhn</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mobile resources</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Online requests</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Competitive analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>General cost function</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Movement minimization</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1644/Ghodselahi_TowardOnlineMobile.pdf</file>
  </doc>
  <doc>
    <id>1621</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>21</pageLast>
    <pageNumber>21 Seiten</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>28</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-04-17</completedDate>
    <publishedDate>2023-04-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Are automated static analysis tools worth it? An investigation into relative warning density and external software quality on the example of Apache open source projects</title>
    <abstract language="eng">Automated Static Analysis Tools (ASATs) are part of software development best practices. ASATs are able to warn developers about potential problems in the code. On the one hand, ASATs are based on best practices so there should be a noticeable effect on software quality. On the other hand, ASATs suffer from false positive warnings, which developers have to inspect and then ignore or mark as invalid. In this article, we ask whether ASATs have a measurable impact on external software quality, using the example of PMD for Java. We investigate the relationship between ASAT warnings emitted by PMD on defects per change and per file. Our case study includes data for the history of each file as well as the differences between changed files and the project in which they are contained. We investigate whether files that induce a defect have more static analysis warnings than the rest of the project. Moreover, we investigate the impact of two different sets of ASAT rules. We find that, bug inducing files contain less static analysis warnings than other files of the project at that point in time. However, this can be explained by the overall decreasing warning density. When&#13;
compared with all other changes, we find a statistically significant difference in one metric for all rules and two metrics for a subset of rules. However, the effect size is negligible in all cases, showing that the actual difference in warning density between bug inducing changes and other changes is small at best.</abstract>
    <parentTitle language="eng">Empirical Software Engineering</parentTitle>
    <identifier type="doi">10.1007/s10664-023-10301-2</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023091108203018898026</identifier>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Alexander Trautsch</author>
    <author>Steffen Herbold</author>
    <author>Jens Grabowski</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Static code analysis</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Quality evolution</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Software metrics</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Software quality</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1621/Trautsch_AreAutomatedStaticAnalysisTools.pdf</file>
  </doc>
  <doc>
    <id>1620</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>63</pageLast>
    <pageNumber>63</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>28</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-05-13</completedDate>
    <publishedDate>2023-05-13</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Automated test generation for SCRATCH programs</title>
    <abstract language="eng">The importance of programming education has led to dedicated educational program-&#13;
ming environments, where users visually arrange block-based programming constructs that typically control graphical, interactive game-like programs. The SCRATCH programming environment is particularly popular, with more than 90 million registered users at the time of this writing. While the block-based nature of S CRATCH helps learners by preventing syntactical mistakes, there nevertheless remains a need to provide feedback and support in order to implement desired functionality. To support individual learning and classroom settings, this feedback and support should ideally be provided in an automated fashion, which requires tests to enable dynamic program analysis. In prior work we introduced W HISKER , a framework that enables automated testing of S CRATCH programs. However, creating these automated tests for S CRATCH programs is challenging. In this paper, we therefore investigate how to automatically generate W HISKER tests. Generating tests for S CRATCH raises important challenges: First, game-like programs are typically randomised, leading to flaky tests. Second, S CRATCH programs usually consist of animations and interactions with long delays, inhibiting the application of classical test generation approaches. Thus, the new application domain raises the question of which test generation technique is best suited&#13;
to produce high coverage tests capable of detecting faulty behaviour. We investigate these questions using an extension of the W HISKER test framework for automated test generation. Evaluation on common programming exercises, a random sample of 1000 S CRATCH user programs, and the 1000 most popular S CRATCH programs demonstrates that our approach enables W HISKER to reliably accelerate test executions, and even though many SCRATCH programs are small and easy to cover, there are many unique challenges for which advanced search-based test generation using many-objective algorithms is needed in order to achieve high coverage.</abstract>
    <parentTitle language="eng">Empirical Software Engineering</parentTitle>
    <identifier type="doi">10.1007/s10664-022-10255-x</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023091108301581209964</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Adina Deiner</author>
    <author>Patric Feldmeier</author>
    <author>Gordon Fraser</author>
    <author>Sebastian Schweikl</author>
    <author>Wengran Wang</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Search-based testing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Block-based programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SCRATCH</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1620/Deiner_AutomatedTestGeneration.pdf</file>
  </doc>
  <doc>
    <id>1619</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1263</pageFirst>
    <pageLast>1292</pageLast>
    <pageNumber>30 Seiten</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>86</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-12-14</completedDate>
    <publishedDate>2023-12-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Partial and Simultaneous Transitive Orientations via Modular Decompositions</title>
    <abstract language="eng">A natural generalization of the recognition problem for a geometric graph class is the&#13;
problem of extending a representation of a subgraph to a representation of the whole&#13;
graph. A related problem is to find representations for multiple input graphs that coin-&#13;
cide on subgraphs shared by the input graphs. A common restriction is the sunflower&#13;
case where the shared graph is the same for each pair of input graphs. These problems&#13;
translate to the setting of comparability graphs where the representations correspond to&#13;
transitive orientations of their edges. We use modular decompositions to improve the&#13;
runtime for the orientation extension problem and the sunflower orientation problem&#13;
to linear time. We apply these results to improve the runtime for the partial represen-&#13;
tation problem and the sunflower case of the simultaneous representation problem for&#13;
permutation graphs to linear time. We also give the first efficient algorithms for these&#13;
problems on circular permutation graphs.</abstract>
    <parentTitle language="eng">Algorithmica</parentTitle>
    <identifier type="doi">10.1007/s00453-023-01188-y</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024022914111908687000</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Miriam Münch</author>
    <author>Ignaz Rutter</author>
    <author>Peter Stumpf</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Representation extension</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Simultaneous representation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Comparability</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>graph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Permutation graph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Circular permutation graph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Modular decomposition</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1619/Muench_Partial-transitive-orientations.pdf</file>
  </doc>
  <doc>
    <id>1618</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>38</pageLast>
    <pageNumber>38</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>28</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-01-24</completedDate>
    <publishedDate>2023-01-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Differential testing for machine learning: an analysis for classification algorithms beyond deep learning</title>
    <abstract language="eng">Differential testing is a useful approach that uses different implementations of the same algorithms and compares the results for software testing. In recent years, this approach was successfully used for test campaigns of deep learning frameworks. There is little knowledge about the application of differential testing beyond deep learning. Within this article, we want to close this gap for classification algorithms. We conduct a case study using Scikit-learn, Weka, Spark MLlib, and Caret in which we identify the potential of differential testing by considering which algorithms are available in multiple frameworks, the feasibility by identifying pairs of algorithms that should exhibit the same behavior, and the effectiveness by executing tests for the identified pairs and analyzing the deviations. While we found a large potential for popular algorithms, the feasibility seems limited because, often, it is not possible to determine configurations that are the same in other frameworks.&#13;
The execution of the feasible tests revealed that there is a large number of deviations for the scores and classes. Only a lenient approach based on statistical significance of classes does not lead to a huge amount of test failures. The potential of differential testing beyond deep learning seems limited for research into the quality of machine learning libraries. Practitioners may still use the approach if they have deep knowledge about implementations, especially if a coarse oracle that only considers significant differences of classes is sufficient.</abstract>
    <parentTitle language="eng">Empirical Software Engineering</parentTitle>
    <identifier type="doi">10.1007/s10664-022-10273-9</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023033121421148821912</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Steffen Herbold</author>
    <author>Steffen Tunkel</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Machine learning</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Software testing</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Differential testing</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1618/Herbold_DifferentialTestingForMachineLearning.pdf</file>
  </doc>
  <doc>
    <id>1617</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>483</pageFirst>
    <pageLast>523</pageLast>
    <pageNumber>41 Seiten</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>36</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-12-07</completedDate>
    <publishedDate>2023-12-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Well-posedness and properties of the flow for semilinear evolution equations</title>
    <abstract language="eng">We derive conditions for well-posedness of semilinear evolution equations with unbounded input operators. Based on this, we provide sufficient conditions for such properties of the flow map as Lipschitz continuity, bounded-implies-continuation property, boundedness of reachability sets, etc. These properties represent a basic toolbox for stability and robustness analysis of semilinear boundary control systems. We cover systems governed by general C0 -semigroups, and analytic semigroups that may have both boundary and distributed disturbances. We illustrate our findings on an example of a Burgers’ equation with nonlinear local dynamics and both distributed and boundary disturbances.</abstract>
    <parentTitle language="eng">Mathematics of Control, Signals, and Systems</parentTitle>
    <identifier type="doi">10.1007/s00498-023-00378-x</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024022307494197431619</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Andrii Mironchenko</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Well-posedness</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Evolution equations</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Boundary control systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Infinite-dimensional systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Analytic systems</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1617/Mironchenko_Well-posedness.pdf</file>
  </doc>
  <doc>
    <id>1616</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>40</pageLast>
    <pageNumber>40</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>28</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-01-14</completedDate>
    <publishedDate>2023-01-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">What really changes when developers intend to improve their source code: a commit-level study of static metric value and static analysis warning changes</title>
    <parentTitle language="eng">Empirical Software Engineering</parentTitle>
    <identifier type="doi">10.1007/s10664-022-10257-9</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023032321174386000821</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Alexander Trautsch</author>
    <author>Johannes Erbel</author>
    <author>Steffen Herbold</author>
    <author>Jens Grabowski</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Static code analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quality evolution</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software metrics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software quality</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1616/Trautsch_WhatReallyChanges.pdf</file>
  </doc>
  <doc>
    <id>1615</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>53</pageFirst>
    <pageLast>62</pageLast>
    <pageNumber>10 Seiten</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>24</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-11-28</completedDate>
    <publishedDate>2023-11-28</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">PyPads: Transparent Machine Learning Experiment Tracking</title>
    <abstract language="eng">Despite algorithmic advancements in the field of machine learning, a need for improvement in the infrastructure supporting machine learning development and research has become increasingly apparent. Machine learning experiments usually tend to be more ad-hoc in nature, and results are communicated most often in the form of a publication. Experimental details are often omitted due to size or time constraints, or simply because the complexity in terms of technical setup or parametrization became intractable. Even access to code bases, disregard important properties of the environment and experimental setup, like for example random generators or computing infrastructure. At the same time, tracking and communicating an often inherently exploratory scientific process is a task with considerable effort. We explored different venues to tackle these issues from a data science engineering point of view. The efforts resulted in PyPads, a framework providing an infrastructure to extend experimental setups with logging, communication and analysis features in a mostly non-intrusive way. PyPads can be extended to different Python-based frameworks, utilizing community driven, descriptive metadata in an effort to harmonize library specific logs in an ontology. Meanwhile, we also try to emphasize similarities to practices in software engineering, which have turned out to be essential in practical applications.</abstract>
    <parentTitle language="deu">Datenbank-Spektrum</parentTitle>
    <identifier type="doi">10.1007/s13222-023-00459-w</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024021511222778687954</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Thomas Weißgerber</author>
    <author>Mehdi Ben Amor</author>
    <author>Christofer Fellicious</author>
    <author>Michael Granitzer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Machine Learning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Reproducibility</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Open Science</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Automated Logging</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Python</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1615/Weissgerber_PyPads.pdf</file>
  </doc>
  <doc>
    <id>1614</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>46</pageLast>
    <pageNumber>46 Seiten</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>28</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-01-31</completedDate>
    <publishedDate>2023-01-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An empirical study of automated unit test generation for Python</title>
    <abstract language="eng">Various mature automated test generation tools exist for statically typed programming languages such as Java. Automatically generating unit tests for dynamically typed programming languages such as Python, however, is substantially more difficult due to the dynamic nature of these languages as well as the lack of type information. Our P YNGUIN framework provides automated unit test generation for Python. In this paper, we extend our previous work on P YNGUIN to support more aspects of the Python language, and by studying a larger variety of well-established state of the art test-generation algorithms, namely DynaMOSA, MIO, and MOSA. Furthermore, we improved our P YNGUIN tool to generate regression assertions, whose quality we also evaluate. Our experiments confirm that evolutionary algorithms can outperform random test generation also in the context of Python, and similar to the Java world, DynaMOSA yields the highest coverage results. However, our results also demonstrate that there are still fundamental remaining issues, such as inferring type information for code without this information, currently limiting the effectiveness of test generation for Python.</abstract>
    <parentTitle language="eng">Empirical Software Engineering</parentTitle>
    <identifier type="doi">10.1007/s10664-022-10248-w</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2023081721042349746457</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Stephan Lukasczyk</author>
    <author>Florian Kroiß</author>
    <author>Gordon Fraser</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Dynamic typing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Python</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Automated Test Generation</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1614/Lukasczyk_AutomatedUnitTestGenerationForPython.pdf</file>
  </doc>
  <doc>
    <id>1613</id>
    <completedYear>2023</completedYear>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>14 Seiten</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>34</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-11-01</completedDate>
    <publishedDate>2023-11-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Dimension-independent spectral gap of polar slice sampling</title>
    <abstract language="eng">Polar slice sampling, a Markov chain construction for approximate sampling, performs, under suitable assumptions on the target and initial distribution, provably independent of the state space dimension. We extend the aforementioned result of Roberts and Rosenthal (Stoch Model 18(2):257–280, 2002) by developing a theory which identifies conditions, in terms of a generalized level set function, that imply an explicit lower bound on the spectral gap even in a general slice sampling context. Verifying the identified conditions for polar slice sampling yields a lower bound of 1/2 on the spectral gap for arbitrary dimension if the target density is rotationally invariant, log-concave along rays emanating from the origin and sufficiently smooth. The general theoretical result is potentially applicable beyond the polar slice sampling framework.</abstract>
    <parentTitle language="eng">Statistics and Computing</parentTitle>
    <identifier type="doi">10.1007/s11222-023-10335-y</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2024011821064231531382</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Daniel Rudolf</author>
    <author>Philip Schär</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>MCMC</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Slice Sampling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Spectral gap</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1613/Rudolf_Dimension-spectral-gap.pdf</file>
  </doc>
  <doc>
    <id>1579</id>
    <completedYear>2024</completedYear>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>158939</pageFirst>
    <pageLast>158965</pageLast>
    <pageNumber>27 Seiten</pageNumber>
    <edition/>
    <issue>12</issue>
    <volume>2024</volume>
    <type>article</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace>New York</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-10-28</completedDate>
    <publishedDate>2024-10-28</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Machine learning methods for credit card fraud detection : a survey</title>
    <abstract language="eng">The widespread adoption of online payments has been accompanied by a significant increase in fraudulent activities, resulting in billions of dollars in financial losses. As payment providers aim to tackle this with various preventive mechanisms, fraudsters also continuously evolve their methods to remain indistinguishable from genuine actors. This necessitates sophisticated fraud detection tools to supplement these security mechanisms. As the volume of transactions taking place per day is in the millions, relying solely on human investigation is expensive and ultimately unfeasible, leading to an emergence of research into data driven or statistical methods for fraud detection. Over the last decade, this research has evolved to tackle the various particularities of the domain. These include the skewed nature of the data, the evolving user and fraud behavior, and the learning representations of the context in which a transaction takes place. This work aims to provide the community with an in-depth overview of the different directions in which recent research on online fraud detection has focused. We develop a taxonomy of the domain based on these directions and organize our analysis accordingly. For each area, we focus on significant methodological advancements and highlight limitations or gaps in the current state-of-the-art solutions. Through our analysis, it emerges that one of the primary limiting factors that many researchers face is the lack of availability of high-quality credit card data. Therefore, we provide a first step in addressing this issue in the form of a data generation framework using generative adversarial networks (GANs). We hope that this survey serves as a foundation for researchers who want to address the multi-faceted problem of credit card fraud detection.</abstract>
    <parentTitle language="eng">IEEE Access</parentTitle>
    <identifier type="doi">10.1109/ACCESS.2024.348729</identifier>
    <identifier type="urn">urn:nbn:de:bvb:739-opus4-15796</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Kanishka Gosh Dastidar</author>
    <author>Olivier Caelen</author>
    <author>Michael Granitzer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>fraud detection</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>machine learning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>neural networks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>synthetic data</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="FundingAcknowledgement" number="">Gefördert durch den Open-Access-Publikationsfonds der Universitätsbibliothek Passau.</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1579/goshdastidar_granitzer_CCFraudDetection.pdf</file>
  </doc>
  <doc>
    <id>1542</id>
    <completedYear>2022</completedYear>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>113</pageFirst>
    <pageLast>133</pageLast>
    <pageNumber>21 Seiten</pageNumber>
    <edition/>
    <issue>199</issue>
    <volume>2022</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-06-24</completedDate>
    <publishedDate>2022-06-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The large deviation behavior of lacunary sums</title>
    <abstract language="eng">We study the large deviation behavior of lacunary sums (Sn /n)n∈N with Sn :=∑[k=1...n] f (a(k)U), n ∈ |N, where U is uniformly distributed on [0, 1], (a(k))k∈|N is an Hadamard gap sequence, and f : |R → |R is a 1-periodic, (Lipschitz-)continuous mapping. In the case of large gaps, we show that the normalized partial sums satisfy a large deviation principle at speed n and with a good rate function which is the same as in the case of independent and identically distributed random variables U(k), k ∈ |N, having uniform distribution on [0, 1]. When the lacunary sequence (a(k))k∈|N is a geometric progression, then we also obtain large deviation principles at speed n, but with a good rate function that is different from the independent case, its form depending in a subtle way on the interplay between the function f and the arithmetic properties of the gap sequence. Our work generalizes some results recently obtained by Aistleitner, Gantert, Kabluchko, Prochno, and Ramanan [Large deviation principles for lacunary sums, preprint, 2020] who initiated this line of research for the case of lacunary trigonometric sums.</abstract>
    <parentTitle language="deu">Monatshefte für Mathematik</parentTitle>
    <identifier type="doi">10.1007/s00605-022-01733-x</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2022081723261050522140</identifier>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Lorenz Frühwirth</author>
    <author>Michael Juhos</author>
    <author>Joscha Prochno</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hadamard gap sequence</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Large deviation principle</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Large gap condition</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Geometric progression</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1542/Fruehwirth_LargeDeviationBehavior.pdf</file>
  </doc>
  <doc>
    <id>1537</id>
    <completedYear>2022</completedYear>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>881</pageFirst>
    <pageLast>895</pageLast>
    <pageNumber>15 Seiten</pageNumber>
    <edition/>
    <issue>59</issue>
    <volume>2022</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-04-20</completedDate>
    <publishedDate>2022-04-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Entwicklungsstand der CIO-Funktion und hochschulübergreifenden IT-Governance im Kontext der Digitalen Transformation an Hochschulen in Bayern</title>
    <abstract language="deu">Die Hochschulen befinden sich durch vielfältige Veränderungs-prozesse in Verbindung mit dem Einsatz von Informationstechnologien (IT) aufdem Weg der Digitalen Transformation. Diese Digitale Transformation der Hoch-schulen umfasst intensive Veränderungsprozesse in der gesamten Hochschulkulturin Lehre, Forschung und Verwaltung in übergreifender und strukturierter Weise.Seit vielen Jahren werden vielfältige Digitalisierungsvorhaben zur Modernisierungvon einzelnen Prozessen an den Hochschulen umgesetzt. Die Leitungen der Re-chenzentren leisten mit der Umsetzung von IT-Projekten einen zentralen Beitrag zudiesem Wandel. Mit der Einführung der CIO-Funktion in den Hochschulleitungenund der hochschulübergreifenden Kooperationen hat sich die IT-Governance wei-terentwickelt. Insbesondere für die Digitale Transformation werden Strukturen zurKoordination der übergreifenden Vorhaben benötigt, wobei zusätzlich zur IT-Lei-tung eine Vielzahl von Funktionsträgern mit fachlichen Aufgaben aus Forschung,Lehre und Verwaltung involviert ist. Es stellt sich die Frage, wie die Digitale Trans-formation an Hochschulen gesteuert werden kann und in welcher organisatorischenForm sich die Aufgaben und Verantwortlichkeiten im Hochschulkontext realisierenlassen. An der Weiterentwicklung der IT-Governance an bayerischen Hochschulenwird beispielhaft erläutert, welche übergreifenden Aufgaben der Koordination vonBedarf und Versorgung mit IT-Services zwischen und innerhalb der Hochschulenbestehen. Die CIO-Funktion wird durch die Verankerung in der Leitungsebene derFunktion des Chief Digital Officers (CDO) aus der Wirtschaft ähnlicher, auch wennin Hochschulen aufgrund der klassischen Ressort-Einteilung die Rolle oft als Vize-präsident:in für Digitalisierung bezeichnet wird.</abstract>
    <parentTitle language="deu">HMD Praxis der Wirtschaftsinformatik</parentTitle>
    <identifier type="doi">10.1365/s40702-022-00872-x</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2022072222053919381076</identifier>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Markus von der Heyde</author>
    <author>Armin Gerl</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Digitale Transformation</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>IT-Governance</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Hochschulen</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Bildung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>CIO</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>CDO</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1537/Heyde_EntwicklungsstandCIOFunktion.pdf</file>
  </doc>
  <doc>
    <id>1534</id>
    <completedYear>2022</completedYear>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>831</pageFirst>
    <pageLast>858</pageLast>
    <pageNumber>28 Seiten</pageNumber>
    <edition/>
    <issue>64</issue>
    <volume>2022</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-02-06</completedDate>
    <publishedDate>2022-02-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">NAG: neural feature aggregation framework for credit card&#13;
fraud detection</title>
    <abstract language="eng">The state-of-the-art feature-engineering method for fraud classification of electronic pay-ments uses manually engineered feature aggregates, i.e., descriptive statistics of thetransaction history. However, this approach has limitations, primarily that of being dependenton expensive human expert knowledge. There have been attempts to replace manual aggre-gation through automatic feature extraction approaches. They, however, do not consider thespecific structure of the manual aggregates. In this paper, we define the novel Neural Aggre-gate Generator (NAG), a neural network-based feature extraction module that learns featureaggregates end-to-end on the fraud classification task. In contrast to other automatic featureextraction approaches, the network architecture of the NAG closely mimics the structureof feature aggregates. Furthermore, the NAG extends learnable aggregates over traditionalones through soft feature value matching and relative weighting of the importance of differ-ent feature constraints. We provide a proof to show the modeling capabilities of the NAG.We compare the performance of the NAG to the state-of-the-art approaches on a real-worlddataset with millions of transactions. More precisely, we show that features generated with theNAG lead to improved results over manual aggregates for fraud classification, thus demon-strating its viability to replace them. Moreover, we compare the NAG to other end-to-endapproaches such as the LSTM or a generic CNN. Here we also observe improved results. Weperform a robust evaluation of the NAG through a parameter budget study, an analysis of theimpact of different sequence lengths and also the predictions across days. Unlike the LSTMor the CNN, our approach also provides further interpretability through the inspection of itsparameters.</abstract>
    <parentTitle language="eng">Knowledge and Information Systems</parentTitle>
    <identifier type="doi">10.1007/s10115-022-01653-0</identifier>
    <identifier type="urn">urn:nbn:de:101:1-2022060219175235764329</identifier>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Kanishka Ghosh Dastidar</author>
    <author>Johannes Jurgovsky</author>
    <author>Wissam Siblini</author>
    <author>Michael Granitzer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>finance</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>credit card fraud</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>representation learning</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="ddc" number="006">Spezielle Computerverfahren</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Fakultät für Informatik und Mathematik</collection>
    <collection role="Transformationsvertrag" number="">DEAL Springer Nature</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/1534/GhoshDastidar_NAG.pdf</file>
  </doc>
</export-example>
