天线折叠机构运动时间的仿真分析

对某机动三坐标雷达天线折叠机构进行运动仿真分析,根据该雷达天线折叠机构特点,定义机构的连接及运动关系副,机构的原理图,运动输入函数,通过对不同设计参数求解,得出相应参数天线阵面角加速度、角速度的响应函数图,分析比较运动时间与角加速度、角速度的变化关系,找出最佳运动时间。     

人口迁移算法在蛋白质折叠模拟中的应用

PMA（population migration algorithrn）算法具有较强的全局搜索能力和稳定性．针对PMA算法的思想，首次提出将人口迁移算法应用于蛋白质的折叠模拟中，并使用该算法求解蛋白质折叠构形预测的二维AB模型，对计算结果进行了分析．     

A 9‐Bit 80‐MS/s CMOS Pipelined Folding A/D Converter with an Offset Canceling Technique

A 9‐bit 80‐MS/s CMOS pipelined folding analog‐to‐digital converter employing offset‐canceled preamplifiers and a subranging scheme is proposed to extend the resolution of a folding architecture. A fully differential dc‐decoupled structure achieves high linearity in circuit design. The measured differential nonlinearity and integral nonlinearity of the prototype are ×0.6 LSB and ×1.6 LSB, respectively.     

高层框架楼房单向折叠爆破拆除

以哈尔滨市一座17层框架-剪力墙结构楼房的成功爆破拆除为例,介绍在复杂环境下,由于高层框架楼房倒塌距离受限,运用单向折叠控制爆破技术,有效控制高大楼房倒塌范围和实现最佳解体破碎效果的方法和措施,同时介绍有效控制高层楼房爆破飞石、爆破振动和塌落振动的具体方法和措施。重点剖析了爆破切口部位、角度、起爆顺序、起爆延时时间等因素对高大楼房倒塌距离产生的影响,为复杂环境下对高大框架-剪力墙结构楼房实施单向折叠倒塌爆破提供参考。     

Slow Unfolding of Monomeric Proteins from Hyperthermophiles with Reversible Unfolding

Based on the differences in their optimal growth temperatures microorganisms can be classified into psychrophiles, mesophiles, thermophiles, and hyperthermophiles. Proteins from hyperthermophiles generally exhibit greater stability than those from other organisms. In this review, we collect data about the stability and folding of monomeric proteins from hyperthermophilies with reversible unfolding, from the equilibrium and kinetic aspects. The results indicate that slow unfolding is a general strategy by which proteins from hyperthermophiles adapt to higher temperatures. Hydrophobic interaction is one of the factors in the molecular mechanism of the slow unfolding of proteins from hyperthermophiles.     

无缝钢管内折缺陷的研究

钢管内折缺陷一直是影响无缝厂400轧制作业区生产的主要原因。为了探索内折缺陷成因，从连铸坯、轧卡样、内折缺陷成品试样等进行现场试验并进行性能、低倍组织分析，总结产生钢管内折缺陷的原因。     

Interval-graph-based PLA folding

In this paper we present algorithms to implement PLA folding based on the interval graph theory. A PLA will be represented by five sets of nets: product-term nets (PT nets), input and output nets (I and O nets), and input and output connection nets (IC and OC nets). Column folding becomes a problem of permuting the rows such that the I/O nets can be placed in as few columns as possible. Algorithms for both unconstrained and constrained foldings are given.