• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.152-156
• /
• 2017

This paper introduces the concept of random security amplification to amplify security in a quantum key distribution system. It seems to provide security amplification using the relationship between quantum error correction and security. In addition;we show that random security amplification in terms of security amplification offers better security than using existing universal hash function. We explain how the universal hash function enhances security using the BB84 protocol, which is a typical example of QKD. Finally, the proposed random security amplification and the conventional scheme compare the security according to the key generation rate in the quantum QKD.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.8
• /
• pp.1056-1061
• /
• 2000

Particles existing in a hard disk drive are known as a major source of TA(thermal asperity). Researchers have investigated how particles induce the TA phenomena, but have not verified yet the reason why and how particles are generated in a HDD. The objective of this study is to investigate why and how particles are generated, and in what condition, the largest number of particles is generated. The number of particles generated in a HDD was measured over the landing zone after various rest times of slider and during various motions and positions of slider. It is found that the large number of particles was generated when the HDD was turned on after a long rest time of slider and that a few of particles were continuously generated when the slider flied over the disk surface. It is thought that the number of particles generated in a HDD was related to the rest time of slider because the rest time of slider increased stiction, and that there were intermittent contacts between the slider and the disk surface when the slider flied over the disk surface.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.891-902
• /
• 2004

Membership changing is deeply associated with scalability problem for group key management. If members of the group join or leave, new group key has to be geneerated and distributed to all remaining members of group. Group key changing is perform for group controller. The following parameters are important evaluating criteria of multicast key management scheme that generate and deliver new keys for rekeying: the number of keys stored by both controller and member, messages to deliver, keys to initially be delivered by controller, blocking capability of collusion attacks, messages to deliver at the batch rekeyng. Batch rekeying can reduce messages to deliver and operation costs of generation for message rather than removing members sequentially in fashion one after another. We propose efficient batch rekeying scheme applicable to Pegueroles scheme using random number and prove to be a efficient group key scheme for enhanced Pegueroles model with batch rekeying capability.

• Wind and Structures
• /
• v.10 no.6
• /
• pp.511-532
• /
• 2007

The present study aims to generate turbulent inflow data to more accurately represent the turbulent flow around a square cylinder when the inflow turbulence level is significant. The modified random flow generation (RFG) technique in conjunction with a previously developed LES code is successfully adopted into a finite element based fluid flow solver to generate the required inflow turbulence boundary conditions for the three-dimensional (3-D) LES computations of transitional turbulent flow around a square cylinder at Reynolds number of 22,000. The near wall region is modelled without using wall approximate conditions and a wall damping coefficient is introduced into the calculation of sub-grid length scale in the boundary layer of the cylinder wall. The numerical results obtained from simulations are compared with each other and with the experimental data for different inflow turbulence boundary conditions in order to discuss the issues such as the synthetic inflow turbulence effects on the 3-D transitional flow behaviour in the near wake and the free shear layer, the basic mechanism by which stream turbulence interacts with the mean flow over the cylinder body and the prediction of integral flow parameters. The comparison among the LES results with and without inflow turbulence and the experimental data emphasizes that the turbulent inflow data generated by the present RFG technique for the LES computation can be a viable approach in accurately predicting the effects of inflow turbulence on the near wake turbulent flow characteristics around a bluff body.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.712-716
• /
• 2008

In this paper, we introduce a way to generate and control the serial music using stochastical tools. A serialism, which is one of composition techniques in the 20th century modern music, is composed using uniformly distributed notes or durations. To conserve this property, we design the optimization process to generate the random numbers which can be used to compose the serial music. The optimization are designed using chi-square test and auto-correlation test. User can also apply the additional constraint to the objective function for controlling the serial music. Using the our method, we can compose and control the traditional serial music automatically.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.4
• /
• pp.263-269
• /
• 2015

Digital watermarking is imperceptible and statistically undetectable information embeds into digital data. Most information in digital audio watermarking schemes have used binary random sequences. The embedded binary random sequence distorts and modifies the original data while it plays a vital role in security. In this paper, a binary random sequence to improve imperceptibility in perceptual region of the human auditory system is proposed. The basic idea of this work is a modification of a binary random sequence according to the frequency analysis of adjacent binary digits that have different signs in the sequence. The canonical signed digit code (CSDC) is also applied to modify a general binary random sequence and the pair-matching function between original and its modified version. In our experiment, frequency characteristics of the proposed binary random sequence was evaluated and analyzed by Bark scale representation of frequency and frequency gains.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1484-1490
• /
• 2007

The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

• Journal of Korea Water Resources Association
• /
• v.35 no.3
• /
• pp.275-284
• /
• 2002

In this study, a method of random resampling of residuals from stochastic models such as the Monte-Carlo model, the lag-one autoregressive model(AR(1)) and the periodic lag-one autoregressive model(PAR(1)), has been adopted to generate a large number of long traces of annual and monthly steamflows. Main advantage of this resampling scheme called the Bootstrap method is that it does not rely on the assumption of population distribution. The Bootstrap is a method for estimating the statistical distribution by resampling the data. When the data are a random sample from a distribution, the Bootstrap method can be implemented (among other ways) by sampling the data randomly with replacement. This procedure has been applied to the Yongdam site to check the performance of Bootstrap method for the streamflow generation. and then the statistics between the historical and generated streamflows have been computed and compared. It has been shown that both the conventional and Bootstrap methods for the generation reproduce fairly well the mean, standard deviation, and serial correlation, but the Bootstrap technique reproduces the skewness better than the conventional ones. Thus, it has been noted that the Bootstrap method might be more appropriate for the preservation of skewness.

• The Korean Journal of Applied Statistics
• /
• v.34 no.2
• /
• pp.153-166
• /
• 2021

A main goal of pharmacogenomics studies is to predict individual's drug responsiveness based on high dimensional genetic variables. Due to a large number of variables, feature selection is required in order to reduce the number of variables. The selected features are used to construct a predictive model using machine learning algorithms. In the present study, we applied several hybrid feature selection methods such as combinations of logistic regression, ReliefF, TurF, random forest, and LASSO to a next generation sequencing data set of 400 epilepsy patients. We then applied the selected features to machine learning methods including random forest, gradient boosting, and support vector machine as well as a stacking ensemble method. Our results showed that the stacking model with a hybrid feature selection of random forest and ReliefF performs better than with other combinations of approaches. Based on a 5-fold cross validation partition, the mean test accuracy value of the best model was 0.727 and the mean test AUC value of the best model was 0.761. It also appeared that the stacking models outperform than single machine learning predictive models when using the same selected features.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.840-848
• /
• 2009

This paper proposes a new multi-start scheme that generates guided random bits in selecting initial search points for global optimization with univariate dynamic encoding algorithm for searches (uDEAS). The proposed method counts the number of 1 in each bit position from all the previously generated initial search matrices and, based on this information, generates 0 in proportion with the probability of selecting 1. This rule is simple and effective for improving diversity of initial search points. The performance improvement of the proposed multi-start is validated through implementation in uDEAS and function optimization experiments.