Derivation of a vector model for a Brushless Doubly-Fed Machine with multiple loops per nest

The paper presents a vector model for a Brushless Doubly-Fed Machine (BDFM). The BDFM has 4 and 8 pole stator windings and a nested-loop rotor cage. The rotor cage has six nests equally spaced around the circumference and each nest comprises three loops. All the rotor loops are short circuited via a common end-ring at one end. The vector model is derived based on the electrical equations of the machine and appropriate vector transformations. In contrast to the stator, there is no three phase circuit in the rotor. Therefore, the vector transformations suitable for three phase circuits can not be utilised for the rotor circuit. A new vector transformation is employed for the rotor circuit quantities. The approach presented in this paper can be extended for a BDFM with any stator poles combination and any number of loops per nest. Simulation results from the model implemented in Simulink are presented. © 2008 IEEE.

Additional angles to calculate the deformation of RNA helices induced by bulge loops

Bulges are common features of folded RNA structures. The RNA axial kinking caused by bulges has been confirmed by many experiments. Usually, a kinking angle zeta and a bending angle theta are used to describe the kinking and twisting of RNA molecules containing bulges. Here, we present two additional angles (twist angle zeta(1), twist angle zeta(2)) to describe the deformation of RNA helices induced by bulge loops because only two angles (a kinking angle zeta and a bending angle theta) are not enough to define the deformation of RNA induced by bulges. (C) 2002 Elsevier Science B.V. All rights reserved.

An Infinite Latent Attribute Model for Network Data

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently available models can be classified by whether clusters are disjoint or are allowed to overlap. These models can explain a "flat" clustering structure. Hierarchical Bayesian models provide a natural approach to capture more complex dependencies. We propose a model in which objects are characterised by a latent feature vector. Each feature is itself partitioned into disjoint groups (subclusters), corresponding to a second layer of hierarchy. In experimental comparisons, the model achieves significantly improved predictive performance on social and biological link prediction tasks. The results indicate that models with a single layer hierarchy over-simplify real networks.

Local stability results for the collective behaviors of infinite populations of pulse-coupled oscillators

In this paper, we investigate the behavior of pulse-coupled integrate-and-fire oscillators. Because the stability analysis of finite populations is intricate, we investigate stability results in the approximation of infinite populations. In addition to recovering known stability results of finite populations, we also obtain new stability results for infinite populations. In particular, under a weak coupling assumption, we solve for the continuum model a conjecture still prevailing in the finite dimensional case. © 2011 IEEE.

Stabilization of symmetric formations to motion around convex loops

We provide a cooperative control algorithm to stabilize symmetric formations to motion around closed curves suitable for mobile sensor networks. This work extends previous results for stabilization of symmetric circular formations. We study a planar particle model with decentralized steering control subject to limited communication. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. We illustrate the result for a skewed superellipse, which is a type of curve that includes circles, ellipses, and rounded parallelograms. © 2007 Elsevier B.V. All rights reserved.

The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models

We propose a probabilistic model to infer supervised latent variables in the Hamming space from observed data. Our model allows simultaneous inference of the number of binary latent variables, and their values. The latent variables preserve neighbourhood structure of the data in a sense that objects in the same semantic concept have similar latent values, and objects in different concepts have dissimilar latent values. We formulate the supervised infinite latent variable problem based on an intuitive principle of pulling objects together if they are of the same type, and pushing them apart if they are not. We then combine this principle with a flexible Indian Buffet Process prior on the latent variables. We show that the inferred supervised latent variables can be directly used to perform a nearest neighbour search for the purpose of retrieval. We introduce a new application of dynamically extending hash codes, and show how to effectively couple the structure of the hash codes with continuously growing structure of the neighbourhood preserving infinite latent feature space.

A reversible infinite HMM using normalised random measures

Copyright 2014 by the author(s). We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.

Wave dispersion and power flow analysis of an infinite aerofoil-shaped beam

Classic flutter analysis models an aerofoil as a two degree-of-freedom rigid body supported by linear and torsional springs, which represent the bending and torsional stiffness of the aerofoil section. In this classic flutter model, no energy transfer or dissipation can occur in the span-wise direction of the aerofoil section. However, as the aspect ratio of an aerofoil section increases, this span-wise energy transfer - in the form of travelling waves - becomes important to the overall system dynamics. This paper extends the classic flutter model to include travelling waves in the span-wise direction. Namely, wave dispersion and power flow analysis of an infinite, aerofoil-shaped beam, subject to bending, torsion, tension and a constant wind excitation, is used to investigate the overall system stability. Examples of potential applications for these high aspect ratio aerofoil sections include high-altitude balloon tethers, towed cables, offshore risers and mooring lines.

Spontaneous emission lifetime distribution of infinite line antennas in two-dimensional photonic crystals with finite size

The authors calculate the lifetime distribution functions of spontaneous emission from infinite line antennas embedded in two-dimensional disordered photonic crystals with finite size. The calculations indicate the coexistence of both accelerated and inhibited decay processes in disordered photonic crystals with finite size. The decay behavior of the spontaneous emission from infinite line antennas changes significantly by varying factors such as the line antennas' positions in the disordered photonic crystal, the shape of the crystal, the filling fraction, and the dielectric constant. Moreover, the authors analyze the effect of the degree of disorder on spontaneous emission. (c) 2007 American Institute of Physics.

An algorithm of analysis tools on points distribution in high dimension space: The distance of a point and an infinite sub-space

This paper discusses the algorithm on the distance from a point and an infinite sub-space in high dimensional space With the development of Information Geometry([1]), the analysis tools of points distribution in high dimension space, as a measure of calculability, draw more attention of experts of pattern recognition. By the assistance of these tools, Geometrical properties of sets of samples in high-dimensional structures are studied, under guidance of the established properties and theorems in high-dimensional geometry.

Diassociativity in Conjugacy Closed Loops

Let Q be a conjugacy closed loop, and N(Q) its nucleus. Then Z(N(Q)) contains all associators of elements of Q. If in addition Q is diassociative (i.e., an extra loop), then all these associators have order 2. If Q is power-associative and |Q| is finite and relatively prime to 6, then Q is a group. If Q is a finite non-associative extra loop, then 16 ∣ |Q|.