• 제목/요약/키워드: Binary Systems

검색결과 1,167건 처리시간 0.035초

Effect of Changing the Basis in Genetic Algorithms Using Binary Encoding

  • Kim, Yong-Hyuk;Yoon, You-Rim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권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.

Enhanced Detection of Glycans by MALDI-TOF Mass Spectrometry Using a Binary Matrix of 2,5-Dihydroxybenzoic Acid and 2,6-Dihydroxybenzoic Acid

  • Kim, Yunjin;Kim, Taehee;Lee, Jihyeon;Im, Haeju;Kim, Jeongkwon
    • Mass Spectrometry Letters
    • /
    • 제4권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.

Deep Hashing for Semi-supervised Content Based Image Retrieval

  • Bashir, Muhammad Khawar;Saleem, Yasir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권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.

Numerical Algorithm for Phase Offsets of Binary Codes in the Code Division Multiple Access System

  • Park, Hong-Goo
    • ETRI Journal
    • /
    • 제28권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.

  • PDF

Redundant 십진코드를 이용하여 십진 자리간 Carry 전파를 제거한 십진 Adder 설계 (A Design of the Redundant Binary Coded Decimal Adder for the Carry-Free Binary Coded Decimal Addition)

  • 제정민;정태상
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제55권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.

Enhanced Hybrid XOR-based Artificial Bee Colony Using PSO Algorithm for Energy Efficient Binary Optimization

  • Baguda, Yakubu S.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권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.

다중사용자 환경에서 공간적인 다이버시티를 이용하는 초광대역 통신시스템의 성능 비교분석 (Performance of UWB Systems using Spatial Diversity in Multi-User Environments)

  • 백선영;안진영;이성신;김상준
    • 한국정보통신학회논문지
    • /
    • 제11권11호
    • /
    • pp.2121-2126
    • /
    • 2007
  • 본 논문에서는 다중 수신안테나가 제공하는 공간적인 다이버시티를 이용하여 고속의 데이터 전송률을 달성하기 위한 초광대역 통신시스템의 성능 향상에 대해 연구한다. 다중사용자 간섭 신호들이 존재하는 환경에서 2PPM(Binary Pulse Position Modulation) THMA(Time Hopping Multiple Access) UWB 시스템의 성능을 이론적으로 분석하기 위해서 다중 수신안테나를 통해서 수신되는 공간적인 신호들을 결합한 후의 수신 SINR 표현식을 유도하고 BER 성능을 수치적인 시뮬레이션에 의해 평가된다. 또한 2PPM에 의한 시스템의 성능 결과들을 2PAM(Binary Pulse Amplitude Modulation) THMA UWB 시스템의 이론적인 성능 결과와도 비교한다. 공간적인 다이버시티가 2PPM과 2PAM THMA UWB 시스템의 성능에 미치는 영향을 분석한다. 다중 수신안테나의 수가 증가함에 따라 BER 성능이 향상됨을 보인다. 또한 다중사용자 간섭 신호들이 존재할 때 2PAM THMA UWB 시스템의 성능이 2PPM THMA UWB 시스템의 성능보다 상당히 우수하다는 것을 확인한다.

NMF를 포함하는 이성분계의 등온 기-액 평형과 삼성분계 액-액 평형 (Binary Vapor-Liquid Equilibria and Ternary Liquid-Liquid Equilibria for NMF Contained Systems)

  • 박소진;한규진;원동복;오종혁;최영윤
    • Korean Chemical Engineering Research
    • /
    • 제43권2호
    • /
    • pp.259-265
    • /
    • 2005
  • Water+n-methylformamide(NMF), benzene+NMF 그리고 toluene+NMF의 353.15 K 이성분계 등온 기-액상평형을 headspace gas chromatography(HSGC)로 측정하였고, NMF+benzene+n-heptane과 NMF+toluene+n-heptane 삼성분계에 대한 298.15 K 액-액상평형을 tie-line 측정법으로 결정하였다. 이성분계 기-액상평형 데이터는 공비점이 없었으며, $g^E$ 모델식(Margules, van Laar, Wilson, NRTL, UNIQUAC)에 비교적 작은 편차로 잘 상관되었다. 삼성분계 tie-line 데이터는 NRTL식과 UNIQUAC식을 이용하여 상관과 추산을 병행하였으며, Hirata-Fujita식과 Maior-Swenson식을 이용하여 정확도를 검증하였다.

SBS에 기반한 이진 볼륨 데이타의 렌더링 알고리즘 (A Rendering Algorithm for Binary Volume Data based on Slice-based Binary Shell)

  • 김보형;서진욱;신병석;신영길;강흥식
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제27권5호
    • /
    • pp.441-449
    • /
    • 2000
  • 이진 볼륨 데이타(binary volume data)는 외과 수술 시뮬레이션(surgical simulation)이나 컬러 볼륨 렌더링과 같이 그레이-스케일 볼륨(gray-scale volume)을 이용하기에는 부적절한 분야에서 유용 하게 사용된다. 본 논문에서는 이진 볼륨을 효과적으로 표현하기 위해서 새로운 자료구조인 슬라이스 기반 이진 쉘(SBS : Slice-based Binary Shell)을 제안하고, 이 자료구조를 이용한 렌더링 알고리즘도 함께 제시한다. 슬라이스 기반 이진 쉘은 렌더링을 위해 필요한 최소한의 표면 복셀(surface voxel)들을 슬라이스 순으로 저장하고 복셀 좌표의 직접 계산을 가능하게 하기 때문에, 다중 개체(multiple objects)를 포함하고 있는 볼륨을 렌더링할 때 매우 효율적이다. 본 논문에서 제시하고 있는 슬라이스 기반 이진 쉘의 렌더링 알고리즘은 특별한 렌더링 가속 하드웨어가 없는 PC에서 100개 이상의 이진 개체들을 1초 내에 렌더링할 수 있다.

  • PDF

Power Analysis Attacks and Countermeasures on ${\eta}_T$ Pairing over Binary Fields

  • Kim, Tae-Hyun;Takagi, Tsuyoshi;Han, Dong-Guk;Kim, Ho-Won;Lim, Jong-In
    • ETRI Journal
    • /
    • 제30권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.

  • PDF