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.     

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

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

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

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

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

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

一种新的超分辨记录点的读出技术

提出一种新的超分辨记录点的读出技术—超分辨反射膜技术，详细分析了其原理。用该技术，以Sb为超分辨反射膜，SiN为介电层，在激光波长为632．8nm和光学头的数值也径为0．40的读出光学系统中实现了直径为380nm的超分辨记录点的读出。同时研究了Sb薄膜厚度对读出信噪比的影响规律，发现最佳的Sb薄膜厚度为28～30nm，所得的信噪比为38～40dB。     

Two-dimensional autocorrelation function analysis of smoked foil patterns

Digital image processing techniques have been applied to the analysis of cellular smoked foil patterns from gaseous detonations. In particular, the two-dimensional autocorrelation function is applied to digital cell pattern images and an orientational correlation parameter is calculated. Taking line profiles along the directions of highest correlation provides an unbiased method of determining the mean cell size in each of the two principal directions. By analyzing the width, amplitude and angular position of the orientational correlation plots, information can be extracted concerning the cellular pattern regularity, the relative angular correlation between two sets of transverse waves in two directions, and the mean shape or elongation of the cells within the pattern. The technique is applied to smoked foils from oxyacetylene mixtures with argon dilutions ranging from 0 to 75% to quantify the increase in regularity with argon dilution. This method provides a simple and useful way of analyzing cellular patterns and constitutes a promising technique for improving smoked foil diagnostics.     

Investigation of multiwavelength clock recovery based on heterodyne beats of sideband-filtered signal

We investigate a new parallel all-optical clock recovery scheme based on heterodyne beats of an optical sideband-filtered signal. The oscillating clock signal is recovered when the filtered sideband is combined with a stable local oscillator. The filtering is performed with an optical resonator, which by nature provides possibility for multiwavelength operation. The local oscillator could be realized by a multiwavelength laser, whose emission wavelengths are injection seeded with carrier wavelengths of the input data. The output signal of such a configuration benefits from a reduced bit-pattern effect and a stable offset level. The sideband filtering is demonstrated for 23 simultaneous channels at 100 GHz DWDM grid, each hosting a data stream of 10 Gbit/s.     

JPEG图像压缩对测量类图像的影响

在JPEG图像压缩的量化过程中,丢弃了部分高频信息,使图像的清晰度下降。通过对频谱的对照分析和对实际图像进行实验后表明,JPEG图像压缩对测量和处理结果的影响与原图像的特点、取样方式、滤波过程和压缩算法有关。经摄像机和图像卡获得的图像,其压缩比可达到10;经扫描仪获得的图像,其压缩比可达到6;经数码相机获得的图像,其压缩比可达到6～8;对特定的医学图像、晶相图像等来说,利用图像的特征构造最优匹配的JPEG压缩量化表,其压缩比可达到10。采用合适的压缩比和改进的压缩方法,图像的细节损失可以控制在较小的范围内,基本上不影响检测类图像的边界提取、分割、尺寸测量时的处理结果。     

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

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

Current R & D activities at TRCRE in polymer processing by EB

The current status of the R & D activities is presented on electron beam processing of polymers being carried out at TRCRE. Topics included are sterilization of medical products, graft polymers for selective separation or absorbents and curing of liquid prepolymer-monomer systems.