Improved bounds for subband-adaptive iterative shrinkage/thresholding algorithms.

This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redundant frames. It turns out that the simplest and most intuitive setting for the step sizes that ignores subband aliasing is often satisfactory in practice. We show that our methods can be used to advantage with reweighted least squares penalty functions as well as L1 penalties. We emphasize that the algorithms presented here are suitable for performing inverse filtering on very large datasets, including 3D data, since inversions are applied only to diagonal matrices and fast transforms are used to achieve all matrix-vector products.

Single-sensor maximum power point tracking algorithms

Single-sensor maximum power point tracking algorithms for photovoltaic systems are presented. The algorithms have the features, characteristics and advantages of the widely used incremental conductance (INC) algorithm. However; unlike the INC algorithm which requires two sensors (the voltage sensor and the current sensor), the single-sensor algorithms are more desirable because they require only one sensor: the voltage sensor. The algorithms operate by maximising power at the DC-DC converter output, instead of the input. © 2013 The Institution of Engineering and Technology.

A PDE viewpoint on basic properties of coordination algorithms with symmetries

Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with respect to a uniform translation of all subsystem values. The present paper shows that in presence of such symmetry, fundamental properties can be highlighted by viewing the distributed system as the discrete approximation of a partial differential equation. An important fact is that the symmetry on the state space differs from the popular spatial invariance property, which is not necessary for the present results. The relevance of the viewpoint is illustrated on two examples: (i) ill-conditioning of interaction matrices in coordination/consensus problems and (ii) the string instability issue. ©2009 IEEE.

Optimization Algorithms on Matrix Manifolds

This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms.

Enhancing and developing the practical optimisation capabilities and intelligence of automatic design software

In the modern engineering design cycle the use of computational tools becomes a neces- sity. The complexity of the engineering systems under consideration for design increases dramatically as the demands for advanced and innovative design concepts and engineering products is expanding. At the same time the advancements in the available technology in terms of computational resources and power, as well as the intelligence of the design software, accommodate these demands and make them a viable approach towards the chal- lenge of real-world engineering problems. This class of design optimisation problems is by nature multi-disciplinary. In the present work we establish enhanced optimisation capabil- ities within the Nimrod/O tool for massively distributed execution of computational tasks through cluster and computational grid resources, and develop the potential to combine and benefit from all the possible available technological advancements, both software and hardware. We develop the interface between a Free Form Deformation geometry manage- ment in-house code with the 2D airfoil aerodynamic efficiency evaluation tool XFoil, and the well established multi-objective heuristic optimisation algorithm NSGA-II. A simple airfoil design problem has been defined to demonstrate the functionality of the design sys- tem, but also to accommodate a framework for future developments and testing with other state-of-the-art optimisation algorithms such as the Multi-Objective Genetic Algorithm (MOGA) and the Multi-Objective Tabu Search (MOTS) techniques. Ultimately, heav- ily computationally expensive industrial design cases can be realised within the presented framework that could not be investigated before. © 2012 by the authors. Published by the American Institute of Aeronautics and Astronautics, Inc.

Enhancing and developing the practical optimisation capabilities and intelligence of automatic design software

In the modern engineering design cycle the use of computational tools becomes a necessity. The complexity of the engineering systems under consideration for design increases dramatically as the demands for advanced and innovative design concepts and engineering products is expanding. At the same time the advancements in the available technology in terms of computational resources and power, as well as the intelligence of the design software, accommodate these demands and make them a viable approach towards the challenge of real-world engineering problems. This class of design optimisation problems is by nature multi-disciplinary. In the present work we establish enhanced optimisation capabilities within the Nimrod/O tool for massively distributed execution of computational tasks through cluster and computational grid resources, and develop the potential to combine and benefit from all the possible available technological advancements, both software and hardware. We develop the interface between a Free Form Deformation geometry management in-house code with the 2D airfoil aerodynamic efficiency evaluation tool XFoil, and the well established multi-objective heuristic optimisation algorithm NSGA-II. A simple airfoil design problem has been defined to demonstrate the functionality of the design system, but also to accommodate a framework for future developments and testing with other state-of-the-art optimisation algorithms such as the Multi-Objective Genetic Algorithm (MOGA) and the Multi-Objective Tabu Search (MOTS) techniques. Ultimately, heavily computationally expensive industrial design cases can be realised within the presented framework that could not be investigated before. ©2012 AIAA.

