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.
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.
The global food supply heavily depends on utilizing fertilizers to meet production goals. The adverse impacts of traditional fertilization practices on the environment have necessitated the exploration of new alternatives in the form of smart fertilizer technologies (SFTs). This review seeks to categorize SFTs, which are slow and controlled-release Fertilizers (SCRFs), nano fertilizers, and biological fertilizers, and describes their operational principles. It examines the environmental implications of conventional fertilizers and outlines the attributes of SFTs that effectively address these concerns. The findings demonstrate a pronounced environmental advantage of SFTs, including enhanced crop yields, minimized nutrient loss, improved nut
... Show MoreLet R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if
the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are introduced and given some properties .
Merging biometrics with cryptography has become more familiar and a great scientific field was born for researchers. Biometrics adds distinctive property to the security systems, due biometrics is unique and individual features for every person. In this study, a new method is presented for ciphering data based on fingerprint features. This research is done by addressing plaintext message based on positions of extracted minutiae from fingerprint into a generated random text file regardless the size of data. The proposed method can be explained in three scenarios. In the first scenario the message was used inside random text directly at positions of minutiae in the second scenario the message was encrypted with a choosen word before ciphering
... Show MoreLet M be an R-module, where R is a commutative ring with unity. A submodule N of M is called e-small (denoted by N e  M) if N + K = M, where K e  M implies K = M. We give many properties related with this type 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 pure relative to submodule T of M (Simply T-pure) if for each ideal A of R, N?AM=AN+T?(N?AM). In this paper, the properties of the following concepts were studied: Pure essential submodules relative to submodule T of M (Simply T-pure essential),Pure closed submodules relative to submodule T of M (Simply T-pure closed) and relative pure complement submodule relative to submodule T of M (Simply T-pure complement) and T-purely extending. We prove that; Let M be a T-purely extending module and let N be a T-pure submodule of M. If M has the T-PIP, then N is T-purely extending.
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
Let R be associative; ring; with an identity and let D be unitary left R- module; . In this work we present semiannihilator; supplement submodule as a generalization of R-a- supplement submodule, Let U and V be submodules of an R-module D if D=U+V and whenever Y≤ V and D=U+Y, then annY≪R;. We also introduce the the concept of semiannihilator -supplemented ;modules and semiannihilator weak; supplemented modules, and we give some basic properties of this conseptes