﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<OAI-PMH xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
  <responseDate>2026-05-01T06:53:00Z</responseDate>
  <request verb="ListRecords" metadataPrefix="oai_dc">http://www.ntmsci.com/jacm/ajaxtool/oai</request>
  <ListRecords>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/7153</identifier>
        <datestamp>2016-04-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Collocation Method with Quintic B-Spline Method for Solving the Hirota equation</dc:title>
          <dc:creator>Khalid Ali, Kamal Raslan, Talaat El Danaf</dc:creator>
          <dc:subject xml:lang="en-US">Collocation Method; Quintic B-Splines method; Hirota equation.</dc:subject>
          <dc:description xml:lang="en-US">In the present article, a numerical method is proposed for the numerical solution of the Hirota equation by using collocation method with the quintic B-spline. We show that the method is unconditionally stable by using Von-Neumann technique. To test accuracy the error norms L2, L? are computed. Two invariants of motion are predestined to locate the conservation properties of the problem, and the numerical scheme give careful and active results. Furthermore, interaction of two and three solitary waves are shown. These results show that the technique introduced here is plain to apply.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2016-04-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7153</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7153</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2016, Vol:1, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7153</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/7160</identifier>
        <datestamp>2016-06-08T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Comparison of sinc methods for the solution of fractional boundary value problems</dc:title>
          <dc:creator>Sertan Alkan, Mehmet Casim Serifoglu, Turgut Yeloglu</dc:creator>
          <dc:subject xml:lang="en-US">Fractional boundary value problems, collocation method, Galerkin method, sinc function, Caputo derivative.</dc:subject>
          <dc:description xml:lang="en-US">In this study, sinc-Galerkin and sinc-collocation methods are presented to solve numerically some well-known class of fractional differential equations (FDEs) utilizing Mathematica. By using these two methods, FDEs with the variable coefficient and boundary values are examined.  To obtain an approximate solution of the given class of differential equations with sinc methods is reduced a system of algebraic equations which is simpler form via theorems. Obtained numerical results and approximate solution functions are presented in the table and graphical forms, respectively. It can be concluded from tables and graphs that sinc-collocation method has the more accurate and effective results than sinc-Galerkin method.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2016-06-08T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7160</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7160</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2016, Vol:1, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7160</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/7215</identifier>
        <datestamp>2016-11-01T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Some Characterizations of Space Curves According to Bishop Frame in Euclidean 3-Space E³</dc:title>
          <dc:creator>Huseyin Kocayigit, Zehra Ari, Ali Özdemir, Merve Sönmez</dc:creator>
          <dc:subject xml:lang="en-US">Bishop frame, slant helix, Laplacian operator</dc:subject>
          <dc:description xml:lang="en-US">In this study, we give some characterizations of space curves according to Bishop frame in Euclidean 3-space E³ by using Laplacian operator and Levi-Civita connection.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2016-11-01T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7215</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7215</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2016, Vol:1, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7215</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/7185</identifier>
        <datestamp>2016-07-26T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Numerical studies for solving System of Linear Fractional Integro-Differential Equations by using least squares method and shifted Chebyshev polynomials of the third kind method</dc:title>
          <dc:creator>Amr Mahdy, Emad M. H. Mohamed</dc:creator>
          <dc:subject xml:lang="en-US">System linear fractional integro-diferential equations, least squares method, Caputo fractional derivativ, fractinal Fredholm.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, a new numerical method for solving a linear system of fractional integro-
differential equations is presented. The fractional derivative is considered in the Caputo
sense. The method is least squares method aid of shifted Chebyshev polynomials of the
third kind method introduced roposed . The suggested method reduces this type of system
to the solution of system of linear algebraic equations. To demonstrate the accuracy and
applicability of the presented method some test examples are provided. Numerical results
show that this approach is easy to implement and accurate when applied to integro-
differential equations. We show that the solutions approach to classical solutions as the
order of the fractional derivatives approach All results are obtained by using Mathematics
10 programming.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2016-07-26T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7185</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7185</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2016, Vol:1, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7185</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/7194</identifier>
        <datestamp>2016-09-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Solving systems of ordinary differential equations  in unbounded domains by exponential  Chebyshev collocation method</dc:title>
          <dc:creator>Mohamed  Ramadan, Mohamed Abd- Elsalam</dc:creator>
          <dc:subject xml:lang="en-US">Exponential Chebyshev functions; System of differential equations; Collocation method; Unbounded domains.</dc:subject>
          <dc:description xml:lang="en-US">The purpose of this paper is to investigate the use of exponential Chebyshev collocation method for solving systems of linear ordinary differential equations with variable coefficients in unbounded domains, with most general form of conditions. The definition of the exponential Chebyshev (EC) functions allows us to deal with systems of differential equations defined in the whole domain and with infinite boundaries without singularities or divergence. The method transforms the system of differential equations and the given conditions to block matrix equation with unknown EC coefficients. By means of the obtained matrix equations, a new system of equations which corresponds to the system of linear algebraic equations is gained. Numerical examples are included to illustrate the validity and applicability of the method. </dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2016-09-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7194</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7194</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2016, Vol:1, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7194</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8243</identifier>
        <datestamp>2017-01-25T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">New Numerical Treatment for Solving the KDV Equation</dc:title>
          <dc:creator>K. R. Raslan, Talaat S. EL-Danaf, Khalid K. Ali</dc:creator>
          <dc:subject xml:lang="en-US">Collocation Method; Modified exponential cubic B-Splines method; KdV equation.</dc:subject>
          <dc:description xml:lang="en-US">In the present article, a numerical method is proposed for the numerical solution of the KdV equation by using collocation method with the modified exponential cubic B-spline. In this paper we convert the KdV equation to system of two equations. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms2L, ?L are computed. Three invariants of motion are predestined to determine the preservation properties of the problem, and the numerical scheme leads to careful and active results. Furthermore, interaction of two and three solitary waves is shown. These results show that the technique introduced here is easy to apply.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-01-25T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8243</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8243</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8243</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8259</identifier>
        <datestamp>2017-03-24T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A Model for drug therapy using integrase strand transfer inhibitor for acute and chronic infections of HIV</dc:title>
          <dc:creator>Tesfahun Berhane, Kidus Hunegnaw</dc:creator>
          <dc:subject xml:lang="en-US">CD4+ T cells, Drug therapy, Non-linear incidence rate, Cytotoxic T Lymphocytes</dc:subject>
          <dc:description xml:lang="en-US">A Mathematical model for the effect of integrase stand transfer inhibitor on the HIV infected human immune system is proposed and analyzed. The model considers uninfected CD4+ T-cells, Pre-integrase inhibitor, Post- integrase inhibitor CD4+ T-cells and the virus populations described by a system of ordinary differential equations. The relation between the administered drug efficacy with the virus population has been discussed using numerical
simulation. It is observed that the parameters p and q have a significant effect on the CD4+ T-cells and Virus population.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-03-24T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8259</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8259</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8259</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8244</identifier>
        <datestamp>2016-11-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On the numerical solution of differential-algebraic equations (DAEs) by Laguerre Polynomials approximation</dc:title>
          <dc:creator>Mustafa Bayram</dc:creator>
          <dc:subject xml:lang="en-US">Differential-Algebraic Equations (DAEs), Power Series, Leguerre Polynomials Approximation.</dc:subject>
          <dc:description xml:lang="en-US">In this study, we investigate numerical solution of differential-algebraic equations (DAEs) using the Laguerre polynomials
approximation. Two different problems are solved using the Laguerre polynomials approximation and the solutions are compared with
the exact solutions. Firstly, we calculate the power series of a given equation system and then transform it into Laguerre polynomials
approximation form, which gives an arbitrary order for solving the DAE numerically. Moreover, a Maple algorithm is developed for
numerical solution of differential-algebraic equations (DAEs) with Laguerre polynomials approximation. In Maple Programming, we
sketch graphs of obtained solutions, and are made tables to compare the solutions.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2016-11-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8244</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8244</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2016, Vol:1, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8244</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8367</identifier>
        <datestamp>2017-12-02T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Numerical solutions to two-dimensional integration problems</dc:title>
          <dc:creator>Alexander Carstairs, Valerie  Miller</dc:creator>
          <dc:subject xml:lang="en-US">Delaunay Triangulation, Voronoi Sampling, Simpson Rule, Adaptive Simpson Rule, Quadrature</dc:subject>
          <dc:description xml:lang="en-US">This paper presents numerical solutions to integration problems with bivariate integrands. Using equally spaced nodes in Adaptive Simpson's Rule as a base case, we look at two ways of sampling the domain over which the integration will take place. Drawing from Ouellette and Fiume, we first look at Voronoi sampling along both axes of integration and use the corresponding points as nodes for an unequally spaced Simpson's Rule. Then we look at triangulating the domain of integration and use the Triangular Prism Rules discussed by Limaye. Finally, we take all of these techniques and run simulations over heavily oscillatory and monomial (up to degree five) functions over polygonal regions.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-12-02T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8367</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8367</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8367</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8368</identifier>
        <datestamp>2017-12-02T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On Monotone Generalized Quasi contraction mappings in modular metric spaces with a graph </dc:title>
          <dc:creator>Habtu Zegeye, Tibebu  Hunde, Mengstu G. Sangago</dc:creator>
          <dc:subject xml:lang="en-US">Modular metric space, graph structure, generalized quasi-contraction mappings.</dc:subject>
          <dc:description xml:lang="en-US">One of the most popular result in Mathematics is the Banach Contraction principle in a complete metric space. Due to its wide range of applications, many mathematicians generalized the Banach contraction principle in different directions. One of the generalizations is due to Jachymski [Proc.Am. Math. Soc. 1(136),1359-1373], in which he considered a complete metric space with a graph structure. Alfraidan [Fixed Point Theory and Applications  (2015) 2015:93. doi 10.1186/s13663-015-0341-2] generalized the work of Jachymski for quasi-contraction mappings in both metric and modular metric spaces with a graph structure. Modular metric spaces are more general than the usual metric spaces. In this paper, we extend Alfraidan's result to a generalized quasi contraction mappings.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-12-02T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8368</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8368</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8368</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8270</identifier>
        <datestamp>2017-04-16T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On spherical indicatrices partially null curves in R₂⁴</dc:title>
          <dc:creator>Umit Ziya Savci, Suha  Yilmaz</dc:creator>
          <dc:subject xml:lang="en-US"> Minkowski 4-space, null curves, spherical indicatrices, patially null curves, timelike curves, spacelike curves.</dc:subject>
          <dc:description xml:lang="en-US">In this study, we investigate spherical indicatrix of partially null curves in Semi-Riemann space R²4. First, we calculate Frenet apparatus of tangent, normal, first and second binormal indicatrices. Moreover, we characterized spacelike and timelike null curves in R²4 and we give necessary condition the curve lie on pseudo hypresphere.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-04-16T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8270</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8270</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8270</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8388</identifier>
        <datestamp>2018-01-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Non-homogeneous time fractional heat equation</dc:title>
          <dc:creator>Arman Aghili</dc:creator>
          <dc:subject xml:lang="en-US">Caputo fractional derivative, Non-homogeneous time fractional heat equation, Laplace transform, Fourier transform</dc:subject>
          <dc:description xml:lang="en-US">In this article, the author considered certain non-homogeneous time fractional heat equation which is a generalization of the problem of a viscous ring damper for a freely processing satellite. Transform method is a powerful tool for solving partial fractional differential equations. The result reveals that the transform method is very convenient and effective.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-01-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8388</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8388</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8388</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8290</identifier>
        <datestamp>2017-08-06T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Solution of integral and Integro-Differential equations System using Hybrid  Orthonormal Bernstein and Block-Pulse Functions</dc:title>
          <dc:creator>Mohamed A. Ramadan, Mohamed R. Ali</dc:creator>
          <dc:subject xml:lang="en-US">Orthonormal Bernstein functions, Block-pulse functions, a Coupled System of linear and non linear Volterra , Volterra Integro-Differential equations, integration of the cross product, product matrix, coefficient matrix.</dc:subject>
          <dc:description xml:lang="en-US">This article introduces a numerical method based on an   set of general, hybrid orthonormal Bernstein functions coupled with  Block-Pulse Functions(HOBB) on the interval [0,1]  for approximating solutions of a Coupled System of linear and non linear Volterra integral and Integro-Differential equations. This method reduces a Coupled System of Volterra integral and Integro-Differential equations to a system of algebraic equations. Three numerical examples are illustrated by this method. </dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-08-06T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8290</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8290</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8290</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8327</identifier>
        <datestamp>2017-09-21T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">FGP Approach for Solving Multi-level Multi-objective Quadratic Fractional Programming Problem with Fuzzy parameters </dc:title>
          <dc:creator>M. S. Osman, O. E. Emam, Mohamed Ali</dc:creator>
          <dc:subject xml:lang="en-US">Multi-level programming; Quadratic programming; Fractional programming; Fuzzy sets; Fuzzy goal programming.</dc:subject>
          <dc:description xml:lang="en-US">  In this paper, we consider fuzzy goal programming (FGP) approach for solving multi-level multi-objective quadratic fractional programming (ML-MOQFP) problem with fuzzy parameters in the constraints. Firstly, the concept of the ?-cut approach is applied to transform the set of fuzzy constraints into a common deterministic one. Then, the quadratic fractional objective functions in each level are transformed into quadratic objective functions based on a proposed transformation. Secondly, the FGP approach is utilized to obtain a compromise solution for the ML-MOQFP problem by minimizing the sum of the negative deviational variables. Finally, an illustrative numerical example is given to demonstrate the applicability and performance of the proposed approach.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-09-21T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8327</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8327</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8327</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8328</identifier>
        <datestamp>2017-09-21T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A new characterization of curves on dual unit sphere</dc:title>
          <dc:creator>Ilim Kisi, Sezgin Buyukkutuk, Gunay Ozturk</dc:creator>
          <dc:subject xml:lang="en-US">T-constant, N-constant, dual unit sphere</dc:subject>
          <dc:description xml:lang="en-US">The position vectors of unit speed spherical curves can be expressed
