<Emphasis Type="Italic">FCC/BCC</Emphasis> competition and enhancement of saturation magnetization in nanocrystalline Co-Ni-Fe films

The structure, chemical composition, and magnetic properties of electrochemically deposited nanocrystalline Co-Ni-Fe films were investigated using a number of techniques. A high saturation magnetic induction up to B _s = 21 kG was attained. An enhancement of the saturation magnetization compared to the ideal anticipated one was revealed, which correlated with the nonlinear behavior of the structural phase composition and lattice parameters with the change of the composition. The text was submitted by the authors in English.     

FEM study of palladium and molybdenum clusters on an alumina covered field emitter

Palladium and molybdenum polycrystalline layers (clusters) have been deposited in a stainless steel UHV system onto a layer of alumina (Al₂O₃). This layer has been prepared by high temperature oxidation of an aluminium layer. The interaction of this system with nitrogen has been investigated at room temperature by an FEM technique. Under these conditions nitrogen spillover from molybdenum to palladium has been observed.     

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.     

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

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.     

CMS physics overview

The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

High-temperature expansions to fifteenth order

High-temperature series expansions of the susceptibility and second moment to 15th order are calculated for zero external field on the linear chain (LC), plane square (PSQ), simple cubic (SC), and body-centered cubic (BCC) lattices. Checks for specific models against pertinent work in the literature are detailed.     

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004