• Korean Journal of Animal Reproduction
• /
• v.21 no.2
• /
• pp.191-195
• /
• 1997

The objective of this study were to compare two methods of analysis of milk urea nitrogen (MUN) and to relate conentration of MUN to pregnancy rate in dairy cows. The Azotest and Sigma method for MUN analysis were compared. The Azotest consistently underestimated the Sigma values for same samples, except for those in rank 3. The CV for the Azotest, within each rank, were less than 15%, demonstrating acceptable repeatability of the Azotest within a rank. Concentrations of MUN higher or lower than MUN in rank 3 and 4 were associated with decreased pregnancy rate. Mun concentrations in rank 5 and 6 were associated with a, pp.oximately a 16 percentage point decrease in pregnancy rate. Mun concentrations in rank 5 and 6 were associated with a, pp.oximately a 16 percentage point decrease in pregnancy rate after AI in dairy cow. This results suggest that Azotest may be benificial to dairy producers to monitor urea nitrogen concentration in their herd in efforts to maintain or improve reproductive efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.5
• /
• pp.445-448
• /
• 1991

The two-sample locally optimum rank detection scheme is obtained which uses rank and sign statistics for detection of random signals in additive noise. It is shown that the detector is similar in structure to the locally optimum detector for random signals and to the one-sample locally optimum rank detector for random signals. It is also shown that the detector is a generalization of the two-sample locally optimum rank detector for known signals. In addition , the problem of two-sample locally optimum rank detection of random signals in multiple input case is considered briefly.

• KOMUNHWA
• /
• no.57
• /
• pp.211-231
• /
• 2001

The purpose of this study is to examine and compare the origins and development of Chinese rank badge and Korean rank badge, giving special attention to the rank squares for civil and military officials. rank badge was first established during the reign o

• Journal of Korean Society for Quality Management
• /
• v.41 no.4
• /
• pp.709-724
• /
• 2013

Purpose: The purpose of this study is to examine five evaluation models constructed by different normalization and aggregation methods in terms of the volatility of rankings and rank reversals. We also explore how the volatility of rankings of the five models changes and how often the rank reversals occur when the outliers are removed. Methods: We used data published in the Complete University Guide 2014. Two universities with missing values were excluded from the data. The university rankings were derived by using the five models, and then each model's volatility of rankings was measured. The box-plot was used to detect outliers. Results: Model 1 has the lowest volatility among the five models whether or not the outliers are included. Model 5 has the lowest number of rank reversals. Model 3, which has been used by many institutions, appears to be in the middle among the five in terms of the volatility and the rank reversals. Conclusion: The university rankings vary from one evaluation model to another depending on what normalization and aggregation methods are used. No single model exhibits clear superiority over others in both the volatility and the rank reversal. The findings of this study are expected to provide a stepping stone toward a superior model which is both reliable and robust.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6B
• /
• pp.794-801
• /
• 2001

본 논문에서는 rank-order 필터의 구현을 위해 세 가지 신경회로망의 구조를 제시하고 분석하며 용도를 제안한다. 첫 번째 신경회로망을 이용하여 2-입력 정렬기를 제안하고 이를 이용하여 계층적인 N-입력 정렬기를 구성한다. 두 번째로 입력 신호간의 상대적인 크기 정보를 이용하여 학습 패턴을 구성한 후 역전파 학습 기법을 이용하여 구현되는 순방향 신경회로망을 이용한 rank-order 필터를 구현한다. 세 번째로 신경회로망의 구조의 출력층에 외부 입력으로 순위 정보를 가지도록 하는 rank-order 필터를 순방향 신경회로망을 이용하여 구현한다. 그리고 이러한 제안된 기술들에 대해 확장성, 구조의 복잡도와 시간 지연 등에서의 성능을 비교, 평가한다. 2-입력 정렬기를 이용하는 방식은 확장이 용이하고 비교적 구조가 간단하나 입력 신호들의 정렬을 위해 신경회로망은 순환하는 구조를 가지며 입력 신호의 수에 비례하는 반복 연산 후에 결과를 얻게 된다. 반면에, 순방향 신경회로망을 이용한 rank-order 필터의 구현 방식은 이러한 반복 연산으로 인한 시간 지연을 줄일 수 있으나 상대적으로 복잡한 구조를 가진다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.268-274
• /
• 2005

