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.
相似文献
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
We introduce the time-consistency concept that is inspired by the so-called “principle of optimality” of dynamic programming
and demonstrate – via an example – that the conditional value-at-risk (CVaR) need not be time-consistent in a multi-stage
case. Then, we give the formulation of the target-percentile risk measure which is time-consistent and hence more suitable
in the multi-stage investment context. Finally, we also generalize the value-at-risk and CVaR to multi-stage risk measures
based on the theory and structure of the target-percentile risk measure. 相似文献
A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called
-output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is
-complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a
-complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献
The spectrophotometric study of luminol (LH2) in dimethyl sulfoxide (DMSO), DMSO-water solutions, and alkaline DMSO and DMSO-water solutions has been done, focusing on the effect of the KOH additon on LH2 absorption and fluorescence properties. The absorption spectra indicate an acid-base equilibrium, and the luminol dianion (L2–) formation at 3 × 10–4 – 2.4 × 10–3M KOH. The decrease of the fluorescence intensity and the variation of the excitation spectra of LH2-DMSO-KOH solutions with KOH concentration have been similarly explained. The acid-base process is reversible. The addition of HCl to the solution with 3.0 × 10–3 M KOH leads to an increase of the fluorescence intensity to its highest value, observed in pure DMSO. The addition of HCl to the LH2-DMSO solution leads to the decrease of the fluorescence intensity as a result of the LH+3 cation formation. In LH2-DMSO-water, the fluorescence band is shifted from 405 nm to 424 nm and increased in the intensity. In the presence of KOH (in LH2-DMSO-water-KOH solution) a new band appears, with the maximum at 485 nm and the band at 405 nm decreased. The changes in fluorescence lifetimes also evidence the different chemical species formed. 相似文献
In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф(r) = r^N-d/α (log log l/r)d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general (N, d, α) strictly stable processes. 相似文献