This paper is concerned with the numerical solutions of the vorticity transport equation (VTE) in two-dimensional space with homogenous Dirichlet boundary conditions. Namely, for this problem, the Crank-Nicolson finite difference equation is derived.  In addition, the consistency and stability of the Crank-Nicolson method are studied. Moreover, a numerical experiment is considered to study the convergence of the Crank-Nicolson scheme and to visualize the discrete graphs for the vorticity and stream functions. The analytical result shows that the proposed scheme is consistent, whereas the numerical results show that the solutions are stable with small space-steps and at any time levels.

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

يعتقد البعض ان مفهوم العلم يعني الآلات والاجهزة العلمية (تقنيات التعليم) وهي لا تختلف عن مفهوم تكنولوجيا المعلومات , ويعد هذا الاعتقاد خاطئ , لان العلم هو بناء المعرفة العلمية المنظمة والتي يتم التوصل اليها عن طريق البحث العلمي , اما تكنولوجيا المعلومات فهي "التطبيقات العملية للمعرفة العلمية في مختلف المجالات ذات الفائدة المباشرة بحياة الانسان, او هي النواحي التطبيقية للعلم وما يرتبط بها من آلات واجهزة".

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

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

The 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 .

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.

      The present paper discusses one of the most important Russian linguistic features of Arabic origin Russian lexes denoting some religious worship or some political and social positions like Qadi, Wally, Sultan, Alam, Ruler, Caliph, Amir, Fakih, Mufti, Sharif, Ayatollah, Sheikh.. etc.  A lexical analysis of the two of the most efficient and most used words of Arabic origin Russian lexes that are “Caliph and Sheikh” is considered in the present study. The lexicographic analysis of these words makes it possible to identify controversial issues related to their etymology and semantic development.

The study is conducted by the use of the modern Russian and Arabic dictionary, specifically, (Intermediate lexicon Dictionary

There is a mutual relationship between the form of a text and its meaning so as separating these two or devaluating the role of one of them leads to the absence of the value therein. Thus, a translation is important as to how it relates the details of a text. That is, the text has special features which go beyond form, and these set out its distinctiveness. Here, we tackle Saleh al-Jafari's Arabic translation of  "Rubbayat al-Khayyam" of Naysapour descriptively and analytically by depending on extracts from the original text. This translation is evaluated on the basis of Spanish critic Maria Carmen Valero Garces. Herein, we discuss the effectiveness of this theory in the criticism of literary texts. It has been concluded that al-Jaf