Lorenz Gillner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lorenz Gillner has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ekaterina Auer
University of Applied Sciences Wismar
4 shared publications - Andreas Ahrens
Hochschule Wismar, Germany
1 shared publication - Andreas Rauh
Carl von Ossietzky Universität Oldenburg
1 shared publication C.P. Larsen
L M Ericsson A S Copenhagen, Technical University of Denmark, Copenhagen, Denmark
1 shared publicationE. Berglind
Lab. of Photonics and Microwave Eng., R. Inst. of Technol., Kista, Sweden
1 shared publication- Maria Gustavsson
Department of Behavioral Sciences and Learning, Linköping University, 581 83 Linköping, Sweden
1 shared publication
Latest Publications
- 16 November 2025
- Published by Springer Nature
- p. 211-237
Parameter Identification for Cooperative SOFC Models on the GPU
- 16 November 2025
- Published by Springer Nature
- p. 211-237
Parameter Identification for Cooperative SOFC Models on the GPU
- 1 April 2025
- Published by Springer Nature
- p. 360-374
GPU-Based Interval Optimization in the Context of Optical MIMO Systems
- 1 April 2025
- Published by Springer Nature
- p. 360-374
GPU-Based Interval Optimization in the Context of Optical MIMO Systems
- Open Access
- 24 October 2024
- Published by University of Szeged in Acta Cybernetica
- Vol. 26 (4) , 913-932
GPU-Accelerated, Interval-Based Parameter Identification Methods Illustrated Using the Two-Compartment Problem
Interval methods are helpful in the context of scientific computing for reliable treatment of problems with bounded uncertainty. Most traditional interval algorithms, however, were designed for sequential execution while internally depending on processor-specific instructions for directed rounding. Nowadays, many-core processors and dedicated hardware for massively parallel data processing have become the de facto standard for high-performance computers. Interval libraries have yet to adapt to this heterogeneous computing paradigm. In this article, we investigate the parallelization of interval methods with an emphasis on modern graphics processors. Using a parameter identification scenario in combination with newly developed or enhanced GPU-based interval software, we evaluate different methods for reducing the size of large interval search domains. For the first time, algorithmic differentiation can be used with intervals on the GPU. Different versions of interval optimization algorithms are compared wrt. their functionality, run times, and energy consumption.
- 24 October 2024
- Published by University of Szeged in Acta Cybernetica
- Vol. 26 (4) , 913-932
Open AccessGPU-Accelerated, Interval-Based Parameter Identification Methods Illustrated Using the Two-Compartment Problem
Interval methods are helpful in the context of scientific computing for reliable treatment of problems with bounded uncertainty. Most traditional interval algorithms, however, were designed for sequential execution while internally depending on processor-specific instructions for directed rounding. Nowadays, many-core processors and dedicated hardware for massively parallel data processing have become the de facto standard for high-performance computers. Interval libraries have yet to adapt to this heterogeneous computing paradigm. In this article, we investigate the parallelization of interval methods with an emphasis on modern graphics processors. Using a parameter identification scenario in combination with newly developed or enhanced GPU-based interval software, we evaluate different methods for reducing the size of large interval search domains. For the first time, algorithmic differentiation can be used with intervals on the GPU. Different versions of interval optimization algorithms are compared wrt. their functionality, run times, and energy consumption.
- Open Access
- 28 November 2023
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 29 (11) , 1361-1384
Towards a Traceable Data Model Accommodating Bounded Uncertainty for DST Based Computation of BRCA1/2 Mutation Probability With Age
In this paper, we describe the requirements for traceable open-source data retrieval in the context of computation of BRCA1/2 mutation probabilities (mutations in two tumor-suppressor genes responsible for hereditary BReast or/and ovarian CAncer). We show how such data can be used to develop a Dempster-Shafer model for computing the probability of BRCA1/2 mutations enhanced by taking into account the actual age of a patient or a family member in an appropriate way even if it is not known exactly. The model is compared with PENN II and BOADICEA (based on undisclosed data), two established platforms for this purpose accessible online, as well as with our own previous models. A proof-of-concept implementation shows that set-based techniques are able to provide better information about mutation probabilities, simultaneously highlighting the necessity for ground truth data of high quality.
- 28 November 2023
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 29 (11) , 1361-1384
Open AccessTowards a Traceable Data Model Accommodating Bounded Uncertainty for DST Based Computation of BRCA1/2 Mutation Probability With Age
In this paper, we describe the requirements for traceable open-source data retrieval in the context of computation of BRCA1/2 mutation probabilities (mutations in two tumor-suppressor genes responsible for hereditary BReast or/and ovarian CAncer). We show how such data can be used to develop a Dempster-Shafer model for computing the probability of BRCA1/2 mutations enhanced by taking into account the actual age of a patient or a family member in an appropriate way even if it is not known exactly. The model is compared with PENN II and BOADICEA (based on undisclosed data), two established platforms for this purpose accessible online, as well as with our own previous models. A proof-of-concept implementation shows that set-based techniques are able to provide better information about mutation probabilities, simultaneously highlighting the necessity for ground truth data of high quality.
- 1 January 1997
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 15 (11) , 2006-2019
Statistical analysis of interferometric crosstalk: theory and optical network examples
- 1 January 1997
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 15 (11) , 2006-2019
Statistical analysis of interferometric crosstalk: theory and optical network examples
- 1 October 1994
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Technology Letters
- Vol. 6 (10) , 1182-1184
Parameter extraction from DFB lasers by means of a simple expression for the spontaneous emission spectrum
A simple expression for the amplified spontaneous emission from a laser biased below lasing threshold is applied to semiconductor laser parameter extraction. We demonstrate that accurate measurement of the coupling coefficient for distributed feedback (DFB) lasers with phaseshifts and end reflections is a practical possibility. It is also shown that the used expression, for a reciprocal device, can be derived directly from the wave equation using the Green's function.
- 1 October 1994
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Technology Letters
- Vol. 6 (10) , 1182-1184
Parameter extraction from DFB lasers by means of a simple expression for the spontaneous emission spectrum
A simple expression for the amplified spontaneous emission from a laser biased below lasing threshold is applied to semiconductor laser parameter extraction. We demonstrate that accurate measurement of the coupling coefficient for distributed feedback (DFB) lasers with phaseshifts and end reflections is a practical possibility. It is also shown that the used expression, for a reciprocal device, can be derived directly from the wave equation using the Green's function.