• 한국병원경영학회지
• /
• 제8권1호
• /
• pp.135-164
• /
• 2003

The operating room is the major facility that costs the highest investment per unit area in a hospital. It requires commitment of hospital resources such as manpower, equipments and material. The quantity of these resources committed actually differs from one type of operation to another. Because of this, it is not an easy task to allocate the operating cost to individual clinical departments that share the operating room. A practical way to do so may be to collect and add the operating costs incurred by each clinical department and charge the net cost to the account of the corresponding clinical department. It has been customary to allocate the cost of the operating room to the account of each individual department on the basis of the ratio of the number of operations of the department or the total revenue by each operating room. In an attempt to set up more rational cost allocation method than the customary method, this study proposes a new cost allocation method that calls for itemizing the operation cost into its constituent expenses in detail and adding them up for the operating cost incurred by each individual department. For comparison of the new method with the conventional method, the operating room in the main building of hospital A near Seoul is chosen as a study object. It is selected because it is the biggest operating room in hospital A and most of operations in this hospital are conducted in this room. For this study the one-month operation record performed in January 2001 in this operating room is analyzed to allocate the per-month operation cost to six clinical departments that used this operating room; the departments of general surgery, orthopedic surgery, neuro-surgery, dental surgery, urology, and obstetrics & gynecology. In the new method(or method 1), each operation cost is categorized into three major expenses; personnel expense, material expense, and overhead expense and is allocated into the account of the clinical department that used the operating room. The method 1 shows that, among the total one-month operating cost of 814,054 thousand wons in this hospital, 163,714 thousand won is allocated to GS, 335,084 thousand won to as, 202,772 thousand won to NS, 42,265 thousand won to uno, 33,423 thousand won to OB/GY, and 36.796 thousand won to DS. The allocation of the operating cost to six departments by the new method is quite different from that by the conventional method. According to one conventional allocation method based on the ratio of the number of operations of a department to the total number of operations in the operating room(method 2 hereafter), 329,692 thousand won are allocated to GS, 262,125 thousand won to as, 87,104 thousand won to NS, 59,426 thousand won to URO, 51.285 thousand won to OB/GY, and 24,422 thousand won to DS. According to the other conventional allocation method based on the ratio of the revenue of a department(method 3 hereafter), 148,158 thousand won are allocated to GS, 272,708 thousand won to as, 268.638 thousand won to NS, 45,587 thousand won to uno, 51.285 thousand won to OB/GY, and 27.678 thousand won to DS. As can be noted from these results, the cost allocation to six departments by method 1 is strikingly different from those by method 2 and method 3. The operating cost allocated to GS by method 2 is about twice by method 1. Method 3 makes allocations of the operating cost to individual departments very similarly as method 1. However, there are still discrepancies between the two methods. In particular the cost allocations to OB/GY by the two methods have roughly 53.4% discrepancy. The conventional methods 2 and 3 fail to take into account properly the fact that the average time spent for the operation is different and dependent on the clinical department, whether or not to use expensive clinical material dictate the operating cost, and there is difference between the official operating cost and the actual operating cost. This is why the conventional methods turn out to be inappropriate as the operating cost allocation methods. In conclusion, the new method here may be laborious and cause a complexity in bookkeeping because it requires detailed bookkeeping of the operation cost by its constituent expenses and also by individual clinical department, treating each department as an independent accounting unit. But the method is worth adopting because it will allow the concerned hospital to estimate the operating cost as accurately as practicable. The cost data used in this study such as personnel expense, material cost, overhead cost may not be correct ones. Therefore, the operating cost estimated in the main text may not be the same as the actual cost. Also, the study is focused on the case of only hospital A, which is hardly claimed to represent the hospitals across the nation. In spite of these deficiencies, this study is noteworthy from the standpoint that it proposes a practical allocation method of the operating cost to each individual clinical department.

• Asia pacific journal of information systems
• /
• 제19권2호
• /
• pp.117-137
• /
• 2009

Recently, intelligent traffic information systems have enabled people to forecast traffic conditions before hitting the road. These convenient systems operate on the basis of data reflecting current road and traffic conditions as well as distance-based data between locations. Thanks to the rapid development of ubiquitous computing, tremendous context data have become readily available making vehicle route planning easier than ever. Previous research in relation to optimization of vehicle route planning merely focused on finding the optimal distance between locations. Contexts reflecting the road and traffic conditions were then not seriously treated as a way to resolve the optimal routing problems based on distance-based route planning, because this kind of information does not have much significant impact on traffic routing until a a complex traffic situation arises. Further, it was also not easy to take into full account the traffic contexts for resolving optimal routing problems because predicting the dynamic traffic situations was regarded a daunting task. However, with rapid increase in traffic complexity the importance of developing contexts reflecting data related to moving costs has emerged. Hence, this research proposes a framework designed to resolve an optimal route planning problem by taking full account of additional moving cost such as road traffic cost and weather cost, among others. Recent technological development particularly in the ubiquitous computing environment has facilitated the collection of such data. This framework is based on the contexts of time, traffic, and environment, which addresses the following issues. First, we clarify and classify the diverse contexts that affect a vehicle's velocity and estimates the optimization of moving cost based on dynamic programming that accounts for the context cost according to the variance of contexts. Second, the velocity reduction rate is applied to find the optimal route (shortest path) using the context data on the current traffic condition. The velocity reduction rate infers to the degree of possible velocity including moving vehicles' considerable road and traffic contexts, indicating the statistical or experimental data. Knowledge generated in this papercan be referenced by several organizations which deal with road and traffic data. Third, in experimentation, we evaluate the effectiveness of the proposed context-based optimal route (shortest path) between locations by comparing it to the previously used distance-based shortest path. A vehicles' optimal route might change due to its diverse velocity caused by unexpected but potential dynamic situations depending on the road condition. This study includes such context variables as 'road congestion', 'work', 'accident', and 'weather' which can alter the traffic condition. The contexts can affect moving vehicle's velocity on the road. Since these context variables except for 'weather' are related to road conditions, relevant data were provided by the Korea Expressway Corporation. The 'weather'-related data were attained from the Korea Meteorological Administration. The aware contexts are classified contexts causing reduction of vehicles' velocity which determines the velocity reduction rate. To find the optimal route (shortest path), we introduced the velocity reduction rate in the context for calculating a vehicle's velocity reflecting composite contexts when one event synchronizes with another. We then proposed a context-based optimal route (shortest path) algorithm based on the dynamic programming. The algorithm is composed of three steps. In the first initialization step, departure and destination locations are given, and the path step is initialized as 0. In the second step, moving costs including composite contexts into account between locations on path are estimated using the velocity reduction rate by context as increasing path steps. In the third step, the optimal route (shortest path) is retrieved through back-tracking. In the provided research model, we designed a framework to account for context awareness, moving cost estimation (taking both composite and single contexts into account), and optimal route (shortest path) algorithm (based on dynamic programming). Through illustrative experimentation using the Wilcoxon signed rank test, we proved that context-based route planning is much more effective than distance-based route planning., In addition, we found that the optimal solution (shortest paths) through the distance-based route planning might not be optimized in real situation because road condition is very dynamic and unpredictable while affecting most vehicles' moving costs. For further study, while more information is needed for a more accurate estimation of moving vehicles' costs, this study still stands viable in the applications to reduce moving costs by effective route planning. For instance, it could be applied to deliverers' decision making to enhance their decision satisfaction when they meet unpredictable dynamic situations in moving vehicles on the road. Overall, we conclude that taking into account the contexts as a part of costs is a meaningful and sensible approach to in resolving the optimal route problem.

• 지능정보연구
• /
• 제16권4호
• /
• pp.67-84
• /
• 2010

미래에 대한 정확한 예측은 경영자, 또는 기업이 수행하는 경영의사결정에 매우 중요한 역할을 한다. 예측만 정확하다면 경영의사결정의 질은 매우 높아질 수 있을 것이다. 하지만 점점 가속화되고 있는 경영 환경의 변화로 말미암아 미래 예측을 정확하게 하는 일은 점점 더 어려워지고 있다. 이에 기업에서는 정확한 예측을 위하여 전문가의 휴리스틱뿐만 아니라 과학적 예측모형을 함께 활용하여 예측의 성과를 높이는 노력을 해 오고 있다. 본 연구는 사례기반추론모형을 예측을 위한 기본 모형으로 설정하고, 데이터 간의 유사도 측정에 퍼지 관계의 개념을 적용함으로써 개선된 예측성과를 얻고자 하였다. 특히, 독립변수 중 기호 데이터 형식의 속성을 가지는 변수들간의 유사도를 측정하기 위해 이진논리의 개념(일치여부의 판단)과 퍼지 관계 및 합성의 개념을 이용하여 도출된 유사도 매트릭스를 사용하였다. 연구 결과, 기호 데이터 형식의 속성을 가지는 변수들 간의 유사도 측정에서 퍼지 관계 및 합성의 개념을 적용하는 방법이 이진논리의 개념을 적용하는 방법과 비교하여 더 우수한 예측정확성을 나타내었다. 그러나 유사도 측정을 위해 다양한 퍼지합성방법(Max-min 합성, Max-product 합성, Max-average 합성)을 적용하여 예측하는 경우에는 예측정확성 측면에서 퍼지 합성방법 간의 통계적인 차이는 유의하지 않았다. 본 연구는 사례기반추론 모형의 구축에서 가장 중요한 유사도 측정에 있어서 퍼지 관계 및 퍼지 합성의 개념을 적용함으로써 유사도 측정 및 적용 방법론을 제시하였다는데 의의가 있다.

• 지능정보연구
• /
• 제24권1호
• /
• pp.205-225
• /
• 2018

