This experiment may be applied before with certain and special roles, but never applied under partition theory (Abacus James Diagram) conditions. Therefore, we would have to find an appropriate design for each character to enable us sending a word represented as increasing number with meaning only for beneficiaries.
The present work investigated the effect of distance from target surface on the parameters of lead plasma excited by 1064nm Q-switched Nd:YAG laser. The excitation was conducted in air, at atmospheric pressure, with pulse length of 5 ns, and at different pulse laser energies. Electron temperature was calculated by Boltzmann plot method based on the PbI emission spectral lines (369.03 nm, 416.98 nm, 523.48, and 561.94 nm). The PbI lines were recorded at different distances from the target surface at laser pulse energies of 260 and 280 mJ. The emission intensity of plasma increased with increasing the lens-to-target distance. The results also detected an increase in electron temperature with increasing the di
... Show MoreAn improved Metal Solar Wall (MSW) with integrated thermal energy storage is presented in this research. The proposed MSW makes use of two, combined, enhanced heat transfer methods. One of the methods is characterized by filling the tested ducts with a commercially available copper Wired Inserts (WI), while the other one uses dimpled or sinusoidal shaped duct walls instead of plane walls. Ducts having square or semi-circular cross sectional areas are tested in this work.
A developed numerical model for simulating the transported thermal energy in MSW is solved by finite difference method. The model is described by system of three governing energy equations. An experimental test rig has been built and six new duct configurations have b
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.
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
... Show MoreThe Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods depended on selecting the primes p and q in order to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article gives new construction of the RSA algorithm and DH key exchange using the
primes p,qfrom areal number x.
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.
In the present work, the effect of the cylindrical configurations of the sputtering device electrodes on the plasma parameters (Debye length, electron temperature, electron density, plasma frequency) is studied. Also, the effect of the argon gas pressure on the discharge properties is examined with gas pressures of (0.08, 0.2, 0.4 and 0.6) Torr. The properties of the plasma are diagnosed by optical emission spectrometry. The spectroscopic method is adopted for examining the atomic spectra of argon emission. The electron temperature is determined by the Boltzmann method. While, the Stark-widening method was employed for calculating the electron number density. The voltage against current curves of the cylindrical sprayer disc
... Show MoreThe metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
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.
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
... Show More