• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.131-142
• /
• 2016

We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.

• Geophysics and Geophysical Exploration
• /
• v.5 no.3
• /
• pp.193-198
• /
• 2002

In crosswell ray tomography, the resultant velocity structure could be affected by source static, first-arrival-time picking errors, convergence to a local minimum due to an inappropriate initial velocity model and etc. In the paper, I propose an algorithm that automatically correct the souce static among these error-prone factors. The algorithm automatically corrects source static using the picking times' differences along the source direction. The application of the algorithm to real data produces a quite satisfactory result. Tile algorithm seems to be helpful for users to apply the souce static correction consistently and to acquire accurate velocity structure.

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

Due to the long tectonic history and the very complex geologic formations in Korea, the anisotropic characteristics of subsurface material may often change very greatly and locally. The algorithms for the travel time computation commonly used, however, may not give sufficiently precise results particularly for the complex and strong anisotropic model, since they are based on the two-dimensional (2D) earth and/or weak anisotropy assumptions. This study is intended to develope a three-dimensional (3D) modeling algorithm to precisely calculate the first arrival time in the complex anisotropic media. We assume 3D TTI (tilted transversely isotropy) medium having the arbitrary symmetry axis. The algorithm includes the 2D non-linear interpolation scheme to calculate the traveltimes inside the grid and the 3D traveltime mapping to fill the 3D model with first arrival times. The weak anisotropy assumption, moreover, can be overcome through devising a numerical approach of the steepest descent method in the calculation of minimum traveltime, instead of using approximate solution.

• Geophysics and Geophysical Exploration
• /
• v.13 no.4
• /
• pp.330-335
• /
• 2010

In order to estimate the confidence level of the velocity distribution shown in a velocity image reconstructed from a travel-time tomography, the ray coverage and the inversion characteristics of the system matrix were investigated. The targets of the analysis is the first arrival travel-time, the raypath information, and the resulting velocity model. The ray coverage, degree of ray and model coupling, was estimated by the number of rays and total ray length in a velocity grid, and information regarding the resolution and uncertainties involved in the reconstructed velocity model was derived from the results of the SVD analysis of the system matrix that relates the data space (first arrival travel times) to the model space (velocity distribution in tomogram).

• ETRI Journal
• /
• v.31 no.1
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

• Geophysics and Geophysical Exploration
• /
• v.14 no.2
• /
• pp.140-145
• /
• 2011

In order to analyze the influence of the noise on a cross-well traveltime tomography to detect a small scale low velocity body in a homogeneous medium, the first arrival travel times were computed one a tunnel model by a finite-difference ray tracing scheme. Three different types and four different intensity levels of white noises were added to the computed first arrival travel times, and velocity tomograms were constructed using an iterative inversion method (SIRT). Tomograms with the noise intensity up to 10% of the maximum traveltime delay in the tunnel model, showed the exact location of the tunnel. However, the velocity shown at the tunnel location was not close to air velocity but only slightly less than the velocity of the background medium. The additive random noise showed significantly less degree of influence on the resulting tomogram than the source- and receiver consistent noise.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• Journal of the Korean Geophysical Society
• /
• v.8 no.2
• /
• pp.67-74
• /
• 2005

Two-dimensional S-wave velocity sections from SH-wave refraction tomography and surface wave dispersions were obtained by inverting traveltimes of first arrivals and surface wave dispersions, respectively. For the purpose of comparison, a P-wave velocity tomogram was also obtained from a P-wave refraction profiling. P and Rayleigh waves generated by vertical blows on a plate with a sledgehammer were received by 100- and 4.5-Hz geophones, respectively. SH-waves generated by horizontal blows on both sides of a 50 kg timber were received by 8 Hz horizontal geophones. The shear-wave signals were enhanced subtracting data of left-side blows from ones of the right-side blows. Shear-wave velocities from tomography inversion of first-arrival times were compared with ones from inverting dispersion curves of Rayleigh waves. Although the two velocity sections look similar to each other in general, the one from the surface waves tends to have lower velocities. First arrival picking of SH waves is troublesome since P and PS-converted waves arrive earlier than SH waves. Application of the surface wave method, on the other hand, is limited where lateral variation of subsurface tructures is not mild.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.3
• /
• pp.253-270
• /
• 2015

Two major simultaneous attack strategies have been introduced, as one of cooperative attack of multiple missiles. One strategy is an undesignated time attack, in which the missiles communicate among themselves to synchronize the arrival times by reducing the mutual differences of times-to-go of multiple missiles during the homing. The other is a designated time attack, in which a common impact time is commanded to all members in advance, and thereafter each missile tries to home on the target on time independently. For this individual homing, Impact-Time-Control Guidance (ITCG) law is required. After introducing cooperative proportional navigation (CPN) for the first strategy, this article presents a new closed-form ITCG guidance solution for the second strategy. It is based on the linear formulation, employing base trajectories driven by PNG with various navigation constants. Nonlinear simulation of several engagement situations demonstrates the performance and feasibility of the proposed ITCG law.

• Animal cells and systems
• /
• v.15 no.1
• /
• pp.85-90
• /
• 2011

In 2001, we conducted a study to assess the effects of differential arrival times and nest-site selection on reproductive performance in a mixed-species heronry consisting of six species in Taeseong-ri, Chungbuk, Korea. We recorded the arrival dates, nest heights, clutch sizes, and brood sizes after 15-20 days of the age of the birds' chicks. The grey herons and cattle egrets arrived first and last, respectively, on the colony site. In the homogenous vegetation structure of the breeding site, the pitch pine trees (Pinus rigida) were mainly used for building nests on 48 of the 50 pine trees (96%). The breeding species vertically stratifies the nest sites according to their body size, except for the cattle egrets and black-crowned night herons that nested at sites higher than those predicted from their body size. The mean nest success rates of the six species under study were positively correlated with the mean nest heights. Our findings suggest that aggressive interspecific interactions among neighbors influence nest-site selection to enhance breeding success.