نتایج جستجو برای: strip partitioning

تعداد نتایج: 55646  

Journal: :Contact dermatitis 2010
Heinrich Dickel Burkhard Kreft Oliver Kuss Margitta Worm Stephanie Soost Jochen Brasch Wolfgang Pfützner Jürgen Grabbe Irena Angelova-Fischer Peter Elsner Joachim Fluhr Peter Altmeyer Johannes Geier

BACKGROUND As a modification of patch testing, the strip patch test was established to obtain more sensitive and reliable test results. Comparative data on diagnostic accuracy for both tests are missing. OBJECTIVES To compare the diagnostic accuracy of strip patch tests and patch tests in detecting sensitizations in patients with suspected allergic contact dermatitis by using patient history ...

2014
Zhizeng Wang Dejuan Zhi Yang Zhao Hailong Zhang Xin Wang Yi Ru Hongyu Li

Although high melamine (MEL) intake has been proven to cause serious health problems, MEL is sometimes illegally added to milk products and animal feed, arousing serious food safety concerns. A satisfactory method of detecting MEL in onsite or in-home testing is in urgent need of development. This work aimed to explore a rapid, convenient, and cost-effective method of identifying MEL in milk pr...

Journal: :Journal of Cell Biology 2006

Journal: :Discussiones Mathematicae Graph Theory 1997
Jozef Bucko Marietjie Frick Peter Mihók Roman Vasky

Let P1, . . . ,Pn be properties of graphs. A (P1, . . . ,Pn)-partition of a graph G is a partition of the vertex set V (G) into subsets V1, . . . , Vn such that the subgraph G[Vi] induced by Vi has property Pi; i = 1, . . . , n. A graph G is said to be uniquely (P1, . . . ,Pn)-partitionable if G has exactly one (P1, . . . ,Pn)-partition. A property P is called hereditary if every subgraph of ev...

2006
RICHARD K. GUY

3. A lower bound To obtain a lower bound we count only those sequences of refinements which include the partition 1 .2.3 . . . d . r of n into d or d + 1 parts, d of which are of different size, where 0 < r = n-$d(d + 1) < d, so that J(2n) > d > J(2n)-3. Moreover we only count sequences in which we split off 1 from each of the d 1 parts of different size greater than 1. These d 1 steps can be m...

Journal: :Discrete Mathematics 2014
Peter Borg

We call a sum a1 + a2 + · · ·+ ak a partition of n of length k if a1, a2, . . . , ak and n are positive integers such that a1 ≤ a2 ≤ · · · ≤ ak and n = a1 + a2 + · · ·+ ak. For i = 1, 2, . . . , k, we call ai the i-th part of the sum a1 + a2 + · · ·+ ak. Let Pn,k be the set of all partitions of n of length k. We say that two partitions a1 + a2 + · · · + ak and b1 + b2 + · · ·+ bk strongly inter...

Journal: :Australasian J. Combinatorics 2003
Robin J. Chapman

We give a simple combinatorial proof of three identities of Warnaar. The proofs exploit involutions due to Franklin and Schur.

Journal: :J. Comb. Theory, Ser. A 2004
Ae Ja Yee

Theorems in the theory of partitions are closely related to basic hypergeometric series. Some identities arising in basic hypergeometric series can be interpreted in the theory of partitions using Fpartitions. In this paper, Ramanujan’s 1ψ1 summation and the q-Gauss summation are established combinatorially.

Journal: :Discrete & Computational Geometry 1986

2017
Panos Vostanis

On September 2000, the Al Aqsa Itifada erupted. Palestinian children and families have been exposed to a variety of traumatic events, ranging from hearing of killing, to bombardment by helicopters at the entire Gaza Strip. The current conflict differs from the previous Intifada, in which events such as night and day raids were common occurrence in previous Intifada (1987-1993). Shelling and bom...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید