• Journal of Preventive Medicine and Public Health
• /
• v.16 no.1
• /
• pp.135-152
• /
• 1983

Emergency medical service is an important part of the health care delivery system, and the optimal allocation of resources and their efficient utilization are essentially demanded. Since these conditions are the prerequisite to prompt treatment which, in turn, will be crucial for life saving and in reducing the undesirable sequelae of the event. This study, taking the hyperbaric chamber for carbon monoxide poisoning as an example, is to develop a stochastic approach for solving the problems of optimal allocation of such emergency medical facility in Korea. The hyperbaric chamber, in Korea, is used almost exclusively for the treatment of acute carbon monoxide poisoning, most of which occur at home, since the coal briquette is used as domestic fuel by 69.6 per cent of the Korean population. The annual incidence rate of the comatous and fatal carbon monoxide poisoning is estimated at 45.5 per 10,000 of coal briquette-using population. It offers a serious public health problem and occupies a large portion of the emergency outpatients, especially in the winter season. The requirement of hyperbaric chambers can be calculated by setting the level of the annual queueing rate, which is here defined as the proportion of the annual number of the queued patients among the annual number of the total patients. The rate is determined by the size of the coal briquette-using population which generate a certain number of carbon monoxide poisoning patients in terms of the annual incidence rate, and the number of hyperbaric chambers per hospital to which the patients are sent, assuming that there is no referral of the patients among hospitals. The queueing occurs due to the conflicting events of the 'arrival' of the patients and the 'service' of the hyperbaric chambers. Here, we can assume that the length of the service time of hyperbaric chambers is fixed at sixty minutes, and the service discipline is based on 'first come, first served'. The arrival pattern of the carbon monoxide poisoning is relatively unique, because it usually occurs while the people are in bed. Diurnal variation of the carbon monoxide poisoning can hardly be formulated mathematically, so empirical cumulative distribution of the probability of the hourly arrival of the patients was used for Monte Carlo simulation to calculate the probability of queueing by the number of the patients per day, for the cases of one, two or three hyperbaric chambers assumed to be available per hospital. Incidence of the carbon monoxide poisoning also has strong seasonal variation, because of the four distinctive seasons in Korea. So the number of the patients per day could not be assumed to be distributed according to the Poisson distribution. Testing the fitness of various distributions of rare event, it turned out to be that the daily distribution of the carbon monoxide poisoning fits well to the Polya-Eggenberger distribution. With this model, we could forecast the number of the poisonings per day by the size of the coal-briquette using population. By combining the probability of queueing by the number of patients per day, and the probability of the number of patients per day in a year, we can estimate the number of the queued patients and the number of the patients in a year by the number of hyperbaric chamber per hospital and by the size of coal briquette-using population. Setting 5 per cent as the annual queueing rate, the required number of hyperbaric chambers was calculated for each province and for the whole country, in the cases of 25, 50, 75 and 100 per cent of the treatment rate which stand for the rate of the patients treated by hyperbaric chamber among the patients who are to be treated. Findings of the study were as follows. 1. Probability of the number of patients per day follows Polya-Eggenberger distribution. $$P(X=\gamma)=\frac{\Pi\limits_{k=1}^\gamma[m+(K-1)\times10.86]}{\gamma!}\times11.86^{-{(\frac{m}{10.86}+\gamma)}}$$ when$${\gamma}=1,2,...,n$$$$P(X=0)=11.86^{-(m/10.86)}$$ when $${\gamma}=0$$ Hourly arrival pattern of the patients turned out to be bimodal, the large peak was observed in $7 : 00{\sim}8 : 00$ a.m., and the small peak in $11 : 00{\sim}12 : 00$ p.m. 2. In the cases of only one or two hyperbaric chambers installed per hospital, the annual queueing rate will be at the level of more than 5 per cent. Only in case of three chambers, however, the rate will reach 5 per cent when the average number of the patients per day is 0.481. 3. According to the results above, a hospital equipped with three hyperbaric chambers will be able to serve 166,485, 83,242, 55,495 and 41,620 of population, when the treatmet rate are 25, 50, 75 and 100 per cent. 4. The required number of hyperbaric chambers are estimated at 483, 963, 1,441 and 1,923 when the treatment rate are taken as 25, 50, 75 and 100 per cent. Therefore, the shortage are respectively turned out to be 312, 791. 1,270 and 1,752. The author believes that the methodology developed in this study will also be applicable to the problems of resource allocation for the other kinds of the emergency medical facilities.

