The science of jurisprudence is one of the legal sciences that scholars have been interested in since the first centuries of Islam, and they wrote many books about it, and the science of manuscripts is considered one of the scientific achievements in which many scholars emerged, including Imam Al-Samaani, so I chose this manuscript related to Istism to clarify its concept and meaning for all people, The student (Ali Ahmed Abdel-Aziz Sheikh Hamad) preceded me in the investigation of part of the book, and it was facilitated for me, by the grace of God Almighty, to investigate the issue (if one of the Muslim spouses apostatized and one of the infidel spouses converted to Islam until the end of the issue of if the two spouses were taken captive together, the marriage is invalid). The book is to avoid prolongation and repetition. The nature of the research required that it be according to the following plan:
The first section: the academic section, which I have dealt with here briefly, as the student preceded me in studying it, and it included: First - the definition of the work. And our last prayer is that praise be to God, Lord of the worlds, and may God’s blessings and peace be upon our master Muhammad and his family and companions.
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)
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
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.
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.
Abstract Throughout this paper R represents commutative ring with identity and M is a unitary left R-module, the purpose of this paper is to study a new concept, (up to our knowledge), named St-closed submodules. It is stronger than the concept of closed submodules, where a submodule N of an R-module M is called St-closed (briefly N ≤Stc M) in M, if it has no proper semi-essential extensions in M, i.e if there exists a submodule K of M such that N is a semi-essential submodule of K then N = K. An ideal I of R is called St-closed if I is an St-closed R-submodule. Various properties of St-closed submodules are considered.
(3)
In this review paper, several studies and researches were surveyed for assisting future researchers to identify available techniques in the field of classification of Synthetic Aperture Radar (SAR) images. SAR images are becoming increasingly important in a variety of remote sensing applications due to the ability of SAR sensors to operate in all types of weather conditions, including day and night remote sensing for long ranges and coverage areas. Its properties of vast planning, search, rescue, mine detection, and target identification make it very attractive for surveillance and observation missions of Earth resources. With the increasing popularity and availability of these images, the need for machines has emerged to enhance t
... Show More
(6)
(3)
(15)
(13)
Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence