نتایج جستجو برای: small diameter implants

تعداد نتایج: 929464  

2014
Višnja Katić Ervin Kamenar David Blažević Stjepan Špalj

OBJECTIVE To determine the unique contribution of geometrical design characteristics of orthodontic mini-implants on maximum insertion torque while controlling for the influence of cortical bone thickness. METHODS Total number of 100 cylindrical orthodontic mini-implants was used. Geometrical design characteristics of ten specimens of ten types of cylindrical self-drilling orthodontic mini-im...

Journal: :Journal of the Illuminating Engineering Institute of Japan 1985

2013
Giuseppe Vairo Gianpaolo Sannino

This study aimed to investigate the influence of implant design (in terms of diameter, length, and thread shape), in-bone positioning depth, and bone posthealing crestal morphology on load transfer mechanisms of osseointegrated dental implants based on platform-switching concept. In order to perform an effective multiparametric comparative analysis, 11 implants different in dimensions and in th...

2007
PAUL PETRUNGARO

T he use of dental implants to replace the natural tooth system has become commonplace in the contemporary restorative and surgical dental practice.1,2 Substantiation of their efficacy has been well-documented in restorative, cosmetic, and surgical dental literature,1,2 and with the advancements in surgical techniques and implant design features, their use in the esthetic zone has become a succ...

Journal: :Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering 2005

Journal: :Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21 2007

Journal: :SIAM Journal on Discrete Mathematics 2022

We study the 3-Coloring problem in graphs with small diameter. In 2013, Mertzios and Spirakis showed that for $n$-vertex diameter-2 this can be solved subexponential time $2^{\mathcal{O}(\sqrt{n \log n})}$. Whether polynomial remains a well-known open question area of algorithmic graph theory. paper we present an algorithm solves $2^{\mathcal{O}(n^{1/3} \log^{2} n)}$. This is first improvement ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید