2,7-二氯荧光素与蛋白质相互作用的分光光度法研究

首次采用分光光度法研究了模拟生理条件(pH 7.4 Tris-HCl缓冲溶液,离子强度I=0.1)下2,7-二氯荧光素与牛血清白蛋白(BSA)相互作用的情况.研究结果表明:两者相互作用形成稳定的复合物,最大吸收波长为509nm,与2,7-二氯荧光素的最大吸收波长502nm比较,红移了7nm;两者之间主要通过静电引力结合,但并不排除疏水作用力和氢键;两者之间的结合数为32.     

Soliton interaction under the influence of higher-order effects

In this paper, we present exact N-soliton solution by employing simple, straightforward Darboux transformation based on the Lax pair for Hirota equation, a higher-order nonlinear Schrödinger (HNLS) equation. As examples, one- and two-soliton solutions in explicit forms are given and their properties are also analyzed. A bound solution without interaction will be theoretically predicted if one can adjust frequency shift for each soliton appropriately. Further, we obtain the approximate eigenvalues by employing two-soliton solution and discuss analytically the interaction between neighboring solitons under the influence of the higher-order effects. It is shown that the combined effects of the higher-order effects can restrain the interaction between neighboring solitons to some extent. The results are proved by directly solving HNLS equation numerically.     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

Transport properties of acetone aqueous solutions: molecular dynamics simulation and NMR studies

Two quantities η_rel and are applied to study the nonideal acetone–water association mixture. An all-atom acetone model and a TIP5P water model have been adopted for molecular dynamics simulation. We study the transport properties of the system comparing the 's of strong hydrogen bond and weak contact based on transport properties, MD simulations together with NMR experimental data and find good agreement of concentration dependence, which exhibits the cooperation effect.     

螺旋线径向挤压变形对其慢波结构冷测特性的影响

 介绍了用MAFIA软件的准周期边界条件计算螺旋线行波管慢波结构的色散和耦合阻抗，以及用ANSYS软件对螺旋线径向挤压变形建模的方法，并对螺旋线受挤压径向变形对其冷测特性的影响进行了详细的分析。结果表明:螺旋线径向挤压变形会导致相速增大，而在通常的变形范围内耦合阻抗也会增加；当变形继续增大时耦合阻抗上升到最大值后开始下降。     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.