Generalized vector control for brushless doubly fed machines with nested-loop rotor

This paper presents a generalized vector control system for a generic brushless doubly fed (induction) machine (BDFM) with nested-loop type rotor. The generic BDFM consists of p1/p2 pole-pair stator windings and a nested-loop rotor with N number of loops per nest. The vector control system is derived based on the basic BDFM equation in the synchronous mode accompanied with an appropriate synchronization approach to the grid. An analysis is performed for the vector control system using the generic BDFM vector model. The analysis proves the efficacy of the proposed approach in BDFM electromagnetic torque and rotor flux control. In fact, in the proposed vector control system, the BDFM torque can be controlled very effectively promising a high-performance BDFM shaft speed control system. A closed-loop shaft speed control system is composed based on the presented vector control system whose performance is examined both in simulations and experiments. The results confirm the high performance of the proposed approach in BDFM shaft speed control as well as a very close agreement between the simulations and experiments. Tests are performed on a 180-frame prototype BDFM. © 2012 IEEE.

Elemental unbiased estimators for the Generalized Pareto tail

Unbiased location- and scale-invariant `elemental' estimators for the GPD tail parameter are constructed. Each involves three log-spacings. The estimators are unbiased for finite sample sizes, even as small as N=3. It is shown that the elementals form a complete basis for unbiased location- and scale-invariant estimators constructed from linear combinations of log-spacings. Preliminary numerical evidence is presented which suggests that elemental combinations can be constructed which are consistent estimators of the tail parameter for samples drawn from the pure GPD family.

Elemental estimators for the Generalized Extreme Value tail

In a companion paper (McRobie(2013) arxiv:1304.3918), a simple set of `elemental' estimators was presented for the Generalized Pareto tail parameter. Each elemental estimator: involves only three log-spacings; is absolutely unbiased for all values of the tail parameter; is location- and scale-invariant; and is valid for all sample sizes $N$, even as small as $N= 3$. It was suggested that linear combinations of such elementals could then be used to construct efficient unbiased estimators. In this paper, the analogous mathematical approach is taken to the Generalised Extreme Value (GEV) distribution. The resulting elemental estimators, although not absolutely unbiased, are found to have very small bias, and may thus provide a useful basis for the construction of efficient estimators.

Generalized power method for sparse principal component analysis

In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed. © 2010 Michel Journée, Yurii Nesterov, Peter Richtárik and Rodolphe Sepulchre.

Consensus under general convexity

A method is proposed to characterize contraction of a set through orthogonal projections. For discrete-time multi-agent systems, quantitative estimates of convergence (to a consensus) rate are provided by means of contracting convex sets. Required convexity for the sets that should include the values that the transition maps of agents take is considered in a more general sense than that of Euclidean geometry. © 2007 IEEE.

Generalized phenomenological model for the viscoelasticity of idealized asphalts

A generalized theory for the viscoelastic behavior of idealized bituminous mixtures (asphalts) is presented. The mathematical model incorporates strain rate and temperature dependency as well as nonmonotonic loading and unloading with shape recovery. The stiffening effect of the aggregate is included. The model is of phenomenological nature. It can be calibrated using a relatively limited set of experimental parameters, obtainable by uniaxial tests. It is shown that the mathematical model can be represented as a special nonlinear form of the Burgers model. This facilitates the derivation of numerical algorithms for solving the constitutive equations. A numerical scheme is implemented in a user material subroutine (UMAT) in the finite-element analysis (FEA) code ABAQUS. Simulation results are compared with uniaxial and indentation tests on an idealized asphalt mix. © 2014 American Society of Civil Engineers.

Spin-Hall effect in the generalized honeycomb lattice with Rashba spin-orbit interaction

We study the spin-Hall effect in a generalized honeycomb lattice, which is described by a tight-binding Hamiltonian including the Rashba spin-orbit coupling and inversion-symmetry breaking terms brought about by a uniaxial pressure. The calculated spin-Hall conductance displays a series of exact or approximate plateaus for isotropic or anisotropic hopping integral parameters, respectively. We show that these plateaus are a consequence of the various Fermi-surface topologies when tuning epsilon(F). For the isotropic case, a consistent two-band analysis, as well as a Berry-phase interpretation. are also given. (C) 2009 Elsevier B.V. All rights reserved.

Generalized Viscoplastic Modeling of Debris Flow

Various concepts have been proposed or used in the development of rheological models for debris flow. The earliest model developed by Bagnold was based on the concept of the “dispersive” pressure generated by grain collisions. Bagnold’s concept appears to be theoretically sound, but his empirical model has been found to be inconsistent with most theoretical models developed from non-Newtonian fluid mechanics. Although the generality of Bagnold’s model is still at issue, debris-flow modelers in Japan have generally accepted Takahashi’s formulas derived from Bagnold’s model. Some efforts have recently been made by theoreticians in non-Newtonian fluid mechanics to modify or improve Bagnold’s concept or model. A viable rheological model should consist both of a rate-independent part and a rate-dependent part. A generalized viscoplastic fluid (GVF) model that has both parts as well as two major rheological properties (i.e., the normal stress effect and soil yield criterion) is shown to be sufficiently accurate, yet practical, for general use in debris-flow modeling. In fact, Bagnold’s model is found to be only a particular case of the GVF model. Analytical solutions for (steady) uniform debris flows in wide channels are obtained from the GVF model based on Bagnold’s simplified assumption of constant grain concentration.

Practical Evaluation of Security against Generalized Interpolation Attack

Interpolation attack was presented by Jakobsen and Knudsen at FSE'97. Interpolation attack is effective against ciphers that have a certain algebraic structure like the PURE cipher which is a prototype cipher, but it is difficult to apply the attack to real-world ciphers. This difficulty is due to the difficulty of deriving a low degree polynomial relation between ciphertexts and plaintexts. In other words, it is difficult to evaluate the security against interpolation attack. This paper generalizes the interpolation attack. The generalization makes easier to evaluate the security against interpolation attack. We call the generalized interpolation attack linear sum attack. We present an algorithm that evaluates the security of byte-oriented ciphers against linear sum attack. Moreover, we show the relationship between linear sum attack and higher order differential attack. In addition, we show the security of CRYPTON, E2, and RIJNDAEL against linear sum attack using the algorithm.