用MAXScript脚本语言生成分形图形

介绍了分形生成技术的原理与性质、MAXScript脚本语言的特点及功能，详细叙述了用MAXScript脚本语言生成分形图形的设计思想和实现方法。针对分形几何的特点，以具有严格自相似性的分形树为例，通过解释源代码、描述程序运行过程和结果，以及对生成的图片用3DSMAX进行再处理，分析了在3DSMAX环境中用MAXScript脚本语言生成分形图形这一新方法的优点和不足。     

Eigensolution of specially structured matrices with hyper‐symmetry

Recently, four canonical forms have been developed and applied to the dynamics and stability analysis of symmetric frames. In this paper, hyper‐symmetric matrices and specially structured matrices are defined and efficient methods are proposed for the eigensolution of such matrices. Applications are extended to hyper‐graphs and specially structured graphs. Simple methods are developed for calculating the eigenvalues of the Laplacian matrices of such graphs. The developments presented in this paper can also be considered as generalization of Form II and Form III symmetry, previously defined by the authors. Copyright © 2006 John Wiley & Sons, Ltd.     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.     

牙哈采油树腐蚀检查分析及对策

介绍塔里木牙哈凝析气田高温高压井口采油树腐蚀的现象，腐蚀机理及采取的措施，对其他油田采油树腐蚀的防治起到指导借鉴作用。     

A Standard Model-Theoretic Approach to Operational Semantics of Recursive Programs

In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic.     

基于语法的元程序设计系统的自动生成技术

本文提出一种基于语法的元程序设计系统的自动生成技术，并开发了一个元程序设计系统的自动生成系统Ａ－ＭＰＳ。元程序设计系统是一种以程序作为操作对象的有效的程序设计工具，并具有广泛的应用。     

快中子零功率反应堆(DF-VI)的临界事故概率分析

本文应用故障树分析方法,对快中子零功率堆(DF-Ⅵ)在启动过程中发生临界事故的可能性做了初步的定量估计。结果表明,该堆每次启动发生临界事故的概率约为10~(-6)量级,得出确保装置启动安全的首要因素是选配合格的操作人员的结论,并对设备的改进提出了一些建议.     

斜井提升钢丝绳磨损“失效树”分析

介绍了引起斜井提升钢丝绳失效的各种因素 ,并建立“失效树” ,为煤矿生产中判断其失效原因及预防提供可靠依据。     

Tree-based partitioning of date for association rule mining

The most computationally demanding aspect of Association Rule Mining is the identification and counting of support of the frequent sets of items that occur together sufficiently often to be the basis of potentially interesting rules. The task increases in difficulty with the scale of the data and also with its density. The greatest challenge is posed by data that is too large to be contained in primary memory, especially when high data density and/or low support thresholds give rise to very large numbers of candidates that must be counted. In this paper, we consider strategies for partitioning the data to deal effectively with such cases. We describe a partitioning approach which organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds. Shakil Ahmed received a first class BSc (Hons) degree from Dhaka University, Bangladesh, in 1990; and an MSc (first class), also Dhaka University, in 1992. He received his PhD from The University of Liverpool, UK, in 2005. From 2000 onwards he is a member of the Data Mining Group at the Department of Computer Science of the University of Liverpool, UK. His research interests include data mining, Association Rule Mining and pattern recognition. Frans Coenen has been working in the field of Data Mining for many years and has written widely on the subject. He received his PhD from Liverpool Polytechnic in 1989, after which he took up a post as a RA within the Department of Computer Science at the University of Liverpool. In 1997, he took up a lecturing post within the same department. His current Data Mining research interests include Association rule Mining, Classification algorithms and text mining. He is on the programme committee for ICDM'05 and was the chair for the UK KDD symposium (UKKDD'05). Paul Leng is professor of e-Learning at the University of Liverpool and director of the e-Learning Unit, which is responsible for overseeing the University's online degree programmes, leading to degrees of MSc in IT and MBA. Along with e-Learning, his main research interests are in Data Mining, especially in methods of discovering Association Rules. In collaboration with Frans Coenen, he has developed efficient new algorithms for finding frequent sets and is exploring applications in text mining and classification.     

以数字搜索树表示的二值图象的几何变换

本文介绍以数字搜索树表示的二值图象的一种几何变换算法，文中讨论了四分区与正四边区的基本关系，输出ＤＳＴ结点成立的充分条件，给出了完整的几何变换算法并对算法的复杂性作了分析。