• 지구물리와물리탐사
• /
• 제20권1호
• /
• pp.1-11
• /
• 2017

P파 및 S파의 초동주시를 활용한 역산기법들을 통해 미소지진 모니터링의 진원위치의 정확도를 향상시키기 위해 시추공 3성분 수진기를 이용한 현장실험이 수행되었다. 3성분 수진기의 수평 $\times$ 성분을 자북방향으로 정렬시키고 중추낙하형 발생원을 이용한 실험을 통해 계측자료의 P파 초동의 입자움직임으로부터 진원의 방향을 추정할 수 있었다. 한편 계측자료에서 S파의 식별이 어려운 경우에도 편극필터의 적용으로 S파의 초동주시를 발췌할 수 있었다. P파 초동주시만을 이용한 역산기법은 진원위치에 대한 초기치가 진원으로부터 크게 이격되면 국부적인 최소값으로 수렴하여 정해를 찾지 못하는 경우가 있다. 본 연구에서는 이러한 문제를 해결하기 위해 P파와 S파의 초동주시 차이를 이용한 진원위치 결정방법과 P파 초동주시만을 이용한 역산을 복합적으로 사용한 결과 진원위치의 정확도를 향상시킬 수 있었다.

• 한국지구물리탐사학회:학술대회논문집
• /
• 한국지구물리탐사학회 2007년도 공동학술대회 논문집
• /
• 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.

• 지구물리
• /
• 제4권2호
• /
• pp.113-120
• /
• 2001

이산 웨이브릿 변환은 탄성파 신호를 분석하고 파의 성분을 구분하는 도구로 사용이 가능하다. 이산 웨이브릿 변환은 푸리에 변환에 비해 신호의 변화 시점을 인식할 수 있는 장점을 지닌다. 본 연구에서는 탄성파 신호에 이산 웨이프릿 변환을 적용하여 초동과 S파 등 파의 구성 성분을 인지하고 주시를 결정하는 방법을 제시하였다. 정확한 지층 속도의 결정은 정확한 주시 결정에서 비롯되며, 이는 탄성파 속도분석, 굴절법 탐사, 탄성파 토모그래피, 다운홀 탐사, 크로스홀 탐사, 음파 검층 등 탄성파를 활용하는 각종 지구물리탐사 분야에 있어서 해석에 대한 신뢰도를 크게 증진시킬 수 있다. 잡음이 있는 경우와 없는 경우의 인공합성 탄성파 신호에 대한 P파와 S파의 주시 결정을 시도한 결과, 잡음이 많은 탄성파 신호에도 본 알고리즘이 적용 가능함을 확인할 수 있었다. 잡음이 많이 포함된 현장 자료에서도 초동을 정확하게 결정할 수 있었다

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

• Advances in aircraft and spacecraft science
• /
• 제9권4호
• /
• pp.335-347
• /
• 2022

Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

• 대한산업공학회지
• /
• 제38권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.

• 한국경영과학회지
• /
• 제30권1호
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• 대한교통학회지
• /
• 제10권1호
• /
• pp.41-54
• /
• 1992

The purpose of this thesis is to construct a model to estimate the delay that vehicles arriving randomly will be experienced at an isolated singalized intersection. To do this the following objectives are set in this study: (i) An what distance a random arrival pattern occurs after a platoon of vehicles are dis-charged from the stop line; (ii) A model which estimates the average delay per through-vehicle with respect to the de-gree of saturation; and (iii) The relation between the stepped delay and average approach delay per vehicle. The following are the findings of this study: (i) A random arrival pattern on the first second and third lanes occur 300,400 and 300m downstream from stop line rdspectively. A random arrival pattern on lane group occurs 500m downstream from the stop line ; (ii) A model for the estimation of approach delay has been developed in such a way that up to x=0.7 the delay increases linearly and beyond 0.7 the delay increases rapidly in a form of second order polynomial due to high degree of saturation : and (iii) Approach delay equals approximately 1.21 times of stopped delay.

• 지구물리와물리탐사
• /
• 제14권2호
• /
• pp.146-151
• /
• 2011

시추공 탄성파 초동주시에 유입될 수 있는 잡음 중에서 주시토모그래피 결과에 심각한 영향을 미치는 체계적인 잡음인 송신원 종속적인 잡음과 수신점 종속적인 잡음을 해당기록의 정보정으로 산출하는 방법을 제안하였다. 이 방법은 공통 송신원 또는 공통 수신점 모음의 초동주시를 적합 하는 최소제곱근사 곡선으로부터 해당 송신점 또는 수신점 종속적인 정보정을 산출하는 방법이다. 제안한 방법의 적용성을 검토하기위하여 잡음제거 모의실험을 수행하였다. 대상 모델로 균질한 매질 내에 있는 소규모 터널모델을 설정하고, 파선추적법에 의하여 주어진 측선배열에 대한 초동주시를 산출하고 이 기록에 송신/수신점 종속적인 잡음을 첨가하고 이를 산출하는 실험을 수행하였다. 잡음의 rms가 이상대의 존재로 인한 최대 예상 주시지연의 25%인 경우, 제안한 방법을 7회 반복 시행함으로써 성공적으로 잡음을 추출할 수 있었다.