• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.9-17
• /
• 1999

In this paper, we present a mathematical modeling and perform a performance analysis of double-dwell serial search algorithm, which has a search window concept, for pilot channel in DS-CDMA(Direct Sequence Code Division Multiple Access). We derive a code detection function, a false alarm function, a code miss function, and a mean code acquisition time for the performance analysis. We calculate the mean code acquisition time of the mathematical model in IS-95 forward link and compare it with that of the conventional search methods. The performance of the code acquisition system is also evaluated to investigate the effect of dwell times and search window size. The JTC channel model, which is a PCS channel model in North America, is used for the analysis. The numerical result shows that the mean code acquisition time of the double-dwell serial search algorithm with a search window is reduced by about 17%~25% than those of the conventional ones.

• Journal of Korea Water Resources Association
• /
• v.32 no.6
• /
• pp.731-740
• /
• 1999

Autocorrelation function is widely used as a tool measuring linear dependence of hydrologic time series. However, it may not be appropriate for choosing decorrelation time or delay time ${\tau}_d$ which is essential in nonlinear dynamics domain and the mutual information have recommended for measuring nonlinear dependence of time series. Furthermore, some researchers have suggested that one should not choose a fixed delay time ${\tau}_d$ but, rather, one should choose an appropriate value for the delay time window ${\tau}_d={\tau}(m-1)$, which is the total time spanned by the components of each embedded point for the analysis of chaotic dynamics. Unfortunately, the delay time window cannot be estimated using the autocorrelation function or the mutual information. Basically, the delay time window is the optimal time for independence of time series and the delay time is the first locally optimal time. In this study, we estimate general dependence of hydrologic time series using the C-C method which can estimate both the delay time and the delay time window and the results may give us whether hydrologic time series depends on its linear or nonlinear characteristics which are very important for modeling and forecasting of underlying system.

• Proceedings of the Korean Institute of Industrial Safety Conference
• /
• 1998.05a
• /
• pp.101-106
• /
• 1998

현대사회가 급속한 발전을 이룩하면서 화재의 발생은 증가추세에 있다. 화재의 예방과 진압장비의 개발을 위해서는 실내화재현상에 대한 연구와 이해가 필요하다. 대부분의 실내화재 관련 현상에 대하여서는 많은 연구가 이루어졌고, 이러한 연구를 바탕으로 컴퓨터 시뮬레이션과 같은 화재 현상의 예측기법을 발전 시켜왔으며, 거의 실제에 가깝게 발전하고 있으나, 아직까지도 규명이 확연히 되지 않고 있는 부분은 창유리의 파괴현상이다. 본 연구는 구획화재시 창유리의 파괴현상을 실제에 근접한 시나리오를 설정한 후 실험을 통해 고찰하고자한다. 또한 파괴시간 예측 프로그램인 BREAKl의 분석 결과와 실험치의 비교도 아울러 실시하여 그 적용성을 판단해보자 한다. (중략)

• Journal of the Korean Society for Nondestructive Testing
• /
• v.35 no.4
• /
• pp.251-257
• /
• 2015

In ultrasonic nonlinear parameter measurement using the fast Fourier transform(FFT) of tone-burst signals, the side lobe and leakage on spectrum because of finite time and non-periodicity of signals makes it difficult to measure the harmonic magnitudes accurately. The window function made it possible to resolve this problem. In this study, the effect of the Hanning and Turkey window functions on the experimental measurement of nonlinear parameters was analyzed. In addition, the effect of changes in tone burst signal number with changes in the window function on the experimental measurement was analyzed. The result for both window functions were similar and showed that they enabled reliable nonlinear parameter measurement. However, in order to restore original signal amplitude, the amplitude compensation coefficient should be considered for each window function. On a separate note, the larger number of tone bursts was advantageous for stable nonlinear parameter measurement, but this effect was more advantageous in the case of the Hanning window than the Tukey window.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.963-971
• /
• 2016

