Yazar "Al-Saidi, Nadia M. G." seçeneğine göre listele

Listeleniyor 1 - 7 / 7
  • Küçük Resim Yok
    Yayın
    The effect of harvesting policy on an eco-epidemiological model
    (Maltepe Üniversitesi, 2019) AL-Jubouri, Karrar Q.; Hussien, Reem M.; Al-Saidi, Nadia M. G.
    Considering to the high extent spread of epidemics in the general of individuals of the distressed communities, which the cause of extinction, we suggest and investigate an eco-epidemiological system consisting two different (SIS and SI) infectious diseases in prey population. Such diseases are transmitted within prey species by contact, as well as, the selection of optimal harvesting on predator species is proposed and analyzed. The mathematical model involves four first-order nonlinear ordinary differential equations, which characterize the interaction among the susceptible prey, infected prey, and predator. The predator feeding depends on predation prey according to Holling type-II functional response as well as, the nonlinear incidence for describing the transition of infectious diseases is used. The existence of bionomic equilibria, uniqueness, boundedness of the system solution and the optimal proportionate harvesting policy are discussed.
  • Küçük Resim Yok
    Yayın
    The energy of a tripartite graph
    (AIP Publishing, 2019) Alawn, Nawras A.; Al-Saidi, Nadia M. G.; Rasheed, Rashed T.
    The energy of a graph is used to approximate the total ?-electron energy of molecules. Thus, finding a new technique that facilitates this task is a challenge that has received increased research attention. This paper introduces the eigenvalues of a complete tripartite graph Ti,i,n?2i , for n ? 4, with respect to the adjacency, Laplacian, and signless Laplacian matrices. The chemical HMO approach is particularly successful in the case of the total ?-electron energy. Experiments reveal that some chemical components are equienergetic with the tripartite graph. This finding helps easily derive the HMO of most of these components despite their different structures.
  • Küçük Resim Yok
    Yayın
    The energy of a tripartite graph
    (Maltepe Üniversitesi, 2019) Alawn, Nawras A.; Al-Saidi, Nadia M. G.; Rasheed, Rashed T.
    The energy of a graph is used to approximate the total ?-electron energy of molecules. Thus, finding a new technique that facilitates this task is a challenge that has received increased research attention. This paper introduces the eigenvalues of a complete tripartite graph Ti,i,n?2i , for n ? 4, with respect to the adjacency, Laplacian, and signless Laplacian matrices. The chemical HMO approach is particularly successful in the case of the total ?-electron energy. Experiments reveal that some chemical components are equienergetic with the tripartite graph. This finding helps easily derive the HMO of most of these components despite their different structures.
  • Küçük Resim Yok
    Yayın
    The energy of a tripartite graph
    (AIP Publishing, 2019) Alawn, Nawras A.; Al-Saidi, Nadia M. G.; Rasheed, Rashed T.
    The energy of a graph is used to approximate the total ?-electron energy of molecules. Thus, finding a new technique that facilitates this task is a challenge that has received increased research attention. This paper introduces the eigenvalues of a complete tripartite graph Ti,i,n?2i , for n ? 4, with respect to the adjacency, Laplacian, and signless Laplacian matrices. The chemical HMO approach is particularly successful in the case of the total ?-electron energy. Experiments reveal that some chemical components are equienergetic with the tripartite graph. This finding helps easily derive the HMO of most of these components despite their different structures.
  • Küçük Resim Yok
    Yayın
    Extracting a new fractal and semi-variance attributes for texture images categorization
    (Maltepe Üniversitesi, 2019) Yousif, Suhad A.; Abdul-Wahed, Hussam Y.; Al-Saidi, Nadia M. G.
    Texture feature extraction is one of the essential functions in the field of image processing and pattern recognition. There is a very high demand for finding new attributes for this purpose. The fractal dimension is demonstrated to be an excellent parameter to analyze textures at different scales. In this work, we propose new attributes for image categorization by utilizing two components of texture analysis: fractal and semi-variance characteristics. A set of five attributes is used to investigate different texture patterns. Lacunarity and two other attributes, along with fractal dimension, are four candidates for semi-variance estimation used to ensure a better description of the textured appearance. The Simple K-means method was adapted for clustering purposes and revealed from two to ten different clusters. Subsequently, several classification algorithms were used to categorize a new image form the extracted features; those classification algorithms are Nave bays, Decision tree, and Multilayer Perceptron. Ten-fold cross-validation scheme is also used to reduce the variability of the results.
  • Küçük Resim Yok
    Yayın
    Modifying fractal image compression technique by hybridation of crowding genetic algorithm and scattered method
    (Maltepe Üniversitesi, 2021) Al-Bundi, Shaimaa S.; AL-Jubouri, Karrar Q.; Al-Saidi, Nadia M. G.
    : Fractal image coding is one of the active techniques for image compression. It always motivates for designing efficient algorithms to optimize the search space and reduce computation efforts, which is the main disadvantage of this technique. Hybridizing the metaheuristic methods has a vital interest in the optimization field. In this work, an intelligent search technique based on combining of crowding genetic and scattered search methods is proposed, in which the essential steps (generating a collection of diverse trial solutions, and the combined solutions method) in scattered search replaced by the two essential steps (the recombination and the mutation) in crowding method. Satisfactory results in reducing the computation cost of the fractal image compression technique are obtained.
  • Küçük Resim Yok
    Yayın
    A new approach for the characteristic polynomial of a complete tripartite graph
    (Maltepe Üniversitesi, 2021) Alwan, Nawras A.; Al-Saidi, Nadia M. G.; Abdulaa, Wael J.
    The case k = 3 of a complete k-partite graph is called a complete tripartite graph Tp,q,r. It is a graph that its vertices are decomposed into three disjoint sets such that, no two graph vertices within the same set are adjacent. It has recently attracted much attention due to its important in several applications, especially, in chemistry where some of the molecular orbital compounds are correspondents to the tripartite graph structure. One method of capturing graph structure is through computing of the characteristic polynomial for the matrix characterization M of a graph, which is defined as the determinant | ?I ? M | where I is the identity matrix and ? is the variable of the polynomial. The general technique of the characteristic polynomials evaluation of graphs with large number of vertices is considered as an extremely tiresome problem when it is based on matrix, because its computational complexity is high. In this paper, a new approach for the characteristic polynomial of a complete tripartite graph Ti,i,n?2i, for n ? 4, based on the adjacency matrix is introduced. It shows good efficiency because it reduces the complexity and the difficulty of computation in comparing to some well-known methods especially, for the graphs with large number of vertices.