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.

No abstract uploaded!

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.

The Hamiltonian cycle problem is an important problem in graph theory and computer science. It is a special case of the famous traveling salesman problem. A signicant amount of research has been done on the special cases of nding Hamiltonian cycles in subgraphs of triangular, square and hexagonal grids. However, there is little work on more complicated grids. In this paper, we investigate the hardness of Hamiltonian cycle problem in grid graphs of semiregular tessellations, which are tessellations formed by two or more kinds of regular polygons. There are only eight semiregular tessellations, and we prove that the Hamiltonian cycle problem in all of them are NP-complete by reducing from NP-complete problems, such as the Hamiltonian cycle problem in max degree 3 bipartite planar graphs. Knowing the NP-completeness of Hamiltonian cycle problem in semiregular grids indicates that there will not be any polynomial time algorithm that solves the Hamiltonian path problem in these tessellations if NP does not equal to P, which helps show the limits of ecient motion planning algorithms and provides new information about what makes problems computationally dicult to solve.

No abstract uploaded!