(Lp,Lq)-Boundedness of Hausdorff Operators with Power Weight on Euclidean Spaces

In this paper, we prove the (Lp,Lq)-boundedness of (fractional) Hausdorff operators with power weight on Euclidean spaces.As special cases, we can obtain some well known results about Hardy operators.     

A GLOBALLY CONVERGENT ALGORITHM FOR THE EUCLIDEAN MULTIPLICITY LOCATION PROBLEM

The Euclidean single facility location problem (ESFL) and the Euclidean multiplicity lo-cation problem (EMFL) are two special nonsmooth convex programming problems which haveattracted a largr literature. For the ESFL problem. there are algorithms which converge bothglobally and quadratically For the EMFL problem, there are some quadratically convergentalgorithms. but for global convergencel they all need nontrivial assumptions on the problem.In this paper, we present an algorithm for EMFL. With no assumption on the problem, it isproved that from any initial point, this algorithm generates a sequence of points which convergesto the closed convex set of optimal solutions of EMFL.     

The Teodorescu Operator in Clifford Analysis

Euclidean Clifford analysis is a higher dimensional function theory centred around monogenic functions,i.e.,null solutions to a first order vector valued rotation invariant differential operator (θ) ca...     

上半空间中一类次调和函数的增长估计

本文证明了n-维(n≥2)Euclidean空间的上半空间中Poisson积分在无穷远点处的增长性质.同时将这个性质推广到次调和函数中去,其概括了解析函数和调和函数的增长性质.     

稀疏表示及其在人脸识别中的应用

稀疏表示是近年来新兴的一种数据表示方法,是对人类大脑皮层编码机制的模拟。稀疏表示以其良好的鲁棒性、抗干扰能力、可解释性和判别性等优势,广泛应用于模式识别领域。基于稀疏表示的分类器在人脸识别领域取得了令人惊喜的成就,它将训练样本看成字典,寻求测试样本在字典下的最稀疏的表示,即用尽可能少的训练样本的线性组合来重构测试样本。但是经典的基于稀疏表示的分类器没有考虑训练样本的类别信息,以致被选中的训练样本来自许多类,不利于分类,因此基于组稀疏的分类器被提出。组稀疏方法考虑了训练样本的类别相似性,其目的是用尽可能少类别的训练样本来表示测试样本,然而这类方法的缺点是同类的训练样本或者同时被选中或者同时被丢弃。在实际中,人脸受到光照、表情、姿势甚至遮挡等因素的影响,样本之间关系比较复杂,因此最后介绍局部加权组结构稀疏表示方法。该方法尽量用来自于与测试样本相似的类的训练样本和来自测试样本邻域的训练样本来表示测试样本,以减轻不相关类的干扰,并使得表示更稀疏和更具判别性。     

Complete λ-Hypersurfaces in Euclidean Spaces*

In this paper, the authors give a survey about λ-hypersurfaces in Euclidean spaces. Especially, they focus on examples and rigidity of λ-hypersurfaces in Euclidean spaces.     

Empirical Euclidean likelihood for general estimating equations under association dependence

Empirical Euclidean likelihood for general estimating equations for association dependent processes is investigated. The strong consistency and asymptotic normality of the blockwise maximum empirical Euclidean likelihood estimator are presented. We show that it is more efficient than estimator without blocking. The blockwise empirical Euclidean log-likelihood ratio asymptotically follows a chi-square distribution.     

THERMAL EQUILIBRIUM AND KMS CONDITION AT THE PLANCK SCALE

Considering the expected thermal equilibrium characterizing the physics at the Planck scale, it is here stated, for the first time, that, as a system, the space-time at the Planck scale must be considered as subject to the Kubo-Martin-Schwinger (KMS) condition. Consequently, in the interior of the KMS strip, i.e. from the scale B = 0 to the scale B = lplanck, the fourth coordinate g44 must be considered as complex, the two real poles being 6 = 0 and B = lplanck. This means that within the limits of the KMS strip, the Lorentzian and the Euclidean metric are in a "quantum superposition state" (or coupled), this entailing a "unification" (or coupling) between the topological (Euclidean) and the physical (Lorentzian) states of space-time.     

The Continued Fraction Solution of the Matrix Equation AX-XB=C

Let K[λ] denote the polynomial ring over the number field K.Suppose thatf(λ)and g(λ)are coprime in K[λ] and deg f(λ)≥1.By the Euclidean algorithmwe obtain the continued fraction     

Quasiconformal Mappings and Weakly John Domains

Let D be a bounded domain in R~2 and c(≥1)be a constant.We say that D is a c-Johndomain if there exists x_0∈D such that for any x∈D,there must be a rectifiable curve γDwhich joins x and x_0,satisfying l(γ(x,y))≤cd(y,D)for any y ∈γ,where l(γ(x,y))denotesthe Euclidean length of the subcurce γ between x and y,d(y,D)is the Euclidean distance fromy to the boundary D of D.We say that D is a John domain if D is a c-John domain for some