• 제목/요약/키워드: Root finding

검색결과 179건 처리시간 0.032초

FIR/IIR Lattice 필터의 설계를 위한 Circulant Matrix Factorization을 사용한 Spectral Factorization에 관한 연구 (Study of Spectral Factorization using Circulant Matrix Factorization to Design the FIR/IIR Lattice Filters)

  • 김상태;박종원
    • 한국정보통신학회논문지
    • /
    • 제7권3호
    • /
    • pp.437-447
    • /
    • 2003
  • Circulant Matrix Factorization (CMF)는 covariance 행렬의 spectral factorization된 결과를 얻을 수 있다. 우리는 얻어진 결과를 가지고 일반적으로 잘 알려진 방법인 Schur algorithm을 이용하여 finite impulse response(FIR)와 infinite impulse response (IIR) lattice 필터를 설계하는 방법을 제안하였다. CMF는 기존에 많이 사용되는 root finding을 사용하지 않고 covariance polynomial로부터 minimum phase 특성을 가지는 polynomial을 얻는데 유용한 방법이다. 그리고 Schur algorithm은 toeplitz matrix를 빠르게 Cholesky factorization하기 위한 방법으로 이 방법을 이용하면 FIR/IIR lattice 필터의 계수를 쉽게 찾아낼 수 있다. 본 논문에서는 이러한 방법들을 이용하여 FIR과 IIR lattice 필터의 설계의 계산적인 예제를 제시했으며, 제안된 방법과 다른 기존에 제시되었던 방법 (polynomial root finding과 cepstral deconvolution)들과 성능을 비교 평가하였다.

Circulant Matrix Factorization을 이용한 FIR/IIR Lattice 필터의 설계 (Design of FIR/IIR Lattice Filters using the Circulant Matrix Factorization)

  • 김상태;임용곤
    • 대한전자공학회논문지TC
    • /
    • 제41권1호
    • /
    • pp.35-44
    • /
    • 2004
  • Circulant Matrix Factorization (CMF)는 covariance 행렬의 spectral factorization된 결과를 얻을 수 있다. 우리는 얻어진 결과를 가지고 일반적으로 잘 알려진 방법인 Schur algorithm을 이용하여 finite impulse response (FIR)차 infinite impulse response (IIR) lattice 필터를 설계하는 방법을 제안하였다. CMF는 기존에 많이 사용되는 root finding을 사용하지 않고 covariance Polynomial로부터 minimum phase 특성을 가지는 polynomial을 얻는데 유용한 방법이다. 그리고 Schur algorithm은 toeplitz matrix를 빠르게 Cholesky factorization하기 위한 방법으로 이 방법을 이용하면 FIR/IIR lattice 필터의 계수를 쉽게 찾아낼 수 있다. 본 논문에서는 이러한 방법들을 이용하여 FIR과 IIR lattice 필터의 설계의 계산적인 예제를 제시했으며, 제안된 방법과 다른 기존에 제시되었던 방법 (polynomial root finding과 cepstral deconvolution)들과 성능을 비교 평가하였다.

Asymmetry in mesial root number and morphology in mandibular second molars: a case report

  • Nayak, Gurudutt;Shetty, Shashit;Shekhar, Rhitu
    • Restorative Dentistry and Endodontics
    • /
    • 제39권1호
    • /
    • pp.45-50
    • /
    • 2014
  • Ambiguity in the root morphology of the mandibular second molars is quite common. The most common root canal configuration is 2 roots and 3 canals, nonetheless other possibilities may still exist. The presence of accessory roots is an interesting example of anatomic root variation. While the presence of radix entomolaris or radix paramolaris is regarded as a typical clinical finding of a three-rooted mandibular second permanent molar, the occurrence of an additional mesial root is rather uncommon and represents a possibility of deviation from the regular norms. This case report describes successful endodontic management of a three-rooted mandibular second molar presenting with an unusual accessory mesial root, which was identified with the aid of multiangled radiographs and cone-beam computed tomography imaging. This article also discusses the prevalence, etiology, morphological variations, clinical approach to diagnosis, and significance of supernumerary roots in contemporary clinical dentistry.

FINDING THE INTERSECTION POINT OF A NONPARAMETRIC SURFACE AND A LINE IN $R^3$

  • Kim, Hoi-Sub;Jo, Chang-Mog;Lee, Se-Joon;Jun, Cha-Soo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제7권1호
    • /
    • pp.1-5
    • /
    • 2003
  • We suggest Bisection method, Fixed point method and Newton's method for finding the intersection point of a nonparametric surface and a line in $R^3$ and apply ray-tracing in Color Picture Tube or Color Display Tube.

  • PDF

