نتایج جستجو برای: matching numbers
تعداد نتایج: 295841 فیلتر نتایج به سال:
The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...
The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...
the proposed algorithm suggests a new method for determination of k/s value of primaries based on linear least squares technique. by applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant kubelka-munk theory. the selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...
Let G be a finite simple graph on the vertex set $$V(G) = \{x_{1}, \ldots , x_{n}\}$$ and match(G), min-match(G) ind-match(G) matching number, minimum number induced of G, respectively. $$K[V(G)] K[x_{1}, x_{n}]$$ denote polynomial ring over field K $$I(G) \subset K[V(G)]$$ edge ideal G. The relationship between these graph-theoretic invariants ring-theoretic quotient K[V(G)]/I(G) has been stud...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید