• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.647-655
• /
• 2006

In this paper, we consider multiple comparisons for the ratio of the failure rates in two components system that the lifetimes of the components have independent exponential distributions. Also we suggest Bayesian multiple comparisons procedure based on fractional Bayes factor when noninformative priors are applied for the parameters. Finally, we give numerical examples to illustrate our procedure.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.4
• /
• pp.397-409
• /
• 2021

The Bishop and Bishop-Gromov volume comparisons with the Bakry-Emery Ricci tensor in a metric measure space are studied by the comparisons of the Jacobi differential equations in a Riemannian and Lorentzian manifold.

• Journal of The Korean Society of Integrative Medicine
• /
• v.6 no.1
• /
• pp.83-89
• /
• 2018

Purpose : The purpose of this study was to examine the effects of the trunk stabilization exercise in the musical tempo on lumbar lordosis angle, muscle activity and pain. Methods : For the 30 people with lumbar lordosis angle legion and back pain, a random selection was made with MLSE (15) and LSE (15) to measure VAS, lumbar lordosis angle and Muscle Activity. Result : There were significant decreases in intra group comparisons to lumbar lordosis angle were seen in MLSE and LSE groups, and significant decreases in inter group comparisons in MLSE groups. significant decreases in intra group comparisons to VAS were seen in MLSE and LSE groups, and significant decreases in inter group comparisons in MLSE groups. Significant intra-group comparison of muscle activity, MLSE groups increases were rectus obdominis(right/left) and erector spinae muscle(right/left), LSE groups increases were erector spinae muscle(right/left), and significant increases in inter group comparisons rectus obdominis(right) and erector spinae muscle(left) in MLSE groups Conclusion : Based on the above findings, a program to restore the lumbar lordosis angle, and increase muscle strength should be developed at by applying the combine existing trunk stabilization physical therapy technique and musical tempo.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.53-56
• /
• 2007

Symmerge is a stable minimum storage algorithm for merging that needs $O(mlog\frac{n}{m})$ element comparisons, where m and n are the sizes of the input sequences with m ${\leqq}$ n. According to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The objective of this paper is to consider the relationship between m and n for the spanning case with the recursion level m-1.

• Journal of the Korean Statistical Society
• /
• v.23 no.1
• /
• pp.53-62
• /
• 1994

When a comparison is made with respect to the unknown best treatment, Hsu (1984, 1985) proposed the so called multiple comparisons procedures with the best in the analysis of variance model. Applying Hsu's results to the analysis of covariance model, simultaneous confidence intervals for multiple comparisons with the best in a balanced one-way layout with a random covariate are developed and are applied to a real data example.

• Communications for Statistical Applications and Methods
• /
• v.8 no.2
• /
• pp.427-434
• /
• 2001

In this paper, we consider the nonparametric Bayesian approach to the multiple comparisons problem for I Poisson populations using Dirichlet process priors. We describe Gibbs sampling algorithm for calculating posterior probabilities for the hypotheses and calculate posterior probabilities for the hypotheses using Markov chain Monte Carlo. Also we provide a numerical example to illustrate the developed numerical technique.

• 한국데이터정보과학회:학술대회논문집
• /
• 2001.10a
• /
• pp.67-75
• /
• 2001

A completely randomized growth curve model was defined by Zerbe(1979). We propose the fully significant difference procedure for multiple comparisons of completely randomized growth curve model. The standard F test is useful tool to multiple comparisons of the completely randomized growth curve model. The proposed method is applied to experimental data.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.513-528
• /
• 1997

A sort sequence $S_n$ is a sequence of all unordered pairs of indices in $I_n\;=\;{1,\;2,v...,\;n}$. With a sort sequence Sn we assicuate a sorting algorithm ($AS_n$) to sort input set $X\;=\;{x_1,\;x_2,\;...,\;x_n}$ as follows. An execution of the algorithm performs pairwise comparisons of elements in the input set X as defined by the sort sequence $S_n$, except that the comparisons whose outcomes can be inferred from the outcomes of the previous comparisons are not performed. Let $X(S_n)$ denote the acverage number of comparisons required by the algorithm $AS_n$ assuming all input orderings are equally likely. Let $X^{\ast}(n)\;and\;X^{\circ}(n)$ denote the minimum and maximum value respectively of $X(S_n)$ over all sort sequences $S_n$. Exact determination of $X^{\ast}(n),\;X^{\circ}(n)$ and associated extremal sort sequenes seems difficult. Here, we obtain bounds on $X^{\ast}(n)\;and\;X^{\circ}(n)$.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.80-87
• /
• 1989

Many Traditional Algebraic Analyses of preference and choice for a finite set of alternatives have been based on binary choices. They have assumed that the binary preference information given by a decision maker is transitive. However, there is considerable evidence that many relations that might occur as preference relations cannot be presented as transitive relations. To construct transitive binary comparisons from intransitive ones, we suggest the notion of superior set, which helps us to understand the structure of intransitive binary comparisons. We also provide a heuristic method to construct transitive binary comparisons. And some merits merits of the suggested method over the existing methods are also discussed.