kinetic studies were carried out the uterine homogenate time course of the association of with LH in benign and malignant uterine
The main purpose of the work is to apply a new method, so-called LTAM, which couples the Tamimi and Ansari iterative method (TAM) with the Laplace transform (LT). This method involves solving a problem of non-fatal disease spread in a society that is assumed to have a fixed size during the epidemic period. We apply the method to give an approximate analytic solution to the nonlinear system of the intended model. Moreover, the absolute error resulting from the numerical solutions and the ten iterations of LTAM approximations of the epidemic model, along with the maximum error remainder, were calculated by using MATHEMATICA® 11.3 program to illustrate the effectiveness of the method.
In this paper, the concept of fully stable Banach Algebra modules relative to an ideal has been introduced. Let A be an algebra, X is called fully stable Banach A-module relative to ideal K of A, if for every submodule Y of X and for each multiplier ?:Y?X such that ?(Y)?Y+KX. Their properties and other characterizations for this concept have been studied.
Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti
... Show MoreThe convolutional neural networks (CNN) are among the most utilized neural networks in various applications, including deep learning. In recent years, the continuing extension of CNN into increasingly complicated domains has made its training process more difficult. Thus, researchers adopted optimized hybrid algorithms to address this problem. In this work, a novel chaotic black hole algorithm-based approach was created for the training of CNN to optimize its performance via avoidance of entrapment in the local minima. The logistic chaotic map was used to initialize the population instead of using the uniform distribution. The proposed training algorithm was developed based on a specific benchmark problem for optical character recog
... Show MoreFace Detection by skin color in the field of computer vision is a difficult challenge. Detection of human skin focuses on the identification of pixels and skin-colored areas of a given picture. Since skin colors are invariant in orientation and size and rapid to process, they are used in the identification of human skin. In addition features like ethnicity, sensor, optics and lighting conditions that are different are sensitive factors for the relationship between surface colors and lighting (an issue that is strongly related to color stability). This paper presents a new technique for face detection based on human skin. Three methods of Probability Density Function (PDF) were applied to detect the face by skin color; these ar
... Show MoreImage databases are increasing exponentially because of rapid developments in social networking and digital technologies. To search these databases, an efficient search technique is required. CBIR is considered one of these techniques. This paper presents a multistage CBIR to address the computational cost issues while reasonably preserving accuracy. In the presented work, the first stage acts as a filter that passes images to the next stage based on SKTP, which is the first time used in the CBIR domain. While in the second stage, LBP and Canny edge detectors are employed for extracting texture and shape features from the query image and images in the newly constructed database. The p
In this article, we introduce a class of modules that is analogous of generalized extending modules. First we define a module M to be a generalized ECS if and only if for each ec-closed submodule A of M, there exists a direct summand D of M such that is singular, and then we locate generalized ECS between the other extending generalizations. After that we present some of characterizations of generalized ECS condition. Finally, we show that the direct sum of a generalized ECS need not be generalized ECS and deal with decompositions for be generalized ECS concept.