Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C

Fast algorithms for enclosing the minimum norm least squares solution of the matrix equation AXB = C are proposed. To develop these algorithms, theories for obtaining error bounds of numerical solutions are established. The error bounds obtained by these algorithms are verified in the sense that all the possible rounding errors have been taken into account. Techniques for accelerating the enclosure and obtaining smaller error bounds are introduced. Numerical results show the properties of the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

稀疏阈值的超分辨率图像重建

为了解决基于字典学习的超分辨重构算法耗时过长的问题,提出了基于稀疏阈值模型的图像超分辨率重建方法。首先,将联合字典理论与图像块稀疏阈值方法相结合,训练得到高、低分辨率过完备图像字典对。接着,通过稀疏阈值OMP算法对图像特征块进行稀疏表示。然后,通过高分辨率字典重构出初始的超分辨图像。最后,通过改进迭代反投影算法对初始的超分辨图像进行全局优化,从而进一步提高图像重构质量。实验结果表明,超分辨图像重构平均峰值信噪比(PSNR)为30.1 d B,平均结构自相似度(SSIM)为0.937 9,平均计算时间为10.2 s。有效提高了超分辨重构的速度,改善了重构高分辨图像的质量。     

基于语义的软件服务故障自动诊断模型

模仿学习是机器人仿生机制研究的主要内容之一,即通过观察、理解、学习、模仿示教行为实现机器人的仿生特性。基于高斯过程分别表达采集离散示教信号所构成的示教轨迹和含有未知参数策略的模仿轨迹,构建模仿学习方法框架,将概率模型匹配引入到模仿学习中,以KL散度为代价函数比较两种轨迹的概率分布,运用梯度下降法寻求使KL散度最小的最优模仿控制策略,将策略应用于模仿机器人以完成与示教相同的模仿任务。以关节型机器人的机械臂摆动行为模仿为学习任务进行仿真,结果表明基于概率轨迹匹配的模仿学习方法能够实现机械臂摆动行为模仿,学习过程较传统方法简易且学习效果较好。     

Adaptive discretization for signal detection in statistical inverse problems

We discuss statistical tests in inverse problems when the original equation is replaced by a discretized one, i.e. a linear system of equations. Previous studies revealed that using the discretization level as regularizing procedure is possible, but its application is limited unless discretization is restricted to the singular value decomposition, see C. Marteau and P. Mathé, General regularization schemes for signal detection in inverse problems, 2013. General linear regularization may circumvent this, and we propose a regularization of the discretized equations. The discretization level may be chosen adaptively, which may save computational budget. This results in tests which are known to yield the optimal separation rate up to some constant in many cases.     

Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces

In recent years, Landweber iteration has been extended to solve linear inverse problems in Banach spaces by incorporating non-smooth convex penalty functionals to capture features of solutions. This method is known to be slowly convergent. However, because it is simple to implement, it still receives a lot of attention. By making use of the subspace optimization technique, we propose an accelerated version of Landweber iteration with non-smooth convex penalty which significantly speeds up the method. Numerical simulations are given to test the efficiency.     

Automatic kinetic model generation and selection based on concentration versus time curves

The goal of the paper is to automatize the construction and parameterization of kinetic reaction mechanisms that can describe a set of experimentally measured concentration versus time curves. Using the framework and theorems of formal reaction kinetics, first, we build a set of possible mechanisms with a given number of measured and unmeasured (real or fictitious) species and reaction steps that fulfill some chemically reasonable requirements. Then we fit all the corresponding mass-action kinetic models and offer the best one to the chemist to help explain the underlying chemical phenomenon or to use it for predictions. We demonstrate the use of the method via two simple examples: on an artificial, simulated set of data and on a small real-life data set. The method can also be used to do a kind of lumping to generate a model that can reproduce the simulation results of a detailed mechanism with less species and thereby can largely accelerate spatially inhomogeneous simulations.     

Estimation of coefficient of variation in a weighted inverse Gaussian model

The coefficient of variation is an important parameter in many physical, biological and medical sciences. In this paper we study the estimation of the square of the coefficient of variation in a weighted inverse Gaussian model which is a mixture of the inverse Gaussian and the length biased inverse Gaussian distribution. This represents a rich family of distributions for different values of the mixing parameter and can be used for modelling various life testing situations. The maximum likelihood as well as the Bayes estimates of the parameters are obtained. These estimates are used to derive the estimates of the square of the coefficient of variation of the model under study. Several important data sets are analysed to illustrate the results. © 1996 John Wiley & Sons, Ltd.     

一个二进小波变换像空间的再生核函数

1 引言 小波分析是结合泛函分析、应用数学、逼近论、调和分析、广义函数论等数学知识的结晶,具有深刻的理论意义和广泛的应用范围,被称为”数学显微镜”.基于其多分辨分析的特点以及在时、频两域都具有表征信号局部特征的功能,应用它可以解决许多Fourier变换不能解决的难题,为工程应用提供了一种新的、更有效的分析工具[1],由...     

逆极限空间上渐近伪轨跟踪性质

The connection between APOTP （asymptotic pseudo orbit tracing property） for a continuous map on a compact metric space and that for the shift map on the inverse limit space is investigated. As an application, it is showed that the shift map on Henderson pseudoarc has APOTP.