抗坏血酸有机锗倍半氧化物的合成及抗癌活性研究

通过三氯锗仿与抗坏血酸分子的加成反应,合成了一种新型有机锗倍半氧化物,产物的结构通过元素分析、IR及UV光谱等方法进行了表征．生物活性实验表明合成物对小鼠S-180肿瘤生长具有显著的抑制作用．     

Investigation of the quantitative properties of the quadrupole orthogonal acceleration time-of-flight mass spectrometer with electrospray ionisation using 3,4-methylenedioxymethamphetamine

This paper describes the investigation of the potential of a quadrupole orthogonal acceleration time-of-flight mass spectrometer (Q-TOF) equipped with an atmospheric pressure ionisation interface for quantitative measurements of small molecules separated by reversed phase liquid chromatography. To this end, the detection limits and linear dynamic range in particular were studied in an LC/MS/MS experiment using 3,4-methylenedioxymethamphetamine standards and 3,4-methylenedioxyethylamphetamine for internal standardisation. In a second phase, the experiment was repeated with real biological extracts (whole blood, serum, and vitreous humour). A calibration for 3,4-methylenedioxymethamphetamine and its metabolite 3,4-methylenedioxyamphetamine was prepared in each of these matrices again using 3,4-methylenedioxyethylamphetamine as internal standard. The resulting quantitative data were compared with those obtained by liquid chromatography with fluorescence detection for the same extracts. The Q-TOF results revealed excellent sensitivity and a linear dynamic range of nearly four decades (2-10 000 pg on-column, r(2) = 0.9998, 1/x weighting). Furthermore, all the calibration curves prepared in biological material were superimposable, LC/MS/MS and LC-fluorescence, and the quantitative results for actual samples compared very favourably. It was concluded that the Q-TOF achieves a linear dynamic range for quantitative LC/MS/MS work exceeding that of fluorescence detection and at much better absolute sensitivity. Copyright 1999 John Wiley & Sons, Ltd.     

电感耦合等离子体原子发射光谱法测定钛酸钡纳米粉体中7种杂质元素

钛酸钡纳米粉体样品用盐酸溶解,在所得样品溶液中用电感耦合等离子体原子发射光谱法测定了以氧化物存在于样品中的7种杂质元素(包括镁、锶、钾、钠、铝、硅及铁),对测定的光谱条件进行了试验并优化达到上述各元素的测定上限为0.1%(质量分数).测得方法的检出限(3S/b)为(单位μg·L-1):2.0(铝),1.0(铁),20.0(钾),0.2(镁),4.0(钠),3.0(硅)及0.5(锶).应用此方法分析了两件实样,所得结果的相对标准偏差(n=6)小于等于2.0%,对其中4种杂质元素(镁、钾、钠和锶)同时用HG/T 3587-1999标准中的方法作分析校核,所得结果与此方法结果一致.     

Universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states

We construct a device that can unambiguously discriminate between two unknown quantum states. The unknown states are provided as inputs, or programs, for the program registers, and a third system, which is guaranteed to be prepared in one of the states stored in the program registers, is fed into the data register of the device. The device will then, with some probability of success, tell us whether the unknown state in the data register matches the state stored in the first or the second program register. We show that the optimal device, i.e., the one that maximizes the probability of success, is universal. It does not depend on the actual unknown states that we wish to discriminate.     

A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis

Adaptive regularized framework using cubics has emerged as an alternative to line-search and trust-region algorithms for smooth nonconvex optimization, with an optimal complexity among second-order methods. In this paper, we propose and analyze the use of an iteration dependent scaled norm in the adaptive regularized framework using cubics. Within such a scaled norm, the obtained method behaves as a line-search algorithm along the quasi-Newton direction with a special backtracking strategy. Under appropriate assumptions, the new algorithm enjoys the same convergence and complexity properties as adaptive regularized algorithm using cubics. The complexity for finding an approximate first-order stationary point can be improved to be optimal whenever a second-order version of the proposed algorithm is regarded. In a similar way, using the same scaled norm to define the trust-region neighborhood, we show that the trust-region algorithm behaves as a line-search algorithm. The good potential of the obtained algorithms is shown on a set of large-scale optimization problems.