• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.11-21
• /
• 2011

An embedded sensor is significantly influenced by its spatial environment, such as barriers or distance, through low power and signal strength. Due to these causes, noise data frequently occur in an embedded sensor. Because the information acquired from the embedded sensor exists in a time series, it is hard to detect an error which continuously takes place in the time series information on a realtime basis. In this paper, we proposes an error detection method based on time-series prediction that detects error signals of embedded sensors in real time in consideration of the physical characteristics of embedded devices. The error detection method based on time-series prediction proposed in this paper determines errors in generated embedded device signals using a stable distance function. When detecting errors by monitoring signals from an embedded device, the stable distance function can detect error signals effectively by applying error weight to the latest signals. When detecting errors by monitoring signals from an embedded device, the stable distance function can detect error signals effectively by applying error weight to the latest signals.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.187-190
• /
• 2002

본 논문은 다중 특징을 포함한 대표 키 프레임을 추출을 통해 장면 전환 검출 시 발생할 수 있는 검출 오류를 자동으로 인식하고 수정함으로써 빠르고 신뢰성 있는 장면 분할을 수행하는 새로운 기법을 제안한다. 이를 위해 개선된 고속 장면 전환 검출 기법에 의해 샷을 분할 하고 분할 된 샷으로부터 대표 키 프레임과 그것에 포함된 후보 키 프레임들의 다중 정보를 포함시킴으로써 샷의 전반에 대한 정보를 보다 잘 표현할 수 있도록 한다. 그리고 다중정보를 포함한 대표 키 프레임의 비교를 통해 샷 검출 오류를 자동으로 인식하여 적절히 수정할 수 있는 기법을 제안하며 실세계 동영상 데이터를 사용한 실험을 통해서 제안하는 기법에 의해 효율적으로 샷이 분할 될 수 있음을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.535-537
• /
• 2005

디지털 신호 및 전송부호의 오류검출에는 예전부터 패리티 체크가 사용되어 왔다. 그러나 패리티 체크 기법은 구현 및 알고리즘이 단순, 간결한 우수성이 있지만 특정 데이터 비트의 경우 오류 검출이 불가능하다는 문제점을 가지고 있다. 이후 패리티 체크 기법은 해밍 코드 및 채널 오류 정정을 위한 LDPC 코드와 같은 다양한 오류검출 및 정정 알고리즘에 적용되어 발전되어 왔으며, 그 중 LDPC 코드의 bit-flipping 알고리즘에서는 패리티 기법을 반복적으로 적용하는 방식을 택하고 있다. 본 논문에서는 이러한 채널 오류 정정을 위한 LDPC의 bit-flipping 알고리즘을 이차원 코드에 적용하고, 이 때 bit-flipping 알고리즘이 가지고 있는 문제점을 보완할 수 있는 개선된 LDPC 코드를 제안한다.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.675-688
• /
• 2007

Memory access errors are frequently occurred in C programs. A number of tools and research works have been trying to detect the errors automatically. However, they have one or more of the following problems: inability to detect all memory errors, changing the memory allocation mechanism, incompatibility with libraries, and excessive performance overhead. In this paper, we suggest a new method to solve these problems, and then present a result of comparison to the previous research works through the experiments. Our approach consists of two phases. First is to transform source code at compile time through inserting instrumentation into the source code. And second is to detect memory errors at run time with a bitmap that maintains information about memory allocation. Our approach has improved the error detection abilities against the binary code analysis based ones by using the source code analysis technique, and enhanced performance in terms of both space and time, too. In addition, our approach has no problem with respect to compatibility with shared libraries as well as does not need to modify memory allocation mechanism.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.61-68
• /
• 2011

Memory error debugging is one of the most critical processes in improving software quality. However, due to the extensive time consumed to debug, the enhancement often leads to a huge bottle neck in the development process of mobile devices. Most of the existing memory error detection tools are based on static error detection; however, the tools cannot be used in mobile devices due to their use of large working memory. Therefore, it is challenging for mobile device vendors to deliver high quality mobile devices to the market in time. In this paper, we introduce "PinMemcheck", a pin-based memory error detection tool, which detects all potential memory errors within $1.5{\times}$ execution time overhead compared with that of a baseline configuration by applying the Pin's binary instrumentation process and a simple data structure.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.9
• /
• pp.419-428
• /
• 2017

