Development of low entropy coding in a recurrent network.

In this paper we present an unsupervised neural network which exhibits competition between units via inhibitory feedback. The operation is such as to minimize reconstruction error, both for individual patterns, and over the entire training set. A key difference from networks which perform principal components analysis, or one of its variants, is the ability to converge to non-orthogonal weight values. We discuss the network's operation in relation to the twin goals of maximizing information transfer and minimizing code entropy, and show how the assignment of prior probabilities to network outputs can help to reduce entropy. We present results from two binary coding problems, and from experiments with image coding.

Development of blade profiles for low pressure turbine applications

This paper describes a program of work, largely experimental, which was undertaken with the objective of developing an improved blade profile for the low-pressure turbine in aero-engine applications. Preliminary experiments were conducted using a novel technique. An existing cascade of datum blades was modified to enable the pressure distribution on the suction surface of one of the blades to be altered. Various means, such as shaped inserts, an adjustable flap at the trailing edge, and changing stagger were employed to change the geometry of the passage. These experiments provided boundary layer and lift data for a wide range of suction surface pressure distributions. The data was then used as a guide for the development of new blade profiles. The new blade profiles were then investigated in a low-speed cascade that included a set of moving bars upstream of the cascade of blades to simulate the effect of the incoming wakes from the previous blade row in a multistage turbine environment.

Velocity distributions for low pressure turbines

A parametric set of velocity distributions has been investigated using a flat plate experiment. Three different diffusion factors and peak velocity locations were tested. These were designed to mimic the suction surfaces of Low Pressure (LP) turbine blades. Unsteady wakes, inherent in real turbomachinery flows, were generated using a moving bar mechanism. A turbulence grid generated a freestream turbulence level that is believed to be typical of LP turbines. Measurements were taken across a Reynolds number range of 50,000-220,000 at three reduced frequencies (0.314, 0.628, 0.942). Boundary layer traverses were performed at the nominal trailing edge using a Laser Doppler Anemometry system and hot-films were used to examine the boundary layer behaviour along the surface. For every velocity distribution tested, the boundary layer separated in the diffusing flow downstream of the peak velocity. The loss production is dominated by the mixing in the reattachment process, mixing in the turbulent boundary layer downstream of reattachment and the effects of the unsteady interaction between the wakes and the boundary layer. A sensitive balance governs the optimal location of peak velocity on the surface. Moving the velocity peak forwards on the blade was found to be increasingly beneficial when bubblegenerated losses are high, i.e. at low Reynolds number, at low reduced frequency and at high levels of diffusion. Copyright © 2008 by ASME.

Blade loading and its application in the mean-line design of low pressure turbines

In order to minimize the number of iterations to a turbine design, reasonable choices of the key parameters must be made at the earliest possible opportunity. The choice of blade loading is of particular concern in the low pressure (LP) turbine of civil aero engines, where the use of high-lift blades is widespread. This paper presents an analytical mean-line design study for a repeating-stage, axial-flow Low Pressure (LP) turbine. The problem of how to measure blade loading is first addressed. The analysis demonstrates that the Zweifel coefficient [1] is not a reasonable gauge of blade loading because it inherently depends on the flow angles. A more appropriate coefficient based on blade circulation is proposed. Without a large set of turbine test data it is not possible to directly evaluate the accuracy of a particular loss correlation. The analysis therefore focuses on the efficiency trends with respect to flow coefficient, stage loading, lift coefficient and Reynolds number. Of the various loss correlations examined, those based on Ainley and Mathieson ([2], [3], [4]) do not produce realistic trends. The profile loss model of Coull and Hodson [5] and the secondary loss models of Craig and Cox [6] and Traupel [7] gave the most reasonable results. The analysis suggests that designs with the highest flow turning are the least sensitive to increases in blade loading. The increase in Reynolds number lapse with loading is also captured, achieving reasonable agreement with experiments. Copyright © 2011 by ASME.

A 5-step reduced mechanism for combustion of CO/H2/H2O/CH4/CO2 mixtures with low hydrogen/methane and high H2O content

In this study a 5-step reduced chemical kinetic mechanism involving nine species is developed for combustion of Blast Furnace Gas (BFG), a multi-component fuel containing CO/H2/CH4/CO2, typically with low hydrogen, methane and high water fractions, for conditions relevant for stationary gas-turbine combustion. This reduced mechanism is obtained from a 49-reaction skeletal mechanism which is a modified subset of GRI Mech 3.0. The skeletal and reduced mechanisms are validated for laminar flame speeds, ignition delay times and flame structure with available experimental data, and using computational results with a comprehensive set of elementary reactions. Overall, both the skeletal and reduced mechanisms show a very good agreement over a wide range of pressure, reactant temperature and fuel mixture composition. © 2012 The Combustion Institute..

The rise heights of low-and high-Froude-number turbulent axisymmetric fountains

