• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.18 no.1
• /
• pp.39-44
• /
• 2010

A method is presented of dynamic determination of mode transition probability for IMM in order to improve the accuracy performance of maneuvering target tracking for air traffic control surveillance processing system under multiple radar environment. It is shown that dynamic determination of mode transition probability based on the time intervals between the data input from multiple radars gives the optimized performance in terms of position estimation accuracy.

• Korean Journal of Mathematics
• /
• v.28 no.1
• /
• pp.1-7
• /
• 2020

A partition X describes that there exists α_i kinds of alleles occurring i loci for each i. All genes have multiple alleles, i.e., they exist in more than two allelic forms, although any one diploid organism can carry no more than two alleles. The number of possible genotypes in a multiple allel series depends on the number of alleles. We will deal with an n locus model in which mutation and gene conversion are taken into consideration. In this paper, we firstly find the probability p_n(x) of genotype $$p_{n+1}(x)=p_n(x){\sum\limits_{k=1}^{r}}q_{kx}p_n(k)$$ with the rates of mutation and gene conversion. Also we find the probability of genotype without the rates of mutation and gene conversion and we apply this probability to two examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.730-738
• /
• 2004

In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service termination, probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versus throughput as a function of traffic parameters with several service termination probability can be derived via mathematical formulation and the relative differences of transmission delay is also compared.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.9
• /
• pp.1340-1346
• /
• 2022

In this paper, we consider a downlink non-orthogonal multiple access (NOMA) using multiple transmit antennas, where the transmit antenna selection scheme is used to reduce the system complexity. Thus, in this paper, we propose radio resource allocation and receiver selection schemes in order to improve the outage probability performance of the downlink NOMA system using the transmit antenna selection scheme. In particular, the receiver selection scheme is a method of grouping the receivers to improve the outage probability performance, and the radio resource allocation scheme is a method of allocating radio resources to each group in order to enhance the outage probability performance. In addition, through the computer simulation under the assumption of independent Rayleigh fading channels, we show that the proposed radio resource allocation and receiver selection schemes can improve the outage probability performance at the expense of the sum rate performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.83-88
• /
• 2001

In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service terminating probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versa throughput as a function of traffic parameters with several service terminating probability can be derived via mathematical formulation and simulation and the relative change of transmission delay was compared.

• Communications for Statistical Applications and Methods
• /
• v.27 no.5
• /
• pp.535-546
• /
• 2020

In genetic association studies, pleiotropy is a phenomenon where a variant or a genetic region affects multiple traits or diseases. There have been many studies identifying cross-phenotype genetic associations. But, most of statistical approaches for detection of pleiotropy are based on individual tests where a single variant association with multiple traits is tested one at a time. These approaches fail to account for relations among correlated variants. Recently, multivariate regularization methods have been proposed to detect pleiotropy in analysis of high-dimensional genomic data. However, they suffer a problem of tuning parameter selection, which often results in either too many false positives or too small true positives. In this article, we applied selection probability to multivariate regularization methods in order to identify pleiotropic variants associated with multiple phenotypes. Selection probability was applied to individual elastic-net, unified elastic-net and multi-response elastic-net regularization methods. In simulation studies, selection performance of three multivariate regularization methods was evaluated when the total number of phenotypes, the number of phenotypes associated with a variant, and correlations among phenotypes are different. We also applied the regularization methods to a wild bean dataset consisting of 169,028 variants and 17 phenotypes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.530-539
• /
• 2009

Wireless Relaying is a promising solutions to overcome the channel impairments and provides high data rate coverage that appear for beyond 3G mobile communications. In this paper we present end to end BER performance of dual hop wireless communication systems equipped with multiple Decode and Forward relays over Rayleigh fading channel with the best relay selection. We compare the BER performance of the best relay with the BER performance of single relay. We select the best relay based on the end to end channel conditions. We further calculate the outage probability of the best relay. It is shown that the outage probability of the best relay is equivalent to the outage probability when all relays take part in the transmission. We apply Orthogonal Space Time Block coding(OSTBC) at the source terminal. Numerical and simulation results are presented to verify our analysis.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2018

In this paper, we consider a problem of partitioning a search area into smaller rectangular regions, so that multiple platforms can conduct search operations independently without requiring unnecessary coordination among themselves. The search area consists of cells where each cell has some prior information regarding the probability of target existence. The detection probability in particular cell is evaluated by multiplying the observation probability of the platform and the target existence probability in that cell. The total detection probability within the search area is defined as the cumulative detection probability for each cell. However, since this search area partitioning problem is NP-Hard, we decompose the problem into three sequential phases to solve this computationally intractable problem. Additionally, we discuss a special case of this problem, which can provide an optimal analytic solution. We also examine the performance of the proposed approach by comparing our results with the optimal analytic solution.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.75-87
• /
• 2000

In this paper, nonstationary multiple sampling plans are discussed which are difficult to solve by analytical method when there exists dependency between the sample data. The initial solution is found by the sequential sampling plan using the sequential probability ration test. The number of acceptance and rejection in each step of the multiple sampling plan are found by grouping the sequential sampling plan's solution initially. The optimal multiple sampling plans are found by simulation. Four search methods are developed U and the optimum sampling plans satisfying the Type I and Type ll error probabilities. The performance of the sampling plans is measured and their algorithms are also shown. To consider the nonstationary property of the dependent sampling plan, simulation method is used for finding the lot rejection and acceptance probability function. As a numerical example Markov chain model is inspected. Effects of the dependency factor and search methods are compared to analyze the sampling results by changing their parameters.