نتایج جستجو برای: international organization for standardization
تعداد نتایج: 10516910 فیلتر نتایج به سال:
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.
The International Organization for Standardization (ISO) decided to establish a Technical Committee 201 (TC201) on the standardization of surface chemical analysis in 1991. Since then, TC201 has published 38 ISO standards. They concern the vocabulary, instrument specifications, pretreatments of specimen, the procedures for analysis, apparatus alignments, measurement conditions, quantification a...
AIMS Speckle tracking echocardiography has already demonstrated its clinical potential. However, its use in routine practice is jeopardized by recent reports on high inter-vendor variability of the measurements. As such, the European Association of CardioVascular Imaging (EACVI) and the American Society of Echocardiography (ASE) set up a standardization task force, which was joined by all manuf...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید