نتایج جستجو برای: c perfect complex
تعداد نتایج: 1793356 فیلتر نتایج به سال:
tabriz petrochemical complex is located in northwest of iran and west of tabriz oil refinery and mostly produces raw plastics. in this study the implementation of reduction of hazardous waste contact in this complex with special emphasis on personal protective equipment (ppe) is discussed. accordingly different hazards threatening personnel, indoor and outdoor environment were determined. in or...
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set φ1, . . . , φs of linear functionals from V to F with the following property: for all t subsets X ⊆ V there exists i ∈ {1, . . . , s} such that φi is injective when restricted to F . A linear (qd, q, t)-perfect hash family of minimal size d(t− 1) is said to be optimal. I...
determination of uranium in natural water and complex solutions using ion exchange chromatography: a combined procedure using ion exchange chromatography and uv-vis spectrophotometry techniques has been developed to measure uranum in natural water and complex solutions. after conditicing , one hundred milli liters of sample solutions have been passed through an ion exchange column,pachked with ...
A c-ary Perfect Factor is a collection of uniformly long cycles whose elements are drawn from a set of size c, in which every possible v-tuple of elements occurs exactly once. In the binary case, i.e. where c = 2, these perfect factors have previously been studied by Etzion, [1], who showed that the necessary conditions for their existence are in fact sufficient. This result has recently been e...
Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-simple (v, 5, 2)-BIBDs with possible exceptions of v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}. In this article, we investigate the existence of a super-simple (v, 5, 4)-BIBD and show that such a design exi...
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bitboards. Moreover, we show that simple variations of these schemes give minimal perfect hashing schemes. The new method is applicable provided N , the number of k-bit spaced positions that may be set to 1, is not more t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید