Results 171 to 180 of about 12,820,749 (293)

An All‐At‐Once Solver for Visco‐Acoustic Full Waveform Inversion in the Time‐Domain

open access: yesMathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT Full waveform inversion (FWI) is the cutting‐edge seismic imaging technique used to reconstruct subsurface material properties such as wave velocities, mass density, and attenuation from measurements of reflected wavefields. In this article, we present the first implementation of FWI in the visco‐acoustic regime, based on a new time‐domain all‐
Christian Rheinbay, Andreas Rieder
wiley   +1 more source

High-accuracy pseudospectral scheme for fractional diffusion-wave problems based on cardinal functions. [PDF]

open access: yesPLoS One
Saray BN   +5 more
europepmc   +1 more source

On the Reconstruction of Planar Vector Fields From Its Longitudinal and Transverse Ray Transform

open access: yesMathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT We consider a planar vector tomography problem of reconstructing a complex‐valued vector field from the (complete and partial) information of its longitudinal and transverse ray transforms, as well as from one of those transforms and its first moment.
Kamran Sadiq
wiley   +1 more source

Fully Characterizing Lossy Catalytic Computation. [PDF]

open access: yesAlgorithmica
Folkertsma M   +3 more
europepmc   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

open access: yesNetworks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli   +6 more
wiley   +1 more source

Simultaneous Network Design With Restricted Link Usage

open access: yesNetworks, EarlyView.
ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura   +3 more
wiley   +1 more source

Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks

open access: yesNetworks, EarlyView.
ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy