• Health Policy and Management
• /
• v.27 no.3
• /
• pp.229-240
• /
• 2017

Background: This study purposed to analyze the spatial accessibility of women in childbearing age to the healthcare organizations (HCOs) providing delivery services in Gangwon-do. Methods: Network analysis was applied to assess the spatial accessibility based on the travel time and road travel distance. Travel time and travel distance were measured between the location of HCOs and the centroid of the smallest administrative areas, eup, myeon, and dong in Gangwon-do. Korean Transport Database Center provided road network GIS (Geographic Information System) Database in 2015 and it was used to build the network dataset. Two types of network analysis, service area analysis and origin-destination (OD)-cost matrix analysis, applied to the created network dataset. Service area analysis defined all-accessible areas that are within a specified time, and OD-cost matrix analysis measured the least-cost paths from the HCOs to the centroids. The visualization of the number of the HCOs and the number of women in childbearing age on the Ganwon-do map and network analysis were performed with ArcGIS ver. 10.0 (ESRI, Redlands, CA, USA). Results: Twenty HCOs were providing delivery services in Gangwon-do in 2016. Over 50% of the women in childbearing age were aged more than 35 years. Service area analysis found that 89.56% of Gangwon-do area took less than 60 minutes to reach any types of HCOs. For tertiary hospitals, about 74.37% of Gangwon-do area took more than 60 minutes. Except Wonju-si and Hoengseong-gun, other regions took more than 60 minutes to reach the tertiary hospital. Especially, Goseong-gun, Donghae-si, Samcheok-si, Sokcho-si, Yanggu-gun, Cheorwon-gun, and Taebaek-si took more than 100 minutes to the tertiary hospital. Conclusion: This study provided that the accessibility toward the tertiary hospital was limited and it may cause problems in high-risk delivery patients such as over 35 years. Health policy makers will need to handle the obstetric accessibility issues in Gangwon-do.

• The Korean Journal of Health Service Management
• /
• v.13 no.1
• /
• pp.15-30
• /
• 2019

Objectives: This study aimed to analyze people's accessibility to medical institutions providing national gastric cancer screening services in Gangwon-do using a geographic information system(GIS). Methods: To assess the spatial accessibility, network analysis was applied. Two types of network analysis-Service area analysis and origin-destination cost matrix(OD-cost matrix)-were applied to create network dataset. Results: The results of the analysis of the service area revealed that it took more than 60 minutes each to reach tertiary hospitals and general hospitals from 74.4% and 9.6% of Gangwon-do areas, respectively. Similarly, it took more than 60 minutes each to reach hospitals and clinics from 4.2% and 3.4% of Gangwon-do areas, respectively. The results of the OD-cost revealed that there were large regional variations in distance and time taken to reach the medical institutions. Conclusions: there were regional variations of spatial accessibility between Si and Gun in Gangwon-do.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.89-99
• /
• 2000

This paper deals with a heuristic algorithm for the vehicle routing-scheduling problem to minimize the total travel distance and the total cost. Because the aim of the Clarke-Wright method, one of famous heuristic methods, is to minimize the total travel distance of vehicles, it cannot consider the cost if the cost and the travel distance is not proportional. In the Clarke-Wright method, the route of each vehicle is found by using the saving matrix which is made by an assumption that the vehicle comes back to the starting point. The problem dealt with in the paper, however, does not need the vehicle to come back because each vehicle has its hoping-start-points and hoping-destination-points. Therefore we need a different saving matrix appropriate to this occasion. We propose a method to find an initial solution by applying network simplex method after transforming the vehicle routing-scheduling problem into the minimum cost problem. Moreover, we propose a method to minimize the total travel distance by using the modified saving matrix which is appropriate to no-return occasion and the method for the case of plural types of vehicles and freights.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.1
• /
• pp.27-31
• /
• 2001

In this paper, we consider the guaranteed cost filtering design method for time-varying delay system with parameter uncertainties by LMI(Linear Matrix Inequality) approach. The objective is to design a stable guaranteed cost filter which minimizes the guaranteed cost fo the closed loop systems in filtering error dynamics. The sufficient conditions for the existence of filter, the guaranteed cost filter design method, and th guaranteed cost upper bound are proposed by LMI technique in terms of all finding variables. Finally, we give an example to check the validity of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.5
• /
• pp.492-500
• /
• 2007

