Ephemeral point-events: is there a last remnant of physical objectivity?

For the past two decades, Einstein's Hole Argument (which deals with the apparent indeterminateness of general relativity due to the general covariance of the field equations) and its resolution in terms of Leibniz equivalence (the statement that Riemannian geometries related by active diffeomorphisms represent the same physical solution) have been the starting point for a lively philosophical debate on the objectivity of the point-events of space-time. It seems that Leibniz equivalence makes it impossible to consider the points of the space-time manifold as physically individuated without recourse to dynamical individuating fields. Various authors have posited that the metric field itself can be used in this way, but nobody so far has considered the problem of explicitly distilling the metrical fingerprint of point-events from the gauge-dependent components of the metric field. Working in the Hamiltonian formulation of general relativity, and building on the results of Lusanna and Pauri (2002), we show how Bergmann and Komar's intrinsic pseudo-coordinates (based on the value of curvature invariants) can be used to provide a physical individuation of point-events in terms of the true degrees of freedom (the Dirac observables) of the gravitational field, and we suggest how this conceptual individuation could in principle be implemented with a well-defined empirical procedure. We argue from these results that point-events retain a significant kind of physical objectivity.Comment: LaTeX, natbib, 34 pages. Final journal versio

TW-TOA based positioning in the presence of clock imperfections

This manuscript studies the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in semi-asynchronous wireless sensor networks in which the clock of a target node is unsynchronized with the reference time. Since the optimal estimator for this problem involves difficult nonconvex optimization, two suboptimal estimators are proposed based on the squared-range least squares and the least absolute mean of residual errors. We formulated the former approach as an extended general trust region subproblem (EGTR) and propose a simple technique to solve it approximately. The latter approach is formulated as a difference of convex functions programming (DCP), which can be solved using a concave–convex procedure. Simulation results illustrate the high performance of the proposed techniques, especially for the DCP approach