• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.10
• /
• pp.782-790
• /
• 1991

In this paper, we implement the function of the IEEE802.2LLC(logical link control) sublayer one of the 7layers in MAP(manufacturing automation protocol), a standard communication protocol for manufacturing automation. With the assembly language we designed the class 3 function based on the IEEE standards and verified on the network adaptor hardware. In this experiment, we tested the function using the simplified variables considering that the retransmission value was chosen to be 1 and the life-time of the transmission variable infinite. According to the result of the service procedures, we confirmed that user data were transmitted to the corresponding station without any error.

• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.865-877
• /
• 2013

The disjoint union of mapping class groups of surfaces forms a braided monoidal category $\mathcal{M}$, as the disjoint union of the braid groups $\mathcal{B}$ does. We give a concrete and geometric meaning of the braidings ${\beta}_{r,s}$ in $\mathcal{M}$. Moreover, we find a set of elements in the mapping class groups which correspond to the standard generators of the braid groups. Using this, we can define an obvious map ${\phi}\;:\;B_g{\rightarrow}{\Gamma}_{g,1}$. We show that this map ${\phi}$ is injective and nongeometric in the sense of Wajnryb. Since this map extends to a braided monoidal functor ${\Phi}\;:\;\mathcal{B}{\rightarrow}\mathcal{M}$, the integral homology homomorphism induced by ${\phi}$ is trivial in the stable range.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.405-409
• /
• 2007

Each class in remotely sensed imagery has different spectral and spatial characteristics. Natural features have relatively smaller spatial changes than spectral changes. Meanwhile, urban area in which buildings, roads, and cars are included is inclined to face more changes of spatial variation than spectral one. This study aims to propose the new urban complexity index (UCI) based on the 3D DWT computation of remotely sensed imageries considering these characteristics. And then we analyze relation between index and land cover map. The 3DWUCI values are related to class and the indices of urban area are greater than natural area. The proposed UCI could be used to express effectively the standard of urban complexity over a wide area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5547-5562
• /
• 2016

JPEG-LS is an international standard for lossless or near-lossless image-compression algorithms. In this paper, a simple method is proposed to improve the performance of the lossless JPEG-LS algorithm. With respect to JPEG-LS and its supplementary explanation, Golomb-Rice (GR) coding is mainly used for entropy coding, but it is not used for long codewords. The proposed method replaces a set of long codewords with a set of shorter location map information. This paper shows how efficiently the location map guarantees reversibility and enhances the compression rate in terms of performance. Experiments have also been conducted to verify the efficiency of the proposed method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.886-893
• /
• 2002

The standard Hough transform has been dominantly used to detect straight lines in an image. However, massive storage requirement and low precision in estimating line parameters due to the quantization of parameter space are the major drawbacks of the Hough transform technique. In this paper, to overcome the drawbacks, an iterative algorithm based on a self-organizing map is presented. The self-organizing map can be adaptively learned such that image points are clustered by prominent lines. Through the procedure of the algorithm, a set of lines are sequentially detected one at a time. Computational results for synthetically generated images are given. The promise of the algorithm is also demonstrated with its application to two natural images of inserts.

• The Journal of Korea Robotics Society
• /
• v.6 no.3
• /
• pp.292-300
• /
• 2011

Global positioning system (GPS) is widely used to measure the position of a vehicle. However, the accuracy of the GPS can be severely affected by surrounding environmental conditions. To deal with this problem, the GPS and odometry data can be combined using an extended Kalman filter. For stable navigation of an outdoor mobile robot using the GPS, this paper proposes two methods to evaluate the reliability of the GPS data. The first method is to calculate the standard deviation of the GPS data and reflect it to deal with the uncertainty of the GPS data. The second method is to match the GPS data to the traversability map which can be obtained by classifying outdoor terrain data. By matching of the GPS data with the traversability map, we can determine whether to use the GPS data or not. The experimental results show that the proposed methods can enhance the performance of the GPS-based outdoor localization.

• Plant Breeding and Biotechnology
• /
• v.6 no.4
• /
• pp.434-443
• /
• 2018

Genotyping-by-sequencing (GBS) has been used as a viable single nucleotide polymorphism (SNP) validation method that provides reduced representation sequencing by using restriction endonucleases. Although GBS makes it possible to perform marker discovery and genotyping simultaneously with reasonable costs and a simple molecular biology workflow, the standard TASSEL-GBS pipeline was designed for homozygous groups, and genotyping of heterozygous groups is more complicated. To addresses this problem, we developed a GBS pipeline for heterozygous groups that called KNU-GBS pipeline, specifically for apple (Malus domestica). Using KNU-GBS pipeline, we constructed a genetic linkage map consisting of 1,053 SNP markers distributed over 17 linkage groups encompassing a total of 1350.1 cM. The novel GBS pipeline for heterozygous groups will be useful for marker-assisted breeding programs, and diverse heterozygous genome analyses.

• Communications of Mathematical Education
• /
• v.19 no.4 s.24
• /
• pp.671-682
• /
• 2005

One of the main function of the university is to be the center of education for the future generation. We analyze the changing standard of mathematics curriculums in Korean colleges and introduce new curriculum models in our changing social and educational environment.

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.4 s.22
• /
• pp.95-103
• /
• 2002

The accuracy of Digital Map does not meet the user's expectation, including the many errors caused while producing the project, this will be useless resulting waste of enormous national budget. To solve this Accuracy problem, clear regulations about the position accuracy of scaled Digital Map should be set immediately and provide the users with accurate information about Digital Map enabling the users to use Digital Map for each GIS application field. For this reason, the position accuracy evaluation of existing Digital Maps produced in diverse methods is on demand. In this study, therefore, we performed horizontal position survey of local selected Facilities Total Station equipment to evaluate the horizontal position accuracy of 1:1,000, 1:5,000 scaled Digital Map, obtained standard deviation using the results, performed T-Test to confirm the presence of bias and evaluated the position accuracy of Digital Map.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.