• Title/Summary/Keyword: Number of case

Search Result 8,899, Processing Time 0.039 seconds

Design and performance evaluation of WDMA protocols for high-speed optical network (수동 성형 구조의 고속 광통신망을 위한 WDMA 프로토콜 및 성능평가에 관한 연구)

  • 이호숙;최형윤;이남준;박성우;김영천
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.59-68
    • /
    • 1996
  • In this paper, we propose two types of WDMA protocol for multi-wavelength optical networks that have a dedicated control channel. Protocol type I is designed for the case that the number of nimislots is less than the number of nodes (La${\ge}$M). Proposed protocols employ the aging scheme to guarantee a fairness in the process of channel allocation. The perfomrance of proposed protocols are evaluated in terms of throughput and delay with variations in offered load. Simulation results show that the proposed protocols have superior performance to conventional protocols.

  • PDF

The Impact of Hospital Specialization on Length of Stay per Case and Hospital Charge per Case (병원 전문화가 건당 재원일수와 건당 의료비에 미치는 영향)

  • Kim, Jae-Hyun;Park, Eun-Cheol;Kim, Tae Hyun;Lee, Kwang Soo;Kim, Young Hoon;Lee, Sang Gyu
    • Health Policy and Management
    • /
    • v.26 no.2
    • /
    • pp.107-114
    • /
    • 2016
  • Background: Over the last few decades, because hospitals in South Korea also have undergone dramatic changes, Korean hospitals traditionally have provided specialized health care services in the health care market. Inner Herfindahl-Hirschman Index (IHI) measures hospital caseloads based on patient proportions, independent of patient volumes. However, IHI that rely solely on patient proportions might be problematic for larger hospitals that provide a high number of diagnosis categories, as the patient proportions in each category are naturally relatively smaller in such hospitals. Therefore, recently developed novel measure, category medical specialization (CMS) is based on patient volumes as well as patient proportions. Methods: We examine the distribution of hospital specialization score by hospital size and investigate association between each hospital specialization and length of stay per case and hospital cost per case using Korean National Health Insurance Service-cohort sample data from 2002 to 2013. Results: Our results show that IHI show a decreasing trend according to the number of beds and hospital type but CMS show an increasing trend according to the number of beds and hospital type. Further, inpatients admitted at hospitals with higher IHI and CMS had a shorter length of stay per case (IHI: B=-0.104, p<0.0001; CMS: B=-0.044, p=0.001) and inpatients admitted at hospitals with higher IHI and CMS had a shorter hospital cost per case (IHI: B=-0.110, p=0.002; CMS: B=-0.118, p=<0.0001). Conclusion: This study may help hospital policymakers and hospital administrators to understand the effects of hospital specialization strategy on hospital performance under recent changes in the Korean health care environment.

A New Complexity Analysis of the SymMerge Algorithm (SymMerge 알고리즘의 새로운 복잡도 분석)

  • Kim, Pok-Son
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.515-521
    • /
    • 2015
  • The SymMerge algorithm is an efficient merging algorithm for input sequences u and v of sizes $\left|u \right|=m$ and $\left|v \right|=n$, $m{\leq}n$. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases "symmetric case" and "maximum spanning case" can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly $m\;log\frac{n}{m}+4m-logm-3$ comparisons for symmetric case of sizes $m=2^k,\;n=2^l,l{\geq}k$ of input sequences and exactly $\frac{1}{2}m^2+(m+1)logm-\frac{3}{2}m+2$ comparisons for maximum spanning case of sizes $m=2^k,n=2^m-m$ of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations.

Decision Making through the Game of Scissors-Paper-Stone and Simulation (가위바위보를 이용한 승부결정과 모의실험)

  • Cho, Dae-Hyeon
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.6
    • /
    • pp.1217-1224
    • /
    • 2010
  • In many sports games, we would use a coin or the game of scissors-paper-stone to decide which side will begin first. We consider the game of scissors-paper-stone when two teams are composed of N respectively. We continue the game of scissors-paper-stone until the winner of the two team is decided. Using sample spaces and enumerating the elements we calculated the mean number of the game when N = 1, N = 2 and N = 3. In case of N = 1 and N = 2, we simulate the game and find the mean and variance when the repetition number n = 20; 30; 50; 100; 150; 200.

Simple hypotheses testing for the number of trees in a random forest

  • Park, Cheol-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.2
    • /
    • pp.371-377
    • /
    • 2010
  • In this study, we propose two informal hypothesis tests which may be useful in determining the number of trees in a random forest for use in classification. The first test declares that a case is 'easy' if the hypothesis of the equality of probabilities of two most popular classes is rejected. The second test declares that a case is 'hard' if the hypothesis that the relative difference or the margin of victory between the probabilities of two most popular classes is greater than or equal to some small number, say 0.05, is rejected. We propose to continue generating trees until all (or all but a small fraction) of the training cases are declared easy or hard. The advantage of combining the second test along with the first test is that the number of trees required to stop becomes much smaller than the first test only, where all (or all but a small fraction) of the training cases should be declared easy.

