Retrieving dynamic origin-destination matrices from Bluetooth data

The Bluetooth technology is being increasingly used, among the Automated Vehicle Identification Systems, to retrieve important information about urban networks. Because the movement of Bluetooth-equipped vehicles can be monitored, throughout the network of Bluetooth sensors, this technology represents an effective means to acquire accurate time dependant Origin Destination information. In order to obtain reliable estimations, however, a number of issues need to be addressed, through data filtering and correction techniques. Some of the main challenges inherent to Bluetooth data are, first, that Bluetooth sensors may fail to detect all of the nearby Bluetooth-enabled vehicles. As a consequence, the exact journey for some vehicles may become a latent pattern that will need to be estimated. Second, sensors that are in close proximity to each other may have overlapping detection areas, thus making the task of retrieving the correct travelled path even more challenging. The aim of this paper is twofold: to give an overview of the issues inherent to the Bluetooth technology, through the analysis of the data available from the Bluetooth sensors in Brisbane; and to propose a method for retrieving the itineraries of the individual Bluetooth vehicles. We argue that estimating these latent itineraries, accurately, is a crucial step toward the retrieval of accurate dynamic Origin Destination Matrices.

Random projections on manifolds of symmetric positive definite matrices for image classification

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.

Regulation of ROCK1 via Notch1 during breast cancer cell migration into dense matrices

Background The behaviour of tumour cells depends on factors such as genetics and the tumour microenvironment. The latter plays a crucial role in normal mammary gland development and also in breast cancer initiation and progression. Breast cancer tissues tend to be highly desmoplastic and dense matrix as a pre-existing condition poses one of the highest risk factors for cancer development. However, matrix influence on tumour cell gene expression and behaviour such as cell migration is not fully elucidated. Results We generated high-density (HD) matrices that mimicked tumour collagen content of 20 mg/cm3 that were ~14-fold stiffer than low-density (LD) matrix of 1 mg/cm3. Live-cell imaging showed breast cancer cells utilizing cytoplasmic streaming and cell body contractility for migration within HD matrix. Cell migration was blocked in the presence of both the ROCK inhibitor, Y-27632, and the MMP inhibitor, GM6001, but not by the drugs individually. This suggests roles for ROCK1 and MMP in cell migration are complicated by compensatory mechanisms. ROCK1 expression and protein activity, were significantly upregulated in HD matrix but these were blocked by treatment with a histone deacetylase (HDAC) inhibitor, MS-275. In HD matrix, the inhibition of ROCK1 by MS-275 was indirect and relied upon protein synthesis and Notch1. Inhibition of Notch1 using pooled siRNA or DAPT abrogated the inhibition of ROCK1 by MS-275. Conclusion Increased matrix density elevates ROCK1 activity, which aids in cell migration via cell contractility. The upregulation of ROCK1 is epigenetically regulated in an indirect manner involving the repression of Notch1. This is demonstrated from inhibition of HDACs by MS-275, which caused an upregulation of Notch1 levels leading to blockade of ROCK1 expression.

Estimating link-dependent origin-destination matrices from sample trajectories and traffic counts

In transport networks, Origin-Destination matrices (ODM) are classically estimated from road traffic counts whereas recent technologies grant also access to sample car trajectories. One example is the deployment in cities of Bluetooth scanners that measure the trajectories of Bluetooth equipped cars. Exploiting such sample trajectory information, the classical ODM estimation problem is here extended into a link-dependent ODM (LODM) one. This much larger size estimation problem is formulated here in a variational form as an inverse problem. We develop a convex optimization resolution algorithm that incorporates network constraints. We study the result of the proposed algorithm on simulated network traffic.

Estimating link-dependent origin-destination matrices from sample trajectories and traffic counts

Origin-Destination matrices (ODM) estimation can benefits of the availability of sample trajectories which can be measured thanks to recent technologies. This paper focus on the case of transport networks where traffic counts are measured by magnetic loops and sample trajectories available. An example of such network is the city of Brisbane, where Bluetooth detectors are now operating. This additional data source is used to extend the classical ODM estimation to a link-specific ODM (LODM) one using a convex optimisation resolution that incorporates networks constraints as well. The proposed algorithm is assessed on a simulated network.

A preconditioned numerical solver for stiff nonlinear reaction-diffusion equations with fractional Laplacians that avoids dense matrices

The numerical solution of fractional partial differential equations poses significant computational challenges in regard to efficiency as a result of the spatial nonlocality of the fractional differential operators. The dense coefficient matrices that arise from spatial discretisation of these operators mean that even one-dimensional problems can be difficult to solve using standard methods on grids comprising thousands of nodes or more. In this work we address this issue of efficiency for one-dimensional, nonlinear space-fractional reaction–diffusion equations with fractional Laplacian operators. We apply variable-order, variable-stepsize backward differentiation formulas in a Jacobian-free Newton–Krylov framework to advance the solution in time. A key advantage of this approach is the elimination of any requirement to form the dense matrix representation of the fractional Laplacian operator. We show how a banded approximation to this matrix, which can be formed and factorised efficiently, can be used as part of an effective preconditioner that accelerates convergence of the Krylov subspace iterative solver. Our approach also captures the full contribution from the nonlinear reaction term in the preconditioner, which is crucial for problems that exhibit stiff reactions. Numerical examples are presented to illustrate the overall effectiveness of the solver.