with the help of their Frenet frame vectors. In this paper, we classify such
curves and get certain consequences for T-constant and N-constant types
of curves in dual space D^3.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-09-21T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8328</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8328</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8328</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8326</identifier>
        <datestamp>2017-09-21T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">The right Rieaman-Liouville fractional Hermite-Hadamard type inequalities for quasi-convex functions</dc:title>
          <dc:creator>Dunya Karapınar, Mehmet Kunt</dc:creator>
          <dc:subject xml:lang="en-US">Quasi-convex functions, Hermite-Hadamard inequality, Right Rieaman- Liouville fractional integral, Trapezoid type inequalities, Midpoint type inequalities.</dc:subject>
          <dc:description xml:lang="en-US">Recently, in [5], with a new approach, the authors obtained a new fractional Hermite-Hadamard type inequality for convex  functions by using only the right Riemann-Liouville fractional integral. They also had new equalities to have new fractional trapezoid and midpoint type inequalities for convex functions, In this papers, we will use the same equalities to have new fractional trapezoid and midpoint type inequalities for quasi-convex functions. Our results generalise the study [3].</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-09-21T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8326</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8326</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8326</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8369</identifier>
        <datestamp>2017-12-03T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Application  of the method of lines for solving the KdV-Burger equation</dc:title>
          <dc:creator>Rahma El Sadat,  Mohamed R. Ali</dc:creator>
          <dc:subject xml:lang="en-US"> KdV-Burger equation, the method of lines, Adomian decomposition method, finite difference scheme, Runge–Kutta method.</dc:subject>
          <dc:description xml:lang="en-US">This paper presents two methods for obtaining the solutions to the nonlinear Korteweg-de Vries–Burgers (KdVB) equation. The first is the method of lines (MOL). The second method is Adomian decomposition method (ADM). The numerical results of the MOL are compared with the analytical results of the ADM. In order to show the reliability of the considered methods we have compared the obtained solutions with the exact ones. The results reveal that the both methods are effective and convenient for solving such types of partial differential equations but the method of lines gives accurate results over the analytical method.
</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2017-12-03T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8369</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8369</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2017, Vol:2, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8369</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8382</identifier>
        <datestamp>2018-01-14T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Solving bi-level multi-objective quadratic fractional programming problems in rough environment through FGP approach</dc:title>
          <dc:creator>M. S. Osman, O. E. Emam, Kamal R. Raslan, Farahat A. Farahat</dc:creator>
          <dc:subject xml:lang="en-US">Bi-level programming, multi-objective programming, quadratic fractional programming, fuzzy goal programming, rough set.</dc:subject>
          <dc:description xml:lang="en-US">This paper presents a fuzzy goal programming (FGP) approach for solving bi-level multi-objective quadratic fractional programming (BL-MOQFP) problem when constraints are rough set. At the first phase of the solution approach and to avoid the complexity of the problem, two crisp (BL-MOQFP) problems will be formulated; the first is a (BL-MOQFPP1) where the set of constraints is the upper approximation set, and the second is a (BL-MOQFPP2) where the set of constraints is the lower approximation set. At the second phase, a fuzzy goal programming model for each problem will be formulated using the procedure introduced in [1, 2]. The proposed methodology is illustrated with two numerical examples in order to support the proposed methodology.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-01-14T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8382</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8382</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8382</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8474</identifier>
        <datestamp>2018-04-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On the control of a nonlinear beam</dc:title>
          <dc:creator>Kenan Yildirim, Sertan Alkan</dc:creator>
          <dc:subject xml:lang="en-US">Nonlinear Beam, Optimal Control, Vibration, Maximum Principle</dc:subject>
          <dc:description xml:lang="en-US">In this paper, optimal vibration control of a nonlinear beam is investigated. In order to
achieve the control function, existence and uniqueness of solution
to the system and controllability of the system are discussed.
Deriving maximum principle, optimal control function is obtained
analytically and nonlinear optimal control problem is reduced to
solving a system of partial differential equation for the state
variable and adjoint variable subjected to boundary, initial and
terminal conditions.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-04-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8474</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8474</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8474</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8403</identifier>
        <datestamp>2018-02-24T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Analysis of inverse parabolic problem with non-local boundary condition</dc:title>
          <dc:creator>Irem Baglan, Fatma Kanca</dc:creator>
          <dc:subject xml:lang="en-US">Inverse problem, quasilinear parabolic equation, Crank-Nicolson difference scheme.</dc:subject>
          <dc:description xml:lang="en-US">Aim of the paper is to investigate solution of inverse parabolic problem with non-local boundary condition. Under some natural regularity and consistency conditions on the input data the existence, uniqueness and continuous dependence upon the data of solution are shown by using the generalized Fourier method. Also, an iteration algorithm for the numerical solution of this problem is constructed and examined numerical solution by using linearization and Crank-Nicolson difference scheme.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-02-24T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8403</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8403</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8403</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8381</identifier>
        <datestamp>2018-01-13T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">The inverse problem of  finding a heat source under nonlocal boundary conditions</dc:title>
          <dc:creator>Fatma Kanca</dc:creator>
          <dc:subject xml:lang="en-US">Fourier method, heat source, inverse problems, nonlocal boundary condition, finite difference method.</dc:subject>
          <dc:description xml:lang="en-US">The paper considers the inverse problem of finding a time-dependent heat source in a parabolic equation with the nonlocal boundary condition. Under some assumption on the data the existence and uniqueness of the solution are shown by using the generalized Fourier method. Numerical procedure of this problem is given by using finite-difference method.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-01-13T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8381</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8381</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8381</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8385</identifier>
        <datestamp>2018-01-28T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Refiniments of fractional integral inequalities obtained for p-convex functions</dc:title>
          <dc:creator>Imdat Iscan, Huriye Kadakal, Merve Kiromeroglu</dc:creator>
          <dc:subject xml:lang="en-US">Functionals, Hermite-Hadamard inequality, Hermite-Hadamard-Fejér inequality, Integral inequalities, Convex function, p-convex functions, Riemann-Liouville fractional integral</dc:subject>
          <dc:description xml:lang="en-US">This paper is about obtaining the fractional integral inequalities obtained for p-convex functions with the help of functionals. Firstly, definitions and theorems necessary for our study are given. In the findings of the work, the left sides of the Hermite-Hadamard and Hermite-Hadamard-Fejér inequalities obtained using Riemann-Liouville fractional integrals for p-convex functions were obtained through functionals.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-01-28T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8385</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8385</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8385</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8394</identifier>
        <datestamp>2018-02-14T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Sumudu decomposition method for solving fractional Riccati equation</dc:title>
          <dc:creator>Amr Mahdy, G. M. A. Marai</dc:creator>
          <dc:subject xml:lang="en-US">Caputo derivative, Adomian polynomials, Sumudu transform method, decomposition method, Fractional Riccati equation.</dc:subject>
          <dc:description xml:lang="en-US">In This paper, we propose a numerical algorithm for solving fractional
