• Journal of KIISE:Software and Applications
• /
• v.35 no.5
• /
• pp.297-305
• /
• 2008

We present a cleaning robot algorithm that can be implemented on low-cost robot architecture while the cleaning performance far exceeds the conventional random style cleaning through human-robot interaction. We clarify the advantages and disadvantages of the two notable cleaning robot styles: the random and the mapping styles, and show the possibility how we can achieve the performance of the complicated mapping style under the random style-like robot architecture using the idea of human-aided cleaning algorithm. Experimental results are presented to show the performance.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.333-341
• /
• 2006

Recently, Random Constant worm is increasing The worm retards the availability of the overall network by exhausting resources such as CPU resource and network bandwidth, and damages to an uninfected system as well as an infected system. This paper analyzes the Power-Law network which possesses the preferential characteristics to restrain the worm from spreading. Moreover, this paper suggests the model which dynamically controls the spread of the worm using information about depth distribution of the delivery node which can be seen commonly in such network. It has also verified that the load for each node was minimized at the optimal depth to effectively restrain the spread of the worm by a simulation.

• Journal of Advanced Navigation Technology
• /
• v.19 no.4
• /
• pp.323-329
• /
• 2015

The compensation characteristics of the distorted WDM channels compensated for by dispersion management (DM) and optical phase conjugation in the long-haul ($50\;fiber\;spans{\times}80km$) transmission link with the randomly distributed single mode fiber (SMF) length and residual dispersion per spans (RDPS) for implementing of the flexible link configuration are investigated. It is confirmed that the compensation effect in the link with the randomly distributed SMF length and RDPS is similar with that in the link with the uniform distribution, when the launch power of WDM channels are restricted within 0 dBm. This result means that the proposed link configuration is useful for designing and deploying the long-haul WDM transmission link.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.861-868
• /
• 2001

In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.343-347
• /
• 2012

Non-linear equalization techniques using decision feedback structure are highly demanded for cancellation of intersymbol interferences occurred in severe channel environments. In this paper decision feedback structure is applied to the linear blind equalizer algorithm that is based on information theoretic learning and a randomly generated symbol set. At the decision feedback equalizer (DFE) the random symbols are generated to have the same probability density function (PDF) as that of the transmitted symbols. By minimizing difference between the PDF of blind DFE output and that of randomly generated symbols, the proposed DFE algorithm produces equalized output signal. From the simulation results, the proposed method has shown enhanced convergence and error performance compared to its linear counterpart.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.659-665
• /
• 2008

If ranging processes are not frequent in an uplink OFDMA system, the timing synchronization between base and mobile stations may not be maintained. Especially in the case of infrequent random accesses in a large cell, timing offsets can be considerable and the destroyed orthogonality of OFDMA signals may result in the degraded performance. This paper proposes a novel random access scheme for uplink OFDMA systems, which support the orthogonality of OFDMA signals with timing offsets by allowing a random access OFDMA symbol shorter than a normal one. In order to make uplink OFDMA systems robust to timing offsets, the proposed scheme inserts a zero-padding region in an OFDMA symbol.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.925-936
• /
• 2009

There very many approaches to impute missing values in the iid. case. However, it is hardly found the imputation techniques in the Markov random field(MRF) case. In this paper, we show that the imputation under MRF is just to impute by fitting the normal mixture model(NMM) under several practical assumptions. Our multivariate normal mixture model based approaches under MRF is applied to impute the missing pixel values of 3-variate (R, G, B) color image, providing a technique to smooth the imputed values.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.95-103
• /
• 2013

Nonparametric procedure in randomized block design (RBD) was proposed by Friedman (1937) for general alternatives. Also Page (1963) suggested the test for ordered alternatives in RBD. In this paper, we proposed the new nonparametric method in randomized block design using aligned method suggested by Hodges and Lehmann (1962) and the joint placement described in Chung and Kim (2007). Also, Monte Carlo simulation study was adapted to compare the power of the proposed procedure with those of previous procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.11
• /
• pp.675-681
• /
• 2014

As the recently soaring wireless traffic, small-cell techniques have been actively studied in order to support such a wireless demand for cellular wireless networks. This paper studies interference mitigation methods for random-access small-cell networks. Although inter-cell interference between small random-access cells is one of the main factors to degrade overall performance, most of the previous works focused on interference mitigation between users in each cell. To address such limitation, dynamic opportunistic interference alignment is proposed exploiting statistical characteristics of random-access. It is demonstrated by simulation that the proposed scheme outperforms the previous approach as the number of cells or the number of users in each cell increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.221-230
• /
• 2002

This paper presents a new moving object segmentation algorithm using markov random field. The algorithm is based on signal detection theory. That is to say, motion of moving object is decided by binary decision rule, and false decision is corrected by markov random field model. The procedure toward complete segmentation consists of two steps: motion detection and object segmentation. First, motion detection decides the presence of motion on velocity vector by binary decision rule. And velocity vector is generated by optical flow. Second, object segmentation cancels noise by Bayes rule. Experimental results demonstrate the efficiency of the presented method.