The Kato square root problem on vector bundles with generalised bounded geometry

We consider smooth, complete Riemannian manifolds which are exponentially locally doubling. Under a uniform Ricci curvature bound and a uniform lower bound on injectivity radius, we prove a Kato square root estimate for certain coercive operators over the bundle of finite rank tensors. These results are obtained as a special case of similar estimates on smooth vector bundles satisfying a criterion which we call generalised bounded geometry. We prove this by establishing quadratic estimates for perturbations of Dirac type operators on such bundles under an appropriate set of assumptions.Comment: Slight technical modification of the notion of "GBG constant section" on page 7, and a few technical modifications to Proposition 8.4, 8.6, 8.

Weighted maximal regularity estimates and solvability of non-smooth elliptic systems II

We continue the development, by reduction to a first order system for the conormal gradient, of $L^2$ \textit{a priori} estimates and solvability for boundary value problems of Dirichlet, regularity, Neumann type for divergence form second order, complex, elliptic systems. We work here on the unit ball and more generally its bi-Lipschitz images, assuming a Carleson condition as introduced by Dahlberg which measures the discrepancy of the coefficients to their boundary trace near the boundary. We sharpen our estimates by proving a general result concerning \textit{a priori} almost everywhere non-tangential convergence at the boundary. Also, compactness of the boundary yields more solvability results using Fredholm theory. Comparison between classes of solutions and uniqueness issues are discussed. As a consequence, we are able to solve a long standing regularity problem for real equations, which may not be true on the upper half-space, justifying \textit{a posteriori} a separate work on bounded domains.Comment: 76 pages, new abstract and few typos corrected. The second author has changed nam

Categorization of indoor places by combining local binary pattern histograms of range and reflectance data from laser range finders

This paper presents an approach to categorize typical places in indoor environments using 3D scans provided by a laser range finder. Examples of such places are offices, laboratories, or kitchens. In our method, we combine the range and reflectance data from the laser scan for the final categorization of places. Range and reflectance images are transformed into histograms of local binary patterns and combined into a single feature vector. This vector is later classified using support vector machines. The results of the presented experiments demonstrate the capability of our technique to categorize indoor places with high accuracy. We also show that the combination of range and reflectance information improves the final categorization results in comparison with a single modality

Discovery of multiple Lorentzian components in the X-ray timing properties of the Narrow Line Seyfert 1 Ark 564

We present a power spectral analysis of a 100 ksec XMM-Newton observation of the narrow line Seyfert 1 galaxy Ark~564. When combined with earlier RXTE and ASCA observations, these data produce a power spectrum covering seven decades of frequency which is well described by a power law with two very clear breaks. This shape is unlike the power spectra of almost all other AGN observed so far, which have only one detected break, and resemble Galactic binary systems in a soft state. The power spectrum can also be well described by the sum of two Lorentzian-shaped components, the one at higher frequencies having a hard spectrum, similar to those seen in Galactic binary systems. Previously we have demonstrated that the lag of the hard band variations relative to the soft band in Ark 564 is dependent on variability time-scale, as seen in Galactic binary sources. Here we show that the time-scale dependence of the lags can be described well using the same two-Lorentzian model which describes the power spectrum, assuming that each Lorentzian component has a distinct time lag. Thus all X-ray timing evidence points strongly to two discrete, localised, regions as the origin of most of the variability. Similar behaviour is seen in Galactic X-ray binary systems in most states other than the soft state, i.e. in the low-hard and intermediate/very high states. Given the very high accretion rate of Ark 564 the closest analogy is with the very high (intermediate) state rather than the low-hard state. We therefore strengthen the comparison between AGN and Galactic binary sources beyond previous studies by extending it to the previously poorly studied very high accretion rate regime.Comment: 11 pages, 11 figures, accepted for publication in MNRA

Adaptive grid methods for Q-tensor theory of liquid crystals : a one-dimensional feasibility study

This paper illustrates the use of moving mesh methods for solving partial differential equation (PDE) problems in Q-tensor theory of liquid crystals. We present the results of an initial study using a simple one-dimensional test problem which illustrates the feasibility of applying adaptive grid techniques in such situations. We describe how the grids are computed using an equidistribution principle, and investigate the comparative accuracy of adaptive and uniform grid strategies, both theoretically and via numerical examples

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\mathcal{O}(n)}$ on the size of nondeterministic finite automata (NFAs) representing the subword closure of a CFG of size $n$. (2) We present a family of CFGs for which the minimal deterministic finite automata representing their subword closure matches the upper-bound of $2^{2^{\mathcal{O}(n)}}$ following from (1). Furthermore, we prove that the inequivalence problem for NFAs representing sub- or superword-closed languages is only NP-complete as opposed to PSPACE-complete for general NFAs. Finally, we extend our results into an approximation method to attack inequivalence problems for CFGs