• The Journal of Engineering Geology
• /
• v.29 no.2
• /
• pp.153-162
• /
• 2019

Rapid variations in the geometry (i.e., thickness) of the refractor and low velocities affect greatly the imaging of the reflectors of land seismic data. Conventional solutions to obtain the weathering models utilizes first break picking method, which requires time consuming steps and causes the human error in picking the first arrivals. A new interferometric approach (interferometric refraction statics, IRS) which utilizes the first arrival signal (S/N enhanced by refraction convolution stack) instead of first break picking, is tested in this study to the synthetic data from the velocity structure provided by surface geophysics (refraction, MASW) and borehole geophysics (tomography, SPS logging) for the Cheongju granitic bodies. The results of IRS approach are found to be better than the ones from conventional first break picking in terms of continuities and horizontal resolution of the reflectors. The unresolved long-wavelength statics in brute stack are much removed by IRS weathering correction and the overlying refractors (the base of shallow weathering zone) are incidentally delineated in the refraction convolution stack.

• Journal of Advanced Navigation Technology
• /
• v.15 no.1
• /
• pp.54-60
• /
• 2011

The development of wireless sensor networks (WSN) can be motivated by several types of applications. However, these applications demand an energy-efficient WSN that can prolong the network lifetime and can provide high throughput, low latency and delay. Designing wireless sensor networks with the capability of prolonging network lifetime catch the attention of many researchers in wireless system and network field. Contrasts with Mobile Ad Hoc Network system, Wireless Sensor Networks designs focused more on survivability of each node in the network instead of maximizing data throughput or minimizing end-to-end delay. In this paper, we will study part of data link layer in Open Systems Interconnection (OSI) model, called medium access control (MAC) layer. Since the MAC development of energy aware MAC Protocol for wireless sensor layer controls the physical radio part, it has a large impact on the overall energy consumption and the lifetime of a node. This paper proposes a analytical approach that tries to reduce idle energy consumption, and shows the increasement of network end-to-end arrival rate due to efficiency in energy consumption from time slot management.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.30-38
• /
• 2004

In many scientific and commercial applications such as Earth Observation System (EOSDIS) and mobile Phone services tracking a large number of clients, it is a daunting task to archive and index ever increasing volume of complex data that are continuously added to databases. To efficiently manage multidimensional data in scientific and data warehousing environments, R-tree based index structures have been widely used. In this paper, we propose a scalable technique called seeded clustering that allows us to maintain R-tree indexes by bulk insertion while keeping pace with high data arrival rates. Our approach uses a seed tree, which is copied from the top k levels of a target R-tree, to classify input data objects into clusters. We then build an R-tree for each of the clusters and insert the input R-trees into the target R-tree in bulk one at a time. We present detailed algorithms for the seeded clustering and bulk insertion as well as the results from our extensive experimental study. The experimental results show that the bulk insertion by seeded clustering outperforms the previously known methods in terms of insertion cost and the quality of target R-trees measured by their query performance.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.11
• /
• pp.787-794
• /
• 2019

In this paper, a Mixed Integer Linear Programming(MILP) approach for solving optimal Weapon-Target Assignment(WTA) problem of multiple dissimilar Closed-In Weapon Systems (CIWS) is proposed. Generally, WTA problems are formulated in nonlinear mixed integer optimization form, which often requires impractical exhaustive search to optimize. However, transforming the problem into a structured MILP problem enables global optimization with an acceptable computational load. The problem of interest considers defense against several threats approaching the asset from various directions, with different time of arrival. Moreover, we consider multiple dissimilar CIWSs defending the asset. We derive a MILP form of the given nonlinear WTA problem. The formulated MILP problem is implemented with a commercial optimizer, and the optimization result is proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.767-773
• /
• 2014

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and there have been various systems which have been recently studied. For a successful economic ship routing system, it is needed to properly control an engine power or change a geographical path considering weather forecast. An optimal geographical path is difficult to be determined, though, because it is a minimal dynamic-cost path search problem where the actual fuel consumption is dynamically variable by the weather condition when the ship will pass the area. In this paper, we propose an geographical path-search algorithm based on evolutionary strategy to efficiently search a good quality solution out of tremendous candidate solutions. We tested our approach with the shortest path-based sailing method over seven testing routes and observed that the former reduced the estimated fuel consumption than the latter by 1.82% on average and the maximum 2.49% with little difference of estimated time of arrival. In particular, we observed that our method can find a path to avoid bad weather through a case analysis.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.6
• /
• pp.341-348
• /
• 2019

