Robust network reconstruction in polynomial time

This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work [1] on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method. © 2012 IEEE.

Designing folding rings using polynomial continuation

© 2014 by ASME. Two types of foldable rings are designed using polynomial continuation. The first type of ring, when deployed, forms regular polygons with an even number of sides and is designed by specifying a sequence of orientations which each bar must attain at various stages throughout deployment. A design criterion is that these foldable rings must fold with all bars parallel in the stowed position. At first, all three Euler angles are used to specify bar orientations, but elimination is also used to reduce the number of specified Euler angles to two, allowing greater freedom in the design process. The second type of ring, when deployed, forms doubly plane-symmetric (irregular) polygons. The doubly symmetric rings are designed using polynomial continuation, but in this example a series of bar end locations (in the stowed position) is used as the design criterion with focus restricted to those rings possessing eight bars.

Robust design optimization of gas turbine compression systems

Gas turbine compression systems are required to perform adequately over a range of operating conditions. Complexity has encouraged the conventional design process for compressors to focus initially on one operating point, usually the most commonor arduous, to draw up an outline design. Generally, only as this initial design is refined is its offdesign performance assessed in detail. Not only does this necessarily introduce a potentially costly and timeconsuming extra loop in the design process, but it also may result in a design whose offdesign behavior is suboptimal. Aversion of nonintrusive polynomial chaos was previously developed in which a set of orthonormal polynomials was generated to facilitate a rapid analysis of robustness in the presence of generic uncertainties with good accuracy. In this paper, this analysis method is incorporated in real time into the design process for the compression system of a three-shaft gas turbine aeroengine. This approach to robust optimization is shown to lead to designs that exhibit consistently improved system performance with reduced sensitivity to offdesign operation.

A unified circuit model for the polysilicon thin film transistor

This paper describes a unified approach to modelling the polysilicon thin film transistor (TFT) for the purposes of circuit design. The approach uses accurate methods of predicting the channel conductance and then fitting the resulting data with a polynomial. Two methods are proposed to find the channel conductance: a device model and measurement. The approach is suitable because the TFT does not have a well defined threshold voltage. The polynomial conductance is then integrated generally to find the drain current and channel charge, necessary for a complete circuit model. © 1991 The Japan Society of Applied Physics.

A comparison of power losses for small (< 1 kW) induction motor drives adopting squarewave and sinusoidal PWM excitation

In this paper the influence of the form of motor excitation on the performance of a small (< 1 kW) induction motor drive is studied. Two forms of excitation, namely sine waves generated by pulse width modulation and simple square wave are explored. Sine wave excitation gives lower motor losses but increases inverter losses. Conversely, square wave excitation increases motor losses but decreases inverter losses. Losses have been measured directly by calorimetric means or, in the case of the inverter, predicted by a Pspice model that has been verified by calorimetric methods. The work shows that overall, the use of square wave excitation leads to a more efficient drive. © 2004 The Institution of Electrical Engineers.

Analysis and performance assessment of 6-pulse inverter-fed 3-phase and 6-phase induction machines

The paper describes a model for a 6-phase induction motor driven by an inverter operating in a 6-pulse (square wave) mode. The model is implemented and performance, in terms of torque, current, efficiency and pulsating torque, compared to the performance of a 3-phase motor (both sine and 6-pulse supplied). The models are verified experimentally, in particular the efficiency performance, and it is illustrated that the improvement in inverter efficiency when in 6-pulse operating mode may improve the performance of the overall system. © 2005 IEEE.

Fem modeling of periodic arrays of multi-walled carbon nanotubes

Multiwalled carbon nanotubes display dielectric properties similar to those of graphite, which can be calculated using the well known Drude-Lorentz model. However, most computational softwares lack the capacity to directly incorporate this model into the simulations. We present the finite element modeling of optical propagation through periodic arrays of multiwalled carbon nanotubes. The dielectric function of nanotubes was incorporated into the model by using polynomial curve fitting technique. The computational analysis revealed interesting metamaterial filtering effects displayed by the highly dense square lattice arrays of carbon nanotubes, having lattice constants of the order few hundred nanometers. The curve fitting results for the dielectric function can also be used for simulating other interesting optical applications based on nanotube arrays.

Robust airfoil design with respect to boundary layer transition

In order to disign an airfoil of which maximum lift coefficient (CL max) is not sensitive to location of forced top boundary layer transition. Taking maximizing mean value of CL max and minimizing standard deviation as biobjective, leading edge radius, manximum thickness and its location, maximum camber and its location as deterministic design variables, location of forced top boundary layer transition as stochastic variable, XFOIL as deterministic CFD solver, non-intrusive polynomial chaos as substitute of Monte Carlo method, we completed a robust airfoil design problem. Results demonstrate performance of initial airfoil is enhanced through reducing standard deviation of CL max. Besides, we also know maximum thickness has the most dominating effect on mean value of CL max, location of maximum thickness has the most dominating effect on standard deviation of CL max, maximum camber has a little effect on both mean value and standard deviation, and maximum camber is the only element of which increase can lead increase of mean value and standard deviation at the same time. Copyright © 2009 by the American Institute of Aeronautics and Astronautics, Inc.

Impact of carbon fibre/epoxy corrugated cores

The dynamic compressive response of corrugated carbon-fibre reinforced epoxy sandwich cores has been investigated using a Kolsky-bar set-up. Compression at quasi-static rates up to v 0=200ms -1 have been tested on three different slenderness ratios of strut. High speed photography was used to capture the failure mechanisms and relate these to the measured axial compressive stress. Experiments show significant strength enhancement as the loading rate increases. Although material rate sensitivity accounts for some of this, it has been shown that the majority of the strength enhancement is due to inertial stabilisation of the core members. Inertial strength enhancement rises non-linearly with impact velocity. The largest gains are associated with a shift to buckle modes composed of 2-3 half sine waves. The loading rates tested within this study are similar to those that are expected when a sandwich core is compressed due to a blast event. © 2012 Elsevier Ltd.

Verification of periodically controlled hybrid systems: Application to an autonomous vehicle

This article introduces Periodically Controlled Hybrid Automata (PCHA) for modular specification of embedded control systems. In a PCHA, control actions that change the control input to the plant occur roughly periodically, while other actions that update the state of the controller may occur in the interim. Such actions could model, for example, sensor updates and information received from higher-level planning modules that change the set point of the controller. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariant properties of PCHAs is presented. For PCHAs with polynomial continuous vector fields, it is possible to check these conditions automatically using, for example, quantifier elimination or sum of squares decomposition. We examine the feasibility of this automatic approach on a small example. The proposed technique is also used to manually verify safety and progress properties of a fairly complex planner-controller subsystem of an autonomous ground vehicle. Geometric properties of planner-generated paths are derived which guarantee that such paths can be safely followed by the controller. © 2012 ACM.

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.

Scaling the Indian Buffet Process via Submodular Maximization

Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation framework to perform approximate MAP inference for linear-Gaussian latent feature models with an Indian Buffet Process (IBP) prior. This formulation yields a submodular function of the features that corresponds to a lower bound on the model evidence. By adding a constant to this function, we obtain a nonnegative submodular function that can be maximized via a greedy algorithm that obtains at least a one-third approximation to the optimal solution. Our inference method scales linearly with the size of the input data, and we show the efficacy of our method on the largest datasets currently analyzed using an IBP model.