Near Surface Modeling and Drilling Hazard Identification for a Subterranean Formation

Abstract

Methods and devices for geophysical exploration include: acquiring seismic data representing a subterranean formation; obtaining a plurality of virtual super gathers (VSGs) comprising the seismic data by sorting the seismic data based on a hypercube with dimensions comprising common midpoint X-Y coordinates, an offset, and an azimuth, wherein one or more seismic attributes are obtained at the dimensions of the hypercube; transforming the seismic data, in the plurality of VSGs from a time-offset domain to a frequency-phase velocity domain; isolating, for VSGs of the plurality, frequencies and phase velocities of the frequency-phase velocity domain based on a windowing operation; and for frequencies isolated by the windowing operation, identifying a maximum magnitude of a phase velocity spectrum from the plurality of VSGs.

Claims

1. A method for geophysical exploration, the method comprising: acquiring seismic data representing a subterranean formation; obtaining a plurality of virtual super gathers (VSGs) comprising the seismic data by sorting the seismic data based on a hypercube with dimensions comprising common midpoint X-Y coordinates, an offset, and an azimuth, wherein one or more seismic attributes are obtained at the dimensions of the hypercube; transforming the seismic data, in the plurality of VSGs from a time-offset domain to a frequency-phase velocity domain; isolating, for VSGs of the plurality, frequencies and phase velocities of the frequency-phase velocity domain based on a windowing operation; and for frequencies isolated by the windowing operation, identifying a maximum magnitude of a phase velocity spectrum from the plurality of VSGs.

2. The method of claim 1 further comprising: clustering maxima identified from the plurality of VSGs by a density based spatial clustering of applications with noise (DBSCAN) operation.

3. The method of claim 2 further comprising: defining a plurality of surface wave dispersion curves for each identified cluster, by defining a surface corresponding to a surface-wave propagation mode for each cluster identified.

4. The method of claim 3, further comprising iteratively performing the clustering of the maxima and the defining of the plurality of surface wave dispersion curves.

5. The method of claim 3, further comprising: obtaining a pseudo three-dimensional (3D) surface wave velocity distribution by: forward modeling the plurality of surface wave dispersion curves; and inverting the plurality of forward modeled surface wave dispersion curves.

6. The method of claim 5, further comprising: obtaining a 3D P velocity distribution based on automatically picking a transmitted wavefield first break travel time for the VSGs of the plurality; generating a forward modeled one and a half dimension (1.5D) travel time full waveform for VSGs of the plurality; and inverting the forward modeled 1.5D travel time full waveform for the VSGs of the plurality.

7. The method of claim 6, further comprising: computing a 3D distribution of Poisson's ratio of the subterranean formation based on the 3D P velocity distribution and the pseudo 3D surface wave velocity distribution.

8. The method of claim 7, further comprising: drilling a well in the subterranean formation based on the 3D distribution of Poisson's ratio.

9. The method of claim 3, further comprising: forward modeling the plurality of surface wave dispersion curves; picking a transmitted wavefield first break travel time for the VSGs of the plurality; generating a forward modeled 1.5D travel time full waveform for the VSGs of the plurality; and performing a joint 1.5D travel-time full waveform surface wave inversion comprising a structure operator, a rock-physics operator, and a clustering operator to obtain a pseudo 3D S velocity distribution and a 3D P velocity distribution.

10. The method of claim 9, further comprising, computing a 3D distribution of Poisson's ratio of the subterranean formation using the 3D P velocity distribution and the pseudo 3D surface wave velocity distribution.

11. The method of claim 10, further comprising, drilling a well in the subterranean formation based on the 3D distribution of Poisson's ratio.

12. One or more non-transitory machine-readable storage devices storing instructions for geophysical exploration, the instructions being executable by one or more processing devices to cause performance of operations comprising: obtaining a plurality of virtual super gathers (VSGs) comprising seismic data by sorting the seismic data based on a hypercube with dimensions comprising common midpoint X-Y coordinates, an offset, and an azimuth, wherein one or more seismic attributes are obtained at the dimensions of the hypercube; transforming the seismic data, in the plurality of VSGs from a time-offset domain to a frequency-phase velocity domain; isolating, for VSGs of the plurality, frequencies and phase velocities of the frequency-phase velocity domain based on a windowing operation; and for frequencies isolated by the windowing operation, identifying a maximum magnitude of a phase velocity spectrum from the plurality of VSGs.

13. The one or more machine-readable storage devices of claim 12, wherein the operations further comprise: clustering maxima identified from the plurality of VSGs by a density based spatial clustering of applications with noise (DBSCAN) operation.

14. The one or more machine-readable storage devices of claim 13, wherein the operations further comprise: defining a plurality of surface wave dispersion curves for each identified cluster, by defining a surface corresponding to a surface-wave propagation mode for each cluster identified.

15. The one or more machine-readable storage devices of claim 14, wherein the operations further comprise: iteratively performing clustering the maxima and the defining a plurality of surface wave dispersion curves.

16. The one or more machine-readable storage devices of claim 14, wherein the operations further comprise: obtaining a pseudo 3D surface wave velocity distribution by forward modeling the plurality of surface wave dispersion curves; and inverting the plurality of forward modeled surface wave dispersion curves.

17. The one or more machine-readable storage devices of claim 16, wherein the operations further comprise: obtaining a 3D P velocity distribution through automatically picking a transmitted wavefield first break travel time for VSGs of the plurality; generating a forward modeled 1.5D travel time full waveform for VSGs of the plurality; and inverting the forward modeled 1.5D travel time full waveform for VSGs of the plurality.

18. The one or more machine-readable storage devices of claim 17, wherein the operations further comprise: computing a 3D distribution of Poisson's ratio of the subterranean formation using the 3D P velocity distribution and the pseudo 3D surface wave velocity distribution.

19. The one or more machine-readable storage devices of claim 14, wherein the operations further comprise: forward modeling the plurality of surface wave dispersion curves; automatically picking a transmitted wavefield first break travel time VSGs of the plurality; generating a forward modeled 1.5D travel time full waveform for VSGs of the plurality; and performing a joint 1.5D travel-time full waveform surface wave inversion to obtain a pseudo 3D S velocity distribution and a 3D P velocity distribution.

20. The one or more machine-readable storage devices of claim 19, wherein the operations further comprise: computing a 3D distribution of Poisson's ratio of the subterranean formation using the 3D P velocity distribution and the pseudo 3D surface wave velocity distribution.

Description

DESCRIPTION OF DRAWINGS

[0015] FIG. 1 is a schematic view of a seismic survey being performed to map subterranean features such as facies and faults.

[0016] FIG. 2 is a schematic of a full 3D seismic survey.

[0017] FIGS. 3A-3B show example flow charts of a method of geophysical exploration.

[0018] FIG. 4 shows a schematic of a hypercube domain and an azimuth domain.

[0019] FIGS. 5A-5B shows an example single fold shot gather and an example virtual super gather.

[0020] FIG. 6 shows example frequency-phase velocity spectra from a single fold shot gather and a virtual super gather.

[0021] FIGS. 7A-7B show an example workflow for picking dispersion curves.

[0022] FIG. 8 shows example dispersion curves picked from a seismic dataset.

[0023] FIG. 9 shows a flow diagram of an example implementation of a Fuzzy C-means clustering technique.

[0024] FIG. 10 shows an example of coupled V.sub.p, V.sub.s and V.sub.p/V.sub.s derived from an implementation of the method of this disclosure.

[0025] FIG. 11 shows example cross plots of V and V.sub.p obtained from joint inversion and uncoupled inversion.

[0026] FIG. 12 shows an example flow chart of a method for obtaining SW dispersion curves.

[0027] FIG. 13 is a diagram of an example computing system.

[0028] Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

