• 沒有找到結果。

以實驗動物模型驗證一新設計之牙科植體穩固度裝置

N/A
N/A
Protected

Academic year: 2021

Share "以實驗動物模型驗證一新設計之牙科植體穩固度裝置"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

以實驗動物模型驗證一新設計之牙科植體穩固度裝置

黃豪銘;鄭光祐;林哲堂;黃威軍;姚維正;李勝揚

Abstract

Natural frequency (NF) technology was used to design a dental implant stability detector. Both in vivo and in vitro experiments were performed to test the possibility of using such device for detecting the status of implants. The natural frequency increasing ratio (NFIR), defined as the percentage changes between the measured NF value at each testing time-point and its initial testing value, was used as a parameter to assess implant stability. In in vitro tests, changes in stability of the root form of the dental implant were simulated by clamping the implant with a clamping stand. When the

clamping torque was increased from 2 to 10 N-cm, the NFIRs obtained from the traditional hammer-impacting method and from the current designed device showed no significantly differences (p = 0.053). When the implants placed in a dog’s mandible were measured using the NF device, there was a continuous increase in NFIR for the first 8 weeks. The mean NFIR value at the first week was 0.13 ±0.048; the NFIR significantly increased to 0.408 ± 0.076 (p < 0.05) by week 8. Thereafter, the measurements maintained at a plateau. When comparing the NFIR curve obtained from in vivo tests to the histological images, a strong correlation between the two data sets was found. In conclusion, the idea of using the present NF device for detecting the degree of bone healing during the osseointegration process seems feasible.

參考文獻

相關文件

If the skyrmion number changes at some point of time.... there must be a singular point

• An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.. • An algorithm is

– The futures price at time 0 is (p. 275), the expected value of S at time ∆t in a risk-neutral economy is..

Establish the start node of the state graph as the root of the search tree and record its heuristic value.. while (the goal node has not

As we shall see in Section 30.2, if we choose “complex roots of unity” as the evaluation points, we can produce a point-value representation by taking the discrete Fourier transform

To decide the correspondence between different sets of fea- ture points and to consider the binary relationships of point pairs at the same time, we construct a graph for each set

To convert a string containing floating-point digits to its floating-point value, use the static parseDouble method of the Double class..

Model checking: residuals can be obtained by 1-step ahead forecast errors at each time point, (observations minus the fitted value) Then if the model is adequate, residuals should