در مطالعات زمین‌شناسی و کانی‌شناسی، وجود پوشش‌ گیاهی سالم خشک پیکسل‌های حاوی اطلاعات طیفی اجتناب‌ناپذیر است. بنابراین، بازیابی حد زیرپیکسل، مانند برآورد میزان حضور یک کانی پیکسل از تصاویر سنجش دور ابرطیفی، مسئله‌ای مهم محسوب می‌شود. این پژوهش، روش عمق پیوستار اصلاح‌شدة اثر پوشش (VCCD)، برای کاهش تخمین کانی‌های هدف، با استفاده داده‌های طیف‌سنجی، آزمایشگاهی کانی‌شناسی هایپریون (Hyperion) اصلاح من...

Covariate-adjusted regression was recently proposed for situations where both predictors and response in a regression model are not directly observed, but are observed after being contaminated by unknown functions of a common observable covariate. The method has been appealing because of its flexibility in targeting the regression coefficients under different forms of distortion. We extend this...

Denote by x a random innnite path in the graph of Pascal's triangle (left and right turns are selected independently with xed probabilities) and by d n (x) the binomial coeecient at the n'th level along the path x. Then for a dense G set of in the unit interval, fd n (x)g is almost surely dense but not uniformly distributed modulo 1.

Let (ei) be a dictionary for a separable Banach space X . We consider the problem of approximation by linear combinations of dictionary elements with quantized coefficients drawn usually from a ‘finite alphabet’. We investigate several approximation properties of this type and connect them to the Banach space geometry of X . The existence of a total minimal system with one of these properties, ...

are classes of starlike and strongly starlike functions of order β (0 < β ≤ 1), respectively. Note that S∗(β)⊂ S∗ for 0< β< 1 and S∗(1)= S∗ [5]. Kanas [2] introduced the subclass R̄δ(β) of function f ∈ S as the following. Definition 1.1. For δ ≥ 0, β ∈ (0,1], a function f normalized by (1.1) belongs to R̄δ(β) if, for z ∈D−{0} and Dδf(z)≠ 0, the following holds: ∣∣∣arg z ( Dδf(z) )′ Dδf(z) ∣∣∣≤ βπ...

Denote by x a random infinite path in the graph of Pascal’s triangle (left and right turns are selected independently with fixed probabilities) and by dn(x) the binomial coefficient at the n’th level along the path x. Then for a dense Gδ set of θ in the unit interval, {dn(x)θ} is almost surely dense but not uniformly distributed modulo 1.

Since its introduction in the year 1998 by Watts and Strogatz, the clustering coefficient has become a frequently used tool for analyzing graphs. In 2002 the transitivity was proposed by Newman, Watts and Strogatz as an alternative to the clustering coefficient. As many networks considered in complex systems are huge, the efficient computation of such network parameters is crucial. Several algo...