cometadata/datacite-titles-descriptions-related-identifiers huggingface dataset:
DOI: 10.5281/zenodo.10547237
title: Saint James' Way to Santiago de Compostela

description: The Way of St. James or St. James' Way (Caminho de Santiago, Camino de Santiago, Chemin de St-Jacques, Jakobsweg) is the pilgrimage route to the Cathedral of Santiago de Compostela in Galicia in northwestern Spain.

Saint James’ Way to Santiago de Compostela by Nelson Gonçalves (Alfobre.com), available under a Creative Commons Attribution 4.0 International (http://creativecommons.org/licenses/by/4.0) at A-GeoCat (https://projetoalfobre.github.io/a-geocat/). This work is based on data by Turismo de Galicia shared under Creative Commons BY 3.0 ES - Atribución 3.0 España & by VagaMundos.pt
description: Dataset includes several pilgrimage routes:



French way

Portuguese way

Portuguese Coastal Way

Primitive Way

English Way


 

Original sources

Abert@s: Portal Open Data da Xunta de Galicia



https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0076/ruta-camino-primitivo

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0391/ruta-camino-portugues-costa

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0049/ruta-camino-ingles

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0256/ruta-camino-portugues

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0004/ruta-camino-frances


VagaMundos.pt



https://www.vagamundos.pt/mapas-do-caminho-de-santiago/ (Caminho Francês de Santiago, Caminho Português de Santiago, Caminho Português da Costa e Caminho de Santiago Primitivo)
DOI: 10.5281/zenodo.10547238
title: Saint James' Way to Santiago de Compostela

description: The Way of St. James or St. James' Way (Caminho de Santiago, Camino de Santiago, Chemin de St-Jacques, Jakobsweg) is the pilgrimage route to the Cathedral of Santiago de Compostela in Galicia in northwestern Spain.

Saint James’ Way to Santiago de Compostela by Nelson Gonçalves (Alfobre.com), available under a Creative Commons Attribution 4.0 International (http://creativecommons.org/licenses/by/4.0) at A-GeoCat (https://projetoalfobre.github.io/a-geocat/). This work is based on data by Turismo de Galicia shared under Creative Commons BY 3.0 ES - Atribución 3.0 España & by VagaMundos.pt
description: Dataset includes several pilgrimage routes:



French way

Portuguese way

Portuguese Coastal Way

Primitive Way

English Way


 

Original sources

Abert@s: Portal Open Data da Xunta de Galicia



https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0076/ruta-camino-primitivo

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0391/ruta-camino-portugues-costa

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0049/ruta-camino-ingles

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0256/ruta-camino-portugues

https://abertos.xunta.gal/catalogo/cultura-ocio-deporte/-/dataset/0004/ruta-camino-frances


VagaMundos.pt



https://www.vagamundos.pt/mapas-do-caminho-de-santiago/ (Caminho Francês de Santiago, Caminho Português de Santiago, Caminho Português da Costa e Caminho de Santiago Primitivo)
DOI: 10.5281/zenodo.10552607
title: Roman road system in Portugal

description: This dataset is a compilation of data collected by Soutinho, P. (2019).

Road network used in the Roman period. Dataset includes roads/ways but also information about milestones, bridges, vici, villae, etc. 

Roman road system in Portugal by Nelson Gonçalves (Alfobre.com), available under a Creative Commons Attribution 4.0 International (http://creativecommons.org/licenses/by/4.0) at A-GeoCat (https://projetoalfobre.github.io/a-geocat/). This work is based on data by Soutinho, P. (2019), Vias Romanas em Portugal; available at www.viasromanas.pt
description: This data was harvested a while ago (12/4/2019). Meanwhile, the original data has been updated several times but there’s no free/open access, you need to contact the original author.

 

Original sources

Original data was harvested from website Vias Romanas em Portugal (Portuguese roman ways).

Original datasets by Soutinho, P. (2019), Vias Romanas em Portugal; available at www.viasromanas.pt (Retrieved 12-04-2019)
DOI: 10.5281/zenodo.10552608
title: Roman road system in Portugal

description: This dataset is a compilation of data collected by Soutinho, P. (2019).

Road network used in the Roman period. Dataset includes roads/ways but also information about milestones, bridges, vici, villae, etc. 

Roman road system in Portugal by Nelson Gonçalves (Alfobre.com), available under a Creative Commons Attribution 4.0 International (http://creativecommons.org/licenses/by/4.0) at A-GeoCat (https://projetoalfobre.github.io/a-geocat/). This work is based on data by Soutinho, P. (2019), Vias Romanas em Portugal; available at www.viasromanas.pt
description: This data was harvested a while ago (12/4/2019). Meanwhile, the original data has been updated several times but there’s no free/open access, you need to contact the original author.

 

Original sources

Original data was harvested from website Vias Romanas em Portugal (Portuguese roman ways).

Original datasets by Soutinho, P. (2019), Vias Romanas em Portugal; available at www.viasromanas.pt (Retrieved 12-04-2019)
DOI: 10.5281/zenodo.10641332
title: Data from: An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles

description:  Data from: An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles

- Authors: Pedro Jimenez, Luis Chacon, Mario Merino

- Contact email: pejimene@ing.uc3m.es

- Date: 2024-02-09

- Keywords: electric propulsion, plasma simulation, magnetic nozzles, implicit particle-in-cell (PIC)

- Version: 1.2

- Digital Object Identifier (DOI): 10.5281/zenodo.8081962

- License: This dataset is made available under the Open Data Commons Attribution License

Abstract

This dataset contains the data found in the plots of the journal article:

Pedro Jimenez, Luis Chacon, Mario Merino, "An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles"

The data in this repository are the results of kinetic plasma simulations as described in the reference. For further information on the setup for the simulation please refer to the article.

Data Files

The data files are in .csv format. They were produced in Julia using CSV.jl and DataFrames.jl libraries.

The files are organised following the order of the figures in the article. All the plots are 1D series, the first column corresponding to the x-axis data. Y-axis data is presented in the following columns, the total number of additional columns is equal to the number of line series. The title of each series is found in the first row of the .csv files. Please find below some specificalities in certain figures:

- The columns for the time evolution in fig6_left.csv and fig6_right.csv (corresponding to the actual left and right columns in the figure i.e. cases A and B) contain a field tag followed by the corresponding time step (e.g. phi_500).

- Due to the different number of nodes, steady state fields for cases A and B are saved in fig8_a-f.csv while cases AF and BF are saved in fig8_a-f_fine.csv.

The rest of the data files should be self descripting

Citation

Any works using this dataset or any part of it in any form shall cite it as follows:

The prefered means of citation is to reference the publication asociated to the jounal article with DOI: 10.1016/j.jcp.2024.112826

The BibTex is also provided for the sake of convinience:

@article{jimenez2024implicit,
  title={An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles},
  author={Jim{\'e}nez, Pedro and Chac{\'o}n, Luis and Merino, Mario},
  journal={Journal of Computational Physics},
  pages={112826},
  year={2024},
  publisher={Elsevier}
}

Optionally the dataset can be cited by referencing the corresponding DOI:

https://doi.org/10.5281/zenodo.8081962

Acknowledgments

This dataset was created by the [ERC-ZARATHUSTRA project](https://erc-zarathustra.uc3m.es/).

The ERC-ZARATHUSTRA project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 950466).
DOI: 10.5281/zenodo.8081962
title: Data from: An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles

description:  Data from: An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles

- Authors: Pedro Jimenez, Luis Chacon, Mario Merino

- Contact email: pejimene@ing.uc3m.es

- Date: 2024-02-09

- Keywords: electric propulsion, plasma simulation, magnetic nozzles, implicit particle-in-cell (PIC)

- Version: 1.2

- Digital Object Identifier (DOI): 10.5281/zenodo.8081962

- License: This dataset is made available under the Open Data Commons Attribution License

Abstract

This dataset contains the data found in the plots of the journal article:

Pedro Jimenez, Luis Chacon, Mario Merino, "An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles"

The data in this repository are the results of kinetic plasma simulations as described in the reference. For further information on the setup for the simulation please refer to the article.

Data Files

The data files are in .csv format. They were produced in Julia using CSV.jl and DataFrames.jl libraries.

The files are organised following the order of the figures in the article. All the plots are 1D series, the first column corresponding to the x-axis data. Y-axis data is presented in the following columns, the total number of additional columns is equal to the number of line series. The title of each series is found in the first row of the .csv files. Please find below some specificalities in certain figures:

- The columns for the time evolution in fig6_left.csv and fig6_right.csv (corresponding to the actual left and right columns in the figure i.e. cases A and B) contain a field tag followed by the corresponding time step (e.g. phi_500).

- Due to the different number of nodes, steady state fields for cases A and B are saved in fig8_a-f.csv while cases AF and BF are saved in fig8_a-f_fine.csv.

The rest of the data files should be self descripting

Citation

Any works using this dataset or any part of it in any form shall cite it as follows:

The prefered means of citation is to reference the publication asociated to the jounal article with DOI: 10.1016/j.jcp.2024.112826

The BibTex is also provided for the sake of convinience:

@article{jimenez2024implicit,
  title={An implicit, conservative electrostatic particle-in-cell algorithm for paraxial magnetic nozzles},
  author={Jim{\'e}nez, Pedro and Chac{\'o}n, Luis and Merino, Mario},
  journal={Journal of Computational Physics},
  pages={112826},
  year={2024},
  publisher={Elsevier}
}

Optionally the dataset can be cited by referencing the corresponding DOI:

https://doi.org/10.5281/zenodo.8081962

Acknowledgments

This dataset was created by the [ERC-ZARATHUSTRA project](https://erc-zarathustra.uc3m.es/).

The ERC-ZARATHUSTRA project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 950466).
DOI: 10.5281/zenodo.10641408
title: Coccolithophore allometric POC scaling dataset
DOI: 10.5281/zenodo.10641407
title: Coccolithophore allometric POC scaling dataset
DOI: 10.5281/zenodo.10641412
title: Data to form periodic lossless ternary seeds of maximum weight (Part 1)

description: Data to form periodic lossless ternary seeds of maximum weight.

Detailed information can be found in the GitHub project (https://github.com/vtman/perlotSeeds). Codes to generate periodic blocks (binary and ternary) can also be found there.

Binary seeds can have only two symbols (0 = "do not care" = "_" or 1 = "match" = "#"). The length of a seed is the number of its elements, weight of a seed is the number of its 1-elements. The goal is to find seeds of maximum weight, so they can be used when there are two strings with a given number of mismatches. It is observed that in many cases these seeds of maximum weight have a periodic structure: the same block is repeated multiple times + its remainder. Blocks for binary seeds can be found with the help of the PerFSeeB project (https://github.com/vtman/PerFSeeB). These blocks have the maximum possible weight. 

In genetics, we have four symbols in sequences (A, C, G, T). However, the chance of having a pointwise mutation is not the same for any pairs. A transition mutation (A ↔ G or C ↔ T) is often twice higher than a transversion mutation (A ↔ C, A ↔ T, G ↔ C, G ↔ T). Transition-constrained seeds use ternary alphabet {#, @, _} where @ is for a match or a transition mismatch. To generate ternary seeds, we first need to generate ternary blocks. These ternary blocks can be found when we use binary blocks. However, sometimes, we need to use binary blocks for less than the maximum weight.

BinaryDataLevel.zip contains binary blocks (mostly of maximum weight, but 1/5 are for smaller weights (less than one and a couple of blocks than two)). 

Files T1V1.zip, T1V2.zip,..., and T8V1.zip contain ternary blocks in binary format. T4V2.zip and T7V2.zip are in the other dataset.

File bestTernary.zip contains ternary seeds of maximum weight (calculated as the number of # symbols + half of @ symbols)
DOI: 10.5281/zenodo.8370908
title: Data to form periodic lossless ternary seeds of maximum weight (Part 1)

description: Data to form periodic lossless ternary seeds of maximum weight.

Detailed information can be found in the GitHub project (https://github.com/vtman/perlotSeeds). Codes to generate periodic blocks (binary and ternary) can also be found there.

Binary seeds can have only two symbols (0 = "do not care" = "_" or 1 = "match" = "#"). The length of a seed is the number of its elements, weight of a seed is the number of its 1-elements. The goal is to find seeds of maximum weight, so they can be used when there are two strings with a given number of mismatches. It is observed that in many cases these seeds of maximum weight have a periodic structure: the same block is repeated multiple times + its remainder. Blocks for binary seeds can be found with the help of the PerFSeeB project (https://github.com/vtman/PerFSeeB). These blocks have the maximum possible weight. 

In genetics, we have four symbols in sequences (A, C, G, T). However, the chance of having a pointwise mutation is not the same for any pairs. A transition mutation (A ↔ G or C ↔ T) is often twice higher than a transversion mutation (A ↔ C, A ↔ T, G ↔ C, G ↔ T). Transition-constrained seeds use ternary alphabet {#, @, _} where @ is for a match or a transition mismatch. To generate ternary seeds, we first need to generate ternary blocks. These ternary blocks can be found when we use binary blocks. However, sometimes, we need to use binary blocks for less than the maximum weight.

BinaryDataLevel.zip contains binary blocks (mostly of maximum weight, but 1/5 are for smaller weights (less than one and a couple of blocks than two)). 

Files T1V1.zip, T1V2.zip,..., and T8V1.zip contain ternary blocks in binary format. T4V2.zip and T7V2.zip are in the other dataset.

File bestTernary.zip contains ternary seeds of maximum weight (calculated as the number of # symbols + half of @ symbols)
DOI: 10.5281/zenodo.8370909
title: Data to form periodic lossless ternary seeds of maximum weight (Part 1)

description: Data to form periodic lossless ternary seeds of maximum weight.<br> <br> Detailed information can be found in the GitHub project (https://github.com/vtman/perlotSeeds). Codes to generate periodic blocks (binary and ternary) can also be found there.<br> <br> Binary seeds can have only two symbols (0 = "do not care" = "_" or 1 = "match" = "#"). The length of a seed is the number of its elements, weight of a seed is the number of its 1-elements. The goal is to find seeds of maximum weight, so they can be used when there are two strings with a given number of mismatches. It is observed that in many cases these seeds of maximum weight have a periodic structure: the same block is repeated multiple times + its remainder. Blocks for binary seeds can be found with the help of the PerFSeeB project (https://github.com/vtman/PerFSeeB). These blocks have the maximum possible weight. <br> <br> In genetics, we have four symbols in sequences (A, C, G, T). However, the chance of having a pointwise mutation is not the same. for any pairs. A <strong>transition</strong> mutation (A ↔ G or C ↔ T) is often twice higher than a <strong>transversion</strong> mutation (A ↔ C, A ↔ T, G ↔ C, G ↔ T). Transition-constrained seeds use ternary alphabet {<strong>#</strong>, <strong>@</strong>, <strong>_</strong>} where <strong>@</strong> is for a match or a transition mismatch. To generate ternary seeds we first need to generate ternary blocks. These ternary blocks can be found when we use binary blocks. However, sometimes we need to use binary blocks for less than the maximum weight.<br> <br> BinaryDataLevel.zip contains binary blocks (mostly of maximum weight, but 1/5 are for smaller weights (less than one and a couple of blocks than two)). <br> <br> Files T1V1.zip, T1V2.zip,..., and T8V1.zip contain ternary blocks in binary format. T2V4.zip and T2V7.zip are in the other dataset.<br> <br> File bestTernary.zip contains ternary seeds of maximum weight (calculated as the number of # symbols + half of @ symbols)
DOI: 10.5281/zenodo.8395215
title: Data to form periodic lossless ternary seeds of maximum weight (Part 1)

description: Data to form periodic lossless ternary seeds of maximum weight.<br> <br> Detailed information can be found in the GitHub project (https://github.com/vtman/perlotSeeds). Codes to generate periodic blocks (binary and ternary) can also be found there.<br> <br> Binary seeds can have only two symbols (0 = "do not care" = "_" or 1 = "match" = "#"). The length of a seed is the number of its elements, weight of a seed is the number of its 1-elements. The goal is to find seeds of maximum weight, so they can be used when there are two strings with a given number of mismatches. It is observed that in many cases these seeds of maximum weight have a periodic structure: the same block is repeated multiple times + its remainder. Blocks for binary seeds can be found with the help of the PerFSeeB project (https://github.com/vtman/PerFSeeB). These blocks have the maximum possible weight. <br> <br> In genetics, we have four symbols in sequences (A, C, G, T). However, the chance of having a pointwise mutation is not the same for any pairs. A <strong>transition</strong> mutation (A ↔ G or C ↔ T) is often twice higher than a <strong>transversion</strong> mutation (A ↔ C, A ↔ T, G ↔ C, G ↔ T). Transition-constrained seeds use ternary alphabet {<strong>#</strong>, <strong>@</strong>, <strong>_</strong>} where <strong>@</strong> is for a match or a transition mismatch. To generate ternary seeds, we first need to generate ternary blocks. These ternary blocks can be found when we use binary blocks. However, sometimes, we need to use binary blocks for less than the maximum weight.<br> <br> BinaryDataLevel.zip contains binary blocks (mostly of maximum weight, but 1/5 are for smaller weights (less than one and a couple of blocks than two)). <br> <br> Files T1V1.zip, T1V2.zip,..., and T8V1.zip contain ternary blocks in binary format. T4V2.zip and T7V2.zip are in the other dataset.<br> <br> File bestTernary.zip contains ternary seeds of maximum weight (calculated as the number of # symbols + half of @ symbols)
DOI: 10.5281/zenodo.10641353
title: Portuguese military bases during the Portuguese Colonial War

description: Locations of portuguese military bases in Guinea-Bissau, Angola, Mozambique during colonial war as published by official military reports.

This dataset is a compilation of the charts published by:

Comissão para o estudo das Campanhas de África (1989). Resenha histórico-militar das campanhas de África (1961-1974), vol.2 Dispositivo da nossas forças: Angola. Lisboa : Estado Maior do Exército. https://cld.pt/dl/download/690812b2-d8f5-4ca6-bf2e-ae032b4f50a1/00_CECA/Volume%202%20-%20Dispositivo%20das%20Nossas%20For%C3%A7as%20Angola.pdf

Comissão para o estudo das Campanhas de África (1989). Resenha histórico-militar das campanhas de África (1961-1974), vol.3 Dispositivo da nossas forças: Guiné. Lisboa : Estado Maior do Exército. https://cld.pt/dl/download/690812b2-d8f5-4ca6-bf2e-ae032b4f50a1/00_CECA/Volume%203%20-%20Dispositivo%20das%20Nossas%20For%C3%A7as%20Guin%C3%A9.pdf (2)

Comissão para o estudo das Campanhas de África (1989). Resenha histórico-militar das campanhas de África (1961-1974), vol.4 Dispositivo da nossas forças: Moçambique. Lisboa: Estado Maior do Exército. https://cld.pt/dl/download/690812b2-d8f5-4ca6-bf2e-ae032b4f50a1/00_CECA/Volume%204%20-%20Dispositivo%20das%20Nossas%20For%C3%A7as%20Mo%C3%A7ambique.pdf
DOI: 10.5281/zenodo.10641354
title: Portuguese military bases during the Portuguese Colonial War

description: Locations of portuguese military bases in Guinea-Bissau, Angola, Mozambique during colonial war as published by official military reports.

This dataset is a compilation of the charts published by:

Comissão para o estudo das Campanhas de África (1989). Resenha histórico-militar das campanhas de África (1961-1974), vol.2 Dispositivo da nossas forças: Angola. Lisboa : Estado Maior do Exército. https://cld.pt/dl/download/690812b2-d8f5-4ca6-bf2e-ae032b4f50a1/00_CECA/Volume%202%20-%20Dispositivo%20das%20Nossas%20For%C3%A7as%20Angola.pdf

Comissão para o estudo das Campanhas de África (1989). Resenha histórico-militar das campanhas de África (1961-1974), vol.3 Dispositivo da nossas forças: Guiné. Lisboa : Estado Maior do Exército. https://cld.pt/dl/download/690812b2-d8f5-4ca6-bf2e-ae032b4f50a1/00_CECA/Volume%203%20-%20Dispositivo%20das%20Nossas%20For%C3%A7as%20Guin%C3%A9.pdf (2)

Comissão para o estudo das Campanhas de África (1989). Resenha histórico-militar das campanhas de África (1961-1974), vol.4 Dispositivo da nossas forças: Moçambique. Lisboa: Estado Maior do Exército. https://cld.pt/dl/download/690812b2-d8f5-4ca6-bf2e-ae032b4f50a1/00_CECA/Volume%204%20-%20Dispositivo%20das%20Nossas%20For%C3%A7as%20Mo%C3%A7ambique.pdf
DOI: 10.5281/zenodo.10641458
title: On the Executability of R Markdown Files
DOI: 10.5281/zenodo.10641459
title: On the Executability of R Markdown Files
DOI: 10.5255/ukda-sn-856882
title: Using Participatory Approaches To Instigate Improvements in Water Quality, 2021-2022

description: The ‘UpStream’ project was co-created, co-developed and co-delivered with two active community groups in the UK (Friends of Bradford's Becks) and Taiwan (Taiwan Clean Water Alliance) who both were concerned about water pollution in their local rivers. The project has provided a testbed to achieve the aim of the project of aiding citizen scientists better understand local water quality. This has led to the development and deployment of a cost-effective Continuous Water Quality Monitoring device, the WaterBox, along with methods for transmitting, storing, visualising, and analysing the data collected. Parameters collected include: pH, temperature, conductivity and turbidity. A total of 104 practicalities of continuous water quality monitoring were observed and categorised as either technical, social, economic or wider responsibilities. These have been summarised in a publication that is current;y under review.