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.     

水力机械内鲤鱼草鱼的压力损伤模拟试验

通过试验人工模拟水力机械内压力变化过程,测量压力时间变化,观察并解剖分析不同压力变化过程对鲤鱼和草鱼造成损伤的情况。试验发现,负压状态下的压力变化过程会对鱼的生存构成直接威胁,并得到了新型环保水力机械设计中应采用的压力时变导数极限值。     

Directed Motion of a Molecular Motor Based on the Four-State Model with Unequal Substeps

A periodic one-dimensional four-state hopping model is proposed. In the model, the substeps betweenarbitrary adjacent states are unequal, and an explicit solution of the master equation is first obtained for the probabilitydistribution as a function of the time and position for any initial distribution with all the transients included. Next, thetransient behaviors in the initial period of time and the characteristic time to reach the steady state for the molecularmotor are discussed. Finally, we compare the steady state results to experiments and illustrate qualitatively the kineticbehaviors of a molecular motor under external load F.     

用反射法自动测量大尺寸样品的折射率分布

针对大尺寸样品的折射率分布测量,引入自动扫描装置和适时数据处理系统,研究出一种高灵敏度的智能化反射法折射率分布测量仪,可进行快速、自动、准确的折射率分布测量.经理论分析和实验研究提出了一套合理的实验数据处理方法.并具体介绍和详尽分析了实验装置,讨论了有关理论和实验误差,给出了消除各种误差的有效方法,最终得出较为理想的实验结果.     

The Exact Hausdorff Measure Function of the Level Sets of Multi-parameter Symmetric Stable Process

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.     

Second order parabolic equations in Banach spaces with dynamic boundary conditions

In this paper, we exhibit a unified treatment of the mixed initial boundary value problem for second order (in time) parabolic linear differential equations in Banach spaces, whose boundary conditions are of a dynamical nature. Results regarding existence, uniqueness, continuous dependence (on initial data) and regularity of classical and strict solutions are established. Moreover, several examples are given as samples for possible applications.

     

PT Symmetry in Quantum Field Theory

The Hamiltonian H specifies the energy levels and the time evolution of a quantum theory. It is an axiom of quantum mechanics that H be Hermitian. The Hermiticity of H guarantees that the energy spectrum is real and that the time evolution is unitary (probability preserving). In this talk we investigate an alternative formulation of quantum mechanics in which the mathematical requirement of Hermiticity is replaced by the more physically transparent condition of space-time reflection (PT) symmetry. We show that if the PT symmetry of a Hamiltonian H is not broken, then the spectrum of H is real. Examples of PT-symmetric non-Hermitian Hamiltonians are H=p ²+ix ³ and H=p ²-x ⁴. The crucial question is whether PT-symmetric Hamiltonians specify physically acceptable quantum theories in which the norms of states are positive and the time evolution is unitary. The answer is that a Hamiltonian that has an unbroken PT symmetry also possesses a physical symmetry that we call C. Using C, we show how to construct an inner product whose associated norm is positive definite. The result is a new class of fully consistent complex quantum theories. Observables exhibit CPT symmetry, probabilities are positive, and the dynamics is governed by unitary time evolution.     

红外单站被动定位技术速度更新算法研究

针对红外单站被动定位技术中空中机动目标的运动速度不断变化这一实际情况,提出了一种基于红外相机运动特性的对目标的运动速度进行实时更新的校正算法.该算法克服了大多基于匀速直线运动这一空间模型的红外单站被动定位方案目标速度不变的缺点,客观地反映了空中机动目标的实际运动状况,不仅能对目标的运动速度进行实时准确的更新校正,而且可推演出一种新的红外单站被动定位算法,对推动红外单站被动定位技术的工程实用化进程具有重要的意义.     

Generalized binomial and negative binomial distributions of order<Emphasis Type="Italic">k</Emphasis> by the<Emphasis Type="Italic">l</Emphasis>-overlapping enumeration scheme

In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number of trials and derive the probability generating functions. The present work extends several properties of distributions of orderk and leads us a new type of geneses of the discrete distributions.