• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.489-492
• /
• 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 twisted nematic liquid crystal display.

• 전기의세계
• /
• v.19 no.6
• /
• pp.1-7
• /
• 1970

In this paper, to determine process dynamic characteristics, the correlation method for measuring the impulse response of process using a pseudo-random binary signal as the test signal instead of white noise was studied. The error caused by using the signal of Mesquence signal generator which was built up by the authors was analysed. Experments were performed on the 1st and 2nd order lag systems and the results were in good coincidence with theoretical values. It is expected that applying these results, it may be possible to develop a continuous measuring method adaptable to modern control systems.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.321-324
• /
• 2000

In this paper, we proposed a new visual cryptography scheme based on optical interference which improves the contrast and SNR of reconstructed images comparing with conventional visual cryptography method. We divided an binary image to be encrypted into n slides. To encrypt them, (n-1) random independent keys and one another random key by XOR process between four random keys were prepared. XOR between each divided image and each random key makes encrypted n encrypted images. From these images, encrypted binary phase masks can be made. For decryption all of phase masks should be placed together in the interferometer such as Mach-Zehnder interferometer.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1554-1574
• /
• 2017

This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classification depends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that it presents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also consider the relationship of these kinds of PRS's to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FI PRS's can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FI PRS's also have maximum Shannon entropy, while sequences from LFSR's do not, nor are such sequences FI random.

• Journal of the Korea Society for Simulation
• /
• v.32 no.1
• /
• pp.23-34
• /
• 2023

The purpose of this paper is to review global stochastic optimization algorithms(GSOA) in case binary response experimentation is used and to compare the performances of them. GSOAs utilise estimator of probability of success $\^p$ instead of population probability of success p, since p is unknown and only known by its estimator which has stochastic characteristics. Hill climbing algorithm algorithm, simple random search, random search with random restart, random optimization, simulated annealing and particle swarm algorithm as a population based algorithm are considered as global stochastic optimization algorithms. For the purpose of comparing the algorithms, two types of test functions(one is simple uni-modal the other is complex multi-modal) are proposed and Monte Carlo simulation study is done to measure the performances of the algorithms. All algorithms show similar performances for simple test function. Less greedy algorithms such as Random optimization with Random Restart and Simulated Annealing, Particle Swarm Optimization(PSO) based on population show much better performances for complex multi-modal function.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.203-210
• /
• 2001

To estimate relational models and test the theoretical hypotheses of binary tree search algorithms, we built binary search trees with random permutations of n (number of nodes) distinct numbers, which ranged from three to seven. Probabilities for building binary search trees corresponding to each possible height and balance factor were estimated. Regression models with variables of number of nodes, height, and average number of comparisons were estimated and the theorem of O(1g(n)) was accepted experimentally by a Lack of Test procedure. Analysis of Variance model was applied to compare the average number of comparisons with three groups by height and balance factor of the trees to test theoretical hypotheses of a binary search tree performance statistically.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.8-17
• /
• 2014

In this research, we employed various data mining techniques to build predictive models for win-loss prediction in Korean professional baseball games. The historical data containing information about players and teams was obtained from the official materials that are provided by the KBO website. Using the collected raw data, we additionally prepared two more types of dataset, which are in ratio and binary format respectively. Dividing away-team's records by the records of the corresponding home-team generated the ratio dataset, while the binary dataset was obtained by comparing the record values. We applied seven classification techniques to three (raw, ratio, and binary) datasets. The employed data mining techniques are decision tree, random forest, logistic regression, neural network, support vector machine, linear discriminant analysis, and quadratic discriminant analysis. Among 21(= 3 datasets${\times}$7 techniques) prediction scenarios, the most accurate model was obtained from the random forest technique based on the binary dataset, which prediction accuracy was 84.14%. It was also observed that using the ratio and the binary dataset helped to build better prediction models than using the raw data. From the capability of variable selection in decision tree, random forest, and stepwise logistic regression, we found that annual salary, earned run, strikeout, pitcher's winning percentage, and four balls are important winning factors of a game. This research is distinct from existing studies in that we used three different types of data and various data mining techniques for win-loss prediction in Korean professional baseball games.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.703-713
• /
• 2002

In longitudinal studies, outcomes are repeatedly measured over time for each subject. It is common to have missing values or dropouts for longitudinal data. In this study time trend in longitudinal data with dropouts is of concern. The confounding of time trend with dropout process is investigated through simulation studies. Some simulation results are reported for binary responses as well as continuous responses with patterns of dropouts varying. It has been found that time trend is not confounded with random dropout process for binary responses when it is estimated using GEE.

• The Journal of the Korea Contents Association
• /
• v.10 no.5
• /
• pp.210-219
• /
• 2010

Consumers differ in both horizontally and vertically. Market segmentation aims to divide horizontally different (or heterogeneous) consumers into more similar (or homogeneous) small segments. A specific consumer, however, may differ in vertically. He (or she) may belong to a different market segment from another one where he (or she) belonged to before. In consumer panel data, the vertical difference can be observed by his (or her) choice among brand alternatives are changing over time. The consumer's vertical difference has been defined as 'dynamics'. In this research, we have developed a binary probit model with random-walk coefficients to capture the consumer's dynamics. With an application to a consumer panel data, we have examined how have the random-walk coefficients changed over time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.1
• /
• pp.29-35
• /
• 2003

In this paper, we propose an improved image decryption system using a phase-encoded image and the principle of interference. An original image and a random image consist of only binary values. The phase-encoded original image is encrypted into a binary phase-only image by multiplying with a phase-encoded random key. Therefore the phase-encoded images have two phase values 0 or $\pi$. The proposed decryption technique is simply performed by interfering between a reference wave and a direct pixel-to-pixel mapping of the encrypted image with a decrypting key. Optical experiments confirmed that the proposed technique is a simple and robust architecture for optical encryption.