Random walks on inhomogeneous lattices

For lattices with two kinds of points (black and white), distributed according to a translation-invariant joint probability distribution, we study statistical properties of the sequence of consecutive colors encountered by a random walker moving through the lattice. The probability distribution for the single steps of the walk is considered to be independent of the colors of the points. Several exact results are presented which are valid in any number of dimensions and for arbitrary probability distributions for the coloring of the points and the steps of the walk. They are used to derive a few general properties of random walks on lattices containing traps.Presented at the Symposium on Random Walks, Gaithersburg, MD, June 1982.     

Theoretical study of molecular conduction: I. Effective Green's function based on perturbation theory

There have been many experimental and theoretical studies on molecular conduction, as it is a fundamental parameter in the study of molecular‐scale electronics. We have investigated the features of molecular conduction using a Green's function method, which has often been used to solve problems in quantum transport and is also effective in elucidating electron transport in molecules. We have obtained the novel effective Green's functions, including the first‐order energy corrections, by accommodating the self‐energy of the electrodes as perturbation terms. Although these approximate Green's functions only provide information on the first‐order energy corrections, they can involve the elementary properties of molecular conduction. We propose a scheme for the analysis of the relations between molecular orbitals and their roles in molecular conduction and present analytical calculations for normal and cyclic polyenes. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006     

一类由一维概率密度函数构造多维概率密度函数的方法

将文献[1]给出的由一维连续型随机变量的概率密度函数构造二维连续型随机变量的概率密度函数的方法,推广为由一维连续型随机变量的概率密度函数构造三维连续型随机变量的概率密度函数的情况,并作出了证明和举例说明.说明利用本文的方法构造多维概率密度函数,其方法简单易行.     

期望效用函数理论及其应用

分析了期望效用函数理论,并将其运用于图书馆的管理工作,从中发现其规律性.为图书馆的科学管理提供了一条有效的途径.     

关于保险精算函数的几点讨论

对目前精算教材中的有关保险精算函数作了较为细致的分析和比较,较为深入地讨论了均衡净保费的责任准备金计算的未来法及过去法的联系.     

约束最小二乘估计的优良性

对于线性模型y=Xθ ε,ε服从椭球等高单峰分布,未知参数θ满足不等式约束a′θ≥0,证明了在参数估计优良性的集中概率准则下,θ的约束最小二乘估计θ~*优于最小二乘估计θ.     

Age Analysis of Status Updating System with Probabilistic Packet Preemption

The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber/Geo/1/2*/η, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability η. Instead of considering the system’s AoI separately, we use a three-dimensional state vector (n,m,l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system’s average AoI and show that the average AoI of the system without packet preemption is obtained by letting η=0. When η is set to 1, the mean of the AoI of the system with a Ber/Geo/1/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber/Geo/1/c queue and the average continuous AoI with the M/M/1/c queue. For each of two extreme cases where η=0 and η=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability η, as well as the AoI’s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.     

有雨概率与分维数关系的初步研究

对武汉地区１９８２～１９９４年有雨分维数与有雨概率之间的关系进行了初步的分析和研究，并给出了研究结果．为今后修改降雨衰减预报模型作准备．     

超强激光场中氘原子电离几率的研究

研究了在相对论领域内,超强激光场的不同条件（频率、强度、脉冲波形磁场分量）对氘原子电离几率的影响,研究表明：电离几率随激光强度的增加而增加,随激光频率的增加而减少。而激光脉冲波形对电离几率的影响仅在激光无磁场分量时比较显著。激光场的磁场分量对原子的电离有一定的影响。     

Stationary states of crystal growth in three dimensions

A new Markov process describing crystal growth in three dimensions is introduced. States of the process are configurations of the crystal surface, which has a terrace-edge-kink structure. The states are continuous along edges but discrete across edges, in accordance with the very different rates for the two types of captures of particles. Stationary distributions, describing steady crystal growth, are found in general. To our knowledge, these are the first examples of stationary distributions for layered crystal growth in three dimensions. The steady growth rate and other quantities are obtained explicitly for two interacting edges. For many interacting edges, growth behavior is determined (a) in various asymptotic regimes including thermodynamic limits, (b) via simulations, and (c) using series (cluster) expansions in the slope of the surface, the first three coefficients being computed. The theoretical growth rates show a marked dependence on surface dimensions. This may contribute to the size dependence and dispersion in the observed growth rate of small crystals.