• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.2
• /
• pp.79-86
• /
• 2019

For decades, in-memory data structures have been designed for DRAM-based main memory that provides symmetric read/write performances and has no limited write endurance. However, such data structures provide sub-optimal performance for NVM as it has different characteristics to DRAM. With this motivation, we rethink a conventional red-black tree in terms of its efficacy under NVM settings. The original red-black tree constantly rebalances sub-trees so as to export fast access time over dataset, but it inevitably increases the write traffic, adversely affecting the performance for NVM with a long write latency and limited endurance. To resolve this problem, we present a variant of the red-black tree called a hierarchical balanced binary search tree. The proposed structure maintains multiple keys in a single node so as to amortize the rebalancing cost. The performance study reveals that the proposed hierarchical binary search tree effectively reduces the write traffic by effectively reaping the high capacity of NVM.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.111-130
• /
• 2019

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.485-499
• /
• 2021

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4645-4664
• /
• 2019

It is significant to construct deterministic measurement matrices with easy hardware implementation, good sensing performance and good cryptographic property for practical compressed sensing (CS) applications. In this paper, a deterministic construction method of bipolar chaotic measurement matrices is presented based on binary sequence family (BSF) and Chebyshev chaotic sequence. The column vectors of these matrices are the sequences of BSF, where 1 is substituted with -1 and 0 is with 1. The proposed matrices, which exploit the pseudo-randomness of Chebyshev sequence, are sensitive to the initial state. The performance of proposed matrices is analyzed from the perspective of coherence. Theoretical analysis and simulation experiments show that the proposed matrices have limited influence on the recovery accuracy in different initial states and they outperform their Gaussian and Bernoulli counterparts in recovery accuracy. The proposed matrices can make the hardware implement easy by means of linear feedback shift register (LFSR) structures and numeric converter, which is conducive to practical CS.

• Bulletin of the Korean Chemical Society
• /
• v.15 no.3
• /
• pp.193-197
• /
• 1994

Due to possibility of visual observation of phase transformations and processes during solidification, the transparent binary alloy models are important in materials and metallurgical sciences. As such, phase diagram, linear velocity of crystallization, microstructure and spectral behaviour of binary organic systems of benzidine with resorcinol and catechol involving formation of addition compound with congruent melting point have been studied. While their phase diagrams show the formation of two eutectics and a 1:2 (B:RC, B:CT) addition compound in each case, the crystallization data obey the Hillig-Turnbull equation. The microstructural investigations give the characteristic morphology of the eutectics and the addition compounds, the spectral studies suggest intermolecular hydrogen bonding between two components forming the molecular complex.

• Current Optics and Photonics
• /
• v.5 no.3
• /
• pp.261-269
• /
• 2021

Binary-phase complex spatial light modulators (BP-C-SLMs) are proposed and simulated. This study shows that bottom-top mirror-symmetrical uniaxial systems between two orthogonal polarizers allow one to construct BP-C-SLMs. BP-C-SLMs double the information-handling capacity per pixel, compared to the conventional amplitude-only spatial light modulators (A-SLMs), as well as being simply implemented with a single spatial light modulator (SLM), rather than a combination of an A-SLM and a binary-phase SLMs. Under limited conditions, BP-C-SLMs can control only the amplitude in single-phase space, and act as A-SLMs.

• Asia pacific journal of information systems
• /
• v.20 no.2
• /
• pp.23-37
• /
• 2010

Conventional Support Vector Machines (SVMs) have been utilized as classifiers for binary classification problems. However, certain real world problems, including corporate bond rating, cannot be addressed by binary classifiers because these are multi-class problems. For this reason, numerous studies have attempted to transform the original SVM into a multiclass classifier. These studies, however, have only considered nominal classification problems. Thus, these approaches have been limited by the existence of multiclass classification problems where classes are not nominal but ordinal in real world, such as corporate bond rating and multiclass customer classification. In this study, we adopt a novel multiclass SVM which can address ordinal classification problems using ordinal pairwise partitioning (OPP). The proposed model in our study may use fewer classifiers, but it classifies more accurately because it considers the characteristics of the order of the classes. Although it can be applied to all kinds of ordinal multiclass classification problems, most prior studies have applied it to finance area like bond rating. Thus, this study applies it to a real world customer level classification case for implementing customer relationship management. The result shows that the ordinal multiclass SVM model may also be effective for customer level classification.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1288-1293
• /
• 2005

This paper presents a design method for multiple-output combinational digital logic systems using time domain based on multiplexing(TDBM) and common multi-terminal extension decision diagrams(CMTEDD). The CMIEDDs represents extension valued multiple-output functions, while TDBM systems transmit several signals on a single lines. The proposed method can reduce the 1)hardware, 2)logic levels and 3)pins. In the logic system design, we use two types of decision diagrams(DDs), that is the common binary decision diagrams(CBDDs) and CMTEDDs. Also, we propose an algorithms to derive common multiple-terminal binary decision diagrams(CMTBDD) from CBDDs, and CMTEDDs from CMTBDDs. The CMTEDDs over CBDDs is more compactness in terms of number of non-terminal nodes, where the nodes for output selection variables are not included in the non-terminal nodes. In the logic design, each non-terminal nodes of an CBDDs and an CMTEDDs is realized by a multiplexer(MUX). In addition, we compare the proposed TDBM realization with the conventional one.

• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.237-240
• /
• 2015

Classical novae (CNe) are interacting binary systems whose outbursts are powered by a thermonuclear runaway in accreted material onto the surface of a white dwarf (WD). The secondary star in such systems fills its Roche lobe and material is transferred onto the WD primary star via an accretion disk. Recurrent novae (RNe) show many similarities to CNe, but have had more than one recorded outburst. RNe play an important role as one of the suspected progenitor systems of Type Ia supernovae, which are used as primary distance indicators in cosmology. Thus, it is important to investigate the nature of their central binary systems to determine the relation between the parameters of the central system and the outburst type, and finally ascertain the population of novae that might be available to give rise to the progenitors of Type Ia SNe. A low outburst amplitude is adopted as a criterion that may help distinguish RNe from CNe and was therefore used to select targets for observations from ground-based observatories including the Liverpool Telescope and the Southern African Large Telescope as well as the full-sky space-based archive of the Solar Mass Ejection Imager (SMEI). We found that at least four objects currently classified as CNe are possibly RNe candidates based on their quiescent spectra. We also searched the SMEI archive for additional outbursts of bright CNe that might otherwise have been missed but did not find a conclusive example.

• Journal of the Korean Vacuum Society
• /
• v.4 no.S2
• /
• pp.148-155
• /
• 1995

(1) The metastable crystalline(MX) phases formed by ion mixing are classified into 5 types, i.e. the super-saturated solid solutions and the enlarged HCP-I phases reported earlier, and the newly observed FCC-I phases in hcp-based alloys, The FCC-ll and HCP-ll phases in bcc-based alloys. The growth kinetics of the MX phases is discussed. (2) The interfacial free energy in the multilayered films was found to play an important role in ion beam mixing(IM) induced amorphization. By adding sufficient interfaces, amorphous alloys were obtained even in the systems with rather positive heat of formation. (3) Gibbs free energy diagrams of some representative systems were constructed, by calculating the free energy curves of all the competing phases. Steady-state thermal annealing was conducted and the results confirmed the relevance of the constructed diagrams, which were inturn employed to interpret the MX phase formation as well as the glass forming ability upon IM in the binary metal systems.