Lauri Karttunen
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
Research Subjects
Lauri Karttunen has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Kati Miettunen
Department of Mechanical and Materials Engineering University of Turku Turku Finland
4 shared publicationsHugo Huerta
New Energy Research Group Turku University of Applied Sciences Turku Finland
3 shared publications- Sami Jouttijärvi
Department of Mechanical and Materials Engineering, Faculty of Technology, University of Turku, Turku, Finland
3 shared publications Samuli Ranta
New Energy Research Group Turku University of Applied Sciences Turku Finland
3 shared publicationsSami Jouttijärvi
Department of Mechanical and Materials Engineering University of Turku Turku Finland
2 shared publications- Aapo Poskela
Department of Mechanical and Materials Engineering, Faculty of Technology, University of Turku, 20014 Turku, Finland
1 shared publication
Latest Publications
- Open Access
- 26 June 2026
- Published by Wiley in Progress in Photovoltaics: Research and Applications
- Vol. 34 (10) , 1256-1276
Robust Performance Loss Rate Calculation for Photovoltaic Systems in High Latitude Locations
Photovoltaic (PV) production grows rapidly in the Nordics, but literature on calculating long‐term PV performance losses remains limited in these conditions, leading to inaccurate yield estimations and economic losses. To fill this knowledge gap, this contribution (1) shows typical PV performance characteristics, (2) obtains performance loss rates (PLRs) from multiple systems, and (3) assesses the best practices of PLR calculation under these conditions. For these objectives, we compared various methods for all steps of PLR calculation, including data filters, performance metrics, aggregation intervals, and statistical models for five systems (with 2.5–6 years of data) across Finland, from 60° to 67° N. Dark winters and snow coverage caused gaps and anomalies to the performance time series during wintertime, resulting in unrealistic PLRs. Excluding these anomalies with performance threshold filter improved the results. As the different methods can drastically affect the PLR value, an ensemble method consisting of an assessment of average PLR with over 700 calculation approaches was validated to be essential in identifying robust PLRs. Using this ensemble method, the system PLR estimates ranged from 0.41%/year to 2.65%/year. The data and codes are made publicly available, contributing to open access of PV datasets and allowing wider application of the PLR methodology.
- 26 June 2026
- Published by Wiley in Progress in Photovoltaics: Research and Applications
- Vol. 34 (10) , 1256-1276
Open AccessRobust Performance Loss Rate Calculation for Photovoltaic Systems in High Latitude Locations
Photovoltaic (PV) production grows rapidly in the Nordics, but literature on calculating long‐term PV performance losses remains limited in these conditions, leading to inaccurate yield estimations and economic losses. To fill this knowledge gap, this contribution (1) shows typical PV performance characteristics, (2) obtains performance loss rates (PLRs) from multiple systems, and (3) assesses the best practices of PLR calculation under these conditions. For these objectives, we compared various methods for all steps of PLR calculation, including data filters, performance metrics, aggregation intervals, and statistical models for five systems (with 2.5–6 years of data) across Finland, from 60° to 67° N. Dark winters and snow coverage caused gaps and anomalies to the performance time series during wintertime, resulting in unrealistic PLRs. Excluding these anomalies with performance threshold filter improved the results. As the different methods can drastically affect the PLR value, an ensemble method consisting of an assessment of average PLR with over 700 calculation approaches was validated to be essential in identifying robust PLRs. Using this ensemble method, the system PLR estimates ranged from 0.41%/year to 2.65%/year. The data and codes are made publicly available, contributing to open access of PV datasets and allowing wider application of the PLR methodology.
- Open Access
- 15 June 2026
- Published by Elsevier in Solar Energy
- Vol. 315
Photovoltaic power modelling in high latitudes with empirical and machine learning models using transfer learning
- 15 June 2026
- Published by Elsevier in Solar Energy
- Vol. 315
Open AccessPhotovoltaic power modelling in high latitudes with empirical and machine learning models using transfer learning
- Open Access
- 27 February 2026
- Published by Elsevier in Journal of Energy Storage
- Vol. 154
The impact of battery scheduling strategies on profitability considering battery usage costs and dynamic electricity pricing in Nordic residential PV–battery system
- 27 February 2026
- Published by Elsevier in Journal of Energy Storage
- Vol. 154
Open AccessThe impact of battery scheduling strategies on profitability considering battery usage costs and dynamic electricity pricing in Nordic residential PV–battery system
- Open Access
- 17 October 2025
- Published by Elsevier in Energy and Buildings
- Vol. 349
Enhancing residential load forecasting accuracy through dynamic feature selection and ensemble machine learning models: A real-world scenario in Southern Finland
- 17 October 2025
- Published by Elsevier in Energy and Buildings
- Vol. 349
Open AccessEnhancing residential load forecasting accuracy through dynamic feature selection and ensemble machine learning models: A real-world scenario in Southern Finland
- Open Access
- 16 October 2023
- Published by Elsevier in Renewable Energy
- Vol. 219
Comparing methods for the long-term performance assessment of bifacial photovoltaic modules in Nordic conditions
- 16 October 2023
- Published by Elsevier in Renewable Energy
- Vol. 219
Open AccessComparing methods for the long-term performance assessment of bifacial photovoltaic modules in Nordic conditions
- 18 September 2012
- Published by Oxford University Press (OUP)
Finite-State Technology
The article introduces the basic concepts of finite-state language processing: regular languages and relations, finite-state automata, and regular expressions. Many basic steps in language processing, ranging from tokenization, to phonological and morphological analysis, disambiguation, spelling correction, and shallow parsing, can be performed efficiently by means of finite-state transducers. The article discusses examples of finite-state languages and relations. Finite-state networks can represent only a subset of all possible languages and relations; that is, only some languages are finite-state languages. Furthermore, this article introduces two types of complex regular expressions that have many linguistic applications, restriction and replacement. Finally, the article discusses the properties of finite-state automata. The three important properties of networks are: that they are epsilon free, deterministic, and minimal. If a network encodes a regular language and if it is epsilon free, deterministic, and minimal, the network is guaranteed to be the best encoding for that language.
- 18 September 2012
- Published by Oxford University Press (OUP)
Finite-State Technology
The article introduces the basic concepts of finite-state language processing: regular languages and relations, finite-state automata, and regular expressions. Many basic steps in language processing, ranging from tokenization, to phonological and morphological analysis, disambiguation, spelling correction, and shallow parsing, can be performed efficiently by means of finite-state transducers. The article discusses examples of finite-state languages and relations. Finite-state networks can represent only a subset of all possible languages and relations; that is, only some languages are finite-state languages. Furthermore, this article introduces two types of complex regular expressions that have many linguistic applications, restriction and replacement. Finally, the article discusses the properties of finite-state automata. The three important properties of networks are: that they are epsilon free, deterministic, and minimal. If a network encodes a regular language and if it is epsilon free, deterministic, and minimal, the network is guaranteed to be the best encoding for that language.