[0029] This specification describes an approach to geophysical exploration of subterranean formations including the acquisition, data processing and inversion of combined compressional P-waves and shearing surface waves (SW) to generate P-velocity (V.sub.p), S-velocity (V.sub.s) and Poisson's ratio (?) distributions in a 3D volume. These distributions can be used as diagnostic tools for the evaluation of the shallow rock integrity before the start of drilling activities. The derived parameters can also be used for other near surface characterization operations, such as calculation of velocity models for seismic processing corrections. The approach involves the automation and the enhancement of certain human-intensive interpretation steps using machine learning, as well as implementation of regularization and joint inversion techniques based on unsupervised machine learning methods.

[0030] FIG. 1 is a schematic view of a seismic survey being performed to map subterranean features such as facies and faults in a subterranean formation 100. Data collected from a seismic survey can be used to model the near surface area of the subterranean formation and identify potential drilling hazards. The subterranean formation 100 includes a layer of impermeable cap rocks 102 at the surface. Facies underlying the impermeable cap rocks 102 include a sandstone layer 104, a limestone layer 106, and a sand layer 108. A fault line 110 extends across the sandstone layer 104 and the limestone layer 106.

[0031] A seismic source 112 (for example, a seismic vibrator or an explosion) generates seismic waves 114 that propagate in the earth. The velocity of these seismic waves depends on properties such as, for example, density, porosity, and fluid content of the medium through which the seismic waves are traveling. Different geological bodies or layers in the earth are distinguishable because the layers have different properties and, thus, different characteristic seismic velocities. For example, in the subterranean formation 100, the velocity of seismic waves traveling through the subterranean formation 100 will be different in the sandstone layer 104, the limestone layer 106, and the sand layer 108. As the seismic waves 114 contact interfaces between geologic bodies or layers that have different velocities, the interface reflects some of the energy of the seismic wave and refracts part of the energy of the seismic wave. Such interfaces are sometimes referred to as horizons.

[0032] The seismic waves 114 are received by a sensor or sensors 116. Although illustrated as a single component in FIG. 1, the sensor, or sensors, 116 are typically a line or an array of sensors 116 that generate an output signal in response to received seismic waves including waves reflected by the horizons in the subterranean formation 100. The sensors 116 can be geophone-receivers that produce electrical output signals transmitted as input data, for example, to a computer 118 on a seismic control truck 120. Based on the input data, the computer 118 may generate a seismic data output such as, for example, a seismic two-way response time plot.

[0033] A control center 122 can be operatively coupled to the seismic control truck 120 and other data acquisition and wellsite systems. The control center 122 may have computer facilities for receiving, storing, processing, and/or analyzing data from the seismic control truck 120 and other data acquisition and wellsite systems. For example, computer systems 124 in the control center 122 can be configured to analyze, model, control, optimize, or perform management tasks of field operations associated with development and production of resources such as oil and gas from the subterranean formation 100. Alternatively, the computer systems 124 can be located in a different location than the control center 122. Some computer systems are provided with functionality for manipulating and analyzing the data, such as performing seismic interpretation or borehole resistivity image log interpretation to identify geological surfaces in the subterranean formation or performing simulation, planning, and optimization of production operations of the wellsite systems.

[0034] The Poisson's ratio can be estimated by analysis of P and S velocities (V.sub.p and V.sub.s, respectively) as derived by seismic surveys where the compressional/pressure waves are analyzed together with the surface waves (SW) to generate V.sub.p and V.sub.s models. Seismic acquisition can be performed in 2D and 3D with several different source types and variable parameterization of the source signal. Typical sources can include a sledge-hammer, weight drop, minivib, etc. for geotechnical/shallow surveys or explosive, vibroseis, airguns, marine vibrators, etc. for larger scale and deeper penetration seismic surveys. Techniques for interpretation of the survey and the characteristics of the elastic wave propagation do not change at these scales. Based on these considerations, the methodologies of the present disclosure can be applicable to a wide range of scales, for example, high resolution drill pad investigation for drilling hazards, or the exploration of vast areas on land or in shallow water. Seismic data are typically recorded along linear arrays of receivers (e.g., geophones) with sources arranged in line with the receivers for 2D land configurations or otherwise crossline for 3D land configurations. Marine acquisitions have specific acquisition geometries for ocean bottom node (OBN) and ocean bottom cable (OBC) techniques. Completely random locations of sources and receivers are also possible on land and marine acquisition configurations.

[0035] FIG. 2 shows an example schematic of a full three-dimensional (3D) seismic survey of a subterranean formation 128. A dense layout of seismic receivers 130 (small dots) measure the wavefield generated by a dense array of sources 132 (bold dots). Two shallow anomalies 134, 136 are shown near the surface of the subterranean formation 128 representing potential shallow drilling hazards. The approach of the present disclosure can be used with seismic surveys from a variety of configurations, for example, a dense 2D configuration or a full 3D configuration where a multitude of different 3D seismic acquisition schemes could be used to acquire the seismic data.

[0036] The recorded seismic data are typically analyzed by performing a transformation from a time-offset domain to a frequency-phase velocity domain where the corresponding dispersion curves are picked and the resulting phase velocity versus frequency data are inverted in 1D for the shear velocity (V.sub.s). The interpretation of the corresponding compressional/pressure velocity (V.sub.p) can be done, for example, by using nearby shallow vertical borehole surveys (e.g., uphole surveys), which provide the vertical travel times for interpreting the corresponding P velocity, or by inverting the refraction first break (FB) travel time data from a seismic survey. The interpretation of SW dispersion curves and FB travel times for P and S velocity estimation directly from the seismic records can be compromised when the data shows low signal-to-noise ratio. The operations involved in industry-standard methods can be very human-intensive involving the manual interpretation (e.g., picking) of SW dispersion curves and of refracted arrival (e.g., first break) times. Human-intensive manual interpretation is also subjective, and the results are heavily dependent on the abilities of the geophysical processor involved. Results are obtained as 2D cross-sections of the subterranean formation or 3D volumes from the combination of several local 1D inversions.

[0037] FIGS. 3A-3B shows flow charts of two example methods that can be used in the derivation of a 3D distribution of Poisson's ratio. The first example method 150 in FIG. 3A includes a 3D carpet acquisition of seismic data (step 152) such as is shown in FIG. 2, the generation of enhanced s/n virtual super gathers (step 154), picking of travel times (step 156) and dispersion curves (step 158), forward modeling of 1.5D travel-time-full waveform (step 160) and forward modeling of SW dispersion curves (step 162), and separated (e.g., uncoupled) 1.5D travel time-full waveform inversion (TT-FWI) (step 164) and SW inversions (step 166). This method 150 generates 3D volumes of P and S velocities that can be combined to derive the V.sub.p/V.sub.s and Poisson's ratio distribution (step 168). Such a procedure takes advantage of the described s/n enhancement via VSG generation, unsupervised clustering techniques for picking, TT-FWI, and 1D SW inversion.

[0038] FIG. 3B shows a flow chart for the second example method 170, which further enhances the results of the first example method 150 by introducing coupling mechanisms (step 172) into a joint inversion of the 1.5D TT-FW-SW (step 174) to obtain coupled 3D V.sub.p, V.sub.s, V.sub.V/V.sub.S and Poisson's ratio distributions (step 176). More details of the steps for each example procedure are given in the subsequent paragraphs.

[0039] At step 154, VSG signal-to-noise (s/n) enhancement is obtained by the generation of virtual super gathers (VSGs) through a process of sorting the seismic data in a hypercube comprising X-Y common midpoint (CMP) spatial coordinates, offset, azimuth, and seismic attributes (e.g., travel times and/or seismic traces). VSGs provide a volumetric estimate of the seismic wavefield, thus accounting for 3D propagation of the seismic waves.

