• Title/Summary/Keyword: 모의 정확도 향상

Search Result 741, Processing Time 0.033 seconds

Nondestructive Testing Qualification and Certification of Personnel (비파괴검사 기술자의 자격인정 및 인증)

  • Park, Ik-Keun;Park, Un-Su;Chang, Hong-Keun
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.19 no.4
    • /
    • pp.300-313
    • /
    • 1999
  • 비파괴검사 기술의 레벨 향상과 안정화를 통한 시간적 재현성이 있는 비파괴검사 결과의 확보를 위해서는 비파괴검사 기술자의 자격 인정 및 인증(nondestructive testing qualification and certification of personnel)제도의 확립이 매우 중요하다. 비파괴검사 결과에 대한 유효성은 비파괴검사을 실시하는 사람의 능력이나 비파괴검사에 대한 책임을 지고 있는 사람의 능력에 크게 의존한다. 1974년부터 원자력 선진국들이 중심이 되어 수행된 PISC 프로그램(program for inspection of steel components) 및 EPRI 등에서는 순회시험 (piping inspection round-robin: PIRR trial) 결과 기존 비파괴검사 방법은 모의 시험편에 있는 상당히 큰 결함도 탐지하지 못하거나 정확한 결함크기를 측정하는데 실패한 경우가 있으며, 검사자의 기량 또는 신체조건에 상당한 차이가 있는 것으로 나타났다[1]. 국제표준화기구(ISO)의 비파괴검사 기술자의 기량인정 및 인증에 대한 국제규격안 DIS(draft international standard) 9712에서는 비파괴검사를 기획 실시 감독 감시 평가를 하기 위한 적절한 이론적 및 실무적 지식을 필요로 하는 기술자의 능력을 평가하고, 문서화하는 방법을 제공하는 절차를 제시하고 있다. 국제표준화기구에 의한 비파괴검사 기술자의 기량인정 및 인증에 대한 국제통합을 추진하는 동기는 제 3자에 의한 체계적인 인증시스템을 가지고 있지 않은 나라와 새로운 NDT 방법에 대해서 인증제도를 적용할 때 세계적인 공통성을 갖도록 유도하기 위함이다. 현재, 우리나라 비파괴검사 기술자의 기술자격 인증제도는 국가기술자격법에 의거하여 한국산업인력공단에서 주관하여 기술사, 기사, 산업기사, 기능사로 구분하여 실시하고 있다. 국제표준화기구의 비파괴검사 기술자의 자격과 인증에 대한 국제 통합화(안)[2]이 거의 마무리 단계에 있고 일본을 비롯한 많은 나라가 국제규격을 기초로 한 새로운 인증제도를 발족시켜 거의 시행 단계에 있다. 반면 국내에서는 한국비파괴검사학회(KSNT)에서 비파괴검사 기술자의 자격인정 및 인증제도의 개선방향이 제시된 바 있고 [3], 표준화위원회에서 나름대로 준비를 하고 있으나 아직 구체적인 실천단계에와 있지 못하다. 본 고에서는 최근 대폭수정 보완된 ISO/DIS 9712 국제규격(안)을 회원들에게 소개하고, 우리나라의 향후 대응방안에 관한 회원 여러분의 의견 수렴에 도움을 주고자 ISO/DIS 9712(1997)를 번역하여 제공한다.

  • PDF

Analysis of Hydrologic Cycle and BOD Loads Using HSPF in the Anyancheon Watershed (HSPF 모형을 이용한 안양천 유역의 물순환 및 BOD 부하량 분석)

  • Lee, Kil-Seong;Chung, Eun-Sung;Lee, Joon-Seok;Hong, Won-Pyo
    • Journal of Korea Water Resources Association
    • /
    • v.40 no.8
    • /
    • pp.585-600
    • /
    • 2007
  • The hydrologic cycle and BOD pollutant loads of all sub-watersheds were analyzed using HSPF (Hydrological Simulation Program-Fortran). At first, sensitivity analyses to water quantity (peak discharge and total volume) and quality (BOD peak concentrations and total loads) were conducted and some critical Parameters were selected. For more precise simulation, the study watershed was divided into four parts according to the landuse characteristics and used climate data and so calibrated and verified respectively. It was found that as the urban area ratio increases in the downstream direction, baseflow decreases (11.1 % $\rightarrow$ 5.0%) and the ratio of direct runoff volume(42.5 % $\rightarrow$ 56.9 %), BOD concentration (3.3 mg/L $\rightarrow$ 15.0 mg/L) and unit loads (55.4 kg/ha/year $\rightarrow$ 354.5 kg/ha/year) increase.

