Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

On conditions ensuring the highest difference in the association degrees of the equilibrium H and D steams: Clustering and isotope enrichment

A search for conditions leading to the highest possible difference between equilibrium association (clustering) degree in the H and D steam has been carried out and related optimal steam pressures evaluated. The difference decreases with increasing temperature but still is a few per cent at moderate temperatures.     

关于(?)-拟微分核的连续性

Supposa that f(x) is a quasidifferentiable function, defined on S(?)R~n where S is an open set, with a -equivalent bounded quasidifferential subfam ily. Lenma I     

A STUDY OF VARIOUS BARRIERS IN ENCLOSED SOUND FIELD BY USING THE COMPUTER PROGRAM—SOFIS

In the study of the behaviors of barriers in an enclosed field, one should take into account such phenomena as sound energy reflection, absorption, scattering and diffraction. Therefore, the study is much more difficult than that in free field. In this paper, sound barriers are classified into four kinds according to their size, number and shape. Each kind of barriers is modelled by a corresponding method based on a computer program—SOFIS. The program combines the ray-tracing technique and statistical method. The impulse response and some acoustical parameters such as sound pressure level at different positions can be calculated by the program, no matter there are a certain kind of barriers in the field or the field is empty. The ray-tracing program and the algorithms for various barriers are validated by the comparison between measurement and prediction of the reverberation room and the anechoic room of the Northwestern Polytechnic University.     

CsI(Tl)晶体中反冲Cs和I核Quenching?Factor的测量

许多实验对用CsI(Tl)闪烁晶体作为探测器来寻找和探测暗物质的可行性进行了研究.本工作利用8MeV单能中子轰击CsI(Tl)晶体探测器来研究Cs核和I核的QuenchingFactor.在数据处理中,运用脉冲形状甄别(PSD)方法来分辨反冲核信号和本底信号.实验结果表明,在7keV到132keV的能区中,Quench ingFactor随着反冲核能量的减少而增加.在探测暗物质的实验中,这一性质对于CsI(Tl)晶体探测器获得较低的能量阈值是很有利的.     

Formation of hydrogenated amorphous carbon films from polymer pyrolysis

Free-standing and supported hydrogenated amorphous carbon films (a:C–H) were prepared upon pyrolysis of the polymer formed by ethanolamine (EA) and citric acid (CA), under an ambient atmosphere at 300 °C. EA facilitates the formation of the macroscopic films, while CA is essential for obtaining the a:C–H microstructure, which comprises a mixture of sp² and sp³ carbon. Received: 29 May 2001 / Accepted: 17 August 2001 / Published online: 20 December 2001     

Some remarks to multivariate regression model

Some remarks to problems of point and interval estimation, testing and problems of outliers are presented in the case of multivariate regression model. This work was supported by the Council of Czech Government J14/98:153100011.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.