Riccati equation by using Sumudu decomposition method (SDM). This
method is a combination of the Sumudu transform method and decompo-
sition method. We have apply the concepts of fractional calculus to the
well known population growth modle inchaotic dynamic. The fractional
derivative is described in the Caputo sense. The numerical results shows
that the approach is easy to implement and accurate when applied to
various fractional differentional equations.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-02-14T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8394</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8394</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8394</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8479</identifier>
        <datestamp>2018-11-19T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Evaluation of generalized Mittag-Leffler function method on endemic disease model</dc:title>
          <dc:creator>Hegagi Ali, S.Z Rida, Y. Gh. Gouda, M.M. Farag</dc:creator>
          <dc:subject xml:lang="en-US">Fractional derivatives, non-linear system, generalized Mittag-Leffler function method, endemic model</dc:subject>
          <dc:description xml:lang="en-US">The endemic disease is a world health problem and we suffer from them since the old years. There exist different models that express an endemic disease such as the model we will address during this paper (Susceptible, Exposed, Infections, Recovered) (SEIR) that caused by a  wild-type virus. We use the Generalized Mittag-Leffler Function Method (GMLFM) to obtain the analytical and numerical solution of the SEIR model. We comparing the results that obtained by using this method with the results that obtained by Runge-Kutta (RK4) method  for  taking classical order derivative of the governing equations.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-11-19T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8479</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8479</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8479</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8480</identifier>
        <datestamp>2018-11-19T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On integer additive set-filter graphs</dc:title>
          <dc:creator>N.K. Sudev, K.P. Chithra, K.A. Germina</dc:creator>
          <dc:subject xml:lang="en-US">Integer additive set-labeling, integer additive set-filter labeling, integer additive set-filter graphs.</dc:subject>
          <dc:description xml:lang="en-US">Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$ is defined by $f^+ (uv) = f(u)+ f(v)$, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$. In this paper, we introduce the notion of a particular type of integer additive set-indexers called integer additive set-filter labeling of given graphs and study their characteristics.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-11-19T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8480</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8480</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8480</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8405</identifier>
        <datestamp>2018-02-27T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A comment on the  bianchi groups</dc:title>
          <dc:creator>Murat BEŞENK</dc:creator>
          <dc:subject xml:lang="en-US">Quadratic number field, bianchi groups, suborbital graphs, circuits.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we aim to discuss several the basic arithmetic structure of Bianchi groups. In particularly, we study fundamental domain and directed orbital graphs for the group $PSL(2,\textit{O}_{-1})$.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-02-27T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8405</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8405</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8405</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8481</identifier>
        <datestamp>2018-12-04T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Generalized Berinde-Type Contractions in Partially Ordered G_p-Metric Spaces </dc:title>
          <dc:creator>Meltem KAYA, Hasan FURKAN</dc:creator>
          <dc:subject xml:lang="en-US">Common fixed point, Partially ordered set, $G_{p}$-metric space,  Weakly increasing maps,$(c)$-comparison function.</dc:subject>
          <dc:description xml:lang="en-US">In this manuscript, we view   generalized Berinde-type contractions, which is  known as generalized almost contractions in the literature, in the framework  of partially ordered $G_{p}$-metric spaces  to get some common fixed point results for self-mappings $f$ and $g$ and some fixed point results for a single mapping $f$. Presented theorems generalize several previously obtained  classical results. We also  state some examples which show  the validity of our results.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-12-04T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8481</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8481</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8481</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8436</identifier>
        <datestamp>2018-05-09T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Approximate solutions for fuzzy Volterra integro-differential equations</dc:title>
          <dc:creator>Mohamed Ali</dc:creator>
          <dc:subject xml:lang="en-US">Haar Wavelet, fuzzy Volterra integro-differential equations, product matrix, coefficient matrix, operational matrix</dc:subject>
          <dc:description xml:lang="en-US">We introduce here a simple efficient Haar Wavelet Method for numerical solution of a class of Fuzzy Volterra integro-differential equations of the second kind. The present technique depends on converting nonlinear Fuzzy Volterra integro-differential equations into to system of algebraic equations which solved by using a suitable numerical method. Numerical examples are given to delineate efficiency and accuracy of the present technique.~Comparison of the results is gotten by the Haar Wavelet Method with the exact solution.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-05-09T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8436</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8436</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8436</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8435</identifier>
        <datestamp>2018-05-06T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">The exponential and trigonometric cubic B-spline methods for second order matrix differential equations</dc:title>
          <dc:creator>K. R. Raslan, A. R. Hadhoud, Mohamed Shaalan</dc:creator>
          <dc:subject xml:lang="en-US">Matrix differential equations, exponential cubic B-spline, trigonometric cubic B-spline, kronecker product, frobenius norm</dc:subject>
          <dc:description xml:lang="en-US">The goal of the present paper is to present numerical treatments for solving matrix differential equations of second order using exponential and trigonometric cubic B-splines.  Efficiency and accuracy of the proposed methods are illustrated by calculating the maximum errors. The results of numerical experiments shown by these methods are convenient to be implemented and effective numerical technique for solving matrix differential equations.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-05-06T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8435</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8435</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8435</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8476</identifier>
        <datestamp>2018-11-11T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Integral inequalities for n-times differentiable mappings</dc:title>
          <dc:creator>Cetin Yildiz, Sever S. Dragomir</dc:creator>
          <dc:subject xml:lang="en-US">Hermite-Hadamard Integral Inequality, Hölder Inequality, Jensen Inequality, Convex Functions.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, using integral representations for n-times differentiable mappings, we establish new generalizations of certain Hermite-Hadamard type inequality for convex functions by using fairly elementary analysis. Also a parallel development is made base on concavity.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-11-11T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8476</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8476</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8476</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8475</identifier>
        <datestamp>2018-11-10T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">An efficient method for solving a class of linear and nonlinear fractional boundary value problems</dc:title>
          <dc:creator>Sertan Alkan, Kenan Yildirim</dc:creator>
          <dc:subject xml:lang="en-US">Fractional differential equations, boundary value problems, sinc-collocation method, conformable derivative.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we investigate the sinc collocation method to obtain the approximate solution of fractional boundary value problems based on the conformable fractional derivative. For this purpose a theorem is proved to represent the terms having fractional derivatives in terms of sinc basis functions. Some problems are solved to illustrate the accuracy and efficiency of the presented method. The obtained solutions are compared with the exact solutions of the problems.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-11-10T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8475</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8475</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8475</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8540</identifier>
        <datestamp>2019-06-29T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Two finite iterative algorithms for finding the reflexive and Hermitian reflexive solutions of coupled complex of conjugate and transpose matrix equations</dc:title>
          <dc:creator>Ahmed M. E. Bayoumi</dc:creator>
          <dc:subject xml:lang="en-US">Coupled complex matrix equations, reflexive matrix, Hermitian reflexive matrix, iterative algorithm, inner product, Frobenius norm.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, two finite iterative algorithms for finding the reflexive and Hermitian reflexive solutions of coupled complex
