Search

This paper devoted to find the solution of the Vanishing Neutral Differential Equations (VNDEs). After having reviewed the ARCHI code, which was originally written by Paul with the aim of solving neutral differential equations, an improvement of this code will be presented in this paper to solve problems of VNDEs. This improvement is done by suggesting a hybrid method of special interpolants with iteration procedure of RK method. We will analyze the convergence of the suggested hybrid method. We conclude that the criteria of convergence for this method is: and when , we have , that is the solution is convergent and the derivative of the solution is also convergent for VNDEs.

Two new hybrid algorithms have been suggested in this paper, the first one utilizes four formula of self-scaling update matrix was used. The matrix is selected according to Buckley method in each step. The new algorithm has been compared with BFGS standard algorithm by means of (10) multi-dimensional standard functions. As for the second new hybrid algorithm, a new method is used to test the conjugate coefficient (β) which consists of Hestenes Stiefel (HS) and Dai and yuan (DY). Then it is compared with BFGS and PCG algorithms, which uses BFGS update, by means of (10) multi-dimesional standard functions. Numerical results in general indicates the efficiency of the algorithms proposed in this paper by using this number of non-linear functions in this domain.

This paper presents the recently-discovered linear [n,3,d] codes over PG(2,29) that arises from a complete (n,r)-arcs which the paper[12] presented it for the first time. The aim of this paper is to formulate the recently discovered upper bounds and lower bound for (n,r)-arcs as bounds that will look familiar to coding theorists.New two lists in this paper appeared, the first list of 15 codes arranged from[164,3,156]-code up to [704,3,678]-code, the second list of 27 codes arranged from [28,3,25]-code up to [776,3,747]-code, they are appeared for the first time in this paper, all of these codes we can call them as complete codes as thier definition in this paper, they belong to the class of error-correcting codes (ECC).In this paper I made a computer programs to construct these new codes with Random Greedy Construction method (RGC) which is mentioned in [13].

In this paper, we have used one of the preconditioned conjugate gradient algorithm with the Quasi – Newton approximation; namely the BFGS preconditioned algorithm which was suggested by (AL-Bayati and Aref, 2001). In this paper we have suggested a new algorithm for constrained optimization with robust numerical results, for solving constrained optimization problems.

In order to provide accurate recognition of individuals, the most discriminating information present in an iris pattern must be extracted. Only the significant features of the iris must be encoded so that comparisons between templates can be made. Most iris recognition systems make use of a band pass decomposition of the iris image to create a biometric template. In this paper, the feature extraction techniques are improved and implemented. These techniques are using wavelet filters. The encoded data by wavelet filters are converted to binary code to represent the biometric template. The Hamming distance is used to classify the iris templates, and the False Accept Rate (FAR), False Reject Rate (FRR) and recognition rate (RR) are calculated [1]. The wavelet transform using DAUB12 filter proves that it is a good feature extraction technique. It gives equal FAR and FRR and a high recognition rate for the two used databases. When applying the DAUB12 filter to CASIA database, the FAR and FRR are equal to 1.053%, while the recognition rate is 97.89%. For Bath database the recognition rate when applying DAUB12 filter is 100%. CASIA and Bath databases are obtained through personal communication. These databases are used in this paper.

We solvein this paper some machine scheduling problems with certain conditions; the solution had been made by using dynamic programming procedures with a fixed time for all the algorithms. Some of the algorithms described in the paper represent a modification to some mathematical programming algorithms and some of them are new or a generalization to others. The optimal solution of all these algorithms will be done with a fixed complexity time, which may lead us to solve them easier and faster.

The centaral problem in stream cipher cryptograph is the the difficulty to generate a long unpredicatable sequence of binary signals from short and random key. Unpredicatable sequence are desirable in cryptography because it is impossible, given a reasonable segment of its signals and computer resources, to find out more about them. Pseudorandom bit generators have been widely used to construct these sequences. The paper presents a PN sequence generator that uses neural network. Computer simulation tests have been carried out to check the randomness of the generated through statistical tests. There tests have shown the successful PN sequence generator passes all the recommended tests. The paper also proposes and validates the data encryption and decryption process using neural network instead of using traditional methods (Exclusive or). This task increases the difficulty in the breaking the cipher.

