• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.837-842
• /
• 2010

In this paper, quantum cryptography systems used in the design process inevitably open bit stream of pseudo-random number that exists multiple open channels between them and the need to share information on the part of the situation exposes a pair of bit stream. In this paper, the base test of pseudo-random number I tested out this process and the merge bit binary column look out for randomness.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.147-156
• /
• 1998

In this paper, an arithmetic processor using multi-valued logic is designed. For implementing of multi-valued logic circuits, we use current-mode CMOS circuits and design encoder which change binary voltage-mode signals to multi-valued current-mode signals and decoder which change results of arithmetic to binary voltage-mode signals. To reduce the number of partial product we use 4-radix SD number partial product generation algorithm that is an extension of the modified Booth's algorithm. We demonstrate the effectiveness of the proposed arithmetic circuits through SPICE simulation and Hardware emulation using FPGA chip.

• Journal of The Korean Astronomical Society
• /
• v.25 no.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.

• IE interfaces
• /
• v.24 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.795-802
• /
• 2005

Binary CDMA(B-CDMA) is a new modulation scheme that employs a constant envelope modulation scheme By quantizing the envelope of multi-codes CDMA signal into a small number of levels, the B-CDMA can reduce the peak-to-average power ratio, while preserving the advantages of CDMA signaling such as the soft capacity and robustness to interference. In this paper, we analyze the performance of B-CDMA systems in multi-path channel assuming that the spreading factor is not too small. Finally, the analytic results are verified by computer simulation.

• Communications for Statistical Applications and Methods
• /
• v.12 no.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.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• 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.

• IE interfaces
• /
• v.21 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1511-1519
• /
• 1999

We present efficient algorithms for transforming between binary images and quadtrees on the LABOR. For a binary image of size n ${\times}$ n, both algorithms run in $\theta$(1) time using n2 processors. These algorithms are optimal in the sense that the product of time and number of processors is asymptotically the same as the optimal sequential time which is $\theta$(n2).