Hardware-software architecture of the SWAN Wireless ATM network

The SWAN (Seamless Wireless ATM Network) system provides end-to-end ATM connectivity to mobile end-points equipped with RF transceivers for wireless access. Users carrying laptops and multimedia terminals can seamlessly access multimedia data over a backbone wired network while roaming among room-sized cells that are equipped with basestations. The research focus on how to make ATM mobile and wireless distinguishes SWAN from present day mobile-IP based wireless LANs. This paper describes the design and implementation of the ATM-based wireless last-hop, the primary components of which are the air-interface control, the medium access control, and the low-level ATM transport and signalling.The design is made interesting by its interplay with ATM; in particular, by the need to meaningfully extend over the wireless last-hop the service quality guarantees made by the higher level ATM layers. The implementation, on the other hand, is an example of hardware-software co-design and partitioning. A key component of the wireless hop implementation is a custom designed reconfigurable wireless adapter card called FAWN (Flexible Adapter for Wireless Networking) which is used at the mobiles as well as at the basestations. The functionality is partitioned three-way amongst dedicated reconfigurable hardware on FAWN, embedded firmware on FAWN, and device driver software on a host processor. Using an off-the-shelf 625 Kbps per channel radio, several of which can be supported by a single FAWN adapter to provide multiple channels, per-channel unidirectional TCP data throughput of 227 Kbps (or, 454 Kbps bidirectional) and per-channel unidirectional native ATM data throughput of 210 Kbps (or, 420 Kbps bidirectional) have been obtained.     

On the trade-off between energy efficiency and estimation error in compressive sensing

Compressive sensing (CS) refers to the process of reconstructing a signal that is supposed to be sparse or compressible. CS has wide applications, such as in cognitive radio networks. In this paper, we investigate effective CS schemes for the trade-off between energy efficiency and estimation error. We propose an enhancement to a Bayesian estimation approach and an enhancement to the isotonic regression approach that is based on nearly isotonic regression. We also show how to compute the routing matrix for selecting active sensor nodes. The proposed enhancements are evaluated with trace-driven simulations. Considerable gaps are observed between the original approaches and the proposed enhancements in the simulation results. The near isotonic regression method achieves the best performance among all the CS schemes examined in this paper.     

Connected graphs switching equivalent to their iterated line graphs

In this paper, the problem of determining graphs which are switching equivalent to at least one of their iterated line graphs is considered, and such connected graphs are characterized.     

CURE CHARACTERISTICS OF HYDROXYL TERMINATED POLYBUTADIENE PREPOLYMER WITH BLOCKED TOLUENE DIISOCYANATE-Ⅱ

<正> Cure characteristics of hydroxyl terminated polybutadiene （HTPB） prepolymer with avariety of blocked toluene diisocyanate （TDI） in the presence of triethylamine （TEA） andchloroacetic acid catalyst are reported. Phenol, thiophenol, p-chloropheno1, p-nitrophenol,p-cresol, resorcinol, naphthols, caprolactam and butylated-hydroxytoluene were used as blockingagents. Viscosity measurements have been carried out using a mixture of HTPB and blocked TDIin cyclohexanone in the presence of the catalysts at 50℃ and 60℃ using Haake rotational vis-cometer. Viscosity measurements have also been carried out with 50% solids such as ammonium sulphate along with HTPB and TDI adduct.     

CuI/l-proline-catalyzed selective one-step mono-acylation of styrenes and stilbenes

Vicinal di-oxygenation of styrene-type olefins was achieved with cheaper, less toxic CuI in the presence of l-proline as ligand and NaIO₄ as the oxidant. This approach provides a straightforward and efficient access to mono-acylated diols from both styrene and stilbene derivatives with good to excellent yields and diastereoselectivity.     

Syntheses of Novel 3-Substituted-2′-deoxy-3-deazauridine Nucleosides

Syntheses of novel 3-ethynyl (8), 3-vinyl (10) and 3-acetoxy (13)-2′-deoxy-3-deazauridine analogs starting from the protected 2′-deoxy-3-deazauridine derivative 4 are described.     

The optimistic update theorem for path delay testing in sequential circuits

For sequential circuit path delay testing, we propose a new update rule for state variables whereby flipflops are updated with their correct values provided they are destinations of at least one robustly activated path delay fault. Existing algorithms in the literature, for robust fault simulation and test generation, assign unknown values to off-path latches that have non-steady signals at their inputs in the previous vector. Such procedures are pessimistic and predict low fault coverages. They also have an adverse effect on the execution time of fault simulation especially if the circuit has a large number of active paths. The proposed update rule avoids these problems and yet guarantees robustness.     

Power Estimation Using Probability Polynomials

We describe a method of polynomial simulation to calculate switching activities in a general-delay logic circuit. This method is a generalization of the exact signal probability evaluation method due to Parker and McCluskey, which has been extended to handle temporal correlation and arbitrary transport delays. The method can target both combinational and sequential circuits.Our method is parameterized by a single parameter l, which determines the speed-accuracy tradeoff. l indicates the depth in terms of logic levels over which spatial signal correlation is taken into account. This is done by only taking into account reconvergent paths whose length is at most l. The rationale is that ignoring spatial correlation for signals that reconverge after many levels of logic introduces negligible error. When l = L, where L is the total number of levels of logic in the circuit, the method will produce the exact switching activity under a zero delay model, taking into account all internal correlation.We present results that show that the error in the switching activity and power estimates is very small even for small values of l. In fact, for most of the examples, power estimates with l = 0 are within 5% of the exact. However, this error can be higher than 20% for some examples. More robust estimates are obtained with l = 2, providing a good compromise between speed and accuracy.