• Title/Summary/Keyword: Rank

Search Result 3,916, Processing Time 0.043 seconds

Sets of Integer Matrix Pairs Derived from Row Rank Inequalities and Their Preservers

  • Song, Seok-Zun;Jun, Young-Bae
    • Kyungpook Mathematical Journal
    • /
    • v.53 no.2
    • /
    • pp.273-283
    • /
    • 2013
  • In this paper, we consider the row rank inequalities derived from comparisons of the row ranks of the additions and multiplications of nonnegative integer matrices and construct the sets of nonnegative integer matrix pairs which is occurred at the extreme cases for the row rank inequalities. We characterize the linear operators that preserve these extreme sets of nonnegative integer matrix pairs.

Improved PageRank Algorithm Using Similarity Information of Documents (문서간의 유사도를 이용한 개선된 PageRank 알고리즘)

  • 이경희;김민구;박승규
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.169-171
    • /
    • 2003
  • 웹에서의 검색 방법에는 크게 Text-Based 기법과 Link-Based 기법이 있다. 본 논문은 그 중에서 Link-Based 기법의 하나인 PageRank 알고리즘에 대해 연구 하고자 한다. 이 PageRank 알고리즘은 각 페이지의 중요성을 수치로 계산하는 방법이다. 하지만 이 알고리즘에서는 페이지에서 페이지로 링크를 따라갈 확률의 값을 일정하게 주어서 모든 페이지의 값을 획일적으로 계산하였기 때문에 각 페이지의 검색 효율성에 문제가 있다고 판단하여, 이를 해결하고자 본 논문은 페이지사이의 유사도를 측정하여 유사도에 따라 링크를 따라가는 확률 값인 Damping factor값을 다르게 부여하여 검색의 효율성을 높였다. 이를 위하여 두 가지 방법의 실험을 통하여 구현, 증명하였다.

  • PDF

The effect of cortical punching on the expression of OPG, RANK, and RANKL in the periodontal tissue during tooth movement in rats (백서의 치아이동 시 피질골 천공이 치주조직의 OPG, RANK, RANKL의 발현에 미치는 영향)

  • Park, Woo-Kyoung;Kim, Seong-Sik;Park, Soo-Byung;Son, Woo-Sung;Kim, Yong-Deok;Jun, Eun-Sook;Park, Mi-Hwa
    • The korean journal of orthodontics
    • /
    • v.38 no.3
    • /
    • pp.159-174
    • /
    • 2008
  • Objective: The purpose of this study was to investigate whether cortical punching could stimulate the expression of OPG, RANK, and RANKL during tooth movement by immunohistochemistry. Methods: 34 sprague-dawley rats (15 weeks old) were allocated into 3 groups: TMC group (experimental group; Tooth Movement with Corticotomy, n = 16), TM group (control group; Tooth Movement only group, n = 16), and non-treatment group (n = 2). 20 gm of orthodontic force was applied to rat incisors by inserting elastic bands. The duration of force application was 1, 4, 7 and 14 days. A microscrew (diameter 1.2 mm) was used for cortical punching of the palatal side of the upper incisors in the TMC group. Results: Distributions of OPG, RANK, and RANKL were evaluated by immunohistochemistry. OPG, RANK and RANKL were observed on experimental and control groups. On the compression side, the degree of the expression of OPG decreased in both groups. The expression of RANK was most prominent in the experimental group of day 4. The expression of RANKL was most intensive and extensive in the experimental group of day 7. However, the expression of OPG was decreased in the experimental and control groups compared to the non treatment group. The expression of OPG, RANK and RANKL after force application were decreased at day 14. Conclusions: These findings suggested that cortical punching might stimulate remodeling of alveolar bone during a 2 week period of tooth movement without any pathologic change.

Rank-level Fusion Method That Improves Recognition Rate by Using Correlation Coefficient (상관계수를 이용하여 인식률을 향상시킨 rank-level fusion 방법)

  • Ahn, Jung-ho;Jeong, Jae Yeol;Jeong, Ik Rae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.5
    • /
    • pp.1007-1017
    • /
    • 2019
  • Currently, most biometrics system authenticates users by using single biometric information. This method has many problems such as noise problem, sensitivity to data, spoofing, a limitation of recognition rate. One method to solve this problems is to use multi biometric information. The multi biometric authentication system performs information fusion for each biometric information to generate new information, and then uses the new information to authenticate the user. Among information fusion methods, a score-level fusion method is widely used. However, there is a problem that a normalization operation is required, and even if data is same, the recognition rate varies depending on the normalization method. A rank-level fusion method that does not require normalization is proposed. However, a existing rank-level fusion methods have lower recognition rate than score-level fusion methods. To solve this problem, we propose a rank-level fusion method with higher recognition rate than a score-level fusion method using correlation coefficient. The experiment compares recognition rate of a existing rank-level fusion methods with the recognition rate of proposed method using iris information(CASIA V3) and face information(FERET V1). We also compare with score-level fusion methods. As a result, the recognition rate improve from about 0.3% to 3.3%.

