The algebraic Bethe ansatz for the Izergin–Korepin model with open boundary conditions

We present the procedure of exactly solving the Izergin–Korepin model with open boundary conditions by using the algebraic Bethe ansatz, which include constructing the multi-particle state and achieving the eigenvalue of the transfer matrix and corresponding Bethe equations. We give a proof about our conclusions on the multi-particle state based on an assumption. When the model is U_q(su(2)) quantum invariant, our results agree with that obtained by analytic Bethe ansatz method.     

Sensitivity-enhanced IPAP experiments for measuring one-bond C–C and C–H residual dipolar couplings in proteins

Sensitivity-enhanced 2D IPAP experiments using the accordion principle for measuring one-bond 13C'-13Calpha and 1Halpha-13Calpha dipolar couplings in proteins are presented. The resolution of the resulting spectra is identical to that of the decoupled HSQC spectra and the sensitivity of the corresponding 1D acquisitions are only slightly lower than those obtained with 3D HNCO and 3D HN(COCA)HA pulse sequences due to an additional delay 2Delta. For cases of limited resolution in the 2D 15N-1HN HSQC spectrum the current pulse sequences can easily be modified into 3D versions by introducing a poorly digitized third dimension, if so desired. The experiments described here are a valuable addition to the suites available for determination of residual dipolar couplings in biological systems.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

辐射加热金X光再发射时间测量

利用星光Ⅱ三倍频激光打双盘靶，研究了辐射加热材料的Ｘ光发射时间。激光脉冲能量４０～６０Ｊ、脉冲宽度６００～７００ｐｓ。通过两台时间关联的亚千Ｘ光能谱仪分别监测双盘靶初、次级发射Ｘ光谱，给出了辐射加热次级Ｘ光再发射时间。     

混沌的模糊神经网络逆系统控制

提出用Sugeno型的模糊推理神经网络建立混沌系统的逆系统模型,并采用逆系统方法进行混沌的控制.这种方法的特点是可以不必建立混沌系统的解析模型,通过模糊神经网络学习混沌系统的运动规律,通过学习获得的规律对混沌进行有效的控制,并且该控制方法可以控制混沌系统以一定精度跟踪连续变化的给定信号.理论分析及针对虫口模型和Henon模型仿真研究证明了该方法的有效性 关键词： 混沌 模糊神经网络 逆系统控制     

NASICON型化合物结构的NMR研究

在水热晶化合成一系列NASICON型化合物的基础上,应用固体高分辨³¹P和²⁹Si MAS NMR,研究了几种NASICON化合物的结构,观察其骨架原子P和Si在结构中的状态及分布,并解释了由于在结构中发生取代作用而引起,Si或P的化学位移的变化.     

N-[(2,2–propinyldiferrocenyl)methinyl]benzoyl hydrazone and its bivalent transition metal complexes

Transition Metal Chemistry -     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

一类Narcissistic反应过渡态的优化

我们对一类narcissistic 反应XCH_2-CH_2Y→[过渡态TS]→YCH_2—CH_2X (1)进行了研究,结果表明其过渡态能在对称性限制下由能量极小化方法较容易地给出. 采用IMSPAK分子轨道从头算程序,在IBM VM/370计算机系统上用STO—3G极小基组以平衡几何构型的能量梯度优化方法,在对称性限制下对反应(1)的几种反应体系的过渡态构型进行了优化,其结果列于表1.     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].