[0040] FIG. 4 illustrates seismic trace sorting into CMP-offset bins 180. The multi dimensional attribute cubes or bins are used for quality control since these cubes or bins 180 enable a visualization of the spatial trends of the travel time (mean values) and the noisy areas (standard deviation). The seismic traces can be further sorted into an azimuthal bin 182 that can include surface wave dependencies on polarization or anisotropy and s/n. When performing the 4D CMP-offset-azimuth binning (that is, XYOA binning in the directions of CMP-X 184, CMP-Y 186, offset 188, and azimuth 190), the bin sizes in the CMP-X 184 and CMP-Y 186 directions can be kept greater, such that a sufficient number of CMPs are placed in a bin 182 to provide functionally applicable statistics. Azimuthal bin sizes can be for example 45 degrees or 90 degrees depending on the 3D seismic acquisition parameters such as full azimuth or narrow azimuth. The XYOA binning illustrated in FIG. 4 is different from sorting in a common offset domain as the latter collects data sharing a common offset but pertaining to different CMPs. The existing CMP sorting (time-offset) that is applied for reflected waves is less useful for refracted waves as it would display events with variable velocities over the offset axis. The XYOA binning method is therefore an effective representation of both CMP and offset domains where common properties at a CMP position can be assessed.

[0041] In some implementations, as shown in FIG. 4, the XYOA space 194 is divided into XYOA bins 182 of a particular size. For example, each bin 182 can have a size of 100 meters (m) in the CMP-X direction, 100 m in the CMP-Y direction, 50 m in the offset direction, and an azimuth bin of 45 deg. For each trace (or first break pick), the offset (the distance between the source and the receiver), the CMP (the middle point position between the source and the receiver), and the azimuth are determined, and the trace is sorted into a particular bin based on the offset, the CMP, and the azimuth. Each XYOA bin 182 includes a collection of traces sharing a common (or similar) midpoint position, a common (or similar) offset, and a common (or similar) azimuth. The collection of traces in an XYOA bin is sometimes referred to as an XYOA gather.

[0042] Signal-to-noise enhancement is obtained by the generation of virtual super gathers (VSG). This is obtained through a process of sorting seismic data in a 4D hypercube consisting of X-Y midpoint spatial coordinates, offset and azimuth, where seismic attributes (travel times and/or seismic traces) are collected as shown in FIG. 4. VSGs provide a volumetric estimate of the seismic wavefield propagation, hence accounting for 3D propagation. The process for generating VSGs or enhanced VSGs (eVSGs) is described by U. S. Patent Application Ser. No. 17/237,746, filed on Apr. 22, 2021 (Colombo et al.), which is hereby incorporated by reference in its entirety. The preparation scheme of the eVSGs remain largely the same as in Colombo et al. with the difference of the addition of an azimuth dimension for SW analysis that, depending on the cases, may enhance the stacking properties of the eVSGs by analyzing the azimuthal dependence of polarization or anisotropy and s/n for the SW. The sorting domain of the present disclosure is XYOA (XY of the source-receiver midpoint, offset, azimuth) instead of XYO as used by Colombo et al. Further, the SW in Colombo et al. are removed by muting while in the present disclosure the SW are not muted and are utilized for dispersion curve analysis.

[0043] FIG. 5A and FIG. 5B show the effects of VSG generation on the SW. FIG. 5A displays an example wavefield 500 from a single fold shot gather. FIG. 5B shows an example wavefield 502 from a VSG. The s/n ratio for the whole seismic wavefield 502 has increased including the SW component 504, in comparison with the wavefield 500 from a single fold shot gather.

[0044] In seismic exploration, seismic surface waves in shot gathers are transformed from a time-offset domain to a frequency-phase velocity domain to pick dispersion curves (step 158) for a fundamental mode and higher modes. The analysis of surface waves is not always possible due to inadequate sampling of the fundamental and higher modes in the frequency domain and due to coherent and random noise. In the approach of the present disclosure, the sorting domain of enhanced VSGs (eVSGs) are used in which seismic traces, including surface waves, are sorted using CMP location, offset and azimuth (XYOA). This approach can enhance the fundamental mode and higher modes to remove the effects of spatial aliasing and random noise.

[0045] The seismic data traces of the single fold gather 500 and of the VSG 502 are transformed from a time offset (t,x) domain to a frequency, wavenumber (f,k) domain using a 2D Fourier transformation:

[00001]$\begin{array}{cc}U\left(f,k\right)=\frac{1}{2?}{?}_{-?}^{?}{?}_{-?}^{?}u\left(x,t\right){\exp }^{-i2?\left(\mathrm{ft}-\mathrm{kx}\right)}\mathrm{dxdt},& \left(1\right)\end{array}$

which is transformed further to phase velocity spectrum using:

[00002]$\begin{array}{cc}v=f/k.& \left(2\right)\end{array}$

This transform is used in seismic exploration to separate seismic events characterized by different frequencies and wavenumbers.

[0046] FIG. 6 shows an example phase velocity spectrum using the shot sorting domain 520 and an example phase velocity spectrum using the CMP-offset-azimuth (XYOA) sorting domain 522 after VSG transformation. The phase velocity spectrum using shot domain data 520 is very noisy, and it is difficult to pick relevant features. The phase velocity spectrum using the XYOA sorting domain 522 shows improvement after the VSG generation. The fundamental mode 524 and the higher modes 526, 528, 530 of the dispersion curves become clearly visible. The enhanced XYOA sorting domain 522 is where unsupervised machine learning techniques can be effectively employed for automatic picking of dispersion curves.

[0047] Clustering algorithms can handle the problem of identifying surface wave propagation modes in the frequency-phase velocity spectrum. When applied to big datasets, these algorithms need to be able to discover clusters of arbitrary shape with good efficiency and should have a low number of input parameters. Spectral clustering techniques typically satisfy these requirements showing superior results when compared with other standard clustering techniques like k-means.

[0048] Density-based spatial clustering of applications with noise (DBSCAN) is designed to deal with arbitrary shaped clusters. It is highly efficient on large datasets, and it requires only one input parameter, which is automatically derived. These properties, together with full automation and robustness in the presence of noise (due to its density-based clustering approach), make this algorithm a suitable candidate for picking dispersion curves. It works by assuming that within each cluster there is a typical density of points, which is considerably higher than outside of the cluster, and the density within the areas of noise is lower than the density in any of the clusters.

[0049] FIG. 7A shows an example workflow 540 for picking dispersion curves based on DBSCAN. Seismic data is gathered using, for example, a plurality of VSGs (step 542). The plurality of seismic gathers is then transformed from the time-offset domain into the frequency-wavenumber domain by applying a 2D Fourier transform to each gather separately (step 544). The plurality of seismic gathers is further transformed into phase velocity spectra (step 546). Windowing is applied to the phase velocity spectra of the plurality of seismic gathers to isolate specific frequencies and phase velocities (step 548). For example, 300 m/s and 1000 m/s can be used as minimum and maximum phase velocities, respectively, and 3 Hz to 15 Hz as minimum and maximum frequencies. The spectra can be filtered by a low-pass filter to remove high frequency noise (step 550). For example, a Butterworth low-pass filter of the third order and a normalized cut-off frequency of 0.1 can be used. For each frequency, the maximum magnitude of the phase velocity spectrum is picked for each seismic gather (step 552) For each gather, within the selected frequency/phase velocity window, one maximum of the frequency-phase velocity spectrum is picked per frequency across all phase velocities, meaning that for each frequency only one phase velocity is picked, followed by application of a simple outlier rejection algorithm (step 554). One example of a simple outlier rejection algorithm is removing the outliers that act as spikes in the frequency-phase velocity curves based on the calculation of the gradient of the curves and eliminating the values corresponding to a gradient bigger than a threshold specified by the user (for example, 500 m/s). Many other criteria based on statistics (for example, the mean and standard deviation of the frequency-phase velocity curves) can also be used. The set of maxima picked for all frequencies (or a predetermined subset of frequencies) and all seismic gathers (or a predetermined subset of gathers) analyzed defines a 3D point cloud with dimensions of phase velocity, frequency, and gather number. DBSCAN is then applied to the cloud of 3D points (step 556). Each of the clusters discovered by DBSCAN represents points belonging to a surface corresponding to a surface-wave propagation mode. Some points may be missing for some particular frequencies or gathers. A 3D linear interpolation is applied to fill any gaps in frequencies (step 558). The resultant surfaces can be refined by iteratively applying the DBSCAN technique (step 556) and the 3D linear interpolation (step 558) where the output of the linear interpolation becomes the input to the DBSCAN technique on the subsequent iteration (step 560). After one or more iterations, dispersion curves can be extracted from the identified surfaces at desired frequencies for each gather.