It is not easy to find the Wiener polynomials for generalized distance of compound graphs constructed in the form and for any two disjoint connected graphs and .Therefore, in this paper, we obtain Wiener polynomials for generalized distance of and when and are special graphs such as complete graphs, and stars. The Wiener index of each such graph with respect to the generalized distance is also obtained in this paper. The Wiener polynomial for the generalized distance of the join of any two disjoint connected graphs is also obtained in this paper.

In this paper, we are going to deal with computations of Residues and Poles for the complex functions . We are also going to investigate a new numerical procedure theoretically and its implementation numerically to compute the residue of complex analytic functions with high order poles. The paper needs the knowledge of computing the complex improper integrations.

In this paper, centrally prime and centrally semiprime rings are defined and the relations between these two rings and prime (resp. semiprime) rings are studied.Among the results of the paper some conditions are given under which prime (resp. semiprime) rings become centrally prime (resp.centrally semiprime) as in:1-A nonzero prime (resp. semiprime) ring which has no proper zero divisors is centrally prime (resp.centrally semiprime).Also we gave some other conditions which make prime (resp. semiprime) rings and centrally prime (resp.centrally semiprime) rings equivalent, as in :2-A ring which satisfies the-for multiplicative systems is prime (resp. semiprime) if and only if it is centrally prime (resp.centrally semiprime).3-A ring with identity in which every nonzero element of its center is a unit is prime (resp. semiprime) if and only if it is centrally prime (resp.centrally semiprime).

Let G be a k0-connected graph ,and let ,,be the w- width, distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by: Ww(G;x) is obtained in this paper for some special graphs G such as a cycle , a wheel, a theta graph , a straight hexagonal chain , and Wagner graph .The diameter with respect to the width distance – w, and the Wiener index for each such special graphs are also obtained in this paper.

This paper present a Resilient Backpropagation (RBP) algorithm based on hierarchical neural network for image compression. The proposed technique includes steps to break down large images into smaller blocks for image compression/ decompression process. Furthermore, a Linear Backpropagation (LBP) algorithm is also used to train hierarchical neural network, and both training algorithms are compared. A number of experiments have been achieved, the results obtained, are the compression rate and Peak Signal to Noise Ratio of the compressed/ decompressed images which are presented in this paper.

The n-Hosoya polynomial of a connected graph G of order t is defined by: Hn (G;x) = ∑ Cn (G;x) xk, where, Cn(G,k) is the number of pairs (v,S), in which |S| = n -1, 3 ≤ n ≤ t, v ∈ V(G) , S ⊆ V (G) , such that dn(v,S) = k , for each 0 ≤ k ≤ δn. In this paper, we find the n-Hosoya polynomial of the square of a path and of the square of a cycle. Also, the n-diameter and n-Wiener index of each of the two graphsare determined

In this paper, the Banach contraction method (BCM) was hybridized with the base of the trapezoid (TR) to solve non-linear partial differential equations. The results obtained from (BCM) were improved by (TR). The results obtained from (BCM -TR) proved the efficiency of this method compared to the default method (BCM). This was done by calculating the mean0square0error (MSE) and estimating the absolute0maximum0error (MAE).

In this paper, we studied a flow of fluid in a pipe under the effect of electromagnetic field in a polar coordinate, be done build a mathematical model which represented by system of two dimensional non-linear partial differential equations and we solved it by using Alternating Directions Implicit method (ADI) which is one of the finite differences method, and from the numerical solution indicated the behavior of temperature distribution inside the pipe, be done explication the influence of Rayleigh number and Prandtl number as well as the influence of Eckert number upon the behavior of temperature distribution are also done through the energy equation in polar coordinate, we arrived to steady state from unsteady state, we find the behavior of fluid flow inside the pipe and also we studied the influence of Hartmann number upon the behavior of fluid flow in pipe and all this done through the motion equation in polar coordinate.

The aim of this paper is to find polynomials related to Schultz, and modified Schultz indices of vertex identification chain and ring for hexagonal rings (6 – cycles). Also to find index and average index of all of them.

