• The Modeling and Optimization of Building the Multi-dam System on Zambezi River

    分类: 数学 >> 数学(综合) 分类: 水利工程 >> 水利工程基础学科 提交时间: 2023-04-28

    摘要: In this paper, we mainly provide a proper maintenance plan for the Kariba Dam in Africa which falls into disrepair and is facing to collapse. Firstly, we make a threshold analysis of the three options about their costs which include peoples moving, old dams removing, new dams building, later repairing, ecological destruction and their incomes which include generation energy, avoiding of flood disasters loss, providing employment, tourism resources and ecological protection. Then we get the specific relationship between benefits and years with some collected data. Both of the results show that the third option is the best choice from the economic view. And the result is completely as same as the conclusion we get after studying deeply on Option 3. Secondly, we regard water management capabilities as the safety coefficient of dams. We select 30 seed points along the riverbank for preparing the establishment of dams. With flow-between-riverway model, Manning equations, large Cauchy distribute function we get the scores of the seed points. We give an advice that the number of dams should be more and the positions of dams should be well-distributed. Then, we build an assessment model by analytic hierarchy process. We select three factors among all the factors, safety, economy and population. After testing the consistency, we get the weights of each factor: 0.6442, 0.2705, 0.0852. Then we value the factors and get an optimal scheme during the assessment with 0-1 integer programming: the number of dams is 17 and the longitude and latitude of them are shown in Table 17. The sensitivity of the result is tested as well. We also provide some strategies for the managers of ZRA to use. We suggest that they should use the dams normally in general. With the Dam-break model, we find 13 points among 17 points which are shown in Table 20. The dams at the 13 points need to be closed when there is a flood and it is just the opposite when the drought happens. For the extreme water flow, we assume an ideal water flow at first. The extreme water flow has to be adjusted to satisfy the ideal one. As for the restrictions in extreme conditions, the biggest impact happens at the 8th point among the 17 points. If the duration of maximum flow is t0, the drainage time t to make the water flow return to the normal level equals to 4.95t0.

  • A Note on the Invariant Distribution of a Stochastic Dynamical System

    分类: 数学 >> 数学(综合) 提交时间: 2023-04-27

    摘要: This paper demonstrates the invariant distribution of a stochastic dynamical system. We give the invariant distribution and numerical examples. We also present a further discussion on the computation details.

  • On Two Factors Affecting the Efficiency of MILP Models in Automated Cryptanalyses

    分类: 数学 >> 应用数学 提交时间: 2023-02-15

    摘要: In recent years, mixed integer linear programming (MILP, in short) gradually becomes a popular tool of automated cryptanalyses in symmetric ciphers, which can be used to search differential characteristics and linear approximations with high probability/correlation. A key problem in the MILP method is how to build a proper model that can be solved efficiently in the MILP solvers like Gurobi or Cplex. It is known that a MILP problem is NP-hard, and the numbers of variables and inequalities are two important measures of its scale and time complexity. Whilst the solution space and the variables in many MILP models built for symmetric cryptanalyses are fixed without introducing dummy variables, the cardinality, i.e., the number of inequalities, is a main factor that might affect the runtime of MILP models. We notice that the norm of a MILP model, i.e., the maximal absolute value of all coefficients in its inequalities, is also an important factor affecting its runtime. In this work we will illustrate the effects of two parameters cardinality and norm of inequalities on the runtime of Gurobi by a large number of cryptanalysis experiments. Here we choose the popular MILP solver Gurobi and view it a black box, construct a large number of MILP models with different cardinalities or norms by means of differential analyses and impossible differential analyses for some classic block ciphers with SPN structure, and observe their runtimes in Gurobi. As a result, our experiments show that although minimizing the number of inequalities and the norm of coefficients might not always minimize the runtime, it is still a better choice in most situations.