http://ccsenet.org/journal/index.php/jmr/issue/feedJournal of Mathematics Research2017-05-17T20:43:57-07:00Sophia Wangjmr@ccsenet.orgOpen Journal Systems<p><strong><span><span lang="EN-US"><br /></span></span></strong></p><p><strong><span><span lang="EN-US">Journal of Mathematics Research </span></span></strong><span lang="EN-US">(ISSN: 1916-9795; E-ISSN 1916-9809) is an open-access, international, double-blind peer-reviewed journal published by the <a href="http://web.ccsenet.org/">Canadian Center of Science and Education</a>. This journal, published <strong><span>bimonthly</span></strong> (February, April, June, August, October and December) in <strong><span>both print and online versions</span></strong>, keeps readers up-to-date with the latest developments in all aspects of mathematics.</span></p><div class="Section1"><strong>The scopes of the journal </strong>include, but are not limited to, the following topics:</div><div class="Section1"><p align="left"><span lang="EN-US">Algebra, Analysis, Approximation Theory, Cryptography, Dynamical Systems, Geometry and Topology, Graph Theory, Information Theory, Logic and Foundations of Mathematics, Mathematical Physics, Number Theory, Numerical Analysis, Operations Research, Probability Theory, Statistics, Theory of Computation</span></p></div><p class="Section1">This journal accepts article submissions<strong> <a href="/journal/index.php/jmr/information/authors">online</a> or by <a href="mailto:jmr@ccsenet.org">e-mail</a> </strong>(jmr@ccsenet.org).</p><div class="Section1"><br /><br /><strong><strong><em><img src="/journal/public/site/images/jmr/jmr.jpg" alt="jmr" width="201" height="264" align="right" hspace="20" /></em></strong><strong>ABSTRACTING AND INDEXING:</strong></strong></div><div class="Section1"><strong><br /></strong></div><div class="Section1"><ul><li><a href="http://media2.proquest.com/documents/titlelist_aerospace.xls"><strong><span lang="EN-US">Aerospace Database</span></strong></a></li><li><strong>BASE (Bielefeld Academic Search Engine)</strong></li><li><strong><a href="http://media2.proquest.com/documents/titlelist_civilengineering.xls"><span lang="EN-US">Civil Engineering Abstracts</span></a><br /></strong></li><li><a href="http://www.ebscohost.com/"><strong>EBSCOhost</strong></a></li><li><strong>Google Scholar</strong></li><li><strong>JournalTOCs</strong></li><li><strong>LOCKSS</strong></li><li><strong>MathEDUC</strong></li><li><strong><a href="http://www.ams.org/dmr/JournalList.html">Mathematical Reviews</a>® (<a href="http://www.ams.org/mathscinet">MathSciNet</a>®) (-2012)</strong></li><li><strong>MathGuide</strong></li><li><strong>MIAR</strong></li><li><strong>NewJour</strong></li><li><strong>OCLC Worldcat</strong></li><li><a href="http://j-gate.informindia.co.in/"><strong>Open J-Gate</strong></a></li><li><strong>SHERPA/RoMEO</strong></li><li><strong>Standard Periodical Directory</strong></li><li><strong><a href="http://ulrichsweb.serialssolutions.com/login">Ulrich's</a></strong></li><li><strong>Universe Digital Library</strong></li><li><strong><a href="https://zbmath.org/journals/?q=se:00006772">ZbMATH</a> (2009-2013)</strong></li></ul></div><div class="Section1"><strong><br /></strong></div><div class="Section1"> </div>http://ccsenet.org/journal/index.php/jmr/article/view/68094Nonexistence of Nontrivial Stationary Solutions with Decay Order for Some Nonlinear Evolution Equations2017-05-17T20:43:57-07:00Jeng-Eng LinJengEng.Lin@georgetown.edu<p><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">We show that there are no nontrivial stationary solutions of certain decay order for some applied nonlinear evolution equations which include the thin epitaxial film model with slope selection and the square phase field crystal (SPFC) equation. The method is to use the Morawetz multiplier and the Gagliardo-Nirenberg inequality.</span></span></p>2017-05-03T00:00:00-07:00Copyright (c) 2017 Jeng-Eng Linhttp://ccsenet.org/journal/index.php/jmr/article/view/67661Quadratic form Approach for the Number of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields2017-05-17T20:43:57-07:00Yasanthi KottegodaYKottegoda@newhaven.eduWe consider homogeneous linear recurring sequences over a finite field $\mathbb{F}_{q}$, based on an irreducible characteristic polynomial of degree $n$ and order $m$. Let $t=(q^{n}-1)/ m$. We use quadratic forms over finite fields to give the exact number of occurrences of zeros of the sequence within its least period when $t$ has q-adic weight 2. Consequently we prove that the cardinality of the set of zeros for sequences from this category is equal to two.2017-05-08T00:00:00-07:00Copyright (c) 2017 Yasanthi Kottegodahttp://ccsenet.org/journal/index.php/jmr/article/view/65849Convergence Analysis for Mixed Finite Element Method of Positive Semi-definite Problems2017-05-17T20:43:57-07:00Yirang Yuanyryuan@sdu.edu.cn<p>A mixed element-characteristic finite element method is put forward to approximate three-dimensional incompressible miscible positive semi-definite displacement problems in porous media. The mathematical <br />model is formulated by a nonlinear partial differential system. The flow equation is approximated by a mixed element scheme, and the pressure and Darcy velocity are computed at the same time. The concentration equation is treated by the method of characteristic finite element, where the convection term is discretized<br /> along the characteristics and the diffusion term is computed by the scheme of finite element. The method of characteristics can confirm strong computation stability at the sharp fronts and avoid numerical dispersion and nonphysical oscillation. Furthermore, a large step is adopted while small time truncation error and high order accuracy are obtained. It is an important feature in numerical simulation of seepage mechanics that the mixed volume element can compute the pressure and Darcy velocity simultaneously and the accuracy of Darcy velocity is improved one order. Using the form of variation, energy method, $L^2$ projection and the technique of priori estimates of differential equations, we show convergence analysis for positive semi-definite problems. Then a powerfu tool is given to solve international famous problems.</p>2017-05-08T00:00:00-07:00Copyright (c) 2017 Yirang Yuanhttp://ccsenet.org/journal/index.php/jmr/article/view/66342An Addendum on Postoptimality of Maximally Reliable Path2017-05-17T20:43:57-07:00Ahmad Hosseiniahmad.s.hosseini@gmail.comBita Kabir Baikibita.kabiri@gmail.com<p>This paper studies one aspect of the robustness of optimal solutions to the \textit{maximally reliable path} and investigates the infimum and supremum multiplicative perturbations each individual arc can tolerate preserving the optimality of a given optimal path. When such marginal values are to be determined simultaneously for all arcs in a network, considerable duplication of effort can be avoided through the use of our proposed approach.</p>2017-05-17T00:00:00-07:00Copyright (c) 2017 Ahmad Hosseini, Bita Kabir Baikihttp://ccsenet.org/journal/index.php/jmr/article/view/68310Modeling and Resolution of the Allocation Problem of the Time Slots in Dakar Airport2017-05-17T20:43:57-07:00Youssouf Ahamadadethidione79@gmail.comSalimata G. Diagnedethidione79@gmail.comAmadou Coulibalydethidione79@gmail.comD'ethi'e Dionedethidione79@gmail.comN'dogotar Nliodethidione79@gmail.comYoussou Gninguedethidione79@gmail.comIn this article, we proposed a programming linear model in integer numbers(PLIN) for the optimal allocation of the time slots in the international Leopold Sedar Senghor airport of Dakar (L.S.S). The slots are specific allocated periods which allow an aircraft to land or take off in a saturated airport. Their attribution depends on the<br />configuration of the airport, more particularly on its capacity. We maximize the confirmed demand in each slot and take the number of aircrafts and the number of manageable passengers with an optimal quality service into account. We used the CPLEX software so that to test the effectiveness of the linear model. Firstly, in the proposed model linear in integer numbers, any unmet demand was isolated. Secondly, the rejected demands by introducing a model and an algorithm of resolution based on the dynamic programming.2017-05-17T00:00:00-07:00Copyright (c) 2017 Youssouf Ahamada, Salimata G. Diagne, Amadou Coulibaly, D'ethi'e Dione, N'dogotar Nlio, Youssou Gninguehttp://ccsenet.org/journal/index.php/jmr/article/view/66426The [a,b]-domination and [a,b]-total Domination of Graphs2017-05-17T20:43:57-07:00Xiujun Zhangyanghong01@cdu.edu.cnZehui Shaoyanghong01@cdu.edu.cnHong Yangyanghong01@cdu.edu.cnA subset $S$ of the vertices of $G = (V, E)$ is an $[a, b]$-set if for every vertex $v$ not in $S$ we have the number of neighbors of $v$ in $S$ is between $a$ and $b$ for non-negative integers $a$ and $b$, that is, every vertex $v$ not in $S$ is adjacent to at least $a$ but not more than $b$ vertices in $S$. The minimum cardinality of an $[a, b]$-set of $G$ is called the $[a, b]$-domination number of $G$. The $[a, b]$-domination problem is to determine the $[a, b]$-domination number of a graph. In this paper, we show that the [2,b]-domination problem is NP-complete for $b$ at least $3$, and the [1,2]-total domination problem is NP-complete. We also determine the [1,2]-total domination and [1,2] domination numbers of toroidal grids with three rows and four rows.2017-05-17T00:00:00-07:00Copyright (c) 2017 Yang Hong, Zhang Xiujun, Shao Zehui