The important and common applications of process capability indices (PCI’s) is the process capability ratio and the process capability index , and the use of these measures in practical applications is based on the assumption that the process is under statistical control and that the outputs of that process follow the normal distribution. In practice, however, there are many cases in which the outputs of the process are not follow normal distribution, in such cases, calculating PCI’s will lead to misleading results. In this paper, the non-normal production process capability was evaluated. The evaluation process was conducted using four methods: The first method involved the use of Box-Cox power transformation to normal distribution of data and then calculating indicators of the capability process by traditional methods. The second method is by using the weighted variance method, and the third method is by using the Clements’ method based on the percentiles calculation of data, and the fourth method is based on the use of the Darling-Anderson goodness of fit test to accommodate some of the probability distributions of the original data, this test shows that the log-normal distribution is the most appropriate distribution for the data The results showed that although the process is stable and under statistical control, it is not capable based on the value of the process capability index that did not exceed (65%), as the percentage defect units, which is outside the specifications, is large and located between (3.6%) and (13.4%). The results also showed that there is a convergence in the results of the PCI’s calculated by all methods, and that the Clements’ method is the best method as it gives the highest values ​​for the PCI’s. The research recommended studying and calculating other PCI’s like, , , and CMA(τ,v). One of the recommendations for future research and studies is to do a theoretical study to compare the mentioned methods and choose the best ones based on some statistical criteria.

This research paper includes designing and implementing of an Electronic system for managing theses of College of Computer Science and Mathematics, University of Mosul, using replication, C # language and MS SQL Server 2008 databases to be a stable work basis that can be relied upon in the departments’ work as it facilitates the higher administrative bodies in the departments and the deanship Obtaining the required results quickly and accurately, which facilitates and contributes to making the right decisions at the appropriate time and required with the ease of preparing special reports for each student, lecturer and thesis and printing them which it will help the departments head and the scientific committee to complete them if requested, as well as provide various statistics, and to improve administrative efficiency for thesis, the problem of losing thesis data and preserving it from human and natural disasters has been overcome by applying the principle of replication.

Copyright of Arab Journal of Science & Research Publishing is the property of Mussasat Al-Majallah Al-Arabiyah lil-Ulum Wa-Nashr Al-Abhath and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, we define ii-open set in bitopological space as follows: Let ( , , ) be a bitopological space, a subset A of is said to be ( – ii- open set ) if there exist U,V ≠ and U,V such that: A=int1(U) or A=int2 (V) A or A We study some characterizations and properties of this class. Also, we explain the relation between ii- open sets and open sets, i-open sets and α-open sets in bitopological space. Furthermore, we define ii- continuous mapping on bitopological spaces with some properties.

In this paper, we study zero-divisor graph of the ring Zpmqr and give some properties of this graph. Also, we find the chromatic number, Hosoya polynomial and Wiener index of this graph.

Cabrera-Mohammed proved that the imbedding of a norm ideal on Hilbert space in algebra of quotients with bounded evaluation is continuous with other properties. In this paper we improve this result by using complex Banach space instated of Hilbert space.

Dates are a great food that meets many human needs, and the government should encourage and intensify efforts to support the expansion of palm cultivation and development and focus on its production in our country as a means of food security in the future. In addition, palm trees have an important economic role in improving the country's economy. In this paper, a sharp decline in the quality of production will be highlighted. So, the aim of the study is to know the most important types of palm trees that affect the production of tigers for the year 2019 if the study includes 11 governorates, and the multiple linear regression method has been applied in selecting the most important types affecting the production.. and the types of palm trees did not appear Halawi and Khattawi and Khadari any effect on Dates production in the aforementioned year, although these types are considered to be one of the desirable first-class varieties in the Iraqi market, and for export in particular, in a manner that supports the country's economy.

Let R be a commutative ring with identity. We consider ΓB(R) an annihilator graph of the commutative ring R. In this paper, we find Hosoya polynomial, Wiener index, Coloring, and Planar annihilator graph of Zn denote ΓB(Zn) , with n= pm or n=pmq, where p, q are distinct prime numbers and m is an integer with m ≥ 1 .

The process of separating signal from a mixture of signals represents an essential task for many applications including sound signal processing and speech processing systems as well as medical signal processing. In this paper, a review of sound source separation problem has been presented, as well as the methods used to extract features from the audio signal, also, we define the Blind source separation problem and comparing between some of the methods used to solve the problem of source separation.

