Seismic shaking has been regarded as an essential source of resurfacing on asteroids. The Small Carry‐on Impactor (SCI) operation on Hayabusa2 has been expected to be a unique opportunity for testing in situ seismic shaking whose energy is sufficiently large to excite observable surface modification. However, no obvious regolith hopping was identified even immediately outside of the crater formed by the SCI impact. To understand this discrepancy from the expectation, we simulate seismic wave propagation on Ryugu with a wide range of surface material properties and evaluate maximum acceleration on the surface. Numerical results reveal that low‐quality factor or low seismic efficiency is required to explain the lack of geomorphological change after the SCI experiment. Considering that scattering under anhydrous conditions cannot efficiently dissipate energy, such a low‐quality factor is not plausible. The weak yield strength in porous materials can efficiently decrease seismic wave energies, making the apparent seismic efficiency extremely low. Based on this hypothesis, we propose a formulation of surface mobility on asteroids that considers the physical properties of regolith. We consistently estimate the occurrence of seismic shaking with the existence of unstable boulders on Ryugu.
The bottom of Earth's mantle hosts strong seismic wave speed heterogeneities. These are commonly detected via forward modeling of seismic waveforms, which can include time‐consuming waveform synthesis and visual inspection. Furthermore, such imaging has been most commonly carried out with waves that have limited global coverage. In this work, we investigate the efficacy of the diffracted S () wavefield, which has global coverage to map core‐mantle boundary heterogeneity. We implement a Kirchhoff migration algorithm to objectively investigate the presence or absence of postcursors to , caused by ultralow velocity zones (ULVZs) and other sharp velocity contrasts. Our approach makes use of the expected moveout of ULVZ‐generated postcursors as a function of distance from great‐circle path at the base of the mantle. We investigate epicentral distances , where includes asymptotic S/ScS up to diffraction. We test the algorithm using synthetic waveforms calculated for models that include lowermost mantle wavespeed heterogeneity via a recently proposed hybrid simulation approach. Our results demonstrate that the migration approach, when applied to a single event, can well resolve the location of heterogeneity structures in the azimuthal direction, but is less accurate at constraining the along‐great circle path location. To locate ULVZ structure accurately, heterogeneity maps from different earthquakes with crisscrossing raypaths are combined. Lastly, we provide real‐data proof‐of‐concept examples which detect ULVZs with different sizes that have been proposed in past work. These include the Hawaiian ULVZ, which is roughly 1,000 km across and a ULVZ beneath the Himalayas with a lateral extent of only 200 km.
1 August 2022 in Journal of Applied Crystallography
A general method to invert parameter distributions of a polydisperse system using data acquired from a small-angle scattering (SAS) experiment is presented. The forward problem, i.e. calculating the scattering intensity given the distributions of any causal parameters of a theoretical model, is generalized as a multi-linear map, characterized by a high-dimensional Green tensor that represents the complete scattering physics. The inverse problem, i.e. finding the maximum-likelihood estimation of the parameter distributions (in free form) given the scattering intensity (either a curve or an image) acquired from an experiment, is formulated as a constrained nonlinear programming (NLP) problem. This NLP problem is solved with high accuracy and efficiency via several theoretical and computational enhancements, such as an automatic data scaling for accuracy preservation and GPU acceleration for large-scale multi-parameter systems. Six numerical examples are presented, including both synthetic tests and solutions to real neutron and X-ray data sets, where the method is compared with several existing methods in terms of their generality, accuracy and computational cost. These examples show that SAS inversion is subject to a high degree of non-uniqueness of solution or structural ambiguity. With an ultra-high accuracy, the method can yield a series of near-optimal solutions that fit data to different acceptable levels.
The moving sofa problem, introduced by Leo Moser in 1966, seeks to determine the maximal area of a 2D shape that can navigate an L-shaped corridor of unit width. Joseph Gerver’s 1992 solution, providing a lower bound of approximately 2.2195, is the best known, though its global optimality remains unproven. This paper leverages neural networks’ approximation power and recent advances in invexity optimization to explore global optimality. We propose two approaches supporting Gerver’s conjecture that his sofa is the unique global maximum. The first approach uses continuous function learning, discarding assumptions about the monotonicity, symmetry, and differentiability of sofa movements. The sofa area is computed as a differentiable function using our “waterfall” algorithm, with the loss function incorporating both differential terms and initial conditions based on physics-informed machine learning. Extensive training with diverse network initialization consistently converges to Gerver’s solution. The second approach applies discrete optimization to the Kallus–Romik upper bound, improving it from 2.37 to 2.3337 for five rotation angles. As the number of angles increases, our model asymptotically converges to Gerver’s area from above, indicating that no larger sofa exists.
Convolution is a fundamental operation in image processing and machine learning. Aimed primarily at maintaining image size, padding is a key ingredient of convolution, which, however, can introduce undesirable boundary effects. We present a non-padding-based method for size-keeping convolution based on the preservation of differential characteristics of kernels. The main idea is to make convolution over an incomplete sliding window "collapse" to a linear differential operator evaluated locally at its central pixel, which no longer requires information from the neighbouring missing pixels. While the underlying theory is rigorous, our final formula turns out to be simple: the convolution over an incomplete window is achieved by convolving its nearest complete window with a transformed kernel. This formula is computationally lightweight, involving neither interpolation or extrapolation nor restrictions on image and kernel sizes. Our method favours data with smooth boundaries, such as high-resolution images and fields from physics. Our experiments include: i) filtering analytical and non-analytical fields from computational physics and, ii) training convolutional neural networks (CNNs) for the tasks of image classification, semantic segmentation and super-resolution reconstruction. In all these experiments, our method has exhibited visible superiority over the compared ones.