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

In this paper, third order non-polynomial spline function is used to solve 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of this method, and to compare the computed results with other known methods.

A simple indirect spectrophotometric method for determination of mebendazol in pure and pharmaceutical formulation was presented in this study. UV-Visible spectrophotometry using the optimal conditions was developed for determination of mebendazole in pure drug and different preparation samples. The method is based on the oxidation of drug by nbromosuccinimide with hydrochloric acid and the left amount of oxidizing agent was determined by the reaction with tartarazine and the absorbance was measured at 428 nm. Calibration curves were linear in the range of 5 to 30 µg.mL-1 with molar absorptivity 8437.2 L.mol-1 .cm-1 . The limits of detection and quantification were determined and found to be 0.7770 µg.mL-1 and 2.3400 µg.mL-1 respec

     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