[0050] FIG. 7B shows example graphical representations of the example workflow 540. Seismic data is gathered using a plurality of virtual shot gathers 570 (step 542). The plurality of VSGs is transformed from the time-offset domain into the frequency-phase velocity domain 572 (steps 544 and 546). Maxima 574 in the phase velocity spectra for each VSG are picked (steps 548, 550, 552, 554). The picked maxima define a 3D point cloud. Through application of the DBSCAN technique, interpolation, and refinement (steps 556, 558 and 560) surfaces 576 corresponding to the fundamental mode 578 and higher modes 580 are defined.

[0051] FIG. 8 shows results from an example application of the workflow 540 using the DBSCAN technique to perform a fully automatic picking of surface wave dispersion curves. The field data was measured by a high-resolution 2D seismic survey with 15 m shot spacing. The ultimate goal is to characterize the shallow near-surface (e.g., the first 100 m of subsurface) in terms of S velocities, for the total extent of the survey line, which was about 100 km. Three separate example phase velocity spectra are shown (590, 592, 594). The dispersion curves were recovered for the frequency range of about 5-20 Hz in this example. The workflow 540 was able to pick dispersion curves associated with the fundamental mode 596 and the first higher order mode 598 in each example phase velocity spectra.

[0052] After SW dispersion curves (DCs) have been picked, uncoupled pseudo 3D surface wave velocity distributions can be obtained through forward modeling of SW DCs (step 162) and the corresponding 1D inversion (step 166). The 1D SW inversion algorithm can be implemented as a minimization of an objective function ?.sub.sw(m.sub.s) consisting of a data misfit ?.sub.d,Dc(m.sub.s) and a model regularization function ?.sub.reg,s(m.sub.s):

[00003]$\begin{array}{cc}{?}_{\mathrm{SW}}\left(m_S\right)={?}_{d,\mathrm{DC}}\left(m_S\right)+{?}_{\mathrm{reg},S}{?}_{\mathrm{reg},S}\left(m_S\right),& \left(3\right)\end{array}$

where ?.sub.reg,s is the weight of the regularization term ?.sub.reg,s(m.sub.s) over the data misfit term. The model is represented by the S velocity distribution m.sub.s, expressed as the concatenation of 1D S velocity profiles m.sub.s,n located below each n-th VSG lateral (X,Y) position:

[00004]$\begin{array}{cc}{m}_S=\left[m_{S,1},m_{S,2},.Math.,m_{S,N}\right].& \left(4\right)\end{array}$

The data misfit ?.sub.d,DC(m.sub.s) is given by:

[00005]$\begin{array}{cc}{?}_{d,\mathrm{DC}}\left(m_S\right)=\frac{1}{2}{.Math.}_{n=1}^N{.Math.W_{d,\mathrm{DC}}\left(g_{\mathrm{obs},n}-g_{\mathrm{mod},n}\left(m_{S,n}\right)\right).Math.}_2^2,& \left(5\right)\end{array}$

where g.sub.obs,n are the observed DC at the n-th VSG and g.sub.mod,n are the calculated DCs from the S velocity model profiles m.sub.s,n. W.sub.d,DC is the data covariance matrix for the DCs. The forward-modeling is implemented calculating the Rayleigh-wave phase velocity from laterally constant layers of an infinite half space. The forward problem is solved by using the method of reflection and transmission coefficients. The dispersion curves associated with the fundamental and higher order modes of propagation k.sub.j (?) are computed by finding the solutions of the Rayleigh dispersion equation, or the Rayleigh secular function, which is known in implicit form as:

[00006]$\begin{array}{cc}{f}_R\left[?\left(z\right),?\left(z\right),?\left(z\right),k_j,?\right]=0,& \left(6\right)\end{array}$

where ?(z), ?(z) are the vertical distributions of the Lame parameters and p(z) is the vertical distribution of the density of the subsurface formation.

[0053] The inversion is obtained by minimizing ?.sub.sw(m.sub.s) through an optimization algorithm such as a non-linear conjugate gradient (NLCG) algorithm among others.

[0054] Turning attention to obtaining P velocity distributions, after generating a plurality of VSGs (step 154), the transmitted wavefield travel times (e.g., first breaks-FB) can be obtained by performing statistical evaluations of the sorted (e.g., single fold) FB to obtain a mean value, or the travel times can be picked automatically from enhanced VSGs (step 156).

[0055] The corresponding P velocity can be obtained through the inversion of the transmitted energy propagating from a source by 1.5D travel time inversion of VSG travel times and by 1.5D Full Waveform Inversion (FWI) of the volumetric VSG wavefields (1.5D TT-FWI), which includes the forward modeling step (steps 160 and 164). The 1.5D TTFWI differs from the 1.5D FWI as the objective function for the inversion includes a travel time residual objective function in addition to the FWI objective function.

[0056] The VSG formation procedure (step 154), followed by a Laplace transform along the time axis, generates N gathers of observed seismic data P.sub.obs,n(z.sub.i, r.sub.i, s.sub.i), sampled at N.sub.rcv depth-offset pairs (z.sub.i, r.sub.i), and N.sub.freq complex frequencies s.sub.i=?.sub.i+j.sub.?i that are user-specified, with 1?n?N; 1? i? N.sub.rcv; 1?1?N.sub.freq. The complex frequency s.sub.i is defined by two components: an angular frequency ?.sub.i and a damping parameter ?.sub.1.

[0057] For each VSG, a vector P.sub.obs,n is constructed from the samples P.sub.obs,n(z.sub.i, r.sub.i, s.sub.i). Then, the Laplace-Fourier FWI objective function takes the following form:

[00007]$\begin{array}{cc}{?}_{\mathrm{FWI}}\left(m_P\right)={?}_{d,\mathrm{FW}}\left(m_P\right)+{?}_{\mathrm{reg},P}{?}_{\mathrm{reg},P}\left(m_P\right),& \left(7\right)\end{array}$

where ?.sub.reg is the weight of the regularization term ?.sub.reg,p(m.sub.p) over the data misfit term ?.sub.d,FW(m.sub.p).

[0058] ?.sub.d,FW(m.sub.p) is defined as:

[00008]$\begin{array}{cc}{?}_{d,\mathrm{FW}}\left(m_P\right)=\frac{1}{2}{.Math.}_{n=1}^N{.Math.W_{d,\mathrm{FW}}\left(p_{\mathrm{obs},n}-p_{\mathrm{mod},n}\left(m_{P,n}\right)\right).Math.}_2^2,& \left(8\right)\end{array}$

where P.sub.mod, n is the data calculated from the model m.sub.p. The vector m.sub.p is obtained by the concatenation of the 1D P velocity profiles m.sub.p,n located below each n-th VSG lateral (X,Y) position:

[00009]$\begin{array}{cc}{m}_P=\left[m_{P,1},m_{P,2},.Math.,m_{P,N}\right],& \left(9\right)\end{array}$

and W.sub.d,FW is the covariance matrix that takes into account the uncertainties due to both the measurements and the modeling.

[0059] Given each P.sub.obs,n, the purpose of FWI is to recover a corresponding vector of model parameters m.sub.p,n that yields forward-modeled data P.sub.mod, n that is close, in the least-squares sense, to the observed data. The regularization functional ?.sub.reg,P (m.sub.p) can be used to enforce depth-dependent regularization and/or lateral regularization on the 3D model volume.

