Beryllium coordination chemistry

The coordination chemistry of beryllium with particular emphasis on chelates under physiological or near physiological conditions is surveyed. Hard donors such as oxygen are emphasized; equilibrium data and formation constants are reported as an indication of the strength of the complex.     

应力对M-Z型InP/InGaAsP-EAM偏振

采用Agilent 81910A光子全参量测试仪,首次实验研究了InP/In1－xGaxAs1－yPy-MQW（Multiple-Quantum-Well,MQW）材料与衬底间因应力而产生的M-Z型光调制器的PDL影响以及由此引起的由差分群时延(Differential Group Delay,DGD)表征的偏振模色散(Polarization Mode Dispersion,PMD).研究结果表明,半导体MQW光调制器的PDL与DGD是一致的.因此在半导体光器件的制作过程中,应尽可能地减小衬底与波导芯层之间的因残存应力的存在造成对光器件的高速性能的不利影响.     

Synthesis and Reactions of Some New Pyrrolylfuro[2,3‐d]Pyrimidines and Pyrrolopyrazinofuropyrimidines

5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities.     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

推广x重新标度模型的重标度参数经验公式

给出了推广x重新标度模型的重标度参数经验公式,其中建立了重标度参数与原子核的平均结合能之间的联系,由该公式可以得出A≥12的所有核的重标度参数值,利用这些参数值可以计算有关核过程并做出预言.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

Three New Polyoxygenated Steroids from Two Species of the South China Sea Gorgonian Muricella flexuosa and Menella verrucosa Brundin

Three new polyoxygenated steroids, muricesteroid ( 1 ), and menellsteroids A ( 2 ) and B ( 3 ), were isolated from two species of the South China Sea gorgonian Muricella flexuosa and Menella verrucosa Brundin , respectively. The structures of these new compounds were elucidated on the basis of extensive spectroscopic analysis, chemical methods and comparison with known related compounds.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)