Convolutional Neural Network (ConvNet)은 시각적 특징의 계층 구조를 분석하고 학습할 수 있는 대표적인 심층 신경망이다. 첫 번째 신경망 모델인 Neocognitron은 80 년대에 처음 소개되었다. 당시 신경망은 대규모 데이터 집합과 계산 능력이 부족하여 학계와 산업계에서 널리 사용되지 않았다. 그러나 2012년 Krizhevsky는 ImageNet ILSVRC (Large Scale Visual Recognition Challenge) 에서 심층 신경망을 사용하여 시각적 인식 문제를 획기적으로 해결하였고 그로 인해 신경망에 대한 사람들의 관심을 다시 불러 일으켰다. 이미지넷 첼린지에서 제공하는 다양한 이미지 데이터와 병렬 컴퓨팅 하드웨어 (GPU)의 발전이 Krizhevsky의 승리의 주요 요인이었다. 그러므로 최근의 딥 컨볼루션 신경망의 성공을 병렬계산을 위한 GPU의 출현과 더불어 ImageNet과 같은 대규모 이미지 데이터의 가용성으로 정의 할 수 있다. 그러나 이러한 요소는 많은 도메인에서 병목 현상이 될 수 있다. 대부분의 도메인에서 ConvNet을 교육하기 위해 대규모 데이터를 수집하려면 많은 노력이 필요하다. 대규모 데이터를 보유하고 있어도 처음부터 ConvNet을 교육하려면 많은 자원과 시간이 소요된다. 이와 같은 문제점은 전이 학습을 사용하면 해결할 수 있다. 전이 학습은 지식을 원본 도메인에서 새 도메인으로 전이하는 방법이다. 전이학습에는 주요한 두 가지 케이스가 있다. 첫 번째는 고정된 특징점 추출기로서의 ConvNet이고, 두번째는 새 데이터에서 ConvNet을 fine-tuning 하는 것이다. 첫 번째 경우, 사전 훈련 된 ConvNet (예: ImageNet)을 사용하여 ConvNet을 통해 이미지의 피드포워드 활성화를 계산하고 특정 레이어에서 활성화 특징점을 추출한다. 두 번째 경우에는 새 데이터에서 ConvNet 분류기를 교체하고 재교육을 한 후에 사전 훈련된 네트워크의 가중치를 백프로퍼게이션으로 fine-tuning 한다. 이 논문에서는 고정된 특징점 추출기를 여러 개의 ConvNet 레이어를 사용하는 것에 중점을 두었다. 그러나 여러 ConvNet 레이어에서 직접 추출된 차원적 복잡성을 가진 특징점을 적용하는 것은 여전히 어려운 문제이다. 우리는 여러 ConvNet 레이어에서 추출한 특징점이 이미지의 다른 특성을 처리한다는 것을 발견했다. 즉, 여러 ConvNet 레이어의 최적의 조합을 찾으면 더 나은 특징점을 얻을 수 있다. 위의 발견을 토대로 이 논문에서는 단일 ConvNet 계층의 특징점 대신에 전이 학습을 위해 여러 ConvNet 계층의 특징점을 사용하도록 제안한다. 본 논문에서 제안하는 방법은 크게 세단계로 이루어져 있다. 먼저 이미지 데이터셋의 이미지를 ConvNet의 입력으로 넣으면 해당 이미지가 사전 훈련된 AlexNet으로 피드포워드 되고 3개의 fully-connected 레이어의 활성화 틀징점이 추출된다. 둘째, 3개의 ConvNet 레이어의 활성화 특징점을 연결하여 여러 개의 ConvNet 레이어의 특징점을 얻는다. 레이어의 활성화 특징점을 연결을 하는 이유는 더 많은 이미지 정보를 얻기 위해서이다. 동일한 이미지를 사용한 3개의 fully-connected 레이어의 특징점이 연결되면 결과 이미지의 특징점의 차원은 4096 + 4096 + 1000이 된다. 그러나 여러 ConvNet 레이어에서 추출 된 특징점은 동일한 ConvNet에서 추출되므로 특징점이 중복되거나 노이즈를 갖는다. 따라서 세 번째 단계로 PCA (Principal Component Analysis)를 사용하여 교육 단계 전에 주요 특징점을 선택한다. 뚜렷한 특징이 얻어지면, 분류기는 이미지를 보다 정확하게 분류 할 수 있고, 전이 학습의 성능을 향상시킬 수 있다. 제안된 방법을 평가하기 위해 특징점 선택 및 차원축소를 위해 PCA를 사용하여 여러 ConvNet 레이어의 특징점과 단일 ConvNet 레이어의 특징점을 비교하고 3개의 표준 데이터 (Caltech-256, VOC07 및 SUN397)로 실험을 수행했다. 실험결과 제안된 방법은 Caltech-256 데이터의 FC7 레이어로 73.9 %의 정확도를 얻었을 때와 비교하여 75.6 %의 정확도를 보였고 VOC07 데이터의 FC8 레이어로 얻은 69.2 %의 정확도와 비교하여 73.1 %의 정확도를 보였으며 SUN397 데이터의 FC7 레이어로 48.7%의 정확도를 얻었을 때와 비교하여 52.2%의 정확도를 보였다. 본 논문에 제안된 방법은 Caltech-256, VOC07 및 SUN397 데이터에서 각각 기존에 제안된 방법과 비교하여 2.8 %, 2.1 % 및 3.1 %의 성능 향상을 보였다.