In this study, the effects of heat treatment of aluminum alloy on the tube bending process were investigated in the rotary draw bending process. As two experimental and numerical simulation methods were used to determine the wall-thinning, ovality, and spring back for extruded, annealed, and aged AA6063 aluminum alloy tubes in different bending angles and bend radii. Numerical simulations were ...

introduction: the purpose of this in-vitro study was to compare shaping ability of niti rotary mtwo and flexmaster with stainless steel hand k-flexofile in curved root canals of extracted teeth. materials and methods: mesiobuccal canals of 45 mandibular molar teeth were balanced into three groups of 15 each, with respect to the schneider angle, canal access angle, height, dis-tance and radius o...

Bhandari, M.C. and M.S. Garg, A note on the covering radius of optimum codes, Discrete Applied Mathematics 33 (1991) 3-9. This paper gives a lower bound and an upper bound for the covering radius of optimum codes. The upper bound so obtained is better than other known upper bounds, restricted to optimum codes. Optimum codes of covering radius d1 and d2 are shown to be normal. A binary linear co...

the coordinate transformation allows the exact calculation of some electrode configurations. in this paper the prolate spherical coordination transformation is used to calculate the field of a hyperboloiderod against plan electrode. the exact field is caculated using two new parameters: 1) electrodes spacing and 2) the radius of curvature of the tip of the rod electrode. the partial discharge i...

In this two-part paper we introduce the notion of a stable code and give a new upper bound on the normalized covering radius ofa code. The main results are that, for fixed k and large n, the minimal covering radius t[n, k] is realized by a normal code in which all but one of the columns have multiplicity l; hence tin + 2, k] t[n, k] + for sufficiently large n. We also show that codes with n _-<...

Given a univariate polynomial P with a k-fold multiple root or a k-fold root cluster near some e z, we discuss various different methods to compute a disc near e z which either contains exactly or contains at least k roots of P . Many of the presented methods are known, some are new. We are especially interested in rigorous methods, that is taking into account all possible effects of rounding e...