Geisler, Jan · Rakhimberdiev, Eldar · Boom, Michiel P. · et al.
29 files · 124 MB · csv, shapefiledeclared
1. Many migratory birds now reach their Arctic breeding grounds earlier in order to keep pace with advancing springs and shifting nutrient peaks, either by departing earlier from non-breeding grounds or by travelling faster. For dark-bellied brent geese, there is limited potential to travel faster, as their migration to the Siberian breeding grounds is already among the fastest of Arctic geese and swans. Earlier departure would require reaching departure body mass earlier, either through a faster accumulation of energy stores during spring staging or via adjustments earlier in the annual cycle. 2. We examined long-term shifts in spring staging phenology and changes in winter and spring body mass trajectories of brent geese at the population level, with particular emphasis on the effects of winter temperature on body mass and spring body mass on departure timing. 3. We used more than five decades of body mass measurements from individuals caught in the United Kingdom and France, and in the Dutch Wadden Sea to reconstruct changes in spring and winter mass trajectories, respectively. These data were combined with over five decades of migration counts in the Netherlands and more than two decades of counts in Denmark to quantify changes in spring staging phenology. 4. We found that brent geese have not shifted their spring arrival in the Wadden Sea but have advanced departure timing. Furthermore, brent geese were heavier during and after milder winters, and have changed mass trajectories over recent decades. They no longer lose mass during winter and the second spring staging phase, and fuelling rates in the first spring staging phase have declined. Annual variation in body mass was not related to annual departure timing. 5. These results suggest that milder winters have relaxed energetic constraints and improved body condition in brent geese throughout the non-breeding season. Our findings highlight the importance of considering the full annual cycle when assessing how animals with limited capacity to adjust migration timing or speed respond to global change.
Im Datensatz "SARS-CoV-2-Sequenzdaten aus Deutschland" umfasst vollständige Virusgenomsequenzen sowie zugehörige Metadaten aus bundesweit erhobenen Proben. Die Proben werden in Zusammenarbeit vom IMSSC2-Labornetzwerk, dem Nationalen Referenzzentrum für Coronaviren an der Charité sowie dem RKI sequenziert und bioinformatisch analysiert. Der Datensatz ermöglicht eine fundierte molekular-epidemiologische Analyse der SARS-CoV-2-Ausbreitung in Deutschland und stellt eine zentrale Ressource für Forschung und öffentliche Gesundheitsüberwachung dar.
The files provided here contain examples of 1D, 2D, and coarse-grained systems that demonstrate Hamiltonian exchange within the Hamiltonian Replica Exchange Transition Interface Sampling (HRETIS) framework. The coarse-grained (MARTINI 3) path sampling simulations show the permeation of glutamine (P2-P5) and methionine (P2-C6) through a DPPC membrane at 323 K using GROMACS. These simulations can be resumed from the existing "restart.toml" files located in the following directories: CG/path_sampling_set_2/RETIS_main_1/infretis/ CG/path_sampling_set_2/HRETIS_75_1/infretis/ CG/path_sampling_set_2/RETIS_helper_1/infretis/ The command to continue a run using the infretis package (https://github.com/infretis/infretis) is: infretisrun -i restart.toml The simulations can also be started from scratch by copying the initial paths from: CG/path_sampling_set_2/initial_paths/ into the "infretis/load" directory of each simulation. After that, the run can be started with: infretisrun -i infretis.toml Additional information about running the 1D and 2D simulations, the directory structure, and the simulation input files is provided in the "readme.txt" file.
A historical map showing a segment of the boundaries of New Spain in c. 1800. This map is fully open to fellow researchers and is available in multiple open source formats (SHP, GPKG, GeoJSON).
A historical map of the boundaries of Prussia in c. 1795. This map is fully open to fellow researchers and is available in multiple open source formats (SHP, GPKG, GeoJSON).
This dataset contains original geomorphic mapping of surface fault traces along the Dixie Valley Fault (DVF) range front and piedmont zone, central Nevada, USA. Traces were mapped directly from a 1-m bare-earth lidar digital elevation model (DEM), using hillshade and slope-raster visualizations. This dataset accompanies the manuscript: Francescone, M., et al. (in review), LiDAR-Based Fault-Scarp Analysis and Rupture Hazard Assessment: Earthquake Scenarios of the Dixie Valley Fault System (Nevada, USA). See Section 3.1 ("Fault Trace Mapping") of the manuscript for full methodological details
Meekes, Lisa · Tabaro, Francesco · Bexkens, Michiel · et al.
41 files · 8.2 GB · csv, fasta, pdfdeclared
This record contains the Python software for PEPTiGEN, a tool for generating tryptic peptides from prokaryotic gene sequences and their variants, and the associated antimicrobial resistance (AMR) peptide database. The database is provided as an SQL file and a CSV file containing all genes and predicted peptides. The README file contains explanation of the PEPTiGEN tool. The SQL database schema files contains both the database schema of the SQL database used in the PEPTiGEN analysis as the database schema of the AMR peptide datbase.
Despite the proliferation of social vulnerability assessment methodologies, selecting the most appropriate model remains a critical challenge due to inter-model variability. To explore the inter-model variability, this study systematically investigated inter-algorithmic and inter-classification variability to assess how methodological design influences outcomes.
Mimet, Anne · Gourmemon, Damien · Amandine, Vergondy · et al.
14 files · 1.6 GB · shapefile, tiffdeclared
================================================================================ README ================================================================================ Dataset Title: Observation points, movement-proxy data, and high-resolution land cover map for the common blackbird ( Turdus merula ) in Angers, France Version: 1.0 Authors : Mimet, Anne ; Gourmelon Damien ; Oulhen, Thomas ; Vergondy, Amandine Date of biological data collection: Observation points : 15/05/2025 to 06/06/2025 Movement-proxy data : 19/04/2024 to 17/05/2024 -------------------------------------------------------------------------------- DESCRIPTION -------------------------------------------------------------------------------- This dataset contains observed presence/absence of blackbird flights across streets, as well as point observations of the common blackbird across Angers, France, during spring. The data were used to create a connectivity model for the common blackbird in Angers. The 68 point observations provided information on the land cover types used as a possible resource by the common blackbird. The presence/absence of flying blackbirds across 190 streets in Munich was used to derive the resistance of the urban landscape to the movement of common blackbirds in a landscape connectivity model. For the point observations, the presence and absence of the common blackbird was visually and acoustically confirmed after 5 minutes of observations within a radius of 25 m. Movement presence/absence was observed along 50 m street transects. Street transects were observed for 9 minutes, and the presence or absence of common blackbirds crossing this street was recorded. The observation points and movement-proxy data were selected along gradients of greenness and traffic density. -------------------------------------------------------------------------------- FILE LIST -------------------------------------------------------------------------------- 1. movement_proxy.shp Site-level data containing presence and absence of common blackbirds crossing the sampled streets, as well as covariates such as the number of pedestrians passing during the sampling period, geographic information, information on the weather, time of sampling, pseudonomized observer. Number of records: 190 Number of variables: 11 related files: movement_proxy.cpg, movement_proxy.dbf, movement_proxy.prj, movement_proxy.shp, movement_proxy.shx The related files are required because data is stored in a shapefile. For this shapefile to be correctly read by any GIS processing software, all related files need to be saved in the same folder. 2. point_observations.shp Site-level data containing presence and absence of common blackbirds at the observation points. Additionally, geographic and temporary information as well as information on the weather are provided. Number of records: 68 Number of variables: 10 related files: point_observations.cpg, point_observations.dbf, point_observations.prj, point_observations.shp, point_observations.shx The related files are required because data is stored in a shapefile. For this shapefile to be correctly read by any GIS processing software, all related files need to be saved in the same folder. 3. LULC_9Class_Angers.tif and assoociated qlm style file Land use and land cover map at 40 cm resolution for Angers. 3. README.txt This file. -------------------------------------------------------------------------------- VARIABLE DESCRIPTIONS: movement_proxy.shp -------------------------------------------------------------------------------- StreetCod Site identifier for street transect - these are the same sites as in the file Point_observations.shp (format: [text]) X Northing coordinate of the centre (latitude) (format: [degree]) Y Easting coordinate of the observation point (longitude) (format: [degree]) Obs Id of the observor (2 observors in the dataset) date Date of the observation (format [%d/%m/%y]) Daytime Starting time of observation (format: [text] hour%h%min) Windspeed Windspeed given by the mobile phone application « Accuweather » Temperatur Temperature at the time of observation in °C given by the mobile phone application « Accuweather » Pedestrian Number of pedestrians combined passing by during the time of observation CarDensity Number of cars counted on a 3-min period FlyBbird Number of common blackbirds Turdus merula that crossed the street transect during the time of observation (9 min). Every crossing event was counted. When the same individual crossed 2 times, it was counted 2 times -------------------------------------------------------------------------------- VARIABLE DESCRIPTIONS: point_observations.shp -------------------------------------------------------------------------------- StreetCod Site identifier for street transect - this are the same sites as in the file movement_proxy.shp (format: [text]) X Northing coordinate of observation point (latitude) (format: [degree]). Y Easting coordinate of the observation point (longitude) (format: [degree]) Obs Id of the observor (1 in this dataset) date Date of the observation (format [%d/%m/%y]) Daytime Starting time of observation (format: [text] hour%h%min) Windspeed Windspeed given by the mobile phone application « Accuweather » Temperatur Temperature at the time of observation in °C given by the mobile phone application « Accuweather » AbBlackb Number of common blackbirds Turdus merula that were detected by sight or sound during the 5-min observatin période, over a radius of 25 m. PABlackb Presence-Absence of observed blackbirds derived from the abundance. -------------------------------------------------------------------------------- VARIABLE DESCRIPTIONS: LULC_9Class_Angers.tif -------------------------------------------------------------------------------- 11 : Buildings < 5m 12 : Buildings 5-10m 13 : Buildings 10-18m 14 : Buildings > 18m 20 : Sealed areas 31 : vegetation < 1m 32 : Vegetation 1-3m 33 : Vegetation > 3m 40 : Farmland 50 : Bare soil 60 : Water -------------------------------------------------------------------------------- METHODS SUMMARY -------------------------------------------------------------------------------- Site Selection for Movement-Proxy Data: - 190 sites selected via stratified random sampling across vegetation cover (computed in a radius of 300m around the points) and traffic density (derived from TomTom navigation data for October 2022) - Observations along 50 m street transects - Detection of presence/absence of common blackbirds crossing the sampled streets Site Selection for Point Observations: - 68 sites selected via stratified random sampling across vegetation cover (computed in a radius of 300m around the points) and traffic density (derived from TomTom navigation data for October 2022) - Visual and acoustic detection of presence/absence of common blackbirds within a 25 m radius LULC map: Derived from land cover information from CoSIA (IGN 2023a), refined with a digital terrain model (IGN 2020) and height model (IGN 2023b) to extract building and vegetation height classes. -------------------------------------------------------------------------------- RELATED PUBLICATIONS -------------------------------------------------------------------------------- Lisa Merkens*, Meret Pundsack*, Anne Mimet*, Damien Gourmelon, Wolfgang W. Weisser. City-specific or generalisable resistances? An urban animal connectivity model performs better when parameterised from two cities. Preprint Submitted to Urban Ecosystems -------------------------------------------------------------------------------- FUNDING -------------------------------------------------------------------------------- Région Pays de la Loire through the PULSAR project VitalConnect (2024_05894 ) -------------------------------------------------------------------------------- LICENSE -------------------------------------------------------------------------------- This dataset is licensed under the Creative Commons Attribution 4.0 International License (CC-BY 4.0). You are free to: - Share: copy and redistribute the material in any medium or format - Adapt: remix, transform, and build upon the material for any purpose Under the following terms: - Attribution: You must give appropriate credit, provide a link to the license, and indicate if changes were made. Full license text: https://creativecommons.org/licenses/by/4.0/ -------------------------------------------------------------------------------- CITATION -------------------------------------------------------------------------------- If you use this dataset, please cite both the dataset and the associated publication: Dataset: Mimet, A., Gourmelon, D, Oulhen, T., Vergondy, A. (2026) Observation points, movement-proxy data, and high-resolution land cover map for the common blackbird (Turdus merula) in Angers, France [Dataset]. Zenodo. Publication: Lisa Merkens*, Meret Pundsack*, Anne Mimet*, Damien Gourmelon, Wolfgang W. Weisser. City-specific or generalisable resistances? An urban animal connectivity model performs better when parameterised from two cities. Preprint Submitted to Urban Ecosystems -------------------------------------------------------------------------------- CONTACT -------------------------------------------------------------------------------- Anne Mimet Université d'Angers Laboratoire BiodivAG, DEP ENS SCIENCES Biologie, UFR SCIENCES 2 Boulevard de Lavoisier, F-49045 Angers, France Email: anne.mimet@univ-angers.fr ORCID: 0000-0001-9498-436X ================================================================================ END OF README ================================================================================
This dataset is available at doi: 10.5281/zenodo.21125584 and builds on top of the slightly smaller dataset previously published at doi: 10.5281/zenodo.19842646 . In this archive, we provide the complete data and code needed to reproduce the experiments discussed in the paper Benchmarking Permutation-based Encodings and Metaheuristics for the Traveling Tournament Problem . The Traveling Tournament Problem (TTP) asks us to organize a tournament where N teams compete with each other in a fair and efficient way. We focus on the double round robin (2RR) flavor of this problem, where each team plays twice against each other team, once at home and once away, i.e., at the stadium of the other team. Here, efficient means to reduce the total travel length summed up over all teams. The fairness aspect is embodied in constraints that prevent any team from having more than three consecutive home and away games, from two teams playing each other twice in a row, and that enforce a compact 2RR schedule. We approach the TTP using two different permutation-based encodings under diverse metaheuristics, ranging from randomized local search (RLS), RLS with Frequency Fitness Assignment (FFA), Simulated Annealing (SA), two hybrid algorithms combining local search with FFA, and NSGA-II. The experiments take a very long time to conduct, so there are several different steps that can be taken separately to reproduce them to different degrees. All the data elements are packaged in files of the format tar . xz . Under Linux, you can unpack them using tar -xf archive.tar.xz where archive is to be replaced with the archive name. Under Windows, you would probably use a tool like WinRAR . In this updated dataset, we only provide additional runs for some setups and a slightly updated evaluator program. Most of the runs of the algorithms as well as the algorithm implementations have not changed and are already given in doi: 10.5281/zenodo.19842646 . We use the moptipy package to run the experiments. For the experiment, we use some algorithms already provided in that package. We use the moptipy -API for them and we also use it to evaluate the raw data generated by the experiments and to create the plots. We use the moptipyapps package, which provides the benchmark instances, data structures, and components needed for the TTP. Therefore, we provide the related versions of these packages in the file software.tar.xz , although they are available both on GitHub and PyPI. Just to be sure. In our paper, we present two experiments. The main "Experiment 1" applies the algorithms to the TTP. The side-dish "Experiment 2" investigates the runtimes and results of the two different encodings. Experiment 1 The raw data of the experiments can be found in folder main/results presented compressed as two files, main_results_1.tar.xz and main_results_2.tar.xz . They contain the data for the first and second encoding, respectively. Only main_results_2.tar.xz is part of this new dataset, the rest of the raw data is already provided in doi: 10.5281/zenodo.19842646 . This data is quite big. We have over 11'000 files that together make up over 80.1 GB of data in total. You can unpack the files and they will create the folders main/results/gameEncoding_1 and main/results/gameEncoding_2 , respectively. The folder structure below these root folders follows the pattern algorithm/instance/algorithm_instance_randseed.txt . Since we use moptipy to execute our experiments, the folder structure and the exact structure of the log files, which contain all improving steps that the algorithms too, the algorithm setup, the system configuration, as well as the final best discovered solution, follows the specification given in: T. Weise and Z. WU: Replicable Self-Documenting Experiments with Arbitrary Search Spaces and Algorithms. Genetic and Evolutionary Computation Conference Companion (GECCO'2023) Companion, July 15-19, 2023, Lisbon, Portugal, pages 1891-1899. New York, NY, USA: ACM. doi: 10.1145/3583133.3596306 . Expanding upon that, we generate all random seeds in a deterministic manner per instance and all algorithms use the same seeds. This makes cheery picking impossible and our experiments can be replicated also using different implementations of algorithms even in different programming languages. The source code of the algorithm implementations is part of moptipy for the algorithms except for the temperature schedule used with SA, which is provided in folder main/sources packaged as main_sources.tar.xz . There are two experiment execution scripts: run_encoding_1.py for the first encoding and run_encoding_2.py for the second encoding. They can also be found in that folder. With them, you can exactly replicate the contents of the results folder (but your log files would contain other time stamps, system configurations, etc.). Be aware that doing this would take a very very long time. The experiment script will execute the runs in a random order. So you could go and start it, wait for some runs to complete, and compare them with the corresponding log files of the same name and path in our main/results folder. Their content, at least the improving steps and final solutions, should be the same. Then you could start the experiment again, get some other runs, and do the same. This way, you can verify that our data is genuine. Of course, you need to have the right version of the open source packages moptipy and moptipyapps for that, which we will describe later on. If you have all the data in the main/results folder, you can execute the scripts in the main/evaluator folder (using again the right version of moptipy and moptipyapps ), which are contained in file main_evaluator.tar.xz . Then this will produce the figures and tables that we are having in the paper. This output is contained in folder main/evaluation provided in main_evaluation.tar.xz , but you can also re-create it by yourself. Algorithms The following algorithms are implemented and used in the main experiment: RLS : The randomized local search flips swaps two elements of a permutation. The algorithm is implemented as class RLS . The search operator is given in class Op1Swap2 . The results are given in folder main/results/*/rls_swap2 . FRLS : The randomized local search algorithm RLS , but using Frequency Fitness Assignment. Using this algorithm is like using RLS above, but we replace class RLS with class FEA1plus1 . The results are in folder main/results/*/fea1p1_swap2 . EAFEA A : A hybrid algorithm executing the RLS and the FRLS in an alternating fashion: First one objective function evaluation (FE) of the RLS , then one of the FRLS , then again one of the RLS , and so on. If the FRLS discovers a solution with frequency-value 1, it will copy it to the RLS , thereby overwriting this algorithm's current solution. This is implemented in class EAFEAA . The results are in folder main/results/*/eafeaa_swap2 . EAFEA B : A hybrid algorithm executing the RLS and the FRLS in an alternating fashion: First one objective function evaluation (FE) of the RLS , then one of the FRLS , then again one of the RLS , and so on. If the FRLS discovers a solution which is better or equally good as the current solution of the RLS -strand, it will copy it to the RLS , thereby overwriting this algorithm's current solution. This is implemented in class EAFEAB . The results are in folder main/results/*/eafeab_swap2 . Simulated Annealing (several setups): Several optimized setups of the classical Simulated Annealing, using adaptive temperature schedules. This is implemented in class SimulatedAnnealing . The adaptive temperature schedules are implemented in a class provided directly in the experiment execution scripts previously mentioned. The results are in the folders of the format main/results/*/sa**_swap2 , where ** stands for the different adaptive temperature schedule definitions. Benchmark Problems We apply the algorithms to the compact 2RR instances of RobinX , which can be found at https://robinxval.ugent.be/RobinX/travelRepo.php and are also implemented in moptipyapps We generally have at least 4 runs for each algorithm on each benchmark problem. For some problems and algorithm combinations, we have more runs for historical reasons. However, to ensure absolute fairness between the algorithms, we only use 4 runs in this case, too, in our evaluation. More precisely, for each problem, we use the data generated by the runs using the same 4 random seeds for each algorithm. The runs take a long time, since we provide them with a budget of 10 9 objective function evaluations (FEs). 4 runs are not much, but over all the instances and based on the numerical results, the outcomes are still quite clear. However, for the sake of completeness, for the interested reader, and maybe for our own future work, we include all runs for all algorithms that we have. This means that, if for some algorithm/instance combination we actually have more runs, we include those in the archives main_results_1.tar.xz and main_results_2.tar.xz (depending on to which encoding they belong). Even though they are not used in the evaluation. Using them in the evaluation would also not change the conclusions in any way, as far as we can see here. Still, fairness is fairness and we try to do a good job to be fair here. External Libraries To run and to evaluate our experiments, you need to install the open source library moptipy . For evaluating, you may use a later, more current version. The required library and its dependencies can be installed from PyPI , via pip install moptipy moptipyapps . To be on the safe side, we included the libraries in the archive software.tar.xz , which unpacks into software . We include the current state of the libraries on GitHub, as well as several historical versions that were used in our experiments. Since our experiments span multiple years, the software has developed further - the code design remains such that even the versions today would produce exactly the same results as those used in the experiments. Reproducing the Experiment We include the following parts of our experiment: The folder main/sources (packaged as main_sources.tar.xz ) contains the Python sources needed to run the experiment. The folder main/results (packaged as main_results_1.tar.xz and main_results_2.tar.xz ) contains the results folder, i.e., all the log files that will be produced if the experiment is executed. If you would run the experiment again, you would get exactly these files, but maybe with different time stamps and different system configuration data. But the objective values/objective function evaluation indices would be exactly the same. Running the experiment takes a long, long time. The folder main/evaluator (packaged as main_evaluator.tar.xz ) contains the evaluator code. These programs are executed after the experiment completes. They load the results from the results folder and extract the evaluation-relevant data. They produce the figures and tables in our paper. The folder main/evaluation is the output folder of the evaluator. It contains the figures and tables in our paper. Reproducing the Raw Data / Log Files To reproduce the raw data, you need to perform the following steps. Unpack main_sources.tar.xz to some folder, let's call it A . Open a terminal and cd into folder A/main/sources . Make sure that you have moptipy and moptipyapps of a compatible version installed. If not, you can either do pip install moptipy moptipyapps . Ideally you should do this in a virtual environment. Discussing how to set up virtual environments and install packages in them goes beyond the scope here, so we refer to https://docs.python.org/3/library/venv.html . Run python3 run_encoding_1.py . Stop it when you have sufficiently many runs with the first encoding. Run python3 run_encoding_2.py . Stop it when you have sufficiently many runs with the second encoding. This will automatically create a folder A/main/results , which will eventually have the same contents as provided by the archives main_results_1.tar.xz and main_results_2.tar.xz . Notice, though, that this takes a very long time even for two runs per setting. We run 1'000'000'000 FEs per run, for several algorithms, over many problems... Reproducing the Evaluation Steps If you either already have the raw data reproduced or have unpacked our main_results_1.tar.xz and main_results_2.tar.xz files, then you can reproduce the evaluation. Unpack evaluator.tar.xz to some folder, let's call it A . Open a terminal and cd into folder A/main/evaluator . Make sure that you have moptipy and moptipyapps of a compatible version installed. If not, you can either do pip install moptipy moptipyapps . Ideally you should do this in a virtual environment. Discussing how to set up virtual environments and install packages in them goes beyond the scope here, so we refer to https://docs.python.org/3/library/venv.html . Run the evaluator.py scripts in the folder A/main/evaluator , in order to create figures and tables. If you perform these steps, then the output collected in your folder A/main/evaluation should be exactly the same as the data we provide in archive evaluation.tar.xz . It should contain the figures and tables provided in our paper. Experiment 2 The second experiment in our work is basically structured exactly like the first one. Here, the goal simply is to figure out how long the two different encodings need and how many different solutions they produce. This experiment can be executed and evaluation in about a hour or two. We include the complete experiment in archive encoding.tar.xz which unpacks the folder encoding . Therein are the files needed to execute the experiment (in folder sources ), the results/output (in folder results ), the scripts to evaluate the results (in folder sources again), and the evaluation result, i.e., data and figures used in our paper (in folder evaluation ). To reproduce this experiment, you can follow the steps discussed above for the first experiment.
A historical map of the boundaries of the Kazakh Steppe in c. 1848. This map is fully open to fellow researchers and is available in multiple open source formats (SHP, GPKG, GeoJSON).
Akandil, Cengiz · Plekhanova, Elena · Rietze, Nils · et al.
33 files · 1.2 GB · csv, shapefile, tiffdeclared
This repository contains the processed datasets used to analyse the spatial relationship between artificial light at night (ALAN) and Arctic fire occurrence. The dataset includes cumulative ALAN layers, binary masked ALAN layers, fire polygon shapefiles, and a final analysis table. The cumulative ALAN layers provide aggregate digital number (DN) values representing light intensity. The masked ALAN layers are binary rasters, where values of 1 indicate lit areas and values of 0 indicate unlit areas. Fire scar centroids were generated from the fire polygons and used to calculate the distance from each fire scar to the nearest lit area. The final analysis table contains the distance to the nearest lit area for each fire scar and control points. The fire polygon shapefile includes fire scars for the period 2001-2013.
This deliverable presents the Phase 2 results of the BioProWRAP project, developed under the CLIMAAX framework, and focuses on enriching the initial wildfire‑risk assessment of Phase 1 through the integration of drought risk-an interconnected hazard with potential cascading effects-alongside diverse local datasets and live biodiversity inputs (crowdsourcing observations and eDNA). Phase 2 also enhances public engagement and inclusion through educational workshops and guided excursions in the three high‑risk, high‑value areas identified in Phase 1. The work was carried out by the REMTH team with continued scientific support from UTH, Greece.
The files in this archive accompany the paper "GPU Porting of the ICON Ocean Model: Performance and Possibilities for Submesoscale Climate Simulations" from Dominik Zobel, Nils Brüggemann, Helmuth Haak, Leonidas Linardakis and Peter Korn (submitted to JAMES 2026). The directory structure is as follows - 01_source_code : ICON code version used to conduct the experiments - 02_configuration : Details about configuring and building ICON - 03_scripts_and_results : Scripts, log files and results from relevant runs
Diehl, Martin · Eisenlohr, Philip · Roongta, Sharan · et al.
2 files · 56 MB · xz, zipdeclared
DAMASK® is a unified multi-physics crystal plasticity simulation package. The solution of continuum mechanical boundary value problems requires a constitutive response that connects deformation and stress at each material point. This problem is solved in DAMASK on the basis of crystal plasticity using a variety of constitutive models and homogenization approaches. However, treating mechanics in isolation is no longer sufficient to study emergent advanced high-strength materials. In these materials, deformation happens interrelated with displacive phase transformation, significant heating, and potential damage evolution. Therefore, DAMASK is capable of handling multi-physics problems. Following a modular approach, additional field equations are solved in a fully coupled way using a staggered approach.