Optical trapping of carbon nanotubes and graphene

We study optical trapping of nanotubes and graphene. We extract the distribution of both centre-of-mass and angular fuctuations from three-dimensional tracking of these optically trapped carbon nanostructures. The optical force and torque constants are measured from auto and cross-correlation of the tracking signals. We demonstrate that nanotubes enable nanometer spatial, and femto-Newton force resolution in photonic force microscopy by accurately measuring the radiation pressure in a double frequency optical tweezers. Finally, we integrate optical trapping with Raman and photoluminescence spectroscopy demonstrating the use of a Raman and photoluminescence tweezers by investigating the spectroscopy of nanotubes and graphene fakes in solution. Experimental results are compared with calculations based on electromagnetic scattering theory. © 2011 by the Author(s); licensee Accademia Peloritana dei Pericolanti, Messina, Italy.

Two-orbit switch-pitch structures

The Hoberman 'switch-pitch ' ball is a transformable structure with a single folding and unfolding path. The underlying cubic structure has a novel mechanism that retains tetrahedral symmetry during folding. Here, we propose a generalized class of structures of a similar type that retain their full symmetry during folding. The key idea is that we require two orbits of nodes for the structure: within each orbit, any node can be copied to any other node by a symmetry operation. Each member is connected to two nodes, which may be in different orbits, by revolute joints. We will describe the symmetry analysis that reveals the symmetry of the internal mechanism modes for a switch-pitch structure. To follow the complete folding path of the structure, a nonlinear iterative predictor-corrector algorithm based on the Newton method is adopted. First, a simple tetrahedral example of the class of two-orbit structures is presented. Typical configurations along the folding path are shown. Larger members of the class of structures are also presented, all with cubic symmetry. These switch-pitch structures could have useful applications as deployable structures.

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.

Convex relaxation of mixture regression with efficient algorithms

We develop a convex relaxation of maximum a posteriori estimation of a mixture of regression models. Although our relaxation involves a semidefinite matrix variable, we reformulate the problem to eliminate the need for general semidefinite programming. In particular, we provide two reformulations that admit fast algorithms. The first is a max-min spectral reformulation exploiting quasi-Newton descent. The second is a min-min reformulation consisting of fast alternating steps of closed-form updates. We evaluate the methods against Expectation-Maximization in a real problem of motion segmentation from video data.

An efficient approach of modelling the flexural cracking behaviour of un-notched plain concrete prisms subject to monotonic and cyclic loading

In the field of vibration-based damage detection of concrete structures efficient damage models are needed to better understand changes in the vibration properties of cracked structures. These models should quantitatively replicate the damage mechanisms in concrete and easily be used as damage detection tools. In this paper, the flexural cracking behaviour of plain concrete prisms subject to monotonic and cyclic loading regimes under displacement control is tested experimentally and modelled numerically. Four-point bending tests on simply supported un-notched prisms are conducted, where the cracking process is monitored using a digital image correlation system. A numerical model, with a single crack at midspan, is presented where the cracked zone is modelled using the fictitious crack approach and parts outside that zone are treated in a linear-elastic manner. The model considers crack initiation, growth and closure by adopting cyclic constitutive laws. A multi-variate Newton-Raphson iterative solver is used to solve the non-linear equations to ensure equilibrium and compatibility at the interface of the cracked zone. The numerical results agree well with the experiments for both loading scenarios. The model shows good predictions of the degradation of stiffness with increasing load. It also approximates the crack-mouth-opening-displacement when compared with the experimental data of the digital image correlation system. The model is found to be computationally efficient as it runs full analysis for cyclic loading in less than 2. min, and it can therefore be used within the damage detection process. © 2013 Elsevier Ltd.

Cubically convergent iterations for invariant subspace computation

We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of ℝ n and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global behavior of the iterations.

Riemannian geometry of Grassmann manifolds with a view on algorithmic computation

We give simple formulas for the canonical metric, gradient, Lie derivative, Riemannian connection, parallel translation, geodesics and distance on the Grassmann manifold of p-planes in ℝn. In these formulas, p-planes are represented as the column space of n × p matrices. The Newton method on abstract Riemannian manifolds proposed by Smith is made explicit on the Grassmann manifold. Two applications - computing an invariant subspace of a matrix and the mean of subspaces - are worked out.

A Grassman-Rayleigh quotient iteration for computing invariant subspaces

The classical Rayleigh Quotient Iteration (RQI) computes a 1-dimensional invariant subspace of a symmetric matrix A with cubic convergence. We propose a generalization of the RQI which computes a p-dimensional invariant subspace of A. The geometry of the algorithm on the Grassmann manifold Gr(p,n) is developed to show cubic convergence and to draw connections with recently proposed Newton algorithms on Riemannian manifolds.

Optimization on manifolds: Methods and applications

This paper provides an introduction to the topic of optimization on manifolds. The approach taken uses the language of differential geometry, however,we choose to emphasise the intuition of the concepts and the structures that are important in generating practical numerical algorithms rather than the technical details of the formulation. There are a number of algorithms that can be applied to solve such problems and we discuss the steepest descent and Newton's method in some detail as well as referencing the more important of the other approaches.There are a wide range of potential applications that we are aware of, and we briefly discuss these applications, as well as explaining one or two in more detail. © 2010 Springer -Verlag Berlin Heidelberg.