• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1668-1679
• /
• 1994

The cochannel interference probability has been estimated both in the environment of Nakagami fading and Gasussian noise and in the environments of Gaussian noise and Nakagami fading plus log-normal shadowing. In noise and Nakagami fading environments, a theoretical analysis has been performed in order to calculate the cochannel interference probability in addition to computer simulation. In the environments of noise and Nakagami fading plus shadowing, only a simulation technique is used due to complexity in analysis. The spectrum efficiency is discussed on each case.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.447-458
• /
• 2021

The quality of experience (QoE) of video streaming is degraded by playback interruptions, which can be mitigated by the playout buffers of end users. To analyze the impact of playout buffer dynamics on the QoE of wireless adaptive hypertext transfer protocol (HTTP) progressive video, we model the playout buffer as a G/D/1 queue with an arbitrary packet arrival rate and deterministic service time. Because all video packets within a block must be available in the playout buffer before that block is decoded, playback interruption can occur even when the playout buffer is non-empty. We analyze the queue length evolution of the playout buffer using diffusion approximation. Closed-form expressions for user-perceived video quality are derived in terms of the buffering delay, playback duration, and interruption probability for an infinite buffer size, the packet loss probability and re-buffering probability for a finite buffer size. Simulation results verify our theoretical analysis and reveal that the impact of playout buffer dynamics on QoE is content dependent, which can contribute to the design of QoE-driven wireless adaptive HTTP progressive video management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2339-2355
• /
• 2021

In this paper, a joint probabilistic data association algorithm based on loss function (LJPDA) is proposed so that the computation load and accuracy of the multi-target tracking algorithm can be guaranteed simultaneously. Firstly, data association is divided in to three cases based on the relationship among validation gates and the number of measurements in the overlapping area for validation gates. Also the contribution coefficient is employed for evaluating the contribution of a measurement to a target, and the loss function, which reflects the cost of the new proposed data association algorithm, is defined. Moreover, the equation set of optimal contribution coefficient is given by minimizing the loss function, and the optimal contribution coefficient can be attained by using the Newton-Raphson method. In this way, the weighted value of each target can be achieved, and the data association among measurements and tracks can be realized. Finally, we compare performances of LJPDA proposed and joint probabilistic data association (JPDA) algorithm via numerical simulations, and much attention is paid on real-time performance and estimation error. Theoretical analysis and experimental results reveal that the LJPDA algorithm proposed exhibits small estimation error and low computation complexity.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.61-69
• /
• 2022

A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.

• Water Engineering Research
• /
• v.2 no.4
• /
• pp.261-268
• /
• 2001

This study presents the estimation of the entrainment velocity of sediment particles from the scour hole. Sediment particles are entrained from the scour hole downstream of hydraulic structures by the turbulent vortices. Mathematical form of the entrainment velocity of sediment particles from the scour hole was obtained using the impulse-momentum equation with given value of the vertical component of turbulent velocity of the line vortex. Also, its probability density distribution was obtained with the results that the probability density distribution of the vertical turbulent velocity followed the normal distribution. Experimental results of the entrainment velocity of sediment particles showed relatively good agreements with theoretical ones.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.680-683
• /
• 2011

In this paper, symbol error probability (SEP) of typical 3-dimensional (3-D) signal constellations in Rayleigh fading channel is derived. Simulation confirms that average SEP of the constellations is very accurate. Thus, the theoretical SEP derived can be exploited as a performance reference for future development of wireless communication systems with 3-D constellations.

• The Korean Journal of Financial Management
• /
• v.25 no.1
• /
• pp.85-108
• /
• 2008

In this paper, the fBm interest rate theory is investigated by using Wick integral. The well-known Affine, Quadratic and HJM are derived from fBm framework, respectively. We obtain new theoretical results, and zero coupon bond pricing formula from newly obtained probability measure.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.123-130
• /
• 2009

When we apply MLPs(multilayer perceptrons) to pattern classification problems, we generally allocate one output node for each class and the index of output node denotes a class. On the contrary, in this paper, we propose to increase the number of output nodes per each class for performance improvement of MLPs. For theoretical backgrounds, we derive the misclassification probability in two class problems with additional outputs under the assumption that the two classes have equal probability and outputs are uniformly distributed in each class. Also, simulations of 50 isolated-word recognition show the effectiveness of our method.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.124-134
• /
• 2003

In this paper, we investigate the error probability performance of noncoherently detected orthogonal modulation combined with Alamouti space-time block coding. We find that there are two types of pair-wise error probabilities that characterize the performance. We employ methods that allow a direct evaluation of exact, closed-form expressions for these error probabilities. Theoretical as well as numerical results show that noncoherent orthogonal modulation combined with space-time block coding (STBC) achieves full spatial diversity. We derive an expression for approximate average bit error probability for-ary orthogonal signaling that allows one to show the tradeoff between increased rate and performance degradation.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.8
• /
• pp.11-18
• /
• 1993

In a spread spectrum system, the bandwidth and period of spreading code is wide and long, respectively. So it is necessary to make the code acquisition time as short as possible. In particular, serial search code acquisition system requires optimum dwell time for fast acquisition. In this paper, code acquisition time is calculated by varying dwell time. Among them, minimum code acquisition time is chosen and then optimum dwell time can be obtained. Detection probability (P$_{D}$) and false alarm probability (P$_{FA}$) can be obtained by integrating chi-square pdf by numerical analysis. The results are compared with that of gaussian approximation method and then it is concluded gaussian approximation method is not suitable for obtaining optimum dwell time. Computer simulation supports theoretical results.