M.B. van Gijzen
Please Note
42 records found
1
Investigating Signal Propagation and Stability in Spider Web-like Networks
Effects of Velocity, Geometry, and Structural Complexity
The study introduces distinct propagation approaches, ranging from simple discrete collision analysis to advanced continuous simulations incorporating energy dissipation, adaptive weighting, and refined collision detection algorithms. Key methodologies include simulations of force distribution using recurrence relations, random walk models, and wavefront propagation models to examine how signals traverse complex network topologies. These simulations reveal that network topology significantly impacts signal efficiency, propagation speed, collision frequency, and signal loss, with central nodes emerging as critical hubs of activity and congestion. Additionally, structural defects such as inactive nodes, altered masses, and weakened edges are systematically introduced to evaluate their influence on the overall stability and signal propagation efficiency. These imperfections profoundly affect network performance, demonstrating the necessity for structural adaptability and redundancy to maintain integrity under stress. ...
The study introduces distinct propagation approaches, ranging from simple discrete collision analysis to advanced continuous simulations incorporating energy dissipation, adaptive weighting, and refined collision detection algorithms. Key methodologies include simulations of force distribution using recurrence relations, random walk models, and wavefront propagation models to examine how signals traverse complex network topologies. These simulations reveal that network topology significantly impacts signal efficiency, propagation speed, collision frequency, and signal loss, with central nodes emerging as critical hubs of activity and congestion. Additionally, structural defects such as inactive nodes, altered masses, and weakened edges are systematically introduced to evaluate their influence on the overall stability and signal propagation efficiency. These imperfections profoundly affect network performance, demonstrating the necessity for structural adaptability and redundancy to maintain integrity under stress.
Efficient Time-Integration Solvers for Shallow Water Equations on GPUs
A Case Study in Tidal Modeling
Operator Learning for Loss Parameter Estimation in Dredging Operations
To optimize the suction production on Trailing Suction Hopper Dredgers
Due to the nature of a lagging density sensor, we integrate a real-time rolling mean error correction mechanism. This addresses training biases for refined predictions, as well as offering an anomaly detection mechanism. The model is trained and validated on real-world vessel data, including synthetic simulations of vacuum processes, and evaluated using trip-wise and global metrics. Experimental results show that the proposed architecture significantly outperforms the rolling mean baseline setups and the classical DeepONet across accuracy metrics such as the root mean square error (RMSE).
This work demonstrates the value of combining domain knowledge with operator learning techniques in maritime engineering. The proposed framework offers a scalable framework, allowing application across entire fleets for real-time suction production estimation and anomaly detection, contributing to efficient dredging operations. ...
Due to the nature of a lagging density sensor, we integrate a real-time rolling mean error correction mechanism. This addresses training biases for refined predictions, as well as offering an anomaly detection mechanism. The model is trained and validated on real-world vessel data, including synthetic simulations of vacuum processes, and evaluated using trip-wise and global metrics. Experimental results show that the proposed architecture significantly outperforms the rolling mean baseline setups and the classical DeepONet across accuracy metrics such as the root mean square error (RMSE).
This work demonstrates the value of combining domain knowledge with operator learning techniques in maritime engineering. The proposed framework offers a scalable framework, allowing application across entire fleets for real-time suction production estimation and anomaly detection, contributing to efficient dredging operations.
KarGus: A Scalable Knowledge Graph-Powered System for Multi-Document Query-Answering
Enhancing Information Retrieval through Advanced NLP and Graph-Based Approaches
We explore the efficacy of combining semantic similarity, TF-IDF, and Named Entity Recognition features in KG construction and information retrieval. Experimental evaluation on a corpus of 30 documents (1810 pages, 10,853 text chunks) from corporate intelligence demonstrates that KarGus outperforms traditional embedding-based methods, achieving a Recall@5 of 0.850 compared to the baseline's 0.823 (p < 0.05). The optimal configuration emphasized semantic similarity (weight 0.75), keyword relevance (0.2), and entity information (0.05).
Analysis of the KG structure revealed moderately well-defined community structures and efficient information traversal properties. While GNN models showed promising training results, they underperformed in the retrieval task, highlighting challenges in GNN application to MD-QA.
This research contributes to the field of information retrieval by demonstrating the efficacy of integrating NLP techniques with graph-based approaches in MD-QA. The adaptable nature of KarGus suggests potential applications across various specialized domains. Future work will focus on validating cross-domain performance and refining GNN implementations for diverse retrieval tasks. ...
We explore the efficacy of combining semantic similarity, TF-IDF, and Named Entity Recognition features in KG construction and information retrieval. Experimental evaluation on a corpus of 30 documents (1810 pages, 10,853 text chunks) from corporate intelligence demonstrates that KarGus outperforms traditional embedding-based methods, achieving a Recall@5 of 0.850 compared to the baseline's 0.823 (p < 0.05). The optimal configuration emphasized semantic similarity (weight 0.75), keyword relevance (0.2), and entity information (0.05).
Analysis of the KG structure revealed moderately well-defined community structures and efficient information traversal properties. While GNN models showed promising training results, they underperformed in the retrieval task, highlighting challenges in GNN application to MD-QA.
This research contributes to the field of information retrieval by demonstrating the efficacy of integrating NLP techniques with graph-based approaches in MD-QA. The adaptable nature of KarGus suggests potential applications across various specialized domains. Future work will focus on validating cross-domain performance and refining GNN implementations for diverse retrieval tasks.
accuracy loss minimal. Four different methods have been tested: Proper Orthogonal Decomposition (POD), heuristically corrected POD, Balanced Truncation (BT), and Balanced
Proper Orthogonal Decomposition (BPOD). The first two methods are inadequate, because
of stability issues. The third is stable, but fails to execute for burnup simulations. The
fourth, a midway method between the first and third, does work for burnup simulations.
Using BPOD with 4 orders for a 10 year burnup simulation of 1650 nuclides with 1000
simulation steps, we find a normalised relative error of 10-5 both for the total model and
each nuclide individually. The execution time per simulation step is reduced to 10-5 s.
These results are a factor 1000 better than known alternatives such as the ORIGEN burnup
program.
The conclusion contains recommendations for incorporating different fuel mixtures and non-
linearity of the burnup equation in the BPOD. The method could be generalised to handle
arbitrary burnup problems with a single Reduced Order Model.
...
accuracy loss minimal. Four different methods have been tested: Proper Orthogonal Decomposition (POD), heuristically corrected POD, Balanced Truncation (BT), and Balanced
Proper Orthogonal Decomposition (BPOD). The first two methods are inadequate, because
of stability issues. The third is stable, but fails to execute for burnup simulations. The
fourth, a midway method between the first and third, does work for burnup simulations.
Using BPOD with 4 orders for a 10 year burnup simulation of 1650 nuclides with 1000
simulation steps, we find a normalised relative error of 10-5 both for the total model and
each nuclide individually. The execution time per simulation step is reduced to 10-5 s.
These results are a factor 1000 better than known alternatives such as the ORIGEN burnup
program.
The conclusion contains recommendations for incorporating different fuel mixtures and non-
linearity of the burnup equation in the BPOD. The method could be generalised to handle
arbitrary burnup problems with a single Reduced Order Model.
...
Leveraging Autoencoders
To Enhance Model Order Reduction for Non-linear Mechanical Dynamical Systems
To gain this insight, synthetic data was created and used to make synthetic scans. The signal-to-noise ratio of a target spectrum was calculated, and Monte Carlo simulations were used to reveal hidden patterns in the data. In case of a high contrast scenario, multi-area whitening was employed and the cosine similarity between the target spectrum and its signature was determined. It was observed that the shape and intensity of the whitened target spectrum differs, depending on if pixels were used as observations or wavelengths. However, both are subject to the ‘bleeding’ effect. Further, it was found that if the number of pixels in the scan is greater than the number of spectral bands (548), then the signal-to-noise ratio becomes better as the number of whitened pixels in the scan increases. In case of a high contrast scenario, multi-area whitening guarantees the uniformity of the spectra, resulting in a higher
cosine similarity between the target spectrum and its signature. But as multi-area whitening uses a smaller
number of pixels in the scan, it cannot be concluded if multi-area whitening is better than global whitening, as it is not known how the increase in cosine similarity and the decrease in signal-to-noise ratio relate to the classification process. Finally, it is concluded that when working with real and unknown data, using pixels as
observations is much more feasible. ...
To gain this insight, synthetic data was created and used to make synthetic scans. The signal-to-noise ratio of a target spectrum was calculated, and Monte Carlo simulations were used to reveal hidden patterns in the data. In case of a high contrast scenario, multi-area whitening was employed and the cosine similarity between the target spectrum and its signature was determined. It was observed that the shape and intensity of the whitened target spectrum differs, depending on if pixels were used as observations or wavelengths. However, both are subject to the ‘bleeding’ effect. Further, it was found that if the number of pixels in the scan is greater than the number of spectral bands (548), then the signal-to-noise ratio becomes better as the number of whitened pixels in the scan increases. In case of a high contrast scenario, multi-area whitening guarantees the uniformity of the spectra, resulting in a higher
cosine similarity between the target spectrum and its signature. But as multi-area whitening uses a smaller
number of pixels in the scan, it cannot be concluded if multi-area whitening is better than global whitening, as it is not known how the increase in cosine similarity and the decrease in signal-to-noise ratio relate to the classification process. Finally, it is concluded that when working with real and unknown data, using pixels as
observations is much more feasible.
Predictive Analysis of Anti-NMDA-Receptor Encephalitis
Using a Random Forest Classifier on EEG Data
To predict the outcome after 12 months, a Random Forest (RF) classifier was constructed using available EEG features. The EEG dataset exhibited a clustered structure due to multiple values for each patient’s EEG features. Three approaches were considered to handle this clustering: ignoring clustering, reducing clustering to independent observations, and explicitly accounting for clustering. The first two options were explored in this research. Another prominent challenge encountered early in the research was the class imbalance, which was addressed by under- and oversampling the dataset.
For the simulation sets, under- or oversampling did not yield the desired effect, as the normal sets demonstrated comparable or even superior performance compared to the the under- and oversampled sets. However, under- and oversampling improved the performance scores for the real dataset. Reducing the clusters to independent observations did not achieve high performance scores compared to ignoring clustering, both in the simulation and real data cases. Furthermore, in both cases, RF models using the EEG sets outperformed those using principal component analysis (PCA) on the clustered EEG set.
Although the performance metrics scores were not yet optimal, important features for determining class labels were identified, providing a good understanding of the dataset. Mean Decrease in Impurity (MDI) and SHAP algorithm highlighted the significance of connectivity-related features in the reduced clustering to independent observation setting. The relevance of these features became evident upon calculating the mean, minimum, or maximum. In the EEG setting, MDI emphasized the importance of the features deltapower, sampleentropy and occipital-related features. These features remain important in the reduced set. SHAP, in addition to prioritizing the same features, offered insights into how specific features contribute to the prediction of a specific observation, enhancing interpretability.
The challenges for the RF classifier in the case of anti-NDMARE are class imbalance and accurate classification of the minority class. Under- and oversampling techniques successfully improved classification of minority class observations for the original EEG set. Concluding, this set is strongly encouraged to be utilized over all sets when aiming to classify EEG features. However, this set overlooks the clustering aspect, leaving room for optimization in future research to address this limitation. Additionally, it is recommended to explore the potential of a Convolutional Neural Network (CNN) for accurate classification of raw EEG signals. Its exploration was beyond the scope of this research. ...
To predict the outcome after 12 months, a Random Forest (RF) classifier was constructed using available EEG features. The EEG dataset exhibited a clustered structure due to multiple values for each patient’s EEG features. Three approaches were considered to handle this clustering: ignoring clustering, reducing clustering to independent observations, and explicitly accounting for clustering. The first two options were explored in this research. Another prominent challenge encountered early in the research was the class imbalance, which was addressed by under- and oversampling the dataset.
For the simulation sets, under- or oversampling did not yield the desired effect, as the normal sets demonstrated comparable or even superior performance compared to the the under- and oversampled sets. However, under- and oversampling improved the performance scores for the real dataset. Reducing the clusters to independent observations did not achieve high performance scores compared to ignoring clustering, both in the simulation and real data cases. Furthermore, in both cases, RF models using the EEG sets outperformed those using principal component analysis (PCA) on the clustered EEG set.
Although the performance metrics scores were not yet optimal, important features for determining class labels were identified, providing a good understanding of the dataset. Mean Decrease in Impurity (MDI) and SHAP algorithm highlighted the significance of connectivity-related features in the reduced clustering to independent observation setting. The relevance of these features became evident upon calculating the mean, minimum, or maximum. In the EEG setting, MDI emphasized the importance of the features deltapower, sampleentropy and occipital-related features. These features remain important in the reduced set. SHAP, in addition to prioritizing the same features, offered insights into how specific features contribute to the prediction of a specific observation, enhancing interpretability.
The challenges for the RF classifier in the case of anti-NDMARE are class imbalance and accurate classification of the minority class. Under- and oversampling techniques successfully improved classification of minority class observations for the original EEG set. Concluding, this set is strongly encouraged to be utilized over all sets when aiming to classify EEG features. However, this set overlooks the clustering aspect, leaving room for optimization in future research to address this limitation. Additionally, it is recommended to explore the potential of a Convolutional Neural Network (CNN) for accurate classification of raw EEG signals. Its exploration was beyond the scope of this research.
Water motion over tidal flats
Finite element method in the frequency domain
Magnetic maps are also used in applications such as resource exploration, archaeology, and geophysical studies. The Earth’s magnetic field consists of contributions from both core and crustal sources. Global magnetic maps are commonly represented using spherical harmonics, which model large-scale fields originating from the Earth’s core. However, at regional scales these models become insufficient due to crustal and near-surface variations. In theory, infinite spherical harmonic expansion could represent the field, but this is not feasible in practice.
To address regional mapping, local extensions of global models are used. Techniques include interpolation methods, dipole approximations, and Equivalent Layer methods. Equivalent Layer formulates a linear inverse problem in which magnetic dipoles below the surface are fitted to measurements. While effective, it requires a priori assumptions on dipole placement. Upward continuation is another key technique, allowing estimation of the magnetic field at higher altitudes using measurements at a lower altitude by exploiting harmonic properties of the field.
This thesis advances magnetic map-making by providing a complete overview of the pipeline, from theory to applications. It reviews magnetic models, their limitations, and spatial resolution effects. It derives the Equivalent Layer formulation from first principles, extending from single dipole cases to multiple measurements. A novel method based on Anderson functions is introduced, enabling magnetic field reconstruction without prior knowledge of source locations and allowing dipole depth estimation. An orthonormalized wavelet extension is also developed.
A Python framework, MagMap, is developed to benchmark mapping techniques on simulated magnetic fields, comparing interpolation and extrapolation performance. The methods are further validated on real-world data, highlighting practical challenges such as noise and measurement distortions from ferromagnetic platforms.
The research is structured around understanding magnetic maps, improving reconstruction techniques, and evaluating their performance under realistic conditions. Key research questions address magnetic map definitions, existing methodologies, dipole depth estimation, interpolation accuracy, noise effects, and applications in navigation and exploration. The work demonstrates that magnetic maps are a viable candidate for regional-scale GNSS-independent navigation, particularly for aeromagnetic applications. ...
Magnetic maps are also used in applications such as resource exploration, archaeology, and geophysical studies. The Earth’s magnetic field consists of contributions from both core and crustal sources. Global magnetic maps are commonly represented using spherical harmonics, which model large-scale fields originating from the Earth’s core. However, at regional scales these models become insufficient due to crustal and near-surface variations. In theory, infinite spherical harmonic expansion could represent the field, but this is not feasible in practice.
To address regional mapping, local extensions of global models are used. Techniques include interpolation methods, dipole approximations, and Equivalent Layer methods. Equivalent Layer formulates a linear inverse problem in which magnetic dipoles below the surface are fitted to measurements. While effective, it requires a priori assumptions on dipole placement. Upward continuation is another key technique, allowing estimation of the magnetic field at higher altitudes using measurements at a lower altitude by exploiting harmonic properties of the field.
This thesis advances magnetic map-making by providing a complete overview of the pipeline, from theory to applications. It reviews magnetic models, their limitations, and spatial resolution effects. It derives the Equivalent Layer formulation from first principles, extending from single dipole cases to multiple measurements. A novel method based on Anderson functions is introduced, enabling magnetic field reconstruction without prior knowledge of source locations and allowing dipole depth estimation. An orthonormalized wavelet extension is also developed.
A Python framework, MagMap, is developed to benchmark mapping techniques on simulated magnetic fields, comparing interpolation and extrapolation performance. The methods are further validated on real-world data, highlighting practical challenges such as noise and measurement distortions from ferromagnetic platforms.
The research is structured around understanding magnetic maps, improving reconstruction techniques, and evaluating their performance under realistic conditions. Key research questions address magnetic map definitions, existing methodologies, dipole depth estimation, interpolation accuracy, noise effects, and applications in navigation and exploration. The work demonstrates that magnetic maps are a viable candidate for regional-scale GNSS-independent navigation, particularly for aeromagnetic applications.
Non-Intrusive Multi-Fidelity Reduced Order Modeling using Adaptive Sparse Grids
Analysis of Nuclear Reactors using Non-Intrusive Adaptive Multi-Fidelity Reduced Order Modeling Techniques
The aim is to minimize the computational workload involved in constructing a reduced-order model during the offline phase. This is achieved by decreasing the number of high-fidelity model evaluations necessary for building the reduced order model while maintaining accurate results. To this end, the existing adaptive proper orthogonal decomposition algorithm is enhanced by employing multi-fidelity techniques. Multi-fidelity methods aim to combine large amount of low-fidelity data with a limited amount of high-fidelity data to compute accurate, yet computationally inexpensive approximations. Two novel multi-fidelity reduced order model methods based on proper orthogonal decomposition are proposed; Filtered Bi-Fidelity Adaptive Proper Orthogonal Decomposition (FB-POD) algorithm and Adapted Bi-Fidelity Proper Orthogonal Decomposition (AB-POD). These models are evaluated on two different test cases, and the balance between the accuracy of each multi-fidelity ROM and the computational cost, measured by the number of high-fidelity evaluations, is investigated. In specific cases, the proposed methods significantly reduce the number of high-fidelity evaluations compared to the single high-fidelity ROM, while yielding comparable accuracy. ...
The aim is to minimize the computational workload involved in constructing a reduced-order model during the offline phase. This is achieved by decreasing the number of high-fidelity model evaluations necessary for building the reduced order model while maintaining accurate results. To this end, the existing adaptive proper orthogonal decomposition algorithm is enhanced by employing multi-fidelity techniques. Multi-fidelity methods aim to combine large amount of low-fidelity data with a limited amount of high-fidelity data to compute accurate, yet computationally inexpensive approximations. Two novel multi-fidelity reduced order model methods based on proper orthogonal decomposition are proposed; Filtered Bi-Fidelity Adaptive Proper Orthogonal Decomposition (FB-POD) algorithm and Adapted Bi-Fidelity Proper Orthogonal Decomposition (AB-POD). These models are evaluated on two different test cases, and the balance between the accuracy of each multi-fidelity ROM and the computational cost, measured by the number of high-fidelity evaluations, is investigated. In specific cases, the proposed methods significantly reduce the number of high-fidelity evaluations compared to the single high-fidelity ROM, while yielding comparable accuracy.
To do so, first, the physical situation is translated into a mathematical model. Then, an optimization strategy for changing the buoyancy to optimally travel to a set location is constructed. The strategy is based on gradient descent and implemented in Python. Four different definitions of an optimal trajectory to a target location are considered, those are 1) any trajectory that leads to the target location, 2) the most time-efficient trajectory, 3) the most energy-efficient trajectory, and 4) a trajectory that is both time and energy-efficient.
The optimization strategy is tested for five different starting and target locations for a small spherical float in an idealized two-dimensional linear flow field. It is concluded that it is possible to use the optimization strategy to navigate a float using buoyancy changes for all four optimization objectives, although the current implementation is not efficient enough for targets far away.
The first objective of future research should be to increase the coding efficiency. Thereafter, other steps toward a more realistic situation can be taken, such as testing for non-linear flow fields, three-dimensional fields, and bigger floats.
...
To do so, first, the physical situation is translated into a mathematical model. Then, an optimization strategy for changing the buoyancy to optimally travel to a set location is constructed. The strategy is based on gradient descent and implemented in Python. Four different definitions of an optimal trajectory to a target location are considered, those are 1) any trajectory that leads to the target location, 2) the most time-efficient trajectory, 3) the most energy-efficient trajectory, and 4) a trajectory that is both time and energy-efficient.
The optimization strategy is tested for five different starting and target locations for a small spherical float in an idealized two-dimensional linear flow field. It is concluded that it is possible to use the optimization strategy to navigate a float using buoyancy changes for all four optimization objectives, although the current implementation is not efficient enough for targets far away.
The first objective of future research should be to increase the coding efficiency. Thereafter, other steps toward a more realistic situation can be taken, such as testing for non-linear flow fields, three-dimensional fields, and bigger floats.