• Bulletin of the Korean Chemical Society
• /
• 제27권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.

• 한국통신학회논문지
• /
• 제29권11B
• /
• pp.911-919
• /
• 2004

IP 주소 검색은 인터넷 라우터의 필수적인 기능의 하나로서, 라우터 전체의 성능을 결정하는 중요한 요소이다. 소프트웨어에 기반한 IP 주소 검색 방식의 성능 평가 기준 중 가장 중요한 것은 라우터의 처리 속도를 보장해 주는 의미를 갖는 최대 메모리 접근 횟수이다. 이진 프리픽스 트리 방식(BPT)은 최대 메모리 접근 횟수에 있어서 기존의 다른 소프트웨어에 기반한 방식 중 우수한 방식이지만, 트리의 구조가 불균형적이 되는 단점이 있다. 본 논문에서는 기존의 BPT 방식의 트리 생성 과정에 가중치 개념을 추가하여, 완전 균형 트리에 매우 근접하는 트리를 생성하는 가중 이진 프리픽스 트리 (WBPT) 방식을 제안한다. 제안하는 WBPT 방식은 기존의 소프트웨어에 근거한 방식들에 비교하여 최대 메모리 접근 횟수에 있어서 가장 적은 성능을 보인다. 또한 3만 개 정도의 프리픽스에 대해서 L2 캐쉬에 저장이 가능한 정도의 작은 메모리 크기를 요구하구 프리픽스의 추가, 삭제가 용이하므로 실제적인 라우터의 IP 검색을 위하여 사용될 수 있는 방식이다.

• 대한전자공학회논문지TE
• /
• 제37권5호
• /
• pp.7-16
• /
• 2000

본 논문은 고속 지수 선택기를 이용한 여분 부동 소수점 이진수의 제산/스퀘어-루트 설계 및 구현에 관하여 기술하였다. 본 제산/스퀘어-루트는 처리 속도 25㎒를 갖는 여분 이진수의 가산 방식을 사용하여 올림수 지연을 제거함으로써 비트 크기에 관계없이 일정한 시간으로 가산을 수행한다. 각각의 반복 단계에 널리 사용된 제산과 스퀘어-루트에 대해 16-비트 VLSI 회로를 설계하였다. 이것은 매번 16개 클럭마다 시프트된 이진수를 여분 가산하여 제산 및 스퀘어-루트를 실행한다. 또한 이 회로는 비복원 방법을 사용하여 지수 비트를 얻는다. 지수 선택 논리의 간단한 회로를 구현하기 위하여 나머지 비트의 주요 세 자리를 사용하였다. 결과적으로, 이 회로의 성능은 새로운 지수 선택 가산 논리를 적용하여 지수 결정 영역을 병렬 처리함으로써 한층 더 연산 처리 속도를 높인 것이다. 이전에 동일한 알고리즘을 사용하여 제안된 설계보다 13% 빠른 속도 증가를 보였다.

• Communications for Statistical Applications and Methods
• /
• 제10권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• 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.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2018년도 춘계 종합학술대회 논문집
• /
• 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.

• 대한수학회보
• /
• 제56권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
• /
• 제10권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• 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년도 정보통신설비 학술대회
• /
• 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.