• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.137-142
• /
• 2013

Direction of arrival is estimating for desire signal direction among received signal on antenna in spatial. In this paper, we were an estimation a receiving signal direction of arrival using multi beam forming in radar. We proposed, by signal direction of arrival estimation method, an algorithm which combine spatial correlation matrix weight value and beam steering algorithm in this paper. Through simulation, we were analysis a performance to compare general algorithm and proposal algorithm. In direction of arrival estimation, proposed algorithm is effectivity to decrease processing time because it is not doing an eigen decomposition. We showed that proposal algorithm improve more target estimation than general algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.53-59
• /
• 2016

The purpose of this study was to investigate the factors of hospital arrival delays of acute ischemic stroke patients. The study subjects were 126 cerebral infarction patients G Metropolitan City university hospital emergency center. General characteristics, disease-related characteristics and stroke-related were collected by self-reported questionnaires. Hospital arrival times by subjects' characteristics were tested by $x^2$ test and logistic regression analysis. Of 126 cerebral infarction patients, Their average hours taken to move to a hospital was 12.7 hours with the fastest case being 0.5 hour and the most delayed case being 127.8 hours. 61.1%(77 persons) of the stroke patients under this experiment said to have taken 3 hours or less. In logistic regression analyses, Coming to the hospital directly without passing through other hospitals was found to have higher probability of arriving less than 3 hours(${\beta}$=2.960, p=.009), And if LAPSS was tested positive, such cases are more likely to arrive within 3 hours(${\beta}$=2.219, p=.049). For acute ischemic stroke and caregivers need training to be conducted promptly admitted to hospitals for education and treatment hospital stroke screening will help to improve the treatment of stroke patients

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.400-404
• /
• 2015

In this paper, we study for direction of arrival MUSIC spatial spectrum algorithm in order to desired signal estimation in spatial. Proposal MUSIC spatial spectrum algorithm in paper use model error and Bayesian method to estimation on correct target position. Receiver array response vector using adaptive array antenna use Bayesian method, and target position estimate to update weight value with model error method. Target's signal estimation of desired direction of arrival in this paper apply weight value of signal covariance matrix for array response vector after removing incident signal interference and noise, respectively. Though simulation, we analyze to compare proposed method with general method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.376-383
• /
• 2011

Since the first arrival path may not be the strongest path of UWB(Ultra Wide Band) multipath channels, this makes ToA(Time-of-Arrival) estimation becomes a challengeable issue. Furthermore, because of ultra bandwidth of received signals, the compressed sensing theory is employed to reduce the complexity caused by very high Nyquist sampling rate in coherent UWB receivers. In this paper, we propose a ToA estimation scheme which provides precise estimation performance, while exploiting the benefits of compressed sensing-based UWB receivers. Simulation results show that the proposed scheme can outperform other low complexity schemes in a wide range of signal-to-noise ratios.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.1-10
• /
• 2009

Bus delay time is occurred as the result of traffic condition and important factor to predict bus arrival time. In this paper, transition probability matrixes between bus stops are made by using Markov Chain and it is predicted bus delay time with them. As the results of study, it is confirmed a possibility of adapting the assumption which it has same bus transition probability between stops through paired-samples T-test and overcame the limitation of exiting studies in case there is no scheduled bus arrival time for each stops with using bus interval time. Therefore it will be possible to predict bus arrival time with Markov Chain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.895-900
• /
• 2010

As the diverse telecommunication services have been developed, network designers need to prevent congestion which may be caused by properties of timecorrelation and burstiness, and unpredictable statistical fluctuation of traffic streams. This paper considers the leaky bucket scheme with combined control of arrival and token rates, in which the arrival rate and the token generation interval are controlled according to the queue length. By using the embedded Markov chain and the supplementary variable methods, we obtain the queue length distribution as well as the loss probability and the mean waiting time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.153-162
• /
• 1997

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.886-893
• /
• 2010

This paper considers the problem of time difference-of-arrival(TDOA) source localization when the TDOA and angle of arrival(AOA) measurements from an airborne emitter source are subject to ground-platform sensor position. The optimization of sensors' position is a challenging problem and a solution with good localization accuracy has yet to be found. This paper proposes an estimator that can achieve these purposes and provides optimized sensor position for good localization accuracy using the proposed estimator. The developed algorithm and sensor position are then examined under the special case of a single airborne source. The theoretical developments are supported by simulations.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.26 no.4
• /
• pp.231-238
• /
• 2006

Nondestructive examination for low pressure turbine disc in standard nuclear power plant using phased array technique was studied. For this purpose, disc mockups were made and notches were machined in the mockups. Detection and length sizing by different methods are compared. Depth of deep notches could be measured by using AATT(absolute arrival time technique) or RATT(relative arrival time technique) but shallow notches that must be detected in early stage couldn't be measured by these two methods. For this case, notch depth was estimated by using signal response angle range and preyed usefulness.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.477-491
• /
• 2021

The Markov modulated Brownian motion is a substantial generalization of the classical Brownian Motion. On the other hand, the Markovian arrival process (MAP) is a point process whose family is dense for any stochastic point process and is used to approximate complex stochastic counting processes. In this paper, we consider a superposition of the Markov modulated Brownian motion (MMBM) and the Markovian arrival process of jumps which are distributed as the bilateral ph-type distribution, the class of which is also dense in the space of distribution functions defined on the whole real line. In the model, we assume that the inter-arrival times of the MAP depend on the underlying Markov process of the MMBM. One of the subjects of this paper is introducing how to obtain the first passage probabilities of the superposed process using a stochastic doubling algorithm designed for getting the minimal solution of a nonsymmetric algebraic Riccatti equation. The other is to provide eigenvalue and eigenvector results on the superposed process to make it possible to apply the GTH-like algorithm, which improves the accuracy of the doubling algorithm.