Heavy Snow will turn to a natural disaster, and will bring big economic losses. The authors hope to establish a mathematic model and a plan to illustrate how to sweep off the snow on main roads in a city so as to ensure the smooth flow of traffic. The research will become a basis on which the government can workout some plans against the snow disasters. Firstly we made some assumptions, then studied the working process of snow-sweepers and derived a snow sweeping model. Based on this model, the relationship between working speed of snow-sweeper and snow thickness, a working model of snow-sweeper, and minimum sets of snow-sweeper needed were established. A deep-searching model and a model of snow-sweeping tree, and a computer program in PASCAL to determine the minimum number of snow-sweeper and the snow sweeping plans on main roads were obtained. We tried several solutions to deal with this problem, such as using piecewise curve fitting to transform a formula h~ vc relating to a cubic equation operation to formula vc~ h ,using trial and error method to determine the minimum number of snow sweepers, using deep searching and tree structure in one-stroke processing in a complicated two-way road system, and also a matrix to deal with the deep searching.

This paper mainly focuses on the optimized methods of the sprinkling irrigation for greenery patches, by maximally equalizing the amount of water sprayed on a certain area. Various models are being discussed, where the main mathematical tool is analytic geometry, employed to research the possible effects of different proposals. Firstly, the simplest models are built based on a totally ideal situation. Assuming that sprinkling spouts are spinning over plain lawn with a set of specified radii, install them in arrangements of simple geometric figures. Areas of overlapping and blank parts are being calculated and the most reasonable arrangement of all that are studied is selected. Secondly, real factors are taken into consideration separately as follows: 1. The disequilibrium of the water that drops in a line from the sprinkling center is transformed into a functional expression, whose graphs are drawn to show the water distributed over the area; 2. The plane models are changed into solid ones on the assumption that the sprinkling spouts are placed on slopes. Analytic geometry methods are employed to describe the range of sprayed water on the oblique surface. Through calculation and analysis, models can be adjusted to specific situations. Finally, the boundary problems and landscape effects are involved.

InthispaperwedevelopaconservativelocaldiscontinuousGalerkin(LDG) method for the Schro ̈ dinger-Korteweg-de Vries (Sch-KdV) system, which arises in var- ious physical contexts as a model for the interaction of long and short nonlinear waves. Conservative quantities in the discrete version of the number of plasmons, energy of the oscillations and the number of particles are proved for the LDG scheme of the Sch-KdV system. Semi-implicit time discretization is adopted to relax the time step constraint from the high order spatial derivatives. Numerical results for accuracy tests of stationary traveling soliton, and the collision of solitons are shown. Numerical ex- periments illustrate the accuracy and capability of the method.

We consider$Thurston maps$, i.e., branched covering maps$f:S$^{2}→$S$^{2}that are$post-critically finite$. In addition, we assume that$f$is$expanding$in a suitable sense. It is shown that each sufficiently high iterate$F$=$f$^{$n$}of$f$is$semi-conjugate$to$z$^{$d$}:$S$^{1}→$S$^{1}, where$d$= deg F. More precisely, for such an$F$we construct a$Peano curve γ$:$S$^{1}→$S$^{2}(onto), such that$F$∘$γ$($z$) =$γ$($z$^{$d$}) (for all$z$∈$S$^{1}).

Mean field games (MFG) and mean field control (MFC) are critical classes of multi-agent models for efficient analysis of massive populations of interacting agents. Their areas of application span topics in economics, finance, game theory, industrial engineering, crowd motion, and more. In this paper, we provide a flexible machine learning framework for the numerical solution of potential MFG and MFC models. State of-the-art numerical methods for solving such problems utilize spatial discretization that leads to a curse-of-dimensionality. We approximately solve high-dimensional problems by combining Lagrangian and Eulerian viewpoints and leveraging recent advances from machine learning. More precisely, we work with a Lagrangian formulation of the problem and enforce the underlying Hamilton-Jacobi-Bellman (HJB) equation that is derived from the Eulerian formulation. Finally, a tailored neural network parameterization of the MFG/MFC solution helps us avoid any spatial discretization. Our numerical results include the approximate solution of 100-dimensional instances of optimal transport and crowd motion problems on a standard work station and a validation using a Eulerian solver in two dimensions. These results open the door to much-anticipated applications of MFG and MFC models that were beyond reach with existing numerical methods.