A study of the practical limitations of principal components analysis and the labelling of unresolved HPLC peaks

Summary The method of iterative target transformation factor analysis (ITTFA) used in conjunction with second derivative peak finding has shown to be a practical method for the peak deconvolution and reconstruction of HPLC chromatograms and spectra. The second derivative method of peak finding is acceptable for resolutions above 0.5 for peaks of similar heights. Above 0.5 resolution the labelling gives correct results where the spectra are substantially different and also when reasonably similar. Below this value the peak labelling was still accurate where the spectra were different. Solvent effects on the spectra of the compounds studied are small and do not hinder the peak labelling process. Thus small “local” libraries are feasible. Presented at the 17th International Symposium on Chromatography, September 25–30, 1988. Vienna, Austria.     

线性定常广义系统的D型迭代学习控制收敛性

给出了线性定常广义系统在D型学习律作用下的迭代控制收敛性结果,这一结果是全新的,其对时变系统也成立,而且,本文结果和方法大部分可以移植到线性定常广义离散时间系统.     

矩阵方程X+A^{*}X^{-q}A=Q(q\geq 1)的Hermitian正定解

本文研究矩阵方程X A~*X~(-q)A=Q(q≥1)的Hermitian正定解,给出了存在正定解的充分条件和必要条件,构造了求解的迭代方法.最后还用数值例子验证了迭代方法的可行性和有效性.     

The spectral method and numerical continuation algorithm for the von Kármán problem with postbuckling behaviour of solutions

In this paper a spectral method and a numerical continuation algorithm for solving eigenvalue problems for the rectangular von Kármán plate with different boundary conditions (simply supported, partially or totally clamped) and physical parameters are introduced. The solution of these problems has a postbuckling behaviour. The spectral method is based on a variational principle (Galerkin’s approach) with a choice of global basis functions which are combinations of trigonometric functions. Convergence results of this method are proved and the rate of convergence is estimated. The discretized nonlinear model is treated by Newton’s iterative scheme and numerical continuation. Branches of eigenfunctions found by the algorithm are traced. Numerical results of solving the problems for polygonal and ferroconcrete plates are presented. Communicated by A. Zhou.     

Analysis of a time-limited service priority queueing system with exponential timer and server vacations

We consider a multi-class priority queueing system with a non-preemptive time-limited service controlled by an exponential timer and multiple (or single) vacations. By reducing the service discipline to the Bernoulli schedule, we obtain an expression for the Laplace-Stieltjes transform (LST) of the waiting time distribution via an iteration procedure, and a recursive scheme to calculate the first two moments. It is noted that we have to select embedded Markov points based on the service beginning epochs instead of the service completion epochs adopted for most of M/G/1 queueing analyses. Through the queue-length analysis, we obtain a decomposition form for the LST of the waiting time in each queue having the exhaustive service.      

Geometrically non-linear transverse vibrations of C-S-S-S and C-S-C-S rectangular plates

This paper is concerned with a new improved formulation of the theoretical model previously developed by Benamar et al. based on Hamilton's principle and spectral analysis, for the geometrically non-linear vibrations of thin structures. The problem is reduced to a non-linear algebraic system, the solution of which leads to determination of the amplitude-dependent fundamental non-linear mode shapes, the frequency parameters, and the non-linear stress distributions. The cases of C-S-C-S and C-S-S-S rectangular plates are examined, and the results obtained are in a good qualitative and quantitative agreement with the previous available works, based on various methods. In order to obtain explicit analytical solutions for the first non-linear mode shapes of C-S-C-S RP² and C-S-S-S RP, which are expected to be very useful in engineering applications and in further analytical developments, the improved version of the semi-analytical model developed by El Kadiri et al. For beams and fully clamped rectangular plates, has been slightly modified, and adapted to the above cases, leading to explicit expressions for the higher basic function contributions, which are shown to be in a good agreement with the iterative solutions, for maximum non-dimensional vibration amplitude values up to 0.75 and 0.6 for the first non-linear mode shapes of C-S-C-S RP and C-S-S-S RP, respectively.     

Stereoselective total synthesis of alkaloid caulophyllumine B using iterative olefin cross-metathesis protocol

Herein we report the first total synthesis of alkaloid caulophyllumine B in 14 steps by an iterative olefin cross-metathesis strategy from l-glutamic acid.     

基于强度传输方程的相位检索

为了从直接测量的强度图像中计算出相位信息,研究了基于强度传输方程的相位检索技术.设计了一个实用的相位检索系统,包含经典傅里叶相位检索和基于整体变分的相位检索算法.通过测量聚焦平面和前后散焦平面光波场的空间强度,求解二阶微分方程得到相位.与迭代相位检索技术相比克服了其迭代不确定性、收敛速度慢等缺点.实验表明,利用强度传输...     

Wavelet-based edge correlation incorporated iterative reconstruction for undersampled MRI

Undersampling k-space is an effective way to decrease acquisition time for MRI. However, aliasing artifacts introduced by undersampling may blur the edges of magnetic resonance images, which often contain important information for clinical diagnosis. Moreover, k-space data is often contaminated by the noise signals of unknown intensity. To better preserve the edge features while suppressing the aliasing artifacts and noises, we present a new wavelet-based algorithm for undersampled MRI reconstruction. The algorithm solves the image reconstruction as a standard optimization problem including a ?₂ data fidelity term and ?₁ sparsity regularization term. Rather than manually setting the regularization parameter for the ?₁ term, which is directly related to the threshold, an automatic estimated threshold adaptive to noise intensity is introduced in our proposed algorithm. In addition, a prior matrix based on edge correlation in wavelet domain is incorporated into the regularization term. Compared with nonlinear conjugate gradient descent algorithm, iterative shrinkage/thresholding algorithm, fast iterative soft-thresholding algorithm and the iterative thresholding algorithm using exponentially decreasing threshold, the proposed algorithm yields reconstructions with better edge recovery and noise suppression.