• Title/Summary/Keyword: 해석알고리즘

Search Result 2,223, Processing Time 0.036 seconds

Local Remeshing Algorithm for Quasi-Static Crack Propagation

  • Song, Young Joon;Koh, Byeong Cheon
    • Computational Structural Engineering
    • /
    • v.7 no.3
    • /
    • pp.167-176
    • /
    • 1994
  • A local remeshing algorithm using Delaunay property is developed for the analysis on the phenomenon of quasi-static crack propagation, which is a typical problem of accompanying constantly varying geometry. The algorithm performs both remeshing and refinement. The use of M-integral is demonstrated to simulate crack propagation under mixed mode with the edge spalling problem.

  • PDF

A Network Reduction for Parallel Assessment of Power System Security (병렬처리 안전도평가를 위한 계통축약 연구)

  • Jang, Se-Hwan;Kim, Jin-Ho;Park, June-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.802-803
    • /
    • 2007
  • 전력산업의 구조개편에 따라 현재 전력시스템은 안전도의 위협수준에 가깝게 운영되어지도록 강요받고 있다. 이러한 시대적 흐름에 의해 안전도(security)해석에 대한 보다 빠르고 정확한 연구가 중요시 되고 있다. 본 연구는 전력시스템의 안전도 해석에 있어 상정사고(contingency)를 고려할 때 클러스터링 기법을 이용한 송전 네트워크의 축약 알고리즘을 제안한다. 또한 PC 클러스터 시스템을 이용한 병렬처리기법을 이용한 상정사고의 분할연산을 수행하고자 한다. IEEE 39 모선시스템을 통해 제안된 알고리즘을 평가할 것이다.

  • PDF

Use of a New Algorithm of the STFT with Variable Frequency Resolution for the Time-Frequency Auditory Model (청각계의 시간 및 주파수 특성을 고려한 VFR-STFT 알고리즘 제안)

  • Jeong, Hyuk;Ih, Jeong-Guon
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06e
    • /
    • pp.27-30
    • /
    • 1998
  • 본 연구에서는 청각계의 시간 및 주파수 특성을 고려한 과도음의 시간-주파수 신호해석 기법인 VFT-STFT (STFT with Variable Frequency Resollution)을 제안하고자 한다. VFT-STFT은 downsampling와 FFT를 반복적으로 수행하여 주파수 대역에 따라 주파수 및 시간 분해능이 청각계의 특성과 유사한 기존의 VFR-FFT에 그 뿌리를 두고 있다. 그러나, 본 연구에서는 기존의 VFT-FFT 알고리즘에 overlap인자를 도입하여 시간-주파수 해석 결과를 구하고, 2/3-rate resampling에 의해 추가로 구성된 시간-주파수 해석 결과의 일부를 기존의 시간-주파수 해석 결과에 이식시킴으로서 기존의 VFT-FFT가 갖는 overlap과 spectral loss 등의 문제점을 최소화하고자 한다.

  • PDF

Development of A Computer Algorithm For Analysing Freeway Traffic Flow : General Theory (고속도로의 교통류해석을 위한 컴퓨터 알고리즘 개발 : 이론적 배경을 중심으로)

  • 손봉수
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.4
    • /
    • pp.131-154
    • /
    • 1996
  • 고속도로 및 도시 고속도로는 교통의 단순한 매체로 뿐만 아니라 환경, 에너지, 경제 등등 사회 전반에 걸쳐 그 역할이 다양하며, 영향력이 지대하고, 중요한 비중을 차지함으로써, 이들 도로의 효율적인 운영을 위하여 고속도로 운영체계 수립 및 설계시 교통상황을 예측할 필요성이 있다. 이런 목적을 실현하기 위하여 , 기존의 개발된 교통류 모형들을 사용할 수 있으나, 이들의 예측 결과에 대한 낮은 신뢰도, 혹은 모형의 특성(예, 처리용량, 해석방법) 에 따른 제약 등등의 이유로 실용화되지 못하고 있는 실정이다. 최근 Newell 은 충격파이론을 간편화하여 기존의 다른 교통류 이론들에 비해 많은 장점을 갖은 새로운 교통류의 이론은 개발하였다. 하지만, 이 이론도 수작업에 의한 도식적 (graphical) 해석방법을 기초로 하고 있기 때문에, 실제 교통운용체계에 사용화하기에는 거의 불가능한 비효율적 결함을 니니고 있다. 이 논문의 목적은 Newell 의 이론을 추후 실제 현장에서 적용할 수 있도록 Newell의 도식적 해석방법을 체계화(mechanize)한 컴퓨터 알고리즘을 개발하는데 있다.

  • PDF

Selection of Capacity of Circuit Breaker by Probabilistic Short-Circuit Current Analysis (확률적 고장전류 해석에 의한 차단기 용량 선정)

  • 문영현;오용택
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.1
    • /
    • pp.10-15
    • /
    • 1990
  • This paper presents an algorithm that can compute equivalent impedance effctively in computing 3-phase short circuit current which would be generated in power systems. Also this paper proposes a method that can decide the capacity of circuit breaker by analysing the fault current distribution probabilistically when the fault point of specificed line varies. The efficiency of the algorithm was verified by applying the proposed method to IEEE-6bus system and IEEE-30bus system, and probabilistic fault analysing method is verified economic in facility investment by deciding the proper capacity of circuit breaker.

  • PDF

