Logarithmic Regge pole

This work presents the subtraction procedure and the Regge cut in the logarithmic Regge pole approach. The subtraction mechanism leads to the same asymptotic behavior as previously obtained in the non-subtraction case. The Regge cut, in contrast, introduces a clear role to the non-leading contributions for the asymptotic behavior of the total cross-section. From these results, some simple parameterization is introduced to fit the experimental data for the proton-proton and antiproton-proton total cross-section above some minimum value up to the cosmic-ray. The fit parameters obtained are used to present predictions for the \begin{document}$ \rho(s)$\end{document} -parameter as well as to the elastic slope \begin{document}$ B(s)$\end{document} at high energies.     

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.     

乒乓球运动中的力学分析

利用力学原理分析了乒乓球的运动方程与击球时作用力、球的速度和位置之间的关系．确定出任意条件下的球的落点．并给出了一些计算结果．     

狄拉克（Dirac）与当代物理学

从量子力学、真空、大数假说、磁单极子诸方面，阐述了坎拉克的治学思想和研究方法的特点及其对当代物理学所做出的重大贡献．     

倾斜导轨上二级倒立摆的控制

本文在已有的倾斜导轨上二级倒立摆数学模型的基础上,采用极点配置方法和线性二次型最优控制器对导轨倾斜45o时的二级倒立摆进行了控制,并用MATLAB进行了控制结果仿真,仿真结果表明,控制效果较好。     

基于改进等分节点法的启发式布局算法

针对集成电路标准单元模式的布局问题，提出了一个全新的基于改进等分节点法的启发式标准单元布局算法(TETP)，该算法在优化布局过程中采用改进的等分节点法寻找单元目标位置，同时结合局部寻优的启发式算法，对MCNC(Microelectronics Centre of North-Carolina)标准单元测试电路进行实验。结果表明，与布局工具Timber Wolf7．0和FengShui相比，电路布局的总线长度分别平均减少了16％和17％。     

广义线性系统的输出反馈和极点配置

研究了广义线性系统的输出反馈和极点配置问题。引入“正常化”概念,从而推导出类似于正常线性系统有关输出反馈和极点配置问题的一些重要结论。     

The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation

This paper presents the exact asymptotics of the steady state behavior of a broad class of single-node queueing systems. First we show that the asymptotic probability functions derived using large deviations theory are consistent (in a certain sense) with the result using dominant pole approximations. Then we present an exact asymptotic formula for the cumulative probability function of the queue occupancy and relate it to the cell loss ratio, an important performance measure for service systems such as ATM networks. The analysis relies on a new generalization of the Taylor coefficients of a complex function which we call characteristic coefficients. Finally we apply our framework to obtain new results for the M/D/1 system and for a more intricate multiclass M/D/n system.     

Preprocessing of rotamers for protein design calculations

We have developed a process that significantly reduces the number of rotamers in computational protein design calculations. This process, which we call Vegas, results in dramatic computational performance increases when used with algorithms based on the dead-end elimination (DEE) theorem. Vegas estimates the energy of each rotamer at each position by fixing each rotamer in turn and utilizing various search algorithms to optimize the remaining positions. Algorithms used for this context specific optimization can include Monte Carlo, self-consistent mean field, and the evaluation of an expression that generates a lower bound energy for the fixed rotamer. Rotamers with energies above a user-defined cutoff value are eliminated. We found that using Vegas to preprocess rotamers significantly reduced the calculation time of subsequent DEE-based algorithms while retaining the global minimum energy conformation. For a full boundary design of a 51 amino acid fragment of engrailed homeodomain, the total calculation time was reduced by 12-fold.     

Exact rotamer optimization for protein design

Computational methods play a central role in the rational design of novel proteins. The present work describes a new hybrid exact rotamer optimization (HERO) method that builds on previous dead-end elimination algorithms to yield dramatic performance enhancements. Measured on experimentally validated physical models, these improvements make it possible to perform previously intractable designs of entire protein core, surface, or boundary regions. Computational demonstrations include a full core design of the variable domains of the light and heavy chains of catalytic antibody 48G7 FAB with 74 residues and 10(128) conformations, a full core/boundary design of the beta1 domain of protein G with 25 residues and 10(53) conformations, and a full surface design of the beta1 domain of protein G with 27 residues and 10(60) conformations. In addition, a full sequence design of the beta1 domain of protein G is used to demonstrate the strong dependence of algorithm performance on the exact form of the potential function and the fidelity of the rotamer library. These results emphasize that search algorithm performance for protein design can only be meaningfully evaluated on physical models that have been subjected to experimental scrutiny. The new algorithm greatly facilitates ongoing efforts to engineer increasingly complex protein features.