A new distance for scale-invariant 3D shape recognition and registration

This paper presents a method for vote-based 3D shape recognition and registration, in particular using mean shift on 3D pose votes in the space of direct similarity transforms for the first time. We introduce a new distance between poses in this spacethe SRT distance. It is left-invariant, unlike Euclidean distance, and has a unique, closed-form mean, in contrast to Riemannian distance, so is fast to compute. We demonstrate improved performance over the state of the art in both recognition and registration on a real and challenging dataset, by comparing our distance with others in a mean shift framework, as well as with the commonly used Hough voting approach. © 2011 IEEE.

An ngram-based statistical machine translation decoder

In this paper we describe MARIE, an Ngram-based statistical machine translation decoder. It is implemented using a beam search strategy, with distortion (or reordering) capabilities. The underlying translation model is based on an Ngram approach, extended to introduce reordering at the phrase level. The search graph structure is designed to perform very accurate comparisons, what allows for a high level of pruning, improving the decoder efficiency. We report several techniques for efficiently prune out the search space. The combinatory explosion of the search space derived from the search graph structure is reduced by limiting the number of reorderings a given translation is allowed to perform, and also the maximum distance a word (or a phrase) is allowed to be reordered. We finally report translation accuracy results on three different translation tasks.

Long Distance Wireless Networking for Site - Office Data Communications

Effective data communications between the project site and decision making office can be critical for the success of a construction project. It allows convenient access to centrally stored information and allows centrally located decision makers to remotely monitor the site and collect data in real-time. However, high bandwidth, flexible data communication networks, such as wired local area networks, can often be time-consuming and costly to deploy for such purposes especially when project sites (dams, highways, etc.) are located in rural, undeveloped areas where networking infrastructure is not available. In such construction sites, wireless networking could reliably link the construction site and the decision-making office. This paper presents a case study on long-distance, site – office wireless data communications. The purpose was to investigate the capability of wireless technology in exchanging construction data in a fast and efficient manner and in allowing site personnel to interact and share knowledge and data with the office staff. This study took place at the University of Michigan’s campus where performance, reliability, and cost/benefit tests were performed. The indoor and outdoor tests performed demonstrated the suitability of this technology for office-site data communications and exposed the need for more research to further improve the reliability and data handling of this technology.

Recoil distance method lifetime measurements in 107Cd and 103Pd

Preliminary lifetime values have been measured for a number of near-yrast states in the odd-A transitional nuclei 107Cd and 103Pd. The reaction used to populate the nuclei of interest was 98Mo( 12C,3nxα)107Cd, 103Pd, with the beam delivered by the tandem accelerator of the Wright Nuclear Structure Laboratory at an incident beam energy of 60 MeV. Our experiment was aimed at the investigation of collective excitations built on the unnatural parity, ν h11/2 orbital, specifically by measuring the B(E2) values of decays from the excited levels built on this intrinsic structure, using the Doppler Recoil Distance Method. We report lifetimes and associated transition probabilities for decays from the 15/2- and the 19/2- states in 107Cd and the first measurement of the 15/2- state in 103Pd. These results suggest that neither a simple rotational or vibrational interpretation is sufficient to explain the observed structures. © 2006 American Institute of Physics.

Large scale heterogeneous networks, the Davis-Wielandt shell, and graph separation

We consider a large scale network of interconnected heterogeneous dynamical components. Scalable stability conditions are derived that involve the input/output properties of individual subsystems and the interconnection matrix. The analysis is based on the Davis-Wielandt shell, a higher dimensional version of the numerical range with important convexity properties. This can be used to allow heterogeneity in the agent dynamics while relaxing normality and symmetry assumptions on the interconnection matrix. The results include small gain and passivity approaches as special cases, with the three dimensional shell shown to be inherently connected with corresponding graph separation arguments. © 2012 Society for Industrial and Applied Mathematics.

Balanced realisations of all-pass systems using exact arithmetic with application to the approximation of delay systems

Numerically well-conditioned state-space realisations for all-pass systems, such as Padé approximations to exp(-s), are derived that can be computed using exact integer arithmetic. This is then applied to the a series of functions of exp(-s). It is also shown that the H-infinity norm of the transfer function from the input to the state of a balanced realisation of the Padé approximation of exp(-s) is unity. © 2012 IEEE.

Mobilization distance for upheaval buckling of shallowly buried pipelines

Buried pipelines may be subject to upheaval buckling because of thermally induced compressive stresses. As the buckling load of a strut decreases with increasing out of straightness, not only the maximum available resistance from the soil cover, but also the movement of the pipeline required to mobilize this are important factors in design. This paper will describe the results of 15 full-scale laboratory tests that have been carried out on pipeline uplift in both sandy and rocky backfills. The cover to diameter ratio ranged from 0.1 to 6. The results show that mobilization distance exhibits a linear relationship with H=D ratio and that the postpeak uplift force-displacement response can be accurately modeled using existing models. A tentative design approach is suggested; the maximum available uplift resistance may be reliably predicted from the postpeak response, and the mobilization distance may be predicted using the relationships described in this paper. © 2012 American Society of Civil Engineers.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

From subspace learning to distance learning: A geometrical optimization approach

In this paper, we adopt a differential-geometry viewpoint to tackle the problem of learning a distance online. As this problem can be cast into the estimation of a fixed-rank positive semidefinite (PSD) matrix, we develop algorithms that exploits the rich geometry structure of the set of fixed-rank PSD matrices. We propose a method which separately updates the subspace of the matrix and its projection onto that subspace. A proper weighting of the two iterations enables to continuously interpolate between the problem of learning a subspace and learning a distance when the subspace is fixed. © 2009 IEEE.