Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Software . 2022
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Software . 2022
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Software . 2022
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

A Flexible Algorithm for Network Design Based on Information Theory

Authors: Thompson, Rona; Pisso, Ignacio;

A Flexible Algorithm for Network Design Based on Information Theory

Abstract

This code is for the design of an optimal observing network and is written in R. It has been written with networks for atmospheric sampling in mind, however, the algorithm is applicable to any network design problem where the relationship between the variables to be determined and the observations is linear, and the uncertainties are Gaussian distributed. The algorithm uses the metric of maximizing the Information Content of the observations and an incremental optimization method. The code can also be used to determine the locations of new sites when there is an existing network, and for observations of a different type (e.g., isotopes versus mixing ratios). To use the code, the user needs to supply the following files: A list of potential observation sites, i.e., those from which to select, in ascii format (csv). This list needs to include the location of the sites as well as the measurement uncertainties (see example). A list of existing sites (if any) in ascii format (csv) (see example). The relationship between the unknown variables and the potential observations (as well as for existing observations, if any). These are the Jacobian matrices, or in atmospheric sciences, source-receptor relationships, SRRs. The default is one file (in NetCDF format) per observation corresponding to the potential and, if any, the existing sites. A prior estimate of the unknown variables (for atmospheric sciences, the fluxes) in NetCDF format. A land-sea mask (if only land variables are to be considered) in NetCDF format. A region mask (if only a region is to be considered) in NetCDF format. The paths, files and settings are specified in the file “network_config.r”, which is called by the main script “optimize_network.r”.

{"references": ["Thompson, R. L., and Pisso, I: A Flexible Algorithm for Network Design Based on Information Theory, Atmos. Meas. Tech. Disc., https://doi.org/10.5194/egusphere-2022-213, 2022"]}

If using this code, please cite the reference.

Keywords

atmospheric monitoring, optimisation, network design, information content

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 7
    download downloads 3
  • 7
    views
    3
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
7
3
Funded by