• Title/Summary/Keyword: 오류 공유

Search Result 182, Processing Time 0.023 seconds

OKMS: Ontology-based Knowledge Management System (온톨로지 기반설계 문서관리 시스템 설계 및 구현)

  • 이정원;방건동;박세형;백두권
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.79-81
    • /
    • 2001
  • 다품종 소량 생산은 제품개발의 사이클을 단축시켰다. 그 결과 생산기술의 축적에 의존한 제품경쟁력은 그 한계에 이르렀다. 결국 경쟁력 있는 제품생산을 위한 핵심적 전략은 제품개발기간 단축에 있다. 제품 개발기간에 가장 큰 영향을 미치는 요인 중에 설계 오류는 약 50%가 반복적으로 발생한다. 이는 제품 개발 노하우의 체계적 관리가 미비학, 숙련된 설계자가 보유한 제품개발지식의 공유가 잘 이루어지지 않기 때문에 나타나는 현상이다. 비록 설계 지식의 공유를 지원하는 시스템을 갖추었어도, 단순히 설계지식을 저장해놓은 경유에, 설계자가 키워드를 통하여 검색을 하게 되면, 원하지 않는 결과 까지 제공되어, 시스템의 사용이 저조해진다. 본 논문에서는 이 문제를 해결하기 위해, IKMS라는 시스템을 개발하였다. 이 시스템의 설계문서를 XML 형태로 저장, 다양한 문서가공이 가능하게 하였고, 온톨로지를 이용하여 지식 체계를 구성하였다. 이 시스템은 설계자가 온톨로지로 구성된 지식 체계를 통하여, 설계 지식을 공유하였고, 개발중인 제품에 대한 기술적 지식을 가지고 검색하게 함으로서 필요 없는 검색 결과를 최소화 하여, 이용하는 설계자의 일의 로드를 줄이고자 하였다.

  • PDF

Recovery Method Using Extendable Hashing Based Log in A Shared-Nothing Spatial Database Cluster (비공유 공간 데이터베이스 클러스터에서 확장성 해싱 기반의 로그를 이용한 회복 기법)

  • 장일국;장용일;박순영;배해영
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2004.03a
    • /
    • pp.7-10
    • /
    • 2004
  • 회복기법은 비공유 공간 데이터베이스 클러스터에서 고가용성을 위해 매우 중요하게 고려되고 있다. 일반적으로 데이터베이스 클러스터의 회복기법은 노드의 오류가 발생한 경우 로컬 로그와는 별도로 클러스터 로그를 생성하며, 이를 기반으로 해당 노드에서의 회복과정을 수행한다. 그러나, 기존의 기법은 하나의 레코드를 위해 다수의 갱신정보를 유지함으로써 클러스터 로그의 크기가 증가되고, 전송비용이 증가된다. 이는 회복노드에서 하나의 레코드에 대해 털러 번의 불필요한 연산을 실행하여 회복시간이 증가되고, 전체적인 시스템의 부하를 증가시키는 문제를 발생시킨다. 본 논문에서는 비공유 공간 데이터베이스 클러스터에서 확장성 해싱 기반의 로그를 이용한 회복기법을 제안한다. 제안기법에서의 클러스터 로그는 레코드 키값을 이용한 확장성 해싱을 기반으로 레코드의 변경사항과 실제 데이터를 가리키는 포인터 정보로 구성된다. 확장성 해싱 기반의 클러스터 로그는 크기와 전송비용이 감소하며, 회복노드는 하나의 레코드에 대해 한번의 갱신연산만 실행하므로 빠른 회복이 가능하다. 따라서 제안 기법은 확장성 해싱 기반의 클러스터 로그를 이용하여 효율적인 회복처리를 수행하며, 시스템의 가용성을 향상시킨다.

  • PDF

Recovery Management of Split-Brain Group in Highly Available Cluster file System $\textrm{SANique}^{TM}$ (고가용성 클러스터 파일 시스템 $\textrm{SANique}^{TM}$의 분할그룹 탐지 및 회복 기법)

  • 이규웅
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.505-517
    • /
    • 2004
  • This paper overviews the design details of the cluster file system $\textrm{SANique}^{TM}$ on the SAN environment. $\textrm{SANique}^{TM}$ has the capability of transferring user data from shared SAN disk to client application without control of centralized file server. We, especially, focus on the characteristics and functions of recovery manager CRM of $\textrm{SANique}^{TM}$. The process component for failure detection and its overall procedure are described. We define the split-brain problem that cannot be easily detected in cluster file systems and also propose the recovery management method based on SAN disk in order to detect and solve the split-brain situation.

  • PDF

Error Control Protocol and Data Encryption Mechanism in the One-Way Network (일방향 전송 네트워크에서의 오류 제어 프로토콜 및 데이터 암호화 메커니즘)

  • Ha, Jaecheol;Kim, Kihyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.3
    • /
    • pp.613-621
    • /
    • 2016
  • Since the error control problem is a critical and sensitive issue in the one-way network, we can adopt a forward error correction code method or data retransmission method based on the response of reception result. In this paper, we propose error control method and continuous data transmission protocol in the one-way network which has unidirectional data transmission channel and special channel to receive only the response of reception result. Furthermore we present data encryption and key update mechanism which is based on the pre-shared key distribution scheme and suggest some ASDU(Application Service Data Unit) formats to implement it in the one-way network.