of conjugate and transpose matrix equations are constructed.With these two iterative algorithms, for any initial reflexive and Hermitian
reflexive matrices, the solutions can be obtained within finite iterative steps in the absence of round off errors. Some needed lemmas and
theorems are stated and proved to investigate the convergence of the proposed algorithms. Finally, we report two numerical examples
to verify the theoretical results.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-06-29T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8540</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8540</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8540</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8578</identifier>
        <datestamp>2019-09-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A Time Series Graph Cut Image Segmentation Scheme for Liver Tumors</dc:title>
          <dc:creator>Laramie Paxton, Yufeng Cao, Kevin  Vixie, Yuan Wang, Chaan Ng, Brian Hobbs</dc:creator>
          <dc:subject xml:lang="en-US">Graph Cut, Liver, Tumor, Segmentation, Medical Imaging, Image Analysis</dc:subject>
          <dc:description xml:lang="en-US">Tumor detection in biomedical imaging is a time-consuming process for medical professionals and is not without errors. In recent decades, researchers have developed techniques using a variety of mathematical methods, such as statistical modeling, variational techniques, and machine learning. In this paper, we propose a semi-automatic method for liver segmentation of 2D CT scans into three labels denoting healthy, vessel, or tumor tissue based on graph cuts. First, we create a feature vector for each pixel in a novel way that consists of the 59 intensity values in the time series data and propose a simplified perimeter cost term in the energy functional. We normalize the data and perimeter terms in the functional to execute the graph cut without having to optimize the scaling parameter lambda. In place of a training process, predetermined tissue means are computed based on sample regions identified by expert radiologists. The proposed method also has the advantage of being relatively simple to implement computationally. It was evaluated against ground truth on a clinical CT dataset of 10 tumors, yielding segmentations with a mean Dice similarity coefficient (DSC) of .77, mean volume overlap error (VOE) of 36.7%, and average processing time of 1.25 minutes per slice.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-09-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8578</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8578</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8578</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8489</identifier>
        <datestamp>2018-12-22T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A different construction of the classical fractals via the escape time algorithm</dc:title>
          <dc:creator>Nisa Aslan, Mustafa Saltan, Bünyamin Demir</dc:creator>
          <dc:subject xml:lang="en-US">Classical fractals, folding mappings, expanding mappings, the escape-time algorithm</dc:subject>
          <dc:description xml:lang="en-US">Fractals are fascinating shapes that have many examples in the nature and have the self-similarity property. In recent years, many studies have been made to obtain different fractal sets. There are several methods to generate these sets such as iterated function system (IFS), L-systems and the escape-time algorithm. In this paper, we use the escape-time algorithm to get the classical fractals by some specific folding and expanding mappings. Finally, we clearly give the maple codes that these fractals are obtained.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2018-12-22T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8489</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8489</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2018, Vol:3, Issue:4</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8489</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8523</identifier>
        <datestamp>2019-03-29T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Diagonally Implicit Two Derivative Runge-Kutta Methods for Solving First Order Initial Value Problems</dc:title>
          <dc:creator>Norazak Senu, Nur Amirah Ahmad, Zarina Bibi Ibrahim, Mohamed Othman</dc:creator>
          <dc:subject xml:lang="en-US">Diagonally Implicit methods, IVPs, ODEs, TDRK methods</dc:subject>
          <dc:description xml:lang="en-US">Three Diagonally Implicit Two Derivative Runge-Kutta (DITDRK) methods for the numerical solution of first order Initial Value Problems (IVPs) are derived. We present fourth, fifth and
