小型弹箭惯性矩的测定

叙述了三线摆的结构原理 ,介绍了该摆小角与大角摆动周期的计算方法。利用三线摆的结构原理可以测量小型弹箭、子弹头、飞机模型及其他构件的惯性矩。当 R/ L <1 / 30 ,φ0 ≤ 60°时 ,该装置的测量精确度可优于 1 %。     

基于分形与图形学的自然条件下沙丘植被模拟

自然条件下的沙丘形状多变,自然条件恶劣的沙丘地带其赖以生存的植被常常呈现出不同状态。利用计算机图形学和分形几何技术模拟沙丘及植被的生长状况。通过函数迭代系统实现单棵树木及树林的形态模拟,对枝干进行加粗处理模拟树木在沙丘中的生长状况。采用追踪仿射变换点的方法对着色树木的树叶颜色进行划分,实现树木颜色季节性的变化。利用计算机图形学方法绘制花朵,采用随机函数对树木中的部分点用花朵替换,模拟繁花点点的林木。利用正弦曲线不同相位的组合绘制沙丘,与树木结合实现沙丘植被场景模拟,通过加入外力影响因子模拟自然条件下沙丘迎风坡上的自然形态。最后增加沙丘密度及扩大树木覆盖面积生成局部树林场景的模拟。     

凝固模拟热物性参数数据库系统的研究与开发

针对凝固模拟中热物性参数数据量大、种类多,数据查找困难、更新不便的问题,研究开发了一套热物性参数数据库系统.系统包括参数录入、数据更新、数据查询和液固相线温度计算模块,实现了对参数数据的集中有效管理.     

The relationship of specific optical rotation to structural composition for Acacia and related gums

This paper proposes that the specific optical rotation of a polysaccharide exudate gum is a linear function of the carbohydrate composition, and a classification system is developed based on this functional relationship. In empirical terms this means that exudate gums of a particular species and genus can be represented by a formula, called the Rotation Operator that is a sequence of numbers. Optimised rotation operators can be derived from chemical data by an algorithm based on the method of least squares and used to identify an unknown gum. Identification of individual gums as well as clustering by this method is demonstrated by application to 50 Acacia gum samples collected for an FAO Project.     

Algorithm design and implementation of finite wavelet grow tree

Based on grow tree composite model, Finite Field Wavelet Grow Tree (FW-GT) was proposed in this paper. FW-GT is a novel framework to be used in data encryption enhancing data security. It is implemented by replacement operator and wavelet operator. Forward integration and inverse decomposition of FW-GT are performed by replacement, inverse wavelets and its corresponding replacement, wavelet transforms. Replacement operator joined nonlinear factor, wavelet operator completed data transformation between lower dimensional space and higher dimensional space. FW-GT security relies on the difficulty of solving nonlinear equations over finite fields. By using FW-GT, high security of data could be obtained at the cost of low computational complexity. It proved FW-GT algorithm’s correctness in this paper. The experimental result and theory analysis shows the excellent performance of the algorithm.     

Graphical model construction based on evolutionary algorithms

Using Bayesian networks to model promising solutions from the current population of the evolutionary algorithms can ensure efficiency and intelligence search for the optimum. However, to construct a Bayesian network that fits a given dataset is a NP-hard problem, and it also needs consuming mass computational resources. This paper develops a methodology for constructing a graphical model based on Bayesian Dirichlet metric. Our approach is derived from a set of propositions and theorems by researching the local metric relationship of networks matching dataset. This paper presents the algorithm to construct a tree model from a set of potential solutions using above approach. This method is important not only for evolutionary algorithms based on graphical models, but also for machine learning and data mining. The experimental results show that the exact theoretical results and the approximations match very well.     

1515—75型织机飞梭伤人事故的FT分析

事故树分析(英文缩写FTA)是安全系统工程的一个重要工具,用FTA方法对1515—75型织机飞梭伤人事故作了定性和定量分析,并根据分析结果提出了减少飞梭伤人事故的有效措施,以确保纺织工人的人身安全。     

Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems

We develop a quasi-polynomial time approximation scheme for the Euclidean version of the Degree-Restricted MST Problem by adapting techniques used previously by Arora for approximating TSP. Given n points in the plane, d = 3 or 4, and > 0, the scheme finds an approximation with cost within 1 + of the lowest cost spanning tree with the property that all nodes have degree at most d. We also develop a polynomial time approximation scheme for the Euclidean version of the Red–Blue Separation Problem, again extending Aroras techniques. Given > 0, the scheme finds an approximation with cost within 1+ of the cost of the optimum separating polygon of the input nodes, in nearly linear time.