Late Comer and Error Recovery Process for Home Network Environment with Session Management (세션 관리 기능을 포함한 홈 네트워크 환경에서의 지각자 및 오류 복구 처리)

  • Kim, Hak-Joon;Ko, Eung-Nam
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.666-672
    • /
    • 2008
  • This paper explains late comer and error recovery process for home network environment with session management. This system consists of an ED, ES, and ER. ED is an agent that detects an error by hooking techniques for multimedia distance education based on home network environment with session management. ES is an agent that is an error sharing system for multimedia distance education based on home network environment with session management. ER is a system that is suitable for recovering software error for multimedia distance education based on home network environment with session management. This paper explains a performance analysis of an error recovery system running on distributed multimedia environment using the rule-based DEVS modeling and simulation techniques. The proposed method is more efficient than the other method in comparison with error ration and processing time.

  • PDF

Detecting the First Race in OpenMP Program with Nested Parallelism (내포 병렬성을 가지는 OpenMP 프로그램의 최초 경합 탐지)

  • Chon, Byoung-Gyu;Woo, Jong-Jung;Jun, Yong-Kee
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.253-260
    • /
    • 2001
  • It is important to detect races for debugging shared-memoy parallel programs, because the races cause unintended nondeterministic program execution. Previous on-the-fly techniques to detect races can not guarantee the first race detection in nested parallel programs. Detecting the first race is important for debugging parallel programs, since the removal of the first race may make the next occurred races disappear. In this paper, we presents an on-the-fly detection technique to detect all of the first races through the reexecution of the debugged programs. We assume that the debugged parallel program may have one-way nested parallel programs. The number of reexecution is at the least the nesting depth of the program in the worst case. The space complexity is O(VT) and the time complexity to detect race in each access of access history is O(T), where V is number of shared variables and T is the maximum parallelism of the program. This efficiency of our technique in each execution is the same with the previous on-the-fly detection techniques. Therefore, this technique makes debugging parallel programs more effective and practical.

  • PDF

Decision Tree State Tying Modeling Using Parameter Estimation of Bayesian Method (Bayesian 기법의 모수 추정을 이용한 결정트리 상태 공유 모델링)

  • Oh, SangYeob
    • Journal of Digital Convergence
    • /
    • v.13 no.1
    • /
    • pp.243-248
    • /
    • 2015
  • Recognition model is not defined when you configure a model, Been added to the model after model building awareness, Model a model of the clustering due to lack of recognition models are generated by modeling is causes the degradation of the recognition rate. In order to improve decision tree state tying modeling using parameter estimation of Bayesian method. The parameter estimation method is proposed Bayesian method to navigate through the model from the results of the decision tree based on the tying state according to the maximum probability method to determine the recognition model. According to our experiments on the simulation data generated by adding noise to clean speech, the proposed clustering method error rate reduction of 1.29% compared with baseline model, which is slightly better performance than the existing approach.

A Study on Human Error Assesment in Gas Industies (가스산업시설에서 인적 오류 평가 방법에 관한 연구)

  • Park Myung Seop;Kim Sung Bin;Ko Jae Wook
    • Journal of the Korean Institute of Gas
    • /
    • v.4 no.2 s.10
    • /
    • pp.52-57
    • /
    • 2000
  • This paper suggests the evaluation sheet to ensure the objective and detailed information based on a classification table of PIF (Performance Influencing Factor). And this paper shows the results of HEP(Human Error Probability), using a quantitative method with the evaluated data as a result of estimating the likelihood of . human errors in the gas industry facility together with the evaluation sheet. Finally, these results are programmed to be operated in personal computer so that field workers an apply it in easy and convenient manner. The results of this study offer two key benefits; sharing reliable information on human errors with the Data Base and establishing a strategy to reduce human errors as well as to improve working proficiency.

  • PDF

New QECCs for Multiple Flip Error Correction (다중플립 오류정정을 위한 새로운 QECCs)

  • Park, Dong-Young;Kim, Baek-Ki
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.907-916
    • /
    • 2019
  • In this paper, we propose a new five-qubit multiple bit flip code that can completely protect the target qubit from all multiple bit flip errors using only CNOT gates. The proposed multiple bit flip codes can be easily extended to multiple phase flip codes by embedding Hadamard gate pairs in the root error section as in conventional single bit flip code. The multiple bit flip code and multiple phase flip code in this paper share the state vector error information by four auxiliary qubits. These four-qubit state vectors reflect the characteristic that all the multiple flip errors with Pauli X and Z corrections commonly include a specific root error. Using this feature, this paper shows that low-cost implementation is possible despite the QECC design for multiple-flip error correction by batch processing the detection and correction of Pauli X and Z root errors with only three CNOT gates. The five-qubit multiple bit flip code and multiple phase flip code proposed in this paper have 100% error correction rate and 50% error discrimination rate. All QECCs presented in this paper were verified using QCAD simulator.

An Automatic Repeating Protocol in Cooperative Spectrum Sharing (협력적 스펙트럼 공유의 자동 반복 프로토콜)

  • Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.6
    • /
    • pp.101-108
    • /
    • 2013
  • In this paper, we propose a method in which the negative acknowledge (NACK) message is used as command for cooperation and spectrum sharing. This allows for an automatic request for cooperation and sharing when the direct link of the primary user is in outage, and also allows for saving the number of control messages in cooperation-spectrum sharing based paradigm. In the sharing phase, the selected relay shares a power fraction of $1-{\alpha}$ for secondary transmitted signal while the remaining of ${\alpha}$ is for primary retransmitted signal. In the case of no relay collected, primary transmitter uses NACK as a command to retransmit the signal with fully power fraction (${\alpha}=1$). Both systems are assumed to employ BPSK signals. In this scheme, we propose the joint optimal decoding in the secondary user. The frame error rate (FER) performance at both systems is then analyzed. The theoretical and simulation results validate the analysis and confirm the efficiency of the protocol.