• Journal of applied mathematics & informatics
• /
• v.38 no.5_6
• /
• pp.533-545
• /
• 2020

We initiate and introduce the notion of binary soft mapping, which is defined on collection of binary soft sets named as binary soft class over two initial universes U₁ and U₂ with fixed set of parameters. We also define and study the properties of binary soft images and binary soft inverse images of binary soft sets. Examples and counter examples are also given in support of presented properties. Moreover, these concepts are applied to the problem of medical diagnosis in medical expert systems.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.1
• /
• pp.183-191
• /
• 2018

This paper deals with binary ideal topological space and discuss about generalized binary closed sets and generalized kernel in the same topological space. Further it will discuss various types of characterizations of generalized binary closed sets and generalized kernel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.72-80
• /
• 2012

Binary CDMA is a new standard technology for wireless communication developed by our country that makes high speed communications and good quality of services. In this paper we researched the design and implementation methods of a wireless CCTV System based on the Binary-CDMA technology that makes it freely installed in any place without cables and laying works. We implemented the hardware and software for the CCTV system and developed a Prototype Wireless CCTV system based on the Binary-CDMA technology.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.4
• /
• pp.116-124
• /
• 2011

For Binary CDMA network, communication can be accomplished only within a Pico-net on the boundary of management by the master station because it manages network resources of each entity. In this research, we try to overcome these limits and extend the application for Binary CDMA system to broad-band network. We suggest a new Binary CDMA router such that network is devised by cell unit and multiple Pico-net and a unique address is assigned to each Pico-cell to relaying data between Pico-cells.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.4
• /
• pp.197-202
• /
• 2013

Large gains in speech intelligibility can be obtained using the SNR-based binary mask approach. This approach retains the time-frequency (T-F) units of the mixture signal, where the target signal is stronger than the interference noise (masker) (e.g., SNR > 0 dB), and removes the T-F units, where the interfering noise is dominant. This paper introduces two alternative binary masks based on the distortion constraints to improve the speech intelligibility. The distortion constraints are induced by a gain function for estimating the short-time spectral amplitude. One binary mask is designed to retain the speech underestimated (T-F) units while removing the speech overestimated (T-F)units. The other binary mask is designed to retain the noise overestimated (T-F) units while removing noise underestimated (T-F) units. Listening tests with oracle binary masks were conducted to assess the potential of the two binary masks in improving the intelligibility. The results suggested that the two binary masks based on distortion constraints can provide large gains in intelligibility when applied to noise-corrupted speech.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.345-353
• /
• 2019

Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.486-492
• /
• 2004

In this paper, we newly propose the binary CA-CDMA(constant amplitude CDMA) system using pre-coding method to solve the high PAPR problem caused by multi-user signal transmission in the CDMA system. 4-user CA-CDMA, the basis of proposed binary CA-CDMA system, makes binary output signal for 4 input users. It produces the output of binary(${\pm}$2) amplitude by using a parity signal resulting from the XOR operation of 4 users data. Another sub-channel or more bandwidth is not necessary because it is transmitted together with user data and can be easily recovered in the receiver. The extension of the number of users can be possible by the simple repetition of the basic binary 4-user CA-CDMA. For example, binary 16-user CA-CDMA is made easily by allocating the four 4-user CA-CDMA systems in parallel and leading the four outputs to the fifth 4-user CA-CDMA system as input, because the output signal of each 4-user CA-CDMA is also binary. By the same extension procedure, binary 64 and 256-user CA-CDMA systems can be made with the constant amplitude. As a result, the code rate of this proposed CA-CDMA system is just 1 and binary CA-CDMA does not change the transmission rate with the constant output signal(PAPR = 0 ㏈). Therefore, the power efficiency of the HPA can be maximized without the nonlinear distortion. From the simulation results, it is verified that the conventional CDMA system has multi-level output signal, but the proposed binary CA-CDMA system always produces binary output. And it is also found that the BER of conventional CDMA system is increased by nonlinear HPA, but the BER of proposed binary CA-CDMA system is not changed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.55-62
• /
• 2004

This paper proposes and analyzes two anti-collision algorithms in Ubiquitous ID system. We mathematically compares the performance of the proposed algorithms with that of binary search algorithm slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center. We also validated analytic results using OPNET simulation. Based on analytic result comparing the proposed Modified bit-by-bit binary tree algorithm with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Modified bit-by-bit binary tree algorithm is about 5% higher when the number of tags is 20, and 100% higher when the number of tags is 200. Furthermore, the performance of proposed Enhanced bit-by-bit binary tree algorithm is about 335％ and 145% higher than Modified bit-by-bit binary tree algorithm for 20 and 200 tags respectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• Textile Coloration and Finishing
• /
• v.6 no.4
• /
• pp.17-26
• /
• 1994

Poly(ethylene terephthalate)(PET) filaments were treated in binary mixtures of organic solvents such as benzyl alcohol/perchloroethylene(BA/PER), benzyl alcohol/trichloroethylene(BA/TRI), benzyl alcohol/ethylene chloride(BA/EC), methanol/perchloroethylene (ME/PER), and methanol/trichloroethylene(ME/TRI). From the equilibrium swelling of PET, total and partial isotherms of PET for sorption of solvent mixtures and isotherms for distribution of the components between the phases were taken. Also the shrinkage and the crystallinity of PET treated with binary mixtures were investigated. The results obtained were summerized as follows: 1. All isotherms for distribution of the components between the phase deviated from the diagonal in system of PET-binary mixtures. Especially in the binary mixtures of ME/PER or ME/TRI, selectivo sorption of chlorinated hydrocarbon PER and TRI by PET occured. 2. The shrinkage of PET treated in binary mixrures was increased to compare with single solvent-treated, but the composition of binary mixtures corresponding to maximum values of shrinkage was not always agreed with the composition of binary mixtures corresponding to maximum values of shrinkage was not always agreed with the composition of binary mixtures exhibiting of the maximum swelling of PET. 3. The crystallinity of PET treated in binary mixtures generally increased than that of single solvent-treated.