Bernoulli and Euler Polynomials in Two Variables

  • Claudio Pita-Ruiz
    • Kyungpook Mathematical Journal
    • /
    • v.64 no.1
    • /
    • pp.133-159
    • /
    • 2024
  • In a previous work we studied generalized Stirling numbers of the second kind S(a2,b2,p2)a1,b1 (p1, k), where a1, a2, b1, b2 are given complex numbers, a1, a2 ≠ 0, and p1, p2 are non-negative integers given. In this work we use these generalized Stirling numbers to define Bernoulli polynomials in two variables Bp1,p2 (x1, x2), and Euler polynomials in two variables Ep1p2 (x1, x2). By using results for S(1,x2,p2)1,x1 (p1, k), we obtain generalizations, to the bivariate case, of some well-known properties from the standard case, as addition formulas, difference equations and sums of powers. We obtain some identities for bivariate Bernoulli and Euler polynomials, and some generalizations, to the bivariate case, of several known identities for Bernoulli and Euler numbers and polynomials of the standard case.

A Recognition System for Multiple Mobile Robots Using RFID System in Smart Space (스마트 스페이스에서 RFID 시스템을 이용한 다수 이동로봇 인식 시스템)

  • Tak, Myung-Hwan;Yeom, Dong-Hae;Cho, Young-Jo;Joo, Young-Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.11
    • /
    • pp.2103-2107
    • /
    • 2010
  • This paper deals with the recognition of multiple mobile robots equipped with RFID tag. In the case that the number of robots recognized by each RFID reader is larger than that of allocated slots, the clashing recognition occurs. And, in the case that the total number of robots recognized by all RFID reader is larger than that of real robots, the repetitious recognition occurs. We employ the dynamic frame slot allocation by using the ALOHA algorithm to prevent the clashing recognition and estimate the number of robots by using the received signal strength indication to prevent the repetitious recognition. The numerical experiment shows the reliability and the efficiency of the proposed method.

Flow and Temperature Characteristics in a Circular Impinging Jet (원형 충돌 제트에서의 유동 및 온도 특성)

  • Kim Jungwoo;Choi Haecheon
    • Proceedings of the KSME Conference
    • /
    • 2002.08a
    • /
    • pp.237-240
    • /
    • 2002
  • In the present study, we perform LES of turbulent flow and temperature fields in a circular impinging jet at Re=5000 for two cases of H/D=2 and 6 (H denotes the distance between the jet exit and flat plate, and D does the diameter of the jet exit). In the case of H/D=2, the regular vortical structures observed in free jet do not exist because of the smaller distance than the potential core. The Nusselt number on the wall is largest at $r/D{\cong}10.67$ where vortex rings Impinge. At $r/D{\cong}1.5{\~}2.0$, the vortex rings induce the secondary vortices, resulting in a secondary peak in the Nusselt number there. In the case of H/D=6, the vortex rings change into three-dimensional vortical structures and the small-scale vortices impinge on the flat plate. The increase of turbulent intensity due to small-scale vortices results in the largest Nusselt number at the stagnation point.

  • PDF

An Experimental Study on Enhancement of Laminar Flow Heat Transfer in a Circular Pipe with Inserts (삽입물에 의한 관내 층류열전달 증진에 관한 실험적 연구)

  • 권영철;장근선;정지환
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.12 no.7
    • /
    • pp.667-673
    • /
    • 2000
  • In order to understand the laminar flow heat transfer enhancement by the swirl flow, the effects of heat transfer in a circular pipe with a twisted tape insert were investigated experimentally. In the present study, the uniform heat flux condition was considered. The laminar heat transfer correlations were developed using the least-square-fit from the surface temperature distribution of an electrically-heated pipe and flow property data. Average Nusselt number correlations with the twisted tape insert were expressed as a function of swirl parameter, Reynolds number and Prandtl number. In the case of the twisted ratio y = 6.05, the mean Nusselt number increased approximately 500% and the friction factor increased approximately 300%, compared to the case of the empty pipe, respectively.

  • PDF

Flavonoid Components in Plants of the Genus Scutellaria

  • YunChoi, Hye-Sook
    • Korean Journal of Pharmacognosy
    • /
    • v.23 no.4
    • /
    • pp.201-210
    • /
    • 1992
  • Scutellariae plants contain a large number of flavonoids and in addition, many of them are with unusual A- and/or B-ring substitutions. The total number of flavonoids reported up to the middle of 1991 are 137 including 89 of flavones, flavonols and their glycosides including 3 C-glycosides$(1{\sim}89)$, 39 of flavanones, dihydroflavonols and their glycosides $(90{\sim}128)$, 8 of chalcones $(129{\sim}136)$ and one biflavonoid, 8, 8'-bibaicalein(137). More than half of the flavonoids are with either unusual 5-metboxy(2'-methoxy in case of chalcones) in A-ring and/or 2'-oxygenation(2-oxygenation in case of chalcones) in B-ring substitutions. Four flavones, four flavanones and two chalcones are with methylation at 5-OH(2'-OH in case of chalcones) and six of them also have 2'-oxygenations(2- in case of chalcones). Sixtyeight out of total 137 flavonoids have oxygenated substitution at 2'-(2- in case of chalcones) position of B-ring and in addition, 27 of them have another oxygen function at 6'-(6- in case of chalcones) and 18 of them have additional oxygen substitutions either at 3'-, 5'-,3',6'-or 3', 4', 5'-(3, 4, 5- in case of chalcones) positions. The distribution and isolation of flavonoid components of Scutellariae plants are tabulated with references.

  • PDF