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.     

Second Order Nonlinear Evolution Inclusions Ⅰ： Existence and Relaxation Results

This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x（t） and x（t）. In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 （T, H）. Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 （T, H） to the solutions of the original convex problem （strong relaxation）. An example of a nonlinear hyperbolic optimal control problem is also discussed.     

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

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

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

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

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

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

用频域法实现圆环形目标物的计数

研究了用频域法实现圆环形目标物计数的方法。对空域中含有圆环形目标物的二值图像，经傅里叶变换后在频域内进行滤波，再经傅里叶反变换后取一阈值进行处理，则对应于圆环形目标物即变为一个实心体，然后对实心体进行计数即可实现对圆环形目标物的计数。对该方法进行了数学描述，并分别用模拟图像和实际图像进行了实验。结果表明，该方法消除噪声的效果好，对部分封闭圆的检测同样有效，且可用于目标物有粘连的情况。该方法对圆环形目标物的尺寸相差不大的情况更为有效。     

Parallelization of population-based multi-objective meta-heuristics: An empirical study

In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup.     

Preparation and characterization of ZnO nanorods from NaOH solutions with assisted electrical field

ZnO naorods on ZnO-coated seed substrates were fabricated by solution chemical method from Zn(NO₃)₂/NaOH under assisted electrical field. The working mechanism of electrical field was analyzed and the factors affecting the rod growth such as potential, precursor concentration and growth temperature were elucidated. The structural and optical properties are characterized by SEM, TEM, XRD, HRTEM and UV-vis. The results indicated that the nanorods have wurtzite structure without electrical field and are primarily of zincite structure under electrical field; when the electrical field is 1.1-1.3 V, not only the elevation of ion diffusion and adsorption lower the crystallite/solution interfacial energy and then the crystal nucleation barrier by increasing charge intensity, but also the production of H⁺ through oxidation of OH⁻ increases properly the degree of solution supersaturation near the substrate, and thus lowers the activation energy. Both the two processes do favor to rod growth. With increasing precursor concentration in this system, the average diameter and length of ZnO nanorods increase, leading to decreasing of optical transmittance. The maximum rod growth rate at given concentration of Zn²⁺ occurs at a specific temperature.     

Fuzzy矩阵方程的摄动问题

讨论了Fuzzy矩阵A的同解简化矩阵A^(2)，指出陈贻源论文《解Fuzzy关系方程》中定量3的错误。研究Fuzzy矩阵方程的摄动问题，解决了汤服成（2000）提出的未解决问题。     

用多焦点全息透镜实现多重谱分数傅里叶变换

提出用多焦点全息透镜实现多重谱分数傅里叶变换.利用全息方法通过一次曝光制作出多焦点的全息透镜,分析了用此全息元件实现这种变换的条件,并在实验上实现了多重谱分数傅里叶变换. 实验结果表明这种变换方法简便可行,可广泛应用于多通道光学信息处理系统及多目标图像识别系统中.