An Efficient Bit Loading Algorithm for OFDM-based Wireless LAN systems and Hardware Architecture Design (OFDM 기반의 무선 LAN 시스템을 위한 효율적인 비트 로딩 알고리즘 및 하드웨어 구조 설계)

  • 강희윤;손병직;정윤호;김근회;김재석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.5
    • /
    • pp.153-160
    • /
    • 2004
  • In this paper, we propose an efficient bit loading algorithm for IEEE 802.11a wireless LAN systems. While a conventional bit loading algorithm uses the SNR value of each subcarrier, it is very difficult to estimate the exact SNR value in wireless LAN systems due to randomness of AWGN. Therefore, in order to solve this problem our proposed algorithm uses the channel frequency response instead of the SNR of each subcarrier. Through simulation results, we can obtain the performance gain of 3.5∼8㏈ at PER of 10-2 with the proposed bit loading algorithm while the conventional one obtains the performance gain of 0.5∼5㏈ at the same conditions. Also, the increased data rate can be confirmed 63Mbps. After the logic synthesis using 0.3${\mu}{\textrm}{m}$ CMOS technology, the logic gate count for the processor with proposed algorithm can be reduced by 34% in comparison with the conventional one.

Playback Quantity-based Proxy Caching Scheme for Continuous Media Data (재생량에 기반한 연속미디어 데이터 프록시 캐슁 기법)

  • Hong, Hyeon-Ok;Im, Eun-Ji;Jeong, Gi-Dong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.303-310
    • /
    • 2002
  • In this paper, we propose a proxy caching scheme that stores a portion of a continuous media object or an entire object on the Internet. The proxy stores the initial fraction of a continuous media object and determines the optimal size of the initial fraction of the continuous media object to be cached based on the object popularity. Under the proposed scheme, the initial latency of most clients and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Considering the characteristics of continuous media, we also propose the novel popularity for the continuous media objects based on the amount of the data of each object played by the clients. Finally, we have performed trace-driven simulations to evaluate our caching scheme and the popularity for the continuous media objects. Through these simulations, we have verified that our caching scheme, PPC outperforms other well-known caching schemes in terms of BHR, DSR and replacement and that popularity for the continuous media objects based on the amount of the playback data can enhance the performance of caching scheme.

ATM Network Survivability Enhancement Scheme using Disjoint VP Groups (분리 VP 그룹을 이용한 ATM 망 생존도 향상 방안)

  • Lee, Gil-Heung;Choe, Yong-Hun;Park, Won-Seo;Lee, Jae-Yong;Lee, Sang-Bae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.949-956
    • /
    • 1999
  • 이 논문에서는 ATM (Asynchronous Transfer Mode) 방식의 초고속망의 장애 발생 시 이용자 연결의 QoS (Quality of Service)를 고려하여 복구할 수 있게 하는 보호 망 설계 방안을 제시한다. 제시한 설계 방안에 기초한 비용과 복구 특성을 분석과 모의 실험을 통해 알아본다. 제안하는 망에서의 복구는 분리 VP 그룹 (Disjoint Virtual Path Group, DVPG) 을 사용하는 상태 독립적 (State- independent) 방식으로 복구된다. ATM 망의 운용 및 보호 VP 할당과 용량 배정 문제를 정의하고 이를 바탕으로 최소의 비용을 갖는 VP 망을 설계한다. 망의 고장 시 기존 노드간의 VP 연결은 미리 할당된 링크 또는 노드 분리 보호 VP 경로를 따라 간단한 복구 알고리즘에 의해 빠르게 복구된다. QoS의 고려는 추가 비용을 필요로 하지만 정확한 이용자 연결의 복구를 실현하며, 분리 VP 그룹의 적용은 비용을 상승시키지만, 빠른 복구와 복수의 고장에 대처할 수 있는 방안이 된다.Abstract A cost evaluation of protection scheme for VP-based ATM network is presented here and its related characteristics are evaluated. The proposed and evaluated scheme is a state-independent restoration scheme using a disjoint path group. For fast and simple restoration of failed connections, link disjoint or node disjoint VP groups (DVPG) were utilized in this paper. A VP assignment and capacity planning problem is formulated. When failure occurs, the failed working VPs are switched to the protection VPs of disjoint path groups with a simple restoration scheme. And, cost evaluation and restoration characteristics are presented. The consideration of multiple QoS (Quality of Service) levels and disjoint path group protection scheme require additional network cost but acquire fit and fast restoration.

Adaptive spatio-temporal deinterlacting algorithm based on bi-directional motion compensation (양방향 움직임 기반의 시공간 적응형 디인터레이싱 기법)

  • Lee, Sung-Gyu;Lee, Dong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.418-428
    • /
    • 2002
  • In this paper, we propose a motion-adaptive de-interlacing method using motion compensated interpolation. In a conventional motion compensated method, a simple pre-filter such as line averaging is applied to interpolate missing lines before the motion estimation. However, this method causes interpolation error because of inaccurate motion estimation and compensation. In the proposed method, EBMF(Edge Based Median Filter) as a pre-filter is applied, and new matching method, which uses two same-parity fields and opposite-parity field as references, is proposed. For further improvement, motion correction filter is proposed to reduce the interpolation error caused by incorrect motion. Simulation results show that the proposed method provides better performance than existing methods.

