권호 표지

Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (KSCAM)

  • 연3회간
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)

Domain

  • Mathematics ＞ Applied Mathematics

Aim & Scope

This is a broad based journal covering all branches of computational or applied mathematics with special encouragement to researchers in theoretical computer science and mathematical Informatics. Thus, the major areas, such as Numerical Analysis, Discrete Optimization, Linear and Nonlinear Programming, Theory of Computation(Computational Complexity, Automata and Formal Languages), Control Theory, Theory of Algorithms, Computational Logic, Applied Combinatorics (including graphs, codes, and designs), Coding Theory, Cryptographics, Big data, AI, Fuzzy Theory with applications, Differential Equations with applications, etc., are all included. A large variety of scientific problems also necessarily involve Algebra, Analysis, Geometry, Probability and Statistics, and so on. The journal welcomes research papers in all branches of mathematics which have some bearing on the application to scientific problems, including papers in the areas of Actuarial Science, Mathematical Biology, Mathematical Economics and Finance.

KSCI KCI SCOPUS

Volume 32 Issue 1_2

  1. Farahani, Mohammad Reza 1
    https://doi.org/10.14317/jami.2014.001 PDF KSCI KPUBS HTML
    Let G = (V ; E) be a simple undirected graph without loops and multiple edges, the vertex and edge sets of it are represented by V = V (G) and E = E(G), respectively. A weighting w of the edges of a graph G induces a coloring of the vertices of G where the color of vertex v, denoted $S_v:={\Sigma}_{e{\ni}v}\;w(e)$. A k-edge-weighting of a graph G is an assignment of an integer weight, w(e) ${\in}${1,2,...,k} to each edge e, such that two vertex-color $S_v$, $S_u$ be distinct for every edge uv. In this paper we determine an exact 3-edge-weighting of complete graphs $k_{3q+1}\;{\forall}_q\;{\in}\;{\mathbb{N}}$. Several open questions are also included.
  2. Kumar, Devendra 7
    https://doi.org/10.14317/jami.2014.007 PDF KSCI KPUBS HTML
    Erlang-truncated exponential distribution is widely used in the field of queuing system and stochastic processes. This family of distribution include exponential distribution. In this paper we establish some exact expression and recurrence relations satisfied by the quotient moments and conditional quotient moments of the upper record values from the Erlang-truncated exponential distribution. Further a characterization of this distribution based on recurrence relations of quotient moments of record values is presented.
  3. Sohn, Gyoyong 17
    https://doi.org/10.14317/jami.2014.017 PDF KSCI KPUBS HTML
    In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of genus 3 hyperelliptic curves of type $y^2=x^7+ax$ over finite prime fields. The problem of determining the group order of the Jacobian varieties of algebraic curves defined over finite fields is important not only arithmetic geometry but also curve-based cryptosystems in order to find a secure curve. Based on this, we provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian variety of hyperelliptic curve $y^2=x^7+ax$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ modulo 12. Moreover, we also introduce some implementation results by using our algorithm.
  4. Al-Roqi, Abdullah M. 27
    https://doi.org/10.14317/jami.2014.027 PDF KSCI KPUBS HTML
    The notion of generalized (regular) (${\alpha},\;{\beta}$)-derivations of a BCI-algebra is introduced, some useful examples are discussed, and related properties are investigated. The condition for a generalized (${\alpha},\;{\beta}$)-derivation to be regular is provided. The concepts of a generalized F-invariant (${\alpha},\;{\beta}$)-derivation and ${\alpha}$-ideal are introduced, and their relations are discussed. Moreover, some results on regular generalized (${\alpha},\;{\beta}$)-derivations are proved.
  5. File, Gemechis;Reddy, Y.N. 39
    https://doi.org/10.14317/jami.2014.039 PDF KSCI KPUBS HTML
    In this paper, a non-asymptotic method is presented for solving singularly perturbed delay differential equations whose solution exhibits a boundary layer behavior. The second order singularly perturbed delay differential equation is replaced by an asymptotically equivalent first order neutral type delay differential equation. Then, Simpson's integration formula and linear interpolation are employed to get three term recurrence relation which is solved easily by Discrete Invariant Imbedding Algorithm. Some numerical examples are given to validate the computational efficiency of the proposed numerical scheme for various values of the delay and perturbation parameters.
  6. Kwon, Joong-Sung;Shim, Hong-Tae 55
    https://doi.org/10.14317/jami.2014.055 PDF KSCI KPUBS HTML
    In this paper, we will obtain Marcinkiewicz's type limit laws for fuzzy random sets as follows : Let {$X_n{\mid}n{\geq}1$} be a sequence of independent identically distributed fuzzy random sets and $E{\parallel}X_i{\parallel}^r_{{\rho_p}}$ < ${\infty}$ with $1{\leq}r{\leq}2$. Then the following are equivalent: $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ a.s. in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in probability in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_1$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_r$ where $S_n={\Sigma}^n_{i=1}\;X_i$.
  7. Srivastava, Shwetabh;Gupta, D.K. 61
    https://doi.org/10.14317/jami.2014.061 PDF KSCI KPUBS HTML
    This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.
  8. Tan, Huixuan;Feng, Hanying;Feng, Xingfang;Du, Yatao 75
    https://doi.org/10.14317/jami.2014.075 PDF KSCI KPUBS HTML
    In this paper, we consider the periodic boundary value problem with sign changing nonlinearity $$u^{{\prime}{\prime}{\prime}}+{\rho}^3u=f(t,u),\;t{\in}[0,2{\pi}]$$, subject to the boundary value conditions: $$u^{(i)}(0)=u^{(i)}(2{\pi}),\;i=0,1,2$$, where ${\rho}{\in}(o,{\frac{1}{\sqrt{3}}})$ is a positive constant and f(t, u) is a continuous function. Using Leggett-Williams fixed point theorem, we provide sufficient conditions for the existence of at least three positive solutions to the above boundary value problem. The interesting point is the nonlinear term f may change sign.
  9. Lee, Kwankyu 83
    https://doi.org/10.14317/jami.2014.083 PDF KSCI KPUBS HTML
    We reformulate an interpolation-based unique decoding algorithm of AG codes, using the theory of Gr$\ddot{o}$bner bases of modules on the coordinate ring of the base curve. The conceptual description of the reformulated algorithm lets us better understand the majority voting procedure, which is central in the interpolation-based unique decoding. Moreover the smaller Gr$\ddot{o}$bner bases imply smaller space and time complexity of the algorithm.
  10. Jayswal, Anurag;Ahmad, I.;Prasad, Ashish Kumar 99
    https://doi.org/10.14317/jami.2014.099 PDF KSCI KPUBS HTML
    In this paper, we have taken step in the direction to establish weak, strong and strict converse duality theorems for three types of dual models related to multiojective fractional programming problems involving ($H_p$, r)-invex functions.
  11. Chung, Nguyen Thanh 113
    https://doi.org/10.14317/jami.2014.113 PDF KSCI KPUBS HTML
    Consider a class of p(x)-Kirchhoff type equations of the form $$\left\{-M\left({\int}_{\Omega}\;\frac{1}{p(x)}{\mid}{\nabla}u{\mid}^{p(x)}\;dx\right)\;div\;({\mid}{\nabla}u{\mid}^{p(x)-2}{\nabla}u)={\lambda}V(x){\mid}u{\mid}^{q(x)-2}u\;in\;{\Omega},\\u=0\;on\;{\partial}{\Omega},$$ where p(x), $q(x){\in}C({\bar{\Omega}})$ with 1 < $p^-\;:=inf_{\Omega}\;p(x){\leq}p^+\;:=sup_{\Omega}p(x)$ < N, $M:{\mathbb{R}}^+{\rightarrow}{\mathbb{R}}^+$ is a continuous function that may be degenerate at zero, ${\lambda}$ is a positive parameter. Using variational method, we obtain some existence and multiplicity results for such problem in two cases when the weight function V (x) may change sign or not.
  12. Lee, Yutae 129
    https://doi.org/10.14317/jami.2014.129 PDF KSCI KPUBS HTML
    One of the fundamental issues in the design of dynamic spectrum access policy is the modeling of the dynamic behavior of channel occupancy by primary users. Under a Markovian modeling of channel occupancy, a periodic sensing and greedy access policy is known as one of the simple and practical dynamic spectrum access policies in cognitive radio networks. In this paper, the primary occupancy of each channel is modeled as a discrete-time alternating renewal process with generally distributed on- and off-periods. A periodic sensing and greedy access policy is constructed based on the general channel occupancy model. Simulation results show that the proposed policy has better throughput than the policies using channel models with exponentially distributed on- or off-periods.
  13. Zhou, Chenxing;Liang, Sihua 137
    https://doi.org/10.14317/jami.2014.137 PDF KSCI KPUBS HTML
    In this paper, we prove, in the spirit of [3, 12, 20, 22, 23], the existence of infinitely many small solutions to the following quasilinear elliptic equation $-{\Delta}_{p(x)}u+{\mid}u{\mid}^{p(x)-2}u={\mid}u{\mid}^{q(x)-2}u+{\lambda}f(x,u)$ in a smooth bounded domain ${\Omega}$ of ${\mathbb{R}}^N$. We also assume that $\{q(x)=p^*(x)\}{\neq}{\emptyset}$, where $p^*(x)$ = Np(x)/(N - p(x)) is the critical Sobolev exponent for variable exponents. The proof is based on a new version of the symmetric mountainpass lemma due to Kajikiya [22], and property of these solutions are also obtained.
  14. Verma, Khushboo;Gulati, T.R. 153
    https://doi.org/10.14317/jami.2014.153 PDF KSCI KPUBS HTML
    In this paper, we introduce a pair of higher-order symmetric dual models/problems. Weak, strong and converse duality theorems for this pair are established under the assumption of higher-order invexity. Moreover, self duality theorem is also discussed.
  15. Kim, So-Youn;Baek, Jong-Il 161
    https://doi.org/10.14317/jami.2014.161 PDF KSCI KPUBS HTML
    We in this paper obtained the theoretical results for multivariate stochastic processes which help us to extended negatively orthant dependent(ENOD) structures among hitting times of the processes. In addition, some applications are given to illustrate these concepts.
  16. Srivastava, Shwetabh;Gupta, D.K. 171
    https://doi.org/10.14317/jami.2014.171 PDF KSCI KPUBS HTML
    A higher order iterative method to compute the Moore-Penrose inverses of arbitrary matrices using only the Penrose equation (ii) is developed by extending the iterative method described in [1]. Convergence properties as well as the error estimates of the method are studied. The efficacy of the method is demonstrated by working out four numerical examples, two involving a full rank matrix and an ill-conditioned Hilbert matrix, whereas, the other two involving randomly generated full rank and rank deficient matrices. The performance measures are the number of iterations and CPU time in seconds used by the method. It is observed that the number of iterations always decreases as expected and the CPU time first decreases gradually and then increases with the increase of the order of the method for all examples considered.
  17. Zahra, W.K.;El-Azab, M.S.;Mhlawy, Ashraf M. El 185
    https://doi.org/10.14317/jami.2014.185 PDF KSCI KPUBS HTML
    In this paper, we construct a numerical method to solve singularly perturbed one-dimensional parabolic convection-diffusion problems. We use Euler method with uniform step size for temporal discretization and exponential-spline scheme on spatial uniform mesh of Shishkin type for full discretization. We show that the resulting method is uniformly convergent with respect to diffusion parameter. An extensive amount of analysis has been carried out to prove the uniform convergence with respect to the singular perturbation parameter. The obtained numerical results show that the method is efficient, stable and reliable for solving convection-diffusion problem accurately even involving diffusion parameter.
  18. Im, Young Bin;Lee, Joo Sung;Cho, Yung Duk 203
    https://doi.org/10.14317/jami.2014.203 PDF KSCI KPUBS HTML
    We define and characterize a somewhat fuzzy ${\gamma}$-irresolute continuous mapping and a somewhat fuzzy irresolute ${\gamma}$-open mapping on a fuzzy topological space.
  19. Zhu, Jianguang;Hao, Binbin 211
    https://doi.org/10.14317/jami.2014.211 PDF KSCI KPUBS HTML
    A new class of smoothing functions is introduced in this paper, which includes some important smoothing complementarity functions as its special cases. Based on this new smoothing function, we proposed a smoothing Newton method. Our algorithm needs only to solve one linear system of equations. Without requiring the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Numerical results indicate that the smoothing Newton method based on the new proposed class of smoothing functions with ${\theta}{\in}(0,1)$ seems to have better numerical performance than those based on some other important smoothing functions, which also demonstrate that our algorithm is promising.
  20. Hakimi-Nezhaad, Mardjan;Hua, Hongbo;Ashrafi, Ali Reza;Qian, Shuhua 227
    https://doi.org/10.14317/jami.2014.227 PDF KSCI KPUBS HTML
    Suppose G is a simple graph. The ${\ell}$-eigenvalues ${\delta}_1$, ${\delta}_2$,..., ${\delta}_n$ of G are the eigenvalues of its normalized Laplacian ${\ell}$. The normalized Laplacian Estrada index of the graph G is dened as ${\ell}EE$ = ${\ell}EE$(G) = ${\sum}^n_{i=1}e^{{\delta}_i}$. In this paper the basic properties of ${\ell}EE$ are investigated. Moreover, some lower and upper bounds for the normalized Laplacian Estrada index in terms of the number of vertices, edges and the Randic index are obtained. In addition, some relations between ${\ell}EE$ and graph energy $E_{\ell}$(G) are presented.
  21. Goo, Yoon Hoe 247
    https://doi.org/10.14317/jami.2014.247 PDF KSCI KPUBS HTML
    In this paper, we investigate bounds for solutions of nonlinear perturbed differential systems.
  22. Santhakumaran, A.P.;Titus, P.;Ganesamoorthy, K. 255
    https://doi.org/10.14317/jami.2014.255 PDF KSCI KPUBS HTML
    For a connected graph G = (V,E) of order at least two, a set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x - y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G, denoted by m(G). Certain general properties satisfied by the monophonic sets are studied. Graphs G of order p with m(G) = 2 or p or p - 1 are characterized. For every pair a, b of positive integers with $2{\leq}a{\leq}b$, there is a connected graph G with m(G) = a and g(G) = b, where g(G) is the geodetic number of G. Also we study how the monophonic number of a graph is affected when pendant edges are added to the graph.
  23. Zhou, Xiaolin 267
    https://doi.org/10.14317/jami.2014.267 PDF KSCI KPUBS HTML
    The multiresolution analysis for Legendre multiwavelets are given, anti-derivatives of Legendre multiwavelets are used for the numerical solution of differential equations, a special form of multilevel augmentation method algorithm is proposed to solve the disrete linear system efficiently, convergence rate of the Galerkin methods is given and numerical examples are presented.
  24. Song, Yoon J.;Shin, Seon Ho 285
    https://doi.org/10.14317/jami.2014.285 PDF KSCI KPUBS HTML
    In the setting of semidenite linear complementarity problems on $S^n$, we focus on the Stein Transformation $S_A(X)\;:=X-AXA^T$, and show that $S_A$ is (strictly) monotone if and only if ${\nu}_r(UAU^T{\circ}\;UAU^T)$(<)${\leq}1$, for all orthogonal matrices U where ${\circ}$ is the Hadamard product and ${\nu}_r$ is the real numerical radius. In particular, we show that if ${\rho}(A)$ < 1 and ${\nu}_r(UAU^T{\circ}\;UAU^T){\leq}1$, then SDLCP($S_A$, Q) has a unique solution for all $Q{\in}S^n$. In an attempt to characterize the GUS-property of a nonmonotone $S_A$, we give an instance of a nonnormal $2{\times}2$ matrix A such that SDLCP($S_A$, Q) has a unique solution for Q either a diagonal or a symmetric positive or negative semidenite matrix. We show that this particular $S_A$ has the $P^{\prime}_2$-property.