This paper presents an analytical study for the magnetohydrodynamic (MHD) flow of a generalized Burgers’ fluid in an annular pipe. Closed from solutions for velocity is obtained by using finite Hankel transform and discrete Laplace transform of the sequential fractional derivatives. Finally, the figures are plotted to show the effects of different parameters on the velocity profile.

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

Drilling fluid loss during drilling operation is undesirable, expensive and potentially hazardous problem.

    Nasiriyah oil field is one of the Iraqi oil field that suffer from lost circulation problem. It is known that Dammam, um-Radoma, Tayarat, Shiranish and Hartha are the detecting layers of loss circulation problem. Different type of loss circulation materials (LCMs) ranging from granular, flakes and fibrous were used previously to treat this problem.  

    This study presents the application of rice as a lost circulation material that used to mitigate and stop the loss problem when partial or total losses occurred.

     The experim

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

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 research aims to study and assess the effectiveness of preventive measures banking for the reduction of money laundering based on the checklist (Check list), which have been prepared based on the paragraphs of some of the principles and recommendations of international and Money Laundering Act No. 93 of 2004 and the instructions thereto, to examine and assess the application of these measures by Gulf Commercial Bank, which was chosen to perform the search.

I've been a statement the concept of money laundering in terms of the definition and characteristics, stages and effects of political, economic and social as well as the nature of banking supervision in terms of the definition and the most important

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall