A NEW APPROACH FOR ASYMPTOTIC STABILITY A SYSTEM OF THE NONLINEAR ORDINARY DIFFERENTIAL EQUATIONS

Effati, Sohrab,Nazemi, Ali Reza 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.25 No.1

In this paper, we use measure theory for considering asymptotically stable of an autonomous system [1] of first order nonlinear ordinary differential equations(ODE's). First, we define a nonlinear infinite-horizon optimal control problem related to the ODE. Then, by a suitable change of variable, we transform the problem to a finite-horizon nonlinear optimal control problem. Then, the problem is modified into one consisting of the minimization of a linear functional over a set of positive Radon measures. The optimal measure is approximated by a finite combination of atomic measures and the problem converted to a finite-dimensional linear programming problem. The solution to this linear programming problem is used to find a piecewise-constant control, and by using the approximated control signals, we obtain the approximate trajectories and the error functional related to it. Finally the approximated trajectories and error functional is used to for considering asymptotically stable of the original problem.

Multiobjective fractional symmetric duality involving cones

I. Ahmad,Sarita Sharma 한국전산응용수학회 2008 Journal of applied mathematics & informatics Vol.26 No.1

A pair of multiobjective fractional symmetric dual programs is formulated over arbitrary cones. Weak, strong and converse duality theorems are proved under pseudoinvexity assumptions. A self duality theorem is also discussed.

FRAMES AND SAMPLING THEOREMS IN MULTIWAVELET SUBSPACES

Zhanwei Liu,Guochang Wu,Xiaohui Yang 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.3

In this paper, we investigate the sampling theorem for frame in multiwavelet subspaces. By the frame satisfying some special conditions, we obtain its dual frame with explicit expression. Then,we give an equivalent condition for the sampling theorem to hold in multiwavelet subspaces. Finally, a sufficient condition under which the sampling theorem holds is established. Some typical examples illustrate our results.

Periodic solutions for discrete one-predator two-prey system with the modified Leslie-Gower functional response

Xiangyun Shi,Xueyong Zhou,Xinyu Song 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.3

In this paper, we study a discrete Leslie-Gower one-predator two-prey model. By using the method of coincidence degree and some techniques, we obtain the existence of at least one positive periodic solution of the system. By linalization of the model at positive periodic solution and construction of Lyapunov function, sufficient conditions are obtained to ensure the global stability of the positive periodic solution. Numerical simulations are carried out to explain the analytical findings.. In this paper, we study a discrete Leslie-Gower one-predator two-prey model. By using the method of coincidence degree and some techniques, we obtain the existence of at least one positive periodic solution of the system. By linalization of the model at positive periodic solution and construction of Lyapunov function, sufficient conditions are obtained to ensure the global stability of the positive periodic solution. Numerical simulations are carried out to explain the analytical findings..

A note on the maximum entropy weighting function problem

DUG HUN HONG,KYUNG TAE KIM 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.23 No.1

In this note, we extends some of the results of Liu [Fuzzy Sets and systems 157 (2006) 869-878]. This extension consists of a simple proof involving weighted functions and their preference index. We also give an elementary simple proof of the maximum entropy weighting function problem with a given preference index value without using any advanced theory like variational principles or without using Lagrangian multiplier methods.

On substructures of monogenic R-groups

Yong Uk Cho 한국전산응용수학회 2008 Journal of applied mathematics & informatics Vol.26 No.1

In this paper, we will introduce the noetherian quotients in R-groups, and then investigate the related substructures of the near-ring R and G and the R-group G. Also, applying the annihilator concept in R-groups and d.g. near-rings, we will survey some properties of the substructures of R and G in monogenic Rgroups, and show that R becomes a ring for faithful monogenic R-groups with some condition.

Chracterizations of the Pareto distribution by record values

장세경 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.3

In this paper, we establish some characterizations which issatisfied by the independence of the upper record values from the Paretodistribution. We prove that X ∈ PAR(1,β ),β > 0, if and only if<수식>and XU(m) , 1 ≤ m < n are independent. We show that X ∈ PAR(1,β),β> 0, if and only if<수식>and XU(n) , n ≥ 1 are indepen-dent. And we characterize that X ∈ PAR(1,β ),β > 0, if and only if<수식>and XU(n) , n ≥ 1 are independent.

Performance analyses of path recovery routing protocols in AD HOC networks

우매리,Chonggun Kim 한국전산응용수학회 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. 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.

The Generalization of Clement's Theorem on Pairs of Primes

이헌수,박영용 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.1

In this article, we show a generalization of Clement’'s theorem on the pair of primes. For any integers n and k, integers n and n + 2k are a pair of primes if and only if 2k(2k)![(n − 1)! + 1] + ((2k)! − 1)n≡ 0 (mod n(n + 2k)) whenever (n, (2k)!) = (n + 2k, (2k)!) = 1. Especially, n or n + 2k is a composite number, a pair (n, n + 2k), for which 2k(2k)![(n − 1)! + 1] + ((2k)! − 1)n ≡ 0 (mod n(n + 2k)) is called a pair of pseudoprimes for any positive integer k. We have pairs of pseudorimes (n, n + 2k) with n 5 ≤ 104 for each positive integer k(4≤k≤10).

DATA MINING AND PREDICTION OF SAI TYPE MATRIX PRECONDITIONER

김상배,Shuting Xu,Jun Zhang 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.1

The solution of large sparse linear systems is one of the most important problems in large scale scientific computing. Among the many methods developed, the preconditioned Krylov subspace methods are considered the preferred methods. Selecting a suitable preconditioner with appropriate parameters for a specific sparse linear system presents a challenging task for many application scientists and engineerswho have little knowledge of preconditioned iterative methods. The prediction of ILU type preconditioners was considered in [27] where support vector machine(SVM),as a data mining technique, is used to classify large sparse linear systems and predict best preconditioners. In this paper, we apply the data mining approach to the sparse approximate inverse(SAI) type preconditioners to find some parameters with which the preconditioned Krylov subspace method on the linear systems shows best performance.