• Proceedings of the Optical Society of Korea Conference
• /
• 2006.02a
• /
• pp.335-336
• /
• 2006

We propose a method of encryption and decryption of binary data using 2-step phase-shifting digital interferometry. This technique reduces the number of interferograms in the phase-shifting interferometry. The binary data has been expressed with random code and random phase. We remove the dc-term of the phase-shifting digital interferogram to restore the original binary data. Simulation results shows that the proposed technique can be used for binary data encryption and decryption.

• Journal of the Korean Statistical Society
• /
• v.34 no.1
• /
• pp.61-71
• /
• 2005

A class of asymmetric ARCH processes is proposed via binary random power transformations. This class accommodates traditional nonlinear models such as threshold ARCH (Rabemanjara and Zacoian (1993)) and Box-Cox type ARCH models(Higgins and Bera (1992)). Stationarity condition of the model is addressed. Iterative least squares(ILS) and pseudo maximum like-lihood(PML) methods are discussed for estimating parameters and related algorithms are presented. Illustrative analysis for Korea Stock Prices Index (KOSPI) data is conducted.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.5
• /
• pp.501-507
• /
• 2005

This paper proposes a Hybrid Random PWM(HRPWM) technique using a LF2407 DSP board in order to spread the power spectra of an induction motor. The proposed method is composed to the PRBS (Pseudo-Random Binary Sequence) with the Lead-Lag random bit and the random triangular carrier for the logical comparison. Also, a DSP generates the random number, the PRBS and the three-phase reference signal, a MAX038 chip operating as frequency modulator generates the random triangular carrier. For verification of the proposed method, the experiments were conducted with a three-phase adjustable speed a.c drives, and the results of simulations and experiments are presented.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.79-84
• /
• 2003

Likelihood estimation in random-effect models is often complicated because the marginal likelihood involves an analytically intractable integral. Numerical integration such as Gauss-Hermite quadrature is an option, but is generally not recommended when the dimensionality of the integral is high. An alternative is the use of hierarchical likelihood, which avoids such burdensome numerical integration. These two approaches for fitting binary data are compared and the advantages of using the hierarchical likelihood are discussed. Random-effect models for binary outcomes and for bivariate binary-continuous outcomes are considered.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.11-19
• /
• 2008

To enhance the performance of the IEEE 802.16 broadband wireless access system, it is necessary to improve the efficiency of the radio link. The efficiency of the uplink can be improved by using more efficient random access method. As new random access methods, we propose a RA_NBRM method which is based on the number of bandwidth request messages and a RA_CRA method which is based on the conflict resolution algorithm. The simulation results show that the performance of the new methods is superior to that of the existing binary exponential backoff method.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.

• Proceedings of the Optical Society of Korea Conference
• /
• 2001.02a
• /
• pp.62-63
• /
• 2001

We studied a method to use a variable discrete random phase mask in 2-D binary data representation for efficient holographic data storage. The variable phase mask is realized by use of a liquid crystal display.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.1
• /
• pp.187-193
• /
• 2006

This paper shows how to use continuation-ratio logits for the analysis of structured polytomous data. Here, response categories are considered to have a nested binary structure. Thus, conditionally nested binary random variables can be defined in each step. Two types of factors are considered as independent variables affecting response probabilities. For the purpose of analyzing categorical data with binary nested strutures a continuation-ratio mixed model is suggested. Estimation procedure for the unknown parameters in a suggested model is also discussed in detail by an example.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.221-230
• /
• 2002

This paper presents a new moving object segmentation algorithm using markov random field. The algorithm is based on signal detection theory. That is to say, motion of moving object is decided by binary decision rule, and false decision is corrected by markov random field model. The procedure toward complete segmentation consists of two steps: motion detection and object segmentation. First, motion detection decides the presence of motion on velocity vector by binary decision rule. And velocity vector is generated by optical flow. Second, object segmentation cancels noise by Bayes rule. Experimental results demonstrate the efficiency of the presented method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.77-85
• /
• 2002

A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.