Measurement of surface topography by RGB Shadow-Moiré with direct phase demodulation

In this paper we present the application of a direct demodulation method for the measurement of surface topography by means of Shadow-Moiré. In our set-up, we use three LEDs (with green, red and blue peak wavelengths) to illuminate the grating. Due to the different position of these light sources, a polychromatic Shadow-Moiré fringe pattern is produced, which can be described as the superposition of three monochromatic (red, green and blue) fringe patterns. Taking the image of this polychromatic fringe pattern with a RGB CCD camera, we get a monochromatic fringe pattern stored at each RGB channel of the CCD. The direct demodulation algorithm employed uses these fringe patterns to calculate the wrapped phase map. After unwrapping the phase map using a standard multi-grid technique, we implemented an automatic procedure to detect the area of interest of the phase map by removing low modulation zones and to calculate the absolute value of the phase. In this way it is possible to determine the topography of a surface with a single RGB snapshot maintaining a simple experimental set-up, which is an important feature, especially for the study of dynamic phenomena such as deformations. We present the experimental results obtained after measuring different objects with both smooth and rough surface textures.     

线性方程组异步并行迭代法的舍入误差分析

本文对求解大型线性方程组的异步并行迭代法进行了浮点运算的舍入误差分析,给出了算法是向前稳定的充分条件.     

矩阵多分裂迭代法的收敛条件

本文给出了求解非奇异线性方程组的矩阵多分裂并行迭代法的一些新的收敛结果.当系数矩阵单调和多分裂序列为弱正则分裂时,得到了几个与已有的收敛准则等价的条件,并且证明了异步迭代法在较弱条件下的收敛性.对于同步迭代,给出了与异步迭代不同且较为宽松的收敛条件.     

Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent processes. Removing the synchronization constraint has the potential of speeding up the computation, while maintaining greater computation flexibility (e.g. differences in processors speed; differences in the data input to processors). We construct asynchronous (AS) finite difference schemes for the solution of PDEs by removing the synchronization constraint. We analyze the numerical properties of these schemes. Based on the analysis, we develop corrected-asynchronous (CA) finite difference schemes which are specifically constructed for an asynchronous processing. We present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although our discussion concentrates on the Euler scheme it should serve only as a sample, as it can be extended to other schemes and other PDEs.These schemes are implemented on the shared-memory multi-userSequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that synchronization penalty can be about 50% of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time-level, and with the problem dimension. The efficiency of the AS may reach 90% and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient but provides more accurate results for intermediate (non steady-state) values. The results show the potential of developing asynchronous finite deference schemes for steady-state as well as non steadystate problems.This research was partially supported by a grant from The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.A reduced version of the paper was presented at the 4th SIAM Conference on Parallel Processing for Scientific Computing, Dec. 11–13, 1989, Chicago, USA.The work by this author was supported by research grant 337 of the Israeli National Council for Research and Development in the years 1990–1991.This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NASI-18107 while the author was in residence at the Institute for Computer Applications in Sciences and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665, USA.     

Stabilization of switched linear systems using an improved event-triggered control scheme

This paper is concerned with the event-triggered control of switched linear systems. The coupling of system switching and event-triggered communication raises two phenomena: (1) the update of controller cannot always catch up with the active subsystem; (2) the switching may lead to additional triggers. The first phenomenon is called the asynchronous switching induced by network communication and the second one brings great difficulty to avoid the Zeno behavior of event-triggered mechanism (ETM). To address the above problem, we propose a new ETM which contains the switching signal of models and controllers and the discontinuity of triggering error at switching time instants. A relative threshold strategy, combined with a jump function, is designed as a new threshold function. By introducing a compensation term, the linear feedback control law is extended to avoid the Zeno behavior of ETM and improve the solvability of control algorithm. Based on the proposed event-triggered control scheme, the exponential stabilization of switched systems is achieved with relaxed constraints on the triggering and switching conditions. The obtained results are validated by a numerical example.     

Controllability and stabilization of periodic switched Boolean control networks with application to asynchronous updating

This paper investigates the periodic switching point controllability and stabilization of periodic switched Boolean control networks (PSBCNs), and applies the obtained results to the stabilization of deterministic asynchronous Boolean control networks (DABCNs). Firstly, using the algebraic state space representation of PSBCNs, a kind of periodic switching point controllability matrix is constructed, based on which, a necessary and sufficient condition is presented for the periodic switching point reachability and controllability of PSBCNs. Secondly, using the reachable set of PSBCNs, a constructive procedure is proposed to design time-variant state feedback controllers for the periodic switching point stabilization of PSBCNs. Finally, by converting the dynamics of DABCNs into the form of PSBCNs, the time-variant state feedback stabilization problem of DABCNs is solved.     

Sampled-data distributed protocol for coordinated aggregation of multi-agent systems subject to communication delays

This paper studies the coordinated aggregation problem of a multi-agent system. Particularly, all the agents reach a consensus within a pre-specified target region. However, only a subset of agents have access to this target region, and each agent merely interacts with its neighbors by communication. Moreover, there exist unknown heterogeneous delays in communication channels. The underlying communication topology is characterized by a digraph. To accommodate the practical digital disposal, a sampled-data distributed protocol is proposed, where the sampling is asynchronous in the sense that the sampling periods of distinct agents are heterogeneous. The resulting closed-loop system from the proposed sampled-data distributed protocol is in a hybrid fashion that the continuous system is fed-back by using discrete states at sampling instants. The convergence performance of this hybrid closed-loop system is analyzed based on the contraction theory. More specifically, it is first shown that all the states are coordinated to aggregate within the target region, i.e., coordinated aggregation. With this result, it is next shown that all the states are coordinated towards a consensus, i.e., state agreement. These together guarantee the fulfillment of the concerned coordinated aggregation objective. Finally, a simulation example is given to validate the theoretical results.     

10-Gbit/s Serial Optical Interconnection for an ATM Switch

Serial optical interconnection is proposed for connections in a Torus asynchronous transfer mode switch. A cross-point switch was developed that operates at a bit rate of 20 Gbit/s. The switching operation was successfully performed using cascaded cross-point switches through an optical interconnection configuration consisting of commercial optoelectronics devices. The measured switching rate was 10 Gbit/s, and it was limited by the responses of the optoelectronics devices.     

A NEW GENERALIZED ASYNCHRONOUS PARALLEL MULTISPLITTING ITERATION METHOD

1.IntroductionTosolvelargesparsesystemsoflinearandnonlinearequationsonthemultiprocessorsystems,manyauthorspresentedandstudiedvariousparalleliterativemethodsinthesenseofmultisplittinginrecentyears.FOrdetailsonecanreferto[1]-[9]andreferencestherein.Amo...     

智能建筑中图像视频处理信息传递系统

介绍了安徽省重点实验室——智能建筑实验室中自行研制的智能建筑图像视频处理信息传递系统。研究基于IEEE1394串行总线的DSP双向数据传输系统技术,在系统硬件结构描述基础上详细分析系统的数据流向与工作流程。在异步传输和等时传输的实现过程中给出了具体的链路层控制芯片的端口选择问题和等时传输过程中对信道、带宽的申请、占用、释放方法。