Comparative investigation of up-conversion luminescence in Tm/Yb-codoped germanate-niobic and germanium-bismuth glasses: effect of phonon density on up-conversion emission

Tm³⁺/Yb³⁺-codoped germanate-niobic (GN) and germanium-bismuth (GB) glasses have been synthesized by conventional melting and quenching method. Intense blue and weak red emissions centered at 477 and 650 nm, corresponding to the transitions ¹G₄→³H₆ and ¹G₄→³H₄, respectively, were observed at room temperature. The possible up-conversion mechanisms are discussed and estimated. GN glass showed a weaker up-conversion emission than GB glass, which is inconsistent with the prediction from the difference of maximum phonon energy between GN and GB glasses. In this paper, Raman spectroscopy was employed to investigate the origin of the difference in up-conversion luminescence in the two glasses. Compared with phonon side-band spectroscopy, Raman spectroscopy extracts more information including both phonon energy and phonon density. For the first time, our results reveal that, besides the maximum phonon energy, the phonon density of host glasses is also an important factor in determining the up-conversion efficiency.     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

Hard collisions of spinning protons: Past,present and future

There will be a review of the history of polarized proton beams, and a discussion of the unexpected and still unexplained large transverse spin effects found in several high-energy proton-proton spin experiments at the ZGS, AGS and Fermilab. Next, there will be a discussion of present and possible future experiments on the violent elastic collisions of polarized protons at IHEP-Protvino's 70GeV U-70 accelerator in Russia and the new high-intensity 50GeV J-PARC facility being built at Tokai in Japan.     

六角系统的边面点面全色数

本文得到了六角系统的边面和点面金色数．     

Zeroth-order phase transitions and Zipf law quantization

From the standpoint of thermodynamic averaging of fission microprocesses, we investigate the origin of radioactive release in an NPP after an accident or after resource depletion. The genesis of the NPP release is interpreted as a new thermodynamic phenomenon, a zeroth-order phase transition. This problem setting results in a problem in probabilistic number theory. We prove the corresponding theorem leading to quantization of the Zipf law for the frequency of a zeroth-order phase transition with different values of the jump of the Gibbs thermodynamic potential. We introduce the notion of hole dimension. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 1, pp. 118–142, January, 2007.     

Nondispersive two-electron wave packets in driven helium

We provide a detailed quantum treatment of the spectral characteristics and of the dynamics of nondispersive two-electron wave packets along the periodically driven, collinear frozen planet configuration of helium. These highly correlated, long-lived wave packets arise as a quantum manifestation of regular islands in a mixed classical phase space, which are induced by nonlinear resonances between the external driving and the unperturbed dynamics of the frozen-planet configuration. Particular emphasis is given to the dependence of the ionization rates of the wave packet states on the driving field parameters and on the quantum mechanical phase space resolution, preceded by a comparison of 1D and 3D life times of the unperturbed frozen planet. Furthermore, we study the effect of a superimposed static electric field component, which, on the grounds of classical considerations, is expected to stabilize the real 3D dynamics against large (and possibly ionizing) deviations from collinearity. Received 7 November 2002 / Received in final form 2 December 2002 Published online 28 January 2003     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

抽样调查中最佳测量次数的确定

现场抽样调查中，由于测量误差的存在，使得所测变量实测值的方差增大，通过增加每个体的测量次数可以控制测量误差，但这样每个体调查费用增大。本文对测量信度Ｒ，每个体测量次数ｍ与相应所需的样本含量ｎｍ、调查费用Ｔｎ的关系进行了探讨，并介绍了如何根据Ｒ，及每个体测量费用占其总费用构成比Ｃ，确定最佳测量次数ｍ值，以达到最佳控制调查费用的目的，这对我们在大型现场调查中进行经济效益分析具有重大的理论指导意义。     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

A note on inverses in arithmetic with fuzzy numbers

Algorithms for systematical search of inverse in arithmetic operations with fuzzy numbers are discussed. The fuzzy number derived is considered either in a discrete representation of its support or described by the parameters of the corresponding membership function formula. Both algorithms are easy to be programmed for desk calculators.