sixth-order Diagonally Implicit Two Derivative Runge-Kutta methods designed with minimum
number of function evaluations. The stability of the method derived are analyzed. The numerical
experiments are carried out to show the efficiency of the derived methods in comparison
with other existing Runge-Kutta (RK) methods of the same order and properties.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-03-29T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8523</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8523</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8523</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8600</identifier>
        <datestamp>2020-12-13T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On the Double Rational Chebyshev Functions:  Definition, Properties and Application for Partial Differential Equations </dc:title>
          <dc:creator>Mohamed Ramadan, Mahmoud Nassar</dc:creator>
          <dc:subject xml:lang="en-US">Double rational Chebyshev (RC) functions, partial differential equations, semi-infinite domain, collocation method, efficiency</dc:subject>
          <dc:description xml:lang="en-US">In this paper, the concept of double rational Chebyshev (RC) functions on semi-infinite domain (0 ≤ x,y &lt; ∞) and some of their properties are introduced for the first time by the authors. Also, the definition of derivatives for double RC functions is deduced. The proposed definition is employed to deal with partial differential equations with variable coefficients, especially equations defined on semi-infinite domain, using the collocation method. The proposed technique is examined by some numerical test problems to investigate applicability, efficiency and accuracy. The obtained numerical results are compared with other existing methods and the exact solution where it is shown to be very attractive and maintains better accuracy. The technique seems to be very efficient, reliable, accurate and suitable to handle similar problems defined on infinite domains.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2020-12-13T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8600</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8600</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8600</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8534</identifier>
        <datestamp>2019-06-19T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Investigation of Random and Stochastic Models for CD8 T Cell Immune Response</dc:title>
          <dc:creator>Mehmet Merdan, Zafer Bekiryazici, Tulay Kesemen, Halil Anac</dc:creator>
          <dc:subject xml:lang="en-US">Random Differential Equation, Stochastic Differential Equation, Milstein Scheme, Random Effect, Simulation</dc:subject>
          <dc:description xml:lang="en-US">In this study, a mathematical model of pathogen-specific CD8 T Cell immune response has been investigated from a random perspective. The equation system presented by Crauste et al. has been modified for modeling the random nature of T Cell immune responses. Stochastic noise and random effects have been added to the deterministic system and the results have been analyzed for investigating the dynamics of the immune response. Randomness of the event has been interpreted by comparison of the results for the deterministic, random and stochastic cases.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-06-19T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8534</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8534</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8534</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8522</identifier>
        <datestamp>2019-03-29T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Ag-convex functions</dc:title>
          <dc:creator>Huriye Kadakal, İmdat İşcan</dc:creator>
          <dc:subject xml:lang="en-US">Convex function, Ag-convex , Hermite-Hadamard inequality.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, the concept of Ag-convex function is given the first time in the literature. Some inequalities of Hadamard's type for Ag-convex functions are given. Some special cases are discussed.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-03-29T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8522</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8522</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8522</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8601</identifier>
        <datestamp>2020-12-13T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">An analysis of discrete time retrial queuing system with starting failures, Bernoulli feedback with general retrial times and a vacation</dc:title>
          <dc:creator>Jeyakumar S, Gunasekaran P</dc:creator>
          <dc:subject xml:lang="en-US">Discrete time retrial queue, Bernoulli feedback, unreliable server, mean queue length, Markov chain, single vacation</dc:subject>
          <dc:description xml:lang="en-US">This article  is concerned with a discrete time Geo/G/1 retrial queue  with general retrial times, Bernoulli feedback and the server subject to starting failures and a vacation. In this article we generalize the previous works in discrete time retrial queue with unreliable server due to starting failures in the sense that we consider  general service with Bernoulli feed back and general retrial times with single vacation. In this model arrival time follows geometrical distribution and vacation times are generally distributed. In this model the PGF is derived  by using generating function technique  and also we obtain  the analytical expression for mean queue length in performance measure. In numerical examples we analyzed the effects of mean queue length in several possible ways.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2020-12-13T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8601</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8601</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8601</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8519</identifier>
        <datestamp>2019-03-31T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Stability analysis of generalized Ebola Hemorrhagic Fever model</dc:title>
          <dc:creator>A. M. A. El-Sayed, S. Z. Rida, Y. A. Gaber</dc:creator>
          <dc:subject xml:lang="en-US">Fractional differential equations, Ebola Hemorrhagic Fever model, stability, The Natural-Adomian Decomposition method.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we present a generalized Ebola Hemorrhagic Fever model in Caputo sense, which is assumed to have a constant
size of the total population over the period of the disease. We show that this model possesses non-negative solutions as desired in any
population dynamics. The stability of different equilibria of this model are discussed in detail. Natural-Adomian Decomposition method
(N-ADM) is used to compute an analytical solution of the system of nonlinear fractional differential equations governing the problem.
The results are compared with the results obtained by the classical Runge-Kutta method in the case of integer-order derivatives.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-03-31T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8519</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8519</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8519</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8597</identifier>
        <datestamp>2020-06-24T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Hermite-Hadamard type inequalities for fourth-times differentiable arithmetic-harmonically functions</dc:title>
          <dc:creator>Kerim Bekar</dc:creator>
          <dc:subject xml:lang="en-US">Convex function, arithmetic-harmonically-convex function, Hermite-Hadamard’s inequality, H¨older inequality, power-mean inequality.</dc:subject>
          <dc:description xml:lang="en-US">In this study, by using an integral identity together with both the H¨older integral inequality and the power-mean integral inequality we establish several new inequalities for fourth-times differentiable arithmetic-harmonically-convex function. Also, some applications are given for arithmetic-harmonically convex functions.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2020-06-24T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8597</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8597</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2020, Vol:5, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8597</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8599</identifier>
        <datestamp>2020-10-14T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Fixed Point Theorems for Some Multi-Valued Contraction Mappings Defined in Partial Hausdorff Metric Spaces </dc:title>
          <dc:creator>Hacer Bozkurt</dc:creator>
          <dc:subject xml:lang="en-US">Partial metric space, partial Hausdorff metric, fixed point, multi-valued mappings.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we give some fixed point theorems for satisfying dfferent contractive conditions on complete partial Hausdorff metric spaces. Also, we prove some fixed point theorems for two operators that do not necessarily commute with each other to have a common fixed point as in metric spaces. We also state an example in support of our conclusions.

</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2020-10-14T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8599</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8599</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2020, Vol:5, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8599</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8581</identifier>
        <datestamp>2019-12-30T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Split monotone variational inclusion, mixed equilibrium problem and common fixed point for finite families of demicontractive mappings</dc:title>
          <dc:creator> Bashir  Ali, Mohammed Lawan</dc:creator>
          <dc:subject xml:lang="en-US">Split variational inequality problem; mix equilibrium problem; fixed points; demicontractive mappings</dc:subject>
          <dc:description xml:lang="en-US">In this paper  we introduce an iterative scheme for approximating a common element in the set of solution of split monotone variational inclusion, mixed equilibrium problem and common fixed point for finite families of demicontractive mappings. We prove a strong convergence theorem for the sequence generated by the scheme. The results presented generalize and improve some recently announced ones.
