نتایج جستجو برای: decomposed lifting algorithm dla
تعداد نتایج: 780082 فیلتر نتایج به سال:
We consider the family of facets of the binary knapsack polytope from minimal covers. We study previous results on sequential lifting in a unifying framework and explore a class of most violated fractional lifted cover inequalities, defined by Balas and Zemel, which are more general than traditional simple lifted cover inequalities. We investigate some theoretical properties of these inequaliti...
A new algorithm is introduced which computes the multivariate leading coefficients of polynomial factors from their univariate images. This algorithm is incorporated into a sparse Hensel lifting scheme and only requires the factorization of a single univariate image. The algorithm also provides the content of the input polynomial in the main variable as a by-product. We show how we can take adv...
A nonlinear mathematical model for the optimal operation of a parallel pumping station group was established with objective minimizing costs considering target quantity water extraction and flow unevenness between units each as constraints. The original is decomposed into several sub-models single multi-objective optimization lifting capacity pump coordinating variable. This constructed solved ...
Due to the existing image definition evaluation functions in auto-focus systems easily affected by noise, an image definition evaluation algorithm based on lifting scheme is proposed. The algorithm uses lifting scheme for wavelet decomposition, and adopts the energy value of high frequency components of wavelet decomposition as image definition evaluation function. Theoretical analysis and exte...
This paper presents a fast algorithm for detecting facial parts such as nose, eyes and lips in an image by using lifting dyadic wavelet filters. Free parameters in the lifting filters are learned so as to maximize the cosine of an angle between a vector whose components are the lifting filters and a vector of pixels in the facial part. Applying the learned filter to a test image, facial parts i...
The main properties of Damped Lyman alpha (DLA) systems are briefly reviewed with the aim of studying the nature and evolution of the galaxies associated with this class of QSO absorbers. Candidate DLA galaxies identified at z ≤ 1 in the fields of background QSOs show a variety of morphological types without a predominance of spirals. Most properties inferred from spectroscopic studies at z ≥ 1...
زمینۀ مطالعه:مولکولهای مجتمع عمده پذیرش بافتی (MHC)، در اتصال به پپتیدهای پادگنی و عرضه آنها به لنفوسیتهای T نقش مهمی دارند و تنوع آنها با پاسخهای ایمنی و خودایمنی مرتبط است. ارتباط ژن کدکننده MHC کلاس 2 در سگ (DRB1)با برخی بیماریهای ایمنی سگ نشان داده شده است. هدف:کشف ارتباط بیماری درماتیت آتوپیک سگ با آللهای ژن DLA-DRB1. روشکار: تعداد 20 نمونه خون از سگهای مبتلا به درماتیت آتوپیک و ...
We present results from an efficient, non-traditional survey to discover damped Lyα (DLA) absorption systems with neutral hydrogen column densities NHI ≥ 2 × 10 atoms cm and redshifts z < 1.65. In the past, identification of DLA systems at z < 1.65 has been difficult due to their rare incidence and the need for UV spectroscopy to detect Lyα absorption at these low redshifts. Our survey relies o...
We used our database of VLT-UVES quasar spectra to build up a sample of 70 Damped Lyman-α (DLA) or strong sub-DLA systems with total neutral hydrogen column densities of log N(H ) > ∼ 20 and redshifts in the range 1.7 < z abs < 4.3. For each of the systems, we measured in an homogeneous manner the metallicities relative to Solar, [X/H] (with X = Zn, or S or Si), and the velocity widths of low-...
In this paper, we present a new lifting algorithm for triangular sets over general p-adic rings. Our contribution is to give, for any p-adic triangular set, a shifted algorithm of which the triangular set is a fixed point. Then we can apply the relaxed recursive p-adic framework and deduce a relaxed lifting algorithm for this triangular set. We compare our algorithm to the existing technique an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید