Faa-Jeng Lin received B.S. and M.S. degrees in electrical engineering from National Cheng Kung University, Taiwan, and Ph.D. degree in electrical engineering from National Tsing Hua University, Taiwan, in 1983, 1985, and 1993 respectively. Currently, he is Chair Professor, Department of Electrical Engineering, National Central University. His research interests include AC motor drives, power electronics, renewable energies, smart grids, intelligent and nonlinear control theories. His work has been widely cited. Several of his papers have helped to establish research areas such as fuzzy neural network control of motor drives, motion control systems, and smart grids. Moreover, he was Dean, College of Electrical Engineering and Computer Science, National Central University, Taiwan; President, Taiwan Smart Grid Industry Association; President, National Applied Research Laboratories, Taiwan; Deputy Minister, National Science and Technology Council, Taiwan; Associate Editor of IEEE Trans. on Power Electronics. He is now Associate Editor of IEEE Trans. on Fuzzy Systems, and the Executive Director of Taiwan Power Company. He received the Outstanding Research Awards from the National Science Council, Taiwan, in 2004, 2010 and 2013; 29th TECO Award, 2022, Taiwan; Outstanding Contribution Award of Power Electronics, Taiwan Power Electronics Association, 2023; Engineering Medal of Electrical Engineering, The Chinese Institution of Electrical Engineering (CIEE), Taiwan, 2024; The 69th Academic Award, Ministry of Education, Taiwan, 2025. He is IEEE/IET/CIEE/AAIA Fellow.
Talk title: Intelligent Control of Microgrid Using Recurrent Wavelet Petri Fuzzy Neural Network
Abstract: This talk presents a voltage restoration control (VRC) based on battery energy storage system (BESS), which can be used for both supporting power source and voltage compensation. An intelligent controller using recurrent wavelet petri fuzzy neural network (RWPFNN) is proposed for the VRC of BESS to provide fast control response to mitigate the transient impact. Moreover, to examine the compliance with the requirements of low voltage ride through (LVRT) of the photovoltaic (PV) plant and investigate the performance of the proposed VRC, the microgrid built in Cimei Island in Penghu Archipelago, Taiwan, is investigated. Furthermore, the PV system, the wind turbine generator (WTG) system and the BESS are connected to the same point of common coupling (PCC) with separated step-up transformers in the microgrid. In addition, the diesel generators provide the main power sources and form the isolated microgrid system. Through the hardware in the loop (HIL) mechanism, which is built using OPAL-RT real-time simulator, with two floating-point digital signal processors (DSPs), the effectiveness of proposed intelligent controllers can be verified and demonstrated. Additionally, Taiwan plan for net zero technology – energy transition and smart grids will be introduced in this talk.
Prof. Leszek A. Gąsieniec is a Professor of Computer Science at the University of Liverpoolin the UK. He works broadly in Algorithms, Distributed Computing, and Networked Systems, with research interests spanning efficient algorithms, search and exploration processes, mobile and networked agents, and population protocols. He has authored more than two hundred peer-reviewed publications and has served on programme committees of numerous international conferences. He is also a former Associate Editor of Theoretical Computer Science and the Journal of Interconnection Networks. Professor Gąsieniec is a member of the EPSRC College and has served on evaluation and review panels for major UK funding bodies, including EPSRC and the Royal Society, as well as for FNP and NCN in Poland, often in chairing roles. At Liverpool, he leads the Networks and Distributed Computing research group and has previously served as Head of the Department of Computer Science.
Talk title: Geometry and Structures in Self‑Stabilising Population Protocols
Abstract: Population protocols provide a foundational model for analysing the computational capabilities of systems composed of simple, indistinguishable agents interacting in pairs. Each agent has only minimal memory, represented by its current state from a fixed state set. In the classical setting, a protocol starts from a well‑defined initial configuration encoding the input and must stabilise to a correct final configuration. Self‑stabilising population protocols relax this requirement by allowing the system to begin in an arbitrary configuration. Such a protocol must ensure that, regardless of the starting state, the system eventually converges to a correct and stable configuration. This presentation will focus on several core tasks in this framework, including ranking, leader election, and distributed positioning in models enriched with geometric or spatial queries. The discussion will highlight recent developments, such as improved efficiency bounds for near‑state‑optimal and state‑optimal self‑stabilising leader‑election protocols, as well as new methods for anonymous self‑stabilising localisation using spatial population protocols.
Ralf Klasing received the PhD degree from the University of Paderborn in 1995. From 1995 to 1997, he was an Assistant Professor at the University of Kiel. From 1997 to 1998, he was a Research Fellow at the University of Warwick. From 1998 to 2000, he was an Assistant Professor at RWTH Aachen. From 2000 to 2002, he was a Lecturer at King’s College London. In 2002, he joined the CNRS as a permanent researcher. From 2002 to 2005, he was affiliated to the laboratory I3S in Sophia Antipolis. Currently, he is affiliated to the laboratory LaBRI in Bordeaux. In 2009, he received the HDR degree from the University Bordeaux 1. In 2010, he was promoted to Senior Researcher (DR CNRS). From 2010 to 2015, he was the Head of the Combinatorics and Algorithms team of the LaBRI. His research interests are in “Design and Analysis of Algorithms” and in “Complexity”. More particularly, his research focuses on (1) Distributed algorithms, (2) Approximation algorithms for combinatorially hard problems, (3) Algorithmic methods for telecommunication, (4) Communication algorithms in networks. He has co-authored three book chapters, two Springer Monographs, and has published 72 papers in refereed international journals and 61 papers in refereed international conferences with proceedings. He has published 6 invited papers in international conferences. He has given 19 invited talks at international conferences, and 1 invited lecture series. He has edited 6 LNCS volumes, 1 CCIS volume, and 6 special issues of the international journals ACM Journal of Experimental Algorithmics, Algorithmica, Journal of Computer and System Sciences, Journal of Information Science and Engineering, and Theoretical Computer Science. He is Managing Editor of the 2 international journals Algorithmica and Journal of Interconnection Networks. He is a member of the Editorial Board of the 12 international journals Acta Informatica, Computing and Informatics, Discrete Applied Mathematics, Fundamenta Informaticae, Information and Computation, International Journal of Computer Mathematics: Computer Systems Theory, Journal of the Chinese Institute of Engineers, Journal of Computer and System Sciences, Journal of Parallel and Distributed Computing, Parallel Processing Letters, Theoretical Computer Science, and Wireless Networks. He is a member of the Steering Committees of SOFSEM and IWOCA. He was a member of the Steering Committee of SIROCCO. He was the Conference Co-Chair of ISPAN 2018, and the Chair of the Program Commmittees of BWIC 2011, SEA 2012, and ALGOSENSORS 2016 (Track on Distributed and Mobile Networks). He acted as the Co-Chair of the Program Commmittees of SSS 2013 (Track on Ad-hoc, Sensors, Mobile Agents and Robot Networks), FCT 2017, I-SPAN 2017, IWOCA 2020, ALGOSENSORS 2021, ICS 2022, WABCT 2022, SOFSEM 2024, and as the Chair of the best paper award committees of CIAC 2017 and COCOON 2021. He has acted as a member of the Program Committees of 64 well-acknowledged international conferences, including ICALP, STACS, MFCS, FCT, ISAAC, IWOCA, WAOA, COCOON, OPODIS, SIROCCO and SOFSEM.
Talk title: Bamboo Garden Trimming Problem
Abstract: A garden is populated by n bamboos, each with its own daily growth rate. The Bamboo Garden Trimming Problem (BGT) is to design for a robotic gardener a perpetual schedule of cutting bamboos to keep the elevation of the garden as low as possible. The frequency of cutting is constrained by the time needed to move from one bamboo to the next, which is one day in Discrete BGT and is defined by the distance between the two bamboos in Continuous BGT. The bamboo garden is a metaphor for a collection of machines which have to be serviced, with different frequencies, by a robot which can service only one machine at a time. For Discrete BGT, we show a simple 4-approximation algorithm and, by exploiting relationship between BGT and the classical Pinwheel Scheduling Problem, we derive a 2-approximation for the general case and a tighter approximation when the growth rates are balanced. For Continuous BGT, we propose approximation algorithms which achieve logarithmic approximation ratios.