In an embedded system, modules exchange data by interacting among themselves. Exchanging erroneous resource data among modules may lead to execution errors. The interacting resources produce dependencies between the two modules where any change of the resources by one module affects the functionality of another module. Several investigations of the embedded systems show that interaction faults between the modules are one of the major cause of critical software failure. Therefore, interaction testing is an essential phase for reducing the interaction faults and minimizing the risk. The direct and indirect interactions between the modules generate interaction faults. The direct interaction is the explicit call relation between the modules, and the indirect interaction is the remaining relation that is made underneath the interface that possesses data dependence relationship with resources. In this paper, we investigate the errors that are based on the indirect interaction between modules and introduce a new test criterion for identifying the errors that are undetectable by existing approaches at the integration level. We propose a novel approach for generating the interaction model using the indirect interaction pattern and design test criteria that are based on different interaction errors to generate test cases. Finally, we use the fault injection technique to evaluate the feasibility and effectiveness of our approach.

• Journal of Convergence for Information Technology
• /
• v.12 no.1
• /
• pp.31-38
• /
• 2022

This paper applies an expert independent unsupervised neural network learning-based multivariate time series data analysis model, MSCRED(Multi-Scale Convolutional Recurrent Encoder-Decoder), and to overcome the limitation, because the MCRED is based on Auto-encoder model, that train data must not to be contaminated, by using learning data sampling technique, called Subset Sampling Validation. By using the vibration data of power plant equipment that has been labeled, the classification performance of MSCRED is evaluated with the Anomaly Score in many cases, 1) the abnormal data is mixed with the training data 2) when the abnormal data is removed from the training data in case 1. Through this, this paper presents an expert-independent anomaly diagnosis framework that is strong against error data, and presents a concise and accurate solution in various fields of multivariate time series data.

• 한국어정보학회:학술대회논문집
• /
• 2016.10a
• /
• pp.165-170
• /
• 2016

본 논문에서 제안하는 문맥의존 철자오류 교정은 통계 정보를 이용한 방법으로 통계적 언어처리에서 가장 널리 쓰이는 샤논(Shannon)이 발표한 노이지 채널 모형(noisy channel model)을 기반으로 한다. 선행연구에서 부족하였던 부분의 성능 향상을 위해 교정대상단어의 오류생성 및 통계 데이터의 저장 방식을 개선하여 Default 연산을 적용한 모델을 제안한다. 선행 연구의 모델은 교정대상단어의 오류생성 시 편집거리의 제약을 1로 하여 교정 실험을 하지만 제안한 모델은 같은 환경에서 더욱 높은 검출과 정확도를 보였으며, 오류단어의 편집거리(edit distance) 제약을 넓게 적용하더라도 신뢰도가 있는 검출과 교정을 보였다.

• Annual Conference on Human and Language Technology
• /
• 2016.10a
• /
• pp.165-170
• /
• 2016

본 논문에서 제안하는 문맥의존 철자오류 교정은 통계 정보를 이용한 방법으로 통계적 언어처리에서 가장 널리 쓰이는 샤논(Shannon)이 발표한 노이지 채널 모형(noisy channel model)을 기반으로 한다. 선행연구에서 부족하였던 부분의 성능 향상을 위해 교정대상단어의 오류생성 및 통계 데이터의 저장 방식을 개선하여 Default 연산을 적용한 모델을 제안한다. 선행 연구의 모델은 교정대상단어의 오류생성 시 편집거리의 제약을 1로 하여 교정 실험을 하지만 제안한 모델은 같은 환경에서 더욱 높은 검출과 정확도를 보였으며, 오류단어의 편집거리(edit distance) 제약을 넓게 적용하더라도 신뢰도가 있는 검출과 교정을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.535-544
• /
• 2012

Multi-Input Multi-Output (MIMO) transmission is now considered as one of essential techniques enabling high rate data transmissions in wireless communication systems. In addition, severe channel impairments in wireless systems should be compensated by using highly efficient forward error correction (FEC) codes. Turbo codes or low density parity check (LDPC) codes, using iterative decoding with soft decision detection information (SDDI), are the most common examples. The excellent performance of these codes should be conditioned on accurate estimation of SDDI from the MIMO detection process. In this paper, we propose a soft MIMO detection scheme using QR decomposition of channel matrices as an efficient means to provide accurate SDDI to the iterative decoder. The proposed method employed a two sequential soft MIMO detection process in order to reduce computational complexity. Compared to the soft ZF method calculating the direct inverse of the channel matrix, the complexity of the proposed method can be further reduced as the number of antennas is increased, without any performance degradation.