• Geophysics and Geophysical Exploration
• /
• v.5 no.1
• /
• pp.18-22
• /
• 2002

As a single arrival traveltime, maximum energy arrival traveltime has been known as the most proper operator for Kirchhoff migration. In case of the model having the simple structure, both the first arrival traveltime and the maximum energy arrival traveltime can be used as the correct operators for Kirchhoff migration. However for some model having the complex and high velocity contrast structure, the migration using the first arrival traveltime can't give the correct depth section. That is, traveltime to be required in Kirchhoff migration is the maximum energy traveltime, but, needs considerably more calculation time than that of first arrival. In this paper, we propose the method for calculating the traveltime approximated to the maximum energy arrival using one-way wave equation. After defining the WAS(Wrap Around Suppression) factor to be used for calculating the first arrival traveltime using one-way wave equation as the function of lateral grid interval and depth and considering the delay time of source wavelet. we calculate the traveltime approximated to the maximum energy arrival. to verify the validity of this traveltime, we applied this to the migraion for simple structure and complex structure and compared the depth section with that obtained by using the first arrival traveltime.

• Tunnel and Underground Space
• /
• v.11 no.2
• /
• pp.120-121
• /
• 2001

The purpose of this study is to investigate concrete flaw using seismic first arrival and various inversion method. Seismic wave propagation was calculated using finite element method in theoretical modelling and tomogram was made using various inversion methods in theoretical and experimental modelling. Five steps of seismic first arrival were selected from FEM results and these data were used to calculate seismic velocity section. According to the results, exact seismic first arrival picking method was proposed and experimental modelling was conducted.

• Geophysics and Geophysical Exploration
• /
• v.10 no.2
• /
• pp.131-137
• /
• 2007

With consideration of the first arrival picking methodology and inherent errors in picking process, I propose, from the computerization point of view, a practical algorithm for picking and error computation. The proposed picking procedure consists of 2-step; 1) picking the first coherent peak or trough events, 2) derive a line which approximates the record in the interval prior to the pick, and set the intercept time of the line as the first break. The length of fitting interval used in experiment, is few samples less than 1/4 width of the arriving wavelet. A quantitative measure of the error involved in first arrival picking is defined as the time length that needed to determine if an event is the first arrival or not. The time length is expressed as a function of frequency bandwidth of the signal and the S/N ratio. For 3 sets of cross-well seismic data, first breaks are picked twice, by manually, and by the proposed method. And at the same time, the error bound for each trace is computed. Experiment results show that good performance of the proposed picking method, and the usefulness of the quantitative error measure in pick-quality evaluation.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2007.06a
• /
• pp.64-68
• /
• 2007

The classic graphical method to determine the epicenter uses differences between the arrival times of P and S waves at each station. In this research, a robust approach is proposed, which provides a fast and intuitive estimation of earthquake epicenters. This method uses an empirical relationship between epicentral distance and traveltime of the first arrival P phase of local or regional earthquake. The relationship enables us to estimate epicentral distances and draw epicentral circles from each station with P-traveltimes counted from a probable origin time. As the assigned time is getting close to the origin time of the earthquake, epicentral circles begin to intersect each other at a possible location of the epicenter. Then the possibility of the epicenter can be expressed by a function of the time and the space. We choose the location which gives the minimum standard deviation of the origin time as an estimated epicenter. In this research, 918 P arrival times from 84 events occurring from 2005 to 2006 listed in the KMA earthquake catalog are used to determine the empirical P-traveltime function of epicentral distances.

• Journal of Ecology and Environment
• /
• v.42 no.4
• /
• pp.285-291
• /
• 2018

The impact of climate change on animals has been globally documented. Especially, migration of birds has been extensively monitored as migratory birds are susceptible to any changes occurring both on breeding grounds and on wintering grounds. However, in contrast to spring migration, the patterns and the factors for autumn migration have not been well documented. In this study, we investigated the relationship with climate condition and the first arrival dates (FADs) of bean geese (Anser fabalis) and white-fronted geese (A. albifrons), the representative group of wintering birds in South Korea, using the data collected by Korean Meteorological Association during 1995-2016. Average temperature of September in wintering grounds has increased, and the FADs of the geese have advanced over the 22 years. Even when the influence of autumn temperature was statistically controlled for, the FADs of the geese have significantly advanced. This suggests that warming has hastened the completion of breeding, which speeded up the arrival of the geese at the wintering grounds. In order to assess the effect of climate condition on the arrival of the wintering migratory birds such as the geese in more detail, extensive data collection over many sampling sites and with long-term monitoring is needed.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2006.03a
• /
• pp.41-48
• /
• 2006

We have been conducting several studies on providing information to the public promptly as soon as earthquake occurs. Recently, JMA proposed a method for warning big earthquakes by observing the first 2 seconds after the first arrival. In this study, the envelope of the absolute value of the first 2 seconds after the first arrival is calculated, and then the relation of epicentral distance and slope of envelope, parameter B, is obtained. This result is applied to local magnitude equation of KMA, which then gives us a new magnitude equation from which can estimate the magnitude using maximum amplitude of P wave. We applied the method to two recent earthquakes; Uljin and Daegu. The results using only the vertical components show that the magnitudes are lower than those calculated by the local magnitude equation of KMA. However, when we apply the method to the 3 components of maximum displacements, the results corresponds with those obtained from the local magnitude equation.

• Journal of the Korean Statistical Society
• /
• v.28 no.1
• /
• pp.125-133
• /
• 1999

We consider a FIFO single-server queueing model in which both the arrival and service processes are modulated by the amount of work in the system. The arrival process is a non-homogeneous Poisson process(NHPP) modulated by work, that is, with an intensity that depends on the work in the system. Each customer brings a job consisting of an exponentially distributed amount of work to be processed. The server processes the work at various service rates which also depend on the work in the system. Under the stability conditions obtained by Browne and Sigman(1992) we derive the exact stationary distribution of the work W(t) and the first exit probability that the work level b is exceeded before the work level a is reached, starting from x$\in$[a, b].

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3201-3223
• /
• 2020

Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = e^ax - 1 and y = 0.5x² using MATLAB 2017a software for the computation of average and worst ratios of the two levels.