[0060] Producing the forward-modeled data P.sub.mod, n given model parameters m.sub.p,n is a necessary step of the inversion process. This step is implemented by a seismic forward modeling engine. An example of such a seismic modeling engine is the Hankel-transformed inhomogeneous Helmholtz equation in the Laplace domain for a medium with constant density and P velocity V.sub.p (z) that is only dependent on depth (a 1.5D medium). Further assuming that the medium is isotropic and acoustic, the following ordinary differential equation (ODE) can be solved to model acoustic pressure data:

[00010]$\begin{array}{cc}\left[\frac{{?}^2}{?z^2}-k_r^2-{\left(\frac{s}{V_P\left(z\right)}\right)}^2\right]\tilde{p}\left(z,k_r,s\right)=\tilde{f}\left(z,k_r,s\right).& \left(10\right)\end{array}$

Here {tilde over (p)}(z, k.sub.r, s) is the acoustic pressure data in the horizontal wavenumber-frequency domain, generated by a source field {tilde over (f)} (z, k.sub.r, s). The symbol k.sub.r denotes the horizontal wavenumber. As the observed data is usually sampled in an offset domain, a second step is used to transform the modeled wavefield from the wavenumber domain back to the offset domain. This is done by numerically applying the inverse Hankel transform, given by the integral:

[00011]$\begin{array}{cc}p\left(z,r,s\right)={?}_0^{?}\tilde{p}\left(z,k_r,s\right)J_0\left({\mathrm{rk}}_r\right)k_r{\mathrm{dk}}_r,& \left(11\right)\end{array}$

where J.sub.0 is the zero-th order Bessel function of the first kind. The integral transform above maps the wavenumber-domain data {tilde over (p)}(z, k.sub.r, s) to the offset-dependent data p(z,r,s). The vector P.sub.mod,n can then be constructed from the samples {tilde over (p)}(z.sub.i, r.sub.i, s.sub.i), the sampling locations matching those of the observed data.

[0061] The inversion is obtained through the minimization of the total objective function ?.sub.FWI (m.sub.p) using optimization algorithms such as NLCG among others.

[0062] From the seismic data it is also possible to extract information only related to the time of the first arrivals of the seismic waveforms (TT). This information can be used to produce a P velocity distribution of the subsurface, which however typically has low resolution and cannot recover velocity inversions (low velocity layers surrounded by high velocity layers) due to the refracted energy associated with the first arrivals being confined in the high velocity layers. On the other hand, FWI can produce a high-resolution P velocity model, without suffering from the problem of the velocity inversion, but it requires a very good initial velocity model so that its objective function (typically highly multimodal) can be properly minimized with local optimization techniques. A combination of the two techniques can improve the accuracy and resolution of the final P velocity model. This can be obtained by explicitly adding to the FWI objective function an additional term, which minimizes the difference between the observed and recomputed TT in the least square sense.

[0063] The 1.5D Travel time TT-FWI objective function can be expressed as:

[00012]$\begin{array}{cc}{?}_{\mathrm{TTFWI}}\left(m_P\right)={?}_{d,\mathrm{FW}}\left(m_P\right)+{?}_{\mathrm{TT}}{?}_{d,\mathrm{TT}}\left(m_P\right)+{?}_{\mathrm{reg},P}{?}_{\mathrm{reg},P}\left(m_P\right).& \left(12\right)\end{array}$

where ?.sub.TT is a parameter which weights the contributions of the different datasets (TT and FW), where the TT data misfit ?.sub.d,TT (m.sub.p) is given by:

[00013]$\begin{array}{cc}{?}_{d,\mathrm{TT}}\left(m_P\right)=\frac{1}{2}{.Math.}_{n=1}^N{.Math.W_{d,\mathrm{TT}}\left(t_{\mathrm{obs},n}-t_{\mathrm{mod},n}\left(m_{P,n}\right)\right).Math.}_2^2,& \left(13\right)\end{array}$

where t.sub.obs,n are the observed TT at the n-th VSG and t.sub.mod,n are the TT calculated from the P velocity model profiles m.sub.p,n. W.sub.d,TT is the data covariance matrix for the TT. The forward-modeling is implemented analytically calculating the first arrival times by applying Snell's law for a 1.5 medium. The inversion is obtained by minimizing ?.sub.TTFWI(m.sub.p) through an optimization algorithm such as NLCG.

[0064] In FIG. 3A, the example workflow 150 generates independent, uncoupled V.sub.p and V pseudo 3D distributions resulting from the merging of spatially regularized 1D functions of velocity versus depth (step 168). The approach for the generation of the 3D parameter distribution is independent for each case such that the P velocity is not influenced by the S velocity derivation and vice versa. The resulting 3D parameter distributions of P and S velocities can be used to obtain equivalent V.sub.p/V.sub.s volumes and Poisson's ratio volumes by using the following transformation equation where it is assumed the material is isotropic and homogeneous:

[00014]$\begin{array}{cc}?=\frac{{\left(\frac{V_P}{V_S}\right)}^2-2}{2{\left(\frac{V_P}{V_S}\right)}^2-2}.& \left(14\right)\end{array}$

[0065] In FIG. 3B, simultaneous or co-operative 1.5D joint inversion of travel times, full waveforms and SW dispersion curves is performed to obtain coupled 3D P and S velocity distributions, a V.sub.p/V.sub.s distribution and a Poisson's ratio distribution in the investigated area (step 174). The joint inversion objective function accounts for regularization operators or coupling mechanisms between the P and S velocities. These involve constraints on the shape of the parameter distribution (e.g., structure coupling constraints) and on the physical relationships among P and S velocities (e.g., rock-physics coupling constraints). Optimal structure coupling constraints can be provided by gradient operators such as summative operators where the sign of the gradient polarity, rather than the simple gradient direction (e.g., cross-gradients), provides additional levels of coupling between P and S velocity structures (e.g., P and S velocity gradients are always positively correlated). Optimal rock-physics operators are provided by unsupervised clustering techniques such as Fuzzy C-mean clustering, DBSCAN or other.

[0066] The approach, generally referred to as joint inversion, consists of a joint minimization of an objective function composed by the data residuals of two or more geophysical property domains, followed by multi-parameter coupling operators and other inversion regularization terms. A typical joint inversion framework can be described with a model space characterized by the model vector m consisting of property components from different geophysical domains. In the specific case we consider P and S velocity distributions: m=[m.sub.p, m.sub.s]. The data space is represented by d obtained from geophysical sets of measurements such as, in this invention, refracted wave travel times, full waveforms and surface wave dispersion curve phase velocity: d=[p, t, g]. A joint inversion (JI) algorithm can be formulated as a constrained least squares problem solved by minimizing a composite objective function consisting of a data misfit, a model regularization function, and inter-domain coupling operators, or penalty functions. The penalty terms are structure (e.g., gradient based) constraints, acting on the shape of the parameter distributions, and compositional constraints such as rock-physics (e.g., regression based) and unsupervised clustering, both acting on the property values: ?.sub.TTFWI-SW (m, D, {circumflex over (m)})=?.sub.d (m)+?.sub.reg (m)+?.sub.x ?.sub.x(m)+?.sub.rp ?.sub.rp (m)+?.sub.c ?.sub.FCM (m, D, {circumflex over (m)}), (15)

where ?.sub.x, ?.sub.rp and ?.sub.c are the weights of the inter-domain coupling operators in the objective function.

[0067] In this case, ?.sub.d(m) is defined as:

[00015]$\begin{array}{cc}{?}_d\left(m\right)={?}_{d,\mathrm{FW}}\left(m_P\right)+{?}_{\mathrm{TT}}{?}_{d,\mathrm{TT}}\left(m_P\right)+{?}_{\mathrm{DC}}{?}_{d,\mathrm{DC}}\left(m_S\right).& \left(16\right)\end{array}$

The model regularization function ?.sub.d (m) is defined as:

