In this paper, we consider inequalities in which the function is an element of n-th partially order space. Local and Global uniqueness theorem of solutions of the n-the order Partial differential equation Obtained which are applications of Gronwall's inequalities.

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

The AlAdhaim Dam is located 133 kilometers northeast of Baghdad. It is a multipurpose dam and joints the Iraqi dam system in 2000. It has a storage capacity of 1.5 billion m³. The dam has an ogee spillway with a length of 562 m, a crest level of 131.5 m.a.m.s.l. and a maximum discharge capacity of 1150 m³/s at its maximum storage height of 143 m.a.m.s.l. This research aimed to investigate the hydrodynamics performance of the spillway and the stilling basin of AlAdhiam Dam by using numerical simulation models under gated situations. It was suggested to modify the dam capacity by increasing the dam's storage capacity by installing gates on the crest of the dam spillway. The FLUENT program was used to

المستخلص يهدف هذا البحث الى تجاوز مشكلة البعدية من خلال طرائق الانحدار اللامعلمي والتي تعمل على تقليل جذر متوسط الخطأ التربيعي (RMSE) , أذ تم  استعمال طريقة انحدار الاسقاطات المتلاحقة  (PPR)    ,والتي تعتبر احدى طرائق اختزال الابعاد التي تعمل على تجاوز مشكلة البعدية (curse of dimensionality) , وان طريقة (PPR) من التقنيات الاحصائية التي تهتم بأيجاد الاسقاطات الاكثر أهمية في البيانات المتعددة الابعاد , ومع ايجاد كل اسقاط

The parameters of resistance spot welding (RSW) performed on low strength commercial aluminum sheets are investigated experimentally, the performance requirements and weldability issues were driven the choice of a specific aluminum alloy that was AA1050. RSW aluminum alloys has a major problem of inconsistent quality from weld to weld comparing with welding steel
alloys sheet, due to the higher thermal conductivity, higher thermal expansion, narrow plastic temperature range, and lower electrical resistivity. Much effort has been devoted to the study of describing the relation between the parameters of the process (welding current, welding time, and electrode force) and weld strength. Shear-tensile strength tests were performed to ind

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

To decrease the dependency of producing high octane number gasoline on the catalytic processes in petroleum refineries and to increase the gasoline pool, the effect of adding a suggested formula of composite blending octane number enhancer to motor gasoline composed of a mixture of oxygenated materials (ethanol and ether) and aromatic materials (toluene and xylene) was investigated by design of experiments made by Mini Tab 15 statistical software. The original gasoline before addition of the octane number blending enhancer has a value of (79) research octane number (RON). The design of experiments which study the optimum volumetric percentages of the four variables, ethanol, toluene, and ether and xylene materials leads