Improved estimation of size-transition matrices using tag-recapture data

We derive a new method for determining size-transition matrices (STMs) that eliminates probabilities of negative growth and accounts for individual variability. STMs are an important part of size-structured models, which are used in the stock assessment of aquatic species. The elements of STMs represent the probability of growth from one size class to another, given a time step. The growth increment over this time step can be modelled with a variety of methods, but when a population construct is assumed for the underlying growth model, the resulting STM may contain entries that predict negative growth. To solve this problem, we use a maximum likelihood method that incorporates individual variability in the asymptotic length, relative age at tagging, and measurement error to obtain von Bertalanffy growth model parameter estimates. The statistical moments for the future length given an individual's previous length measurement and time at liberty are then derived. We moment match the true conditional distributions with skewed-normal distributions and use these to accurately estimate the elements of the STMs. The method is investigated with simulated tag-recapture data and tag-recapture data gathered from the Australian eastern king prawn (Melicertus plebejus).

Standard errors and covariance matrices for smoothed rank estimators

A 'pseudo-Bayesian' interpretation of standard errors yields a natural induced smoothing of statistical estimating functions. When applied to rank estimation, the lack of smoothness which prevents standard error estimation is remedied. Efficiency and robustness are preserved, while the smoothed estimation has excellent computational properties. In particular, convergence of the iterative equation for standard error is fast, and standard error calculation becomes asymptotically a one-step procedure. This property also extends to covariance matrix calculation for rank estimates in multi-parameter problems. Examples, and some simple explanations, are given.

The connection between Mueller and Jones matrices of polarization optics

A necessary and sufficient condition for the 4 × 4 Mueller matrix to be derivable from the 2 × 2 Jones matrix is obtained. This condition allows one to determine if a given Mueller matrix describes a totally polarized system or a partially polarized (depolarizing) system. The result of Barakat is analysed in the light of this condition. A recently reported experimentally measured Mueller matrix is examined using this condition and is shown to represent a partially polarized system.

Improved estimation of size-transition matrices using tag-recapture data

We derive a new method for determining size-transition matrices (STMs) that eliminates probabilities of negative growth and accounts for individual variability. STMs are an important part of size-structured models, which are used in the stock assessment of aquatic species. The elements of STMs represent the probability of growth from one size class to another, given a time step. The growth increment over this time step can be modelled with a variety of methods, but when a population construct is assumed for the underlying growth model, the resulting STM may contain entries that predict negative growth. To solve this problem, we use a maximum likelihood method that incorporates individual variability in the asymptotic length, relative age at tagging, and measurement error to obtain von Bertalanffy growth model parameter estimates. The statistical moments for the future length given an individual’s previous length measurement and time at liberty are then derived. We moment match the true conditional distributions with skewed-normal distributions and use these to accurately estimate the elements of the STMs. The method is investigated with simulated tag–recapture data and tag–recapture data gathered from the Australian eastern king prawn (Melicertus plebejus).

Matrices of finite Lorentz transformations in a noncompact basis. III. Completeness relation for O(2, 1)

A parametrization of the elements of the three-dimensional Lorentz group O(2, 1), suited to the use of a noncompact O(1, 1) basis in its unitary representations, is derived and used to set up the representation matrices for the entire group. The Plancherel formula for O(2, 1) is then expressed in this basis.

A complete characterization of pre-Mueller and Mueller matrices in polarization optics

The Mueller-Stokes formalism that governs conventional polarization optics is formulated for plane waves, and thus the only qualification one could require of a 4 x 4 real matrix M in order that it qualify to be the Mueller matrix of some physical system would be that M map Omega((pol)), the positive solid light cone of Stokes vectors, into itself. In view of growing current interest in the characterization of partially coherent partially polarized electromagnetic beams, there is a need to extend this formalism to such beams wherein the polarization and spatial dependence are generically inseparably intertwined. This inseparability brings in additional constraints that a pre-Mueller matrix M mapping Omega((pol)) into itself needs to meet in order to be an acceptable physical Mueller matrix. These additional constraints are motivated and fully characterized. (C) 2010 Optical Society of America

Rolling tachyons, random matrices, and Coulomb gas thermodynamics

Time-dependent backgrounds in string theory provide a natural testing ground for physics concerning dynamical phenomena which cannot be reliably addressed in usual quantum field theories and cosmology. A good, tractable example to study is the rolling tachyon background, which describes the decay of an unstable brane in bosonic and supersymmetric Type II string theories. In this thesis I use boundary conformal field theory along with random matrix theory and Coulomb gas thermodynamics techniques to study open and closed string scattering amplitudes off the decaying brane. The calculation of the simplest example, the tree-level amplitude of n open strings, would give us the emission rate of the open strings. However, even this has been unknown. I will organize the open string scattering computations in a more coherent manner and will argue how to make further progress.