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.     

形态学边缘检测的新算法及其应用

提出了一种基于数学形态学的边缘检测的所算法，该算法具有简便和灵活可编程控制等优点，比原来主算法更国完善，在实际应用中有着很好的前景，并给出了实验结果。     

Algorithm for converting a forest of quadtrees to a binary array

An algorithm for reconstructing a binary array of size N sx N from its forest of quadtree representation is presented. The algorithm traverses each tree of the forest in preorder and maps each ‘black’ node into the spatial domain. The time complexity in mapping is O(log N × B_n + B_p), where B_n is the number of black nodes in the forest and B_p is the number of black pixels in the N × N array. The algorithm has been implemented on an Apple II.     

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

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

Binary rewriting and call interception for efficient runtime protection against buffer overflows

Buffer overflow vulnerabilities are one of the most commonly and widely exploited security vulnerabilities in programs. Most existing solutions for avoiding buffer overflows are either inadequate, inefficient or incompatible with existing code. In this paper, we present a novel approach for transparent and efficient runtime protection against buffer overflows. The approach is implemented by two tools: Type Information Extractor and Depositor (TIED) and LibsafePlus. TIED is first used on a binary executable or shared library file to extract type information from the debugging information inserted in the file by the compiler and reinsert it in the file as a data structure available at runtime. LibsafePlus is a shared library that is preloaded when the program is run. LibsafePlus intercepts unsafe C library calls such as strcpy and uses the type information made available by TIED at runtime to determine whether it would be ‘safe’ to carry out the operation. With our simple design we are able to protect most applications with a performance overhead of less than 10%. Copyright © 2006 John Wiley & Sons, Ltd.     

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

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