Spraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...

The goal (purpose) from using development technology that require mathematical procedure related with high Quality & sufficiency of solving complex problem called Dynamic Programming with in recursive method (forward & backward) through  finding series of associated decisions for reliability function of Pareto distribution estimator by using two approach Maximum likelihood & moment .to conclude optimal policy

This paper compares between the direct and indirect georeferencing techniques in Photogrammetry bases on a simulation model. A flight plan is designed which consists of three strips with nine overlapped images for each strip by a (Canon 500D) digital camera with a resolution of 15 Mega Pixels.

The triangulation computations are carried out by using (ERDAS LPS) software, and the direct measurements are taken directly on the simulated model to substitute using GPS/INS in real case. Two computational tests have been implemented to evaluate the positional accuracy for the whole model and the Root Mean Square Error (RMSE) relating to (30) check points show that th

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C