• Bulletin of the Korean Chemical Society
• /
• v.27 no.5
• /
• pp.718-724
• /
• 2006

The heterogeneous association behaviour of various concentration binary mixtures of mono alkyl ethers of ethylene glycol with ethyl alcohol were investigated by dielectric measurement in benzene solutions over the entire concentration range at 25 ${^{\circ}C}$. The values of static dielectric constant $\epsilon_0$ of the mixtures were measured at 1 MHz using a four terminal dielectric liquid test fixture and precision LCR meter. The high frequency limiting dielectric constant $\epsilon_\infty$ values were determined by measurement of refractive index $n_D$ ($\epsilon_\infty\;=\;n_D\;^2$). The measured values of $\epsilon_0$ and $\epsilon_\infty$ were used to evaluate the values of excess dielectric constant $\epsilon^E$, effective Kirkwood correlation factor $g^{eff}$ and corrective correlation factor $g_f$ of the binary polar mixtures to obtain qualitative and quantitative information about the H-bond complex formation. The non-linear behaviour of the observed $\epsilon_0$ values of the polar molecules and their mixtures in benzene solvent confirms the variation in the associated structures with change in polar mixture constituents concentration and also by dilution in non-polar solvents. Appearance of the maximum in $\epsilon^E$ values at different concentration of the polar mixtures suggest the formation of stable adduct complex, which depends on the molecular size of the mono alkyl ethers of ethylene glycol. Further, the observed $\epsilon^E$ < 0 also confirms the heterogeneous H-bond complex formation reduces the effective number of dipoles in these polar binary mixtures. In benzene solutions these polar molecules shows the maximum reduce in effective number of dipoles at 50 percent dilutions. But ethyl alcohol rich binary polar mixtures in benzene solvent show the maximum reduce in effective number of dipoles in benzene rich solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.911-919
• /
• 2004

IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.5
• /
• pp.7-16
• /
• 2000

This paper described a design and implementation of the division/square-root for a redundant floating point binary number using high-speed quotient selector. This division/square-root used the method of a redundant binary addition with 25MHz clock speed. The addition of two numbers can be performed in a constant time independent of the word length since carry propagation can be eliminated. We have developed a 16-bit VLSI circuit for division and square-root operations used extensively in each iterative step. It performed the division and square-toot by a redundant binary addition to the shifted binary number every 16 cycles. Also the circuit uses the nonrestoring method to obtain a quotient. The quotient selection logic used a leading three digits of partial remainders in order to be implemented in a simple circuit. As a result, the performance of the proposed scheme is further enhanced in the speed of operation process by applying new quotient selection addition logic which can be parallelly process the quotient decision field. It showed the speed-up of 13% faster than previously presented schemes used the same algorithms.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.909-917
• /
• 2003

Although many classification models have been used to classify binary data, none of the classification models dominates all varying circumstances depending on the number of variables and the size of data(Asparoukhov and Krzanowski (2001)). This paper proposes a classification model which uses information on marginal distributions of sub-variables and its maximum entropy distribution. Classification experiments by using simulation are discussed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.218-223
• /
• 1995

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature or feature subset among all the available features is selected based on fitness function in genetic algorithm which is inversely proportional to classification error, balance between cluster, number of feature used. The proposed design scheme is applied to the handwtitten alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• Proceedings of the Korea Contents Association Conference
• /
• 2018.05a
• /
• pp.485-486
• /
• 2018

In this paper, we consider a binary recovery framework of the Compressed Sensing (CS) problem. We derive an upper bound for $L_0$ recovery performance of a binary sparse signal in terms of the dimension N and sparsity K of signals, the number of measurements M. We show that the upper bound obtained from this work goes to the limit bound when the sensing matrix sufficiently become dense. In addition, for perfect recovery performance, if the signals are very sparse, the sensing matrices required for $L_0$ recovery are little more dense.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.585-594
• /
• 2003

It has been generally recognized that conventional binomial or Poisson model provides poor fits to the actual correlated binary data due to the extra-binomial variation. A number of generalized statistical models have been proposed to account for this additional variation. Among them, beta-binomial, correlated-binomial, and modified-binomial models are binomial-related models which are frequently used in modeling the sum of n correlated binary data. In many situations, it is reasonable to assume that n correlated binary data are exchangeable, which is a special case of correlated binary data. The sum of n exchangeable correlated binary data is modeled relatively well when the above three binomial-related models are applied. But the estimation results of correlation coefficient turn to be quite different. Hence, it is important to identify which model provides better estimates of model parameters(success probability, correlation coefficient). For this purpose, a small-scale simulation study is performed to compare the behavior of above three models.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.297-301
• /
• 2003

The binary clipping PW/CDMA system is considered. This system can be constructed with effective cost. leading to reduce the influence of the non-linear amplifier because of converting multi-level signals into constant envelope signals. In addition, the clipping method which is to clip out signal amplitude at some level when multi-level signals are converted into constant envelope signals is used. The multi-level signals are clipped at 1 and -1 to limit the extension of bandwidth and to maintain the bandwidth after clipping. In this paper, the performance of the binary clipping PW/CDMA system with the non-linear amplifier analyzed by simulation over AWGN and flat fading channels respectively. The binary clipping PW/CDMA system with the non-linear amplifier is 2.2dB and 0.9dB better than conventional DS/CDMA system over the flat fading channels when the number of users are 9 and 17 respectively.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.429-432
• /
• 2008

In this paper, performance of a double binary turbo coded ultra wide band (UWB) system is analyzed and simulated in an indoor wireless channel. Binary pulse position modulation-time hopping (BPPM-TH) signals are considered. The indoor wireless channel is modeled as a modified Saleh and Valenzuela (SV) channel. The performance is evaluated in terms of bit error probability (BER). From the simulation results, it is seen that double binary turbo coding offers considerable coding gain with reasonable encoding complexity. It is also demonstrated that the performance of the UWB system can be substantially improved by increasing the number of iterations.