This paper focuses on the problem of guaranteed cost control for a class of uncertain linear delay systems with actuator failures. When actuators suffer "serious failure" the never failed actuators can not stabilize the system, based on switching strategy of average dwell time method, under the condition that activation time ratio between the system without actuator failure and the system with actuator failures is not less than a specified constant, a sufficient condition for exponential stability and weighted guaranteed cost performance are developed in terms of linear matrix inequalities (LMIs). Finally, as an example, a river pollution control problem illustrates the effectiveness of the proposed approach.

• Membrane and Water Treatment
• /
• v.11 no.2
• /
• pp.131-139
• /
• 2020

The current study focused on the preparation of low-cost PVC-based adsorbing membrane. Metakaolin, as available adsorbent, was embedded into the PVC matrix via solution blending method. The as-prepared PVC/metakaolin mixed matrix membranes were characterized using scanning electron microscopy (SEM), energy-dispersive X-ray spectroscopy (EDS), attenuated total reflectance-Fourier transform infrared (ATR-FTIR) spectroscopy, atomic force microscopy (AFM), pure water permeability and contact angle measurements. The results confirmed the improvement of PWP and hydrophilicity due to the presence of metakaolin in the PVC matrix. Additionally the structure of PVC membrane was changed due to the incorporation of metakaolin in the polymer matrix. The static adsorption capacity of all samples was determined through dye removal. The effect of metakaolin dosage (0-7%) and pH (4, 8, 12) on dye adsorption capacity was investigated. The results depicted that the highest adsorption capacity was achieved at pH of 4 for all samples. Additionally, adsorption data were fitted on Langmuir, Freundlich, and Temkin models to determine the appropriate governing isotherm model. Finally, the dynamic adsorption capacity of the optimum PVC/metakaolin membrane was studied using dead-end filtration cell. The dye removal efficiency was determined for pure PVC and PVC/metakaolin membrane. The results demonstrated that PVC/metakaolin mixed matrix membrane had a high adsorption capacity for dye removal from aqueous solution.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.699-717
• /
• 2012

In this paper, we deal with the robust mixed $H_2/H_{\infty}$ guaranteed-cost control problem involving uncertain neutral stochastic distributed delay systems. More precisely, the aim of this problem is to design a robust mixed $H_2/H_{\infty}$ guaranteed-cost controller such that the close-loop system is stochastic mean-square exponentially stable, and an $H_2$ performance measure upper bound is guaranteed, for a prescribed $H_{\infty}$ attenuation level ${\gamma}$. Therefore, the fast convergence can be fulfilled and the proposed controller is more appealing in engineering practice. Based on the Lyapunov-Krasovskii functional theory, new delay-dependent sufficient criteria are proposed to guarantee the existence of a desired robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which are derived in terms of linear matrix inequalities(LMIs). Furthermore, the design problem of the optimal robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which minimized an $H_2$ performance measure upper bound, is transformed into a convex optimization problem with LMIs constraints. Finally, two simulation examples illustrate the design procedure and verify the expected control performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.44.1-44
• /
• 2002

This paper is concerned with the problem of designing a guaranteed cost state feedback controller for singular systems with time-varying delays. The sufficient condition for the existence of a guaranteed cost controller, the controller design method, and the optimization problem to get the upper bound of guaranteed cost function are proposed by LMI(linear matrix inequality), singular value decomposition, Schur complements, and change of variables. Since the obtained sufficient conditions can be changed to LMI form, all solutions including controller gain and upper bound of guaranteed cost function can be obtained simultaneously.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.367-369
• /
• 1986

Guaranteed cost control is a method applicable to a class of systems with uncertain parameters that guarantees an upper bound of the cost functional. This paper is concerned with a matrix decomposition technique used to yield a reasonable upper bound of the cost functional for a finite-time LQ regulator problem. The uncertain linear systems dealt with in this paper are described by a set of state equations of single-input phase-variable canonical form which contain unknown but bounded uncertain parameters.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.13-13
• /
• 2000

This paper considers delay-dependent guaranteed cost control for uncertain time-delay systems with norm-bounded parametric uncertainties. A new delay-dependent condition for the existence of the guaranteed cost control law is presented in terms of linear matrix inequalities (LMI). An algorithm involving convex optimization is proposed to design a controller which guarantees the suboptimal minimum of the guaranteed cost of the closed-loop system for all admissible uncertainties.