We present the results of an experimental investigation across a broad range of source Froude numbers, 0. 4 ≤ Fr 0 ≤ 45, into the dynamics, morphology and rise heights of Boussinesq turbulent axisymmetric fountains in quiescent uniform environments. Typically, these fountains are thought to rise to an initial height, z i, before settling back and fluctuating about a lesser (quasi-) steady height, z ss. Our measurements show that this is not always the case and the ratio of the fountain's initial rise height to steady rise height, λ = z i/z ss, varies widely, 0. 5 ≈ λ ≈ 2, across the range of Fr 0 investigated. As a result of near-ideal start-up conditions provided by the experimental set-up we were consistently able to form a vortex at the fountain's front. This enabled new insights into two features of the initial rise of turbulent fountains. Firstly, for 1. 0 ≈ Fr 0 ≈ 1. 7 the initial rise height is less than the steady rise height. Secondly, for Fr 0 ≈ 5. 5, the vortex formed at the fountain's front pinches off, separates from the main body and rises high above the fountain; there is thus a third rise height to consider, namely, the maximum vortex rise height, z v. From our observations we propose classifying turbulent axisymmetric fountains into five regimes (as opposed to the current three regimes) and present detailed descriptions of the flow in each. Finally, based on an analysis of the rise height fluctuations and the width of fountains in (quasi-) steady state we provide further insight into the physical cause of height fluctuations. © 2011 Cambridge University Press.

Modelling and Fragility Analysis of Non-Ductile Reinforced Concrete Buildings in Low-to-Moderate Seismic Zones

Reinforced concrete buildings in low-to-moderate seismic zones are often designed only for gravity loads in accordance with the non-seismic detailing provisions. Deficient detailing of columns and beam-column joints can lead to unpredictable brittle failures even under moderate earthquakes. Therefore, a reliable estimate of structural response is required for the seismic evaluation of these structures. For this purpose, analytical models for both interior and exterior slab-beam-column subassemblages and for a 1/3 scale model frame were implemented into the nonlinear finite element platform OpenSees. Comparison between the analytical results and experimental data available in the literature is carried out using nonlinear pushover analyses and nonlinear time history analysis for the subassemblages and the model frame, respectively. Furthermore, the seismic fragility assessment of reinforced concrete buildings is performed on a set of non-ductile frames using nonlinear time history analyses. The fragility curves, which are developed for various damage states for the maximum interstory drift ratio are characterized in terms of peak ground acceleration and spectral acceleration using a suite of ground motions representative of the seismic hazard in the region.

Blade Loading and Its Application in the Mean-Line Design of Low Pressure Turbines

In order to minimize the number of iterations to a turbine design, reasonable choices of the key parameters must be made at the preliminary design stage. The choice of blade loading is of particular concern in the low pressure (LP) turbine of civil aero engines, where the use of high-lift blades is widespread. This paper considers how blade loading should be measured, compares the performance of various loss correlations, and explores the impact of blade lift on performance and lapse rates. To these ends, an analytical design study is presented for a repeating-stage, axial-flow LP turbine. It is demonstrated that the long-established Zweifel lift coefficient (Zweifel, 1945, "The Spacing of Turbomachine Blading, Especially with Large Angular Deflection" Brown Boveri Rev., 32(1), pp. 436-444) is flawed because it does not account for the blade camber. As a result the Zweifel coefficient is only meaningful for a fixed set of flow angles and cannot be used as an absolute measure of blade loading. A lift coefficient based on circulation is instead proposed that accounts for the blade curvature and is independent of the flow angles. Various existing profile and secondary loss correlations are examined for their suitability to preliminary design. A largely qualitative comparison demonstrates that the loss correlations based on Ainley and Mathieson (Ainley and Mathieson, 1957, "A Method of Performance Estimation for Axial-Flow Turbines," ARC Reports and Memoranda No. 2974; Dunham and Came, 1970, "Improvements to the Ainley-Mathieson Method of Turbine Performance Prediction," Trans. ASME: J. Eng. Gas Turbines Power, July, pp. 252-256; Kacker and Okapuu, 1982, "A Mean Line Performance Method for Axial Flow Turbine Efficiency," J. Eng. Power, 104, pp. 111-119). are not realistic, while the profile loss model of Coull and Hodson (Coull and Hodson, 2011, "Predicting the Profile Loss of High-Lift Low Pressure Turbines," J. Turbomach., 134(2), pp. 021002) and the secondary loss model of (Traupel, W, 1977, Thermische Turbomaschinen, Springer-Verlag, Berlin) are arguably the most reasonable. A quantitative comparison with multistage rig data indicates that, together, these methods over-predict lapse rates by around 30%, highlighting the need for improved loss models and a better understanding of the multistage environment. By examining the influence of blade lift across the Smith efficiency chart, the analysis demonstrates that designs with higher flow turning will tend to be less sensitive to increases in blade loading. © 2013 American Society of Mechanical Engineers.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

Slow peaking and low-gain designs for global stabilization of nonlinear systems

This paper presents an analysis of the slow-peaking phenomenon, a pitfall of low-gain designs that imposes basic limitations to large regions of attraction in nonlinear control systems. The phenomenon is best understood on a chain of integrators perturbed by a vector field up(x, u) that satisfies p(x, 0) = 0. Because small controls (or low-gain designs) are sufficient to stabilize the unperturbed chain of integrators, it may seem that smaller controls, which attenuate the perturbation up(x, u) in a large compact set, can be employed to achieve larger regions of attraction. This intuition is false, however, and peaking may cause a loss of global controllability unless severe growth restrictions are imposed on p(x, u). These growth restrictions are expressed as a higher order condition with respect to a particular weighted dilation related to the peaking exponents of the nominal system. When this higher order condition is satisfied, an explicit control law is derived that achieves global asymptotic stability of x = 0. This stabilization result is extended to more general cascade nonlinear systems in which the perturbation p(x, v) v, v = (ξ, u) T, contains the state ξ and the control u of a stabilizable subsystem ξ = a(ξ, u). As an illustration, a control law is derived that achieves global stabilization of the frictionless ball-and-beam model.

Low-rank optimization with trace norm penalty

The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. © 2013 Society for Industrial and Applied Mathematics.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.