water-01: max–min water delivery through quantised gates at a canal node (code, configuration and results)
Annotatsiya
Computation project of the article “Max–min water delivery through quantised gates: exclusion conditions, rounding rules and accounting periods at a canal node”, with the Dustlik node of the Kegeyli irrigation canal (Republic of Karakalpakstan, Uzbekistan) as the case. The archive contains the theory module (continuous max–min level, minimum-delivery level, price of indivisibility, abstract quantised actuator and the execution rules of Theorems 1, 3 and 4); the closed-loop Saint–Venant simulation core (version 1.4.0, unchanged); the execution rules (direct execution, pulse rule with threshold θ, equal split with pulse fallback, carry-over of the daily debt); the simulation cases with the daily results of all 200 seasonal runs (2010–2019) and their provenance files; the analysis and figure scripts with their outputs, the verification of the hydraulic plant and the tests; the configuration with the status and source of every parameter and the processed operating records of the Kegeyli irrigation system; and a graphical interface in English and Uzbek. Version 2.3.0 is release v2.3.0 (commit 8ce2690) of https://github.com/Adilbaygh/water01-maxmin-quantised-gates; its results and simulation core are those of release 2.2.2. README.md describes how to rebuild the tables and figures of the article from the stored results and how to repeat the simulations. Code: MIT License; configuration, processed records and results: CC BY 4.0.
Hali tarjima qilinmagan