用于解决大规模波长路由光网中路由和波长分配问题的新启发式算法

本文提出了一种新的启发式算法,它将路由和波长分配问题分解为两个子问题分别进行优化求解,并以最小化波长需求作为目标函数。在不同通信负荷的情况下,我们以NSF网为例,分析了波长通道(WP)和虚波长通道(VWP)路由方案之间在波长需求方面的差别。同时还研究了网络波长重用度的问题。数值结果表明所提出的算法可有效地应用于大规模波长路由光网。     

ICLAS of weak transitions of water between 11 300 and 12 850 cm: Comparison with FTS databases

Very weak water vapor absorption lines have been investigated by intracavity laser absorption spectroscopy (ICLAS) in the 11 335-11 947 and 12 336-12 843 cm⁻¹ spectral regions dominated by the ν₁ + 3ν₂ + ν₃ and ν₂ + 3ν₃ bands, respectively. A detectivity on the order of α_min ∼ 10⁻⁹ cm⁻¹ was achieved with an ICLAS spectrometer based on a Ti: Sapphire laser. It allowed detecting transitions with an intensity down to 5 × 10⁻²⁸ cm/molecule which is about 10 times lower than the weakest line intensities previously detected in the considered region. A line list corresponding to 1281 transitions with intensity lower than 5 × 10⁻²⁶ cm/molecule has been generated. A detailed comparison with the line lists provided by the HITRAN database and by recent investigations by Fourier transform spectroscopy associated with very long multi pass cell is presented. The rovibrational assignment performed on the basis of the ab initio calculations of Schwenke and Partridge, has allowed for determining 176 new energy levels belonging to a total of 16 vibrational states.     

A Facile Method for the Separation of Methionine Sulfoxide Diastereomers,Structural Assignment,and DFT Analysis

Methionine (Met) oxidation is an important biological redox node, with hundreds if not thousands of protein targets. The process yields methionine oxide (MetO). It renders the sulfur chiral, producing two distinct, diastereomerically related products. Despite the biological significance of Met oxidation, a reliable protocol to separate the resultant MetO diastereomers is currently lacking. This hampers our ability to make peptides and proteins that contain stereochemically defined MetO to then study their structural and functional properties. We have developed a facile method that uses supercritical CO₂ chromatography and allows obtaining both diastereomers in purities exceeding 99 %. ¹H NMR spectra were correlated with X-ray structural information. The stereochemical interconversion barrier at sulfur was calculated as 45.2 kcal mol⁻¹, highlighting the remarkable stereochemical stability of MetO sulfur chirality. Our protocol should open the road to synthesis and study of a wide variety of stereochemically defined MetO-containing proteins and peptides.     

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive in practice. Encouraging computational results are presented for large-scale problems. The author thanks the Associate Editor and an anonymous referee for their helpful comments.     

广义线性系统基于PI观测器鲁棒极点配置分离原理

对广义线性系统提出了基于全维比例-积分观测器的控制系统设计的鲁棒极点配置分离原理.基于矩阵灵敏度理论证明了如下事实：与状态反馈系统相同的闭环系统极点具有和状态反馈系统极点相同的极点灵敏度,与观测器系统相同的闭环系统.极点具有和观测器系统极点相同的极点灵敏度.于是基于全维PI观测器的状态反馈控制器的具有最小灵敏度的鲁棒极点配置可以通过求解两个分开的鲁棒状态反馈极点配置问题实现.     

Exact arithmetic on the Stern–Brocot tree

In this paper we present the Stern–Brocot tree as a basis for performing exact arithmetic on rational numbers. There exists an elegant binary representation for positive rational numbers based on this tree [Graham et al., Concrete Mathematics, 1994]. We will study this representation by investigating various algorithms to perform exact rational arithmetic using an adaptation of the homographic and the quadratic algorithms that were first proposed by Gosper for computing with continued fractions. We will show generalisations of homographic and quadratic algorithms to multilinear forms in n variables. Finally, we show an application of the algorithms for evaluating polynomials.     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

Transportation problems which can be solved by the use of hirsch-paths for the dual problems

Balinski uses his signature method for the proof of the Hirsch-conjecture for dual transportation polyhedra to obtain an efficient algorithm for the assignment problem. We will show how to extend this method to other primal transportation problems, including transportation problems with unit demands. We then prove that Balinski's assignment algorithm is equivalent, cycle by cycle, to that of Hung and Rom. We demonstrate that, under some assumptions for our probability model, a modification of the latter algorithm has an average complexity of O(n ²logn) and present some computational results confirming this. We also present results that indicate that this modification compares favorably with Balinski's algorithm and other codes. Research of both authors supported, in part, by grants of the Alexander von Humboldt-Stiftung. Supported, in part, by NSF grant DMS-8504050.     

On the Minimal Nonnegative Solution of Nonsymmetric Algebraic Riccati Equation

We study perturbation bound and structured condition number about the minimal nonnegative solution of nonsymmetric algebraic Riccati equation, obtaining a sharp perturbation bound and an accurate condition number. By using the matrix sign function method we present a new method for finding the minimal nonnegative solution of this algebraic Riccati equation. Based on this new method, we show how to compute the desired M-matrix solution of the quadratic matrix equation X^2 - EX - F = 0 by connecting it with the nonsymmetric algebraic Riccati equation, where E is a diagonal matrix and F is an M-matrix.