The aim of this study was to Identifying The Effect of using Linear programming and Branching programming by computer in Learning and Retention of movement concatenation(Linkwork) in parallel bars in Artistic Gymnastics. The searchers have used the experimental method. The search subject of this article has been taken (30) male - students in the second class from the College of Physical Education/University of Baghdad divided into three groups; the first group applied linear programming by computer, and the second group has been applicated branching programming by computer, while precision group used traditional method in the college. The researchers concluded the results by using the statistical bag for social sciences (spss) such as both kinds of programming learning have procured improvement in learning and retention of movement concatenation(Linkwork) in parallel bars in Artistic Gymnastics, but Branching programming by computer is more activity than linear programming. The researchers have recommended applying branching programming learning as a type of auto–learning in the teaching of concatenation (Linkwork) in Parallel bars in the research.
In this study, the concept of fuzzy α-topological vector space is introduced by using the concept fuzzy α-open set , some properties of fuzzy α-topological vector spaces are proved .We also show that the space is -space iff every singleton set is fuzzy α- closed .Finally, the convex property and its relation with the interior points are discussed.
This paper interest to estimation the unknown parameters for generalized Rayleigh distribution model based on censored samples of singly type one . In this paper the probability density function for generalized Rayleigh is defined with its properties . The maximum likelihood estimator method is used to derive the point estimation for all unknown parameters based on iterative method , as Newton – Raphson method , then derive confidence interval estimation which based on Fisher information matrix . Finally , testing whether the current model ( GRD ) fits to a set of real data , then compute the survival function and hazard function for this real data.
The growth curves of the children are the most commonly used tools to assess the general welfare of society. Particularity child being one of the pillars to develop society; through these tools, we can path a child's growth physiology. The Centile line is of the important tools to build these curves, which give an accurate interpretation of the information society, also respond with illustration variable age. To build standard growth curves for BMI, we use BMI as an index. LMSP method used for finding the Centile line which depends on four curves represents Median, Coefficient of Variation, Skews, and Kurtosis. These can be obtained by modeling four parameters as nonparametric Smoothing functions for the illustration variable. Ma
... Show MoreThe usage of remote sensing techniques in managing and monitoring the environmental areas is increasing due to the improvement of the sensors used in the observation satellites around the earth. Resolution merge process is used to combine high resolution one band image with another one that have low resolution multi bands image to produce one image that is high in both spatial and spectral resolution. In this work different merging methods were tested to evaluate their enhancement capabilities to extract different environmental areas; Principle component analysis (PCA), Brovey, modified (Intensity, Hue ,Saturation) method and High Pass Filter methods were tested and subjected to visual and statistical comparison for evaluation. Both visu
... Show MoreIn this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show MoreIn this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
Gangyong Lee, S.Tariq Rizvi, and Cosmin S.Roman studied Rickart modules.
The main purpose of this paper is to develop the properties of Rickart modules .
We prove that each injective and prime module is a Rickart module. And we give characterizations of some kind of rings in term of Rickart modules.
The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time. Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle to involve four types of binary code books (i.e. Pour when , Flat when , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding pro
... Show More