A multidomain spectral method for solving elliptic equations

We present a new solver for coupled nonlinear elliptic partial differential equations (PDEs). The solver is based on pseudo-spectral collocation with domain decomposition and can handle one- to three-dimensional problems. It has three distinct features. First, the combined problem of solving the PDE, satisfying the boundary conditions, and matching between different subdomains is cast into one set of equations readily accessible to standard linear and nonlinear solvers. Second, touching as well as overlapping subdomains are supported; both rectangular blocks with Chebyshev basis functions as well as spherical shells with an expansion in spherical harmonics are implemented. Third, the code is very flexible: The domain decomposition as well as the distribution of collocation points in each domain can be chosen at run time, and the solver is easily adaptable to new PDEs. The code has been used to solve the equations of the initial value problem of general relativity and should be useful in many other problems. We compare the new method to finite difference codes and find it superior in both runtime and accuracy, at least for the smooth problems considered here.Comment: 31 pages, 8 figure

Improving the condition number of estimated covariance matrices

High dimensional error covariance matrices and their inverses are used to weight the contribution of observation and background information in data assimilation procedures. As observation error covariance matrices are often obtained by sampling methods, estimates are often degenerate or ill-conditioned, making it impossible to invert an observation error covariance matrix without the use of techniques to reduce its condition number. In this paper we present new theory for two existing methods that can be used to ‘recondition’ any covariance matrix: ridge regression, and the minimum eigenvalue method. We compare these methods with multiplicative variance inflation, which cannot alter the condition number of a matrix, but is often used to account for neglected correlation information. We investigate the impact of reconditioning on variances and correlations of a general covariance matrix in both a theoretical and practical setting. Improved theoretical understanding provides guidance to users regarding method selection, and choice of target condition number. The new theory shows that, for the same target condition number, both methods increase variances compared to the original matrix, with larger increases for ridge regression than the minimum eigenvalue method. We prove that the ridge regression method strictly decreases the absolute value of off-diagonal correlations. Theoretical comparison of the impact of reconditioning and multiplicative variance inflation on the data assimilation objective function shows that variance inflation alters information across all scales uniformly, whereas reconditioning has a larger effect on scales corresponding to smaller eigenvalues. We then consider two examples: a general correlation function, and an observation error covariance matrix arising from interchannel correlations. The minimum eigenvalue method results in smaller overall changes to the correlation matrix than ridge regression, but can increase off-diagonal correlations. Data assimilation experiments reveal that reconditioning corrects spurious noise in the analysis but underestimates the true signal compared to multiplicative variance inflation

Searching for hidden mirror symmetries in CMB fluctuations from WMAP 7 year maps

We search for hidden mirror symmetries at large angular scales in the WMAP 7 year Internal Linear Combination map of CMB temperature anisotropies using global pixel based estimators introduced for this aim. Two different axes are found for which the CMB intensity pattern is anomalously symmetric (or anti-symmetric) under reflection with respect to orthogonal planes at the 99.84(99.96)% CL (confidence level), if compared to a result for an arbitrary axis in simulations without the symmetry. We have verified that our results are robust to the introduction of the galactic mask. The direction of such axes is close to the CMB kinematic dipole and nearly orthogonal to the ecliptic plane, respectively. If instead the real data are compared to those in simulations taken with respect to planes for which the maximal mirror symmetry is generated by chance, the confidence level decreases to 92.39 (76.65)%. But when the effect in question translates into the anomalous alignment between normals to planes of maximal mirror (anti)-symmetry and these natural axes mentioned. We also introduce the representation of the above estimators in the harmonic domain, confirming the results obtained in the pixel one. The symmetry anomaly is shown to be almost entirely due to low multipoles, so it may have a cosmological and even primordial origin. Contrary, the anti-symmetry one is mainly due to intermediate multipoles that probably suggests its non-fundamental nature. We have demonstrated that these anomalies are not connected to the known issue of the low variance in WMAP observations and we have checked that axially symmetric parts of these anomalies are small, so that the axes are not the symmetry ones.Comment: 18 pages, 10 figures, 2 tables. Consideration and discussion expanded, 5 figures and 1 table added, main conclusions unchange