n维氢原子的散射态

研究了n维氢原子的散射态性质．给出了精确的按“k/2π标度”归一化的散射态的精确解波函数及相移表达式，讨论了相移的解析性质，获得了束缚-连续跃迁矩阵元的解析计算公式．普通氢原子(n=3)散射态的有关结果作为特例包含在本文的一般结论之中． 关键词： n维氢原子 散射态 精确解 相移 束缚-连续跃迁矩阵元     

Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.     

Information and asymptotic efficiency of the case-cohort sampling design in Cox's regression model

Efficiencies of the maximum pseudolikelihood estimator and a number of related estimators for the case-cohort sampling design in the proportional hazards regression model are studied. The asymptotic information and lower bound for estimating the parametric regression parameter are calculated based on the effective score, which is obtained by determining the component of the parametric score orthogonal to the space generated by the infinite-dimensional nuisance parameter. The asymptotic distributions of the maximum pseudolikelihood and related estimators in an i.i.d. setting show that these estimators do not achieve the computed asymptotic lower bound. Simple guidelines are provided to determine in which instances such estimators are close enough to efficient for practical purposes.     

Structures and syntheses of layered and framework amine-bearing uranyl phosphate and uranyl arsenates

Two hydrated uranyl arsenates and a uranyl phosphate were synthesized by hydrothermal methods in the presence of amine structure-directing agents and their structures determined: (N₂C₆H₁₄)[(UO₂)(AsO₄)]₂(H₂O)₃, DabcoUAs, {NH(C₂H₅)₃}[(UO₂)₂(AsO₄)(AsO₃OH)], TriethUAs, and (N₂C₄H₁₂)(UO₂)[(UO₂)(PO₄)]₄(H₂O)₂, PiperUP. Intensity data were collected at room temperature using MoKα X-radiation and a CCD-based area detector. The crystal structures were refined by full-matrix least-squares techniques on the basis of F² to agreement indices (DabcoUAs, TriethUAs, PiperUP) wR₂=5.6%, 8.3%, 7.2% for all data, and R₁=2.9%, 3.3%, 4.0%, calculated for 1777, 5822, 9119 unique observed reflections (|F_o|?4σ_F), respectively. DabcoUAs is monoclinic, space group C2/m, Z=2, a=18.581(1), b=7.1897(4), c=7.1909(4) Å, β=102.886(1)°, V=936.43(9) Å³, D_calc=3.50 g/cm³. TriethUAs is monoclinic, space group P2₁/n, Z=4, a=9.6359(4), b=18.4678(7), c=10.0708(4) Å, β=92.282(1)°, V=1790.7(1) Å³, D_calc=3.41 g/cm³. PiperUP is monoclinic, space group Pn, Z=2, a=9.3278(4), b=15.5529(7), c=9.6474(5) Å, β=93.266(1)°, V=1397.3(1) Å³, D_calc=4.41 g/cm³. The structure of DabcoUAs contains the autunite-type sheet formed by the sharing of vertices between uranyl square bipyramids and arsenate tetrahedra. The triethylenediammonium cations are located in the interlayer along with two H₂O groups and are disordered. Both TriethUAs and PiperUP contain sheets formed of uranyl pentagonal bipyramids and tetrahedra (arsenate and phosphate, respectively) with the uranophane sheet-anion topology. In TriethUAs, triethlyammonium cations are located in the interlayer. In PiperUP, the sheets are connected by a uranyl pentagonal bipyramid that shares corners with phosphate tetrahedra of adjacent sheets, resulting in a framework with piperazinium cations and H₂O groups in the cavities of the structure.     

双（十二烷基亚磺酰）乙烷溶剂萃取钯及其机理的研究

本文研究用双（十二烷基亚磺酰）乙烷萃取钯的性能，在ＫＩ存在下从７ｍｏｌ／Ｌ盐酸介质中用含有ＢＤＳＥ的氯仿能定量萃取钯，有机的钯可被硫脲或氨溶液反萃继之用ＴＭＫ－ＴｒｉｔｏｎＸ－１００光度法测定，研究了萃取的最佳条件及干扰情况，斜率法测得萃合物组成为Ｐｄ：Ｉ：ＢＤＳＥ＝１：２：１，红外光谱证实萃合物中ＢＤＳＥ的二个亚砜以硫原子与钯配位，萃合物为异位体络合物，提出了选择性萃取分离钯的新方法。     

Bounding multi-stage stochastic programs from above

The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above. The results are based on restricting the solution set, such that the remaining multi-stage stochastic program is easy to solve. An example where the methods can be applied is presented.Supported in part by NATO Collaborative Research Grant No. 0785/87.     

On the Exceptional Zeros of Rankin–Selberg L-Functions

The main objects of study in this article are two classes of Rankin–Selberg L-functions, namely L(s,f×g) and L(s, sym²(g)× sym²(g)), where f,g are newforms, holomorphic or of Maass type, on the upper half plane, and sym²(g) denotes the symmetric square lift of g to GL(3). We prove that in general, i.e., when these L-functions are not divisible by L-functions of quadratic characters (such divisibility happening rarely), they do not admit any LandauSiegel zeros. Such zeros, which are real and close to s=1, are highly mysterious and are not expected to occur. There are corollaries of our result, one of them being a strong lower bound for special value at s=1, which is of interest both geometrically and analytically. One also gets this way a good bound onthe norm of sym²(g).     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

ENSTAR detector forη- mesic studies

We have initiated a search for a new type of nuclear matter, theη-mesic nucleus, using beams from the multi-GeV hadron facility, COSY at Juelich, Germany. A large acceptance scintillator detector, ENSTAR has been designed and built at BARC, Mumbai and fully assembled and tested at COSY. A test run for calibration and evaluation has been completed. In this contribution we present the design and technical details of the ENSTAR detector and how it will be used to detect protons and pions (the decay products ofη-mesic bound state). The detector is made of plastic scintillators arranged in three concentric cylindrical layers. The readout of the detectors is by means of optical fibres. The layers are used to generate ΔE –E spectra for particle identification and total energy information of stopped particles. The granularity of the detector allows for position (θ and ?ø determination making the event reconstruction kinematically complete     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.