求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Quantitative Comparison of REAPDOR and TRAPDOR Experiments by Numerical Simulations and Determination of H–Al Distances in Zeolites

Quantitative H–Al distances in acid sites of two zeolites with MFI and IFR framework topology were obtained by numerical simulation of ¹H{²⁷Al} rotational echo adiabatic passage double resonance (REAPDOR) experiments. A ²⁷Al offset-dependent data set yields for each resolved ¹H NMR line a corresponding nuclear electric quadrupole coupling constant of the neighboring ²⁷Al site. This information is used for analyzing a second data set for on-resonance irradiation, where the dipolar evolution time (number of rotor cycles) was varied, to yield the ¹H–²⁷Al dipolar coupling constant. Numerical simulations indicate that the REAPDOR method does not depend significantly on the polar angles, defining the orientation of the electric field gradient tensor of ²⁷Al with respect to the Al–H dipolar vector. In contrast, the transfer of populations in double resonance sequence is sensitive to these angles, and it can be thus used to measure them.     

基于频域方法的三维物体分层重现

基于频域方法实现了数字记录和再现三维物体离轴全息图.通过频谱对应关系求得各个面的频谱分布,使用数字滤波方法,成功地消除了零级衍射和共轭像;通过改变再现距离,分别获取了三维物体各个截面的再现像.     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

环面上具有间断梯度的势函数的模拟退火

本文证明了环面上具有间断梯度的势函数的模拟退火过程：dXt=-VU(Xt)dt √2dWt概率收敛到势函数的全局极小集附近。     

Numerical analysis of the Toda lattice equations

Numerical solutions to three systems of integrable evolutionary equations from the Toda lattice hierarchy are analyzed. These are the classical Toda lattice, the second local dispersive flow, and the second extended dispersive flow. Special attention is given to the properties of soliton solutions. For the equations of the second local flow, two types of solitons interacting in a special manner are found. Solutions corresponding to various initial data are qualitatively outlined.     

Temperature effect on deposition rate of silicon nitride films

Temperature effects on deposition rate of silicon nitride films were characterized by building a neural network prediction model. The silicon nitride films were deposited by using a plasma enhanced chemical vapor deposition system and process parameter effects were systematically characterized by 2⁶⁻¹ fractional factorial experiment. The process parameters involved include a radio frequency power, pressure, temperature, SiH₄, N₂, and NH₃ flow rates. The prediction performance of generalized regression neural network was drastically improved by optimizing multi-valued training factors using a genetic algorithm. Several 3D plots were generated to investigate parameter effects at various temperatures. Predicted variations were experimentally validated. The temperature effect on the deposition rate was a complex function of parameters but N₂ flow rate. Larger decreases in the deposition rate with the temperature were only noticed at lower SiH₄ (or higher NH₃) flow rates. Typical effects of SiH₄ or NH₃ flow rate were only observed at higher or lower temperatures. A comparison with the refractive index model facilitated a selective choice of either SiH₄ or NH₃ for process optimization.     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.     

和式∑k=0^nμ^kf（k）的发生函数算法

利用普通幂级数发生函数方法，通过对发生函数进行xD算子，得到和式∑k=0^nμ^kf（k）的计算公式，并计算该类和式＋