• 보건행정학회지
• /
• 제13권1호
• /
• pp.98-115
• /
• 2003

Concerns about growing health insurance expenditures became a national Issue in 2001 when the National Health Insurance went into a deficit. Increases in spending for ambulatory care shared the largest portion of the problem. Methods and systems to control the spending should be developed and a system to measure case mix of providers is one of core components of the control system. The objectives of this article is to examine the feasibility of applying Korean Diagnosis Related Groups (KDRGs) to classify health insurance claims for ambulatory care and to identify problem areas of the classification. A database of 11,586,270 claims for ambulatory care delivered during January 2002 was obtained for the study, and the final number of claims analyzed was 8,319,494 after KDRG numbers were assigned to the data and records with an error KDRG were excluded from the study. The unit of analysis was a claim and resource use was measured by the sum of charges incurred during a month at a department of a hospital of at a clinic. Within group variance was assessed by th coefficient of variation (CV), and the classification accuracy was evaluated by the variance reduction achieved by the KDRG classification. The analyses were performed on both all and non-outlier data, and on a subset of the database to examine the validity of study results. Data were assigned to 787 KDRGs among 1,244 KDRGs defined in the classification system. For non-outlier data, 77.4％ of KDRGs had a CV of charges from tertiary care hospitals less than 100％ and 95.43％ of KDRGs for data from clinics. The variance reduction achieved by the KDRG classification was 40.80％ for non-outlier claims from tertiary care hospitals, 51.98％ for general hospitals, 40.89% for hospitals, and 54.99% for clinics. Similar results were obtained from the analyses performed on a subset of the study database. The study results indicated that KDRGs developed for a classification of inpatient care could be used for ambulatory care, although there were areas where the classification should be refined. Its power to predict tile resource utilization showed a potential for its application to measure case mix of providers for monitoring and managing delivery of ambulatory care. The issue concerning the quality of diagnostic information contained in insurance claims remains to be improved, and significance of future studies for other classification systems based on visits or episodes is guaranteed.

• 충청수학회지
• /
• 제26권2호
• /
• pp.323-342
• /
• 2013

Let $C[0,t]$ denote the function space of all real-valued continuous paths on $[0,t]$. Define $Xn:C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ and $X_{n+1}:C[0,t]{\rightarrow}\mathbb{R}^{n+2}$ by $X_n(x)=(x(t_0),x(t_1),{\cdots},x(t_n))$ and $X_{n+1}(x)=(x(t_0),x(t_1),{\cdots},x(t_n),x(t_{n+1}))$, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n$ < $t_{n+1}=t$. In the present paper, using simple formulas for the conditional expectations with the conditioning functions $X_n$ and $X_{n+1}$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transforms and the conditional convolution products of the functions which have the form $${\int}_{L_2[0,t]}{{\exp}\{i(v,x)\}d{\sigma}(v)}{{\int}_{\mathbb{R}^r}}\;{\exp}\{i{\sum_{j=1}^{r}z_j(v_j,x)\}dp(z_1,{\cdots},z_r)$$ for $x{\in}C[0,t]$, where $\{v_1,{\cdots},v_r\}$ is an orthonormal subset of $L_2[0,t]$ and ${\sigma}$ and ${\rho}$ are the complex Borel measures of bounded variations on $L_2[0,t]$ and $\mathbb{R}^r$, respectively. We then investigate the inverse transforms of the function with their relationships and finally prove that the analytic conditional Fourier-Feynman transforms of the conditional convolution products for the functions, can be expressed in terms of the products of the conditional Fourier-Feynman transforms of each function.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.