The purpose of this study is to model and analyze retractable large spatial structures by applying parametric modeling techniques. The modeling of wind loads in the analysis of typical structures including curved surfaces can be error-prone, and the processing time increases dramatically when there are many types of variables. However, the method based on StrAuto that was developed in previous research, facilitates the efficacious assignment of wind loads to structures and the rapid arrival of conclusions. As a result, it is possible to compare alternatives with various loads, including wind loads, to determine an optimal alternative much faster than the existing process. Further, it is almost impossible to directly input the wind load by calculating the area of an irregularly curved surface. However, the proposed method automatically assigns the wind load, which allows for automatic optimization in a structural analysis system. The approach was applied and optimized using several models, and the results are presented.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.205-218
• /
• 2012

Mobility management of the mobile nodes and provision of seamless handover is crucial to an efficient support for the global roaming of the mobile nodes in next-generation wireless networks. Mobile IPv6 and mobility management in extended IP layer, which highly depend on traffic characteristics and user mobility models, were proposed by the IETF. Therefore, to evaluate the in-depth performance about these factors is important. Generally, the performance of IPv6-based mobility management protocol is evaluated through simulation. This paper shows the correlation between network parameters and performance metrics through numerical results, which is investigated how influence handoff latency and packet loss. And this paper uses mathematical analysis of the system parameters, such as the subnet residence time, the packet arrival rate and delay in wireless connection through the analytical framework which evaluate the performance of IPv6-based mobility management protocol.

• Journal of Korean Port Research
• /
• v.10 no.1
• /
• pp.1-14
• /
• 1996

Rapid change in the technological environment of marine transportation and the development of the ocean shipping industry have fostered a revolution in the port system. This in turn has caused major changes in the function and use of port in Korea. Aside from this, Mokpo Port, however continues to decline, because the existing port facilities and related subsystem are already obsolete with no chance of regaining operational effectiveness and treatment for proper implementation. Although a few studies have been done on the Mokpo Port, has not been found, any reseach for the analytical approach to the transportation system of it. This paper aims to make an extensive analysis of the physical distribution system in Mokpo Port focusing on the coordination of subsystems such as navigational aids system. The base of introduced simulation tool here is the queueing theory. The overall findings are as follows: 1. Among those vessels called at Mokpo Port in 1994, 556 ships(2,736,669 G/T) are oceangoing while 8155 ships(2,587,217 G/T) are domestic. The average size of oceangoing vessels is 4,922,1 G/T, and the domestic is 317,8 G/T. The average arrival interval and service time of the domestic vessels are 6.0 hours and 24.1 hours respectively marking the berth occupation rate over 100%. Those for oceangoing vessels are 34.5 hours, 120.0 hours and 37.2%. In order to maintainin the berth occupation rate to 70% the capacity considering the 1994 of domestic piers must be extended to 145% and oceangoing vessels must be increased to 165%. 2. The capacity of approaching channel is enough to handle the total traffic volume of 3. Tugs are sufficiently being provided to handle all ships requiring their services 4. The capacity of storage and inland transportation systems are sufficient to handle the throughput and the yard stroage utilization rate of No.1 - No.5 is 4.5% and No.6 is 30% of 1993's. 5. The utilization rate of LLC(Level Looping Crane) and PNT(PNeumaTic) are 2.7% and 18.8%, respectively.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.515-524
• /
• 2005

As the number of the mobile nodes (MNs) increases in the networks, the signaling traffic generated by mobility management for MNs will increase explosively, and such a phenomenon will probably affect overall network performance. In this paper, we propose a novel analytical approach using a continuous-time Markov chain model and hierarchical network model for the analysis on the signaling load of representative IPv6 mobility support Protocols such as Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6). According to these analytical modeling, this paper derives the various signaling costs, which are generated by an MN during its average domain residence time when MIPv6 and HMIPv6 are deployed under the same network architecture, respectively. In addition, based on these derived costs, we investigate the effects of various mobility/traffic-related parameters on the signaling costs generated by an MN under MIPv6 and HMIPv6. The analytical results show that as the average moving speed of an MN gets higher and the binding lifetime is set . to the larger value, and as its average packet arrival rate gets lower, the total signaling cost generated during its average domain residence time under HMIPv6 will get relatively lower than that under MIPv6, and that under the reverse conditions, the total signaling cost under MIPv6 will get relatively lower than that under HMIPv6.