Pre-stack depth migration velocity analysis is one of the key techniques influencing image quality. As for areas with a rugged surface and complex subsurface, conventional prestack depth migration velocity analysis co...Pre-stack depth migration velocity analysis is one of the key techniques influencing image quality. As for areas with a rugged surface and complex subsurface, conventional prestack depth migration velocity analysis corrects the rugged surface to a known datum or designed surface velocity model on which to perform migration and update the velocity. We propose a rugged surface tomographic velocity inversion method based on angle-domain common image gathers by which the velocity field can be updated directly from the rugged surface without static correction for pre-stack data and improve inversion precision and efficiency. First, we introduce a method to acquire angle-domain common image gathers (ADCIGs) in rugged surface areas and then perform rugged surface tornographic velocity inversion. Tests with model and field data prove the method to be correct and effective.展开更多
Pre-stack depth migration velocity analysis is one of the keys to influencing the imaging quality of pre-stack migration.In this paper we cover a residual curvature velocity analysis method on angle-domain common imag...Pre-stack depth migration velocity analysis is one of the keys to influencing the imaging quality of pre-stack migration.In this paper we cover a residual curvature velocity analysis method on angle-domain common image gathers(ADCIGs) which can depict the relationship between incident angle and migration depth at imaging points and update the migration velocity.Differing from offset-domain common image gathers(ODCIGs),ADCIGs are not disturbed by the multi-path problem which contributes to imaging artifacts,thus influencing the velocity analysis.On the basis of horizontal layers,we derive the residual depth equation and also propose a velocity analysis workflow for velocity scanning.The tests to synthetic and field data prove the velocity analysis methods adopted in this paper are robust and valid.展开更多
Angle-domain common-image gathers(ADCIGs) are the basic data in migration velocity analysis(MVA) and amplitude variation with angle(AVA) analysis. We propose a common-angle gather-generating scheme using Kirchho...Angle-domain common-image gathers(ADCIGs) are the basic data in migration velocity analysis(MVA) and amplitude variation with angle(AVA) analysis. We propose a common-angle gather-generating scheme using Kirchhoff PSDM based on the traveltime gradient field. The scheme includes three major operations:(1) to calculate the traveltime field of the source and the receiver based on the dynamic programming approach;(2) to obtain the refl ection angle according to the traveltime gradient field in the image space; and(3) to generate the ADCIGs during the migration process. Because of the computation approach, the method for generating ADCIGs is superior to conventional ray-based methods. We use the proposed ADCIGs generation method in 3D large-scale seismic data. The key points of the method are the following.(1) We use common-shot datasets for migration,(2) we load traveltimes based on the shot aperture, and(3) we use the MPI and Open Mp memory sharing to decrease the amount of input and output(I/O). Numerical examples using synthetic data suggest that the ADCIGs improve the quality of the velocity and the effectiveness of the 3D angle-gather generation scheme.展开更多
Prestack depth migration of multicomponent seismic data improves the imaging accuracy of subsurface complex geological structures. An accurate velocity field is critical to accurate imaging. Gaussian beam migration wa...Prestack depth migration of multicomponent seismic data improves the imaging accuracy of subsurface complex geological structures. An accurate velocity field is critical to accurate imaging. Gaussian beam migration was used to perform multicomponent migration velocity analysis of PP- and PS-waves. First, PP- and PS-wave Gaussian beam prestack depth migration algorithms that operate on common-offset gathers are presented to extract offsetdomain common-image gathers of PP- and PS-waves. Second, based on the residual moveout equation, the migration velocity fields of P- and S-waves are updated. Depth matching is used to ensure that the depth of the target layers in the PP- and PS-wave migration profiles are consistent, and high-precision P- and S-wave velocities are obtained. Finally, synthetic and field seismic data suggest that the method can be used effectively in multiwave migration velocity analysis.展开更多
Least squares migration can eliminate the artifacts introduced by the direct imaging of irregular seismic data but is computationally costly and of slow convergence. In order to suppress the migration noise, we propos...Least squares migration can eliminate the artifacts introduced by the direct imaging of irregular seismic data but is computationally costly and of slow convergence. In order to suppress the migration noise, we propose the preconditioned prestack plane-wave least squares reverse time migration (PLSRTM) method with singular spectrum constraint. Singular spectrum analysis (SSA) is used in the preconditioning of the take-off angle-domain common-image gathers (TADCIGs). In addition, we adopt randomized singular value decomposition (RSVD) to calculate the singular values. RSVD reduces the computational cost of SSA by replacing the singular value decomposition (SVD) of one large matrix with the SVD of two small matrices. We incorporate a regularization term into the preconditioned PLSRTM method that penalizes misfits between the migration images from the plane waves with adjacent angles to reduce the migration noise because the stacking of the migration results cannot effectively suppress the migration noise when the migration velocity contains errors. The regularization imposes smoothness constraints on the TADCIGs that favor differential semblance optimization constraints. Numerical analysis of synthetic data using the Marmousi model suggests that the proposed method can efficiently suppress the artifacts introduced by plane-wave gathers or irregular seismic data and improve the imaging quality of PLSRTM. Furthermore, it produces better images with less noise and more continuous structures even for inaccurate migration velocities.展开更多
Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits d...Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.展开更多
The fixed-point algorithm and infomax algorithm are two of the most popular algorithms in independent component analysis(ICA).However,it is hard to take both stability and speed into consideration in processing functi...The fixed-point algorithm and infomax algorithm are two of the most popular algorithms in independent component analysis(ICA).However,it is hard to take both stability and speed into consideration in processing functional magnetic resonance imaging(fMRI)data.In this paper,an optimization model for ICA is presented and an improved fixed-point algorithm based on the model is proposed.In the new algorithms a small step size is added to increase the stability.In order to accelerate the convergence,an improvement on Newton method is made,which makes cubic convergence for the new algorithm.Applying the algorithm and two other algorithms to invivo fMRI data,the results show that the new algorithm separates independent components stably,which has faster convergence speed and less computation than the other two algorithms.The algorithm has obvious advantage in processing fMRI signal with huge data.展开更多
基金sponsored by the National 863 Project(No.2009AA06Z206)the Self-governed Innovative Project of China University of Petroleum(No.11CX04010A)the Doctoral Fund of National Ministry of Education(No. 20110133120001)
文摘Pre-stack depth migration velocity analysis is one of the key techniques influencing image quality. As for areas with a rugged surface and complex subsurface, conventional prestack depth migration velocity analysis corrects the rugged surface to a known datum or designed surface velocity model on which to perform migration and update the velocity. We propose a rugged surface tomographic velocity inversion method based on angle-domain common image gathers by which the velocity field can be updated directly from the rugged surface without static correction for pre-stack data and improve inversion precision and efficiency. First, we introduce a method to acquire angle-domain common image gathers (ADCIGs) in rugged surface areas and then perform rugged surface tornographic velocity inversion. Tests with model and field data prove the method to be correct and effective.
基金supported by the National 863 Program (Grant No.2006AA06Z206,Sustained supported)the National Science and Technology Major Project (Grant No.2008ZX05006-004)SinoPec Group Marine Facies Research (Grant No.08370502000410)
文摘Pre-stack depth migration velocity analysis is one of the keys to influencing the imaging quality of pre-stack migration.In this paper we cover a residual curvature velocity analysis method on angle-domain common image gathers(ADCIGs) which can depict the relationship between incident angle and migration depth at imaging points and update the migration velocity.Differing from offset-domain common image gathers(ODCIGs),ADCIGs are not disturbed by the multi-path problem which contributes to imaging artifacts,thus influencing the velocity analysis.On the basis of horizontal layers,we derive the residual depth equation and also propose a velocity analysis workflow for velocity scanning.The tests to synthetic and field data prove the velocity analysis methods adopted in this paper are robust and valid.
基金funded by the National Basic Research Program of China(973 Program)(No.2011 CB201002)the National Natural Science Foundation of China(No.41374117)the great and special projects(No.2011ZX05003-003,2011ZX05005-005-008 HZ,and 2011ZX05006-002)
文摘Angle-domain common-image gathers(ADCIGs) are the basic data in migration velocity analysis(MVA) and amplitude variation with angle(AVA) analysis. We propose a common-angle gather-generating scheme using Kirchhoff PSDM based on the traveltime gradient field. The scheme includes three major operations:(1) to calculate the traveltime field of the source and the receiver based on the dynamic programming approach;(2) to obtain the refl ection angle according to the traveltime gradient field in the image space; and(3) to generate the ADCIGs during the migration process. Because of the computation approach, the method for generating ADCIGs is superior to conventional ray-based methods. We use the proposed ADCIGs generation method in 3D large-scale seismic data. The key points of the method are the following.(1) We use common-shot datasets for migration,(2) we load traveltimes based on the shot aperture, and(3) we use the MPI and Open Mp memory sharing to decrease the amount of input and output(I/O). Numerical examples using synthetic data suggest that the ADCIGs improve the quality of the velocity and the effectiveness of the 3D angle-gather generation scheme.
基金supported by the National Special Fund of China(No.2011ZX05035-001-006HZ,2011ZX05008-006-22,2011ZX05049-01-02,and 2011ZX05019-003)the National Natural Science Foundation of China(No.41104084)the PetroChina Innovation Foundation(No.2011D-5006-0303)
文摘Prestack depth migration of multicomponent seismic data improves the imaging accuracy of subsurface complex geological structures. An accurate velocity field is critical to accurate imaging. Gaussian beam migration was used to perform multicomponent migration velocity analysis of PP- and PS-waves. First, PP- and PS-wave Gaussian beam prestack depth migration algorithms that operate on common-offset gathers are presented to extract offsetdomain common-image gathers of PP- and PS-waves. Second, based on the residual moveout equation, the migration velocity fields of P- and S-waves are updated. Depth matching is used to ensure that the depth of the target layers in the PP- and PS-wave migration profiles are consistent, and high-precision P- and S-wave velocities are obtained. Finally, synthetic and field seismic data suggest that the method can be used effectively in multiwave migration velocity analysis.
基金supported by the National Science and Technology Major Project(No.2016ZX05014-001-008)the National Key Basic Research Program of China(No.2014CB239006)+2 种基金the National Natural Science Foundation of China(Nos.41104069 and 41274124)the Open foundation of SINOPEC Key Laboratory of Geophysics(No.33550006-15-FW2099-0033)the Fundamental Research Funds for Central Universities(No.16CX06046A)
文摘Least squares migration can eliminate the artifacts introduced by the direct imaging of irregular seismic data but is computationally costly and of slow convergence. In order to suppress the migration noise, we propose the preconditioned prestack plane-wave least squares reverse time migration (PLSRTM) method with singular spectrum constraint. Singular spectrum analysis (SSA) is used in the preconditioning of the take-off angle-domain common-image gathers (TADCIGs). In addition, we adopt randomized singular value decomposition (RSVD) to calculate the singular values. RSVD reduces the computational cost of SSA by replacing the singular value decomposition (SVD) of one large matrix with the SVD of two small matrices. We incorporate a regularization term into the preconditioned PLSRTM method that penalizes misfits between the migration images from the plane waves with adjacent angles to reduce the migration noise because the stacking of the migration results cannot effectively suppress the migration noise when the migration velocity contains errors. The regularization imposes smoothness constraints on the TADCIGs that favor differential semblance optimization constraints. Numerical analysis of synthetic data using the Marmousi model suggests that the proposed method can efficiently suppress the artifacts introduced by plane-wave gathers or irregular seismic data and improve the imaging quality of PLSRTM. Furthermore, it produces better images with less noise and more continuous structures even for inaccurate migration velocities.
基金partially supported by he State Key Program of National Natural Science of China No. 61332019Major State Basic Research Development Program of China (973 Program) No. 2014CB340601+1 种基金the National Science Foundation of China No. 61202386, 61402339the National Cryptography Development Fund No. MMJJ201701304
文摘Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.
文摘The fixed-point algorithm and infomax algorithm are two of the most popular algorithms in independent component analysis(ICA).However,it is hard to take both stability and speed into consideration in processing functional magnetic resonance imaging(fMRI)data.In this paper,an optimization model for ICA is presented and an improved fixed-point algorithm based on the model is proposed.In the new algorithms a small step size is added to increase the stability.In order to accelerate the convergence,an improvement on Newton method is made,which makes cubic convergence for the new algorithm.Applying the algorithm and two other algorithms to invivo fMRI data,the results show that the new algorithm separates independent components stably,which has faster convergence speed and less computation than the other two algorithms.The algorithm has obvious advantage in processing fMRI signal with huge data.