[00016]$\begin{array}{cc}{?}_{\mathrm{reg}}\left(m\right)={?}_{\mathrm{reg},P}{?}_{\mathrm{reg},P}\left(m_P\right)+{?}_{\mathrm{reg},S}{?}_{\mathrm{reg},S}\left(m_S\right),& \left(17\right)\end{array}$

The remaining misfit terms, ?.sub.x(m), ?.sub.rp (m) and ?.sub.FCM (m, D, {circumflex over (m)}) are the structure, rock-physics and clustering operators, respectively, which make ?.sub.TTFWI-SW(m, D, {circumflex over (m)}) a joint inversion objective function. The inversion is obtained by minimizing ?.sub.TTFWI-SW(.sub.m, D, {circumflex over (m)}) through an optimization algorithm such as NLCG among others.

[0068] Typical gradient-based structure operators for two models (m.sub.p, m.sub.s) are based on cross-gradients:

[00017]$\begin{array}{cc}x\left(m_P,m_S\right)=?m_P??m_S,& \left(18\right)\end{array}$

or summative gradients:

[00018]$\begin{array}{cc}x\left(m_P,m_S\right)=\frac{?m_P}{\sqrt{{.Math.?m_P.Math.}^2+{?}^2}}+h\frac{?m_S}{\sqrt{{.Math.?m_S.Math.}^2+{?}^2}},& \left(19\right)\end{array}$

where h=?1 is the correlation sign, and E is a damping parameter. The difference between the structure coupling terms is that cross-gradients constrain the general direction of the gradients regardless of the respective polarity while summative gradients consider the polarity (e.g., correlated versus anticorrelated distributions) allowing stronger constraints to be injected into the solution. The P and S velocities are positively correlated such that a summative gradient operator represents an optimal choice.

[0069] The rock-physics operator ?.sub.rp can be represented by a model reference term linking the current model m to an expected model m obtained from a regression of the points

[00019]$\begin{array}{cc}{?}_{\mathrm{rp}}\left(m\right)={.Math.W_{\mathrm{rp}}\left(m-\stackrel{\_}{m}\right).Math.}_{L_2}^2,& \left(20\right)\end{array}$

where W.sub.rp is the rock-physics covariance matrix.

[0070] One problem related to standard, nonlinear, rock-physics coupling methods (such as in eq. 20) is that the rock physics relation may be variable over a certain area and the attempt to force the joint inversion results toward a fixed rock-physics relation may damage the convergence and the results of the joint inversion.

[0071] A different approach to rock-physics coupling is to consider unsupervised machine learning clustering methods such as fuzzy C-means (FCM) as the rock-physics constraint. In this approach, the clustering associations and the center of the clusters are re evaluated at each inversion iteration based on the inversion results. The fuzzy C-means clustering approach allows variable clusters to be present in the inversion framework for the association of P and S velocities as driven by the data misfit minimization.

[0072] The optimization of ?.sub.FCM (m, D, {circumflex over (m)}) is performed in two steps (i.e., with alternated minimization steps). The first step consists of the optimization of the cluster memberships D and of the cluster centers {circumflex over (m)}. The second step uses the updated clusters to update the model m in the total objective function (equation 15).

[0073] For the first step (cluster optimization for D, {circumflex over (m)}), consider the point m.sub.a, with coordinate (m.sub.p.sub.a, m.sub.s.sub.a), and point {circumflex over (m)}.sub.b with coordinate ({circumflex over (m)}.sub.p.sub.b, {circumflex over (m)}.sub.s.sub.b), where m.sub.p.sub.a and m.sub.s.sub.ab are the a.sup.th cell of the P and S velocity models, {circumflex over (m)}.sub.p.sub.b and {circumflex over (m)}.sub.s.sub.b are the b.sup.th cluster center of the P and S velocity model distributions.

[0074] FIG. 9 is an example method 620 of applying the FCM technique. During clustering, FCM performs the following operations, such that D.sub.ab is required to be nonnegative and fill the following relation:

[00020]$\begin{array}{cc}{.Math.}_{b=1}^C{D}_{\mathrm{ab}}=1.& \left(21\right)\end{array}$

The number of clusters is defined (step 622). The cluster membership values are randomly initialized (step 624) and then the cluster centers are calculated (step 626):

[00021]$\begin{array}{cc}{\hat{m}}_b=\frac{{.Math.}_{a=1}^{\mathrm{Nm}}{D}_{\mathrm{ab}}^q{m}_a}{{.Math.}_{a=1}^{\mathrm{Nm}}{D}_{\mathrm{ab}}^q}.& \left(22\right)\end{array}$

[0075] Then, the membership is updated using the following (step 628):

[00022]$\begin{array}{cc}{D}_{\mathrm{ab}}=\frac{{.Math.m_a-{\hat{m}}_b.Math.}^{\frac{-2}{q-1}}}{{.Math.}_{c=1}^C{.Math.m_a-{\hat{m}}_c.Math.}^{\frac{-2}{q-1}}}.& \left(23\right)\end{array}$

[0076] These operations are repeated until a convergence threshold is reached (step 630). This process corresponds to the standard FCM optimization algorithm and can be described as an inner optimization step of the total objective function in equation 15. The FCM algorithm allows each point m.sub.a corresponding to the a.sup.th cell to belong to multiple clusters, with varying degrees of membership, D.

[0077] For the second step the current model is minimized relative to the FCM clustering results:

[00023]$\begin{array}{cc}{?}_{\mathrm{FCM}}\left(m,D,\hat{m}\right)={.Math.}_{a=1}^{\mathrm{Nm}}{.Math.}_{b=1}^C{D}_{\mathrm{ab}}^q{.Math.m_a-{\hat{m}}_b.Math.}_2^2,& \left(24\right)\end{array}$

where C is the number of clusters, N.sub.m is the number of model cells and q?1 is an exponent controlling the degree of fuzzy overlapping. The cluster memberships D and the cluster centers m are obtained from the first step and are kept fixed during the minimization of equation 24 that occurs simultaneously with the minimization of equation 15. The iterative procedure of updating membership values and cluster centers continues in each inversion step.

[0078] FIG. 10 shows joint inversion results 650 as applied to an arid region with a distinctive wadi feature (e.g., drainage channel, valley) in the center of the 3D seismic block. The solution of the joint inversion problem provides coupled 3D parameter distributions of P velocity, S velocity, V.sub.p/V.sub.s and Poisson's ratio to provide robust near surface property estimations. This example implementation of the method 170 provides coupled 3D distributions of P velocity 652 and S velocity 654, as well as the V.sub.p/V.sub.s parameter 656 from which the Poisson's ratio can be readily obtained using equation 14. The wadi area 658 shows higher V.sub.p/V.sub.s values due to the presence of water or moisturized sediments. The surrounding areas are desert and show lower V.sub.p/V.sub.s values characteristic of dry sediments.

[0079] FIG. 11 shows cross plots of V.sub.p and V for the example implementations of the method 150 and the method 170 where a linear regression is calculated from the distribution of points in the cross plot. The obtained V.sub.p and V.sub.s values obtained from the coupled joint inversion process 670 are compared to the corresponding values obtained with the independent, uncoupled approach 672. The linear regression (function of V.sub.p/V.sub.s) is compared to the result of a nearby well where P and S velocity logs are present. The cross plot from the joint inversion process 670 is better behaved than the cross plot from uncoupled inversions 672, and the resulting regression from the joint inversion process 674 is closer to the values obtained from well logs 676.

