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.     

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.     

大焦深成像系统仿真实验研究

如何增大非相干光学成像系统的焦深是应用光学研究领域的热点问题.本文对采用高次非球面光学掩模板与图像处理相结合增大成像光学系统焦深的新方法进行了深入分析,建立了大焦深成像系统仿真实验模型,并进行了大焦深成像系统仿真实验.实验结果证明了该方法在维持原相对孔径的同时使光学系统在较大的离焦范围内有好的成像质量.实际应用中还要综合考虑模板参量、信噪比等关键因素.     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.     

未确知数学方法处理物理实验数据

介绍未确知数学方法，并用未确知数学方法分析处理物理实验数据，与传统的数据处理方法比较，未确知数学方法不必对数据作任何假设，因此更合理，也更符合实际。     

FORWARD-BACKWARD STOCHASTIC DIFFERENTIAL EQUATIONS WITH STOPPING TIME

The existence and uniqueness results of fully coupled forward-backward stochastic differential equations with stopping time (unbounded) is obtained. One kind of comparison theorem for this kind of equations is also proved.     

数码相机原理与系统设计研究

介绍了数码相机的工作原理 ,分析了数码相机的系统结构 ,提出了设计数码相机的处理流程。典型的数码相机系统有镜头、闪光灯、光学取景器、LCD显示屏、图像数据存储扩展设备接口、图像数据传输接口、供电系统以及核心处理器等八个主要模块。数码相机的数据流向从图像传感器开始 ,止于图像数据的存储和传输。数据流的处理主要包括模数转换、光学黑电平钳位、针对镜头的边缘畸变的运算修正、坏像素处理、白平衡处理、伽马校正、色彩合成处理、边缘检测 (锐度检测 )和伪彩色检测 (伪彩色抑制 )、JPEG压缩和图像存储器等模块     

Global and exploding solutions in a model of self-gravitating systems

We study asymptotic properties of solutions to an extension to arbitrary dimensions of the astrophysical model proposed by Chavanis et al. to explain phenomena of gravitational collapse in clouds of self-gravitating particles. In particular, we show that in the two-dimensional case the solutions can be continued to global ones, while in three space dimensions large data of negative energy blow up in a finite time. Relations between isothermal, Streater's energy-transport and the present models are also studied.     

A note on conservation laws for a multiclass service queueing system with setup times

This paper derives a conservation law for mean waiting times in a single-server multi-class service queueing system (M ^X/G/1 type queue) with setup times which may be dependent on multiple customer classes and its arrival batch size by using the work decomposition property in the queueing system with vacations.     

托卡马克能量约束及自举电流效应的初步考虑

基于Lee等人的离子温度梯度模导致的反常热能输运系数,本文研究了辅助加热托卡马克等离子体的能量约束行为,并对自举电流的效应作了初步考虑。结果表明,计算得到的能量约束时间随等离子体电流I_p和托卡马克大半径R增大而增长,随注入功率P_t、环向场B_t以及等离子体小半径α的增大而缩短。这些结果与Kaye-Goldston的经验约束定标具有相同的趋势。自举电流的存在总是导致能量约束时间的增加,当自举电流与总电流的比值γ较小时,能量约束时间的增加率约为γ/2。此外,自举电流将造成锯齿反转半径的减小。