Analyzing internet networks using an algorithm for detecting network motifs in Genetics (유전자 네트워크 모티프 알고리즘을 이용한 인터넷 네트워크 분석)

  • Na, Ha-Sun;Kim, Moon-Hwan;Ra, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.594-598
    • /
    • 2005
  • 복잡한 유전학적 네트워크 구조와 조직을 해석하여 인터넷 네트워크에서 상호연결 하는 '네트워크 모티프'를 연구한다. 다양하고 복잡한 유전학적 네트워크 구조의 설계 및 원리를 해석한 네트워크 모티프를 패턴으로 규정되어 있는 것들을 유전학적 네트워크에서 정보 네트워크(www)와의 동적으로 수행할 수 있는지 알고리즘을 통해 해석한다. 유전학적 네트워크에서 모티프들이 네트워크의 보편적인 class를 규정할 수 있는지 이론적으로 접근하여 인터넷 네트워크에 응용 및 해석하고 분석한다.

  • PDF

Vibration Analysis of the Beam Structure with a Moving Mass (이동물체에 의한 보 구조물의 진동 해석)

  • 이우식;임강민
    • Computational Structural Engineering
    • /
    • v.8 no.4
    • /
    • pp.57-64
    • /
    • 1995
  • This paper introduced a simple numerical analysis algorithm for the calculation of the dynamic responses of the beam structure with a moving mass. The dynamic equation of motion of the Bernoulli-Euler beam is derived by considering the moving mass as a moving particle, and the dynamic equation of motion is transformed into an integro-differential equation by use of the structural influence function. The numerical solutions of the integro-differential equation are obtained by the modal analysis approach, and compared with those cited from well-known references. The proves that the numerical analysis algorithm proposed herein provide very reliable results, and thus it can be utilized in the design analysis of the beamlike structures exited by a mass which is traveling on it.

  • PDF

Model Analysis of R/C Framed Structures to Earthquake Excitations (지진하중을 받는 철근콘크리트 골조 구조물의 모드 해석)

  • 장극관;이리형
    • Magazine of the Korea Concrete Institute
    • /
    • v.6 no.3
    • /
    • pp.180-189
    • /
    • 1994
  • An approximate method of normal coordinate idealization for use in nonlinear R /C frames has been developed. Normal coordinate apporaches have been used for nonlinear problems in the past, but they are not recerved wide acceptance because of the need for eigenvector computation in each time step. The proposed method circumvents the eigenvector recalculation problem by evaluating a limited number of sets of mode shapes in performing the dynamic analysis. Then some of the predetermined sets of eigenvectors are used in the nonlinear dynamic repeatedly. The method is applied to frame structures with ductile R /C elements. The plastic hinge zones are modeled with hysteres~s loops which evince degrading stiffness and pinching effects. Effxiencies and accuracies of the method for this application are presented.

Genetic Programming based Manufacutring Big Data Analytics (유전 프로그래밍을 활용한 제조 빅데이터 분석 방법 연구)

  • Oh, Sanghoun;Ahn, Chang Wook
    • Smart Media Journal
    • /
    • v.9 no.3
    • /
    • pp.31-40
    • /
    • 2020
  • Currently, black-box-based machine learning algorithms are used to analyze big data in manufacturing. This algorithm has the advantage of having high analytical consistency, but has the disadvantage that it is difficult to interpret the analysis results. However, in the manufacturing industry, it is important to verify the basis of the results and the validity of deriving the analysis algorithms through analysis based on the manufacturing process principle. To overcome the limitation of explanatory power as a result of this machine learning algorithm, we propose a manufacturing big data analysis method using genetic programming. This algorithm is one of well-known evolutionary algorithms, which repeats evolutionary operators such as selection, crossover, mutation that mimic biological evolution to find the optimal solution. Then, the solution is expressed as a relationship between variables using mathematical symbols, and the solution with the highest explanatory power is finally selected. Through this, input and output variable relations are derived to formulate the results, so it is possible to interpret the intuitive manufacturing mechanism, and it is also possible to derive manufacturing principles that cannot be interpreted based on the relationship between variables represented by formulas. The proposed technique showed equal or superior performance as a result of comparing and analyzing performance with a typical machine learning algorithm. In the future, the possibility of using various manufacturing fields was verified through the technique.

Performance analysis of iterative groupwise equal-delay interference cancellation(IGEIC) for multiuser detection of coherent W-CDMA system (동기복조 W-CDMA 시스템의 다중 사용자 검출을 위한 반복 그룹단위 등지연 간섭제거(IGEIC) 알고리즘 성능해석)

  • 구제길;최형진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3B
    • /
    • pp.179-187
    • /
    • 2002
  • This paper proposes and analyzes the iterative groupwise equal-delay interference cancellation(IGEIC) algorithm for coherent detection of an asynchronous wideband DS-CDMA system in a single cell over multipath fading channels. The IGEIC algorithm divide users in a system into several groups, and subtract out interference signal from the received signal as many as the number of users within a user group, iteratively. The IGEIC algorithm is also classified into the iterative groupwise equal-delay serial interference cancellation(IGESIC) algorithm and the iterative groupwise equal-delay parallel interference cancellation(IGEPIC) algorithm. In the case of perfect correlation for spreading codes, it shows that the performance of IGESIC and IGEPIC algorithm is the same after interference cancellation of as many as the number of users within a user group, but the performance of IGEPIC algorithm is superior to the IGESIC algorithm just before fecal cancellation within a user group. The results show that (he performance of the two proposed algorithms are also superior to the SIC algorithm by 3dB.