Foraging habitats and utilization distributions of Black-necked Cranes wintering at the Napahai Wetland, China

One of the most endangered populations of Black-necked Cranes (Grus nigricollis), the central population, is declining due to habitat loss and degradation, but little is known about their space use patterns and habitat preferences. We examined the space use and habitat preferences of Black-necked Cranes during the winter of 2007-2008 at the Napahai wetland in northwest Yunnan, China, where approximately 300 Black-necked Cranes (>90% of the total central population) spent the winter. Euclidean distance analysis was employed to determine the habitat preferences of Black-necked Cranes, and a local nearest-neighbor, convex-hull construction method was used to examine space use. Our results indicate that Black-necked Cranes preferred shallow marsh and wet meadow habitats and avoided farmland and dry grassland. Core-use areas (50% isopleths) and total-use areas (100% isopleths) accounted for only 1.2% and 28.2% of the study area, respectively. We recommend that habitat protection efforts focus on shallow marsh and wet meadow habitats to maintain preferred foraging sites. Core-use areas, such as the primary foraging areas of Black-necked Cranes, should be designated as part of the core zone of the nature reserve. Monthly shifts in the core-use areas of the cranes also indicate that the reserve should be large enough to permit changes in space use. In addition to preserving habitat, government officials should also take measures to decrease human activity in areas used by foraging Black-necked Cranes.

High order schemes on three-dimensional general polyhedral meshes - Application to the level set method

In this article, we detail the methodology developed to construct arbitrarily high order schemes - linear and WENO - on 3D mixed-element unstructured meshes made up of general convex polyhedral elements. The approach is tailored specifically for the solution of scalar level set equations for application to incompressible two-phase flow problems. The construction of WENO schemes on 3D unstructured meshes is notoriously difficult, as it involves a much higher level of complexity than 2D approaches. This due to the multiplicity of geometrical considerations introduced by the extra dimension, especially on mixed-element meshes. Therefore, we have specifically developed a number of algorithms to handle mixed-element meshes composed of convex polyhedra with convex polygonal faces. The contribution of this work concerns several areas of interest: the formulation of an improved methodology in 3D, the minimisation of computational runtime in the implementation through the maximum use of pre-processing operations, the generation of novel methods to handle complex 3D mixed-element meshes and finally the application of the method to the transport of a scalar level set. © 2012 Global-Science Press.

Vehicle trajectory linearisation to enable efficient optimisation of the constant speed racing line

A driver model is presented capable of optimising the trajectory of a simple dynamic nonlinear vehicle, at constant forward speed, so that progression along a predefined track is maximised as a function of time. In doing so, the model is able to continually operate a vehicle at its lateral-handling limit, maximising vehicle performance. The technique used forms a part of the solution to the motor racing objective of minimising lap time. A new approach of formulating the minimum lap time problem is motivated by the need for a more computationally efficient and robust tool-set for understanding on-the-limit driving behaviour. This has been achieved through set point-dependent linearisation of the vehicle model and coupling the vehicle-track system using an intrinsic coordinate description. Through this, the geometric vehicle trajectory had been linearised relative to the track reference, leading to new path optimisation algorithm which can be formed as a computationally efficient convex quadratic programming problem. © 2012 Copyright Taylor and Francis Group, LLC.

Wrapping the cube and other polyhedra

An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double covers of the cube, is described with the aid of the two-parameter Goldberg- Coxeter construction. The strands of all such wrappings correspond to the central circuits (CCs) of octahedrites (four-regular polyhedral graphs with square and triangular faces), which for the cube necessarily have octahedral symmetry. Removing the symmetry constraint leads to wrappings of other eight-vertex convex polyhedra. Moreover, wrappings of convex polyhedra with fewer vertices can be generated by generalizing from octahedrites to i-hedrites, which additionally include digonal faces. When the strands of a wrapping correspond to the CCs of a four-regular graph that includes faces of size greater than 4, non-convex 'crinkled' wrappings are generated. The various generalizations have implications for activities as diverse as the construction of woven-closed baskets and the manufacture of advanced composite components of complex geometry. © 2012 The Royal Society.

Negative index photonic crystal lenses based on carbon nanotube arrays

We report a novel utilization of periodic arrays of carbon nanotubes in the realization of diffractive photonic crystal lenses. Carbon nanotube arrays with nanoscale dimensions (lattice constant 400 nm and tube radius 50 nm) displayed a negative refractive index in the optical regime where the wavelength is of the order of array spacing. A detailed computational analysis of band gaps and optical transmission through the nanotubes based planar, convex and concave shaped lenses was performed. Due to the negative-index these lenses behaved in an opposite fashion compared to their conventional counter parts. A plano-concave lens was established and numerically tested, displaying ultra-small focal length of 1.5 μm (∼2.3 λ) and a near diffraction-limited spot size of 400 nm (∼0.61 λ). © 2012 Elsevier B.V. All rights reserved.

Density stratified environments: The double-tank method

We present an alternative method of producing density stratifications in the laboratory based on the 'double-tank' method proposed by Oster (Sci Am 213:70-76, 1965). We refer to Oster's method as the 'forced-drain' approach, as the volume flow rates between connecting tanks are controlled by mechanical pumps. We first determine the range of density profiles that may be established with the forced-drain approach other than the linear stratification predicted by Oster. The dimensionless density stratification is expressed analytically as a function of three ratios: the volume flow rate ratio n, the ratio of the initial liquid volumes λ and the ratio of the initial densities ψ. We then propose a method which does not require pumps to control the volume flow rates but instead allows the connecting tanks to drain freely under gravity. This is referred to as the 'free-drain' approach. We derive an expression for the density stratification produced and compare our predictions with saline stratifications established in the laboratory using the 'free-drain' extension of Oster's method. To assist in the practical application of our results we plot the region of parameter space that yield concave/convex or linear density profiles for both forced-drain and free-drain approaches. The free-drain approach allows the experimentalist to produce a broad range of density profiles by varying the initial liquid depths, cross-sectional and drain opening areas of the tanks. One advantage over the original Oster approach is that density profiles with an inflexion point can now be established. © 2008 Springer-Verlag.

