A generic tool for cost estimating in aircraft design

A methodology to estimate the cost implications of design decisions by integrating cost as a design parameter at an early design stage is presented. The model is developed on a hierarchical basis, the manufacturing cost of aircraft fuselage panels being analysed in this paper. The manufacturing cost modelling is original and relies on a genetic-causal method where the drivers of each element of cost are identified relative to the process capability. The cost model is then extended to life cycle costing by computing the Direct Operating Cost as a function of acquisition cost and fuel burn, and coupled with a semi-empirical numerical analysis using Engineering Sciences Data Unit reference data to model the structural integrity of the fuselage shell with regard to material failure and various modes of buckling. The main finding of the paper is that the traditional minimum weight condition is a dated and sub-optimal approach to airframe structural design.

Unconditional constants and polynomial inequalities

If P is a polynomial on Rm of degree at most n then we define the polynomial |P|. Now if B is a convex compact set in Rm, we define the norm ||P||B of P as the maximum of P on B, and then we investigate the inequality || |P| ||B

A Comparison of the Flow Structures and Losses Within Vaned and Vaneless Stators for Radial Turbines

This paper details the numerical analysis of different vaned and vaneless radial inflow turbine stators. Selected results are presented from a test program carried out to determine performance differences between the radial turbines with vaned stators and vaneless volutes under the same operating conditions. A commercial computational fluid dynamics code was used to develop numerical models of each of the turbine configurations, which were validated using the experimental results. From the numerical models, areas of loss generation in the different stators were identified and compared, and the stator losses were quantified. Predictions showed the vaneless turbine stators to incur lower losses than the corresponding vaned stator at matching operating conditions, in line with the trends in measured performance.. Flow conditions at rotor inlet were studied and validated with internal static pressure measurements so as to judge the levels of circumferential nonuniformity for each stator design. In each case, the vaneless volutes were found to deliver a higher level of uniformity in the rotor inlet pressure field. [DOI: 10.1115/1.2988493]

A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two Graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations. (c) 2006 Elsevier Inc. All rights reserved.

Information theoretic measures of UHG graphs with low computational complexity

We introduce a novel graph class we call universal hierarchical graphs (UHG) whose topology can be found numerously in problems representing, e.g., temporal, spacial or general process structures of systems. For this graph class we show, that we can naturally assign two probability distributions, for nodes and for edges, which lead us directly to the definition of the entropy and joint entropy and, hence, mutual information establishing an information theory for this graph class. Furthermore, we provide some results under which conditions these constraint probability distributions maximize the corresponding entropy. Also, we demonstrate that these entropic measures can be computed efficiently which is a prerequisite for every large scale practical application and show some numerical examples. (c) 2007 Elsevier Inc. All rights reserved.

Fast automatic two-stage nonlinear model identification based on the extreme learning machine

It is convenient and effective to solve nonlinear problems with a model that has a linear-in-the-parameters (LITP) structure. However, the nonlinear parameters (e.g. the width of Gaussian function) of each model term needs to be pre-determined either from expert experience or through exhaustive search. An alternative approach is to optimize them by a gradient-based technique (e.g. Newton’s method). Unfortunately, all of these methods still need a lot of computations. Recently, the extreme learning machine (ELM) has shown its advantages in terms of fast learning from data, but the sparsity of the constructed model cannot be guaranteed. This paper proposes a novel algorithm for automatic construction of a nonlinear system model based on the extreme learning machine. This is achieved by effectively integrating the ELM and leave-one-out (LOO) cross validation with our two-stage stepwise construction procedure [1]. The main objective is to improve the compactness and generalization capability of the model constructed by the ELM method. Numerical analysis shows that the proposed algorithm only involves about half of the computation of orthogonal least squares (OLS) based method. Simulation examples are included to confirm the efficacy and superiority of the proposed technique.

Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

Topological mappings between graphs, trees and generalized trees

We present novel topological mappings between graphs, trees and generalized trees that means between structured objects with different properties. The two major contributions of this paper are, first, to clarify the relation between graphs, trees and generalized trees, a graph class recently introduced. Second, these transformations provide a unique opportunity to transform structured objects into a representation that might be beneficial for a processing, e.g., by machine learning techniques for graph classification. (c) 2006 Elsevier Inc. All rights reserved.

Comparing large graphs efficiently by margins of feature vectors

