We present the results of a combined experimental and theoretical investigation of the normal impact of hydrophobic spheres on a water surface. Particular attention is given to characterizing the shape of the resulting air cavity in the low Bond number limit, where cavity collapse is driven principally by surface tension rather than gravity. A parameter study reveals the dependence of the cavit...

BACKGROUND Sturge-Weber syndrome is a rare congenital neuro- oculo- cutaneous disorder. OBJECTIVE To report a very rare unusual case of bilateral manifestation of Sturge Weber syndrome. CASE We report an unusual case of a 17-year-old female with advanced stage of bilateral glaucoma associated with facial nevus extending to the other half of the face as well and bilateral intracranial calcif...

Class field theory describes the abelian extensions of a number field using the arithmetic of that field. The Kronecker-Weber theorem states that all abelian extensions of the rationals are contained in cyclotomic fields. As we know, cyclotomic fields can be generated by special values of the exponential function e, and we call this the theory of complex multiplication for Gm. We would thus lik...

The aim of this study was to focus on similarities in the discrimination of three different quantities--time, number, and line length--using a bisection task involving children aged 5 and 8 years and adults, when number and length were presented nonsequentially (Experiment 1) and sequentially (Experiment 2). In the nonsequential condition, for all age groups, although to a greater extent in the...

abstractin this study the main goal is explain the achievements of development after the revolution as a unique and special phenomenon as “various local development” based on the specific realities of iranian society. for this purpose have been used of analytical and concept framework weber’s sociology in explaining the qualitative transformation. according to this model, in creating evolution ...

Recently, Ken Weber introduced an algorithm for finding the (a, b)-pairs satisfying au + bv ≡ 0 (mod k), with 0 < |a|, |b| < √ k, where (u, k) and (v, k) are coprime. It is based on Sorenson’s and Jebelean’s “k-ary reduction” algorithms. We provide a formula for N(k), the maximal number of iterations in the loop of Weber’s GCD algorithm.