Projections on Convex Sets in the Relaxed Limit

The paper establishes the continuity of the best approximation, or the projection, of a function in L _p for p[1,), on a closed convex set in the space, when the set varies and converges to a limit set in the Young-measure relaxation of the space. To this end a strong-type convergence and a convexity structure are identified on the space of Young measures. The appropriate convergence of sets with respect to which the continuity holds is the Mosco convergence of sets associated with the strong-type convergence of functions.     

Determining Liquid Structure from the Tail of the Direct Correlation Function

In important early work, Stell showed that one can determine the pair correlation function h(r) of the hard-sphere fluid for all distances r by specifying only the tail of the direct correlation function c(r) at separations greater than the hard-core diameter. We extend this idea in a very natural way to potentials with a soft repulsive core of finite extent and a weaker and longer ranged tail. We introduce a new continuous function T(r) which reduces exactly to the tail of c(r) outside the (soft) core region and show that both h(r) and c(r) depend only on the out projection of T(r): i.e., the product of the Boltzmann factor of the repulsive core potential times T(r). Standard integral equation closures can thus be reinterpreted and assessed in terms of their predictions for the tail of c(r) and simple approximations for its form suggest new closures. A new and very efficient variational method is proposed for solving the Ornstein–Zernike equation given an approximation for the tail of c. Initial applications of these ideas to the Lennard-Jones and the hard-core Yukawa fluid are discussed.     

Application of Fourier transform infrared spectroscopy and orthogonal projections to latent structures/partial least squares regression for estimation of procyanidins average degree of polymerisation

Fourier transform infrared (FTIR) spectroscopy has being emphasised as a widespread technique in the quick assess of food components. In this work, procyanidins were extracted with methanol and acetone/water from the seeds of white and red grape varieties. A fractionation by graded methanol/chloroform precipitations allowed to obtain 26 samples that were characterised using thiolysis as pre-treatment followed by HPLC-UV and MS detection. The average degree of polymerisation (DPn) of the procyanidins in the samples ranged from 2 to 11 flavan-3-ol residues. FTIR spectroscopy within the wavenumbers region of 1800-700 cm⁻¹ allowed to build a partial least squares (PLS1) regression model with 8 latent variables (LVs) for the estimation of the DPn, giving a RMSECV of 11.7%, with a R² of 0.91 and a RMSEP of 2.58. The application of orthogonal projection to latent structures (O-PLS1) clarifies the interpretation of the regression model vectors. Moreover, the O-PLS procedure has removed 88% of non-correlated variations with the DPn, allowing to relate the increase of the absorbance peaks at 1203 and 1099 cm⁻¹ with the increase of the DPn due to the higher proportion of substitutions in the aromatic ring of the polymerised procyanidin molecules.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

The Theorem of Mather on Generic Projections for Singular Varieties

The theorem of Mather on generic projections of smooth algebraic varieties is also proved for the singular ones.     

Existence and uniqueness of positive periodic solutions for a neutral Logarithmic population model

In this paper, by using an abstract continuous theorem of k-set contractive operator, the criteria is established for the existence, global attractivity of positive periodic solution of a neutral delay Logarithmic population model with multiple delays. The result improve the known ones in [S.P. Lu, W.G. Ge, Existence of positive periodic solutions for neutral Logarithmic population model with multiple delays, J. Comput. Appl. Math. 166 (2) (2004) 371-383].     

基于抽取和连续投影算法的可见近红外光谱变量筛选

大多数短波CCD硅检测器为2 048或3 648像元,相邻波长间隔小,预处理算法对其适用性差.本文在600.09～980.47 nm光谱范围内,采用等间隔抽取方法重构光谱矩阵.经不同光谱预处理后,分别采用遗传算法(GA)和连续投影算法(SPA),筛选偏最小二乘法(PLS)建模变量.采用留一法交叉验证评价模型的预测能力,...     

Commuting projections on graphs

Motivated by the increasing importance of large‐scale networks typically modeled by graphs, this paper is concerned with the development of mathematical tools for solving problems associated with the popular graph Laplacian. We exploit its mixed formulation based on its natural factorization as product of two operators. The goal is to construct a coarse version of the mixed graph Laplacian operator with the purpose to construct two‐level, and by recursion, a multilevel hierarchy of graphs and associated operators. In many situations in practice, having a coarse (i.e., reduced dimension) model that maintains some inherent features of the original large‐scale graph and respective graph Laplacian offers potential to develop efficient algorithms to analyze the underlined network modeled by this large‐scale graph. One possible application of such a hierarchy is to develop multilevel methods that have the potential to be of optimal complexity. In this paper, we consider general (connected) graphs and function spaces defined on its edges and its vertices. These two spaces are related by a discrete gradient operator, ‘Grad’ and its adjoint, ‘ ? Div’, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then, a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ?₂‐projection Q_H onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π_H from the original edge‐space onto a properly constructed coarse edge‐space associated with the edges of the coarse graph. The projections π_H and Q_H commute with the discrete divergence operator, that is, we have Div π_H = Q_H div. The respective pair of coarse edge‐space and coarse vertex‐space offer the potential to construct two‐level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian, which utilizes the discrete divergence operator. The performance of one two‐level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples. Copyright © 2013 John Wiley & Sons, Ltd.     

具有非线性阻尼的记忆型抽象发展方程的时间依赖吸引子

运用时间依赖空间中的过程理论和收缩函数方法以及更多细节性估计,研究了具有非线性阻尼和衰退记忆的抽象发展方程的解在时间依赖空间中的渐近性态,证明了时间依赖吸引子在空间E_t^{\theta }中的存在性。