• Journal of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1275-1292
• /
• 2016

The Marcinkiewicz-Zygmund strong law of large numbers for conditionally independent and conditionally identically distributed random variables is an existing, but merely qualitative result. In this paper, for the more general cases where the conditional order of moment belongs to (0, ${\infty}$) instead of (0, 2), we derive results on convergence rates which are quantitative ones in the sense that they tell us how fast convergence is obtained. Furthermore, some conditional probability inequalities are of independent interest.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3908-3920
• /
• 2015

In this paper, performance analysis of full-duplex (FD) relay selection under decode-and-forward (DF) relaying mode is carried out by taking into account several critical factors, including the distributions of the received signal-to-noise ratio (SNR) and the outage probability of wireless links. The tradeoff between the FD and half-duplex (HD) modes for relay selection techniques is also analyzed, where the former suffers from the impact of residual self-interference, but the latter requires more channel resources than the former (i.e., two orthogonal channels are required). Furthermore, the impact of optimal power allocation (OPA) on the proposed relay-selection scheme is analyzed. Particularly, the exact closed-form expressions for outage probability of the proposed scheme over Rayleigh fading channels are derived, followed by validating the proposed analysis using simulation. Numerical results show that the proposed FD based scheme outperforms the HD based scheme by more than 4 dB in terms of coding gain, provided that the residual self-interference level in the FD mode can be substantially suppressed to the level that is below the noise power.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.9-12
• /
• 2001

In DS/CDMA system the number of output signal levels increases as multi-channel signals are summed, hence the power amplifier with high linearity is required. PW/CDMA is a transmission technique that performs pulse width modulation on the multilevel signal synthesized from multiple channel data. In PW/CDMA system the signal level is maintained to be binary, hence the modulation and demodulation circuits become simple. In this paper we derive the probability of bit error of the PW/CDMA system in AWGN environment. The results are compared with DS/CDMA system and are verified through the computer simulations.

• International journal of advanced smart convergence
• /
• v.12 no.1
• /
• pp.59-63
• /
• 2023

We create a malware detector classification method with using the Sequential Probability Ratio Test (SPRT) in IoT. More specifically, we adapt the SPRT to classify malware detectors into two categories of basic and advanced in line with malware detection capability. We perform evaluation of our scheme through simulation. Our simulation results show that the number of advanced detectors is changed in line with threshold for fraction of advanced malware information, which is used to judge advanced detectors in the SPRT.

• International journal of advanced smart convergence
• /
• v.12 no.1
• /
• pp.64-69
• /
• 2023

We devise a collaboration construction method based on the SPRT (Sequential Probability Ratio Test) for malware detection in IoT. In our method, high-end IoT nodes having capable of detecting malware and generating malware signatures harness the SPRT to give a reward of malware signatures to low-end IoT nodes providing useful data for malware detection in IoT. We evaluate our proposed method through simulation. Our simulation results indicate that the number of malware signatures provided for collaboration is varied in accordance with the threshold for fraction of useful data.

• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.4
• /
• pp.401-404
• /
• 2003

In most resource reservation strategies, which give higher priorities to handoff calls over new calls, new calls are often blocked even though there is plenty of available reserved resource. This causes inefficient resource utilization, especially when there are not so many handoff attempts. In this paper, we propose a new reservationstrategy called soft reservation in which new calls can be allocated to the reserved resource while maintaining the QoS of handoff acceptable. Using an M/M/c/c queuing model, we can see that the proposed strategy provides better performance than the conventional reservation strategy in terms of blocking probability of new call and dropping probability of handoff calls.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.7
• /
• pp.107-115
• /
• 1996

The average distortio of the vector quantizer is calcualted using a probability function F of the input source for a given codebook. But, since the input source is unknown in geneal, using the sample vectors that is realized from a random vector having probability function F, a time-average opeation is employed so as to obtain an approximation of the average distortion. In this case the size of the smple set should be large so that the sample vectors represent true F reliably. The theoretical inspection about the approximation, however, is not perfomed rigorously. Thus one might use the time-average distortion without any verification of the approximation. In this paper, the convergence characteristics of the time-average distortions are theoretically investigated when the size of sample vectors or the size of codebook gets large. It has been revealed that if codebook size is large enough, then small sample set is enough to obtain the average distortion by approximatio of the calculated tiem-averaged distortion. Experimental results on synthetic data, which are supporting the analysis, are also provided and discussed.

• Convergence Security Journal
• /
• v.11 no.5
• /
• pp.13-19
• /
• 2011

Mobile nodes in MANETs have the nature of unrestricted mobility so that they will join and leave the network frequently. Therefore, it important consideration to determine the optimal distance progress between relaying nodes along the route in order to maintain the established route for an arbitrary length of time (i.e., route duration). In this paper, we derived the link maintenance probability by considering the initial distance between two relaying nodes and node mobility. Based on the link maintenance probability, we further analyzed the route stability by considering the impact of distance progress between relaying nodes along the route.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.545-552
• /
• 2003

Let X$_1$, X$_2$, … be real valued random variables under linearly negatively quadrant dependent (LNQD). In this paper, we discuss the probability inequality of ennett(1962) and Hoeffding(1963) under some suitable random variables. These results are to extend Theorem A and B to LNQD random variables. Furthermore, let ζdenote the ｐth quantile of the marginal distribution function of the $Ｘ_i$'s which is estimated by a smooth estima te $ζ_{pn}$, on the basis of X$_1$, X$_2$, …$X_n$. We establish a convergence of $ζ_{pn}$, under Hoeffding-type probability inequality of LNQD.

• Communications for Statistical Applications and Methods
• /
• v.24 no.5
• /
• pp.481-492
• /
• 2017

This paper investigates a convergence rate of a test statistics given by two scale sampling method based on $A\ddot{i}t$-Sahalia and Jacod (Annals of Statistics, 37, 184-222, 2009). This statistics tests for longitudinal data having the existence of long memory dependence driven by fractional Brownian motion with Hurst parameter $H{\in}(1/2,\;1)$. We obtain an upper bound in the Kolmogorov distance for normal approximation of this test statistic. As a main tool for our works, the recent results in Nourdin and Peccati (Probability Theory and Related Fields, 145, 75-118, 2009; Annals of Probability, 37, 2231-2261, 2009) will be used. These results are obtained by employing techniques based on the combination between Malliavin calculus and Stein's method for normal approximation.