Approximate solutions of the Liouville equation. III. Variational principles and projection operators

Aspects of stationary variational principles for the Laplace-transformed Liouville equation are discussed. Projection techniques are used to derive new stationary principles applicable to the space orthogonal to the space spanned by functions occurring in the conservation laws. As a result, any trial function automatically leads to results satisfying the conservation laws. The procedure is also applied to the parity-even and parity-odd distributions which obey equations governed by the square of the Liouville operator. The technique is extended to eliminate the one-body additive contribution to the solution exactly. Finally, the ideas of the moment method, which leads to the continued-fraction representation of autocorrelation functions, are applied to variational principles. We find continued-fraction variational principles such that a zero trial function yields the usual representation. However, a trial function representing noninteracting particles contains the results of the moment method and in addition yields the exact analytic behavior for free particles.Work supported by a grant from the National Science Foundation.     

投影体与U(P)的极值性质

为了研究著名的Schneider投影问题,E.Lutwak,D.Yang和张高勇最近引进了一个关于对称多胞形的新的仿射不变量U(P),并提出了关于U(P)下界的猜想.本文就二维、三维在一特定条件下的情形给予了此猜想的肯定回答并给出了严格的数学证明.     

应用CS理论实现同步采样压缩成像

为了减轻图像数据存储负担,实现图像在网络上的快速传输和实时处理,对一种新的压缩传感(CS)理论进行了研究。介绍了压缩传感理论的主要思想和基于压缩传感理论的光学成像系统,给出了一种新型图像重建算法—和谐正交匹配追踪算法,并进行了相应的模拟实验。实验结果显示,该成像机制可同步完成图像的采样与数据压缩,同时可获得良好的图像重建效果。由于该方法所要传输的信号数据量较小,所以十分有利于远距离的图像传输。     

Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra

The multiexponential analysis problem of fitting kinetic models to time-resolved spectra is often solved using gradient-based algorithms that treat the spectral parameters as conditionally linear. We make a comparison of the two most-applied such algorithms, alternating least squares and variable projection. A numerical study examines computational efficiency and linear approximation standard error estimates. A new derivation of the Fisher information matrix under the full Golub-Pereyra gradient allows a numerical comparison of parameter precision under variable projection variants. Under the criteria of efficiency, quality of standard error estimates and parameter precision, we conclude that the Kaufman variable projection technique performs well, while techniques based on alternating least squares have significant disadvantages for application in the problem domain.     

On stable least squares solution to the system of linear inequalities

The system of inequalities is transformed to the least squares problem on the positive ortant. This problem is solved using orthogonal transformations which are memorized as products. Author’s previous paper presented a method where at each step all the coefficients of the system were transformed. This paper describes a method applicable also to large matrices. Like in revised simplex method, in this method an auxiliary matrix is used for the computations. The algorithm is suitable for unstable and degenerate problems primarily.      

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift some of the constraints to improve the lower bounds. We generalize and strengthen subtour elimination and generalized large multistar inequalities.     

用于光谱解混的正交向量投影算法

光谱解混是高光谱技术中的关键部分,对地物成分的定量分析至关重要。线性光谱解混方法在计算端元丰度时,大多需要涉及矩阵求逆或方阵行列式的计算,导致软件实现的计算复杂度高,且硬件实现困难。同时,当端元数量增加时,算法的计算量也会随之呈指数级快速增长。论文基于传统的正交子空间投影方法,利用正交原理,提出了一种新的光谱解混方法——正交向量投影。该方法首先利用Gram-Schmidt过程计算每个端元的最终正交向量分量,并将其作为代表端元的投影向量。然后对于任意的待解混光谱向量,直接将其投影到该正交向量上。最后,计算得到投影分量的长度与正交向量的长度比,即为该正交向量所代表端元的无约束丰度。该过程避免了正交子空间投影和最小方差方法中计算复杂、实现困难的矩阵求逆运算,更便于并行计算的设计和硬件实现。通过理论的推导分析,证明了该算法与正交子空间投影和最小方差方法是完全一致的。另外,由于算法避免了矩阵相乘和求逆运算,简化了解混过程,通过对不同算法复杂度的具体分析,也证明该算法相对其他算法可以对端元数量降低一个量级。最后,在模拟数据和实际图像上分别进行实验测试,结果的分析和比较,也说明了算法的有效性。     

基于组合权重的系统评价模型

提出了基于组合权重的系统评价新模型 ( CWSE) ,即 :直接根据评价指标样本数据集 ,用基于加速遗传算法的投影寻踪方法确定各评价指标的分类权重 ,用基于加速遗传算法的层次分析法确定各评价指标的排序权重 ,用加速遗传算法对各评价指标的分类权重和排序权重进行综合得到组合权重 ,然后以这些组合权重与各评价对象相应评价指标的标准化值进行加权平均 ,得到系统评价的综合指标值 ,据此可对各评价对象进行分类排序 .用 CW SE模型评价中国 30个区域 1995年开发度的结果表明 ,根据开发度的强弱可把这些区域分成 3个强开发区域、6个较强开发区域、10个中等开发区域和 11个弱开发区域 ;CWSE模型简便、通用 ,计算结果较为客观和稳定 ,为系统工程理论和实践提供了新的研究方法 .     

一种快速稀疏分解图像去噪新方法*

提出了一种基于分层树型结构正交匹配追踪算法的快速图像去噪方法.通过选择高斯函数和墨西哥草帽小波母函数构建混合冗余字典,采用分层树状结构表示字典,结合构正交匹配追踪算法,实现图像稀疏表示,提高了图像表示的稀疏性,降低了算法的复杂度.依据噪音能量阈值,通过多次迭代达到图像去噪的目的.实验结果表明,在相同的噪音水平下,该迭代去噪算法取得了较高的较好的PSNR,获得更好的视觉效果.     

投影寻踪回归在试验设计分析中的应用研究

本文对三个应用实例进行分析，研究结果表明：ＰＰＲ方法是试验设计回归分析行之有效的方法，它给技术工作者提供了一个处理试验数据的崭新统计方法。ＰＰＲ的应用，将会大幅度降低试验费用，提高试验研究工作效率。