A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

神经网络法计算镉（Ⅱ）,羟基及碳酸根三元体系的形态分布

采用前馈线笥网络ＢＰ算法，计算了Ｃｄ６２＋－ＯＨ＾－ＣＯ＾２－３三元体系的累积稳定常数。用Ｈｏｐｆｉｅｌｄ反馈网络研究了体系中络合物的形态分布。溶液中溶解的ＣＯ２对ｌｇβ１的计算结果有重要影响，对ｌｇβ２，ｌｇβ３，ｌｇβ４的结果影响不大。     

第I类非自共轭锥上的Gamma函数

本文将Ｇａｍｍａ函数及Ｓｉｅｇｅｌ积分推广到一般的第Ｉ类非自共轭锥上．作为其应用，显式给出了以这些锥为底的管状域（或第一类Ｓｉｅｇｅｌ域）的Ｃａｕｃｈｙ Ｓｚｅｇ¨ｏ核和形式Ｐｏｉｓｏｎ核．     

A Faster Deterministic Maximum Flow Algorithm

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n² log²n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(log_{m/n log n}n)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(n^ε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n).     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

Measurement of storage time, estimation of ion number and study of absorption line profile in a Paul trap

Europium (Eu⁺) ions were confined in a Paul trap and detected by non-destructive method. Storage time of Eu⁺ ions achieved in vacuum was improved by orders of magnitude employing buffer gas cooling. The experimentally detected signal was fitted to the ion response signal and the total number of ions trapped was estimated. It is found that the peak signal amplitude as well as the product of FWHM and the peak signal amplitude is proportional to the total number of trapped ions. The trapped ion secular frequency was swept at different rates and its effect on the absorption line profile was studied both experimentally and theoretically.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Normalization and Fermi–Coulomb and Coulomb hole sum rules for approximate wave functions

For approximate wave functions, we prove the theorem that there is a one‐to‐one correspondence between the constraints of normalization and of the Fermi–Coulomb and Coulomb hole charge sum rules at each electron position. This correspondence is surprising in light of the fact that normalization depends on the probability of finding an electron at some position. In contrast, the Fermi–Coulomb hole sum rule depends on the probability of two electrons staying apart because of correlations due to the Pauli exclusion principle and Coulomb repulsion, while the Coulomb hole sum rule depends on Coulomb repulsion. We demonstrate the theorem for the ground state of the He atom by the use of two different approximate wave functions that are functionals rather than functions. The first of these wave function functionals is constructed to satisfy the constraint of normalization, and the second that of the Coulomb hole sum rule for each electron position. Each is then shown to satisfy the other corresponding sum rule. The significance of the theorem for the construction of approximate “exchange‐correlation” and “correlation” energy functionals of density functional theory is also discussed. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

p+209Bi核反应微观数据的理论计算

利用光学模型、激光模型、蒸发模型及扭曲波玻恩近似理论,对入射能量从阈能到300MeV,p+²⁰⁹Bi的中子反应截面、剩余核截面、出射粒子的多重数进行了理论计算及分析,并将计算结果与实验数据进行了比较.同时得到一组能量到50?0MeV与实验数据符合很好的光学势参数.     

A microprocessor based autoscanner for electromigration studies in thin films

Mass transport due to electromigration can be estimated if the diffusion coefficientD and the electromigration effective charge numberZ* are known. Neutron activated tracer scanning method determine the radioactivity at different positions. An automatic scanning system for determining the radioactive concentration profiles developed using a microprocessor is described in this paper. Using the radioactive concentration profiles the electromigration shift is determined. From this shift the electromigration effective charge numberZ* is calculated. The system developed was tested for tin thin films.