Efficient encoding of IEEE 802.11n LDPC codes

Addressed is the issue of LDPC coding for the emerging IEEE 802.11n standard. An efficient encoding algorithm is proposed. The algorithm is simple and easy to implement. The memory requirement is trivial     

Synergistic interaction of D1 and D2 dopamine receptors in the modulation of the reinforcing effect of brain stimulation.

Rats were trained to press a bar for hypothalamic stimulation, and a frequency-response function was plotted. Quinpirole (a selective D2 agonist) facilitated self-stimulation when injected alone but failed to show the facilitatory effect when injected either 1 hr before or 1 hr after injection of SCH 23390 (a D1 antagonist). Injection of reserpine followed by α-methyl-p-tyrosine virtually eliminated self-stimulation. Subsequent injection of either SKF 38393 (a D1 agonist) alone or quinpirole alone did not restore self-stimulation, but a combination of quinpirole and SKF 38393 did. Results suggest that a D2 dopamine agonist facilitates the reinforcing effect of brain stimulation only if D1 receptors are activated by endogenous dopamine or by an exogenous agonist. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Proposed modification to the CIECAM02 colour appearance model to include the simultaneous contrast effects

A modified CIECAM02 colour appearance model, named CIECAM02‐m2, is proposed to enable CIECAM02 to predict the simultaneous contrast effect. The structure of the CIECAM02‐m2 is a development from CIECAM02, and contains two different procedures for modifying the reference white; one is for lightness and the other is for hue. The model was tested using a data set accumulated in this study and the LUTCHI data. The CV values for three colour attributes between predictions and experimental data were used to evaluate the accuracy of the model. The low CV values obtained show the performance of the CIECAM02‐m2 model to predict the simultaneous contrast effect satisfactorily. © 2007 Wiley Periodicals, Inc. Col Res Appl, 32, 121 – 129, 2007     

A new model for transformer saturation characteristics by includinghysteresis loops

A simplified analytical expression in polynomial form to determine the transformer saturation and hysteresis characteristics without field test data is presented. Higher-order approximations are simulated for comparison with transformers of various capacities. The results are compared with experiments and simulations and show very good agreement. It is possible to determine accurate transformer saturation and hysteresis characteristics with this simplified procedure     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.     

An adaptive updating protocol for reducing moving object database workload

In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive range queries and nearest neighbor queries. While a variety of indexing techniques have been proposed to accelerate the processing of updates and queries, not much attention has been paid to the updating protocol, which is another important factor affecting the system performance. In this paper, we propose a generic and adaptive updating protocol for moving object databases with less number of updates between objects and the database server, thereby reducing the overall workload of the system. In contrast to the approach adopted by most conventional moving object database systems where the exact locations and velocities last disclosed are used to predict their motions, we propose the concept of Spatio-temporal safe region to approximate possible future locations. Spatio-temporal safe regions provide larger space of tolerance for moving objects, freeing them from location and velocity updates as long as the errors remain predictable in the database. To answer predictive queries accurately, the server is allowed to probe the latest status of objects when their safe regions are inadequate in returning the exact query results. Spatio-temporal safe regions are calculated and optimized by the database server with two contradictory objectives: reducing update workload while guaranteeing query accuracy and efficiency. To achieve this, we propose a cost model that estimates the composition of active and passive updates based on historical motion records and query distribution. More system performance improvements can be obtained by cutting more updates from the clients, when the users of system are comfortable with incomplete but accuracy bounded query results. We have conducted extensive experiments to evaluate our proposal on a variety of popular indexing structures. The results confirm the viability, robustness, accuracy and efficiency of our proposed protocol.     

Intelligent control of doubly‐fed induction generator systems using PIDNNs

An intelligent control for a stand‐alone doubly‐fed induction generator (DFIG) system using a proportional‐integral‐derivative neural network (PIDNN) is proposed in this study. This system can be applied as a stand‐alone power supply system or as the emergency power system when the electricity grid fails for all sub‐synchronous, synchronous, and super‐synchronous conditions. The rotor side converter is controlled using field‐oriented control to produce 3‐phase stator voltages with constant magnitude and frequency at different rotor speeds. Moreover, the grid side converter, which is also controlled using field‐oriented control, is primarily implemented to maintain the magnitude of the DC‐link voltage. Furthermore, the intelligent PIDNN controller is proposed for both the rotor and grid side converters to improve the transient and steady‐state responses of the DFIG system for different operating conditions. Both the network structure and online learning algorithm are introduced in detail. Finally, the feasibility of the proposed control scheme is verified through experimentation. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Distributed election in complete networks

An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and anO(n) expected message complexity is shown. M.Y. Chan received her Ph.D. in 1988 from the University of Hong Kong, and her M.S. and B.A. degrees in computer science from the University of California, San Diego in 1980 and 1981, respectively. She is currently an Assistant Professor at the University of Texas at Dallas. Francis Y.L. Chin (S71-M76-SM85) received the B.Sc. degree in engineering science from the University of Toronto, Toronto, Canada, in 1972, and the M.S., M.A., and Ph.D. degrees in electrical engineering and computer science from Princeton University, New Jersey, in 1974, 1975, and 1976, respectively. Since 1975, he has taught at the University of Maryland, Baltimore Country, University of California, San Diego, University of Alberta, and Chinese University of Hong Kong. He is currently Head of the Department of Computer Science, University of Hong Kong. He has served as a program co-chairman of the 1988 International Conference on Computer Processing of Chinese and Oriental Languages (Toronto) and the International Computer Science Conference '88 (Hong Kong). His current research interests include algorithm design and analysis, parallel and distributed computing.     

Optically pumped submillimeter gas lasers and the prospects for constructing space-qualifiable LO systems

An optically pumped submillimeter laser operating in the 500 μm (600 GHz) to 100 μm (3 THz) spectral range is the primary and, at present, the only available local oscillator (LO) source for laboratory and astronomical heterodyne applications for this wavelength region. A short review of the state-of-the-art of submillimeter lasers as LO sources, with an emphasis given to receiver systems designed for airborne heterodyne observations, will be presented. The characteristics and prospects for constructing a spacequalifiable laser LO system will also be given.     

An improved algorithm for finding the median distributively

Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages.