• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• 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.

• 한국항공운항학회지
• /
• 제18권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
• /
• 제28권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.

• 한국통신학회논문지
• /
• 제29권8B호
• /
• pp.730-738
• /
• 2004

본 논문에서는 요구할당 다중접속 방식을 사용하는 패킷 위성통신에서 스팟빔 스위칭 능력과 신호처리 능력을 가진 위성체의 관찰중인 특정 하향링크 출력포트에 초점을 두어 시스템의 처리량(Throughput)과 블로킹 확률(Blocking Probability) 그리고 전송지연(Delay)을 요구트래픽과 채널의 서비스종료 확률에 따란 분석하였다. 수학적 검증을 통해 각 채널 서비스 종료 확률에 따라 전송지연 대 처리량 곡선을 요구트래픽 파라미터 함수로 구하였으며, 처리량에 따른 전송지연의 상대적인 차이를 비교하였다.

• 한국정보통신학회논문지
• /
• 제26권9호
• /
• pp.1340-1346
• /
• 2022

본 논문에서는 다중 송신 안테나를 이용하는 하향링크 비직교 다중 접속 시스템을 고려한다. 여기서, 시스템 복잡도를 줄이기 위하여 송신 안테나 선택 기법을 이용한다. 따라서, 본 논문에서는 송신 안테나 선택을 이용하는 하향링크 비직교 다중 접속 시스템의 아웃티지 확률 성능을 개선하기 위한 무선 자원 할당 및 수신기 선택 기법을 제안한다. 특히, 수신기 선택 기법은 아웃티지 성능 개선을 위한 수신기들의 그룹핑 방법을 의미하고, 무선 자원 할당 기법은 아웃티지 성능 개선을 위한 각각의 그룹에 대한 자원 할당 방법을 의미한다. 또한, 레일레이 페이딩 채널을 가정한 컴퓨터 시뮬레이션을 통하여 제안 기법이 총 데이터 전송률의 손실로부터 아웃티지 확률 성능을 개선할 수 있음을 보여준다.

• 융합신호처리학회논문지
• /
• 제2권2호
• /
• pp.83-88
• /
• 2001

본 논문에서는 요구할당 다중접속 방식을 사용하는 패킷 위성통신에서 스팟빔 스위칭 능력과 신호처리 능력을 가진 위성체의 특정 관찰하는 하향링크 출력포트에 초점을 두어 시스템의 처리량(Throughput)과 블록킹 확률 (Blocking Probability) 그리고 전송지연(Delay)을 요구트래픽과 채널의 서비스종료 확률에 따라 분석하였다. 수학적 검증과 시뮬레이션을 통해 각 채널 서비스종료 확률에 따라 전송지연 대 처리량 곡선을 요구트래픽 파라미터 함수로 구하였으며, 처리량에 따른 전송지연의 상대적인 변화를 비교하였다.

• Communications for Statistical Applications and Methods
• /
• 제27권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.

• 한국통신학회논문지
• /
• 제34권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.

• 한국군사과학기술학회지
• /
• 제21권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.

• 한국시뮬레이션학회논문지
• /
• 제9권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.