• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.32 no.3
• /
• pp.147-160
• /
• 2020

A stochastic probabilistic model for harbor structures such as rubble-mound breakwater has been formulated by using the generalized Wiener process considering the nonlinearity of damage drift and its nonlinear uncertainty, by which the damage path with real-time can be tracked, the residual useful lifetime at some age can also be analyzed properly. The formulated stochastic model can easily calculate the probability of failure with the passage of time through the probability density function of cumulative damage. In particular, the probability density functions of residual useful lifetime of the existing harbor structures can be derived, which can take into account the current age, its present damage state and the future damage process to be occurred. By using the maximum likelihood method and the least square method together, the involved parameters in the stochastic model can be estimated. In the calibration of the stochastic model presented in this paper, the present results are very well similar with the results of MCS about tracking of the damage paths as well as evaluating of the density functions of the cumulative damage and the residual useful lifetime. MTTF and MRL are also evaluated exactly. Meanwhile, the stochastic probabilistic model has been applied to the rubble-mound breakwater. The related parameters can be estimated by using the experimental data of the cumulative damages of armor units measured as a function of time. The theoretical results about the probability density function of cumulative damage and the probability of failure are very well agreed with MCS results such that the density functions of the cumulative damage tend to move to rightward and the amounts of its uncertainty are increased as the elapsed time goes on. Thus, the probabilities of failure with the elapsed time are also increased sharply. Finally, the behaviors of residual useful lifetime have been investigated with the elapsed age. It is concluded for rubble-mound breakwaters that the probability density functions of residual useful lifetime tends to have a longer tail in the right side rather than the left side because of the gradual increases of cumulative damage of armor units. Therefore, its MRLs are sharply decreased after some age. In this paper, the special attentions are paid to the relationship of MTTF and MRL and the elapsed age of the existing structure. In spite of that the sum of the elapsed age and MRL must be equal to MTTF deterministically, the large difference has been shown as the elapsed age is increased which is due to the uncertainty of cumulative damage to be occurred in the future.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.40 no.4
• /
• pp.247-254
• /
• 2004

The mesh selectivity of the drum net fish trap for elkhorn sculpin(Alcichthys alcicornis) in the estern sea of Korea was described. The selection curve for the elkhorn sculpin caught from the experiments between June 2003 and December 2003 was by SELECT(Share Each Length Class's Catch Total)model and by Kitahaa's method to a polynomial equation and two parameter logistic selection curve. The selection curve by SELECT model showed to be equal probability of entrance of the elkhorn sculpin in the large(55mm) and small(20mm) mesh traps by minimum AIC (Akaike Information Criteria). The equation of selectivity curve obtained by Kitahara's method using a logistic function with least square method was $s(R)\;=\;\frac{1}{1+exp(-0.3545R+2.141)$, where R=1/m, and/and m are total length and mesh size, respectively. The mesh selectivity curve showed that the current regulated mesh size(35mm) for the trap was corresponded to 21.4cm in the $L_{50}$of the selection curve for the elkhorn sculpin.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.10
• /
• pp.14-27
• /
• 2009

Polar Code was proposed by Turkish professor Erdal Arikan in 2006 as an idea that splitted input channel is increasing the cutoff rate. The channel polarization consisted of code sequences with symmetric high rate capacity in a given B-DMC(Binary-input Discrete Memoryless Channel) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. The channel polarization is said to a set of given N independent outputs of B-DMC W. In other word, N increases when N is a set of binary-input channels {$W^{(i)}_N\;:\;1{\leq}\;i\;{\leq}\;N$}, in I{WN(i)} as the fraction of indices is near to 1, which is approaching to I(W), and it is near to 0, then to 1-I(W), where I(W) presents high rates in reliable wireless communication channel as inputs of W with equal frequences. After all, {WN(i)} is shown to be a state of channel coding. On the based on this Polar codes, this paper analyzes Polar coding and decoding of Arikan and propose Radix4 Polar coding newly.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.490-500
• /
• 2004

In mobile/wireless environment, mobility management is widely being focused as one popular researches. But, disruption happens when messages are exchanged between nodes as registration is made after handoff, and unnecessary traffic occurs because of the use of the Random-walk model, in which the probability for MN to move to neighboring cells is equal. In order to solve these problems, this study proposes a technique and algorithm for composing Directional Shadow Registration Region (DSRR) that provides seamless mobility. The core of DSRR is to prevent disruption and unnecessary traffic by minimizing the number o) neighboring cells with a high probability of handoff (AAAF). This study sensed the optimal time for handoff through regional cell division by introducing a division scheme, and then decided DSRR, the region for shadow registration, by applying direction vector (DV) obtained through directional cell sectoring. According to the result of the experiment, the proposed DSRR processes message exchange between nodes within the intra-domain, the frequency of disruptions decreased significantly compared to that in previous researches that process in inter-domain environment. In addition, traffic that occurs at every handoff happened twice in DSRR compared to n (the number of neighboring cells) times in Previous researches. As an additional effect, divided regions obtained from the process of composing DSRR filter MN that moves regardless of handoff.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.16-23
• /
• 2009

