• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.9-10
• /
• 2016

본 논문에서는 멀티 스레드 기반 병렬 프로그램의 동적 분석을 통한 자료경합 탐지를 위해 효율적인 감시 필터링 기술을 제시한다. 제시하는 감시 필터링 기술은 자료경합과 같은 동시성 오류를 탐지하기 위해 프로그램의 수행 중에 발생하는 공유 메모리에 대한 스레드들의 접근 분석 시에 동일한 코드영역을 단순 반복하는 스레드들을 감시대상에서 제외시킴으로써 동적 분석을 위한 추가적인 오버헤드를 최소화한다. 제시하는 필터링 기술을 수행 중 자료경합 탐지 도구에 적용한 실험적 평가를 통해 개선된 수행시간 오버헤드의 제공이 가능함을 보인다.

• Therapeutic Science for Rehabilitation
• /
• v.8 no.2
• /
• pp.67-78
• /
• 2019

Objective : The purpose of this study was to investigate the effect of hand tapping on the accuracy and the fluency of speech production in children with speech sound disorder(SSD) and their typically developing peers(TD). Methods : The study subjects were 15 SSD children and 15 TD children aged 4, 5, and 6 years of age. Subjects were asked to give a picture name without hand tapping in the first experimental condition, and with hand tapping in the second experiment condition. Results : The results showed that hand tapping significantly increased disfluency in TD, whereas in SSD. it did not affect the accuracy or fluency of speech production. In addition, TD demonstrated a significant positive correlation with the changes of accuracy and disfluency due to hand tapping, whereas SSD had no correlation. Conclusion : We discussed the possibility that hand tapping could serve as an obstacle distracting attention from SSD and TD, acting as a motor gesture to facilitate phonological processing when facing the difficulty in lexical retrieval for SSD.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.180-191
• /
• 2008

An Adaptive Random Testing (ART) is one of test case generation algorithms that are designed to detect common failure patterns within input domain. The ART algorithm shows better performance than that of pure Random Testing (RT). Distance-bases ART (D-ART) and Restriction Random Testing (RRT) are well known examples of ART algorithms which are reported to have good performances. But significant drawbacks are observed as quadratic runtime and non-uniform distribution of test case. They are mainly caused by a huge amount of distance computations to generate test case which are distance based method. ART through Iterative Partitioning (IP-ART) significantly reduces the amount of computation of D-ART and RRT with iterative partitioning of input domain. However, non-uniform distribution of test case still exists, which play a role of obstacle to develop a scalable algerian. In this paper we propose a new ART method which mitigates the drawback of IP-ART while achieving improved fault-detection capability. Simulation results show that the proposed one has about 9 percent of improved F-measures with respect to other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1725-1727
• /
• 2015

In this letter, a QR decomposition based sequential BP detection scheme is proposed for MIMO systems. The proposed scheme performs the sequential updates from the observation node having the smallest degree among all the observation nodes. Our simulation results verify that the proposed scheme achieves an improved error performance with a significantly accelerated detection convergence speed compared to the conventional schemes.

• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.217-226
• /
• 2003

Recently Lim has proposed a linear, recursive, unbiased minimum variance filter for a maneuvering target based on the maneuver dynamics modeled as a jump process of Poisson-type. In the proposed filter it was assumed that the state transition parameters of the jump used for target maneuver modeling are a priori known to the filter. However, in most cases they are not known in practice. In this paper, we consider the influence of system (target) modeling error on the performance of the proposed tracking filter arising from the maneuver tracking. For qualitative analysis Monte-Carlo simulations are carried out against employing the maneuver model with different state transition parameters from the actual values.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.36-41
• /
• 2016

LDPC code has beend applied in recent communication standards, such as Wi-Fi, WiGig, 10GBased-T Ethernet as a forward error correction code. However, LDPC code is required a large amount of computational complexity due to large iterations and block lengths for high performances. To solve this problem, various research has been continously performed for reducing computational complexity. In this paper, we propose AFC algorithm to deactive the variable and check node for reduce the computational complexity.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.24 no.5
• /
• pp.569-576
• /
• 2011

In this paper a new analysis procedure for evaluation of progressive collapse resisting capacity of a structure was proposed based on the nonlinear static analysis procedure. The proposed procedure produces analysis results identical to those obtained by the linear static analysis procedure specified in the GSA guidelines without iteration, therefore saving a lot of computation time and excluding the possibility of human errors during the procedure. To verify the validity of the proposed procedure, the two methods were applied to the analysis of a reinforced concrete moment frame and a steel braced frame subjected to loss of a first story column and the results were compared. According to the analysis results, the two methods produce identical results in the prediction of progressive collapse and the hinge formation. As iterative analysis is not required in the proposed method, significant amount of analysis time is saved in the proposed analysis procedure.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.8-15
• /
• 2006

In this paper, we propose the iterative receiver for LDPC-coded OFDMA systems in uplink environments. Applying the Wiener filtering to pilot symbols, an initial channel estimation can be performed effectively. To reduce the complexity of the Wiener filtering, we approximate Wiener filtering coefficients to pre-determined coefficients according to estimated correlation of channel. After an LDPC decoding process, soft symbol derived by extrinsic information of decoder outputs is used to estimate channel. we also derive the error variance of channel estimation and maximum ratio combined results. Using combined results, the channel correlation is re-estimated. Then the proper Wiener filtering coefficients are chosen according to the re-estimated result of the channel correction. Using a computer simulation, we show that the proposed receiver structure has the better performance than the receiver using only pilot symbols.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.625-630
• /
• 2009

Researches of image-based 3D reconstruction have recently produced a number of good results, but they assumed that the accurate foreground to be reconstructed is already extracted from each input image. This paper proposes a novel approach to extract more accurate foregrounds by iteratively performing foreground extraction and 3D reconstruction in a manner similar to an EM algorithm on regions segmented in an initial stage, called segments. Here, the segments should preserve foreground boundaries to compensate for the boundary errors generated by visual hull, simple 3D reconstruction to minimize the computational time, and should also be composed of the small number of sets to minimize the user input. Therefore, we utilize image segmentation using the graph-cuts method, which minimizes energy function composed of data and smoothness terms, and the two methods are iteratively performed until the energy function is optimized. In the experiments, more accurate results of the foreground, especially in boundaries, were obtained, although the proposed method used a simple 3D reconstruction method.

• Korean journal of applied entomology
• /
• v.52 no.2
• /
• pp.85-91
• /
• 2013

A diverse range of taxonomic confusions are brought forth since past taxonomic information including major errors following its initial provision of some uncertain information has repeatedly been applied to Korean Vespidae in its identification. Thus, this study, which made a final summarization of research on Vespidae, provided the list of Korean Vespidae determined except for Eumeninae, with their distributional data. A total of 30 species (including 3 subspecies) belonging to 5 genera of 2 subfamilies are listed: subfamily Vespinae (3 genera/ 18 species) and subfamily Polistinae (2 genera/ 12 species).