Due to the increase of development in modern technology which entered in most fields of life including sustainable agriculture; most studies revealed that most lesions result from over irrigation which causes fungi in plant and soil salinity. Recently; some very important terms emerged and changed most agricultural concepts such as the sustainable agriculture, green cities and smart irrigation systems. Most of these systems improved the quality of production and reduced lesions. In this paper a smart irrigation system was designed depending on Field Capacity F.C value, Wilting Point W.P value. In addition to the ranges of moisture that are measured in the field which are important in decision making of irrigation and selecting the best values to rely on such as threshold value in designing for the sake of maintaining moisture in the soil permanently. The best field moisture value was recorded when designing was %24 at threshold value in a clay soil field. Finally; the best types of microcontrollers ESP8266 & ESP-32S and moisture sensors, which are used to upload the data to Adafruit server. Also, the fast and light Message Queuing Telemetry Transport (MQTT) protocol, was used to transfer the ranges of moisture through the system and cloud computing.

Nowadays, the field of Internet of Things (IoT) has become a new trend and one of the most attractive areas of research. It has a wide range of applications; starting from smart devices to developing smart cities. The main issue in this kind of applications is the limitation in network resources (e.g., energy, memory, connectivity, etc.). Most of the works in the literature deal with this issue in a traditional way. For instance, developing routing protocols that find the optimal path for data forwarding. This paper looks to this issue from a different angle. In this work, we aim at testing different mobility patterns and then investigate their impact of the consumption of network resources under particular distributions and data routing protocols. The aspect we aim to investigate and measure is the amount of data exchanged, which in turn affects the power and the memory consumption of a network. We also measure two more aspects; performance stability, and data coverage area. The results show that mobility models play a significant role in the overall network performance.

Copyright of Journal of Mu’tah Lil-Buḥūth wad-Dirāsāt: Humanities & Social Sciences Series is the property of Mutah University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of the College Of Basic Education is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Umm Al-Qura University Journal of Educational & Psychological Sciences is the property of Association of Arab Universities and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Dirasat: Educational Sciences is the property of University of Jordan and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Data stream clustering refers to the process of grouping continuously arriving new data chunks into continuously changing groups to enable dynamic analysis of segmentation patterns. However, the main attention of research on clustering methods till now has been concerned with alteration of the methods updated for static datasets and changes of the available modified methods. Such methods presented only one type of final output clusters, i.e. convex or non-convex shape clusters. This paper presents a novel two-phase parallel hybrid clustering (HPPD) algorithm that identify convex and non-convex groups in online stage and mixed groups in offline stage from data stream. In this work, we first receive the data stream and apply pre-processing step to identify convex and non-convex clusters. Secondly, apply modified EINCKM to present online output convex clusters and modified EDDS to present online output non-convex clusters in parallel scheme. Thirdly, apply adaptive merging strategy in offline stage to give last composed output groups. The method is assessed on a synthetic dataset. The output results of the experiments have authenticate the activeness and effectiveness of the method.

In this paper, has been proposed Algorithm for standard JPEG2000 part one for image compression. The proposed Algorithm was executed by using MATLAB7.11 environment, applied these algorithm on the gray and color images for type of the images natural, medical, Graphics images and remote sensing. Dependence on the Peak Signal-to-Noise Ratio (PSNR) for comparing the result of the proposed Algorithm by using the Daubechies filters 5/3 tap filter and 9/7 tap filter Biothogonal , Another comparison is held concerning the obtained results of the algorithm of ModJPEG and Color-SPECK. Proved the processing results Efficiency performance of proposed Algorithm.

The different types of white blood cells equips us an important data for diagnosing and identifying of many diseases. The automation of this task can save time and avoid errors in the identification process. In this paper, we explore whether using shape features of nucleus is sufficient to classify white blood cells or not. According to this, an automatic system is implemented that is able to identify and analyze White Blood Cells (WBCs) into five categories (Basophil, Eosinophil, Lymphocyte, Monocyte, and Neutrophil). Four steps are required for such a system; the first step represents the segmentation of the cell images and the second step involves the scanning of each segmented image to prepare its dataset. Extracting the shapes and textures from scanned image are performed in the third step. Finally, different machine learning algorithms such as (K* classifier, Additive Regression, Bagging, Input Mapped Classifier, or Decision Table) is separately applied to the extracted (shapes and textures) to obtain the results. Each algorithm results are compared to select the best one according to different criteria’s.

