• Proceedings of the KAIS Fall Conference
• /
• 2011.12b
• /
• pp.569-572
• /
• 2011

본 논문은 국내원천 기술인 Binary CDMA 기술을 소개하고 배전자동화(Distribution Automation) 시스템에 Binary CDMA 무선 기술을 어떻게 적용할지를 연구하고자 한다. 주요 연구내용은 Binary CDMA배전자동화 시스템, 배전자동화장치를 원격에서 제어하고 모니터링하기 위한 피코넷 네트워크 구성, 데이터 송수신을 위한 전송 스케줄링을 다루고자 한다. 그리고 배전자동화 시스템은 국가 전력망을 구축하는 아주 중요한 인프라이기 때문에 이를 보호하기 위한 무선 패킷의 암호화 적용방안에 대해서도 연구하고 하고자 한다.

• Journal of Astronomy and Space Sciences
• /
• v.20 no.2
• /
• pp.133-142
• /
• 2003

The contact binary system has been classified in five different types according to their physical properties. We suggest that extremely small mass ratio contact binary systems(q＜0.2) could be classified as a new type of contact binaries in addition to the classification. According to the Svechnikov & Kuznetsova (1990)'s catalogue, the spectral types of primary components of newly classified contact binaries are distributed at A type, and also the distribution of their various physical characteristics is laid at the center region dividing the early-type contact binaries from late-type contact binaries.

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

The tree method can be extended to multivariate responses, such as repeated measure and longitudinal data, by modifying the split function so as to accommodate multiple responses. Recently, some decision trees for multiple responses have been constructed by Segal (1992) and Zhang (1998). Segal suggested a tree can analyze continuous longitudinal response using Mahalanobis distance for within node homogeneity measures and Zhang suggested a tree can analyze multiple binary responses using generalized entropy criterion which is proportional to maximum likelihood of joint distribution of multiple binary responses. In this paper, we will modify CART procedure and suggest a new tree-based method that can analyze multiple binary responses using similarity measures.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.80-87
• /
• 1989

Many Traditional Algebraic Analyses of preference and choice for a finite set of alternatives have been based on binary choices. They have assumed that the binary preference information given by a decision maker is transitive. However, there is considerable evidence that many relations that might occur as preference relations cannot be presented as transitive relations. To construct transitive binary comparisons from intransitive ones, we suggest the notion of superior set, which helps us to understand the structure of intransitive binary comparisons. We also provide a heuristic method to construct transitive binary comparisons. And some merits merits of the suggested method over the existing methods are also discussed.

• Journal of the Korean Chemical Society
• /
• v.59 no.5
• /
• pp.423-428
• /
• 2015

(1S)-(+)-10-camphorsulfonic acid (CSA) and HCl were used together as a binary dopant in the electrodeposition of polyaniline (PAni). (+)-CSA and HCl were added in different mole ratios (9:1 and 6:4). (+)-CSA-doped and binary-doped PAni exhibited markedly different ultraviolet-visible and circular dichroism spectral characteristics due to differences in their conformations. Distinct helical structures are observed in the scanning electron microscopy images of (+)-CSA-doped PAni. The X-ray diffraction pattern of (+)-CSA-doped PAni exhibited remarkably higher crystallinity than that of HCl-doped PAni which is associated with the helical ordering along the polymer chains. The conformational changes due to the binary doping in chiral PAni had a significant effect on its chiroptical and electrochemical properties, morphology, and crystallinity, thus determined its conductivity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.216-221
• /
• 2004

This paper describes an optimal synthesis method of binary neural network for pattern recognition. Our objective is to minimize the number of connections and the number of neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm (NETLA) for the multilayered neural networks. The synthesis method in NETLA uses the Expanded Sum of Product (ESP) of the boolean expressions and is based on the multilayer perceptron. It has an ability to optimize a given binary neural network in the binary space without any iterative learning as the conventional Error Back Propagation (EBP) algorithm. Furthermore, NETLA can reduce the number of the required neurons in hidden layer and the number of connections. Therefore, this learning algorithm can speed up training for the pattern recognition problems. The superiority of NETLA to other learning algorithms is demonstrated by an practical application to the approximation problem of a circular region.

• Asia pacific journal of information systems
• /
• v.2 no.1
• /
• pp.3-15
• /
• 1992

This paper proposes a new referential model for data retrieval as an alternative to exact matching. While exact matching is an effective data retrieval model, it is based on fairly strict assumptions and limits our capabilities in data retrieval. This study redefines data retrieval to include non-binary data retrieval in addition to binary data retrieval, proposes Double Anchor Preference Model (DAPM), and analyzes its logical charateristics. DAPM supports non-binary data retrieval. Further, it produces the same result as exact matching for the conventional binary data retrieval. These findings show that, at the logical level, the proposed DAPM retains all the desirable features for data retrieval.

• Current Optics and Photonics
• /
• v.3 no.6
• /
• pp.548-554
• /
• 2019

A binary encoding method for grayscale images is proposed to address their unsatisfactory decryption results from joint transform correlator (JTC) encryption systems. The method converts the encryption and decryption of grayscale images into that of binary images, and effectively improves decrypted-image quality. In the simulation, we replaced unencoded grayscale images with their binary encoded counterparts in the JTC encryption and decryption processes, then adopted a median filter to suppress saturation noise while keeping other settings unchanged. Accordingly, decrypted-image quality was clearly enhanced as the correlation coefficient (CC) between a decrypted image and its original rose from 0.8237 to 0.9473 initially, and then further to 0.9937, following the above two steps respectively. Finally, optical experimental results confirmed that the proposed encryption system works correctly.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.79-84
• /
• 2003

Likelihood estimation in random-effect models is often complicated because the marginal likelihood involves an analytically intractable integral. Numerical integration such as Gauss-Hermite quadrature is an option, but is generally not recommended when the dimensionality of the integral is high. An alternative is the use of hierarchical likelihood, which avoids such burdensome numerical integration. These two approaches for fitting binary data are compared and the advantages of using the hierarchical likelihood are discussed. Random-effect models for binary outcomes and for bivariate binary-continuous outcomes are considered.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.494-496
• /
• 2013

In this paper, we introduce a technique for delayed deallocation of temporary register allocation. We achieve faster binary translation that is used in the context of register allocation. By delaying deallocation of the temporary register containing the value, it is preserved until the next instruction fetched. If subsequent instruction does not require the value again, binary translator deallocate and release the temporary register at the first stage of the next instruction.