学习学习再学习 创新创新再创新——在2005年度科技工作总结暨表彰大会上的讲话

同志们，今天我们在这里隆重召开2005年度科技工作总结表彰大会，会议开得非常好。梁铁总工程师作的2005年度科技工作报告，总结了去年的科技工作，布置了今年的科技工作，这是对广大科技工作人员过去工作的肯定和今后工作的展望。我们还表彰了一批科技工作先进个人、先进集体和先进单位，并聘任了第三批技术专家和第四批学科带头人，这说明柳钢的科技工作是欣欣向荣的。     

Biological Effects of Flammulina Velutipes Richin RE on Chinese Kunming Mice

ＢｉｏｌｏｇｉｃａｌＥｆｆｅｃｔｓｏｆＦｌａｍｍｕｌｉｎａＶｅｌｕｔｉｐｅｓＲｉｃｈｉｎＲＥｏｎＣｈｉｎｅｓｅＫｕｎｍｉｎｇＭｉｃｅＬｉａｎｇＤｉｎｇｂａｎｇ（梁定邦）；ＣｕｉＤｅｆａｎｇ（崔德芳）；ＺｈａｎｇＪｉｎｔｏｎｇ（张金桐）（Ｄｅｐａｒｔｍ...     

Study on percutaneous rate of P-aminobenzoates using molecular orbital method

The use of a dome osteotomy in the treatment of infantile tibia vara is reportedly associated with insufficient intraoperative assessment of the correction achieved. This article discusses a method to overcome this problem and the long-term advantages of using a dome osteotomy in the treatment of this disease.     

供热外网采用直埋式保温管的讨论

从工程投资,施工及保温材料的技术性能的分析入手,认为采用硬脂聚氨酯泡沫塑料保温的直埋管道比地沟管更具有优越性。     

Performance analysis of long-lived transaction processing systemswith rollbacks and aborts

Increasing the parallelism in transaction processing and maintaining data consistency appear to be two conflicting goals in designing distributed database systems (DDBSs). This problem is especially difficult if the DDBS is serving long-lived transactions (LLTs). A special case of LLTs, called sagas, has been introduced that addresses this problem. A DDBS with sagas provides high parallelism to transactions by allowing sagas to release their locks as early as possible. However, it is also subject to an overhead, due to the efforts needed to restore data consistency in the case of failure. We conduct a series of simulation studies to compare the performance of LLT systems with and without saga implementation in a faulty environment. The studies show that saga systems outperform their nonsaga counterparts under most of conditions, including heavy failure cases. We thus propose an analytical queuing model to investigate the performance behavior of saga systems. The development of this analytical model assists us to quantitatively study the performance penalty of a saga implementation due to the failure recovery overhead. Furthermore, the analytical solution can be used by system administrators to fine-tune the performance of a saga system. This analytical model captures the primary aspects of a saga system, namely data locking, resource contention and failure recovery. Due to the complicated nature of the analytical modeling, we solve the model approximately for various performance metrics using decomposition methods, and validate the accuracy of the analytical results via simulations     

Adrenergic regulation of aqueous outflow

Epinephrine increased outflow facility and cyclic AMP in the in vitro perfused human anterior segment with a maximal facility increase of 44% occurring at approximately 2 x 10(-5) M. Cyclic AMP measured in the perfusate from anterior segments increased by 12-14 fold after administration of 10(-5) M epinephrine. Both the facility increase and cyclic AMP rise were blocked by the beta-2 selective antagonist, ICI118,551. While there was a correlation between the facility increase and elevation in cyclic AMP levels, the rise in cyclic AMP preceded the facility increase by about 1 hour, suggesting that the ultimate effect of epinephrine involved a rather slow event such as synthesis and release of prostaglandins or protein synthesis. Subsequent perfusion studies showed that very large concentrations of indomethacin were necessary to block the outflow facility effect of epinephrine, suggesting that prostaglandin synthesis did not underlie the facility effect in this system. However, 5 x 10(-5) M cyclohexamide blocked the effect on outflow facility of both epinephrine and forskolin, but did not block the rise in cyclic AMP. These studies suggest that protein synthesis may play a role in the epinephrine-induced facility increase at some point beyond the second messenger level.     

基于游程编码思想的条码定位与识别方法

在复杂背景中的定位条码是图像式条码识别系统中的一个关键步骤,如何在复杂的背景中快速、白动地检测出条形码是该文的主要研究内容。首先介绍了条型码的编码结构,然后提出了一种基于游程编码思想的条码定位与识别方法,最后通过给出相关实验结果,验证了该算法的可行性和实用性。     

基于MSP430的低功耗近距无线图像传输系统设计与实现

近距无线图像传输系统主要用于无线传感器网络中的图像采集、传输、处理和显示,本文设计并实现了一种具有较强实用性的近距无线图像传输系统。采用OV7670图像传感器作为图像数据采集器,高速低功耗的nRF24L01射频模块作为无线收发器,采用MSP430F14916位超低功耗单片机作为微处理器,所构成的系统具有功耗低、图像传输速度快等优点。作者详细阐述了该系统的硬件结构和软件设计。     

A new parallel particle filter face tracking method based on heterogeneous system

This paper proposed a multi-cue-based face-tracking algorithm with the supporting framework using parallel multi-core and one Graphic Processing Unit (GPU). Due to illumination and partial-occlusion problems, face tracking usually cannot stably work based on a single cue. Focusing on the above-mentioned problems, we first combined three different visual cues??color histogram, edge orientation histogram, and wavelet feature??under the framework of particle filters to considerably improve tracking performance. Furthermore, an online updating strategy made the algorithm adaptive to illumination changes and slight face rotations. Subsequently, attempting two parallel approaches resulted in real-time responses. However, the computational efficiency decreased considerably with the increase of particles and visual cues. In order to handle the large amount of computation costs resulting from the introduced multi-cue strategy, we explored two parallel computing techniques to speed up the tracking process, especially the most computation-intensive observational steps. One is a multi-core-based parallel algorithm with a MapReduce thread model, and the other is a GPU-based speedup approach. The GPU-based technique uses features-matching and particle weight computations, which have been put into the GPU kernel. The results demonstrate that the proposed face-tracking algorithm can work robustly with cluttered backgrounds and differing illuminations; the multi-core parallel scheme can increase the speed by 2?C6 times compared with that of the corresponding sequential algorithms. Furthermore, a GPU parallel scheme and co-processing scheme can achieve a greater increase in speed (8×?C12×) compared with the corresponding sequential algorithms.