Effect of repeated torque/mechanical loading cycles on two different abutment types in implants with internal tapered connections: an in vitro study

Internal tapered connections were developed to improve biomechanical properties and to reduce mechanical problems found in other implant connection systems. The purpose of this study was to evaluate the effects of mechanical loading and repeated insertion/removal cycles on the torque loss of abutments with internal tapered connections. Sixty-eight conical implants and 68 abutments of two types were used. They were divided into four groups: groups 1 and 3 received solid abutments, and groups 2 and 4 received two-piece abutments. In groups 1 and 2, abutments were simply installed and uninstalled; torque-in and torque-out values were measured. In groups 3 and 4, abutments were installed, mechanically loaded and uninstalled; torque-in and torque-out values were measured. Under mechanical loading, two-piece abutments were frictionally locked into the implant; thus, data of group 4 were catalogued under two subgroups (4a: torque-out value necessary to loosen the fixation screw; 4b: torque-out value necessary to remove the abutment from the implant). Ten insertion/removal cycles were performed for every implant/abutment assembly. Data were analyzed with a mixed linear model (P <= 0.05). Torque loss was higher in groups 4a and 2 (over 30% loss), followed by group 1 (10.5% loss), group 3 (5.4% loss) and group 4b (39% torque gain). All the results were significantly different. As the number of insertion/removal cycles increased, removal torques tended to be lower. It was concluded that mechanical loading increased removal torque of loaded abutments in comparison with unloaded abutments, and removal torque values tended to decrease as the number of insertion/removal cycles increased. To cite this article:Ricciardi Coppede A, de Mattos MdaGC, Rodrigues RCS, Ribeiro RF. Effect of repeated torque/mechanical loading cycles on two different abutment types in implants with internal tapered connections: an in vitro study.Clin. Oral Impl. Res. 20, 2009; 624-632.doi: 10.1111/j.1600-0501.2008.01690.x.

The stochastic nature of predator-prey cycles

We study by numerical simulations the time correlation function of a stochastic lattice model describing the dynamics of coexistence of two interacting biological species that present time cycles in the number of species individuals. Its asymptotic behavior is shown to decrease in time as a sinusoidal exponential function from which we extract the dominant eigenvalue of the evolution operator related to the stochastic dynamics showing that it is complex with the imaginary part being the frequency of the population cycles. The transition from the oscillatory to the nonoscillatory behavior occurs when the asymptotic behavior of the time correlation function becomes a pure exponential, that is, when the real part of the complex eigenvalue equals a real eigenvalue. We also show that the amplitude of the undamped oscillations increases with the square root of the area of the habitat as ordinary random fluctuations. (C) 2009 Elsevier B.V. All rights reserved.

Geodesics and Almost Geodesic Cycles in Random Regular Graphs

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011

The 3-colored Ramsey number of even cycles

Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdos conjectured that when L is the cycle C(n) on n vertices, R(C(n), C(n), C(n)) = 4n - 3 for every odd n > 3. Luczak proved that if n is odd, then R(C(n), C(n), C(n)) = 4n + o(n), as n -> infinity, and Kohayakawa, Simonovits and Skokan confirmed the Bondy-Erdos conjecture for all sufficiently large values of n. Figaj and Luczak determined an asymptotic result for the `complementary` case where the cycles are even: they showed that for even n, we have R(C(n), C(n), C(n)) = 2n + o(n), as n -> infinity. In this paper, we prove that there exists n I such that for every even n >= n(1), R(C(n), C(n), C(n)) = 2n. (C) 2009 Elsevier Inc. All rights reserved.