Photon iterative numerical technique for steady-state simulation of gain-clamped semiconductor optical amplifiers

The photon iterative numerical technique, which chooses the outputs of the amplified spontaneous emission spectrum and lasing mode as iteration variables to solve the rate equations, is proposed and applied to analyse the steady behaviour of conventional semiconductor optical amplifiers (SOAs) and gain-clamped semiconductor optical amplifiers (GCSOAs). Numerical results show that the photon iterative method is a much faster and more efficient algorithm than the conventional approach, which chooses the carrier density distribution of the SOAs as the iterative variable. It is also found that the photon iterative method has almost the same computing efficiency for conventional SOAs and GCSOAs.

节能有效的无线传感器网络状态信息收集算法

网络状态信息收集协议既要保证信息收集的准确性、实时性,又要保证协议算法的轻量级特性。为解决上述矛盾问题,提出了一种轻量级的、能量有效的、基于无损聚合的层次分簇数据收集机制(QTBDC)。QTBDC首先对网络节点编码并在节点间建立起一个逻辑层次簇结构,然后利用各个子簇状态数据的相似性和编码的连续性,实现了网内无损聚合。该监测机制使得网络状态信息的收集在不丢失数据细节信息的情况下,数据通信量大大减少。经过仿真分析表明,该方法与现有经典数据收集方法相比,实现了节能,延长了网络的生命期。

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

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.

Optimization of single attosecond x-ray pulses by genetic algorithm control of the chirp and initial phase of 5 fs laser pulses

We show that the peak intensity of single attosecond x-ray pulses is enhanced by 1 or 2 orders of magnitude, the pulse duration is greatly compressed, and the optimal propagation distance is shortened by genetic algorithm optimization of the chirp and initial phase of 5 fs laser pulses. However, as the laser intensity increases, more efficient nonadiabatic self-phase matching can lead to a dramatically enhanced harmonic yield, and the efficiency of optimization decreases in the enhancement and compression of the generated attosecond pulses. (c) 2006 Optical Society of America.

A VSLMS Style Tap-length Learning Algorithm for Structure Adaptation

Compared with the ordinary adaptive filter, the variable-length adaptive filter is more efficient (including smaller., lower power consumption and higher computational complexity output SNR) because of its tap-length learning algorithm, which is able to dynamically adapt its tap-length to the optimal tap-length that best balances the complexity and the performance of the adaptive filter. Among existing tap-length algorithms, the LMS-style Variable Tap-Length Algorithm (also called Fractional Tap-Length Algorithm or FT Algorithm) proposed by Y.Gong has the best performance because it has the fastest convergence rates and best stability. However, in some cases its performance deteriorates dramatically. To solve this problem, we first analyze the FT algorithm and point out some of its defects. Second, we propose a new FT algorithm called 'VSLMS' (Variable Step-size LMS) Style Tap-Length Learning Algorithm, which not only uses the concept of FT but also introduces a new concept of adaptive convergence slope. With this improvement the new FT algorithm has even faster convergence rates and better stability. Finally, we offer computer simulations to verify this improvement.

Efficient HOG human detection

While Histograms of Oriented Gradients (HOG) plus Support Vector Machine (SVM) (HOG+SVM) is the most successful human detection algorithm, it is time-consuming. This paper proposes two ways to deal with this problem. One way is to reuse the features in blocks to construct the HOG features for intersecting detection windows. Another way is to utilize sub-cell based interpolation to efficiently compute the HOG features for each block. The combination of the two ways results in significant increase in detecting humans-more than five times better. To evaluate the proposed method, we have established a top-view human database. Experimental results on the top-view database and the well-known INRIA data set have demonstrated the effectiveness and efficiency of the proposed method. (C) 2010 Elsevier B.V. All rights reserved.