[0080] FIG. 12 shows an example flow chart for a method of obtaining dispersion curves 700 for geophysical exploration. The method 700 comprises acquiring seismic data representing a subterranean formation (step 710). Obtaining a plurality of virtual super gathers (VSGs) comprising the seismic data by sorting the seismic data based on a hypercube with dimensions comprising common midpoint X-Y coordinates, an offset, and an azimuth, wherein one or more seismic attributes are obtained at the dimensions of the hypercube (step 712). Transforming the seismic data, in the plurality of VSGs from a time-offset domain to a frequency-phase velocity domain (step 714). Isolating, for VSGs of the plurality, frequencies and phase velocities of the frequency-phase velocity domain based on a windowing operation (step 716). For frequencies isolated by the windowing operation, identifying a maximum magnitude of a phase velocity spectrum from the plurality of VSGs (step 718). Clustering maxima identified from the plurality of VSGs by a density based spatial clustering of applications with noise (DBSCAN) operation (step 720). Defining a plurality of surface wave dispersion curves for each identified cluster, by defining a surface corresponding to a surface-wave propagation mode for each cluster identified (step 722).

[0081] FIG. 13 is a block diagram of an example computer system 1300 used to provide computational functionalities associated with described algorithms, methods, functions, processes, flows, and procedures described in the present disclosure, according to some implementations of the present disclosure. The illustrated computer 1302 is intended to encompass any computing device such as a server, a desktop computer, a laptop/notebook computer, a wireless data port, a smart phone, a personal data assistant (PDA), a tablet computing device, or one or more processors within these devices, including physical instances, virtual instances, or both. The computer 1302 can include input devices such as keypads, keyboards, and touch screens that can accept user information. Also, the computer 1302 can include output devices that can convey information associated with the operation of the computer 1302. The information can include digital data, visual data, audio information, or a combination of information. The information can be presented in a graphical user interface (UI) (or GUI).

[0082] The computer 1302 can serve in a role as a client, a network component, a server, a database, a persistency, or components of a computer system for performing the subject matter described in the present disclosure. The illustrated computer 1302 is communicably coupled with a network 1330. In some implementations, one or more components of the computer 1302 can be configured to operate within different environments, including cloud-computing-based environments, local environments, global environments, and combinations of environments.

[0083] At a high level, the computer 1302 is an electronic computing device operable to receive, transmit, process, store, and manage data and information associated with the described subject matter. According to some implementations, the computer 1302 can also include, or be communicably coupled with, an application server, an email server, a web server, a caching server, a streaming data server, or a combination of servers.

[0084] The computer 1302 can receive requests over network 1330 from a client application (for example, executing on another computer 1302). The computer 1302 can respond to the received requests by processing the received requests using software applications. Requests can also be sent to the computer 1302 from internal users (for example, from a command console), external (or third) parties, automated applications, entities, individuals, systems, and computers.

[0085] Each of the components of the computer 1302 can communicate using a system bus 1303. In some implementations, any or all of the components of the computer 1302, including hardware or software components, can interface with each other or the interface 1304 (or a combination of both), over the system bus 1303. Interfaces can use an application programming interface (API) 1312, a service layer 1313, or a combination of the API 1312 and service layer 1313. The API 1312 can include specifications for routines, data structures, and object classes. The API 1312 can be either computer-language independent or dependent. The API 1312 can refer to a complete interface, a single function, or a set of APIs.

[0086] The service layer 1313 can provide software services to the computer 1302 and other components (whether illustrated or not) that are communicably coupled to the computer 1302. The functionality of the computer 1302 can be accessible for all service consumers using this service layer. Software services, such as those provided by the service layer 1313, can provide reusable, defined functionalities through a defined interface. For example, the interface can be software written in JAVA, C++, or a language providing data in extensible markup language (XML) format. While illustrated as an integrated component of the computer 1302, in alternative implementations, the API 1312 or the service layer 1313 can be stand-alone components in relation to other components of the computer 1302 and other components communicably coupled to the computer 1302. Moreover, any or all parts of the API 1312 or the service layer 1313 can be implemented as child or sub-modules of another software module, enterprise application, or hardware module without departing from the scope of the present disclosure.

[0087] The computer 1302 includes an interface 1304. Although illustrated as a single interface 1304 in FIG. 13, two or more interfaces 1304 can be used according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. The interface 1304 can be used by the computer 1302 for communicating with other systems that are connected to the network 1330 (whether illustrated or not) in a distributed environment. Generally, the interface 1304 can include, or be implemented using, logic encoded in software or hardware (or a combination of software and hardware) operable to communicate with the network 1330. More specifically, the interface 1304 can include software supporting one or more communication protocols associated with communications. As such, the network 1330 or the interface's hardware can be operable to communicate physical signals within and outside of the illustrated computer 1302.

[0088] The computer 1302 includes a processor 1305. Although illustrated as a single processor 1305 in FIG. 13, two or more processors 1305 can be used according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. Generally, the processor 1305 can execute instructions and can manipulate data to perform the operations of the computer 1302, including operations using algorithms, methods, functions, processes, flows, and procedures as described in the present disclosure.

[0089] The computer 1302 also includes a database 1306 that can hold data for the computer 1302 and other components connected to the network 1330 (whether illustrated or not). For example, database 1306 can be an in-memory, conventional, or a database storing data consistent with the present disclosure. In some implementations, database 1306 can be a combination of two or more different database types (for example, hybrid in-memory and conventional databases) according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. Although illustrated as a single database 1306 in FIG. 13, two or more databases (of the same, different, or combination of types) can be used according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. While database 1306 is illustrated as an internal component of the computer 1302, in alternative implementations, database 1306 can be external to the computer 1302.

[0090] The computer 1302 also includes a memory 1307 that can hold data for the computer 1302 or a combination of components connected to the network 1330 (whether illustrated or not). Memory 1307 can store any data consistent with the present disclosure. In some implementations, memory 1307 can be a combination of two or more different types of memory (for example, a combination of semiconductor and magnetic storage) according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. Although illustrated as a single memory 1307 in FIG. 13, two or more memories 1307 (of the same, different, or combination of types) can be used according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. While memory 1307 is illustrated as an internal component of the computer 1302, in alternative implementations, memory 1307 can be external to the computer 1302.

[0091] The application 1308 can be an algorithmic software engine providing functionality according to particular needs, desires, or particular implementations of the computer 1302 and the described functionality. For example, application 1308 can serve as one or more components, modules, or applications. Further, although illustrated as a single application 1308, the application 1308 can be implemented as multiple applications 1308 on the computer 1302. In addition, although illustrated as internal to the computer 1302, in alternative implementations, the application 1308 can be external to the computer 1302.

[0092] The computer 1302 can also include a power supply 1314. The power supply 1314 can include a rechargeable or non-rechargeable battery that can be configured to be either user- or non-user-replaceable. In some implementations, the power supply 1314 can include power-conversion and management circuits, including recharging, standby, and power management functionalities. In some implementations, the power-supply 1314 can include a power plug to allow the computer 1302 to be plugged into a wall socket or a power source to, for example, power the computer 1302 or recharge a rechargeable battery.

[0093] There can be any number of computers 1302 associated with, or external to, a computer system containing computer 1302, with each computer 1302 communicating over network 1330. Further, the terms client, user, and other appropriate terminology can be used interchangeably, as appropriate, without departing from the scope of the present disclosure. Moreover, the present disclosure contemplates that many users can use one computer 1302 and one user can use multiple computers 1302.

[0094] Implementations of the subject matter and the functional operations described in this specification can be implemented in digital electronic circuitry, in tangibly embodied computer software or firmware, in computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Software implementations of the described subject matter can be implemented as one or more computer programs. Each computer program can include one or more modules of computer program instructions encoded on a tangible, non transitory, computer-readable computer-storage medium for execution by, or to control the operation of, data processing apparatus. Alternatively, or additionally, the program instructions can be encoded in/on an artificially generated propagated signal. The example, the signal can be a machine-generated electrical, optical, or electromagnetic signal that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. The computer-storage medium can be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, or a combination of computer-storage mediums.

[0095] The terms data processing apparatus, computer, and electronic computer device (or equivalent as understood by one of ordinary skill in the art) refer to data processing hardware. For example, a data processing apparatus can encompass all kinds of apparatus, devices, and machines for processing data, including by way of example, a programmable processor, a computer, or multiple processors or computers. The apparatus can also include special purpose logic circuitry including, for example, a central processing unit (CPU), a field programmable gate array (FPGA), or an application specific integrated circuit (ASIC). In some implementations, the data processing apparatus or special purpose logic circuitry (or a combination of the data processing apparatus or special purpose logic circuitry) can be hardware or software-based (or a combination of both hardware- and software-based). The apparatus can optionally include code that creates an execution environment for computer programs, for example, code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of execution environments. The present disclosure contemplates the use of data processing apparatuses with or without conventional operating systems, for example LINUX, UNIX, WINDOWS, MAC OS, ANDROID, or IOS.

[0096] A computer program, which can also be referred to or described as a program, software, a software application, a module, a software module, a script, or code, can be written in any form of programming language. Programming languages can include, for example, compiled languages, interpreted languages, declarative languages, or procedural languages. Programs can be deployed in any form, including as stand-alone programs, modules, components, subroutines, or units for use in a computing environment. A computer program can, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data, for example, one or more scripts stored in a markup language document, in a single file dedicated to the program in question, or in multiple coordinated files storing one or more modules, sub programs, or portions of code. A computer program can be deployed for execution on one computer or on multiple computers that are located, for example, at one site or distributed across multiple sites that are interconnected by a communication network. While portions of the programs illustrated in the various figures may be shown as individual modules that implement the various features and functionality through various objects, methods, or processes, the programs can instead include a number of sub-modules, third-party services, components, and libraries. Conversely, the features and functionality of various components can be combined into single components as appropriate. Thresholds used to make computational determinations can be statically, dynamically, or both statically and dynamically determined.

[0097] The methods, processes, or logic flows described in this specification can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output. The methods, processes, or logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, for example, a CPU, an FPGA, or an ASIC.

[0098] Computers suitable for the execution of a computer program can be based on one or more of general and special purpose microprocessors and other kinds of CPUs. The elements of a computer are a CPU for performing or executing instructions and one or more memory devices for storing instructions and data. Generally, a CPU can receive instructions and data from (and write data to) a memory. A computer can also include, or be operatively coupled to, one or more mass storage devices for storing data. In some implementations, a computer can receive data from, and transfer data to, the mass storage devices including, for example, magnetic, magneto optical disks, or optical disks. Moreover, a computer can be embedded in another device, for example, a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a global positioning system (GPS) receiver, or a portable storage device such as a universal serial bus (USB) flash drive.

[0099] Computer readable media (transitory or non-transitory, as appropriate) suitable for storing computer program instructions and data can include all forms of permanent/non-permanent and volatile/non-volatile memory, media, and memory devices. Computer readable media can include, for example, semiconductor memory devices such as random access memory (RAM), read only memory (ROM), phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), and flash memory devices. Computer readable media can also include, for example, magnetic devices such as tape, cartridges, cassettes, and internal/removable disks. Computer readable media can also include magneto optical disks and optical memory devices and technologies including, for example, digital video disc (DVD), CD ROM, DVD+/?R, DVD-RAM, DVD-ROM, HD-DVD, and BLURAY. The memory can store various objects or data, including caches, classes, frameworks, applications, modules, backup data, jobs, web pages, web page templates, data structures, database tables, repositories, and dynamic information. Types of objects and data stored in memory can include parameters, variables, algorithms, instructions, rules, constraints, and references. Additionally, the memory can include logs, policies, security or access data, and reporting files. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

[0100] Implementations of the subject matter described in the present disclosure can be implemented on a computer having a display device for providing interaction with a user, including displaying information to (and receiving input from) the user. Types of display devices can include, for example, a cathode ray tube (CRT), a liquid crystal display (LCD), a light-emitting diode (LED), and a plasma monitor. Display devices can include a keyboard and pointing devices including, for example, a mouse, a trackball, or a trackpad. User input can also be provided to the computer through the use of a touchscreen, such as a tablet computer surface with pressure sensitivity or a multi-touch screen using capacitive or electric sensing. Other kinds of devices can be used to provide for interaction with a user, including to receive user feedback including, for example, sensory feedback including visual feedback, auditory feedback, or tactile feedback. Input from the user can be received in the form of acoustic, speech, or tactile input. In addition, a computer can interact with a user by sending documents to, and receiving documents from, a device that is used by the user. For example, the computer can send web pages to a web browser on a user's client device in response to requests received from the web browser.

[0101] The term graphical user interface, or GUI, can be used in the singular or the plural to describe one or more graphical user interfaces and each of the displays of a particular graphical user interface. Therefore, a GUI can represent any graphical user interface, including, but not limited to, a web browser, a touch screen, or a command line interface (CLI) that processes information and efficiently presents the information results to the user. In general, a GUI can include a plurality of user interface (UI) elements, some or all associated with a web browser, such as interactive fields, pull-down lists, and buttons. These and other UI elements can be related to or represent the functions of the web browser.

[0102] Implementations of the subject matter described in this specification can be implemented in a computing system that includes a back end component, for example, as a data server, or that includes a middleware component, for example, an application server. Moreover, the computing system can include a front-end component, for example, a client computer having one or both of a graphical user interface or a Web browser through which a user can interact with the computer. The components of the system can be interconnected by any form or medium of wireline or wireless digital data communication (or a combination of data communication) in a communication network. Examples of communication networks include a local area network (LAN), a radio access network (RAN), a metropolitan area network (MAN), a wide area network (WAN), Worldwide Interoperability for Microwave Access (WIMAX), a wireless local area network (WLAN) (for example, using 802.11 a/b/g/n or 802.20 or a combination of protocols), all or a portion of the Internet, or any other communication system or systems at one or more locations (or a combination of communication networks). The network can communicate with, for example, Internet Protocol (IP) packets, frame relay frames, asynchronous transfer mode (ATM) cells, voice, video, data, or a combination of communication types between network addresses.

[0103] The computing system can include clients and servers. A client and server can generally be remote from each other and can typically interact through a communication network. The relationship of client and server can arise by virtue of computer programs running on the respective computers and having a client-server relationship.

[0104] Cluster file systems can be any file system type accessible from multiple servers for read and update. Locking or consistency tracking may not be necessary since the locking of exchange file system can be done at application layer. Furthermore, Unicode data files can be different from non-Unicode data files.

[0105] While this specification contains many specific implementation details, these should not be construed as limitations on the scope of what may be claimed, but rather as descriptions of features that may be specific to particular implementations. Certain features that are described in this specification in the context of separate implementations can also be implemented, in combination, in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations, separately, or in any suitable sub-combination. Moreover, although previously described features may be described as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can, in some cases, be excised from the combination, and the claimed combination may be directed to a sub-combination or variation of a sub-combination.

[0106] Particular implementations of the subject matter have been described. Other implementations, alterations, and permutations of the described implementations are within the scope of the following claims as will be apparent to those skilled in the art. While operations are depicted in the drawings or claims in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed (some operations may be considered optional), to achieve desirable results. In certain circumstances, multitasking or parallel processing (or a combination of multitasking and parallel processing) may be advantageous and performed as deemed appropriate.

[0107] Moreover, the separation or integration of various system modules and components in the previously described implementations should not be understood as requiring such separation or integration in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

[0108] Accordingly, the previously described example implementations do not define or constrain the present disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of the present disclosure.

[0109] Furthermore, any claimed implementation is considered to be applicable to at least a computer-implemented method; a non-transitory, computer-readable medium storing computer-readable instructions to perform the computer-implemented method; and a computer system comprising a computer memory interoperably coupled with a hardware processor configured to perform the computer-implemented method or the instructions stored on the non-transitory, computer-readable medium.

[0110] A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. In some instances, some processes recited may not be required to achieve desirable results. For example, low pass filtering or outlier rejection may not be required to obtain SW dispersion curves. Accordingly, other embodiments are within the scope of the following claims.