This paper is a research of gaze analysis for measuring task switching behavior at multiple windows in GUI of windowing system. Previous methods that define area of interest for categorizing gaze had difficulties to define dynamic content that disappears or changes over time. On the other hand, this study suggests a new method to categorize gaze that defines Area of interest in a unit of window during the eye tracking experiment. In this paper, we constructed the conception of WOI(Window of Interest) in GUI of windowing system. Therefore, we developed a system using an eye tracker device and implemented a number of experiments. In addition, we analyzed the number of task switching and proportion of watched content. The method in the study comprehend from previous researches as it can measure and analyze the multi-tasking behaviors using multiple numbers of windows.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.229-234
• /
• 2007

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time. which is uniformly selected from the Contention Window (CW) This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.94-96
• /
• 2021

In this paper, we develop a new navigation algorithm for industrial mobile robots to arrive at the destination in unknown environment. To achieve this, we suggest a navigation algorithm that combines Dynamic Window Approach (DWA) and Dijkstra path planning algorithm. We compare Local Dynamic Window Approach (LDWA), Global Dynamic Window Approach(GDWA), Rapidly-exploring Random Tree (RRT) Algorithm. The navigation algorithm using Dijkstra algorithm combined with LDWA and GDWA makes mobile robots to reach the destination. and obstacles faced during the path planning process of LDWA and GDWA. Then, we compare on time taken to arrive at the destination, obstacle avoidance and computation complexity of each algorithm. To overcome the limitation, we seek ways to use the optimized navigation algorithm for industrial use.

• Journal of Convergence for Information Technology
• /
• v.9 no.8
• /
• pp.205-213
• /
• 2019

The purpose of this study was to investigate the perception and needs on development of lecture to promote creative personality of pre-service teachers. The subjects were 161 students in 4th grade in early childhood education department. The questionnaire was composed of 3 items of 'recognition of creativity personality lecture' and 7 items of 'demand of development for creativity personality lecture'. The data was analyzed frequency and percentage by descriptive statistics. In the results, first, most of pre-service teachers recognized the importance on development of creativity personality lecture, and support of 'development and application of creativity personality lecture'. They recognized that creativity personality lecture was effective. Second, more than half of them responded that they would take creativity personality lecture, and this lecture was most appropriate 2 courses and 3 hours 10 weeks per semester. They demanded a lot of propensity element among creativity education elements, convergence classes in various fields, teaching medium for 'movie and music', and 'portfolio evaluation'.

• Korean Journal of Remote Sensing
• /
• v.22 no.6
• /
• pp.601-612
• /
• 2006

This study proposes RAG (Region Adjancency Graph)-based image segmentation for large imagery in remote sensing. The proposed algorithm uses CN-chain linking for computational efficiency and multi-window operation of sliding structure for memory efficiency. Region-merging due to RAG is a process to find an edge of the best merge and update the graph according to the merge. The CN-chain linking constructs a chain of the closest neighbors and finds the edge for merging two adjacent regions. It makes the computation time increase as much as an exact multiple in the increasement of image size. An RNV (Regional Neighbor Vector) is used to update the RAG according to the change in image configuration due to merging at each step. The analysis of large images requires an enormous amount of computational memory. The proposed sliding multi-window operation with horizontal structure considerably the memory capacity required for the analysis and then make it possible to apply the RAG-based segmentation for very large images. In this study, the proposed algorithm has been extensively evaluated using simulated images and the results have shown its potentiality for the application of remotely-sensed imagery.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.189-194
• /
• 2007

This paper derives and computes the detection probability of timing synchronization in an orthogonal frequency division multiplexing (OFDM) system encountered with a multipath Rayleigh fading channel and imperfect noise estimation. The timing synchronization scheme using a simple repeated constant amplitude zero auto-correlation (CAZAC) training symbol and correlation techniques is adopted. With this provision, we focus on the numerical analysis for OFDM timing synchronization scheme employing a preadvancement technique to reduce the inter-symbol interference (ISI). For measuring system performance, the detection performance derived in the considered system is presented in a multipath Rayleigh fading channel.