am2a: joint chance-constrained max-min service guarantees on lossy irrigation trees
Annotatsiya
Code, input data and results of the computation reported in the manuscript Joint Chance-Constrained Max–Min Service Guarantees on Directed Irrigation Trees with Conveyance Losses: Certified Evaluation and Bottleneck Diagnostics by A. Kudaybergenov, A. Kabulov, M. Kazimbetova, Z. Nurullaev, G. Ametova, J. Ispanova and M. Qudaynazarov. am2a computes two-sided brackets on the joint chance-constrained max–min service guarantee of an irrigation tree with conveyance losses: the largest service level that all users attain in all periods together with a prescribed probability. A recursion over the tree on an efficiency-adapted lattice bounds the probability that all capacities suffice; in one-factor models of the demands and the source capacity, these bounds are integrated over the factor, and bisections turn them into a bracket on the guarantee. The bounds are computed in IEEE 754 double precision with all rounding errors bounded, and the values of the normal distribution function are enclosed in ball arithmetic by Arb (python-flint). The archive contains the code (run_analysis.py, the package am2a and its unit tests), the configuration that pins the input files by their SHA-256, the benchmark file of the Gone Abat Jap case, the NASA POWER weather record, every result file of the computation with the SHA-256 manifest of the run and the script that draws the figures of the manuscript together with the figures. Running run_analysis.py regenerates the result files and exits with code 0 only if all acceptance checks pass.
Hali tarjima qilinmagan