• Title/Summary/Keyword: Binary Systems

Search Result 1,167, Processing Time 0.028 seconds

Secure sharing method for a secret binary image and its reconstruction system

  • Lee, Sang-Su;Han, Jong-Wook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1240-1243
    • /
    • 2003
  • In this paper, an encryption method to share a secret binary image is proposed. It divides the image to be encrypted into an arbitrary number of images and encrypts them using XOR process with different binary random images which was prepared by the means of the XOR process, too. Each encrypted slice image can be distributed to the authenticated ones. However, we transfer the encrypted images to the binary phase masks to strengthen the security power, that means phase masks can not be copied with general light-intensity sensitive tools such as CCDs or cameras. For decryption, we used the Mach-Zehnder interferometer in which linearly polarized two light beams in orthogonal direction, respectively. The experimental result proved the efficiency of the proposed method.

  • PDF

A Study for Global Optimization Using Dynamic Encoding Algorithm for Searches

  • Kim, Nam-Geun;Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.857-862
    • /
    • 2004
  • This paper analyzes properties of the recently developed nonlinear optimization method, Dynamic Encoding Algorithm for Searches (DEAS) [1]. DEAS locates local minima with binary strings (or binary matrices for multi-dimensional problems) by iterating the two operators; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., zero or one), while UDS performs increment or decrement to binary strings with no change of string length. Owing to these search routines, DEAS retains the optimization capability that combines the special features of several conventional optimization methods. In this paper, a special feature of BSS and UDS in DEAS is analyzed. In addition, a effective global search strategy is established by using information of DEAS. Effectiveness of the proposed global search strategy is validated through the well-known benchmark functions.

  • PDF

Two Step Binary Exponential Search Algorithm, for Rapid UWB Timing Acquisition (UWB 신호의 빠른 동기 획득을 위한 두 단계 Binary Exponential 탐색 알고리즘)

  • Lee, Nam-Ki;Choi, Hui-Chul;Park, Sung-Kwon
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.285-288
    • /
    • 2005
  • In this paper, we propose a two step Binary Exponential search algorithm for rapid acquisition time of UWB(Ultra Wide Band) signal on UWB communication systems. Previous proposed timing acquisition algorithm is searching whole frame that consist of the number of n Bins to terminate search, however this paper proposed two step Binary Exponential search algorithm can achieve remarkable reduction of UWB signal acquisition time as limiting search group. Proposed search algorithm is consisting of search group establishment step and Bit Reversing of search group establishment step.

  • PDF

A CCD Photometric Study of Close Binary V445 Cep

  • Oh, Kyu-Dong;Kim, Ho-Il;Sung, Eon-Chang
    • Journal of Astronomy and Space Sciences
    • /
    • v.27 no.2
    • /
    • pp.69-74
    • /
    • 2010
  • We present new BVR CCD photometric light curves for the close binary star V445 Cep. A new photometric solution and absolute physical dimensions of the system were derived by applying the Wilson-Devinney program to our observed light curves and radial velocity curves published by Pych et al. The evolutional status of V445 Cep was found to coincide with those of the general low mass ratio contact binary systems.

Binary clustering network for recognition of keywords in continuous speech (연속음성중 키워드(Keyword) 인식을 위한 Binary Clustering Network)

  • 최관선;한민홍
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.870-876
    • /
    • 1993
  • This paper presents a binary clustering network (BCN) and a heuristic algorithm to detect pitch for recognition of keywords in continuous speech. In order to classify nonlinear patterns, BCN separates patterns into binary clusters hierarchically and links same patterns at root level by using the supervised learning and the unsupervised learning. BCN has many desirable properties such as flexibility of dynamic structure, high classification accuracy, short learning time, and short recall time. Pitch Detection algorithm is a heuristic model that can solve the difficulties such as scaling invariance, time warping, time-shift invariance, and redundance. This recognition algorithm has shown recognition rates as high as 95% for speaker-dependent as well as multispeaker-dependent tests.

  • PDF

