• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.64-69
• /
• 2000

This paper proposes a novel fractal coding method for fast encoding and high compression to shorten time to take on fractal encoding by using limited search area. First. the original image is contracted respectively by half and by quarter with the scaling method and bit-plane method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image qualify than Jacquin's method.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.113-121
• /
• 2018

Position encoding is a method of applying weights according to position of words that appear in a sentence. Pointer networks is a deep learning model that outputs corresponding index with an input sequence. This model can be applied to coreference resolution using attribute. However, the pointer networks has a problem in that its performance is degraded when the length of input sequence is long. To solve this problem, we proposed two contributions to resolve the coreference. First, we applied position encoding and dynamic position encoding to pointer networks. Second, we stack deeply layers of encoder to make high-level abstraction. As results, the position encoding based stacked pointer networks model proposed in this paper had a CoNLL F1 performance of 71.78%, which was improved by 6.01% compared to vanilla pointer networks.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.24-26
• /
• 1986

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.141-150
• /
• 2007

This paper proposes new Steganographic model for VoIP that has very effective method using low bit encoding. Most of Steganographic models using Low bit Encoding have two disadvantages; one is that the existence of hidden secret message can be easily detected by auditory, the other is that the capacity of stego data is low. To solve these problems, this method embed more than one bit in inaudible range, so this method can improve the capacity of the hidden message in cover data. The embedding bit position is determined by using a pseudo random number generator which has seed with remaining message length, so it is hard to detect the stego data produced by the proposed method. This proposed model is able to use not only to communicate wave file with hidden message in VoIP environment but also to hide vary information which is user basic information, authentication system, etc.

• Journal of Microbiology and Biotechnology
• /
• v.20 no.4
• /
• pp.789-797
• /
• 2010

The limited information on differential gene expression in the different serotypes of Actinobacillus pleuropneumoniae has significantly hampered the research on the pathogenic mechanisms of this organism and the development of multivalent vaccines against A. pleuropneumoniae infection. To compare the gene expressions in the A. pleuropneumoniae strains CVCC259 (serotype 1) and CVCC261 (serotype 3), we screened the differentially expressed genes in the two strains by performing representational difference analysis (RDA). Northern blot analyses were used to confirm the results of RDA. We identified 22 differentially expressed genes in the CVCC259 strain and 20 differentially expressed genes in the CVCC261 strain, and these genes were classified into 11 groups: (1) genes encoding APX toxins; (2) genes encoding transferrin-binding protein; (3) genes involved in lipopolysaccharide (LPS) biosynthesis; (4) genes encoding autotransporter adhesin; (5) genes involved in metabolism; (6) genes involved in the ATP-binding cassette (ABC) transporter system; (7) genes encoding molecular chaperones; (8) genes involved in bacterial transcription and nucleic acid metabolism; (9) a gene encoding protease; (10) genes encoding lipoprotein/membrane protein; and (11) genes encoding various hypothetical proteins. This is the first report on the systematic application of RDA for the analysis of differential gene expression in A. pleuropneumoniae serotypes 1 and 3. The determination of these differentially expressed genes will serve as an indicator for future research on the pathogenic mechanisms of A. pleuropneumoniae and the development of a multivalent vaccine against A. pleuropneumoniae infection.

• KIISE Transactions on Computing Practices
• /
• v.22 no.4
• /
• pp.170-177
• /
• 2016

Character encoding is a method for changing a document to a binary document file using the code table for storage in a computer. When people decode a binary document file in a computer to be read, they must know the code table applied to the file at the encoding stage in order to get the original document. Identifying the code table used for encoding the file is thus an essential part of decoding. In this paper, we propose a method for detecting the character code of the given binary document file automatically. The method uses many techniques to increase the detection rate, such as a character code range detection, escape character detection, character code characteristic detection, and commonly used word detection. The commonly used word detection method uses multiple word database, which means this method can achieve a much higher detection rate for multi-language files as compared with other methods. If the proportion of language is 20% less than in the document, the conventional method has about 50% encoding recognition. In the case of the proposed method, regardless of the proportion of language, there is up to 96% encoding recognition.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.578-591
• /
• 2016

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• Korean Journal of Cognitive Science
• /
• v.16 no.4
• /
• pp.255-270
• /
• 2005

Memory for repeated items is better if they are repeated in a spaced than in a massed fashion (Sparing effect). To investigate the neural mechanisms of sparing effect and successful encoding, lags of repetition were manipulated at encoding stage in an event-related MU study. The behavioral data showed typical spacing effect on recognition judgment, and greater activity for items that were repeated in a spaced fashion than for items that were repeated in a massed fashion has been observed in dorsolateral frontal cortex(DLFC) and ventrolateral frontal cortex(VLFC) of left hemisphere. These conical regions also showed greater activity for novel items than for items that were repeated in a massed fashion. These findings suggest that sparing effect and its relevant successful encoding are attributed to higher level of attentional control and semantic processing.

• Korean Journal of Child Studies
• /
• v.23 no.5
• /
• pp.1-17
• /
• 2002

The influence on children's analogical problem solving of structural highlighting during encoding and retrieval of sources was studied with 379 9-year-old participants. Performance on the first 2 of 4 tests determined the analogical level of each child. For the remaining 2 tests, the child was assigned to 1 of 12 different structural highlighting conditions, including 4 encoding conditions (reading, line, self-line, and self-explain) and 3 retrieval conditions (reminding, cued, and thematic comparison). Results showed that retrieval conditions, not encoding conditions, improved the analogical ability of the child. Children initially low in analogical ability improved in cued retrieval conditions; children initially high in analogical ability improved both in thematically compared and in cued retrieval conditions. Practical implications of the results were discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1654-1667
• /
• 1996

The conventional fractal image compression methods have high computational complexity at encoding reduce PSNR at low bit rate and havehighly visible blocking effects in a reconstructed image. In this paper we propose a fractal image compression method based on disctete wavelet transform domain, which takes the absolute value of discrete wavelet transform coefficient, and assembles the discrete wavelet tranform coefficients of different highpass subbands corresponding to the same spatial block and then applies "0" encoding according to the energy of each range blocks. The proposed method improved PSNR at low bit rate and reduced computational complexity at encoding distinctly. Also, this method can achieve a blockless reconstructed image and perform hierarchical decoding without recursive constractive transformation. Computer simulations with several test images show that the proposed method shows better performance than convnetional fractal coding methods for encoding still pictures. pictures.