东津水电站引水隧洞进口不良地质段施工

东津水电站引水隧洞进口段工程地质条件恶劣，施工干扰大，渡汛工期紧。采用喷锚支护洞脸边坡，洞口明挖３ｍ浇筑钢筋混凝土明拱和Ｌ形护坡墙；洞身段采用新奥法施工，先打通上导洞；进口４０ｍ分段开挖，分段衬砌；进水塔压板混凝土模板采用门字框架钢支撑；排除了施工干扰，防止了洞口滑塌，进口段塌方的恶性事故发生，保证了引水隧洞工程的顺利施工。     

i－line光刻高均匀照明系统光能分布的计算模拟

叙述了ｉ－ｌｉｎｅ光刻高均匀照明系统的均匀照明原理，以及其具有特殊面形（非球面）、特殊结构（非共轴）、超光学表面（由多个非共轴光学表面组成）的光学系统的光能分布计算模拟的原理、方法。作为例子，用所编写的程序计算模拟了我们近来设计的一曝光系统几个重要光学表面上具有权重的点列图和光能分布曲线。     

Linear variational principle for convex vector maximization

For infinitely dimensional convex vector maximization problems, it is proved that there exists, under certain conditions, an arbitrarily small additive perturbation of the performance criterion by a linear continuous operator such that the perturbed problem has efficient solutions. The study was sponsored by the Ukrainian State Fund for Basic Research __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 105–114, March–April 2007.     

Comparative study on adaptive rational macromodels of highly resonant structures

Two macromodeling techniques using rational bases are investigated to accurately predict the natural frequencies of highly resonant microwave structures. Three methods are proposed and compared to calculate pole‐free solutions to the Thiele continued fraction and vector fitting pole‐residue models of the characteristic equation det[Z(s)]. © 2007 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2007.     

CXFTV2: A Fortran subroutine for the discrete least squares convex approximation

A Fortan subroutine calculates the least squares approximation to n data values containing random errors subject to non-negative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O(n) computer operations. Details in these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software.     

军事地理信息系统的现状与发展

在信息作战条件下，军事地理信息系统（MGIS）作为作战指挥自动化、数字化战场和现代武器系统的战场地理环境平台备受世界各国的重视。美国投入了大量人力、物力和财力先后研制并使用了地形分析系统等一系列应用系统，目前正着手研制地理影像情报综合管理系统（TPED）和地理影像与地理空间信息系统。我国的MGIS起步较晚，但发展很快，已成功地研制出了第一个具有自主版权的MGIS工具软件。该软件采用层次化体系结构和面向对象的设计方法，具有功能齐全、结构紧密、安全性好等特点。文章在分析国内外MGIS的基础上，着重介绍了军事地理信息系统软件的研制特点，并对军事地理信息系统进一步发展要解决的若干问题进行了探讨。     

Negotiation support systems: roots, progress and needs

Abstract. This paper identifies game theories and social behavior science as important roots for negotiation support systems (NSS) research. As these are not typically cited in the NSS literature, summary reviews of them are provided with indications of their relevance to NSS study. On the other hand, neither offers a sufficiently general-purpose formal model of negotiation that could serve as a backbone for NSS research. A survey of that research is provided, indicating that prugress to date has been somewhat eclectic and devoid of such a model. Our central contention is that a theoretical foundation for NSS study is much needed. Desirable characteristics of a suitable negotiation model are identified as guidance for future research that will aim to devise (and subsequently apply and test) such a model.     

次生伽马能谱分析方法的实验研究

本文指出一种地化学闭合模型的热中子瞬发活化伽马分析方法，它是地球化学测井的核心技术，标准谱的获得，基于标准谱的加权最小二乘解谱方法、灵敏度刻度及地球化学闭合模型是这一方法的关键环节。     

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.