• Journal of the Korean Statistical Society
• /
• v.21 no.2
• /
• pp.201-207
• /
• 1992

The algorithm for obtaining the isotonic regression in simple tree order, the most basic and simplest model next to the simple order, is considered. We propose to call it "Pool-the-Maximum-Violators" algorithm (PMVA) in conjunction with the "Pool-Adjacent-Violators" algorithm (PAVA) in the simple order. The dual problem of obtaining the isotonic regression in simple tree order is our main concern. An intuitively appealing relation between the primal and the dual problems is demonstrated. The interesting difference is that in simple order the required number of pooling is at least the number of initial violating pairs and any path leads to the solution, whereas in the simple tree order it is at most the number of initial violators and there is only one advisable path although there may be some others leading to the same solution.o the same solution.

• Communications of the Korean Mathematical Society
• /
• v.23 no.4
• /
• pp.511-528
• /
• 2008

Let (R, m) be a 2-dimensional regular local ring with algebraically closed residue field R/m. Let K be the quotient field of R and $\upsilon$ be a prime divisor of R, i.e., a valuation of K which is birationally dominating R and residually transcendental over R. Zariski showed that there are finitely many simple $\upsilon$-ideals $m\;=\;P_0\;{\supset}\;P_1\;{\supset}\;{\cdots}\;{\supset}\;P_t\;=\;P$ and all the other $\upsilon$-ideals are uniquely factored into a product of those simple ones [17]. Lipman further showed that the predecessor of the smallest simple $\upsilon$-ideal P is either simple or the product of two simple $\upsilon$-ideals. The simple integrally closed ideal P is said to be free for the former and satellite for the later. In this paper we describe the sequence of simple $\upsilon$-ideals when P is satellite of order 3 in terms of the invariant $b_{\upsilon}\;=\;|\upsilon(x)\;-\;\upsilon(y)|$, where $\upsilon$ is the prime divisor associated to P and m = (x, y). Denote $b_{\upsilon}$ by b and let b = 3k + 1 for k = 0, 1, 2. Let $n_i$ be the number of nonmaximal simple $\upsilon$-ideals of order i for i = 1, 2, 3. We show that the numbers $n_{\upsilon}$ = ($n_1$, $n_2$, $n_3$) = (${\lceil}\frac{b+1}{3}{\rceil}$, 1, 1) and that the rank of P is ${\lceil}\frac{b+7}{3}{\rceil}$ = k + 3. We then describe all the $\upsilon$-ideals from m to P as products of those simple $\upsilon$-ideals. In particular, we find the conductor ideal and the $\upsilon$-predecessor of the given ideal P in cases of b = 1, 2 and for b = 3k + 1, 3k + 2, 3k for $k\;{\geq}\;1$. We also find the value semigroup $\upsilon(R)$ of a satellite simple valuation ideal P of order 3 in terms of $b_{\upsilon}$.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.427-436
• /
• 2005

Let (R, m) be a 2-dimensional regular local ring with algebraically closed residue field R/m. Let K be the quotient field of R and v be a prime divisor of R, i.e., a valuation of K which is birationally dominating R and residually transcendental over R. Zariski showed that there are finitely many simple v-ideals $m=P_0\;{\supset}\;P_1\;{\supset}\;{\cdotS}\;{\supset}\;P_t=P$ and all the other v-ideals are uniquely factored into a product of those simple ones. It then was also shown by Lipman that the predecessor of the smallest simple v-ideal P is either simple (P is free) or the product of two simple v-ideals (P is satellite), that the sequence of v-ideals between the maximal ideal and the smallest simple v-ideal P is saturated, and that the v-value of the maximal ideal is the m-adic order of P. Let m = (x, y) and denote the v-value difference |v(x) - v(y)| by $n_v$. In this paper, if the m-adic order of P is 2, we show that $O(P_i)\;=\;1\;for\;1\;{\leq}\;i\; {\leq}\;{\lceil}\;{\frac{b+1}{2}}{\rceil}\;and\;O(P_i)\;=2\;for\;{\lceil}\;\frac{b+3}{2}\rceil\;{\leq}\;i\;\leq\;t,\;where\;b=n_v$. We also show that $n_w\;=\;n_v$ when w is the prime divisor associated to a simple v-ideal $Q\;{\supset}\;P$ of order 2 and that w(R) = v(R) as well.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.1
• /
• pp.49-56
• /
• 2006

A convergence behavior is under investigation near a simple real zero for the k-fold pseudo-Olver's method defined by extending the classical Olver's method. The order of convergence is shown to be at least k+3. The asymptotic error constant is explicitly given in terms of k and the corresponding simple zero. Various numerical examples with a proposed zero-finding algorithm are successfully confirmed with the use of symbolic and computational ability of Mathematica.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.427-431
• /
• 2014

In this paper, we show that groups of order $2^npq$, where p, q are primes of the from $p=2^n-1$, $q=2^{n-1}+p$ with $n{\geq}3$, are not simple and groups of order $2^npq^t$ for $t{\geq}2$, where p, q are odd primes of the form $p=2^m-1$, $q=2^n-1$ with m < n, are not simple.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1023-1029
• /
• 2009

Oh (2009) has proposed a likelihood ratio test for comparing two agreements for dependent observations based on the concept of marginal homogeneity and marginal stochastic ordering. In this paper we consider the comparison of more than two agreement measures. Simple ordering and simple tree ordering among agreement measures are investigated. Some test procedures, including likelihood ratio test, are discussed.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.845-851
• /
• 2002

An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• Proceedings of the Korean Reliability Society Conference
• /
• 2002.06a
• /
• pp.297-302
• /
• 2002

An efficient method is developed to obtain the maximum capacity flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.889-897
• /
• 2001

Based on the prime graph of a finite simple group, its order is the product of its order components (see[4]). It is known that Suzuki-Ree groups [6], $PSL_2(q)$ [8] and $E_8(q)$ [7] are uniquely deternubed by their order components. In this paper we prove that the simple groups $A_p$ are also unipuely determined by their order components, where p and p-2 are primes.

• Journal of KSNVE
• /
• v.9 no.2
• /
• pp.340-347
• /
• 1999

The acoustic performance of reactive type single expansion chamber can be calculated theoretically by plane wave theory. But higher order model should be considered to widen the frequency range. Mode matching method has been developed to consider higher order modes, but very complicated algebra should be used. Munjal suggested a numerical collocation method, which can overcome the shortcomings of mode matching method, using the compatibility conditions for acoustic pressure and particle velocity at the junctions of area discontinuities. But the restriction of Munjal's method is that the ratio between the area of inlet(or outlet) pipe and that of chamber must be natural number. In this paper, the new method was suggested to overcome the shortcomings of Munjal's method. The predictions by this method was also compared with those by the finite element method and Munjal's method in order to demonstrate the accuracy of the modified method presented here.