我国放射性物质运输概况

本文介绍了我国放射性物质运输概况(除台湾省外)。目前,全国放射性物质货包的年运输最约10万件,总放射性活度为1.8PBq,运输的放射性同位素主要是~(131)I、~(32)P 和~(198)Au 等。承运人员的年剂量当量是相当低的,一般小于5mSv。由于十分重视放射性物质的安全运输,所以没有发生过严重事故。文中还讨论了放射性物质运输中的防护问题。     

烟气轮机特殊状态下的保护

从烟气轮机超速的极限开始 ,分别按照阀门的关闭时间为 1 .5s和 6s的两种典型状态 ,对烟机在联轴节断裂等特殊工况下的超速情况进行了分析。最后 ,对烟气轮机在特殊工况下的保护提出了建议。     

钻井液完井液质量监控体系

经多年实践，中原油田建立了钻井过程中的钻井液完井液质量监控体系。讨论了钻井过程中钻井液完井液质量监控体系的控制指标及对有关指标的要求，对油气层保护工作措施和效果进行了分析。钻井过程中应进一步加强钻井液完井液质量监控措施，形成更加规范的监督、监测一体化队伍。     

开关磁阻电机调速系统在煤矿井下的应用

随着开关磁阻电机的调速控制系统日臻完善，因其优越性能使得在各行业得到迅速推广，但在煤矿井下的特定环境中使用该调速系统仍存在着诸多问题有待分析研究。     

循环风与瓦斯浓度的关系

通过循环风时对瓦斯污染数学模型的建立 ,详细阐述了在各种情况下 ,瓦斯浓度的变化情况及治理措施。     

单片机破解的常用方法及应对策略

介绍了单片机内部密码破解的常用方法，重点说明了侵入型攻击／物理攻击方法的详细步骤，最后，从应用角度出发，提出了对付破解的几点建议。     

凸轮机构基圆半径的确定方法及其分析

基圆半径的确定方法，除了用图解法和试算法外，还可用解析法和图解分析法求解。４种方法各有优缺点，设计时要根据具体情况选择。     

可压缩体的滑移线场理论

从理论上建立了可压缩体的滑移线场理论，并给出了解析实例。研究表明：在平面应变条件下，可压缩体内的两族滑移线不仅不正交，而且随着平均正应力的不同而变化；可压缩体的平面应变问题可以直接采用现有的致密体的滑移线场来求出。     

Directional features in online handwriting recognition

The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linear data. Both for directional and linear data a theory for a statistical modeling exists. However, none of these theories gives an integrated solution to problems, where linear and directional variables are to be combined in a single, multivariate probability density function. We describe a general approach for a unified statistical modeling, given the constraint that variances of the circular variables are small. The method is practically evaluated in the context of our online handwriting recognition system frog on hand and the so-called tangent slope angle feature. Recognition results are compared with two alternative modeling approaches. The proposed solution gives significant improvements in recognition accuracy, computational speed and memory requirements.     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.