EXISTENCE OF GENERALIZED WEAKLY SOLUTIONS OF DIFFERENTIAL EQUATIONS IN PRODUCT SPACES

In this paper, by using Lyapunov function and weak noncompactness conditions, we give an existence theorem of generalized weakly solutions of Cauchy problem of differential equations in product spaces.     

集值映射的切导数与向量优化问题的最优性条件

利用集值映射切导数与半可微概念，给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。     

BOUNDEDNESS OF VECTOR-VALUED CALDERN-ZYGMUND OPERATORS ON HERZ SPACES WITH NON-DOUBLING MEASURES

In the paper we obtain vector-valued inequalities for Calder6n-Zygmund operator, simply CZO on Herz space and weak Herz space. In particular.we obtain vector-valued inequalities for CZO on Lq(Rd, |x|αdμ) space, with 1< q <∞, -n <α< n(q -1), and on L1,∞(Rd,|x|αdμ) space, with -n <α< 0.     

Support vector machine via nonlinear rescaling method

In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program 76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated with the given data-set provide important information about each data point and play the key role in selecting the set of support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors in several instances were substantially reduced.     

单位球上不同Privalov空间之间的复合算子

利用η-Carleson测度给出了单位球上不同Privalov以及不同加权Bergman-Privalov空间之间的复合算子是度量有界或度量紧的充要条件,并给出了一些函数理论方面的刻画．     

Boundary conditions of Sturm-Liouville operators with mixed spectra

We study bounds on averages of spectral functions corresponding to Sturm-Liouville operators on the half line for different boundary conditions. As a consequence constraints are obtained which imply existence of singular spectrum embedded in a.c. spectrum for sets of boundary conditions with positive measure and potentials vanishing in an interval [0,N]. These constraints are related to estimates on the measure of sets where the spectral density is positive.     

Difference schemes on uniform grids performed by general discrete operators

Our aim is to set the foundations of a discrete vectorial calculus on uniform n-dimensional grids, that can be easily reformulated on general irregular grids. As a key tool we first introduce the notion of tangent space to any grid node. Then we define the concepts of vector field, field of matrices and inner products on the space of grid functions and on the space of vector fields, mimicking the continuous setting. This allows us to obtain the discrete analogous of the basic first order differential operators, gradient and divergence, whose composition define the fundamental second order difference operator. As an application, we show that all difference schemes, with constant coefficients, for first and second order differential operators with constant coefficients can be seen as difference operators of the form for suitable choices of q, and  . In addition, we characterize special properties of the difference scheme, such as consistency, symmetry and positivity in terms of q, and  .     

基于Karhunen-Loève变换和小波谱特征矢量量化的三维谱像数据压缩

提出了基于Karhunen Lo埁ｖｅ变换的小波谱特征矢量量化三维谱像数据压缩方法耍幔颍瑁酰睿澹?Lo埁ｖｅ变换 /小波变换 /小波谱特征矢量量化方法应用了Karhunen Lo埁ｖｅ变换的消除谱相关性优良性能 ,应用二维小波变换消除空间相关性 ,在小波变换域内应用二维集分割嵌入块编码和一维谱特征矢量量化对三维谱像数据压缩 ,获得较高的压缩性能。实验结果表明 :Karhunen Lo埁ｖｅ变换 /小波变换 /小波谱特征矢量量化编码比Karhunen Lo埁ｖｅ变换 /小波变换 /改进对块零树编码和Karhunen Lo埁ｖｅ变换 /小波变换 /快速矢量量化编码方法在同样压缩比条件下 ,峰值信噪比提高 2dB和 1dB以上 ,而速度提高了 1.5和 8倍 ,整体压缩性能有较大的提高     

截面体与凸体的包含测度

本文建立了E^n中的凸体与其位似体的包含测度的相等关系，同时给出了凸体Minkowski和的包含测度的估计。最后证明了E^3中的关于原点对称的旋转椭球与其截面体相似的充要条件是K为以原点为心的球。     

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”