• 대한기계학회논문집B
• /
• 제22권6호
• /
• pp.874-887
• /
• 1998

A 2-frame PTV (particle tracking velocimetry) system using the concept of match probability between two consequent image frames has been developed to obtain instantaneous velocity fields. The overall 2-frame PTV system including image pre-processing, tracking algorithm and post-processing routine was implemented to apply to real flows. The developed 2-frame PTV system has several advantages such as high recovery ratio of velocity vectors, low error ratio and small computational time compared with the conventional 4-frame PTV and the FFT-based cross-correlation PIV technique. The 2-frame PTV system was applied to a turbulent channel flow over a rectangular block to check its reliability and usefulness. Total 96 sequential image frames have been captured and processed to get both mean and fluctuating velocity vector fields over the recirculating region. The mean velocity and turbulent intensity profiles were well agreed with hte LDV measurements in the separated region behind the block. Time-averaged reattachment length is about 6.3 times of the block height.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.360-369
• /
• 2017

In this paper, a new iterative algorithm for reconstructing block sparse signals, called block backtracking-based adaptive orthogonal matching pursuit (BBAOMP) method, is proposed. Compared with existing methods, the BBAOMP method can bring some flexibility between computational complexity and reconstruction property by using the backtracking step. Another outstanding advantage of BBAOMP algorithm is that it can be done without another information of signal sparsity. Several experiments illustrate that the BBAOMP algorithm occupies certain superiority in terms of probability of exact reconstruction and running time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1077-1080
• /
• 1987

Images are 2-dimensional projection of 3-dimensional scenes and many problems of scene analysis arise due to inherent depth ambiguities in a monocular 2-D image. Therefore, depth recovery is a crucial problem in image understanding. This paper proposes modified algorithm which is focused on accurate correspondnce in stereo vision. The feature we use is zero-crossing points and the similarity measure with two property evaluation function is used to estimate initial probability. And we introduce relaxation technique for accurate and global correspondence.

• Journal of Ship and Ocean Technology
• /
• 제8권2호
• /
• pp.20-28
• /
• 2004

A dynamic-thermodynamic sea ice model with 50-km spatial and 24-hour temporal resolution is used to investigate the spatial and long-term temporal variability of the sea ice cover the Arctic Basin. The model satisfactorily reproduces the averaged main characteristics of the sea ice and the sea ice extent in the Arctic Basin and its decrease in early 1990th. At times model allows to suppose partial recovery of sea ice cover in the last years of twenty century. The employment of explicit form for description of ridging gives opportunity to assume that the observed thinning is the result of reduction the intensity of ridging processes and to estimate long-term variability of probability the ridge free navigation in the different parts of the Arctic Ocean including the North Sea Route area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5290-5304
• /
• 2016

With the growth of the massive amount of data, the failure probability of the cloud storage node is becoming more and more big. A single fault tolerance strategy, such as replication and erasure codes, has some unavoidable disadvantages, which can not meet the needs of the today's fault tolerance. Therefore, according to the file access frequency and size, an adaptive hybrid redundant fault tolerance strategy is proposed, which can dynamically change between the replication scheme and erasure codes scheme throughout the lifecycle. The experimental results show that the proposed scheme can not only save the storage space(reduced by 32% compared with replication), but also ensure the fast recovery of the node failures(increased by 42% compared with erasure codes).

• 정보보호학회논문지
• /
• 제11권2호
• /
• pp.59-65
• /
• 2001

비동기식(W-CDMA) 3세대 이동통신의 3GPP에서는 무선 구간의 메시지 무결성을 보장하기 위하여 블록 암호 KASUMI에 기반한 CBC-MAC의 변형된 형태를 제안하고 있다. 본 논문에서는 최근 발표된 Knudsen-Mitchell의 공격법 을 심층 분석하여 구체적인 공격 수행 알고리즘을 제안하고, 이 알고리즘의 성공 확률 및 수행 복잡도를 계산한다. 또 한, 3GPP-MAC에 대한 안전성을 기존 CBC-MAC 방식과 비교하여 분석한다

