Spatially adaptive sparse grids for high-dimensional data-driven problems

Sparse grids allow one to employ grid-based discretization methods in data-driven problems. We present an extension of the classical sparse grid approach that allows us to tackle high-dimensional problems by spatially adaptive refinement, modified ansatz functions, and efficient regularization techniques. The competitiveness of this method is shown for typical benchmark problems with up to 166 dimensions for classification in data mining, pointing out properties of sparse grids in this context. To gain insight into the adaptive refinement and to examine the scope for further improvements, the approximation of non-smooth indicator functions with adaptive sparse grids has been studied as a model problem. As an example for an improved adaptive grid refinement, we present results for an edge-detection strategy.     

一类Durrmeyer算子线性组合的加权逼近

本文主要给出了一类Ｂｅｒｎｓｔｅｉｎ－Ｄｕｒｒｍｅｙｅｒ算子的线性组合在Ｌｐ逼近意义下加Ｊａｃｏｂｉ权逼近时的特征刻划．     

Bernstein算子线性组合同时逼近的点态估计

借助于光滑模ωψ^rλ（f,t）（0≤λ≤1）给出了Bernstein算子线性组合同时逼近的点态结果。     

The exact and approximate distributions of linear combinations of selected order statistics from a uniform distribution

Summary The exact probability density function is given for linear combinations ofk=k(n) order statistics selected from whole order statistics based on random sample of sizen drawn from a uniform distribution. Normal approximation to the linear combinations is made with the aid of Berry-Esseen's theorem. Necessary and sufficient conditions of the asymptotic normality for the statistic are obtained, too. An exact distribution and its normal approximation of linear combination of mutually independent gamma variables with integer valued parameters are also given as associated consequences. The Institute of Statistical Mathematics     

线性流形上矩阵方程B^TXB=D的加权最小二乘对称解和解的最佳逼近

本文利用矩阵的奇异值分解（SVD）,给出了在一流形上矩阵方程B^TXB=D的加权最小二乘对称解的通解表达式,并解决了加权最小二乘对称解的最佳逼近问题。     

投影算子组的联合谱

本文研究Hilbert空间H上投影算子组的联合谱.首先通过计算给出正则投影对的联合谱,进而给出一般的投影算子对的联合谱.本文还对两个投影算子的和与差的可逆性给出一些等价刻画.特别地,当P和Q为正则投影对时,本文通过计算算子组[I,P,Q]的联合谱来给出σ(P+Q)和σ(P-Q)的具体刻画.反过来,本文证明两类具有特定形...     

Interactive High-Dimensional Data Visualization

Abstract

We propose a rudimentary taxonomy of interactive data visualization based on a triad of data analytic tasks: finding Gestalt, posing queries, and making comparisons. These tasks are supported by three classes of interactive view manipulations: focusing, linking, and arranging views. This discussion extends earlier work on the principles of focusing and linking and sets them on a firmer base. Next, we give a high-level introduction to a particular system for multivariate data visualization—XGobi. This introduction is not comprehensive but emphasizes XGobi tools that are examples of focusing, linking, and arranging views; namely, high-dimensional projections, linked scatterplot brushing, and matrices of conditional plots. Finally, in a series of case studies in data visualization, we show the powers and limitations of particular focusing, linking, and arranging tools. The discussion is dominated by high-dimensional projections that form an extremely well-developed part of XGobi. Of particular interest are the illustration of asymptotic normality of high-dimensional projections (a theorem of Diaconis and Freedman), the use of high-dimensional cubes for visualizing factorial experiments, and a method for interactively generating matrices of conditional plots with high-dimensional projections. Although there is a unifying theme to this article, each section—in particular the case studies—can be read separately.     

The pullback closure operator and generalisations of perfectness

A categorical closure operator induced via pullback by a pointed endofunctor is introduced. Various notions of a perfect morphism relative to a pointed endofunctor and the induced closure are then considered. The main result explores how these notions are interrelated, linking also with earlier notions of perfectness.The author acknowledges financial support from the University of Cape Town, from the Foundation for Research Development through the Categorical Topology Research Group at the University of Cape Town, and from the University of L'Aquila.     

一类具对流项的奇异扩散方程解的逼近性质

讨论了一类带对流项的奇异扩散方.程的Neumann边值问题,证明了整体解的存在唯一性;讨论了带对流项非线性间题解的线性逼近,得到了逼近的显式表示式;同时还对││u-(u)││L2(0,1)进行了估计,得到了解关于时间t充分大时的渐近性态,其中(u)＝∫o/1udx.     

The Cross-Section Body, Plane Sections of Convex Bodies and Approximation of Convex Bodies, II

We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, those of sections of convex bodies and of sections of their circumscribed cylinders. For L ^d a convex body, we take n random segments in L and consider their 'Minkowski average' D. For fixed n, the pth moments of V(D) (1 p < ) are minimized, for V (L) fixed, by the ellipsoids. For k = 2 and fixed n, the pth moment of V(D) is maximized for example by triangles, and, for L centrally symmetric, for example by parallelograms. Last we discuss some examples for cross-section bodies.     

The equivalence relations between the best approximation and linear operators approximation in a Besov space

In this paper, we characterize Besov type space introduced by the best approximation, best approximating elements and a kind of linear operators. The project is supported by NSFC     

On the linear combination of normal and Laplace random variables

Summary  The exact distribution of the linear combination αX+βY is derived when X and Y are normal and Laplace random variables distributed independently of each other. A program in MAPLE is provided to compute the associated percentage points.     

A New Characterization of Weighted Peetre K-Functionals

The purpose of this paper is to present a characterization of certain types of generalized weighted Peetre K-functionals by means of a modulus of smoothness. This new modulus is based on the classical one taken on a certain linear transform of the function. A new modulus of smoothness which describes the best algebraic approximation is introduced.     

The construction and approximation of some neural networks operators

In this paper,the technique of approximate partition of unity is used to construct a class of neural networks operators with sigmoidal functions.Using the modulus of continuity of function as a metric,...     

Asymptotic property for some series of probability

Let {X, X n , n≥1} be a sequence of i.i.d.random variables with zero mean, and set Sn = Σ k=1 n X k , EX2=σ 2>0, λ(ε) =Σ n=1 ∞ P (|Sn|≥ nε). In this paper, we discuss the rate of the approximation of σ2 by ε2 λ(ε) under suitable conditions, and improve the corresponding results of Klesov (1994).