정보산업 생태계 문제의 근본원인 분석 (Root Cause Analysis of the Information Industry Ecosystem Problems)

  • 김성근;안남규
    • Journal of Information Technology Applications and Management
    • /
    • 제24권4호
    • /
    • pp.71-92
    • /
    • 2017
  • Finding a root cause is an essential step to solving a complex problem. Some previous studies have used the Delphi method for gathering opinions about root causes from geographically dispersed experts. However, we assert that complicated problems such as an industry ecosystem would make a general type of the Delphi method less practical because of too much psychological burden on study participants. In this study we present a preliminary list-based Delphi study method for identifying a root cause. This method was used to identify a root cause and draw a causal map for the information industry ecosystem problems.

구개근 절제술을 이용한 상악 제일 대구치의 치료 (Palatal root resection of compromised maxillary first molars)

  • 정성념
    • Journal of Periodontal and Implant Science
    • /
    • 제39권3호
    • /
    • pp.375-381
    • /
    • 2009
  • Purpose: Root resection can be a valuable procedure when the tooth in question has a high strategic value. The prognosis of root resection has been well documented in previous studies, but the results focused on the palatal root resection have not been discussed in depth. I represent here the short term effectiveness of palatal root resection of maxillary first molars. Methods: Palatal root resection was performed on maxillary first molars of three patients. All the palatal roots were floating state on the radiographic finding and showed full probing depth and purulent exudation at initial examination. Reduction of palatal cusp and occlusal table was performed concomitantly. Endodontic therapy was completed after root resection. Results: Compromised maxillary first molars were treated successfully by palatal root resection in 3 cases. The mobility of resected tooth was decreased a little bit. The probing pocket depth of remaining buccal roots was not increased compared to initial depth. All the patients satisfied with comfort and cost effective results and the fact they could save their natural teeth. Conclusions: Within the above results, palatal root resection is an effective procedure treating compromised maxillary first molar showing advanced palatal bone loss to root apex with or without pulp involvement when proper case selection is performed.

유한체상에서 세제곱근을 찾는 두 종류의 알고리즘 (Two Types of Algorithms for Finding the Cube Root in Finite Fields)

  • 조국화
    • 한국통신학회논문지
    • /
    • 제41권5호
    • /
    • pp.499-503
    • /
    • 2016
  • Cipolla-Lehmer 알고리즘을 향상시킨 새로운 알고리즘을 통해 효율적으로 세제곱근을 찾을 수 있는 방법을 연구하였다. 본 논문에서는 일반적인 Cipolla-Lehmer 알고리즘보다 곱셈량을 줄인 향상된 두 가지 알고리즘을 소개한다. 유한체상에서 세제곱근을 찾는 곱셈량이 비슷한 두 가지 알고리즘을 제안하고, 곱셈량이 비슷하더라도 저장변수의 개수가 적을수록 효율적임을 보인다.

매복 하악 견치의 자가이식술을 이용한 치험례 (Autotransplantation of impacted mandibular canine)

  • 홍성수;이상호;김동필
    • 대한소아치과학회지
    • /
    • 제24권3호
    • /
    • pp.710-717
    • /
    • 1997
  • Autotransplantation is the transplantation of embeded, impacted, or unerupted tooth, into extraction socket or surgically prepared socket in the same individual. Clinically, successful autotransplantation must show radiolucent space(periodontal ligament space) between transplanted tooth and supporting bone, lamina dura, no root resorption, no ankylosis, no inflammatory change, and physiologic tooth mobility. It is important that procedure is atraumatic, and the instruments should not contact the root surface during procedure. We performed autotransplantation of impacted mandibular canine that transversely located beneath the apices of the mandibular incisors with uncompletely developed apex. In radiographs and clinical evaluation, this transplant showed successful clinical finding except irregularity of mesial root surface after 14 months. It is conclued that transplantation of canine with $\frac{1}{2}{\sim}\frac{3}{4}$ root development provides a good chance of pulp survival, limited risk of root resorption and ensures sufficient final length, and is thus recommended.

  • PDF

A Cholesky Decomposition of the Inverse of Covariance Matrix

  • Park, Jong-Tae;Kang, Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권4호
    • /
    • pp.1007-1012
    • /
    • 2003
  • A recursive procedure for finding the Cholesky root of the inverse of sample covariance matrix, leading to a direct solution for the inverse of a positive definite matrix, is developed using the likelihood equation for the maximum likelihood estimation of the Cholesky root under normality assumptions. An example of the Hilbert matrix is considered for an illustration of the procedure.

  • PDF