In this paper, we propose a new distributed Alamouti space-time block coding scheme using cooperative relay system composed of one source node, three relay nodes and one destination node. The source node is assumed to be equipped with two antennas which respectively use a 2-beam array to communicate with two nodes selected from the three relay nodes. During the first time slot, the two signals which respectively were transmitted by one antenna at the source, are selected by one relay node, added, amplified, and forwarded to the destination. During the second time slot, the other two relay nodes implement the conjugate and minusconjugate operations to the two received signals, respectively, each in turn is amplified and forwarded to the destination node. This transmission scheme represents a new distributed Alamouti space-time block code that can be constructed at the relay-destination channel. Through an equivalent matrix expression of symbols, we analyze the performance of this proposed space-time block code in terms of the chernoff upper bound pairwise error probability (PEP). In addition, we evaluate the effect of the coefficient $\alpha$ ($0{\leq}{\alpha}{\leq}1$) determined by power allocation between the two antennas at the source on the received signal performance. Through computer simulation, we show that the received signals at the three relays have same variance only when the value of $\alpha$ is equal to $\frac{2}{3}$, as a consequence, a better performance is obtained at the destination. These analysis results show that the proposed scheme outperforms conventional proposed schemes in terms of diversity gain, PEP and the complexity of relay nodes.

• Survey Research
• /
• v.7 no.2
• /
• pp.53-69
• /
• 2006

Weights can be made and imposed in both sample design stage and analysis stage in a sample survey. While in design stage weights are related with sample data acquisition quantities such as sample selection probability and response rate, in analysis stage weights are connected with external quantities, for instance population quantities and some auxiliary information. The final weight is the product of all weights in both stage. In the present paper, we focus on the weight in analysis stage and investigate the effect of such weights imposed on the weighted mean when estimating the population mean. We consider a finite population with a pair of fixed survey value and weight in each unit, and suppose equal selection probability designs. Under the condition we derive the formulas of the bias as well as mean square error of the weighted mean and show that the weighted mean is biased and the direction and amount of the bias can be explained by the correlation between survey variate and weight: if the correlation coefficient is positive, then the weighted mein over-estimates the population mean, on the other hand, if negative, then under-estimates. Also the magnitude of bias is getting larger when the correlation coefficient is getting greater. In addition to theoretical derivation about the weighted mean, we conduct a simulation study to show quantities of the bias and mean square errors numerically. In the simulation, nine weights having correlation coefficient with survey variate from -0.2 to 0.6 are generated and four sample sizes from 100 to 400 are considered and then biases and mean square errors are calculated in each case. As a result, in the case or 400 sample size and 0.55 correlation coefficient, the amount or squared bias of the weighted mean occupies up to 82% among mean square error, which says the weighted mean might be biased very seriously in some cases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.842-849
• /
• 2000

In this paper, We analyzed the protocol to improve the performance of the multicast traffic processing in WDM networks. In the protocol, control channels are devided into contention-less minislots and contention minislots. And the packets which fail to have successful reservation in the present time slot have priority to have successful reservation in the contention-less minislots of the next time slot. Therefore, control channel contentions and destination conflicts can be reduced with the use of contention-less minislots. For the multicast traffic processing, the theoretical analysis and computer simulation are important to estimate the network performance and to calculate the optimized number of contention-less minislots. In this paper, the state transition probability of the number of contention-less minislots and arrival packets are calculated using 4-dimension matrix. The maximum number of contention-less minislots is equal to the number of channels for maximum performance improvement of the system. It is theoretical analysis and prove to computer simulation the performance of the protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.19-24
• /
• 2007

This paper presents a performance analysis of dynamic channel allocation (DCA) based on the greedy approach (GA) for orthogonal frequency division multiple access (OFDMA) systems over Rayleigh fading channels. The GA-based DCA achieves its performance improvement using multi-user diversity. We analyze the statistics of the number of allocable users (NAU), which represents the multi-user diversity order at each allocation process. The derived statistics are then used to analyze the performance of GA-based DCA. The analysis results show that the number of subcarriers allocated to each user must be equal to achieve the maximum system performance (i.e., based on outage probability and data throughput).

• Korean Journal of Cognitive Science
• /
• v.18 no.4
• /
• pp.351-370
• /
• 2007

This study investigated whether top-down information influenced the filing-in of the blind spot. Two potential stimuli, which could fill in the blind spot, were presented at the location of the blind spot. When the two stimuli competed against each other to fill in the blind spot with equal probability, the depth-context of one of the stimuli was manipulated. We used an overlapping cue as our depth-context. Participants' task was to report the relative depth of a target presented in the blind spot. We found that the overlapping rue influenced the frequency of reported depth. These results, however, were nor observed in the off blind spot. These results suggest that top-down information such as an overlapping cue influences the filing-in of the blind spot.

• The Korean Journal of Applied Statistics
• /
• v.31 no.5
• /
• pp.621-636
• /
• 2018

Research on the application of informative sampling technique has been conducted in order to reduce the influence of non-response. Chung and Shin (Korean Journal of Applied Statistics, 30, 993-1004, 2017) showed that the estimation accuracy improved when using exponential response rate information for the parameter estimation if the distribution of errors included in the super population model follows normal distribution. However this method divides the stratum into equally spaced substrata to obtain the sample weight of the informative sampling technique and shows that the accuracy of the estimation improves as the number of substrata increases. In this study, with the given number of total sample size, the optimal substratum boundary points are calculated using equal space, quantile, and LH algorithm; consequently, the results using those methods are compared through simulation. We also studied the criteria to determine the number of substrata and substratum boundaries that can be used in practice with various types of auxiliary variable distributions.