A digital secure image communication scheme based on the chaotic Chebyshev map

In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained by computer simulation indicate that the transmitted source image can be correctly and reliably recovered using the proposed scheme, even through a noisy channel. Notably, the scheme possesses relatively high security and can be easily implemented. Moreover, the quality of the recovered image is satisfactory, quantified by such common criteria as the bit‐error rate performance. Copyright © 2004 John Wiley & Sons, Ltd.     

尖晶石型软磁铁氧体纳米材料的制备研究进展

介绍了软磁铁氧体纳米材料的特性,综述了近年来具有尖晶石结构的软磁铁氧体纳米材料的制备方法。其中包括:化学共沉淀法,水热法,溶胶-凝胶法,喷雾热解法,微乳液法,相转化法,超临界法,冲击波合成法,微波场下湿法合成,爆炸法,高能球磨法,自蔓延高温合成法等。详细介绍了各种制备方法的特点,研究进展及其发展趋势。     

Measurement of gain spectrum for Fabry-Perot semiconductor lasers by the Fourier transform method with a deconvolution process

To improve the accuracy of measured gain spectra, which is usually limited by the resolution of the optical spectrum analyzer (OSA), a deconvolution process based on the measured spectrum of a narrow linewidth semiconductor laser is applied in the Fourier transform method. The numerical simulation shows that practical gain spectra can be resumed by the Fourier transform method with the deconvolution process. Taking the OSA resolution to be 0.06, 0.1, and 0.2 nm, the gain-reflectivity product spectra with the difference of about 2% are obtained for a 1550-nm semiconductor laser with the cavity length of 720 /spl mu/m. The spectra obtained by the Fourier transform method without the deconvolution process and the Hakki-Paoli method are presented and compared. The simulation also shows that the Fourier transform method has less sensitivity to noise than the Hakki-Paoli method.     

超深亚微米非对称Halo LDD低功耗新器件的研究分析

提出了一种新的器件结构——非对称Halo L DD低功耗器件,该器件可以很好地抑制短沟效应,尤其可以很好地改善DIBL效应、热载流子效应以及降低功耗等,是低功耗高集成度电路的优选结构之一.分析了非对称HaloL DD器件的主要特性,并将其与常规结构、非对称L DD结构、非对称Halo结构的器件进行了比较并进行了参数优化分析.     

Ionizing-Radiation Response of the GaAs/(Al, Ga)As PHEMT: A Comparison of Gamma- and X-ray Results

An experiment is reported on the effect of ⁶⁰Co gamma rays or 45-keV x-ray photons on the GaAs/(Al, Ga)As PHEMT. It is shown that x-ray treatment can improve the dc performance of the device in some cases. This finding is attributed in part to the annealing or modification of DX centers.     

一种简单的S参数去嵌入技术

介绍了在低成本夹具上，任意微带结构二端口网络S参数去嵌入的方法；该方法用于获取放大器模块的S参数，根据这些参数设计的C波段的放大器实测结果与仿真一致。     

利用C++Builder 5.0开发原理框图绘图软件

介绍了原理框图各种图形的数据存储方法，利用C^ Builder5.0开发了原理框图的绘图软件，实现了原理框图绘制的基本功能。     

Medium access protocol design for delay-guaranteed multicode CDMA multimedia networks

To enable multimedia real-time applications over next-generation wireless code-division multiple access (CDMA) packet-switching networks, previous efforts show a proper scheduling policy is the key to provide delay-guaranteed access services to various traffic types with different bit error rate (BER) requirements. Considering the support of the prevailing Internet protocol (IP) with variable-length packets in future mobile networks, we develop a mathematically delay-optimal medium access control (MAC) protocol over multicode CDMA (MC-CDMA) environments under the continuous-time assumption. From our investigations, we suggest that a good MAC protocol should be designed by using a proper single-server scheduling policy to guarantee packet-delay, and controlling the maximal number of simultaneous spreading-code transmissions to maintain the required BER. We further evaluate the performance of some MC-CDMA MAC protocols supporting QoS on BER and packet-delay, and show that MAC schemes conforming to our design rules give better performance on packet-delay when maintaining acceptable BER of various traffic types.     

Efficient OVSF code assignment and reassignment strategies in UMTS

This paper presents an integrated solution for code management, assignment, and reassignment problems in UMTS. We propose a new architecture for code management and, based upon this new architecture, a code assignment strategy, referred to as "crowded-group first strategy". Our system architecture and code assignment strategy represent significant improvements both in the time complexity and the maintenance complexity. Moreover, the code blocking probability of the crowded-group first strategy is competitive to that of the other strategies. In this paper, we also propose a new code reassignment strategy, called the "crowded-branch first strategy". The main objective of this reassignment strategy is to reduce reassigned call probability with low computation overhead and extend this strategy for the general case. In order to systematically analyze the performances of the code assignment strategy, we implement a simulator to analyze the code selection behavior and code blocking probability of each strategy. Moreover, we propose some new performance metrics, named "weighted code blocking", "reassigned call probability", and "ratio of actual code reassignments", in order to precisely measure the performance obtained by different strategies. From the simulation results, we show that our proposed strategies efficiently utilize the OVSF codes with low computation overhead.     

Courtesy piggybacking: supporting differentiated services in multihop mobile ad hoc networks

Due to the salient characteristics such as the time-varying and error-prone wireless links, the dynamic and limited bandwidth, the time-varying traffic pattern and user locations, and the energy constraints, it is a challenging task to efficiently support heterogeneous traffic with different quality of service (CoS) requirements in multihop mobile ad hoc networks. In the last few years, many channel-dependent mechanisms are proposed to address this issue based on the cross-layer design philosophy. However, a lot of problems remain before more efficient solutions are found. One of the problems is how to alleviate the conflict between throughput and fairness for different prioritized traffic, especially how to avoid the bandwidth starvation problem for low-priority traffic when the high-priority traffic load is very high. In this paper, we propose a novel scheme named Courtesy Piggybacking to address this problem. With the recognition of interlayer coupling, our Courtesy Piggybacking scheme exploits the channel dynamics and stochastic traffic features to alleviate the conflict. The basic idea is to let the high-priority traffic help the low-priority traffic by sharing unused residual bandwidth with courtesy. Another noteworthy feature of the proposed scheme is its implementation simplicity: The scheme is easy to implement and is applicable in networks using either reservation-based or contention-based MAC protocols.