• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.50 no.5
• /
• pp.624-629
• /
• 2017

A rainbow trout Onchorhynchus mykiss farm located in Gangwon province, South Korea, experienced approximately 10% mortality in June 2017. Most diseased fish had a markedly distended, gas-filled stomach, and exhibited abnormal behavior at the water surface. In this study, we attempted to identify the cause of stomach distension syndrome in those rainbow trout. The stomach of most of the affected fish were full of unidentified gases and some exudate, and yeast was isolated from the stomach mucosa. Pure cultures of yeast were identified using a multilocus sequence typing scheme based on 18S rRNA, internal transcribed spacers, large subunit rRNA, and the gene encoding the largest subunit of RNA polymerase II (RPB1). The RPB1 gene sequences were compared with those of related species available in a database. The yeast was identified as Scheffersomyces coipomoensis (Candida coipomoensis) based on sequence analyses. This is the first study to reveal that Sch. coipomoensis is a potential causative agent of stomach distension syndrome in farmed rainbow trout. Our results will be helpful for future related studies, and indicate that farmers and stakeholders should observe this emerging disease closely.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2465-2473
• /
• 2012

Recently, as one of low complexity video encoding methods, DVC (Distributed Video Coding) scheme has been actively studied. Most of DVC schemes exploit feedback channel to achieve better coding performances, however, this causes these schemes to have high decoding delay. In order to overcome these, this paper proposes a new fast DVC decoding method using parity-bit request model, which can be obtained by using bit-error rate, sent by encoder with motion vector, which is transmitted through feedback channel by decoder after generating side information. Through several simulations, it is shown that the proposed method improves greatly the decoding speed, compared to the conventional schemes.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.411-424
• /
• 2006

This paper presents a multimedia streaming platform for efficiently transmitting MPEG-4 content over IP networks. The platform includes an MPEG-4 compliant streaming server and client, supporting object-based representation of multimedia scenes, interactivity, and advanced encoding profiles defined by the ISO standard. For scalability purposes, we employ an application-layer multicast scheme for media transmission using overlay networks. The overlay network, governed by the central entity of the network distribution manager, is dynamically deployed according to a set of pre-defined criteria. The overlay network supports both broadcast delivery and video-on-demand content. The multimedia streaming platform is standards-compliant and utilizes widespread multimedia protocols such as MPEG-4, real-time transport protocol, real-time transport control protocol, and real-time streaming protocol. The design of the overlay network was architected with the goal of transparency to both the streaming server and the client. As a result, many commercial implementations that use industry-standard protocols can be plugged into the architecture relatively painlessly and can enjoy the benefits of the platform.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2485-2489
• /
• 2005

This paper introduces a new preprocessing scheme to replace original data of gray scale images with particular ordered data so that performance of lossless compression can be improved more efficiently. As a kind of preprocessing technique to maximize performance of entropy encoder, the proposed method converts the input image data into more compressible form. Before encoding a stream of the input image, the proposed preprocessor counts co-occurrence frequencies for neighboring pixel pairs. Then, it replaces each pair of adjacent gray values with particular ordered numbers based on the investigated co-occurrence frequencies. When compressing ordered image using entropy encoder, we can expect to raise compression rate more highly because of enhanced statistical feature of the input image. In this paper, we show that lossless compression rate increased by up to 37.85% when comparing results from compressing preprocessed and non-preprocessed image data using entropy encoder such as Huffman, Arithmetic encoder.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.23 no.1
• /
• pp.5-26
• /
• 2012

Mapping FRSAD and other ontology models intends to suggest a higher knowledge level that is independent of any information implementation system or specific context, and to endeavor to focus on the semantics, knowledge structures, subject access, and interoperability. Providing an application of FRSAD model to information environment and representing and sharing the information within the library sector and beyond, there needs encoding scheme for knowledge representation. This study suggested an OWL based ontology architecture for FRSAD model and demonstrated the pilot FRSAD ontology model using Prot$\acute{e}$g$\acute{e}$ software.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• Convergence Security Journal
• /
• v.11 no.6
• /
• pp.37-44
• /
• 2011

VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many field. It provide traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. Also, in VANET, vehicles shoul d be able to authenticate each other to securely communicate with network-based infrastructure, and their locations and identifiers should not be exposed from the communication messages. This paper proposes V2I(Vehicular to Infra structure) authentication protocol that anonymity and untraceability of vehicular using Error Correcting Code that ge nerate encoding certification using generation matrix. The proposed scheme based on ECC resolves overhead problems of vehicular secure key management of KDC.

• Spatial Information Research
• /
• v.13 no.4 s.35
• /
• pp.355-364
• /
• 2005

Vector data sets (e.g. maps) are currently major sources of displaying, querying, and identifying locations of spatial features in a variety of applications. Especially in mobile environment, the needs for using spatial data is increasing, and the relative large size of vector maps need to be smaller. Recently, there have been several studies about vector map compression. There was clustering-based compression method with novel encoding/decoding scheme. However, precedent studies did not consider that spatial data have to be updated periodically. This paper explores the problem of existing clustering-based compression method. We propose an adaptive approximation method that is capable of handling data updates as well as reducing error levels. Experimental evaluation showed that when an updated event occurred the proposed adaptive approximation method showed enhanced positional accuracy compared with simple cluster based compression method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.75-82
• /
• 2004

The channel transmission ratio is speeded up by the combination of the Huffman algorithm, the model scheme of the lossy transform having minimum average code lengths for the image information and good instantaneous decoding capability, with the Lempel-Ziv algorithm showing the fast processing performance during the compression process. In order to increase the processing speed during the compression process, ICMEP algorithm is proposed and the entropy encoder of HDTV is designed and inspected. The ICMEP entropy encoder have been designed by choosing the top-down method and consisted of the source codes and the test benches by the behavior expression with VHDL. As a simulation results, implemented ICMEP entropy encoder confirmed that whole system efficiency by memory saturation prevention and compressibility increase improves.

• International journal of advanced smart convergence
• /
• v.2 no.1
• /
• pp.6-11
• /
• 2013

Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.