http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
OBLIQUE PROJECTIONS AND SHIFT-INVARIANT SPACES
Park, Sang-Don,Kang, Chul Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.5
We give an elementary proof of one of the main results in [H.O. Kim, R.Y. Kim, J.K. Lim, The infimum cosine angle between two finitely generated shift-invariant spaces and its applications, Appl. Comput. Har-mon. Anal. 19 (2005) 253-281] concerning the existence of an oblique projection onto a finitely generated shift-invariant space along the orthogonal complement of another finitely generated shift-invariant space under the assumption that the generators generate Riesz bases.
RUIN PROBABILITIES IN THE RISK MODEL WITH TWO COMPOUND BINOMIAL PROCESSES
Zhang, Mao-Jun,Nan, Jiang-Xia,Wang, Sen Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
In this paper, we consider an insurance risk model governed by a compound Binomial arrival claim process and by a compound Binomial arrival premium process. Some formulas for the probabilities of ruin and the distribution of ruin time are given, we also prove the integral equation of the ultimate ruin probability and obtain the Lundberg inequality by the discrete martingale approach.
A PRECONDITIONER FOR THE LSQR ALGORITHM
Karimi, Saeed,Salkuyeh, Davod Khojasteh,Toutounian, Faezeh Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
Iterative methods are often suitable for solving least squares problems min$||Ax-b||_2$, where A $\epsilon\;\mathbb{R}^{m{\times}n}$ is large and sparse. The well known LSQR algorithm is among the iterative methods for solving these problems. A good preconditioner is often needed to speedup the LSQR convergence. In this paper we present the numerical experiments of applying a well known preconditioner for the LSQR algorithm. The preconditioner is based on the $A^T$ A-orthogonalization process which furnishes an incomplete upper-lower factorization of the inverse of the normal matrix $A^T$ A. The main advantage of this preconditioner is that we apply only one of the factors as a right preconditioner for the LSQR algorithm applied to the least squares problem min$||Ax-b||_2$. The preconditioner needs only the sparse matrix-vector product operations and significantly reduces the solution time compared to the unpreconditioned iteration. Finally, some numerical experiments on test matrices from Harwell-Boeing collection are presented to show the robustness and efficiency of this preconditioner.
SOFT SET THEORY APPLIED TO COMMUTATIVE IDEALS IN BCK-ALGEBRAS
Jun, Young-Bae,Lee, Kyoung-Ja,Park, Chul-Hwan Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.3-4
Molodtsov [12] introduced the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. In this paper we apply the notion of soft sets by Molodtsov to commutative ideals of BCK-algebras, The notions of commutative soft ideals and commutative idealistic soft BCK-algebras are introduced, and their basic properties are investigated. Examples to show that there is no relations between positive implicative idealistic soft BCK-algebras and commutative idealistic soft BCK-algebras are provided.
SECOND ORDER SUFFICIENT CONDITIONS IN OPTIMIZATION IN COMPLEX SPACE
Duca, Dorel I. Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
In this paper we give sufficient conditions for a point to be a solution of an optimization problem in complex space.
PERFORMANCE ANALYSES OF PATH RECOVERY ROUTING PROTOCOLS IN AD HOC NETWORKS
Wu, Mary,Kim, Chong-Gun Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.
CONVERGENCE AND PERIODICITY IN A DISCRETE-TIME NEURAL NETWORK MODEL OF TWO NEURONS
Bin, Honghua Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
For the discrete version of an artificial neural network of two neurons with piecewise constant argument, we obtain some sufficient conditions that every solution is either periodic or convergent.
Ahmed, A. M. Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
Our aim in this paper is to investigate the global attractivity of the recursive sequence $x_{n+1}$ = $\frac{\alpha-{\beta}x_{n-1}}{\gamma+g(x_n)}$ under specified conditions. We show that the positive (or zero for $\alpha$ = 0) equilibrium point of the equation is a global attractor with a basin that depends on certain conditions posed on the coefficients and the function g(x).
NEW OSTROWSKI TYPE INEQUALITIES INVOLVING TWO FUNCTIONS
Liu, Wen-Jun,Xue, Qiao-Ling,Dong, Jian-Wei Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
In this paper, new inequalities of Ostrowski type involving two functions and their derivatives for mapping whose derivations belong to $L^p$[a, b], p>1 are established.
FINITE DIFFERENCE SCHEMES FOR CALCIUM DIFFUSION EQUATIONS
Choo, S.M. Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.1
Finite difference schemes are considered for a $Ca^{2+}$ diffusion equations, which discribe $Ca^{2+}$ buffering by using stationary and mobile buffers. Stability and $L^\infty$ error estimates of approximate solutions for the corresponding schemes are obtained using the extended Lax-Richtmyer equivalence theorem.