• Title/Summary/Keyword: Inversion algorithm

Search Result 291, Processing Time 0.022 seconds

Maximising the lateral resolution of near-surface seismic refraction methods (천부 탄성파 굴절법 자료의 수평 분해능 최대화 연구)

  • Palmer, Derecke
    • Geophysics and Geophysical Exploration
    • /
    • v.12 no.1
    • /
    • pp.85-98
    • /
    • 2009
  • The tau-p inversion algorithm is widely employed to generate starting models with most computer programs, which implement refraction tomography. This algorithm emphasises the vertical resolution of many layers, and as a result, it frequently fails to detect even large lateral variations in seismic velocities, such as the decreases which are indicative of shear zones. This study demonstrates the failure of the tau-p inversion algorithm to detect or define a major shear zone which is 50m or 10 stations wide. Furthermore, the majority of refraction tomography programs parameterise the seismic velocities within each layer with vertical velocity gradients. By contrast, the Generalized Reciprocal Method (GRM) inversion algorithms emphasise the lateral resolution of individual layers. This study demonstrates the successful detection and definition of the 50m wide shear zone with the GRM inversion algorithms. The existence of the shear zone is confirmed by a 2D analysis of the head wave amplitudes and by numerous closely spaced orthogonal seismic profiles carried out as part of a later 3D refraction investigation. Furthermore, an analysis of the shot record amplitudes indicates that a reversal in the seismic velocities, rather than vertical velocity gradients, occurs in the weathered layers. The major conclusion reached in this study is that while all seismic refraction operations should aim to provide as accurate depth estimates as is practical, those which emphasise the lateral resolution of individual layers generate more useful results for geotechnical and environmental applications. The advantages of the improved lateral resolution are obtained with 2D traverses in which the structural features can be recognised from the magnitudes of the variations in the seismic velocities. Furthermore, the spatial patterns obtained with 3D investigations facilitate the recognition of structural features such as faults which do not display any intrinsic variation or 'signature' in seismic velocities.

A Study on the Determination of System Characteristic Constants Using Diakoptic Method (분할법을 이용한 계통발생정수 결정에 관한 연구)

  • 김준현;유석구;송기철
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.32 no.11
    • /
    • pp.387-393
    • /
    • 1983
  • This paper descrives the computational algorithm for determination of system characteristic constants using diakoptic method. When the system charateristic contants of large scale power system are calculated by using sensitivity matrix method which requires the inversion of Jacobian matrix, the necessary computing time and memory requirements increase very largely. Diakoptic mothods is benefit to get around these problems, and it is applied to a model system compared with the integrated method to discuss the efficiency of the algorithm.

Estimation of Shear-Wave Velocities of Layered Half-Space Using Full Waveform Inversion with Genetic Algorithm (유전 알고리즘을 활용한 완전파형역산 기법의 층상 반무한 지반 전단파 속도 추정)

  • Lee, Jin Ho;Lee, Se Hyeok
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.34 no.4
    • /
    • pp.221-230
    • /
    • 2021
  • This paper proposes full waveform inversion (FWI) for estimating the physical properties of a layered half-space. An FWI solution is obtained using a genetic algorithm (GA), which is a well-known global optimization approach. The dynamic responses of a layered half-space subjected to a harmonic vertical disk load are measured and compared with those calculated using the estimated physical properties. The responses are calculated using the thin-layer method, which is accurate and efficient for layered media. Subsequently, a numerical model is constructed for a layered half-space using mid-point integrated finite elements and perfectly matched discrete layers. An objective function of the global optimization problem is defined as the L2-norm of the difference between the observed and estimated responses. A GA is used to minimize the objective function and obtain a solution for the FWI. The accuracy of the proposed approach is applied to various problems involving layered half-spaces. The results verify that the proposed FWI based on a GA is suitable for estimating the material properties of a layered half-space, even when the measured responses include measurement noise.

Output Control of ITER Vertical Stabilization Converter with Circulating Current Technique (순환전류를 이용한 ITER Vertical Stabilization 컨버터의 출력 제어)

  • Chung, Gyo-Bum;Ji, Jun-Keun;Mok, Hyung-Soo
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.14 no.5
    • /
    • pp.379-386
    • /
    • 2009
  • This paper investigates the operation of ITER(International Thermonuclear Experimental Reactor) Vertical Stabilization(VS) converter with circulating current. The VS converter has two subunits in parallel. The subunit is composed two back-to-back 12 pulse thyristor converter in series. The circulating current free technique can not always maintain the closed path for the load current because of a dead time zone of the converter operation at the region of the load current inversion. The complex circulation current technique for the load current inversion with VS converter can achieve the fast response and always maintain the closed path for the load curret. The paper proposes the new circulating current algorithm for the load current inversion of ITER VS converter and proves the performance of the circulating current technique with PSIM simulation study.

