Optimization of alkali-alkalkine earth cation separation on weak cation-exchangers

Summary The elution behavior of alkali and earth alkaline cations has been studied on a newly synthesized weak cationexchanger (WCX). Applying this stationary phase isocratic separation of these cations is possible. The dependence of retention on competing ion concentration is described via a simple model. The influence of crown ethers as well as organic eluent additives on selectivity and peak efficiency is demonstrated. With optimized separation such cations can be determined with detection limits of about 0.5 ppm using a conductivity detector without ion suppression.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

On affine scaling algorithms for nonconvex quadratic programming

We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa.     

A path following algorithm for a class of convex programming problems

We present a primal-dual path following interior algorithm for a class of linearly constrained convex programming problems with non-negative decision variables. We introduce the definition of a Scaled Lipschitz Condition and show that if the objective function satisfies the Scaled Lipschitz Condition then, at each iteration, our algorithm reduces the duality gap by at least a factor of (1–/n), where is positive and depends on the curvature of the objective function, by means of solving a system of linear equations which requires no more than O(n³) arithmetic operations. The class of functions having the Scaled Lipschitz Condition includes linear, convex quadratic and entropy functions.     

一种基于门限的光突发交换受限偏射路由算法

提出了一种基于突发丢失门限的条件偏射路由算法（LDFD），该算法采用丢弃少量偏射的高优先级突发来保证偏射路由上较低优先级非偏射突发的服务质量（QoS）。当偏射的高优先级突发到达核心节点而该节点没有空闲数据信道时，就启用定义的偏射条件检测函数来判断是丢弃该突发还是允许其抢占非偏射的低优先级突发的资源，从而减少偏射突发与偏射路由上原有突发的竞争。仿真表明，该算法可以很好地控制偏射突发对偏射路由上正常流量的影响，并有效地提高整个网络的突发丢失性能。     

增益增强型CMOS运算放大器的自动优化算法

在增益增强型运算放大器优化中采用了自动设计方法,此方法在电路性能方程式和自适应遗传优化算法基础上对电路性能指标进行优化。该放大器在0.18μm CM O S工艺条件下中开环增益为92.1 dB,单位增益带宽积为1.78 GH z,相位裕度为55.1°和0.2%建立时间为1.27 ns,同时说明此优化设计方法的有效性。     

基于极坐标中蛇模型的类圆目标轮廓提取技术研究

提出了转化到极坐标中的蛇模型.通过把蛇模型转化到极坐标中,使轮廓的候选点得以更有序的排列.由于采用了动态规划法并在整个能量空间中搜索能量泛函的极值,算法对能量泛函的局部极值有较强的鲁棒性.所提出的模型不需要确定初始轮廓,可以用非迭代方法直接求解.与传统的动态规划法和贪婪算法进行了比较实验.结果表明,所提出的算法对极坐标中极点的位置不是很敏感.     

GF(2p)LDPC编码的相位调制OFDM系统在瑞利衰落信道的性能

OFDM是一项能有效对抗高速无线通信中多径衰落的关键技术，为了进一步提高OFDM系统的误码性能，许多信道编码技术已被应用于OFDM系统中，二元域LDPC码以其近香农限的误码性能和较低的译码复杂度成为研究的热点。在AWGN信道下，多元域LDPC码比等效码长的二元域LDPC码有更好的纠错性能。本文提出了一种将多元域LDPC码经过MPSK调制后用于OFDM系统的新方法。仿真结果表明，在多径衰落信道下，通过合理选择多元LDPC码域的阶数和调制的方法，多元域LDPC编码的高阶调制OFDM系统比等效码长的二元域LDPC编码OFDM系统具有更好的性能，并且由于采用了多元域LDPC的快速BP译码，译码复杂度只是稍有增加。     

基于小波变换的在役管线漏磁信号的去噪

采用漏磁法对在役管线进行无损检测时,所采集的信号中含有大量的噪声需要去除。文中介绍了小波变换的基本理论及检测信号和噪声信号在小波变换下的特性,说明了去除漏磁信号噪声的原理。在仿真试验中采用二阶双正交样条小波为小波函数,选用软硬阈值折中法和自适应阈值处理小波系数,结果表明将小波变换应用于在役管线漏磁检测中,能很好地去除噪声,提取出有用信号。     

带残损原材料的二维优化下料问题的研究

本文将遗传算法和模拟退火算法相结合来求解二雏优化下料问题，下料件为不规则形状，原材料上带有残损，问题具有一般性。并在Windows2000平台下，用Matlab实现上述算法。通过实例验证了该算法的有效性。