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）的计算公式，并计算该类和式＋     

清华物理系量子信息研究的新进展

在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验.     

Reconstruction of the Point-Spread Function of the Human Eye Using a New Phase-Retrieval Algorithm

The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change in value.     

实时任务动态调度算法

任务调度算法是提高多任务系统效率的一种有效途径,特别是在时间紧迫环境下,实时任务调度算法更具有重要的应用价值.在研究建立实时任务调度模型方法的基础上,对模型进行理论分析,提出了实时任务调度的算法,并通过实例加以验证.     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

First-principles study on the origin of optical transitions to be associated with F colour centers for PbWO4 crystals

The electronic structures of PbWO₄ crystals containing F type color centers with the lattice structure optimized are studied within the framework of the fully relativistic self-consistent Direc–Slater theory, using a numerically discrete variational (DV-Xα) method. The calculated results show that F and F⁺ centers have donor energy level in forbidden band. Their optical transition energy are 1.84 eV, 2.21 eV, respectively, which corresponds to the 680 nm, 550 nm absorption bands. It predicts that the 680 nm, 550 nm absorption bands originate form the F and F⁺ centers in PbWO₄ crystals.     

一种改进的共同进化遗传算法及其应用

将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.