A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length

A parallel strategy for solving multidimensional tridiagonal equations is investigated in this paper. We present in detail an improved version of single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication cost. We show the resulting block SPP can achieve good speedup for a wide range of message vector length (MVL), especially when the number of grid points in the divided direction is large. Instead of only using the largest possible MVL, we adopt numerical tests and modeling analysis to determine an optimal MVL so that significant improvement in speedup can be obtained.

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.

Electric and magnetic losses and gains in determining the sign of refractive index

Within the framework of classic electromagnetic theories, we have studied the sign of refractive index of optical medias with the emphases on the roles of the electric and magnetic losses and gains. Starting from the Maxwell equations for an isotropic and homogeneous media, we have derived the general form of the complex refractive index and its relation with the complex electric permittivity and magnetic permeability, i.e. n = root epsilon mu, in which the intrinsic electric and magnetic losses and gains are included as the imaginary parts of the complex permittivity and permeability, respectively, as epsilon = epsilon(r) + i(epsilon i) and mu = mu(r) + i mu(i). The electric and magnetic losses are present in all passive materials, which correspond, respectively, to the positive imaginary permittivity and permeability epsilon(i) > 0 and mu(i) > 0. The electric and magnetic gains are present in materials where external pumping sources enable the light to be amplified instead of attenuated, which correspond, respectively, to the negative imaginary permittivity and permeability epsilon(i) < 0 and mu(i) < 0. We have analyzed and determined uniquely the sign of the refractive index, for all possible combinations of the four parameters epsilon(r), mu(r), epsilon(i), and mu(i), in light of the relativistic causality. A causal solution requires that the wave impedance be positive Re {Z} > 0. We illustrate the results for all cases in tables of the sign of refractive index. One of the most important messages from the sign tables is that, apart from the well-known case where simultaneously epsilon < 0 and mu < 0, there are other possibilities for the refractive index to be negative n < 0, for example, for epsilon(r) < 0, mu(r) > 0, epsilon(i) > 0, and mu(i) > 0, the refractive index is negative n < 0 provided mu(i)/epsilon(i) > mu(r)/vertical bar epsilon(r)vertical bar. (c) 2006 Elsevier B.V. All rights reserved.

基于Gabor小波特征确认多媒体消息数字水印版权标识

为解决基于数字水印的无线多媒体消息版权管理系统对提取后水印标识的自动识别问题,在充分考虑多媒体消息在传播中可能遭受攻击的基础上,提出一种基于Gabor小波特征的标识确认方案.该方案利用这类小波函数确定的滤波器适合局部分析和多方向多尺度分析的特点,提取与水印版权标识结构信息相关的统计量,形成特征集向量,通过特征集的距离比较,在小尺寸水印质量退化情况下,实现了对水印标识的识别.分析和实验表明,该方案能够满足无线多媒体消息版权管理的需求,并且在文中分析的情况下,设备的自动识别精度可以达到95%以上,较好地支持了对无线多媒体消息的版权管理.

gcs-ma: a group communication system for mobile agents

Reliable messaging is a key component necessary for mobile agent systems. Current researches focus on reliable one-to-one message delivery to mobile agents. But how to implement a group communication system for mobile agents remains an open issue, which is a powerful block that facilitates the development of fault-tolerant mobile agent systems. In this paper, we propose a group communication system for mobile agents (GCS-MA), which includes totally ordered multicast and membership management functions. We divide a group of mobile agents into several agent clusters,and each agent cluster consists of all mobile agents residing in the same sub-network and is managed by a special module, named coordinator. Then, all coordinators form a ring-based overlay for interchanging messages between clusters. We present a token-based algorithm, an intra-cluster messaging algorithm and an inter-cluster migration algorithm to achieve atomicity and total ordering properties of multicast messages, by building a membership protocol on top of the clustering and failure detection mechanisms. Performance issues of the proposed system have been analysed through simulations. We also describe the application of the proposed system in the context of the service cooperation middleware (SCM) project.

基于匹配追踪方法的地震信号时频分析研究

Seismic signal is a typical non-stationary signal, whose frequency is continuously changing with time and is determined by the bandwidth of seismic source and the absorption characteristic of the media underground. The most interesting target of seismic signal’s processing and explaining is to know about the local frequency’s abrupt changing with the time, since this kind of abrupt changing is indicating the changing of the physical attributes of the media underground. As to the seismic signal’s instantaneous attributes taken from time-frequency domain, the key target is to search a effective, non-negative and fast algorithm time-frequency distribution, and transform the seismic signal into this time-frequency domain to get its instantaneous power spectrum density, and then use the process of weighted adding and average etc. to get the instantaneous attributes of seismic signal. Time-frequency analysis as a powerful tool to deal with time variant non-stationary signal is becoming a hot researching spot of modern signal processing, and also is an important method to make seismic signal’s attributes analysis. This kind of method provides joint distribution message about time domain and frequency domain, and it clearly plots the correlation of signal’s frequency changing with the time. The spectrum decomposition technique makes seismic signal’s resolving rate reach its theoretical level, and by the method of all frequency scanning and imaging the three dimensional seismic data in frequency domain, it improves and promotes the resolving abilities of seismic signal vs. geological abnormal objects. Matching pursuits method is an important way to realize signal’s self-adaptive decomposition. Its main thought is that any signal can be expressed by a series of time-frequency atoms’ linear composition. By decomposition the signal within an over completed library, the time-frequency atoms which stand for the signal itself are selected neatly and self-adaptively according to the signal’s characteristics. This method has excellent sparse decomposition characteristics, and is widely used in signal de-noising, signal coding and pattern recognizing processing and is also adaptive to seismic signal’s decomposition and attributes analysis. This paper takes matching pursuits method as the key research object. As introducing the principle and implementation techniques of matching pursuits method systematically, it researches deeply the pivotal problems of atom type’s selection, the atom dictionary’s discrete, and the most matching atom’s searching algorithm, and at the same time, applying this matching pursuits method into seismic signal’s processing by picking-up correlative instantaneous messages from time-frequency analysis and spectrum decomposition to the seismic signal. Based on the research of the theory and its correlative model examination of the adaptively signal decomposition with matching pursuit method, this paper proposes a fast optimal matching time-frequency atom’s searching algorithm aimed at seismic signal’s decomposition by frequency-dominated pursuit method and this makes the MP method pertinence to seismic signal’s processing. Upon the research of optimal Gabor atom’s fast searching and matching algorithm, this paper proposes global optimal searching method using Simulated Annealing Algorithm, Genetic Algorithm and composed Simulated Annealing and Genetic Algorithm, so as to provide another way to implement fast matching pursuit method. At the same time, aimed at the characteristics of seismic signal, this paper proposes a fast matching atom’s searching algorithm by means of designating the max energy points of complex seismic signal, searching for the most optimal atom in the neighbor area of these points according to its instantaneous frequency and instantaneous phase, and this promotes the calculating efficiency of seismic signal’s matching pursuit algorithm. According to these methods proposed above, this paper implements them by programmed calculation, compares them with some open algorithm and proves this paper’s conclusions. It also testifies the active results of various methods by the processing of actual signals. The problems need to be solved further and the aftertime researching targets are as follows: continuously seeking for more efficient fast matching pursuit algorithm and expanding its application range, and also study the actual usage of matching pursuit method.