Azimuth resolution improvement for spaceborne SAR images with quasi-non-overlapped Doppler bandwidth

The azimuth resolution improvement problem is solved via a coherent combination of synthetic aperture radar （SAR） ima-ges with the quasi-non-overlapped Doppler bandwidth. Prior to the spectra combination, SAR images should be coregistered, while phase biases induced by topography, atmospheric propagation delays and baseline measurement errors should be calibrated. However, the coregistration accuracy suffers from large Doppler decorrelation caused by the quasi-non-overlapped Doppler band-width. Furthermore, the method used to estimate phase biases from interferogram of azimuth prefiltered SAR image pairs wil fail when there is no overlapped spectrum. The fringe simulation and maximum sharpness optimization are adopted to deal with the problems. Accordingly, a novel algorithm to coherently synthesize SAR images is presented. The experiment with the Terra SAR X-band （TerraSAR-X） satel ite data validates the performance of the presented method.     

Multi-label dimensionality reduction and classification with extreme learning machines

In the need of some real applications, such as text categorization and image classification, the multi-label learning gradually becomes a hot research point in recent years. Much attention has been paid to the research of multi-label classification algorithms. Considering the fact that the high dimensionality of the multi-label datasets may cause the curse of dimensionality and wil hamper the classification process, a dimensionality reduction algorithm, named multi-label kernel discriminant analysis （MLKDA）, is proposed to reduce the dimensionality of multi-label datasets. MLKDA, with the kernel trick, processes the multi-label integrally and realizes the nonlinear dimensionality reduction with the idea similar with linear discriminant analysis （LDA）. In the classification process of multi-label data, the extreme learning machine （ELM） is an efficient algorithm in the premise of good accuracy. MLKDA, combined with ELM, shows a good performance in multi-label learning experiments with several datasets. The experiments on both static data and data stream show that MLKDA outperforms multi-label dimensionality reduction via dependence maximization （MDDM） and multi-label linear discriminant analysis （MLDA） in cases of balanced datasets and stronger correlation between tags, and ELM is also a good choice for multi-label classification.     

Memetic algorithm for multi-mode resource-constrained project scheduling problems

A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.     

The generalized Serre problem over <Emphasis Type="Italic">K</Emphasis>-Hermite rings

This paper investigates the completion and the zero prime factorization for matrices over a K-Hermite ring. The authors have generalized Kaplansky’s related results, solved similar Lin-Bose problem and generalized Serre problem over a K-Hermite ring.     

Dual hesitant fuzzy information aggregation with Einstein t-conorm and t-norm

Dual hesitant fuzzy set (DHFS) is a new generalization of fuzzy set (FS) consisting of two parts (i.e., the membership hesitancy function and the non-membership hesitancy function), which confronts several different possible values indicating the epistemic degrees whether certainty or uncertainty. It encompasses fuzzy set (FS), intuitionistic fuzzy set (IFS), and hesitant fuzzy set (HFS) so that it can handle uncertain information more flexibly in the process of decision making. In this paper, we propose some new operations on dual hesitant fuzzy sets based on Einstein t-conorm and t-norm, study their properties and relationships and then give some dual hesitant fuzzy aggregation operators, which can be considered as the generalizations of some existing ones under fuzzy, intuitionistic fuzzy and hesitant fuzzy environments. Finally, a decision making algorithm under dual hesitant fuzzy environment is given based on the proposed aggregation operators and a numerical example is used to demonstrate the effectiveness of the method.     

Design of continuous long slot leaky-wave antenna for millimeter wave application

A simple and efficient design scheme of the continuous long slot leaky-wave antenna is developed. The key steps involved in the scheme are summarized. First, the cut-off frequencies of slot waveguides with different slot offsets are obtained by 3D finite-difference time-domain (FDTD) method. Second, the attenuation function αra is estimated by the aperture distribution, and the attenuation function αrs is determined by the slot radiation.Finally, the attenuation function αra is combined with the attenuation function αrs by the coefficient K. And an example in Ka band is presented. Moreover, the return loss of the E-plane Tee-junction (ET) and the radiation pattern of leaky-wave antenna are simulated. The scheme is verified by comparing with the experimental result.     

THE λ-GROBNER BASES UNDER POLYNOMIAL COMPOSITION

Polynomial composition is the operation of replacing variables in a polynomial with other polynomials. λ-Grgbner basis is an especial Grobner basis. The main problem in the paper is： when does composition commute with λ-Grobner basis computation？ We shall answer better the above question. This has a natural application in the computation of λ-Grobner bases.     

QFT control based on zero phase error compensation for flight simulator

To improve the robustness of high-precision servo systems, quantitative feedback theory (QFT) which aims to achieve a desired robust design over a specified region of plant uncertainty is proposed. The robust design problem can be solved using QFT but it fails to guarantee a high precision tracking. This problem is solved by a robust digital QFT control scheme based on zero phase error (ZPE) feed forward compensation. This scheme consists of two parts: a QFT controller in the closed-loop system and a ZPE feed-forward compensator. Digital QFT controller is designed to overcome the uncertainties in the system. Digital ZPE feed forward controller is used to improve the tracking precision. Simulation and real-time examples for flight simulator servo system indicate that this control scheme can guarantee both high robust performance and high position tracking precision.     

Researching and implementation of reconfigurable Hash chip based on FPGA

The reconfigurable cryptographic chip is an integrated circuit that is designed by means of the method of reconfigurable architecture, and is used for encryption and decryption. Many different cipher algorithms can be flexibly implemented with the aid of a reconfigurable cryptographic chip and can be used in many fields. This article takes an example for the SHA-1/224/256 algorithms, and then designs a reconfigurable cryptographic chip based on the thought and method of the reconfigurable architecture. Finally, this paper gives the implementation result based on the FPGA of the family of Stratix II of Altera Corporation, and presents a good research trend for resolving the storage in hardware implementation using FPGAs.     

Ad hoc distributed mutual exclusion algorithm based on token-asking

The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME (Ad Hoc Distributed Mutual Exclusion); it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport's timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.