</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-12-30T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8581</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8581</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:4</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8581</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8710</identifier>
        <datestamp>2023-03-21T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">The Effects of the Assorted Cross-Correlation Definitions</dc:title>
          <dc:creator>Daniel Greenhoe</dc:creator>
          <dc:subject xml:lang="en-US">correlation, cross-correlation, auto-correlation, spectral density, cross-spectral density, auto-spectral density, power spectral density, ASD, PSD</dc:subject>
          <dc:description xml:lang="en-US">The literature offers varying and in general incompatible definitions of the cross-correlation function Rxy(n,m) and its jointly wide-sense stationary special case Rxy(m). The choice of definition has consequences for results involving the cross-spectral density function Swxy(\omega), and the more general Z-transform density Szxy(z). In some stochastic processing systems involving simple additive noise or even additive noise combined with non-linear operations, these varying definitions lead to identical results. In some other systems involving nonlinear and linear parallel operations, 
including those involving system identification problems, results differ.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2023-03-21T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8710</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8710</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2023, Vol:8, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8710</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8580</identifier>
        <datestamp>2019-11-29T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On Saturated Semigroups</dc:title>
          <dc:creator>Noor Alam</dc:creator>
          <dc:subject xml:lang="en-US">Epimorphism, dominion, medial semigroup, externally commutative semigroup, right commutative semigroup, variety, saturated semigroup, zigzag equations.</dc:subject>
          <dc:description xml:lang="en-US">In this article, we show that the class of permutative semigroups (medial
semigroups) satisfying the homotypical identity [axy = axay] is saturated
and as a corollary, we found that an externally commutative semigroup satisfying
with the identity [ax = axa] is saturated. Next, we show that the variety
[ xy2 = xy;  xyz = yxz (xyz = xzy) ] of semigroups which means the variety of left
(right) commutative semigroups satisfying the identity [xy2 = xy] is saturated.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-11-29T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8580</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8580</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:4</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8580</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8555</identifier>
        <datestamp>2019-10-01T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Chebyshev Wavelet Solution of  Nonlinear Ordinary Differential Equations with Delays</dc:title>
          <dc:creator>Sevin Gümgüm</dc:creator>
          <dc:subject xml:lang="en-US">Chebyshev Wavelets,  Nonlinear Ordinary Differential Equations, Variable Delay, Proportional Delay</dc:subject>
          <dc:description xml:lang="en-US">The purpose of this paper is to illustrate the use of the Chebyshev
wavelet method in the solution of high-order nonlinear ordinary
differential equations with variable, proportional and constant
delays. The main advantage of using Chebyshev polynomials  lies in
the orthonormality property, which enables a decrease in the
computational cost and runtime. The other advantage is that it does
not require domain discretization. The application of the method
transforms the nonlinear equation to a system of algebraic
equations. The method is applied to five differential equations up
to sixth order, and the results are compared with the exact
solutions and other numerical solutions when available. The accuracy
of the method is presented in terms of absolute errors. The
numerical results demonstrate that the method is accurate, effectual
and simple to apply.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-10-01T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8555</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8555</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8555</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8579</identifier>
        <datestamp>2019-12-19T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Analysis of F-statistics under Selection with Continuous and Discrete Models</dc:title>
          <dc:creator>Anuraag Bukkuri</dc:creator>
          <dc:subject xml:lang="en-US">F-statistics, Theoretical Population Genetics</dc:subject>
          <dc:description xml:lang="en-US">The F-statistic is a statistic which measures shared genetic drift among sets of populations and can be used to test various admixture hypotheses. However, thus far, this statistic has only been developed in the context of genetic drift, and ignores other evolutionary forces such as mutation and selection. This paper examines and further develops the F statistic under models of selection. Specifically, the F-statistic is developed under stochastic PDE models or discrete models with additive selection, random fluctuation of selection intensities, and selection with mutation. These results can help expand the scope of these statistics in theoretical population genetics.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2019-12-19T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8579</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8579</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2019, Vol:4, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8579</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8602</identifier>
        <datestamp>2020-12-20T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A mathematical model for cost-effectiveness analysis and early detection of leptospirosis in human</dc:title>
          <dc:creator>Ibrahim Halil Aslan, Suzanne  Lenhart</dc:creator>
          <dc:subject xml:lang="en-US">Markov-cycle tree; Monte Carlo simulations; Leptospirosis.</dc:subject>
          <dc:description xml:lang="en-US">In this study, we developed a computational algorithm under stochas- ticity by using Markov-cycle tree and Monte Carlo simulations for pa- tients coming into a hospital and being suspected of leptospirosis. Our mathematical model finds an optimal treatment strategy for the patients depending on whether they have severe or mild symptoms and whether they are late case patients who are coming to the hospital after seven days of onset of their symptoms or early case patients who are coming to the hospital within seven days of onset of their symptoms. The model is a useful tool to determine the treatment strategies during flood session for a large group of patients.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2020-12-20T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8602</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8602</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8602</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8612</identifier>
        <datestamp>2021-03-25T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Existence of Mild Solution for Neutral Functional Mixed Integrodifferential Evolution Equations with Nonlocal Conditions</dc:title>
          <dc:creator>Manoj Karnatak, Kamalendra Kumar, Rakesh Kumar</dc:creator>
          <dc:subject xml:lang="en-US">Mild solution; Neutral integrodifferential equations; Nonlocal conditions; semigroup theory; Sadovskii’s fixed point theorem</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we explore the existence of the mild solution for nonlinear neutral functional mixed-Volterra integrodifferential evolution equations with the nonlocal condition. The findings are achieved by implementing the fractional power of operators and Sadovskii’s fixed point theorem. As an application, a controllability problem is discussed for the considered systems.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-03-25T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8612</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8612</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8612</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8648</identifier>
        <datestamp>2021-08-08T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Integrity of Variety of Inequalities Sketched on Time Scales</dc:title>
          <dc:creator>Muhammad Jibril Sahir</dc:creator>
          <dc:subject xml:lang="en-US">Time scales, Rogers-Holder's inequality, integral inequality, Jensen-type inequality.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we present extensions of some versions of the dynamic Rogers--H\"{o}lder inequality on time scales. Furthermore, we give an extension of integral inequality on time scales. To conclude this research article, we investigate some dynamic Jensen--type inequalities on time scales. Our approach unifies and extends some continuous inequalities and their corresponding discrete and quantum analogues.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-08-08T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8648</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8648</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8648</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8598</identifier>
        <datestamp>2020-03-14T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Some oscillation criteria for nonlinear conformable fractional differential equations</dc:title>
          <dc:creator>Mustafa Bayram, Aydin Secer</dc:creator>
          <dc:subject xml:lang="en-US">Interval criteria, conformable derivative, oscillation</dc:subject>
          <dc:description xml:lang="en-US">This paper concerns the oscillation problem of a general class of fractional differential equations. New oscillation criteria
