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.     

基于Delphi的文本数据文件的处理

介绍了IP话费查询系统，针对系统的文本数据文件导入数据库模块和基于用户名的话费查询模块的关键技术作了详细的分析。同时着重介绍了一种采用Delphi开发软件将话单文本文件导入数据库的方法，实验结果表明此方法易于系统管理人员的操作，也使得系统具有较高的灵活性和可靠性。     

Formation of ordered microporous films with water as templates from poly(D,L‐lactic‐co‐glycolic acid) solution

Recently a method that uses water droplets at the air–solution interface as an ordered template was reported for the preparation of ordered micrometer‐size honeycomb structures. Here we show that the method can also be used for formation of honeycomb‐like porous films from random copolymers with certain hydrophilicity, besides those polymers with defined structures such as block copolymers, starlike homopolymers, amd amphiphilic polymers. This demonstrates that the stabilization of water droplets is the key factor for the regular structure. Also we indicate that size and structure of the films can be regulated by such variables as concentration and atmospheric humidity. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 90: 1846–1850, 2003     

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

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

某半导体产品的设计和快速实现研究

研究了产品开发及快速实现过程中任务获取、任务分配、进度的协调、信息传输等相关问题,并以某半导体产品为例,进行了产品的设计和快速实现,为缩短产品开发和上市周期、提高产品的市场竞争力积累经验。     

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.     

Effect of Substrate Bias on Microstructure and Properties of Tetrahedral Amorphous Carbon Films

The microstructure and properties of tetrahedral amorphous carbon (ta-C) films deposited by the filtered cathodic vacuum arc technology has been investigated by visible Raman spectroscopy, AFM and Nano-indentor. The Raman spectra have been fitted with a s     

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.