Measuring the structural similarity of graphs is a challenging and outstanding problem. Most of the classical approaches of the so-called exact graph matching methods are based on graph or subgraph isomorphic relations of the underlying graphs. In contrast to these methods in this paper we introduce a novel approach to measure the structural similarity of directed and undirected graphs that is mainly based on margins of feature vectors representing graphs. We introduce novel graph similarity and dissimilarity measures, provide some properties and analyze their algorithmic complexity. We find that the computational complexity of our measures is polynomial in the graph size and, hence, significantly better than classical methods from, e.g. exact graph matching which are NP-complete. Numerically, we provide some examples of our measure and compare the results with the well-known graph edit distance. (c) 2006 Elsevier Inc. All rights reserved.

Comparison of Experimental PIV Data and CFD Simulations for Flow in a Diesel Particulate Filter Inlet Diffuser

Flow maldistribution of the exhaust gas entering a Diesel Particulate Filter (DPF) can cause uneven soot distribution during loading and excessive temperature gradients during the regeneration phase. Minimising the magnitude of this maldistribution is therefore an important consideration in the design of the inlet pipe and diffuser, particularly in situations where packaging constraints dictate bends in the inlet pipe close to the filter, or a sharp diffuser angle. This paper describes the use of Particle Image Velocimetry (PIV) to validate a Computational Fluid Dynamic (CFD) model of the flow within the inlet diffuser of a DPF so that CFD can be used with confidence as a tool to minimise this flow maldistribution. PIV is used to study the flow of gas into a DPF over a range of steady state flow conditions. The distribution of flow approaching the front face of the substrate was of particular interest to this study. Optically clear diffusing cones were designed and placed between pipe and substrate to allow PIV analysis to take place. Stereoscopic PIV was used to eliminate any error produced by the optical aberrations caused by looking through the curved wall of the inlet cone. In parallel to the experiments, numerical analysis was carried out using a CFD program with an incorporated DPF model. Boundary conditions for the CFD simulations were taken from the experimental data, allowing an experimental validation of the numerical results. The CFD model incorporated a DPF model, the cement layers seen in segmented filters and the intumescent matting that is commonly used to pack the filter into a metal casing. The mesh contained approximately 580,000 cells and used the realizable ?-e turbulence model. The CFD simulation predicted both pressure drop across the DPF and the velocity field within the cone and at the DPF face with reasonable accuracy, providing confidence in the use the CFD in future work to design new, more efficient cones.

Map Width Enhancement Technique for a Turbocharger Compressor

This paper presents an investigation of map width enhancement and the performance improvement of a turbocharger compressor using a series of static vanes in the annular cavity of a classical bleed slot system. The investigation has been carried out using both experimental and numerical analysis. The compressor stage used for this study is from a turbocharger unit used in heavy duty diesel engines of approximately 300 kW. Two types of vanes were designed and added to the annular cavity of the baseline classical bleed slot system. The purpose of the annular cavity vane technique is to remove some of the swirl that can be carried through the bleed slot system, which would influence the pressure
ratio. In addition to this, the series of cavity vanes provides a better guidance to the slot recirculating flow before it mixes with the impeller main inlet flow. Better guidance of the flow improves the mixing at the inducer inlet in the circumferential direction. As a consequence, the stability of the compressor is improved at lower flow rates and a wider map can be achieved. The impact of two cavity vane designs on the map width and performance of the compressor was highlighted through a detailed analysis of the impeller flow field. The numerical and experimental study revealed that an effective vane design can improve the map width and pressure ratio characteristic without an efficiency penalty compared to the classical bleed slot system without vanes. The comparison study between the cavity vane and noncavity vane configurations presented in this paper showed that the map width was improved by 14.3% due to a significant reduction in surge flow and the peak pressure ratio was improved by 2.25% with the addition of a series of cavity vanes in the annular cavity of the bleed slot system.

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.

Ixaru's Extended Frequency Dependent Quadrature Rules for Slater Integrals: Parallel Computation Issues

We describe recent progress of an ongoing research programme aimed at producing computational science software that can exploit high performance architectures in the atomic physics application domain. We examine the computational bottleneck of matrix construction in a suite of two-dimensional R-matrix propagation programs, 2DRMP, that are aimed at creating virtual electron collision experiments on HPC architectures. We build on Ixaru's extended frequency dependent quadrature rules (EFDQR) for Slater integrals and examine the challenge of constructing Hamiltonian matrices in parallel across an m-processor compute node in a block cyclic distribution for subsequent diagonalization by ScaLAPACK.