• 한국지능시스템학회논문지
• /
• 제20권6호
• /
• pp.837-842
• /
• 2010

본 논문에서는 양자암호 시스템의 설계과정에서 필연적으로 사용되는 의사난수들의 비트열들이 다수개 존재하는 현상과 이를 상호 공개된 채널에서 부분정보를 공유해야 하는 상황은 비트열들의 쌍을 노출시킨다. 본고에서는 이러한 의사난수 열의 기본 테스트 과정과 이를 벗어나는 이진 병합 비트열의 난수성에 대하여 살펴본다.

• 전자공학회논문지A
• /
• 제31A권8호
• /
• pp.26-33
• /
• 1994

Optical adders using a modified signed-digit(MSD) number system have been proposed to restrict the carry propagation chain encountered in a conventional binary adder to two positions to the left. But, MSD number system must encode three different states to represent the three possible digits of MSD. In this paper, we propose the design of an optical adder based on 1-bit addition rules by using the method of symbolic substitution (SS). We show that this adder can use binary input which is used by a digital computer, as it is and be implemented by smaller system in size than MSD adder.

• 한국정보통신학회논문지
• /
• 제2권1호
• /
• pp.147-156
• /
• 1998

본 논문에서는 다치 논리를 이용한 연산기를 설계하였다. 다치 논리를 구현하기 위해서 전류모드 CMOS 회로를 이용하였으며 이진 전압모드 신호를 다치 전류모드 신호로 바꾸어 주는 인코더와 연산 결과인 다치 전류모드 신호를 이진 전압모드 신호로 바꾸어 주는 디코오더를 사용하여 기존의 이진 시스템에 적용할 수 있도록 하였으며, 승산기 설계시 부분곱 수를 줄이기 위하여 기존의 Booth 알고리즘을 확장한 4진 SD수 부분곱 발생 알고리즘을 사용하였다. 제안된 회로는 SPICE 시뮬레이션 및 FPGA Chip을 이용한 하드웨어 에뮬레이션으로 그 유효함을 확인하였다

• 천문학회지
• /
• 제25권1호
• /
• pp.47-64
• /
• 1992

Cores of globular clusters are an ideal place for close encounters between stars. The outcome of tidal capture can be stellar mergers, close binaries between normal stars (W UMa type), cataclysmic variables composed of white dwarf and normal star pairs, or low-mass X-ray binaries consisting of a neutron star and a normal star pairs. Stellar mergers can be the origin of blue stragglers in dense globular clusters although they are hard to observe. Low mass X-ray binaries would eventually become binary pulsars with short pulse periods after the neutron stars accrete sufficient amount of matter from the companion. However, large number of recently discovered, isolated millisecond pulsars (as opposed to binary pulsars) in globular clusters may imply that they do not have to gain angular speeds during the X-ray binary phase. We propose that these isolated millisecond pulsars may have formed through the disruptive encounters, which lead to the formation of accretion disk without Roche lobe filling companion, between a neutron star and a main-sequence star. Based on recently developed multicomponent models for the dynamical evolution of globular clusters, we compute the expected numbers of various systems formed by tidal capture as a function of time.

• 산업공학
• /
• 제24권4호
• /
• pp.274-280
• /
• 2011

Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

• 한국통신학회논문지
• /
• 제30권9A호
• /
• pp.795-802
• /
• 2005

바이너리 CDMA(B-CDMA) 기술은 CDMA 신호의 크기를 일정하게 유지시키는 새로운 변조 기법이다. 다중코드CDMA 신호를 일정한 레벨의 신호로 양자화한 후 변조함으로써 B-CDMA 기술은 CDMA 신호가 가지는 장점들을 유지하는 동시에 최대전력 대 평균전력의 비율을 감소시킨다. 본 논문에서는 확산인자가 현저히 작지 않은 가정 하에 B-CDMA시스템의 성능을 다중 경로 페이딩 환경에서 분석한다. 수학적 분석 결과는 컴퓨터 모의실험을 통하여 검증된다.

• Communications for Statistical Applications and Methods
• /
• 제12권1호
• /
• pp.139-147
• /
• 2005

It is interesting to locate homogeneous segments within a DNA sequence. Suppose that the DNA sequence has segments within which the observations follow the same residue frequency distribution, and between which observations have different distributions. In this setting, change points correspond to the end points of these segments. This article explores the use of a binary segmentation procedure in detecting the change points in the DNA sequence. The change points are determined using a sequence of nested hypothesis tests of whether a change point exists. At each test, we compare no change-point model with a single change-point model by using the Bayesian information criterion. Thus, the method circumvents the computational complexity one would normally face in problems with an unknown number of change points. We illustrate the procedure by analyzing the genome of the bacteriophage lambda.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.256-259
• /
• 2003

This paper proposes OPTICAL MARKER fer registering process - one of the 3D measurement process : scan registering - merging - measurement. If the registering work is carried out manually, it can be accompanied with much time and many errors. Because the patterned marker make registering process automatic, many firms use it now. But the physical shape of existing markers is the source of the data loss caused by hiding surface, and the marker arrangement is the source of the time loss. The optical marker proposed in this paper has marker generator, organized a large number of binary coded control laser diode, separate from 3D scan object. So, it does not take much time for the marker disposition, and it is not the origin of the data loss, and the binary coded laser information make the auto-registering possible.

• 산업공학
• /
• 제21권2호
• /
• pp.170-176
• /
• 2008

Consider a multi-floor facility with multiple rooms of unequal size on each floor. Students come from many organizations to attend the conference to be held at this facility. In assigning the rooms to the students, several constraints must be met; such as boys and girls must not be assigned to the rooms on the same floor. Given the capacity of each room and the number of students from each organization, the problem is assigning students to rooms under a set of constraints and various objectives. We present six models with different objective functions; and formulate them as binary integer programming problems. A numerical example and a case study follow to illustrate the proposed models.

• 한국정보처리학회논문지
• /
• 제6권6호
• /
• pp.1511-1519
• /
• 1999

본 논문에서는 LAROB상에서 이진영상을 사진트리로 변환하거나, 사진트리를 이진영상으로 변환하는 효율적인 알고리즘들을 제안한다. 이 알고리즘들은 영상의 화소 개수가 n $\times$ n일 때 n2 프로세서를 사용하며, $\theta$(1)의 시간 복잡도를 갖는다. 실행시간과 프로세서 수의 곱이 최적 순차 알고리즘의 실행시간인 $\theta$(n2)과 동일하므로, 여기서 제안한 알고리즘들은 최적 알고리즘이다.