Exploring an effective model of new product development in medical devices: A knowledge cluster approach

This study proposes a new product development (NPD) model that aims to improve the effectiveness of innovative NPD in the medical devices. By adopting open innovation theory and applying an in-depth investigation methodology, this paper proposes a knowledge cluster that improves the integration of interdisciplinary human resources and enhances the acquirement of innovative technologies. A knowledge cluster approach helps gather, organise, synthesise, and accumulate knowledge in order to become the impetus for innovation. Although enterprises are no longer the principals of research and development, they should still be capable of integrating professional physicians, external groups, and individuals through the knowledge cluster platform. However, in order to support an effective NPD model, enterprises should provide adequate incentives and trust to external individuals or groups willing to contribute their expertise and knowledge to this knowledge cluster platform. Copyright © 2013 Inderscience Enterprises Ltd.

Reactive Many-Body Expansion for a Protonated Water Cluster.

We generalize the standard many-body expansion technique that is used to approximate the total energy of a molecular system to enable the treatment of chemical reactions by quantum chemical techniques. By considering all possible assignments of atoms to monomer units of the many-body expansion and associating suitable weights with each, we construct a potential energy surface that is a smooth function of the nuclear positions. We derive expressions for this reactive many-body expansion energy and describe an algorithm for its evaluation, which scales polynomially with system size, and therefore will make the method feasible for future condensed phase simulations. We demonstrate the accuracy and smoothness of the resulting potential energy surface on a molecular dynamics trajectory of the protonated water hexamer, using the Hartree-Fock method for the many-body term and Møller-Plesset theory for the low order terms of the many-body expansion.

A gene cluster that regulates both heterocyst differentiation and pattern formation in Anabaena sp strain PCC 7120

Wild-type Anabaena sp. strain PCC 7120, a filamentous nitrogen-fixing cyanobacterium, produces single heterocysts at semi-regular intervals. asr0100 (patU5) and alr0101 (patU3) are homologous to the 5' and 3' portions of patU of Nostoc punctiforme. alr0099 (hetZ) overlaps the 5' end of patU5. hetZ, patU5 and patU3 were all upregulated, or expressed specifically, in proheterocysts and heterocysts. Mutants of hetZ showed delayed or no heterocyst differentiation. In contrast, a patU3 mutation produced a multiple contiguous heterocyst (Mch) phenotype and restored the formation of otherwise lost intercalary heterocysts in a patA background. Decreasing the expression of patU3 greatly increased the frequency of heterocysts in a mini-patS strain. Two promoter regions and two principal, corresponding transcripts were detected in the hetZ-patU5-patU3 region. Transcription of hetZ was upregulated in a hetZ mutant and downregulated in a patU3 mutant. When mutants hetZ::C.K2 and hetZ::Tn5-1087b were nitrogen-deprived, P-hetC-gfp was very weakly expressed, and in hetZ::Tn5-1087b, P-hetR-gfp was relatively strongly expressed in cells that had neither a regular pattern nor altered morphology. We conclude that the hetZ-patU5-patU3 cluster plays an important role in co-ordination of heterocyst differentiation and pattern formation. The presence of homologous clusters in filamentous genera without heterocysts is suggestive of a more general role.

Optimization algorithms and ODE's in MDO

There is a need for a stronger theoretical understanding of Multidisciplinary Design Optimization (MDO) within the field. Having developed a differential geometry framework in response to this need, we consider how standard optimization algorithms can be modeled using systems of ordinary differential equations (ODEs) while also reviewing optimization algorithms which have been derived from ODE solution methods. We then use some of the framework's tools to show how our resultant systems of ODEs can be analyzed and their behaviour quantitatively evaluated. In doing so, we demonstrate the power and scope of our differential geometry framework, we provide new tools for analyzing MDO systems and their behaviour, and we suggest hitherto neglected optimization methods which may prove particularly useful within the MDO context. Copyright © 2013 by ASME.