권호 표지

Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)

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

과학기술표준분류

  • 수학 ＞ 응용수학

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

제22권1_2호

  1. Okuonghae Daniel 1
    This paper presents the interior penalty discontinuous Galerkin finite element methods (DGFEM) for solving the rotating disk electrode problems in electrochemistry. We present results for the simple E reaction mechanism (convection-diffusion equations), the EC' reaction mechanism (reaction-convection-diffusion equation) and the ECE and $EC_2E$ reaction mechanisms (linear and nonlinear systems of reaction-convection-diffusion equations, respectively). All problems will be in one dimension.
  2. Barbaiani Madalina;Bibire Cristina;Dassow Jurgen;Delaney Aidan;Fazekas Szilard;Ionescu Mihai;Liu Guangwu;Lodhi Atif;Nagy Benedek 21
    Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.
  3. Zmazek Blaz;Zerovnik Janez 39
    Let ${\gamma}$(G) be the domination number of a graph G. It is shown that for any $k {\ge} 0$ there exists a Cartesian graph bundle $B{\Box}_{\varphi}F$ such that ${\gamma}(B{\Box}_{\varphi}F) ={\gamma}(B){\gamma}(F)-2k$. The domination numbers of Cartesian bundles of two cycles are determined exactly when the fibre graph is a triangle or a square. A statement similar to Vizing's conjecture on strong graph bundles is shown not to be true by proving the inequality ${\gamma}(B{\bigotimes}_{\varphi}F){\le}{\gamma}(B){\gamma}(F)$ for strong graph bundles. Examples of graphs Band F with ${\gamma}(B{\bigotimes}_{\varphi}F) < {\gamma}(B){\gamma}(F)$ are given.
  4. Shanthi V.;Ramanujam N.;Natesan S. 49
    A robust numerical method for a singularly perturbed second-order ordinary differential equation having two parameters with a discontinuous source term is presented in this article. Theoretical bounds are derived for the derivatives of the solution and its smooth and singular components. An appropriate piecewise uniform mesh is constructed, and classical upwind finite difference schemes are used on this mesh to obtain the discrete system of equations. Parameter-uniform error bounds for the numerical approximations are established. Numerical results are provided to illustrate the convergence of the numerical approximations.
  5. Xiao Mingqing;Lin Yuan;Myatt James H.;Camphouse R. Chris;Banda Siva S. 67
    In this paper, we present a finite difference method for the implementation of the rotation of a circular cylinder in the incompressible flow field by solving the two-dimensional unsteady Navier-Stokes equations. The approach is to use staggered grid method so that the accuracy and order of convergence of the associated algorithms can be maintained. The proposed method is easy to be implemented and is effective. A set of simulations for the flow dynamics is provided to show the computational results.
  6. Jung Hwan-Ok 83
    A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper, by characterizing the circuit graphs and investigating the structure of LV-graphs, we extend his result to 3-connected infinite locally finite VAP-free plane graphs.
  7. Kang Wenhua;Xiang Hua 95
    In this paper, the authors investigate the condition number with their condition numbers for weighted Moore-Penrose inverse and weighted least squares solution of min /Ax - b/M, where A is a rank-deficient complex matrix in $C^{m{\times}n} $ and b a vector of length m in $C^m$, x a vector of length n in $C^n$. For the normwise condition number, the sensitivity of the relative condition number itself is studied, the componentwise perturbation is also investigated.
  8. Zhang Chunrui;Zheng Baodong 113
    In this paper we consider the numerical solution of the sunflower equation. We prove that if the sunflower equation has a Hopf bifurcation point at a = ao, then the numerical solution with the Euler-method of the equation has a Hopf bifurcation point at ah = ao + O(h).
  9. Ryoo C.S. 125
    It is the aim of this paper to introduce the Genocchi numbers Gn and polynomials Gn(x) and to display the shape of Genocchi polynomials Gn(x). Finally, we investigate the roots of the Genocchi polynomials Gn(x).
  10. Liu Yong-Jin;Zhang Li-Wei;Wang Yin-He 133
    This paper proposes a smoothing method for symmetric conic linear programming (SCLP). We first characterize the central path conditions for SCLP problems with the help of Chen-Harker-Kanzow-Smale smoothing function. A smoothing-type algorithm is constructed based on this characterization and the global convergence and locally quadratic convergence for the proposed algorithm are demonstrated.
  11. Dong Lingzhen;Chen Lansun;Sun Lihua;Jia Jianwen 149
    In this paper, we consider the Lotka- Volterra predator-prey system, in which constant quantity of the prey is harvested in regular pulses. The ultimate behavior of the solutions starting from different regions is mainly studied. Further, some examples are given to illustrate our results.
  12. Qian Jian-Fa;Zhang Li-Na;Zhu Shi-Xin 159
    The transform domain characterization of cyclic codes over finite fields using Discrete Fourier Transform(DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$. We give a way to characterize cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$ by Mattson-Solomon polynomials and multiple defining sets.
  13. Yun Jae-Heon;Kim Eun-Heui;Oh Se-Young 169
    We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. Next, we study the validity of m-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.
  14. Liu San-Ming;Feng En-Min 181
    In this paper, multiobjective generalized fractional programming problems with set functions are considered, in which objective functions are maximum of finite fractional set functions. At first, optimality conditions are established. Then, saddle existence theorem is proved.
  15. Ge Ren-Dong;Xia Zun-Quan;Qiang Guo 193
    A modified BFGS algorithm for solving the unconstrained optimization, whose Hessian matrix at the minimum point of the convex function is of rank defects, is presented in this paper. The main idea of the algorithm is first to add a modified term to the convex function for obtain an equivalent model, then simply the model to get the modified BFGS algorithm. The superlinear convergence property of the algorithm is proved in this paper. To compared with the Tensor algorithms presented by R. B. Schnabel (seing [4],[5]), this method is more efficient for solving singular unconstrained optimization in computing amount and complication.
  16. Ghazal M.A.;Elhassanein A. 209
    Estimation of the spectral measure, covariance and spectral density functions of a strictly stationary r-vector valued time series is considered, under the assumption that some of the observations are missed. The modified periodograms are calculated using data window. The asymptotic normality is studied.
  17. Lee H.Y. 223
    By applying the Landau-type transformation, we transform a Stefan problem with nonlinear free boundary condition into a system consisting of a parabolic equation and the ordinary differential equations. Fully discrete finite element method is developed to approximate the solution of a system of a parabolic equation and the ordinary differential equations. We derive optimal orders of convergence of fully discrete approximations in $L_2,\;H^1$ and $H^2$ normed spaces.
  18. Pirzada S.;Naikoo T.A. 237
    The set S of distinct scores (outdegrees) of the vertices of a k-partite tournament T($X_l,\;X_2, ..., X_k$) is called its score set. In this paper, we prove that every set of n non-negative integers, except {0} and {0, 1}, is a score set of some 3-partite tournament. We also prove that every set of n non-negative integers is a score set of some k-partite tournament for every $n{\ge}k{\ge}2$.
  19. Zayed E.M.E.;El-Moneam M.A. 247
    The main objective of this paper is to study the boundedness character, the periodic character and the global stability of the positive solutions of the following difference equation $x_{n+1}=\frac{{\alpha}x_n+{\beta}x_{n-1}+{\gamma}x_{n-2}+{\delta}x_{n-3}}{Ax_n+Bx_{n-1}+Cx_{n-2}+Dx{n-3}}$, n=0, 1, 1, ... where the coefficients A, B, C, D, ${\alpha},\;{\beta},\;{\gamma},\;{\delta}$ and the initial conditions x-3, x-2, x-1, x0 are arbitrary positive real numbers.
  20. Tian Yu;Zhang Guosheng;Ge Weigao 263
    In this paper, a quasilinear second-order system with periodic boundary conditions is studied. By the least action principle and classical theorems of variational calculus, existence results of periodic solutions are obtained.
  21. Kim Jeong-Sim 273
    We obtain an asymptotic behavior of the loss probability for the GI/PH/1/K queue as K tends to infinity when the traffic intensity p is strictly less than one. It is shown that the loss probability tends to 0 at a geometric rate and that the decay rate is related to the matrix generating function describing the service completions during an interarrival time.
  22. Iranmanesh A.;Ashrafi A.R. 285
    Let X be a n-set and let A = [aij] be a $n {\times} n$ matrix for which $aij {\subseteq} X$, for $1 {\le} i,\;j {\le} n$. A is called a generalized Latin square on X, if the following conditions is satisfied: $U^n_{i=1}\;aij = X = U^n_{j=1}\;aij$. In this paper, we prove that every generalized Latin square has an orthogonal mate and introduce a Hv-structure on a set of generalized Latin squares. Finally, we prove that every generalized Latin square of order n, has a transversal set.
  23. Ma De-Xiang;Ge Wei-Gao 295
    In this paper, by using the Krasnoselskii fixed point theorem, we study the existence of 2m or 2m + 1 symmetric positive solutions of fourth-order two point boundary value problem y(4)(t) - f(t, y(t), y"(t))= 0, y(0) = y(1) = y'(0) = y"(1)=0.
  24. Lee Eun-Joo;Zgang Jun 307
    Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.
  25. Zheng T.;Liu F. 317
    In this paper, a singularly perturbed ordinary differential equation with non-smooth data is considered. The numerical method is generated by means of a Petrov-Galerkin finite element method with the piecewise-exponential test function and the piecewise-linear trial function. At the discontinuous point of the coefficient, a special technique is used. The method is shown to be first-order accurate and singular perturbation parameter uniform convergence. Finally, numerical results are presented, which are in agreement with theoretical results.
  26. Cai Guang-Hui;Zhu Meng-Hu 331
    The Paley-type inequalities for the complete convergence and lower and upper bounds in the Baum-Katz law of large numbers for i.i.d. random variables sequence are obtained. The results obtained generalize the result of Pruss [8].
  27. Geum Young-Hee;Kim Young-Ik 339
    The bifurcation point where a satellite component buds from another component is characterized by the existence of the common tangent line between the two osculating components appearing in the degree-n bifurcation set. We investigate the existence, location and number of bifurcation points for satellite components budding from the main component in the degree-n bifurcation set as well as a parametric boundary equation of the main component of the degree-n bifurcation set. Cusp points are also located on the boundary of the main component. Typical degree-n bifurcation sets and their components are illustrated with some computational results.
  28. Liu Jing;Gao Yan 351
    In this paper, we develop an inexact-Newton method for solving nonsmooth operator equations in infinite-dimensional spaces. The linear convergence and superlinear convergence of inexact-Newton method under some conditions are shown. Then, we characterize the order of convergence in terms of the rate of convergence of the relative residuals. The present inexact-Newton method could be viewed as the extensions of previous ones with same convergent results in finite-dimensional spaces.
  29. Wang Youyu;Zhang Guosheng;Ge Weigao 361
    In this paper, we consider the multi-point boundary value problems for one-dimensional p-Laplacian at resonance: $({\phi}_p(x'(t)))'=f(t,x(t),x'(t))$, subject to the boundary value conditions: ${\phi}_p(x'(0))={\sum}^{n-2}_{i=1}{\alpha}_i{\phi}_p(x'({\epsilon}i)),\;{\phi}_p(x'(1))={\sum}^{m-2}_{i=1}{\beta}_j{\phi}_p(x'({\eta}_j))$ where ${\phi}_p(s)=/s/^{p-2}s,p>1,\;{\alpha}_i(1,{\le}i{\le}n-2){\in}R,{\beta}_j(1{\le}j{\le}m-2){\in}R,0<{\epsilon}_1<{\epsilon}_2<...<{\epsilon}_{n-2}1,\;0<{\eta}1<{\eta}2<...<{\eta}_{m-2}<1$, By applying the extension of Mawhin's continuation theorem, we prove the existence of at least one solution. Our result is new.
  30. Oh Se-Young;Kwon Sun-Joo;Yun Jae-Heon 373
    To solve a class of nonlinear parameter estimation problems, a method combining the regularized structured nonlinear total least norm (RSNTLN) method and parameter separation scheme is suggested. The method guarantees the convergence of parameters and has an advantages in reducing the residual norm over the use of RSNTLN only. Numerical experiments for two models appeared in signal processing show that the suggested method is more effective in obtaining solution and parameter with minimum residual norm.
  31. Kar T.K.;Misra Swarnakamal;Mukhopadhyay B. 387
    This paper deals with the problem of a ratio-dependent prey- predator model with combined harvesting. The existence of steady states and their stability are studied using eigenvalue analysis. Boundedness of the exploited system is examined. We derive conditions for persistence and global stability of the system. The possibility of existence of bionomic equilibria has been considered. The problem of optimal harvest policy is then solved by using Pontryagin's maximal principle.
  32. Ashrafi Ali-Reza;Taeri Bi-Jan 403
    For a finite group G, #Cent(G) denotes the number of centralizers of its elements. A group G is called n-centralizer if #Cent(G) = n, and primitive n-centralizer if #Cent(G) = #Cent($\frac{G}{Z(G)}$) = n. The first author in [1], characterized the primitive 6-centralizer finite groups. In this paper we continue this problem and characterize the primitive 7-centralizer finite groups. We prove that a finite group G is primitive 7-centralizer if and only if $\frac{G}{Z(G)}{\simeq}D_{10}$ or R, where R is the semidirect product of a cyclic group of order 5 by a cyclic group of order 4 acting faithfully. Also, we compute #Cent(G) for some finite groups, using the structure of G modulu its center.
  33. Turkoglu D.;Alaca C.;Cho Y.J.;Yildiz C. 411
    The purpose of this paper, using the idea of intuitionistic fuzzy set due to Atanassov [2], we define the notion of intuitionistic fuzzy metric spaces (see, [1]) due to Kramosil and Michalek [17] and Jungck's common fixed point theorem ([11]) is generalized to intuitionistic fuzzy metric spaces. Further, we first formulate the definition of weakly commuting and R-weakly commuting mappings in intuitionistic fuzzy metric spaces and prove the intuitionistic fuzzy version of Pant's theorem ([21]).
  34. Li Xiaohong;Feng Enmin;Xiu Zhilong 425
    The process of producing 1,3-preprandiol by microorganism continuous cultivation would attain its equilibrium state. How to get the highest concentration of 1,3-propanediol at that time is the aim for producers. Based on this fact, an optimization model is introduced in this paper, existence of optimal solution is proved. By infinite-dimensional optimal theory, the optimal condition of model is given and the equivalence between optimal condition and the zero of optimality function is proved.
  35. Wang Ji-Hui;Zhang Xia;Liu Guizhen 435
    Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree ${\delta},\;{\delta}-1{\le}X'c(G){\le}{\delta}$. If $X'c(G) ={\delta}$, then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification of nearly bipartite graph and give some sufficient conditions for a nearly bipartite graph to be of CI class.
  36. Lee Heon-Soo;Park Yeon-Yong 441
    We introduce the counting function ${\pi}^*_{2.8}(x)$ of the primes with difference 8 between consecutive primes ($p_n,\;p_{n+l}=p_n+8$) can be approximated by logarithm integral $Li^*_{2.8}$. We calculate the values of ${\pi}^*_{2.8}(x)$ and the sum $C_{2,8}(x)$ of reciprocals of primes with difference 8 between consecutive primes $p_n,\;p_{n+l}=p_n+8$ where x is counted up to $7{\times}10^{10}$. From the results of these calculations. we obtain ${\pi}^*_{2.8}(7{\times}10^{10}$)= 133295081 and $C_{2.8}(7{\times}10^{10}) = 0.3374{\pm}2.6{\times}10^{-4}$.
  37. Lee Yu-Tae 453
    A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.
  38. Hu Guofang;Qu Biao 461
    In this paper, an algorithm with a new Armijo-type line search is proposed that ensure global convergence of a correlative Polak-Ribiere conjugate method for the unconstrained minimization of non-convex differentiable function.
  39. Jang Ho-Jong;Lee Sung-Ho 467
    We present and study the stability and convergence of a deflation-preconditioned conjugate gradient(PCG) scheme for the interior generalized eigenvalue problem $Ax = {\lambda}Bx$, where A and B are large sparse symmetric positive definite matrices. Numerical experiments are also presented to support our theoretical results.
  40. Cho Yong-Uk;Jun Young-Bae;Song Seok-Zun 475
    After the introduction of fuzzy sets by Zadeh [8], there have been a number of generalizations of fundamental concept. The notion of intuitionistic fuzzy sets introduced by Atanassov is one among them. An intuitionistic fuzzy set is also called a bifuzzy set according to [5]. In this paper, we apply the concept of a bifuzzy set to (implicative) ideals in pseudo MV-algebras. The notion of a bifuzzy (implicative) ideal of a pseudo MV-algebra is introduced, and some related properties are investigated. Conditions for a bifuzzy set to be a bifuzzy ideal are given, and characterizations of a bifuzzy (implicative) ideal are provided. Using a family of ideals, bifuzzy ideals are established.
  41. Kim Y.H.;Jeong T.E. 491
    In this paper, we define intuitionistic fuzzy subalgebras of B-algebras which is related to several classes of algebras such as BCI/BCK-algebras. We could obtain some important results for the homomorphic image and equivalence relations on IFS(X).
  42. Han Dong-Hwan;Park Chul-Geun 501
    The IEEE 802.11 protocol is the most mature technology for WLANs(Wireless Local Area Networks). However, as the number of stations increases, the delay and throughput performance of IEEE 802.11 MAC(Medium Access Control) degrades severely. In this paper, we present the comprehensive performance analysis of IEEE 802.11 MAC protocol by investigating the MAC layer packet service time when arrival packet sizes have a general probability distribution. We obtain the discrete probability distribution of the MAC layer service time. By using this, we analyze the system throughput and the MAC layer packet service time of IEEE 802.11 MAC protocol in wireless LAN environment. We take some numerical examples for the system throughput and the mean packet service time for several special distributions of arrival packet sizes.
  43. Park Won-Gil;Bae Jae-Hyeong 517
    In this paper, we obtain the general solution and the generalized Hyers-Ulam stability of the multi-additive functional equation $f(x1+x2,y1+y2,z1+z2)={\Sigma}_{1{\le}i,j,k{\le}2}\;f(x1,yj,zk)$.
  44. Choi Doo-Il 523
    We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.
  45. Lee Woo 535
    The ring of invariants of two 2 by 2 matrices C(2, 2) is a polynomial ring with 5 variables [1]. In this paper we find the system of parameters of C(3, 2) by Groebner bases.
  46. Kim Myung-Geun 541
    A procedure for investigating the influence of observations in choosing Box-Cox transformation for multivariate data is suggested. It is effective in spotting influential observations. A numerical example is provided for illustration.
  47. Cho Yong-Uk;Jun Young-Bae 549
    Using a t-norm, the notion of T-fuzzy subalgebras of right K(G)-algebras is introduced, and fundamental properties are investigated. The fact that T-fuzzy subalgebras of a right K(G)-algebra form a complete lattice is proved.
  48. Kim Hwa-Jun 557
    We consider the relationship between absolute continuity for functions of a real variable and absolute continuity of functions of generalized bounded variation. Here, we obtain necessary and sufficient conditions between these two functions.
  49. Shin Yong-Su 563
    We introduce how to construct a non-unimodal level O-sequence which has all different local maxima as many as we desire.
  50. Goo Yoon-Hoe 569
    In this paper, we define the positive and negative limit sets in the hemicompact space and establish their dynamical properties.
  51. Jung Hwan-Ok 577
    We present several properties concerning infinite maximal planar graphs. Results related to the infinite VAP-free planar graphs are also included. Finally, we extend the result of W. Goddard, who showed that every finite 4-connected maximal planar graph is 4-ordered, to infinite strong triangulations.