Effect of Using Computer in Getting and Remaining Information at Students of First Stage in Biology Subject MIAAD NATHIM RASHEED LECTURER Abstract The recent research goal is to know the influence of computer use to earn and fulfillment information for students of first class in biology material and to achieve that put many of the zeroing hypothesis by researcher as follow: There were no differences between statistical signs at level (0,05) between the average students' marks who they were study by using computer and between the average student ' marks who they were study in classical method of earning and fulfillment. The researcher chose the intentional of the medical technical institute that included of two branches the first class (A) for experimental group and branch (B) for controlled group as realty of (60) students (females and males) in every branches and because I was as statistics so the differentiate between explanation students' research group in use of the researcher limit scientific material of (third unit for biology material), researcher has modeled statistical test consists of (50) clauses from multi selection type showed for specialized group of test adding to know the distinguish between every clauses by using the half portion method and upon the contrast coefficient that among of (84.0) and after the finish of applied experiment of statistical test by using the dual independent samples test. And the obtained results, researcher concluded the use of computer as motivation for the students to do homework of the teaching biology material and she suggested to do their studies in another variables of non earing and fulfillment.
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 More
(10)
(7)
This paper aims to study the quaternary classical continuous optimal control problem consisting of the quaternary nonlinear parabolic boundary value problem, the cost function, and the equality and inequality constraints on the state and the control. Under appropriate hypotheses, it is demonstrated that the quaternary classical continuous optimal control ruling by the quaternary nonlinear parabolic boundary value problem has a quaternary classical continuous optimal control vector that satisfies the equality constraint and inequality state and control constraint. Moreover, mathematical formulation of the quaternary adjoint equations related to the quaternary state equations is discovered, and then the weak form of the quaternary adjoint
... Show More
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.
(2)
(1)
In 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.
Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.
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
The concept of a 2-Absorbing submodule is considered as an essential feature in the field of module theory and has many generalizations. This articale discusses the concept of the Extend Nearly Pseudo Quasi-2-Absorbing submodules and their relationship to the 2-Absorbing submodule, Quasi-2-Absorbing submodule, Nearly-2-Absorbing submodule, Pseudo-2-Absorbing submodule, and the rest of the other concepts previously studied. The relationship between them has been studied, explaining that the opposite is not true and that under certain conditions the opposite becomes true. This article aims to study this concept and gives the most important propositions, characterizations, remarks, examples, lemmas, and observations related to it. In the en
... Show More
In this paper, the classical continuous triple optimal control problem (CCTOCP) for the triple nonlinear parabolic boundary value problem (TNLPBVP) with state vector constraints (SVCs) is studied. The solvability theorem for the classical continuous triple optimal control vector CCTOCV with the SVCs is stated and proved. This is done under suitable conditions. The mathematical formulation of the adjoint triple boundary value problem (ATHBVP) associated with TNLPBVP is discovered. The Fréchet derivative of the Hamiltonian" is derived. Under suitable conditions, theorems of necessary and sufficient conditions for the optimality of the TNLPBVP with the SVCs are stated and proved.
The survival analysis is one of the modern methods of analysis that is based on the fact that the dependent variable represents time until the event concerned in the study. There are many survival models that deal with the impact of explanatory factors on the likelihood of survival, including the models proposed by the world, David Cox, one of the most important and common models of survival, where it consists of two functions, one of which is a parametric function that does not depend on the survival time and the other a nonparametric function that depends on times of survival, which the Cox model is defined as a semi parametric model, The set of parametric models that depend on the time-to-event distribution parameters such as
... Show More
Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.