Coherent design methodology using modelling, simulation and optimisation

There is an increasing demand for optimising complete systems and the devices within that system, including capturing the interactions between the various multi-disciplinary (MD) components involved. Furthermore confidence in robust solutions is esential. As a consequence the computational cost rapidly increases and in many cases becomes infeasible to perform such conceptual designs. A coherent design methodology is proposed, where the aim is to improve the design process by effectively exploiting the potential of computational synthesis, search and optimisation and conventional simulation, with a reduction of the computational cost. This optimization framework consists of a hybrid optimization algorithm to handles multi-fidelity simulations. Simultaneously and in order to handles uncertainty without recasting the model and at affordable computational cost, a stochastic modelling method known as non-intrusive polynomial chaos is introduced. The effectiveness of the design methodology is demonstrated with the optimisation of a submarine propulsion system.

A plane symmetric 6R foldable ring

The design of a deployable structure which deploys from a compact bundle of six parallel bars to a rectangular ring is considered. The structure is a plane symmetric Bricard linkage. The internal mechanism is described in terms of its Denavit-Hartenberg parameters; the nature of its single degree of freedom is examined in detail by determining the exact structure of the system of equations governing its movement; a range of design parameters for building feasible mechanisms is determined numerically; and polynomial continuation is used to design rings with certain specified desirable properties. © 2013 Elsevier Ltd.

Reconstruction of arbitrary biochemical reaction networks: A compressive sensing approach

Reconstruction of biochemical reaction networks (BRN) and genetic regulatory networks (GRN) in particular is a central topic in systems biology which raises crucial theoretical challenges in system identification. Nonlinear Ordinary Differential Equations (ODEs) that involve polynomial and rational functions are typically used to model biochemical reaction networks. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data quite difficult. In this paper, we present a network reconstruction algorithm that can deal with ODE model descriptions containing polynomial and rational functions. Rather than identifying the parameters of linear or nonlinear ODEs characterised by pre-defined equation structures, our methodology allows us to determine the nonlinear ODEs structure together with their associated parameters. To solve the network reconstruction problem, we cast it as a compressive sensing (CS) problem and use sparse Bayesian learning (SBL) algorithms as a computationally efficient and robust way to obtain its solution. © 2012 IEEE.

Model reductions for inference: generality of pairwise, binary, and planar factor graphs.

We offer a solution to the problem of efficiently translating algorithms between different types of discrete statistical model. We investigate the expressive power of three classes of model-those with binary variables, with pairwise factors, and with planar topology-as well as their four intersections. We formalize a notion of "simple reduction" for the problem of inferring marginal probabilities and consider whether it is possible to "simply reduce" marginal inference from general discrete factor graphs to factor graphs in each of these seven subclasses. We characterize the reducibility of each class, showing in particular that the class of binary pairwise factor graphs is able to simply reduce only positive models. We also exhibit a continuous "spectral reduction" based on polynomial interpolation, which overcomes this limitation. Experiments assess the performance of standard approximate inference algorithms on the outputs of our reductions.

Relating monolithic and granular leaching from contaminated soil treated with different cementitious binders.

This work employed a clayey, silty, sandy gravel contaminated with a mixture of metals (Cd, Cu, Pb, Ni and Zn) and diesel. The contaminated soil was treated with 5 and 10% dosages of different cementitious binders. The binders include Portland cement, cement-fly ash, cement-slag and lime-slag mixtures. Monolithic leaching from the treated soils was evaluated over a 64-day period alongside granular leachability of 49- and 84-day old samples. Surface wash-off was the predominant leaching mechanism for monolithic samples. In this condition, with data from different binders and curing ages combined, granular leachability as a function of monolithic leaching generally followed degrees 4 and 6 polynomial functions. The only exception was for Cu, which followed the multistage dose-response model. The relationship between both leaching tests varied with the type of metal, curing age/residence time of monolithic samples in the leachant, and binder formulation. The results provide useful design information on the relationship between leachability of metals from monolithic forms of S/S treated soils and the ultimate leachability in the eventual breakdown of the stabilized/solidified soil.

Stable multivariate rational interpolation for parameter-dependent aerospace models

A multivariate, robust, rational interpolation method for propagating uncertainties in several dimensions is presented. The algorithm for selecting numerator and denominator polynomial orders is based on recent work that uses a singular value decomposition approach. In this paper we extend this algorithm to higher dimensions and demonstrate its efficacy in terms of convergence and accuracy, both as a method for response suface generation and interpolation. To obtain stable approximants for continuous functions, we use an L2 error norm indicator to rank optimal numerator and denominator solutions. For discontinous functions, a second criterion setting an upper limit on the approximant value is employed. Analytical examples demonstrate that, for the same stencil, rational methods can yield more rapid convergence compared to pseudospectral or collocation approaches for certain problems. © 2012 AIAA.

Weighted least squares with expectation-maximization algorithm for burst detection in U.K. water distribution systems

