Deep‐UV Photochemistry and Patterning of (Aminoethylaminomethyl)phenethylsiloxane Self‐Assembled Monolayers

The 193 nm photochemistry of (aminoethylaminomethyl)phenethylsiloxane (PEDA) self‐assembled monolayers (SAMs) under ambient conditions is described. The primary photodegradation pathways at low exposure doses (< 100 mJ cm^–2) are benzylic C–N bond cleavage (ca. 68 %), with oxidation of the benzyl C to the aldehyde, and Si–C bond cleavage (ca. 32 %). Amine‐containing photoproducts released from the SAM during exposure remain physisorbed on the surface, where they undergo secondary photolysis leading to their complete degradation and removal after ca. 1200 mJ cm^–2. NaCl(aq) post‐exposure rinsing removes the physisorbed materials, showing that degradation of the original PEDA species (leaving Si–OH) is substantially complete after ca. 450 mJ cm^–2. Consequently, patterned, rinsed PEDA SAMs function as efficient templates for fabrication of high‐resolution, negative‐tone, electroless metal and DNA features with good selectivity at low dose (i.e., ca. 400 mJ cm^–2) via materials grafting to the intact amines remaining in the unirradiated PEDA SAM regions.     

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.     

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.     

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.     

Programmable group-delay module using binary polarization switching

We demonstrate the first programmable group-delay module based on polarization switching. With a unique binary tuning mechanism, the device can generate any differential group delay value from -45 to +45 ps with a resolution of 1.40 ps, or any true-time-delay value from 0 to 45 ps with a resolution of 0.7 ps. The delay varying speeds for both applications are under 1 ms and can be as fast as 0.1 ms. We evaluate both the dynamic and static performances of the device while paying special attention to its dynamic figures of merit for polarization-mode dispersion emulation and compensation applications. Our experiment shows that the device exhibits a negligible transient-effect induced power penalty (<0.2 dB) in a 10-Gb/s nonreturn-to-zero system.