• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.4
• /
• pp.184-193
• /
• 2008

We examine the performance of genetic algorithms using binary encoding, with respect to a change of basis. Changing the basis can result in a change in the linkage structure inherent in the fitness function. We test three simple functions with differing linkage strengths and analyze the results. Based on an empirical analysis, we show that a better basis results in a smoother fitness landscape, hence genetic algorithms based on the new encoding method provide better performance.

• Mass Spectrometry Letters
• /
• v.4 no.2
• /
• pp.38-40
• /
• 2013

Glycans released from ovalbumin by PNGase F were analyzed by matrix-assisted laser desorption/ionization time-of-flight (MALDI-TOF) mass spectrometry using three different dihydroxybenzoic acid (DHB) matrix systems: 2,5-DHB, 2,6-DHB, and a 2,5-DHB/2,6-DHB binary matrix. Relative to the results obtained with the single-component matrices (2,5-DHB or 2,6-DHB), the 2,5-DHB/2,6-DHB binary matrix boasted lower background noise and higher sensitivity. A total of 16 glycan peaks were observed using the 2,5-DHB/2,6-DHB binary matrix, while only 10 and 9 glycan peaks were observed using the 2,5-DHB and 2,6-DHB matrices, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3790-3803
• /
• 2018

Content-based image retrieval is an approach used to query images based on their semantics. Semantic based retrieval has its application in all fields including medicine, space, computing etc. Semantically generated binary hash codes can improve content-based image retrieval. These semantic labels / binary hash codes can be generated from unlabeled data using convolutional autoencoders. Proposed approach uses semi-supervised deep hashing with semantic learning and binary code generation by minimizing the objective function. Convolutional autoencoders are basis to extract semantic features due to its property of image generation from low level semantic representations. These representations of images are more effective than simple feature extraction and can preserve better semantic information. Proposed activation and loss functions helped to minimize classification error and produce better hash codes. Most widely used datasets have been used for verification of this approach that outperforms the existing methods.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.227-230
• /
• 2006

There has been a growing need for increased capacity in cellular systems. This has resulted in the adoption of the code division multiple access (CDMA) system as a multiple channel access method. Thus, it is important to obtain the phase offsets of binary codes in the CDMA system because distinct phase offsets of the same code are used to distinguish signals received at the mobile station from different base stations. This letter proposes an efficient algorithm to compute the phase offset of a binary code in the CDMA system through the use of the basic facts of number theory and a new notion of the subcodes of a given code. We also formulate the algorithm in a compact form.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.11
• /
• pp.491-494
• /
• 2006

In the adder design, reduction of the delay of the carry propagation or ripple is the most important consideration. Previously, it was introduced that, if a redundant number system is adopted, the carry propagation is completely eliminated, with which addition can be done in a constant time, without regarding to the count of the digits of numbers involved in addition. In this paper, a RBCD(Redundant Binary Coded Decimal) is adopted to code 0 to 11, and an efficient and economic carry-free BCD adder is designed.

• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.312-320
• /
• 2021

Increase in computational cost and exhaustive search can lead to more complexity and computational energy. Thus, there is need for effective and efficient scheme to reduce the complexity to achieve optimal energy utilization. This will improve the energy efficiency and enhance the proficiency in terms of the resources needed to achieve convergence. This paper primarily focuses on the development of hybrid swarm intelligence scheme for reducing the computational complexity in binary optimization. In order to reduce the complexity, both artificial bee colony (ABC) and particle swarm optimization (PSO) have been employed to effectively minimize the exhaustive search and increase convergence. First, a new approach using ABC and PSO has been proposed and developed to solve the binary optimization problem. Second, the scout for good quality food sources is accomplished through the deployment of PSO in order to optimally search and explore the best source. Extensive experimental simulations conducted have demonstrate that the proposed scheme outperforms the ABC approaches for reducing complexity and energy consumption in terms of convergence, search and error minimization performance measures.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2121-2126
• /
• 2007

In this paper, the performance improvement of ultra-wideband(UWB) communications system to achieve high-data-rate using spatial diversity provided by multiple receive antennas is investigated. We derive the expression for the received SINR after spatially combining through multiple receive antennas and evaluate the bit error rate(BER) performance by numerical simulation. We also compare the performance results in the case of 2PPM systems with the theoretical performance results in the case of 2PAM THMA UWB systems. The impacts of spatial diversity on the performance of 2PPM and 2PAM THMA UWB systems are analyzed. It is shown that the BER performance is improved as the number of receive antennas increases. Also, it is observed that in the presence of multiple user interference signals, the performance of 2PAM THMA UWB systems is considerably superior to that of 2PPM THMA UWB systems.

• Korean Chemical Engineering Research
• /
• v.43 no.2
• /
• pp.259-265
• /
• 2005

Binary isothermal vapor-liquid equilibrium(VLE) data were measured for water+n-methylformamide(NMF), benzene+NMF and toluene+NMF systems by using headspace gas chromatography(HSGC) at 353.15K. Additionally, the ternary liquid-liquid Equilibrium(LLE) data were determined by measuring of tie-line for the systems of NMF+benzene+n-heptane and NMF+toluene+n-heptane at 298.15 K. The measured isothermal binary VLE data have no azeotropes and were correlated well with $g^E$ model equations of Margules, van Laar, Wilson, NRTL and UNIQUAC. The experimental ternary tie line data were also correlated well with NRTL and UNIQUAC models. Besides their accuracy was analyzed by Hirata-Fujita and Maior-Swenson equations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.441-449
• /
• 2000

Binary volume data has its widespread use in the application of color volume rendering and surgical simulation system where gray-scale volume is inappropriate. For the efficient representation of binary volume, this paper proposes a new data structure - the Slice-based Binary Shell (SBS) - along with its rendering algorithm. Since SBS stores the minimal set of surface voxels in slice order and supports the direct computation of voxel coordinates, it shows high efficiency for rendering multiple objects. The rendering algorithm of SBS running on a PC with no specialized hardware renders more than one hundred binary objects in a second.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.68-80
• /
• 2008

Since many efficient algorithms for implementing pairings have been proposed such as ${\eta}_T$ pairing and the Ate pairing, pairings could be used in constraint devices such as smart cards. However, the secure implementation of pairings has not been thoroughly investigated. In this paper, we investigate the security of ${\eta}_T$ pairing over binary fields in the context of side-channel attacks. We propose efficient and secure ${\eta}_T$ pairing algorithms using randomized projective coordinate systems for computing the pairing.