Robust Pupil Detection using Rank Order Filter and Pixel Difference (Rank Order Filter와 화소값 차이를 이용한 강인한 눈동자 검출)

  • Jang, Kyung-Shik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1383-1390
    • /
    • 2012
  • In this paper, we propose a robust pupil detection method using rank order filter and pixel value difference in facial image. We have detected the potential pupil candidates using rank order filter. Many false pupil candidates found at eyebrow are removed using the fact that the pixel difference is much at the boundary between pupil and sclera. The rest pupil candidates are grouped into pairs. Each pair is verified according to geometric constraints such as the angle and the distance between two candidates. A fitness function is obtained for each pair using the pixel values of two pupil regions, we select a pair with the smallest fitness value as a final pupil. The experiments have been performed for 400 images of the BioID face database. The results show that it achieves more than 90% accuracy, and especially the proposed method improves the detection rate and high accuracy for face with spectacle.

The Expression of RANK and RANKL in Gingival Tissue of Human Chronic Periodontitis (만성 치주염 환자의 치은 조직에서 RANK 및 RANKL의 발현)

  • Baek, Young-Ran;Lee, Jae-Mok
    • Journal of Periodontal and Implant Science
    • /
    • v.37 no.4
    • /
    • pp.849-857
    • /
    • 2007
  • Purpose: The purposes of this study were to compare and quantify the expressions of RANK and RANKL in the gingival tissues of non-periodontitis patient and patients with chronic periodontitis, in order to understand the contribution of these proteins to periodontal destruction. Material and methods: Gingival tissue samples were obtained during periodontal surgery or tooth extraction. According to the patient's systemic condition & clinical criteria of gingiva, each gingival sample was divided into two groups. Group 1 (n=8) is clinically healthy gingiva without bleeding and no evidence of bone resorption or periodontal pockets, obtained from non-periodontitis patients. Group 2 (n=8) is inflammed gingiva from patients with chronic periodontitis. Tissue samples were prepared and analyzed by Western blotting. The quantification of RANK and RANKL were performed using a densitometer and statistically analyzed by Student's t-Test. Results: The expression of RANK were similar in group 1 and 2. The difference between group 1 and 2 was not statistically significant. And the mean amount of RANKL was more increased in group 2 than group 1. The difference between group 1 and group 2 was statistically significant. Conclusion: The expression level RANK didn't show any significant difference between healthy tissue from non-periodontitis patients and inflamed tissue from chronic periodontitis, but the expression level of RANKL in inflammed tissue from chronic periodontitis showed significantly increased tendency compared to healthy gingiva from non-periodontitis patients. Therefore, characteristics of RANK and RANKL in progress of chronic periodontitis would be basis of further studies in diagnostic method and treatment index of the disease.

Iterative Low Rank Approximation for Image Denoising (영상 잡음 제거를 위한 반복적 저 계수 근사)

  • Kim, Seehyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1317-1322
    • /
    • 2021
  • Nonlocal similarity of natural images leads to the fact that a patch matrix whose columns are similar patches of the reference patch has a low rank. Images corrupted by additive white Gaussian noises (AWGN) make their patch matrices to have a higher rank. The noise in the image can be reduced by obtaining low rank approximation of the patch matrices. In this paper, an image denoising algorithm is proposed, which first constructs the patch matrices by combining the similar patches of each reference patch, which is a part of the noisy image. For each patch matrix, the proposed algorithm calculates its low rank approximate, and then recovers the original image by aggregating the low rank estimates. The simulation results using widely accepted test images show that the proposed denoising algorithm outperforms four recent methods.

OPERATORS WITH RANK ONE SELFCOMMUTATORS

  • Lee, Jun Ik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.1
    • /
    • pp.163-168
    • /
    • 2010
  • In this paper it is shown that if [$T^*$,T] is of rank one and ker [$T^*$,T] is invariant for T, then T is quasinormal. Thus, we can know that the hyponormal condition is superfluous in the Morrel's theorem.

LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES

  • Kim, Seong-A.;David, Minda
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.6
    • /
    • pp.1181-1190
    • /
    • 1999
  • Zero-term rank of a matrix is the minimum number of lines (rows or columns) needed to cover all the zero entries of the given matrix. We characterized the linear operators that preserve zero-term rank of the m×n matrices over binary Boolean algebra.

  • PDF