The accuracy of the skillful performance of the front and back dimensions of badminton in volleyball, occurs through the investment of complex exercises (physical skills) in a single performance and its characteristics that give the correct movement behavior and speed to the accuracy of the performance of the strokes as well as the identification of changes in some physiological indicators of By using these compound exercises. The research problem lies: I found a weakness in the accuracy of the performance of the front and back dimensions strike and diagnosed this through the tests that it conducted on the players to identify and know the problem, and attributed this weakness to a weakness in the necessary physical and skill abilities and this affects the accuracy of directing the performance of the front and back dimensions strike and some physiological variables. sought the researcher to prepare exercises characterized by combining physical performance and skill in the performance of one compound, this method is not found in the training of players badminton after reviewing their training goal of the new provision and the advancement of the process of training in badminton, it used the researcher of the curriculum pilot where the research community The two junior badminton players, whose number is ( 1 0 ) player, the researcher concluded Of : The exercise complex prepared by the researcher developed swung the machete dimensions of the front and rear and some physiological indicators of the plane badminton experimental group better than the control group sample.
Many developments happened in Service Oriented architecture models but with no details in its technology and requirement. This paper presents a new Service Oriented Architecture (SOA) to all Service Enterprise (SE) according to their demands. Therefore, the goal is to build a new complete architecture model for SOA methodologies according to current technology and business requirements that could be used in a real Enterprise environment. To do this, new types of services and new model called Lego Model are explained in details, and the results of the proposed architecture model in analyzed. Consequently, the complications are reduced to support business domains of enterprise and to start associating SOA methodologies in their corporate s
... Show More
The purpose of this paper is to introduce a new type of compact spaces, namely semi-p-compact spaces which are stronger than compact spaces; we give properties and characterizations of semi-p-compact spaces.
Competitive swimming is a highly researched area and technological developments have aided advances in the understanding of the biomechanical principles that underpin these elements and govern propulsion. Moreover, those working in the sports field especially in swimming are interested in studying, analyzing, evaluating and developing motor skills by diagnosing the strengths and weaknesses of the skill, and accordingly, coaches and specialists correct these errors. The researchers chose this (Butterfly swimming) and the (arm length) is an important variable because the success of the stroke is greatly dependent on the propulsion generated from the arm pull, and swimmers with a longer arm span have a mechanical advantage with the resulting f
... Show More
In this paper, we consider a new approach to solve type of partial differential equation by using coupled Laplace transformation with decomposition method to find the exact solution for non–linear non–homogenous equation with initial conditions. The reliability for suggested approach illustrated by solving model equations such as second order linear and nonlinear Klein–Gordon equation. The application results show the efficiency and ability for suggested approach.
This paper deals with the F-compact operator defined on probabilistic Hilbert space and gives some of its main properties.
Image steganography is undoubtedly significant in the field of secure multimedia communication. The undetectability and high payload capacity are two of the important characteristics of any form of steganography. In this paper, the level of image security is improved by combining the steganography and cryptography techniques in order to produce the secured image. The proposed method depends on using LSBs as an indicator for hiding encrypted bits in dual tree complex wavelet coefficient DT-CWT. The cover image is divided into non overlapping blocks of size (3*3). After that, a Key is produced by extracting the center pixel (pc) from each block to encrypt each character in the secret text. The cover image is converted using DT-CWT, then the p
... Show More
(3)
(3)
In this paper, we introduce and study the concept of S-coprime submodules, where a proper submodule N of an R-module M is called S-coprime submodule if M N is S-coprime Rmodule. Many properties about this concept are investigated.
Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called s- closed submodule denoted by D ≤sc W, if D has no proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In this paper, we study modules which satisfies the ascending chain conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.
Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be approximately pure submodule of an R-module, if for each ideal I of R. The main purpose of this paper is to study the properties of the following concepts: approximately pure essentialsubmodules, approximately pure closedsubmodules and relative approximately pure complement submodules. We prove that: when an R-module M is an approximately purely extending modules and N be Ap-puresubmodulein M, if M has the Ap-pure intersection property then N is Ap purely extending.
This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.