Korea has four distinct seasons: spring, summer, fall, and winter. April is sunny springtime, with new buds on the trees and fantastic cherry blossoms in the streets all over the country. Childhood and adolescence are like the spring season in a human’s lifetime. They are an energetic and dynamic period during which growth and regeneration are occurring every day. The Korean Society of Pediatri...

Head again the correspondence with Her Majesty's Secretary Military (Separate), to Secretary Of State, noted on the marof State, Ho. 121, dated 2ud Juiie, gin, regarding the establishl5pJblic?From Secretary of State, mc,,tofa B?atce? for "l? No. 40, dated 30tli April, 1867. supervision ot tllO public Public?To Secretary of 8tate, health throughout India, No. loJ, dated 10th August, 18C7. ant^ t...

For positive integers n, q, t we determine the maximum number of integer sequences (a1, . . . , an) which satisfy 1 ≤ ai ≤ q for 1 ≤ i ≤ n, and any two sequences agree in at least t positions. The result gives an affirmative answer to a conjecture of Frankl and Füredi.

www.amepc.org/tau © Translational Andrology and Urology. All rights reserved. Yinglu Guo, Professor and Honorary President of Peking University and Academician of China Academy of Engineering, received Distinguished Career Award at the 35th Congress of the Société Internationale d’Urologie (SIU) which was attended by up to 4,000 urological experts on October 15, 2015. Professor Guo was presente...

Let V be an n-dimensional vector space over GF(q) and for integers k > t > 0 let m,(n, k, t) denote the maximum possible number of subspaces in a t-intersecting family 9 of k-dimensional subspaces of V, i.e.

We study the existence of solutions to Bolza problems involving a special class of one dimensional, nonconvex integrals. These integrals describe the possibly singular, radial deformations of certain rubber-like materials called Blatz-Ko materials.

Fix integers k ≥ 3 and n ≥ 3k/2. Let F be a family of k-sets of an n-element set so that whenever A,B, C ∈ F satisfy |A ∪ B ∪ C| ≤ 2k, we have A ∩ B ∩ C 6= ∅. We prove that |F| ≤ (n−1 k−1 ) with equality only when ⋂ F∈F F 6= ∅. This settles a conjecture of Frankl and Füredi [2], who proved the result for n ≥ k + 3k.