• Earthquakes and Structures
• /
• v.14 no.5
• /
• pp.389-398
• /
• 2018

The seismic isolation system makes a structure isolated from ground motions to protect the structure from seismic events. Seismic isolation techniques have been implemented in full-scale buildings and bridges because of their simplicity, economic effectiveness, inherent stability and reliability. As for the responses of an isolated structure due to seismic events, it is well known that the most uncertain aspects are the seismic loading itself and structural properties. Due to the randomness of earthquakes and uncertainty of structures, seismic response distributions of an isolated structure are needed when evaluating the seismic fragility assessment (or probabilistic seismic safety assessment) of an isolated structure. Seismic response time histories are useful and often essential elements in its design or evaluation stage. Thus, a large number of non-linear dynamic analyses should be performed to evaluate the seismic performance of an isolated structure. However, it is a monumental task to gather the design or evaluation information of the isolated structure from too many seismic analyses, which is impractical. In this paper, a new methodology that can evaluate the seismic fragility assessment of an isolated structure is proposed by using stochastic response database, which is a device that can estimate the seismic response distributions of an isolated structure without any seismic response analyses. The seismic fragility assessment of the isolated nuclear power plant is performed using the proposed methodology. The proposed methodology is able to evaluate the seismic performance of isolated structures effectively and reduce the computational efforts tremendously.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.3
• /
• pp.23-36
• /
• 2016

We consider a model that minimizes the total cost incurred by assigning available weapons to existing targets in order to reduce enemy threats, which is called the weapon target assignment problem (WTAP). This study addresses the stochastic versions of WTAP, in which data, such as the probability of destroying a target, are given randomly (i.e., data are identified with certain probability distributions). For each type of random data or parameter, we provide a stochastic optimization model on the basis of the expected value or scenario enumeration. In particular, when the probabilities of destroying targets depending on weapons are stochastic, we present a stochastic programming formulation with a simple recourse. We show that the stochastic model can be transformed into a deterministic equivalent mixed integer programming model under a certain discrete probability distribution of randomness. We solve the stochastic model to obtain an optimal solution via the mixed integer programming model and compare this solution with that of the deterministic model.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.2 no.1
• /
• pp.30-37
• /
• 1999

Transmissivity and the signal loss in soil are computed. An electric field expression for the inhomogeneous complex media modelled by two layers is shown as an integral form. Volume scattering occurs in inhomogeneous media, and iterative Born approximation is used to analyze this scattering effect. The degree of randomness is controlled by specifying the variance and correlation length. Expression for the transmissivity and the signal loss is presented as the parameter of soil moisture contents, soil particle radius, temperature and frequency. The analysis shows that big deviation in signal loss depends on the temperature variation remarkably and the physical reason of unusual level is explained.

• International Journal of Highway Engineering
• /
• v.20 no.2
• /
• pp.119-126
• /
• 2018

PURPOSES : The purpose of this study is to develop a crash prediction model at signalized intersections, which can capture the randomness and uncertainty of traffic accident forecasting in order to provide more precise results. METHODS : The authors propose a random parameter (RP) approach to overcome the limitation of the Count model that cannot consider the heterogeneity of the assigned locations or road sections. For the model's development, 55 intersections located in the Daejeon metropolitan area were selected as the scope of the study, and panel data such as the number of crashes, traffic volume, and intersection geometry at each intersection were collected for the analysis. RESULTS : Based on the results of the RP negative binomial crash prediction model developed in this study, it was found that the independent variables such as the log form of average annual traffic volume, presence or absence of left-turn lanes on major roads, presence or absence of right-turn lanes on minor roads, and the number of crosswalks were statistically significant random parameters, and this showed that the variables have a heterogeneous influence on individual intersections. CONCLUSIONS : It was found that the RP model had a better fit to the data than the fixed parameters (FP) model since the RP model reflects the heterogeneity of the individual observations and captures the inconsistent and biased effects.

• Convergence Security Journal
• /
• v.5 no.3
• /
• pp.23-32
• /
• 2005

