On the Seneta Sequences

In this paper, we prove some properties of the Seneta sequences and functions, and in particular we prove a representation theorem in the Karamata sense for the sequences from the Seneta class SOc.     

Some proximity and sensitivity results in quadratic integer programming

We show that for any optimal solution for a given separable quadratic integer programming problem there exist an optimal solution for its continuous relaxation such that wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution having greater objective function value and with . We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b₁. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998.     

Improved solid-phase peptide synthesis of ‘difficult peptides’ by altering the microenvironment of the developing sequence

Three types of resins, related to the spacer, environmental and microenvironmental models were prepared by grafting commercial AMP polymer with 2-[2-(2-aminoethylamino)-2-oxoethoxy]acetic acid. All resins were highly loaded and functionalized with Rink-amide linker. A comparative synthesis of the classic difficult sequence ACP (65-74) on the prepared resins by Fmoc/t-Bu chemistry is presented. The ‘microenviromental’ model resin afforded the crude peptide in the highest purity (98%).     

Stochastic on-line knapsack problems

Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log^3/2 n). An(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.Corresponding author.Partially supported by the Basic Research Action of the European Communities under Contract 3075 (Alcom).Partially supported by research project Models and Algorithms for Optimization of the Italian Ministry of University and Scientific and Technological Research (MURST 40%).     

On two--block--factor sequences and one--dependence

The distributions of two--block--factors arising from i.i.d. sequences are observed to coincide with the distributions of the superdiagonals of jointly exchangeable and dissociated arrays . An inequality for superdiagonal probabilities of the arrays is presented. It provides, together with the observation, a simple proof of the fact that a special one--dependent Markov sequence of Aaronson, Gilat and Keane (1992) is not a two--block factor.

     

Direct Identification of the Carbon Skeleton of Organic Compounds using Double Quantum Coherence 13C-NMR Spectroscopy. The INADEQUATE Pulse Sequence

NMR spectroscopy plays an important part in the determination of the structures of organic compounds. The parameters of importance here are the chemical shifts of the ¹H and ¹³C nuclei and the spin-spin interactions both between ¹H nuclei and between ¹H and ¹³C nuclei. Couplings between ¹³C nuclei were almost completely neglected until a few years ago, since they were extremely difficult to observe because of the low natural abundance of ¹³C. However, it is these couplings which afford information directly on the carbon-carbon connectivities in the molecule. It is now possible to use a special NMR pulse sequence to make these couplings more readily visible: the result of using this sequence is a ¹³C-NMR spectrum from which the carbon skeleton concerned can be directly read off. Two-dimensional spectra in particular are very easy to evaluate. The pulse sequence involved, which bears the somewhat puzzling name INADEQUATE, produces double-quantum coherences from which the NMR signals of the coupled carbon nuclei can be obtained. In this article the principle of double-quantum coherence is described and a number of examples for the application of the INADEQUATE pulse sequences to problems in synthetic organic chemistry, biosynthesis and natural products chemistry are presented; in addition, the possibility of applying the INADEQUATE method to other nuclei is considered.     

Rare numbers

Suppose thatX ₁,X ₂,... is a sequence of iid random variables taking values inZ ⁺. Consider the random sequenceA(X)(X ₁,X ₂,...). LetY _n be the number of integers which appear exactly once in the firstn terms ofA(X). We investigate the limit behavior ofn ^–(1–) Y _n for [0, 1].     

一种求解混合整数非线性规划问题的演化算法--搜索空间自动收缩法

提出一种求解混合整数非线性规划问题的新的演化算法 -搜索空间自动收缩法 (ACSSOS) .在这种算法中 ,演化算法既用来定位最优解区域 ,实现搜索空间自动向全局最优解收缩 ,又用来最终求得最优解 .由于在遗传算子中引用了舍入操作 ,它不仅可用来求解混合非线性整数规划问题 ,也可求解纯整型或纯实型变量非线性函数优化问题 .数值试验结果表明本文的算法在解的质量、稳定性和收敛速度等方面优于一般的演化算法 .     

基于提升方案的多光谱遥感图像有损压缩算法

在分析多光谱遥感图像谱间和空间数据特点的基础上,提出了一种DPCM线性预测与基于提升方案的整数小波变换相结合的多光谱遥感图像有损压缩算法。在谱间采用DPCM预测去除谱间相关性;在谱内采用整数小波变换去除空间相关性,根据不同子带对目标识别的重要程度,选择不同的量化阈值和量化步长进行量化,并分别对各个子带量化后的数据和重要图表采用固定比特平面编码和游程编码,实现高效的多光谱遥感图像压缩。实验结果表明,该算法在一定的压缩比下,重构图像具有较高的峰值信噪比,并且算法硬件实现简单,对内存的需求低。