Distributed flow algorithms for scalable similarity visualization

We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.

Generalized power method for sparse principal component analysis

In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed. © 2010 Michel Journée, Yurii Nesterov, Peter Richtárik and Rodolphe Sepulchre.

Consensus under general convexity

A method is proposed to characterize contraction of a set through orthogonal projections. For discrete-time multi-agent systems, quantitative estimates of convergence (to a consensus) rate are provided by means of contracting convex sets. Required convexity for the sets that should include the values that the transition maps of agents take is considered in a more general sense than that of Euclidean geometry. © 2007 IEEE.

Quantitative convergence analysis of multi-agent systems

We introduce a characterization of contraction for bounded convex sets. For discrete-time multi-agent systems we provide an explicit upperbound on the rate of convergence to a consensus under the assumptions of contractiveness and (weak) connectedness (across an interval.) Convergence is shown to be exponential when either the system or the function characterizing the contraction is linear. Copyright © 2007 IFAC.

Collective motion of self-propelled particles: Stabilizing symmetric formations on closed curves

We provide feedback control laws to stabilize formations of multiple, unit speed particles on smooth, convex, and closed curves with definite curvature. As in previous work we exploit an analogy with coupled phase oscillators to provide controls which isolate symmetric particle formations that are invariant to rigid translation of all the particles. In this work, we do not require all particles to be able to communicate; rather we assume that inter-particle communication is limited and can be modeled by a fixed, connected, and undirected graph. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. The methodology is demonstrated using a superellipse, which is a type of curve that includes circles, ellipses, and rounded rectangles. These results can be used in applications involving multiple autonomous vehicles that travel at constant speed around fixed beacons. ©2006 IEEE.

Control of aircraft in the terminal manoeuvring area using parallelised sequential Monte Carlo

This paper reports on the use of a parallelised Model Predictive Control, Sequential Monte Carlo algorithm for solving the problem of conflict resolution and aircraft trajectory control in air traffic management specifically around the terminal manoeuvring area of an airport. The target problem is nonlinear, highly constrained, non-convex and uses a single decision-maker with multiple aircraft. The implementation includes a spatio-temporal wind model and rolling window simulations for realistic ongoing scenarios. The method is capable of handling arriving and departing aircraft simultaneously including some with very low fuel remaining. A novel flow field is proposed to smooth the approach trajectories for arriving aircraft and all trajectories are planned in three dimensions. Massive parallelisation of the algorithm allows solution speeds to approach those required for real-time use.

Computational analysis of liquid crystalline elastomer membranes: Changing Gaussian curvature without stretch energy

Liquid crystalline elastomers (LCEs) can undergo extremely large reversible shape changes when exposed to external stimuli, such as mechanical deformations, heating or illumination. The deformation of LCEs result from a combination of directional reorientation of the nematic director and entropic elasticity. In this paper, we study the energetics of initially flat, thin LCE membranes by stress driven reorientation of the nematic director. The energy functional used in the variational formulation includes contributions depending on the deformation gradient and the second gradient of the deformation. The deformation gradient models the in-plane stretching of the membrane. The second gradient regularises the non-convex membrane energy functional so that infinitely fine in-plane microstructures and infinitely fine out-of-plane membrane wrinkling are penalised. For a specific example, our computational results show that a non-developable surface can be generated from an initially flat sheet at cost of only energy terms resulting from the second gradients. That is, Gaussian curvature can be generated in LCE membranes without the cost of stretch energy in contrast to conventional materials. © 2013 Elsevier Ltd. All rights reserved.

Modeling the carbon nanofiber addressed liquid crystal microlens array from experimentally observed optical phenomena

This paper presents a novel method of using experimentally observed optical phenomena to reverse-engineer a model of the carbon nanofiber-addressed liquid crystal microlens array (C-MLA) using Zemax. It presents the first images of the optical profile for the C-MLA along the optic axis. The first working optical models of the C-MLA have been developed by matching the simulation results to the experimental results. This approach bypasses the need to know the exact carbon nanofiber-liquid crystal interaction and can be easily adapted to other systems where the nature of an optical device is unknown. Results show that the C-MLA behaves like a simple lensing system at 0.060-0.276 V/μm. In this lensing mode the C-MLA is successfully modeled as a reflective convex lens array intersecting with a flat reflective plane. The C-MLA at these field strengths exhibits characteristics of mostly spherical or low order aspheric arrays, with some aspects of high power aspherics. It also exhibits properties associated with varying lens apertures and strengths, which concur with previously theorized models based on E-field patterns. This work uniquely provides evidence demonstrating an apparent "rippling" of the liquid crystal texture at low field strengths, which were successfully reproduced using rippled Gaussian-like lens profiles. © 2014 Published by Elsevier B.V.

Refining sparse principal components

In this paper, we discuss methods to refine locally optimal solutions of sparse PCA. Starting from a local solution obtained by existing algorithms, these methods take advantage of convex relaxations of the sparse PCA problem to propose a refined solution that is still locally optimal but with a higher objective value. © 2010 Springer -Verlag Berlin Heidelberg.