In this paper, we investigated of a new self-scaling by use quasi-Newton method and conjugate gradient method. The new algorithm satisfies a quasi-newton condition and mutually conjugate, and practically proved its efficiency when compared with the well-known algorithms in this domain, by depending on efficiency measure, number of function, number of iteration, and number of constrained, NOF, NOI and NOC.

An ideal I of a ring R is said to be right (left) Pure if for every , there is such that . A ring R is said to be right (left) MP-ring, if every maximal right (left) ideal of R is a left (right) pure. In this paper have been studied some new properties of MP-rings, there connections with strongly regular rings. Some of the main result of the present work are as follows: 1- Let R be aright MP-ring, r(a) is a W-ideal for all then a- Every essential ideal is a direct summand. b- R is strongly regular ring. 2- Let R be aright MP-ring. If R is right almost abelian left NBF ring, then R is strongly regular.

Bank loans play a crucial role in the development of banks investment business. Nowadays, there are many risk-related issues associated with bank loans. With the advent of computerization systems, banks have become able to register borrowers' data according their criteria. In fact, there is a tremendous amount of borrowers’ data, which makes the process of load management a challenging task. Many studies have utilized data mining algorithms for the purpose of loans classification in terms of repayment or when the loans are not based on customers’ financial history. This kind of algorithms can help banks in making grant decisions for their customers. In this paper, the performance of machine learning algorithms has been compared for the purpose of classifying bank loan risks using the standard criteria and then choosing (Multilayer Perceptron) as it has given best accuracy compared to RandomForest, BayesNet, NaiveBayes and DTJ48 algorithms.

The restricted detour distance D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u - v path P in G such that = P. The main goal of this paper is to obtain the restricted detour polynomial of the theta graph. Moreover, the restricted detour index of the theta graph will also be obtained.

In this paper, we used the homotopy analysis method to ordinary differential equations of type boundary value problems with a parameter representing turning points."To show the high accuracy of the solution results, we compare the numerical results applying the standard homotopy analysis method with the integral equation and the numerical solution of the Simpson and Trapezoidal rules."Also, we give the estimated order of convergence (local) and the global estimated order of convergence along the interval.

Integrating mathematics in architectural design and construction helped in generating various design solutions. Thus, aesthetical performance had developed with the involving of advanced mathematics fields and computational software. The main intention of this paper is to study the importance of mathematics in aesthetical architecture performance. Consequently, the research methodology carries out an analysis of different case studies that offered a better perception about the degree of mathematics effectiveness on the aesthetical performance in architecture. The research will investigate to what extent mathematics forms in architecture had actually a great effect on aesthetical architecture performance.

In this paper, the effect of magnetic field on blood flow in stenoted arteries was studied, stokes equations in polar coordinates were used to describe such flow. All flow characteristics were found under the influence of the magnetic field and how this stenosis affects flow.

An ideal K of a ring R is called right (left) generalized pure (GP -ideal) if for every a ∈ K, there exists m ∈ Z+, and b ∈ K such that am = am b ( am = b am) . A ring R is called MLGP-ring if every right maximal ideal is left GP-ideal. In this paper have been studied some new properties of MLGP-rings and the relation between this rings and strongly π-regular rings some of the main result of the present work are as follows: 1- Let R be a local ,MLGP and SXM ring. Then: (a) J (R) = 0. (b) If R is NJ-ring. Then r(am) is a direct sum and for all ∈ R, m ∈ Z+. 2- Let R be a local, SXM and NJ-ring . Then R is strongly π-regular if and only if R i LGP.

In this paper we give a geometrical construction of a ( 56, 2)-blocking set in PG( 2, 19) and We obtain a new (325,18)- arc and a new linear code and apply the Grismer rule so that we prove it an optimal or non-optimal code, giving some examples of field 19 arcs Theorem (2.1).

In this paper, we are using enhancing feedback control on a new continuous 4D autonomous hyper chaotic system proposed by Sadiq A. Mehdi and A. Hayder, Qasim [Analysis of a New Hyperchaotic System with six cross-product nonlinearities terms, 2017], this system has three critical points employs ten terms include six quadratic cross-product nonlinearity terms, We notice that when we apply any linear control method that relies on a single unit control added to the system, the system behavior in this case cannot control it, so we applied enhancing linear feedback control at origin and we noticed that a necessary condition for suppression is getting positive feedback coefficient. Theoretical analysis and numerical simulation check the validity of the results obtained.