• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.269-274
• /
• 2013

In this paper, we propose the design and implementation method of picking system using zigbee wireless communication in order to solve problems of the conventional picking system which has expensive labors and maintenance costs. We use multi router based star-tree topology as a default routing topology to provide the reliable data transmission and define the method of ID configuration and data transmission. We confirm that successful data transmission ratio of multi router based picking system is maximum 20% higher than that of single router based picking system.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.118-127
• /
• 2017

We propose the dehazing algorithm which consists of two main parts, the derivation of the Atmospheric light and adaptive transmission map. In the getting the Atmospheric light value, we utilize the quad-tree partitioning where the depth of the partitioning is decided based on the difference between the averaged pixel values of the parent and children blocks. The proposed transmission map is adaptive for each pixel by using the parameter ${\beta}(x)$ to make the histogram of the pixel values in the map uniform. The simulation results showed that the proposed algorithm outperforms the conventional methods in the respect of the visual quality of the dehazed images and the computational complexity.

• Journal of Korean Society for Quality Management
• /
• v.26 no.1
• /
• pp.192-200
• /
• 1998

The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.7-13
• /
• 2010

For swiftness and economic feasibility of parcel delivery, optimal location of mail exchanging centers considering not only section delivery distance but also some weights like the number of delivery vehicles are necessary. In this paper, a mechanism with section delivery distance and vehicle number for locating of mail distribution centers which connect some mail centers of major cities in Republic Korea by applying GOSST theory is proposed. This mechanism for locating mail exchange centers can make the total delivery distance of postal matters less than not only present method which assigns Daejun as mail exchange center, but also Steiner tree method which does not consider weights like number of delivery vehicles. The mechanism is good for protecting the environment as well as rapid and economic delivery. In experiment, the proposed mechanism could curtail total delivery distance by 2.52 percentages compared with Steiner tree method and by 6.66 percentages compared with present method. The mechanism may be used in electric power transmission routing, distribution line topology design, power relay station locating where various voltages and other weights should be considered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.5
• /
• pp.390-399
• /
• 1988

A conventional BTC has the merit of real time processing and simple computation, but has the problem that its compression rate is low. In this paper, a modified BTC using the Quad Tree which is frequently used in binary image is proposed. The method results in the low compression rate by decreasing the total number of subblocks by mean of making the size of a subblock large in the small variation area of graty level and the size af a subblock small in the large variation area of gary level. For the effective transmission of bit plane, the Huffman run-lengh code for the large size of a subblock and the lookup table for tha small size of a subblock are used. The proposed BTC method show the result of coding 256 level image at the average data rate of about 0.8 bit/pixel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

• Korean Journal of Agricultural Science
• /
• v.43 no.1
• /
• pp.21-27
• /
• 2016

Apple stem grooving virus (ASGV), Apple chlorotic leaf spot virus (ACLSV), and Apple stem pitting virus (ASPV) have been known to induce top working disease causing economical damage in apple. Occurrences of these three viruses in pome fruit trees, including apple, have been reported around the world. The transmission of the three viruses was reported by grafting, and there was no report of transmission through mechanical contact, insect vector, or seed except some herbaceous hosts of ASGV. As RNA extraction methods for fruit trees, Reverse Transcriptase-Polymerase Chain Reaction (RT-PCR) and multiplex RT-PCR techniques have been improved for reliability and stability, and low titer viruses that could not be detected in the past have become detectable. We studied the seed transmission ability of three apple viruses through apple seedling diagnosis using RT-PCR. Nineteen seeds obtained from commercially grown apple were germinated and two of the resulting plants were ASGV positive. Seven clones of the amplified ASGV coat protein (CP) genes of these isolates were sequenced. Overall sequence identities were 99.84% (nucleotide) and 99.76% (amino acid). Presence of a previously unreported single nucleotide and amino acid variation conserved in all of these clones suggests a possible association with seed transmission of these 'S' isolates. A phylogenetic tree constructed using ASGV CP nucleotide sequences showed that isolate S sequences were grouped with Korean, Chinese, Indian isolates from apple and Indian isolates from kiwi.

• Korean Journal of Microbiology
• /
• v.54 no.3
• /
• pp.188-199
• /
• 2018

Genomic epidemiology exploits various basic microbial research areas. High-throughput sequencing technologies dramatically have been expanding the number of microbial genome sequences available. Abundant genomic data provide an opportunity to perform strain typing more effectively, helping identify microbial species and strains at a higher resolution than ever before. Genomic epidemiology needs to find antimicrobial resistance genes in addition to standard genome annotations. Strain typing and antimicrobial resistance gene finding are static aspects of genomic epidemiology. Finding which hosts infected which other hosts requires the inference of transient transmission routes among infected hosts. The strain typing, antimicrobial resistance gene finding, and transmission tree inference would allow for better surveillance of microbial infectious diseases, which is one of the ultimate goals of genomic epidemiology. Among several high-throughput sequencing technologies, genomic epidemiology will benefit from the more portability and shorter sequencing time of the Oxford Nanopore Technologies's MinION, the third-generation sequencing technology. Here, this study reviewed computational methods for quantifying antimicrobial resistance genes and inferring disease transmission trees. In addition, the MinION's applications to genomic epidemiology were discussed.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.171-178
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.4
• /
• pp.80-89
• /
• 2010

Most of the discussed power efficient routing algorithms, such as LEACH, PEDAP and etc., assume that a base station has infinite resources and there is no traffic limit. However, these assumptions cannot be applied to typical wireless sensor network environments, especially a small sensor network using a normal node as the base station. Moreover, many studies on the wireless sensor networks have not been considering the reverse transmission scheme which transmits data from a sink node to the normal nodes. We propose a bitarray-based reverse routing method which is a power efficient routing algorithm for the wireless sensor networks. The proposed method can be easily implemented by using the tree-based routing scheme and can be worked well with the small memory size for the address of sensor nodes. The experimental result shows that the amount of message transmission of the proposed bitarray-based reverse routing method can be reduced about 61.3% or more compared to the previous methods.