Since introduction of the PageRank technique, it is known that it ranks web pages effectively In spite of its usefulness, we found a computational drawback, which we call norm-leak, that PageRank values become smaller than they should be in some cases. We present an improved PageRank algorithm that computes the PageRank values of the web pages correctly as well as its efficient implementation. Experimental results, in which over 67 million real web pages are used, are also presented.

• Kyungpook Mathematical Journal
• /
• v.54 no.4
• /
• pp.619-627
• /
• 2014

Let $\mathcal{M}(S)$ denote the set of all $m{\times}n$ matrices over a semiring S. For $A{\in}\mathcal{M}(S)$, zero-term rank of A is the minimal number of lines (rows or columns) needed to cover all zero entries in A. In [5], the authors obtained that a linear operator on $\mathcal{M}(S)$ preserves zero-term rank if and only if it preserves zero-term ranks 0 and 1. In this paper, we obtain new characterizations of linear operators on $\mathcal{M}(S)$ that preserve zero-term rank. Consequently we obtain that a linear operator on $\mathcal{M}(S)$ preserves zero-term rank if and only if it preserves two consecutive zero-term ranks k and k + 1, where $0{\leq}k{\leq}min\{m,n\}-1$ if and only if it strongly preserves zero-term rank h, where $1{\leq}h{\leq}min\{m,n\}$.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1355-1370
• /
• 2019

A curve $X{\subset}\mathbb{P}^r$ has maximal rank if for each $t{\in}\mathbb{N}$ the restriction map $H^0(\mathcal{O}_{\mathbb{P}r}(t)){\rightarrow}H^0(\mathcal{O}_X(t))$ is either injective or surjective. We show that for all integers $d{\geq}r+1$ there are maximal rank, but not arithmetically Cohen-Macaulay, smooth curves $X{\subset}\mathbb{P}^r$ with degree d and genus roughly $d^2/2r$, contrary to the case r = 3, where it was proved that their genus growths at most like $d^{3/2}$ (A. Dolcetti). Nevertheless there is a sector of large genera g, roughly between $d^2/(2r+2)$ and $d^2/2r$, where we prove the existence of smooth curves (even aCM ones) with degree d and genus g, but the only integral and non-degenerate maximal rank curves with degree d and arithmetic genus g are the aCM ones. For some (d, g, r) with high g we prove the existence of reducible non-degenerate maximal rank and non aCM curves $X{\subset}\mathbb{P}^r$ with degree d and arithmetic genus g, while (d, g, r) is not realized by non-degenerate maximal rank and non aCM integral curves.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.157-163
• /
• 2018

People who use SNS publish their diverse ideas on SNS every day. The data posted on the SNS contains many people's thoughts and opinions. In particular, popular keywords served on Twitter compile the number of frequently appearing words in user posts and rank them. However, this method is sensitive to unnecessary data simply by listing duplicate words. The proposed method determines the ranking based on the topic of the word using the relationship diagram between words, so that the influence of unnecessary data is less and the main word can be stably extracted. For the performance comparison in terms of the descending keyword rank and the ratios of meaningless keywords among high rank 20 keywords, we make a comparison between the proposed scheme which is based on morphological analysis and PageRank, and the existing scheme which is based on the number of appearances. As a result, the proposed scheme and the existing scheme have included 55% and 70% of meaningless keywords among high rank 20 keywords, respectively, where the proposed scheme is improved about 15% compared with the existing scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.27-34
• /
• 2014

In this paper, we propose a pupil detection method using hybrid projection function and rank order filter. To reduce error to detect eyebrows as pupil, eyebrows are detected using hybrid projection function in face region and eye region is set to not include the eyebrows. In the eye region, potential pupil candidates are detected using rank order filter and then the positions of pupil candidates are corrected. The pupil candidates are grouped into pairs based on geometric constraints. A similarity measure is obtained for two eye of each pair using template matching, we select a pair with the smallest similarity measure as final two pupils. The experiments have been performed for 700 images of the BioID face database. The pupil detection rate is 92.4% and the proposed method improves about 21.5% over the existing method..