for a class of fractional nonlinear differential equations with damping and forcing terms have been established by using the classical
Riccati technique.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2020-03-14T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8598</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8598</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2020, Vol:5, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8598</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8647</identifier>
        <datestamp>2021-08-03T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">Solving Convolution Type Linear Volterra Integral Equations with Kashuri Fundo Transform</dc:title>
          <dc:creator>Nihan Gungor</dc:creator>
          <dc:subject xml:lang="en-US">Integral equations, Integral transforms, Kashuri Fundo transform, Volterra integral equations.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, Kashuri Fundo Transform is used for solving
convolution type linear Volterra integral equations of the first kind and
also convolution type linear Volterra integral equations of the second kind.
Some applications are given to explain the procedure of solution of linear
Volterra integral equations using Kashuri Fundo transform.
</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-08-03T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8647</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8647</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8647</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8662</identifier>
        <datestamp>2021-12-28T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A New Approximate Solution for the Differential Equations Systems of the Spherical Curves with Adomian Decomposition Method</dc:title>
          <dc:creator>Derya Arslan</dc:creator>
          <dc:subject xml:lang="en-US">Spherical curves, system of differential equations, approximate solution, Adomian decomposition method</dc:subject>
          <dc:description xml:lang="en-US">Our purpose is to solve the system of differential equations of spherical curves in 3-dimensional euclidean space using a numerical method such as the Adomian Decomposition Method. In the different values of x, we compare the Adomian decomposition method solution with the exact solution. We demonstrate the obtained numerical results on tables and figures. Thus we prove the reliability of the proposed method with an example.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-12-28T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8662</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8662</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8662</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8655</identifier>
        <datestamp>2021-09-26T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">A Class of Nonlocal Elliptic Equations in Orlicz-Sobolev Spaces</dc:title>
          <dc:creator>Berat Suer, Mustafa Avci, Veyis Turut</dc:creator>
          <dc:subject xml:lang="en-US">Nonlocal elliptic equations, Ginzburg-Landau energy, variational approach, Mountain-Pass theorem, Orlicz-Sobolev spaces. </dc:subject>
          <dc:description xml:lang="en-US">In this article, we are concerned with some classes of nonlocal elliptic equations. We apply the homogenous Dirichlet boundary conditions. Our problem is settled in Orlicz-Sobolev spaces. To obtain the nontrivial solutions, we apply variational approach. The variational approach is a very helpful tool especially to obtain solutions of nonlinear differential equations. The main idea in the variational approach is to designate the corresponding energy functional, which is also known as Euler-Lagrange functional, and then using some auxiliary theorems from functional analysis and nonlinear analysis, such as H\"{o}lder inequality, Lebesgue convergence theorem, continuous and compact embeddings theorems, and Frechet derivative, to find local or global minimizers of the corresponding energy functional, that is, the solutions of the corresponding differential equations.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-09-26T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8655</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8655</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:2</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8655</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8660</identifier>
        <datestamp>2021-12-26T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">The Examples of the Invariant Subspaces in R3: The G-Orbits for Similarity Groups</dc:title>
          <dc:creator>Muhsin Incesu</dc:creator>
          <dc:subject xml:lang="en-US">G-orbits, invariant subspaces, similarity groups</dc:subject>
          <dc:description xml:lang="en-US">Let (G,* ) be a group and X be a nonempty set and the group action G:X be given. In this paper we studied the G-orbits, the invariant subspaces, in R^{3} regarding as G=S(3), all similarity transformations' group in three dimensional Euclidean space, and all subgroups of it.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-12-26T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8660</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8660</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8660</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8661</identifier>
        <datestamp>2021-12-26T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On Some Bullen Type Quantum Integral Inequalities</dc:title>
          <dc:creator>Musa Çakmak</dc:creator>
          <dc:subject xml:lang="en-US">Bullen type inequality, fractional integrals, integral inequalities, q-calculus</dc:subject>
          <dc:description xml:lang="en-US">In this paper, Bullen type inequalities for quantum integral are studied and new integral identity including Bullen type identity for quantum integral is established using q-calculus. Second, some new integral inequalities including Bullen-type inequalities for quantum integral are generated using q-calculus. In addition, the same results were obtained with the existing studies in the literature.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2021-12-26T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8661</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8661</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2021, Vol:6, Issue:3</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8661</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8683</identifier>
        <datestamp>2022-03-31T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">The Solution of Linear Volterra Integral Equation of the First Kind with Aboodh Transform</dc:title>
          <dc:creator>Özgür Kotan, Ercan Celik</dc:creator>
          <dc:subject xml:lang="en-US">Integral Equations, Linear Volterra Integral Equation of the First Kind, Aboodh Transform, Convolution Theorem, Inverse Aboodh Transform</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we apply Aboodh transform to solve linear Volterra integral equation of the first kind. A few examples solved by Aboodh Transform. Aboodh transform is a powerful method for solving linear Volterra integral equations of the first kind. The convolution theorem for the Aboodh transform has been proved.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2022-03-31T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8683</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8683</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2022, Vol:7, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8683</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:ntmsci.com/jacm/ajaxtool/oai:article/8712</identifier>
        <datestamp>2023-05-18T21:00:00Z</datestamp>
        <setSpec>1</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
          <dc:title xml:lang="en-US">On  -type fractional differential equations with measure of noncompactness in Banach space</dc:title>
          <dc:creator>D. Vivek, Elsayed Elsayed, K.  Kanagarajan</dc:creator>
          <dc:subject xml:lang="en-US">ψ-fractional derivative; Initial value problem; Noncompactness; Monch’s fixed point theorem.</dc:subject>
          <dc:description xml:lang="en-US">In this paper, we are concerned with the following ?-type fractional differential equations
with initial conditions in Banach space
cD; y(t) = f(t, y), for t ? J := [0, T], 1 &lt; r &lt; 2, y(0) = y0, y'(0) = y1.
By virtue of the theory of measure of noncompactness associated with Monch’s fixed point
theorem, upon making some suitable assumptions, some existence results of solutions are
obtained.</dc:description>
          <dc:publisher xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publisher>
          <dc:publication xml:lang="en-US">Journal of Abstract and Computational Mathematics</dc:publication>
          <dc:date>2023-05-18T21:00:00Z</dc:date>
          <dc:type>Research Article</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8712</dc:identifier>
          <dc:source xml:lang="en-US">ISSN: 2149-7168</dc:source>
          <dc:source xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8712</dc:source>
          <dc:source xml:lang="en-US">Journal of Abstract and Computational Mathematics, Year:2023, Vol:8, Issue:1</dc:source>
          <dc:relation xml:lang="en-US">http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8712</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
  </ListRecords>
</OAI-PMH>