Implementation of High Speed Big Data Processing System using In Memory Data Grid in Semiconductor Process (반도체 공정에서 인 메모리 데이터 그리드를 이용한 고속의 빅데이터 처리 시스템 구현)

  • Park, Jong-Beom;Lee, Alex;Kim, Tony
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.5
    • /
    • pp.125-133
    • /
    • 2016
  • Data processing capacity and speed are rapidly increasing due to the development of hardware and software in recent time. As a result, data usage is geometrically increasing and the amount of data which computers have to process has already exceeded five-thousand transaction per second. That is, the importance of Big Data is due to its 'real-time' and this makes it possible to analyze all the data in order to obtain accurate data at right time under any circumstances. Moreover, there are many researches about this as construction of smart factory with the application of Big Data is expected to have reduction in development, production, and quality management cost. In this paper, system using In-Memory Data Grid for high speed processing is implemented in semiconductor process which numerous data occur and improved performance is proven with experiments. Implemented system is expected to be possible to apply on not only the semiconductor but also any fields using Big Data and further researches will be made for possible application on other fields.

Machine-Learning-Based Link Adaptation for Energy-Efficient MIMO-OFDM Systems (MIMO-OFDM 시스템에서 에너지 효율성을 위한 기계 학습 기반 적응형 전송 기술 및 Feature Space 연구)

  • Oh, Myeung Suk;Kim, Gibum;Park, Hyuncheol
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.27 no.5
    • /
    • pp.407-415
    • /
    • 2016
  • Recent wireless communication trends have emphasized the importance of energy-efficient transmission. In this paper, link adaptation with machine learning mechanism for maximum energy efficiency in multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM) wireless system is considered. For reflecting frequency-selective MIMO-OFDM channels, two-dimensional capacity(2D-CAP) feature space is proposed. In addition, machine-learning-based bit and power adaptation(ML-BPA) algorithm that performs classification-based link adaptation is presented. Simulation results show that 2D-CAP feature space can represent channel conditions accurately and bring noticeable improvement in link adaptation performance. Compared with other feature spaces, including ordered postprocessing signal-to-noise ratio(ordSNR) feature space, 2D-CAP has distinguished advantages in either efficiency performance or computational complexity.

Deinterleaving of Multiple Radar Pulse Sequences Using Genetic Algorithm (유전자 알고리즘을 이용한 다중 레이더 펄스열 분리)

  • 이상열;윤기천
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.98-105
    • /
    • 2003
  • We propose a new technique of deinterleaving multiple radar pulse sequences by means of genetic algorithm for threat identification in electronic warfare(EW) system. The conventional approaches based on histogram or continuous wavelet transform are so deterministic that they are subject to failing in detection of individual signal characteristics under real EW signal environment that suffers frequent signal missing, noise, and counter-EW signal. The proposed algorithm utilizes the probabilistic optimization procedure of genetic algorithm. This method, a time-of-arrival(TOA) only strategy, constructs an initial chromosome set using the difference of TOA. To evaluate the fitness of each gene, the defined pulse phase is considered. Since it is rare to meet with a single radar at a moment in EW field of combat, multiple solutions are to be derived in the final stage. Therefore it is designed to terminate genetic process at the prematured generation followed by a chromosome grouping. Experimental results for simulated and real radar signals show the improved performance in estimating both the number of radar and the pulse repetition interval.

An Enhanced Scheme of Target Coverage Scheduling m Rotatable Directional Sensor Networks (회전 가능한 방향센서네트워크에서 타겟 커버리지 스케줄링 향상 기법)

  • Kim, Chan-Myung;Han, Youn-Hee;Gil, Joon-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8A
    • /
    • pp.691-701
    • /
    • 2011
  • In rotatable directional sensor networks, maximizing network lifetime while covering all the targets and forwarding the sensed data to the sink is a challenge problem. In this paper, we address the Maximum Directional Cover Tree (MDCT) problem of organizing the directional sensors into a group of non-disjoint subsets to extend the network lifetime. Each subset in which the directional sensors cover all the targets and forward the sensed data to the sink is activated at one time. For the MDCT problem, we first present an energy consumption model which mainly takes into account the energy consumption for rotation work. We also develop the Directional Coverage and Connectivity (DCC)-greedy algorithm to solve the MDCT problem. To evaluate the algorithm, we conduct simulations and show that it can extend the network lifetime.