• 한국정보기술학회 영문논문지
• /
• 제10권2호
• /
• pp.83-90
• /
• 2020

A protocol HMNR, was proposed to utilize control information of every other process piggybacked on each sent message for minimizing the number of forced checkpoints. Then, an improved protocol, called Lazy-HMNR, was presented to lower the possibility of taking forced checkpoints incurred by the asymmetry between checkpointing frequencies of processes. Despite these two different minimization techniques, if the high message interaction traffic occurs, Lazy-HMNR may considerably lower the probability of knowing whether there occurs no Z-cycle due to its shortcomings. Also, we recognize that no previous work has smart procedures to be able to utilize network infrastructures for highly decreasing the number of forced checkpoints with dependency information carried on every application message. We introduce a novel Lazy-HMNR protocol for group communication-based distributed computing systems to cut back the number of forced checkpoints in a more effective manner. Our simulation outcomes showed that the proposed protocol may highly lessen the frequency of forced checkpoints by comparison to Lazy-HMNR.

• 한국산학기술학회논문지
• /
• 제20권6호
• /
• pp.410-420
• /
• 2019

본 연구는 수면 대장내시경 검진자에게 복부마사지를 시행하여 장운동 회복과 복부팽만감에 미치는 효과를 파악하기 위하여 시도된 비동등성 대조군 전후 시차설계연구이다. 연구대상자는 C시, G병원에서 외래를 통해 수면 대장내시경 검진을 받는 실험군 22명, 대조군 22명으로 자료 수집 기간은 2018년 6월 1일부터 8월 25일까지였으며, 실험의 확산효과를 막기 위하여 대조군을 먼저 자료수집 한 후 시차를 두고 실험을 실시하였다. 자료분석은 IBM SPSS 24.0을 이용하여 자료를 분석하였으며, 대상자의 일반적 특성의 동질성을 검증하기 위하여 독립표본 t-test, $x^2-test$ 와 Fisher's exact probability test, 실험군, 대조군의 복부둘레 변화량에 대한 정규성을 검증하기 위하여 Shapiro-Wilk로 검증, 복부둘레의 사전 동질성을 검증하기 위하여 Mann-Whitney U test를 실시하였다. 실험처치 효과 검증은 Fisher's exact probability test, Friedman test와 Mann-Whitney U test로 검증하였다. 연구 결과, 복부마사지가 대장내시경 검진자의 가스배출 시간($x^2=19.75$, p<.001)과 복부팽만감($x^2=29.93$, p<.001)을 감소시켜, 수면 대장내시경 검진자의 가스팽만으로 인한 불편감을 완화하는 간호중재로 활용할 수 있을 것으로 생각된다.

• 한국전자통신학회논문지
• /
• 제10권5호
• /
• pp.565-570
• /
• 2015

확산 스펙트럼 통신은 낮은 도청확률과 작은 잡음 채널의 영향 때문에 많은 시스템에서 사용이 증가하고 있다. 기존의 디지털 확산 스펙트럼 시스템의 한계 중 하나는 동기 코드 확산에 대한 필요성이다. 카오스 통신 시스템은 동기 없이 구현 할 수 있고 보안성도 우수하며 간단한 송수신기 구조로 디지털 확산 스펙트럼 통신에 많이 사용하고 있다. 본 논문에서는 카오스 신호를 디지털 통신시스템에 사용하기 위해 디지털 변복조의 반송파 대신 사용하였으며 여러 가지의 카오스 변조 방식들 중에서 차동 CSK(Differential Chaos Shift Keying) 사용한다. DCSK 복조기는 카오스 신호 위상을 복구 할 필요 없이 데이터를 감지하기 때문에 효율적이다. 또한 Matlab/Simulink를 이용하여 DCSK 변조기 및 복조기의 설계하고 성능을 분석하고 송신신호의 수신 신호를 비교하여 송수신 신호가 같은 것을 확인하고 확산 인자에 따른 BER의 성능을 평가한다.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.