Imputing a continuous income variable from a bracketed income variable with special attention to missing observations

This paper proposes a method, based on polychotomous discrete choice methods, to impute a continuous measure of income when only a bracketed measure of income is available and for only a subset of the obsevations. The method is shown to perform well with CP5 data. © 1991.

The eight variable homogeneous degree three bent functions

We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions.

Evolution of Langmuir waves in a plasma contaminated by variable-charge impurities

The propagation of Langmuir waves in nonisothermal plasmas contaminated by fine dust particles with variable charge is investigated for a self-consistent closed system. Dust charge relaxation, ionization, recombination, and collisional dissipation are taken into account. It is shown that the otherwise unstable coupling of the Langmuir and dust-charge relaxation modes becomes stable and the Langmuir waves are frequency down-shifted.

Low-frequency dispersion properties of plasmas with variable-charge impurities

A theory of low-frequency dust-acoustic waves in low-temperature collisional plasmas containing variable-charge impurities is presented. Physical processes such as dust-charge relaxation, ionization-recombination of the electrons and ions, electron and ion elastic collisions with neutrals and dusts, as well as charging collisions with the dusts, are taken into account. Inclusion of these processes allows a balance of the plasma particles and thus a self-consistent determination of the stationary state of the unperturbed plasma. The generalized dispersion relation describing the propagation and damping of the dust acoustic waves is derived and analyzed. © 2000 American Institute of Physics.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽trandom collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Rectifier systems for variable speed wind generation : a review

The drive towards high efficiency wind energy conversion systems has resulted in almost all the modern wind turbines to operate in the variable speed mode which inevitably requires back-to-back power electronic converters to decouple generator dynamics from the grid. The aim of this paper is to present an analysis on suitable topologies for the generator-side converter (rectifier) of the back-to-back converter arrangement. Performance of the two most popular rectifier systems, namely, the passive diode bridge rectifier and the active six-switch two-level rectifier are taken as two extremes to evaluate other topologies presented in this paper. The other rectifier systems considered in this study include combinations of a diode bridge rectifier and electronic reactance(s), a combination of a rectifier and a dc-dc converter and a half controlled rectifier. Diode-clamped and capacitor-clamped three-level active rectifier topologies and their possible switch reductions are also discussed in relation to the requirements of modern high power wind energy conversion systems (WECSs). Simulation results are presented to support conclusion derived from this analysis.

Cost efficiency of Japanese steam power generation companies : a Bayesian comparison of random and fixed frontier models

This study analyses and compares the cost efficiency of Japanese steam power generation companies using the fixed and random Bayesian frontier models. We show that it is essential to account for heterogeneity in modelling the performance of energy companies. Results from the model estimation also indicate that restricting CO2 emissions can lead to a decrease in total cost. The study finally discusses the efficiency variations between the energy companies under analysis, and elaborates on the managerial and policy implications of the results.

Controller design for variable-speed permanent magnet wind turbine generators interfaced with Z-source inverter

Increased awareness of environmental concerns has caused greater interest in developing power sources based on renewable technologies, such as wind. Due to the intermittent nature of the wind speed, output voltage and frequency of the direct driven permanent magnet synchronous generators (PMSG) are normally unsteady. Recently proposed Z-source inverter has been considered as a potential solution for grid interfacing wind power generators, thanks to buck-boost function that the single stage Z-source inverter can offer. Two control methodologies, namely unified controller for isolated operation and a multi-loop controller for grid interfaced operation are investigated in this paper. Theoretical analysis of these two control schemes is presented and experimental results to verify the effectiveness of the control method are also included.

A random key genetic algorithm for live migration of multiple virtual machines in data centers

Live migration of multiple Virtual Machines (VMs) has become an integral management activity in data centers for power saving, load balancing and system maintenance. While state-of-the-art live migration techniques focus on the improvement of migration performance of an independent single VM, only a little has been investigated to the case of live migration of multiple interacting VMs. Live migration is mostly influenced by the network bandwidth and arbitrarily migrating a VM which has data inter-dependencies with other VMs may increase the bandwidth consumption and adversely affect the performances of subsequent migrations. In this paper, we propose a Random Key Genetic Algorithm (RKGA) that efficiently schedules the migration of a given set of VMs accounting both inter-VM dependency and data center communication network. The experimental results show that the RKGA can schedule the migration of multiple VMs with significantly shorter total migration time and total downtime compared to a heuristic algorithm.

Z-source converter based grid-interface for variable-speed permanent magnet wind turbine generators

A Z-source inverter based grid-interface for a variable-speed wind turbine connected to a permanent magnet synchronous generator is proposed. A control system is designed to harvest maximum wind energy under varied wind conditions with the use of the permanent magnet synchronous generator, diode-rectifier and Z-source inverter. Control systems for speed regulation of the generator and for DC- and AC- sides of the Z-source inverter are investigated using computer simulations and laboratory experiments. Simulation and experimental results verify the efficacy of the proposed approach.