Cognitive seismic data modelling based successive differential evolution algorithm for effective exploration of oil-gas reservoirs

A cognitive modelling based new inversion method, the successive differential evolution (DE-S) algorithm, is proposed to estimate the Q factor and velocity from the zero-offset vertical seismic profile (VSP) record for oil-gas reservoir exploration. The DE algorithm seeks optimal solutions by simulating the natural species evolution processes and makes the individuals become optimal. This algorithm is suitable for the high-dimensional nonseparable model space where the inversion leads to recognition and prediction of hydrocarbon reservoirs. The viscoelastic medium is split into layers whose thicknesses equal to the space between two successive VSP geophones, and the estimated parameters of each layer span the related subspace. All estimated parameters span to a high dimensional nonseparable model space. We develop bottom-up workflow, in which the Q factor and the velocity are estimated using the DE algorithm layer by layer. In order to improve the inversion precision, the crossover strategy is discarded and we derive the weighted mutation strategy. Additionally, two kinds of stopping criteria for effective iteration are proposed to speed up the computation. The new method has fast speed, good convergence and is no longer dependent on the initial values of model parameters. Experimental results on both synthetic and real zero-offset VSP data indicate that this method is noise robust and has great potential to derive reliable seismic attenuation and velocity, which is an important diagnostic tool for reservoir characterization

Set-Based Adaptive Distributed Differential Evolution for Anonymity-Driven Database Fragmentation

By breaking sensitive associations between attributes, database fragmentation can protect the privacy of outsourced data storage. Database fragmentation algorithms need prior knowledge of sensitive associations in the tackled database and set it as the optimization objective. Thus, the effectiveness of these algorithms is limited by prior knowledge. Inspired by the anonymity degree measurement in anonymity techniques such as k-anonymity, an anonymity-driven database fragmentation problem is defined in this paper. For this problem, a set-based adaptive distributed differential evolution (S-ADDE) algorithm is proposed. S-ADDE adopts an island model to maintain population diversity. Two set-based operators, i.e., set-based mutation and set-based crossover, are designed in which the continuous domain in the traditional differential evolution is transferred to the discrete domain in the anonymity-driven database fragmentation problem. Moreover, in the set-based mutation operator, each individual’s mutation strategy is adaptively selected according to the performance. The experimental results demonstrate that the proposed S-ADDE is significantly better than the compared approaches. The effectiveness of the proposed operators is verified