基于正弦灰度变换的X光图像增强

介绍了灰度变换法的几种形式 ,提出了一种正弦非线性变换法 ,对三幅数字X光医学图像进行了处理 ,获得了令人满意的对比度增强效果 ,证明该方法有效而实用     

牛顿弦截法预估校正迭代格式的收敛阶

研究如下形式的牛顿弦截法的预估校正(P.C.)格式:P(预估):~xk+1=xk-(xk-xk-1)f(xk)f(xk)-f(xk-1)C(校正):xk+1=xk-(~xk+1-xk)f(xk)f~(xk+1)-f(xk)证明了它的收敛阶为2.618.     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

相位差与q变形广义相干叠加态的压缩特性

对于q变形的非简谐振子广义相干态的叠加态β〉+eiφβeiδ〉,其量子涨落的可能高阶压缩阶数可以表示为k≠2πn/δ,这里n是整数.当δ=π时,压缩阶数不能是偶数即只能是奇数,这正是q变形非简谐振子广义奇偶相干态的结果.由此表明参数相位差δ对决定q变形的非简谐振子广义相干态叠加态的高阶压缩阶数起决定性作用.     

The Properties of Light Pressure Force with High Order in Laser Fields

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｉｎｒｅｃｅｎｔｙｅａｒｓ,ｂｏｔｈｔｈｅｔｈｅｏｒｅｔｉｃａｌａｎｄｅｘｐｅｒｉｍｅｎｔａｌｉｎｖｅｓｔｉｇａｔｉｏｎｓｏｎｌａｓｅｒｃｏｏｌｉｎｇａｎｄｔｒａｐｐｉｎｇｈａｖｅｂｅｃｏｍｅｏｎｅｏｆｔｈｅｍａｊｏｒｆｉｅｌｄｓｉｎａｔｏｍｉｃ,ｍｏｌｅｃｕｌａｒａｎｄｏｐｔｉｃａｌ ｐｈｙｓｉｃｓ[1～ 8] .Ｔｈｅｄｅｖｅｌｏｐｍｅｎｔｏｆｌａｓｅｒｃｏｏｌｉｎｇａｎｄｔｒａｐｐｉｎｇｔｅｃｈｎｏｌｏｇｙｉｓｉｍｐｏｒｔａｎｔｆｏｒｔｈｅａｐｐｌｉｃａｔｉｏｎｓｓｕ…     

EFFICIENT SIXTH ORDER P-STABLE METHODS WITH MINIMAL LOCAL TRUNCATION ERROR FOR y"=f(x,y)

1. IntroductionWe consider a class of direct hybrid methods proposed in [11 for solving the second orderinitial value problemy" = f(t,y), y(0),y'(0) given (1.1)The basic method has the formandHere t. = nh and we define t.l.. = t. I aih, i = 1, 2 and n=0,1…     

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.      

Order conditions for linearly implicit fractional step Runge Kutta methods

^{In this paper, we study the consistency of a variant of fractionalstep Runge–Kutta methods. These methods are designed tointegrate efficiently semi-linear multidimensional parabolicproblems by means of linearly implicit time integration processes.Such time discretization procedures are also related to a splittingof the space differential operator (or the spatial discretizationof it) as a sum of ‘simpler’ linear differentialoperators and a nonlinear term.}     

Approximating schedules for dynamic process graphs efficiently

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.