• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Kyungpook Mathematical Journal
• /
• v.16 no.2
• /
• pp.161-176
• /
• 1976

• Kyungpook Mathematical Journal
• /
• v.12 no.1
• /
• pp.1-8
• /
• 1972

• Kyungpook Mathematical Journal
• /
• v.12 no.2
• /
• pp.199-211
• /
• 1972

• Journal of Broadcast Engineering
• /
• v.20 no.1
• /
• pp.164-170
• /
• 2015

This paper deals with the adaptation of classification model in the binary mask approach to suppress noise in the noisy environment. The binary mask estimation approach is known to improve speech intelligibility of noisy speech. However, the same type of noisy data for the test data should be included in the training data for building the classification model of binary mask estimation. The eigenvoice adaptation is applied to the noise-independent classification model and the adapted model is used as noise-dependent model. The results are reported in Hit rates and False alarm rates. The experimental results confirmed that the accuracy of classification is improved as the number of adaptation sentences increases.

• 한국정보교육학회:학술대회논문집
• /
• 2011.01a
• /
• pp.253-259
• /
• 2011

Computers are playing a major role in generating, sharing, and utilizing knowledge, which can be recognized as an essential component of national competitiveness. This may lead to the necessity as well as importance of computer education in elementary education. In the paper, we first investigate the necessity of teaching principles of binary system and then we figure out the status quo of teaching the subject in elementary classrooms. Based on the observations in the field, we design learning contents that can be used effectively in classroom so that students can learn easily the fundamental concept of binary system.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.64.2-64.2
• /
• 2017

The Population III (Pop III) stars are thought to be massive. If massive Pop III stars form binary system and they experience mass transfer via the Roche lobe overflow, this may significantly change the properties of the system. For example, mass transfer in such system may shorten the period of the system, forming short period binary black hole (BBH) system, which is the most promising candidate for recently detected gravitational wave radiation sources. Also, there is an expectation that due to the stripped envelope of donor star by mass transfer, this system can play a significant role in the cosmic reionization by emitting more UV photons. However, this outcome highly depends on the initial properties of the system. We perform grid calculation on Pop III binary models with various initial primary masses (20 ~ 100 solar mass), initial separations, and initial mass ratios (q = 0.5 ~ 0.9). We find that 1) in most cases binary models show no increase in the number of ionizing photons and 2) formation of short period BBH system via mass transfer is highly unlikely.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.2
• /
• pp.235-242
• /
• 2002

To minimize restructuring cost of a tree, experiments were conducted to collect quantitative information of searching efficiencies varying degrees of imbalance in a binary search tree. Degrees of tree imbalance were measured by a balance factor, an absolute value of height difference of left subtree and right subtree in a binary search tree. The average number of comparisons increased (p＜0.01), and searching efficiency of O(n) was more appropriate rather than O(logn), as degrees of imbalance in a binary search tree deteriorated. However, there were no significant differences of searching efficiencies in height balanced trees and trees with subtrees to have height 3 less than the other (p＞0.05). Therefore, the findings would be applicable to maintain searching efficiency of a software with a binary search tree.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.175-178
• /
• 2004

This paper describes a new IP address lookup algorithm using a binary search on multiple balanced trees stored in one memory. The proposed scheme has 3 different tables; a range table, a main table, and multiple sub-tables. The range table includes $2^8$ entries of 22 bits wide. Each of the main table and sub-table entries is composed of fields for a prefix, a prefix length, the number of sub-table entries, a sub-table pointer, and a forwarding RAM pointer. Binary searches are performed in the main table and the multiple sub-tables in sequence. Address lookups in our proposed scheme are achieved by memory access times of 11 in average, 1 in minimum, and 24 in maximum using 267 Kbytes of memory for 38.000 prefixes. Hence the forwarding table of the proposed scheme is stored into L2 cache, and the address lookup algorithm is implemented in software running on general purpose processor. Since the proposed scheme only depends on the number of prefixes not the length of prefixes, it is easily scaled to IPv6.