This paper presents a 128-bit Reversible Cellular Automata (RCA) based lightweight block cipher for Ubiquitous computing security. To satisfy resource-constraints for Ubiquitous computing, it is designed as block architecture based on Cellular Automata with high pseudo-randomness. Our implementation requires 704 clock cycles and consumes 2,874 gates for encryption of a 128-bit data block. In conclusion, the processing time outperformed that of AES and NTRU by 31%, and the number of gate was saved by 20%. We evaluate robustness of our implementation against both Differential Cryptanalysis and Strict Avalanche Criterion.

• Fibers and Polymers
• /
• v.4 no.1
• /
• pp.20-26
• /
• 2003

The thermal behavior, morphology, ester-interchange reaction of Poly(trimethylene terephthalate) (PTT)/poly(ethylene terephthalate) (PET) melt blends were investigated over the whole composition range(xPTT/(1-x)PET) using a twinscrew Brabender. The melt blends were analyzed by differential scanning calorimetry (DSC), nuclear magnetic resonance spectroscopy ($^{13}{C-NMR}$), and scanning electron microscopy (SEM). Single glass transition temperature ($T_g$) and cold crystallization temperature ($T_cc$) were observed in all melt blends. Melt blends were found to be due to the ester-interchange reaction in PTT/PET blend. Also the randomness of copolymer increases because transesterification between PT and PET increases with increasing blending time This reaction increases homogeneity of the blends and decreases the degree of crystallinity of the melt blends. In PTT-rich blends, mechanical properties decrease with increase of PET content compared with that of pure PTT. And, in PET-rich blends, tensile modulus decreases with increase of PTT content, but tensile strength and elongation is similar to that of pure PET.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.287-290
• /
• 1989

Single-phase $YBa_2Cu_3O_{j-g}$ (YBC) ceramic samples were annealed at $700^{\circ}C$ under a flowing $O_2$ atmosphere for 0, 18, 36, 54 and 72. hours after sintering. The resistivities(p) and the critical current densities($J_c$) of the samples were measured in a temperature range 77 to 300 K by a four probe method, using silver paint contacts. The variations of the electrical properties with annealing time are explained in terms of flux pinning, percolation probability and randomness, and alignment of grains and twins.The anomalous increases in $J_c$ and $T_c$ observed in sample annealed for a relatively long time possibly due to alignment of grains and twins, may imply the occurrence of superconducting glass state in high-$T_c$ superconducting ceramic.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.538-543
• /
• 2009

A wiretap channel I is one of the channel models that was proved to achieve unconditional security. However, it has been an open problem in realizing such a channel model in a practical network environment. The paper is committed to solve the open problem by introducing a novel approach for building wiretap channel I in which the eavesdropper sees a binary symmetric channel (BSC) with error probability p while themain channel is error free. By taking advantage of the feedback and low density parity check (LDPC) codes, our scheme adds randomness to the feedback signals from the destination for keeping an eavesdropper ignorant; on the other hand, redundancy is added and encoded by the LDPC codes such that a legitimate receiver can correctly receive and decode the signals. With the proposed approach, unconditionallysecure communication can be achieved through interactive communications, in which the legitimate partner can realize the secret information transmission without a pre-shared secret key even if the eavesdropper has better channel from the beginning.

• Convergence Security Journal
• /
• v.20 no.2
• /
• pp.69-76
• /
• 2020

Blockchain 2.0 supports programmable smart contract for the various distributed application. However, the environment of running smart contract is limited in the blockchain, so the smart contract only get the deterministic information, such as block height, block hash, and so on. Therefore, some applications, which requires random information, such as lottery or batting, should use oracle service that supply the information outside of blockchain. This paper develops a random number generator oracle service. The random number generator oracle service use irregular big data as entropy source. This paper tests the randomness of bits sequence generated from oracle service using NIST SP800-22. This paper also describes the advantages of irregular big data in our model in perspective of cost comparing hardware entropy source.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.343-350
• /
• 2014

Divisive hierarchical clustering algorithms iterate the process of decomposition and clustering data recursively. In each recursive call, data in each cluster are arbitrarily selected and thus, the total clustering time can be increased, which causes a problem that it is difficult to apply the process of clustering neighbor vehicular position data in vehicular localization. In this paper, we propose a new heuristic algorithm for speeding up the clustering time by eliminating randomness of the selected data in the process of generating the initial divisive clusters.