• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.159-168
• /
• 1999

We introduce a new conditional signed-rank test for the tree alternatives comparing several treatments with a control in the randomized block design. We demonstrate its performance by comparing with 3 classes of signed-rank tests proposed by Park et al.(1991) in some general situations. In most cases the proposed procedure is simpler to compute and has better power than others.

• Journal of Korean Society for Quality Management
• /
• v.19 no.2
• /
• pp.52-62
• /
• 1991

Consider a class of rank tests for comparing several treatments with a control and discuss some members among the class. New rank test based on orthogonal contrasts is proposed and compared with other well known tests. The approximate powers of the proposed test are also presented through the simulation studies.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.1
• /
• pp.181-190
• /
• 2013

In this paper we study the Putinar's matricial model operator of rank 2 and provide some evidences for the validity of the conjecture in [8].

• The Pure and Applied Mathematics
• /
• v.17 no.4
• /
• pp.333-340
• /
• 2010

We estimate the real rank of a composition series of closed ideals of a $C^*$-algebra such that its subquotients have continuous trace, which is equivalent to that the $C^*$-algebra is of type I.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.61-74
• /
• 2014

This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.285-289
• /
• 2009

Tag is important to retrieve and classify contents. However, someone uses so many unrelated tags with contents for the high ranking In this work, we propose tag refinement algorithm using TextRank. We calculate the importance of keywords occurred a title, description, tag, and comments. We refine tags removing unrelated keywords from user generated tags. From the results of experiments, we can see that proposed method is useful for refining tags.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.1
• /
• pp.27-35
• /
• 2000

For a weighting method to be practically valid, it should produce weights which coincide with the relative importance of attributes perceived by the decision maker. In this paper, 'bootstrapping' is used to compare the practical validities of five weighting methods frequently used; the rank order centroid method, the rank reciprocal method, the rank sum method, the entropic method, and the geometric mean method. Bootstrapping refers to the procedure where the analysts allow the decision maker to make careful judgements on a series of similar cases, then infer statistically what weights he was implicitly using to arrive at the particular ranking. The weights produced by bootstrapping can therefore be regarded as well reflecting the decision maker's perceived relative importances. Bootstrapping and the five weighting methods were applied to a job selection problem. The results showed that both the rank order centroid method and the rank reciprocal method had higher level of practical validity than the other three methods, though a large difference could not be found either in the resulting weights or in the corresponding solutions.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.574-574
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.575-583
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Biomedical Science Letters
• /
• v.23 no.4
• /
• pp.295-302
• /
• 2017

Mononuclear osteoclast precursors derived from hematopoietic progenitors fuse together and then become multinucleated mature osteoclasts by macrophage-colony stimulating factor (M-CSF) and receptor activator of nuclear factor-${\kappa}B$ ligand (RANKL). Especially, the binding of RANKL to its receptor RANK provides key signals for osteoclast differentiation and bone-resorbing function. RANK transduces intracellular signals by recruiting adaptor molecules such as TNFR-associated factors (TRAFs), which then activate mitogen activated protein kinases (MAPKs), Src/PI3K/Akt pathway, nuclear factor-${\kappa}B$ (NF-${\kappa}B$) and finally amplify NFATc1 activation for the transcription and activation of osteoclast marker genes. This review will briefly describe RANKL-RANK signaling pathways and key molecules critical for osteoclast differentiation.