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

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

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

• 한국지구물리탐사학회:학술대회논문집
• /
• 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 the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.1
• /
• pp.31-40
• /
• 2012

Distributed arrival time control (DATC) is a distributed feedback control algorithm for real-time scheduling problems in dynamic operational environment. Even though DATC has provided excellent performance for dynamic scheduling problems, it can be improved by considering the following considerations. First, the original DATC heavily depends on the quality of initial solution. In this paper, well-known dispatching rules are incorporated DATC algorithm to enhance its performance. Second, DATC improves its solution with adjusting virtual arrival times of jobs to be scheduled in proportion to the gap between completion time and due date iteratively. Since this approach assigns the same weight to all gaps generated with iterations, it fails to utilize significantly more the latest information (gap) than the previous ones. To overcome this issue we consider exponential smoothing which enable to assign different weight to different gaps. Using these two consideration This paper proposes A-DATC (Advanced-DATC). We demonstrate the effectiveness of the proposed scheduling algorithm through computational results.

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

• Journal of the Korean Society of Radiology
• /
• v.15 no.2
• /
• pp.93-100
• /
• 2021

The purpose of this study is to find out the factors that affect the patient's exposure dose during the abdominal CT scan using the bolus tracking technique, and reducing the radiation exposure to the patient during the abdominal CT scan using the bolus tracking technique by adjusting the delay time according to the corresponding factor. The experiment was divided into two parts, and the first experiment was conducted with 300 patients There were 188 males and 112 females, and their average age was 58±12.18(19~85). In the second experiment, 150 subjects (100 males and 50 females) who were undergoing their follow-up examination among the first experiment subjects, and the difference in dose before and after was compared by applying the delay time according to the influencing factor. As a result of the first experiment, there was a relationship between the arrival time of the contrast media and the heart rate, and it was found that the arrival time decreased as the heart rate increased for both men and women. As a result of the second experiment, the average dose of CTDIvol and DLP before/after applying the delay time according to the heart rate decreased 4.98 mGy and 5.33 mGy·cm in the male group, and 3.54 mGy and 3.88 mGy·cm in the female group. By applying proper delay time according to the patient's heart rate during abdominal CT scan with the bolus tracking technique, the radiation exposure dose of the patient can be reduced.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

• Journal of Ocean Engineering and Technology
• /
• v.24 no.1
• /
• pp.140-145
• /
• 2010

This study presents a detection method for mechanically fabricated defects on underwater steel pipes, using ultrasonic guided waves. Three different diameters (60, 90, and 114 mm) of 1000-mm long steel pipes were considered, along with several experimental design factors such as incident angles, incident distances, and the degrees of defects, to investigate how these factors affected the experimental results - the detectability of the mechanical defects. From the experimental results, we determined that the amplitude and arrival time of the first received wave signals gave a promising clue for distinguishing the existence of the defects and their severities. Between the amplitude and arrival time, the arrival time gave a more promising indication since it was affected by the experimental factors in a constant manner. Therefore, it was shown that the use of ultrasonic guided waves for underwater pipe inspection is feasible.