Experimental Investigation of Collision Mechanisms Between Binary Droplet of Fuel Jet (연료 제트의 두 액적간의 충돌기구에 관한 실험적 연구)

  • Lee, Keun-Hee;Kim, Sa-Yop;Lee, Chang-Sik
    • Journal of ILASS-Korea
    • /
    • v.13 no.4
    • /
    • pp.187-192
    • /
    • 2008
  • In this study, the mechanisms of binary droplet collision were studied with diesel, ethanol and purified water. The droplet collisions of liquid droplet have been investigated for the same droplet diameter. In order to obtain the digital images of the droplet collision behavior, the experimental equipment was composed of the droplet generating system and the droplet visualization system. The droplets were produced by the vibrating orifice monodisperse generator. The visualization system consisted of a long distance microscope, a light source, and a high speed camera. The outcomes of binary droplet collision can be divided into four regimes, bouncing, coalescence, reflexive separation and stretching separation. The impact angle and the relative velocity of binary droplet are main parameters of collision phenomena, so the transition mechanism of droplet collision can be divided by the impact parameter.

  • PDF

ALMA observations of a proto-binary system, IRAS 04191+1523

  • Lee, Jeong-Eun;Lee, Seokho;Yoon, Sung-Yong;Dunham, Michael;Evans, Neal;Choi, Minho;Tatematsu, Ken;Bergin, Edwin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.2
    • /
    • pp.46.4-47
    • /
    • 2016
  • About 50% of stars reside in binary or multiple systems. However, the formation mechanism of the multiplicity is poorly understood. Theoretical studies suggest two main mechanisms for the multiplicity: turbulent fragmentation and disk fragmentation. We can testify which mechanism is more plausible by measuring the separation between companions or the alignment of stellar spins. Here we present our ALMA Cycle 2 observational results of a proto-binary system, IRAS 04191+1523, which consists of two Class I sources. We detected disks around both Class I sources, which are located in a common dense filamentary structure traced by $C^{18}O$ J=2-1. Two protostellar disks are separated by ~900 AU and their rotational axes are almost perpendicular, which strongly support that this binary system formed by the turbulent fragmentation.

  • PDF

Performance Comparison of Constant Amplitude Multicode Systems (멀티코드에서 고정진폭을 구현하기 위한 방식들의 성능 비교)

  • Seo Gun-Jong;Kim Yong-Cheol
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2003.08a
    • /
    • pp.7-9
    • /
    • 2003
  • 멀티코드 CDMA 시스템은 비선형성 전력증폭기의 왜곡에 의해 영향을 많이 받는다. 이런 현상을 방지하기 위해서 멀티코드에서 전송신호의 레벨을 일정하게 하는 방법으로 프리코딩 방법과 Binary CDMA 방법이 제안되었다. 프리코딩은 정보 비트에 여유비트를 추가하여 코드간 직교성의 손실 없이 전송신호의 진폭을 일정하게 하는 방식으로 Wada 의 방법과 CS-CDMA 방법이 있다. Binary CDMA 시스템은 멀티레벨 신호를 이진 클리핑하여 전송하는 방법으로서, 클리핑에 의해 신호의 직교성이 감소하여 성능이 저하될 수 있다. 상관도 평활화 방법은 수신부의 상관도 값이 고르게 분포하도록 하여 Binary CDMA 의 성능을 향상시키는 방법이다. 본 논문 에서는 프리코딩 방식과 상관도 평활화를 적용한 Binary CDMA 방식을 소개하고 칩당 비트전송율과 BER 성능을 비교한다.

  • PDF

Deterministic Bipolar Compressed Sensing Matrices from Binary Sequence Family

  • Lu, Cunbo;Chen, Wengu;Xu, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2497-2517
    • /
    • 2020
  • For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

Target Measurement Error Reduction Technique of Suboptimal Binary Integration Radar (부 최적 이진누적 적용 레이더의 표적 측정오차 감소 기법)

  • Nam, Chang-Ho;Choi, Seong-Hee;Ra, Sung-Woong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.65-72
    • /
    • 2011
  • A binary integration is one of sub-optimal pulse integration which decides detection based on discriminating m successful detections out of n trials in radar systems using multiple pulse repetition frequencies. This paper introduces target measurement error reduction technique to reduce azimuth errors in suboptimal binary integration radar which applies the near value by m rather than the optimal m and verifies the performance by analyzing the experimental data measured from real radar.