Sensitization of Luminescence of Europium Compounds on Solid Matrices by Terbium (III) Ions

The conditions of sensitization of the luminescence of Eu(III) by Tb(III) ions in complexes with inorganic (Na₂WO₄) and organic (nalidixic acid) ligands in sorbates on solid matrices (zeolite CaX and crystalline zirconium phosphate (ZrP)) and in coprecipitation with CaWO₄ have been investigated. It has been established that the maximum sensitization of the europium luminescence is attained in the case where Eu and Tb are present in a 1:0.5 ratio. In this case, the integral intensity of luminescence of Eu(III) (the band with _max = 612 nm) in the sorbate of its complex with nalidixic acid on ZrP accounts for more than 60% of the luminescence intensity of the industrial photoluminophor Y₂O₃:Eu (FL-612) possessing red luminescence, and the intensity of Tb(III) luminescence (the band with _max = 545 nm) accounts for about 40% of the luminescence intensity of the photoluminophor Gd₂O₂S:Tb possessing green luminescence.     

A dynamical formulation of one-dimensional scattering theory and its applications in optics

We develop a dynamical formulation of one-dimensional scattering theory where the reflection and transmission amplitudes for a general, possibly complex and energy-dependent, scattering potential are given as solutions of a set of dynamical equations. By decoupling and partially integrating these equations, we reduce the scattering problem to a second order linear differential equation with universal initial conditions that is equivalent to an initial-value time-independent Schrödinger equation. We give explicit formulas for the reflection and transmission amplitudes in terms of the solution of either of these equations and employ them to outline an inverse-scattering method for constructing finite-range potentials with desirable scattering properties at any prescribed wavelength. In particular, we construct optical potentials displaying threshold lasing, antilasing, and unidirectional invisibility.     

非负矩阵与有向图的谱半径

本文给出非负矩阵的谱半径的上界、下界,由此给出有向图的谱半径的界.     

Matrix Transformations Between Some Vector-Valued Sequence Spaces

In this paper, we give necessary and sufficient conditions for infinite matrices mapping from the Nakano vector-valued sequence space (X, p) into any BK-space, and by using this result, we obtain the matrix characterizations from (X, p) into the sequence spaces (Y), c₀(Y, q), c(Y), _s(Y), E_r(Y), and F_r(Y), where p = (p_k) and q = (q_k) are bounded sequences of positive real numbers such that p_k 1 for all k N, r 0, and s 1.AMS Subject Classification (2000): 46A45     

二元(p,r,d)-码的构作及其应用

令n是一个正整数,[n]={1,2,…,n}.利用集合[叫上的s-子集族((ns))构作了二元(p,r,d)-叠加码,研究了它的容错和析取性质并介绍了它在非适应性群测(Nonadaptive Group Testing)方面的应用.     

关于圈的完全正矩阵实现

本文给出了一个关联图为圈的非负、半正定矩阵A为完全正的一个充要条件.我们还证明了这样的矩阵A（当A为完全正时）的分解指数即为A的阶数.     

用Java实现网上结构图实验仿真

基于线性系统仿真的连接矩阵方法，用Java语言开发面向结构图的实验仿真程序，以Applet小应用程序的形式插入网页中运行，实现了信号与系统网上实验教学中的结构图实验仿真。经试用，程序在浏览器中运行正常，可以完成一般线性系统仿真，与以MATLAB，LABView等程序开发的实验仿真程序相比，该程序运行环境简单，几乎所有常用的Web浏览器都支持Java运行，不需另行安装相应组件。对于线性系统结构图，实现了所见即所得的图形化编程环境，具有较好的人机交互性。     

Reactions of uranium atoms with ammonia: infrared spectra and quasi-relativistic calculations of the U:NH3, H2N--UH, and HN==UH2 complexes

Ammonia molecules interact with U atoms, and the resulting U:NH3 complex rearranges upon visible irradiation to form the H2N--UH and HN==UH2 molecules in excess argon. These products are identified by functional group frequencies, 15NH3 and ND3 isotopic shifts, and comparison to frequencies calculated by using density functional theory. The N==U pi bond in HN==UH2 is enhanced by partial triple-bond character through N(2p) to U(5f) conjugation, which is comparable to that found in the analogous HN==ThH2 molecule. These products also form complexes with additional ammonia molecules in the matrix. The interesting higher-energy N[triple chemical bond]UH3 complex is not formed.     

Gradient based and least squares based iterative algorithms for matrix equations AXB + CXD = F

This paper develops a gradient based and a least squares based iterative algorithms for solving matrix equation AXB + CX^TD = F. The basic idea is to decompose the matrix equation (system) under consideration into two subsystems by applying the hierarchical identification principle and to derive the iterative algorithms by extending the iterative methods for solving Ax = b and AXB = F. The analysis shows that when the matrix equation has a unique solution (under the sense of least squares), the iterative solution converges to the exact solution for any initial values. A numerical example verifies the proposed theorems.