P沟道和N沟道MOS场效应管的辐照实验研究

通过对P沟道MOS场效应管IRF9530和N沟道MOS场效应管IRF540N的X射线和钴源γ射线的辐照对比研究,发现两种场效应管阈值电压变化随吸收剂量近似成一阶指数衰减关系。产生这种现象的原因是场效应管氧化物中的空间俘获电荷与吸收剂量近似成线性变化,对阈值电压变化和吸收剂量有近似线性的改变;而界面态对空间电荷有补偿作用,其对阈值电压的改变与吸收剂量有近似成二次方的关系。     

Passive synthesis rules of coupled-cavity quantum cascade lasers

A new approach to passive electromagnetic modelling of coupled–cavity quantum cascade lasers is presented in this paper. One of challenges in the rigorous analysis of such eigenvalue problem is its large size as compared to wavelength and a high quality factor, which prompts for substantial computational efforts. For those reasons, it is proposed in this paper to consider such a coupled-cavity Fabry-Perot resonant structure with partially transparent mirrors as a two-port network, which can be considered as a deterministic problem. Thanks to such a novel approach, passive analysis of an electrically long laser can be split into a cascade of relatively short sections having low quality factor, thus, substantially speeding up rigorous electromagnetic analysis of the whole quantum cascade laser. The proposed method allows to determine unequivocally resonant frequencies of the structure and the corresponding spectrum of a threshold gain. Eventually, the proposed method is used to elaborate basic synthesis rules of coupled–cavity quantum cascade lasers.     

基于机器视觉的量子点STM形貌图像识别研究

为减轻量子点表面形貌分析过程中的人工工作,使量子点的STM图像分析更加自动化,基于机器视觉对衬底的斜切角及量子点的形貌特性展开研究.利用腐蚀和边缘检测提取台阶形状,并通过反三角变换计算斜切角.利用二值化和阈值下降对量子点的数量与空间坐标进行提取,在此基础上,通过邻域密度计算分析其均匀性,并在解决图像中的粘连问题后找出量子点的尺寸.实验结果显示,与人工统计相比,斜切角、量子点计数及尺寸的平均误差分别为5.02%, 0.7788%及1.12%;并实现量子点均匀性的自动化统计与分析.基于机器视觉算法的自动识别过程,对协助研究者分析量子点表面形貌有实际意义.     

有序抖动半调图像的无损压缩算法

在分析不同有序抖动模板对所生成抖动半调图像的影响因素基础上,设计了尺度变化的分块及块间异或预处理策略,大大提高了二值游程长度.进而使用游程和哈夫曼相结合的编码思想提出了一种新的有序抖动半调图像无损压缩算法.仿真实验表明,该算法在编码效率上具有较大优势.     

Bootstrap of the offspring mean in the critical process with a non-stationary immigration

In applications of branching processes, usually it is hard to obtain samples of a large size. Therefore, a bootstrap procedure allowing inference based on a small sample size is very useful. Unfortunately, in the critical branching process with stationary immigration the standard parametric bootstrap is invalid. In this paper, we consider a process with non-stationary immigration, whose mean and variance vary regularly with nonnegative exponents α and β, respectively. We prove that 1+2α is the threshold for the validity of the bootstrap in this model. If β<1+2α, the standard bootstrap is valid and if β>1+2α it is invalid. In the case β=1+2α, the validity of the bootstrap depends on the slowly varying parts of the immigration mean and variance. These results allow us to develop statistical inferences about the parameters of the process in its early stages.     

On a dual model with a dividend threshold

In insurance mathematics, a compound Poisson model is often used to describe the aggregate claims of the surplus process. In this paper, we consider the dual of the compound Poisson model under a threshold dividend strategy. We derive a set of two integro-differential equations satisfied by the expected total discounted dividends until ruin and show how the equations can be solved by using only one of the two integro-differential equations. The cases where profits follow an exponential or a mixture of exponential distributions are then solved and the discussion for the case of a general profit distribution follows by the use of Laplace transforms. We illustrate how the optimal threshold level that maximizes the expected total discounted dividends until ruin can be obtained, and finally we generalize the results to the case where the surplus process is a more general skip-free downwards Lévy process.     

On proper secrets, (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-bases and linear codes

This paper contains three parts where each part triggered and motivated the subsequent one. In the first part (Proper Secrets) we study the Shamir’s “k-out-of-n” threshold secret sharing scheme. In that scheme, the dealer generates a random polynomial of degree k−1 whose free coefficient is the secret and the private shares are point values of that polynomial. We show that the secret may, equivalently, be chosen as any other point value of the polynomial (including the point at infinity), but, on the other hand, setting the secret to be any other linear combination of the polynomial coefficients may result in an imperfect scheme. In the second part ((t, k)-bases) we define, for every pair of integers t and k such that 1 ≤ t ≤ k−1, the concepts of (t, k)-spanning sets, (t, k)-independent sets and (t, k)-bases as generalizations of the usual concepts of spanning sets, independent sets and bases in a finite-dimensional vector space. We study the relations between those notions and derive upper and lower bounds for the size of such sets. In the third part (Linear Codes) we show the relations between those notions and linear codes. Our main notion of a (t, k)-base bridges between two well-known structures: (1, k)-bases are just projective geometries, while (k−1, k)-bases correspond to maximal MDS-codes. We show how the properties of (t, k)-independence and (t, k)-spanning relate to the notions of minimum distance and covering radius of linear codes and how our results regarding the size of such sets relate to known bounds in coding theory. We conclude by comparing between the notions that we introduce here and some well known objects from projective geometry.