Cellular Automata and It's Applications

  • Lee, Jun-Seok;Cho, Hyun-Ho;Rhee, Kyung-Hyune
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.4
    • /
    • pp.610-619
    • /
    • 2003
  • This paper presents a concept of cellular automata and a modular exponentiation algorithm and implementation of a basic EIGamal encryption by using cellular automata. Nowadays most of modular exponentiation algorithms are implemented by a linear feedback shift register(LFSR), but its structure has disadvantage which is difficult to implement an operation scheme when the basis is changed frequently The proposed algorithm based on a cellular automata in this paper can overcome this shortcomings, and can be effectively applied to the modular exponentiation algorithm by using the characteristic of the parallelism and flexibility of cellular automata. We also propose a new fast multiplier algorithm using the normal basis representation. A new multiplier algorithm based on normal basis is quite fast than the conventional algorithms using standard basis. This application is also applicable to construct operational structures such as multiplication, exponentiation and inversion algorithm for EIGamal cryptosystem.

  • PDF

Development of an Extended EDS(Earliest Deadline Scheduling) Algorithm for the CAN-Based Real-Time System (CAN기반 실시간 시스템을 위한 확장된 EDS 알고리즘 개발)

  • Lee, Byong-Hoon;Kim, Hong-Ryeol;Kim , Dae-Won
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.7
    • /
    • pp.294-301
    • /
    • 2002
  • A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

New Power Flow Calculation Using Improved Genetic Algorithm (개선된 유전 알고리즘을 이용한 새로운 전력조류계산)

  • Chae, Myung-Suck;Lee, Tae-Hyung;Shin, Joong-Rin;Im, Han-Seok
    • Proceedings of the KIEE Conference
    • /
    • 1999.11a
    • /
    • pp.43-51
    • /
    • 1999
  • The power flow calculations(PFc) are the most important and powerful tools in power systems engineering. The conventional power flow problem is solved generally with numerical methods such as Newton-Raphson(NR). The conventional numerical method generally have some convergency problem, which is sensitive to initial value, and numerical stability problem concerned with jacobian matrix inversion. This paper presents a new PFc algorithm based on the improved genetic algorithm (IGA) which can overcome the disadvantages mentioned above. The parameters of GA, with dynamical hierarchy of the coding system, are improved to make GA a practical algorithm in the problem of real system. Some case studies with test bus system also present to show the performance of proposed algorithm. The results of proposed algorithm are compared with the results of PFc obtained using a conventional NR method.

  • PDF

High-Quality and Robust Reversible Data Hiding by Coefficient Shifting Algorithm

  • Yang, Ching-Yu;Lin, Chih-Hung
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.429-438
    • /
    • 2012
  • This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

3D Modeling and Inversion of Magnetic Anomalies (자력이상 3차원 모델링 및 역산)

  • Cho, In-Ky;Kang, Hye-Jin;Lee, Keun-Soo;Ko, Kwang-Beom;Kim, Jong-Nam;You, Young-June;Han, Kyeong-Soo;Shin, Hong-Jun
    • Geophysics and Geophysical Exploration
    • /
    • v.16 no.3
    • /
    • pp.119-130
    • /
    • 2013
  • We developed a method for inverting magnetic data to recover the 3D susceptibility models. The major difficulty in the inversion of the potential data is the non-uniqueness and the vast computing time. The insufficient number of data compared with that of inversion blocks intensifies the non-uniqueness problem. Furthermore, there is poor depth resolution inherent in magnetic data. To overcome this non-uniqueness problem, we propose a resolution model constraint that imposes large penalty on the model parameter with good resolution; on the other hand, small penalty on the model parameter with poor resolution. Using this model constraint, the model parameter with a poor resolution can be effectively resolved. Moreover, the wavelet transform and parallel solving were introduced to save the computing time. Through the wavelet transform, a large system matrix was transformed to a sparse matrix and solved by a parallel linear equation solver. This procedure is able to enormously save the computing time for the 3D inversion of magnetic data. The developed inversion algorithm is applied to the inversion of the synthetic data for typical models of magnetic anomalies and real airborne data obtained at the Geumsan area of Korea.