Flow measurement data at the district meter area (DMA) level has the potential for burst detection in the water distribution systems. This work investigates using a polynomial function fitted to the historic flow measurements based on a weighted least-squares method for automatic burst detection in the U.K. water distribution networks. This approach, when used in conjunction with an expectationmaximization (EM) algorithm, can automatically select useful data from the historic flow measurements, which may contain normal and abnormal operating conditions in the distribution network, e.g., water burst. Thus, the model can estimate the normal water flow (nonburst condition), and hence the burst size on the water distribution system can be calculated from the difference between the measured flow and the estimated flow. The distinguishing feature of this method is that the burst detection is fully unsupervised, and the burst events that have occurred in the historic data do not affect the procedure and bias the burst detection algorithm. Experimental validation of the method has been carried out using a series of flushing events that simulate burst conditions to confirm that the simulated burst sizes are capable of being estimated correctly. This method was also applied to eight DMAs with known real burst events, and the results of burst detections are shown to relate to the water company's records of pipeline reparation work. © 2014 American Society of Civil Engineers.

Partial and total replacement of fishmeal with poultry by-product meal in diets for gibel carp, Carassius auratus gibelio Bloch

Triplicate groups of gibel carp Carassius auratus gibelio Bloch (initial body weight: 4.89 g) were fed for 8 weeks at 24.8-30.8 degrees C with nine isonitrogenous and isoenergetic diets. The control diet (F1) used white fishmeal (FM) as the sole protein source. In the other eight diets (F2-F9), 40.5-100% of FM protein was substituted by poultry by-product meal (PBM) at 8.5% increments. The specific growth rate (SGR), feed efficiency ratio, protein efficiency ratio, protein retention efficiency and energy retention rate for fish fed PBM diets (F2-F9) were all higher, but not always significantly, than those for fish fed F1. All apparent digestibility coefficients for fish fed PBM diets were lower than those for fish fed F1. Fish fed F1 had a significantly higher hepatosomatic index value than fish fed PBM diets (P < 0.05). No significant (P > 0.05) effect of diet was found in whole-body moisture and fat content. Whole-body protein and energy content for fish fed PBM diets were slightly higher than that for fish fed F1. The optimal replacement level of FM by PBM was estimated by second-order polynomial regression to be 66.5% in protein.

Geometrical learning, descriptive geometry, and biomimetic pattern recognition

Studies on learning problems from geometry perspective have attracted an ever increasing attention in machine learning, leaded by achievements on information geometry. This paper proposes a different geometrical learning from the perspective of high-dimensional descriptive geometry. Geometrical properties of high-dimensional structures underlying a set of samples are learned via successive projections from the higher dimension to the lower dimension until two-dimensional Euclidean plane, under guidance of the established properties and theorems in high-dimensional descriptive geometry. Specifically, we introduce a hyper sausage like geometry shape for learning samples and provides a geometrical learning algorithm for specifying the hyper sausage shapes, which is then applied to biomimetic pattern recognition. Experimental results are presented to show that the proposed approach outperforms three types of support vector machines with either a three degree polynomial kernel or a radial basis function kernel, especially in the cases of high-dimensional samples of a finite size. (c) 2005 Elsevier B.V. All rights reserved.

High resolution interrogation technique based on linear photodiode array spectrometer for fiber Bragg grating Sensors - art. no. 65952C

A linear photodiode array spectrometer based, high resolution interrogation technique for fiber Bragg grating sensors is demonstrated. Spline interpolation and Polynomial Approximation Algorithm (PAA) are applied to the data points acquired by the spectrometer to improve the original PAA based interrogation method. Thereby fewer pixels are required to achieve the same resolution as original. Theoretical analysis indicates that if the FWHM of a FBG covers more than 3 pixels, the resolution of central wavelength shift will arrive at less than 1 pm. While the number of pixels increases to 6, the nominal resolution will decrease to 0.001 pm. Experimental result shows that Bragg wavelength resolution of similar to 1 pm is obtained for a FBG with FWHM of similar to 0.2 nm using a spectrometer with a pixel resolution of similar to 70 pm.

Object-recognition with oblique observation directions based on biomimetic pattern recognition

In this paper, we propose a new scheme for omnidirectional object-recognition in free space. The proposed scheme divides above problem into several onmidirectional object-recognition with different depression angles. An onmidirectional object-recognition system with oblique observation directions based on a new recognition theory-Biomimetic Pattern Recognition (BPR) is discussed in detail. Based on it, we can get the size of training samples in the onmidirectional object-recognition system in free space. Omnidirection ally cognitive tests were done on various kinds of animal models of rather similar shapes. For the total 8400 tests, the correct recognition rate is 99.89%. The rejection rate is 0.11% and on the condition of zero error rates. Experimental results are presented to show that the proposed approach outperforms three types of SVMs with either a three degree polynomial kernel or a radial basis function kernel.

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.

on lin-bose problem

This paper study generalized Serre problem proposed by Lin and Bose in multidimensional system theory context [Multidimens. Systems and Signal Process. 10 (1999) 379; Linear Algebra Appl. 338 (2001) 125]. This problem is stated as follows. Let F ∈ Al×m be a full row rank matrix, and d be the greatest common divisor of all the l × l minors of F. Assume that the reduced minors of F generate the unit ideal, where A = K[x 1,...,xn] is the polynomial ring in n variables x 1,...,xn over any coefficient field K. Then there exist matrices G ∈ Al×l and F1 ∈ A l×m such that F = GF1 with det G = d and F 1 is a ZLP matrix. We provide an elementary proof to this problem, and treat non-full rank case.