• Journal of the Korean Mathematical Society
• /
• v.40 no.1
• /
• pp.109-128
• /
• 2003

In this paper, we show that the Euler characteristic of an even dimensional closed projectively flat manifold is equal to the total measure which is induced from a probability Borel measure on RP$^{n}$ invariant under the holonomy action, and then discuss its consequences and applications. As an application, we show that the Chen's conjecture is true for a closed affinely flat manifold whose holonomy group action permits an invariant probability Borel measure on RP$^{n}$ ; that is, such a closed affinly flat manifold has a vanishing Euler characteristic.

• Journal of the Korean Statistical Society
• /
• v.27 no.3
• /
• pp.289-303
• /
• 1998

For square contingency tables with ordered categories, Tomizawa (1995) considered two kinds of measures to represent the degree of departure from global symmetry, which means that the probability that an observation will fall in one of cells in the upper-right triangle of square table is equal to the probability that the observation falls in one of cells in the lower-left triangle of it. This paper proposes a generalization of those measures. The proposed measure is expressed by using Cressie and Read's (1984) power divergence or Patil and Taillie's (1982) diversity index. Special cases of the proposed measure include TomiBawa's measures. The proposed measure would be useful for comparing the degree of departure from global symmetry in several tables.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.95-98
• /
• 2007

A low-profile phased array antenna with a low sidelobe was designed and fabricated using a genetic algorithm (GA). The subarray distances were optimized by GA with chromosomes of 78 bits, a population of 100, a crossover probability of 0.9, and a mutation probability of 0.005. The array antenna has 24 subarrays in 14 rows, and is designed as a mobile terminal for Ku-band satellite communication. The sidelobe level was suppressed by 6.5 dB after optimization, compared to the equal spacing between subarrays. The sidelobe level was verified from the far-field pattern measurement by using the fabricated array antenna with optimized distance.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.148-154
• /
• 2012

For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.2
• /
• pp.159-164
• /
• 1998

The two-factor nested variance component model with equal numbers in the cells are given by $y_{ijk}\;=\;{\mu}\;+\;A_i\;+\;B_{ij}\;+\;C_{ijk}$ and the confidence intervals for the ratio of variance components, ${\sigma}^{2}_{A}/{\sigma}^{2}_{B}$ are obtained in various forms by many authors. This article shows the probability ranges of these confidence intervals on ${\sigma}^{2}_{A}/{\sigma}^{2}_{B}$ proved by the mathematical computation.

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

Simultaneous confidence intervals for the parameters in the logistic regression models with random regressors are considered. A method based on the bootstrap and its stochastic approximation will be developed. A key idea in using the bootstrap method to construct simultaneous confidence intervals is the concept of prepivoting which uses the transformation of a root by its estimated cumulative distribution function. Repeated use of prepivoting makes the overall coverage probability asymptotically correct and the coverage probabilities of the individual confidence statement asymptotically equal. This method is compared with ordinary asymptotic methods based on Scheffe's and Bonferroni's through Monte Carlo simulation.

• Journal of the Korean Statistical Society
• /
• v.26 no.3
• /
• pp.309-317
• /
• 1997

A sequential procedure for estimating a linear function of two normal means which satisfies the two requirements, i.e. one is a condition of coverage probability, the other is a condition of $\beta$-protection, is proposed when the variances are unknown and not necessarily equal. We give asymptotic behaviors of the proposed stopping time.

• Journal of the Korean Statistical Society
• /
• v.27 no.1
• /
• pp.91-100
• /
• 1998

A method of estimating probability density using regression tools is presented here. It is based on equal-length binning and locally weighted approximate likelihood for bin counts. The method is particularly useful for densities with bounded supports, where it automatically corrects edge effects without using boundary kernels.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.479-488
• /
• 2007

A sequential procedure is proposed in order to construct one-sided confidence intervals for a normal mean with guaranteed coverage probability and ${\beta}-protection$ when the normal mean and variance are identical. First-order asymptotic properties on the sequential sample size are found. The derived results hold with uniformity in the total parameter space or its subsets.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.484-492
• /
• 2002

We propose an efficient stream authentication scheme using tree authentication. To reduce the computation cost of the sender, we design the authentication tree whose height is very short. We appropriately distribute authentication information over packets so the receiver can verify data with high probability. Moreover, we provide mathematical analysis on the verification probability. For the proposed scheme and previous schemes, we measured the elapsed time for generating authentication information and the proposed scheme has equal to or slightly larger than that of GM's scheme, which has the lowest computation overhead. We performed simulations, which show that the verification probability of the proposed scheme is much higher than that of any other scheme.