• Title/Summary/Keyword: Maximum coverage

Search Result 231, Processing Time 0.03 seconds

The Study for ENHPP Software Reliability Growth Model based on Burr Coverage Function (Burr 커버리지 함수에 기초한 ENHPP소프트웨어 신뢰성장모형에 관한 연구)

  • Kim, Hee-Cheul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.33-42
    • /
    • 2007
  • Accurate predictions of software release times, and estimation of the reliability and availability of a software product require quantification of a critical element of the software testing process : test coverage. This model called Enhanced non-homogeneous poission process(ENHPP). In this paper, exponential coverage and S-shaped model was reviewed, proposes the Kappa coverage model, which maked out efficiency application for software reliability. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on SSE statistics and Kolmogorov distance, for the sake of efficient model, was employed. From the analysis of mission time, the result of this comparative study shows the excellent performance of Burr coverage model rather than exponential coverage and S-shaped model using NTDS data. This analysis of failure data compared with the Kappa coverage model and the existing model(using arithmetic and Laplace trend tests, bias tests) is presented.

  • PDF

Optimal Location Problem for Constrained Number of Emergency Medical Service (한정된 응급시설의 최적위치 문제)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.10
    • /
    • pp.141-148
    • /
    • 2013
  • This paper proposes an EMS algorithm designed to determine the optimal locations for Emergency Medical Service centers that both satisfy the maximum ambulance response time T in case of emergency and cover the largest possible number of residents given a limited number of emergency medical services p in a city divided into different zones. This methodology generally applies integer programming whereby cases are categorized into 1 if the distance between two zones is within the response time and 0 if not and subsequently employs linear programming to obtain the optimal solution. In this paper, where p=1, the algorithm determines a node with maximum coverage. In cases where $p{\geq}2$, the algorithm selects top 5 nodes with maximum coverage. Based on inclusion-exclusion method, this selection entails repeatedly selecting a node with the maximum coverage when nodes with lower numbers are deleted. Among these 5 selected nodes, the algorithm selects a single node set with the greatest coverage and thereby as the optimal EMS location. The proposed algorithm has proven to accurately and expeditiously obtain the optimal solutions for 12-node network, 21-node network, and Swain's 55-node network.

Dosimetric comparison of intensity-modulated radiotherapy (IMRT) and volumetric modulated arc therapy (VMAT) in total scalp irradiation: a single institutional experience

  • Ostheimer, Christian;Hubsch, Patrick;Janich, Martin;Gerlach, Reinhard;Vordermark, Dirk
    • Radiation Oncology Journal
    • /
    • v.34 no.4
    • /
    • pp.313-321
    • /
    • 2016
  • Purpose: Total scalp irradiation (TSI) is a rare but challenging indication. We previously reported that non-coplanar intensity-modulated radiotherapy (IMRT) was superior to coplanar IMRT in organ-at-risk (OAR) protection and target dose distribution. This consecutive treatment planning study compared IMRT with volumetric-modulated arc therapy (VMAT). Materials and Methods: A retrospective treatment plan databank search was performed and 5 patient cases were randomly selected. Cranial imaging was restored from the initial planning computed tomography (CT) and target volumes and OAR were redelineated. For each patients, three treatment plans were calculated (coplanar/non-coplanar IMRT, VMAT; prescribed dose 50 Gy, single dose 2 Gy). Conformity, homogeneity and dose volume histograms were used for plan. Results: VMAT featured the lowest monitor units and the sharpest dose gradient (1.6 Gy/mm). Planning target volume (PTV) coverage and homogeneity was better in VMAT (coverage, 0.95; homogeneity index [HI], 0.118) compared to IMRT (coverage, 0.94; HI, 0.119) but coplanar IMRT produced the most conformal plans (conformity index [CI], 0.43). Minimum PTV dose range was 66.8%-88.4% in coplanar, 77.5%-88.2% in non-coplanar IMRT and 82.8%-90.3% in VMAT. Mean dose to the brain, brain stem, optic system (maximum dose) and lenses were 18.6, 13.2, 9.1, and 5.2 Gy for VMAT, 21.9, 13.4, 14.5, and 6.3 Gy for non-coplanar and 22.8, 16.5, 11.5, and 5.9 Gy for coplanar IMRT. Maximum optic chiasm dose was 7.7, 8.4, and 11.1 Gy (non-coplanar IMRT, VMAT, and coplanar IMRT). Conclusion: Target coverage, homogeneity and OAR protection, was slightly superior in VMAT plans which also produced the sharpest dose gradient towards healthy tissue.

An Enhanced Scheme of Target Coverage Scheduling m Rotatable Directional Sensor Networks (회전 가능한 방향센서네트워크에서 타겟 커버리지 스케줄링 향상 기법)

  • Kim, Chan-Myung;Han, Youn-Hee;Gil, Joon-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8A
    • /
    • pp.691-701
    • /
    • 2011
  • In rotatable directional sensor networks, maximizing network lifetime while covering all the targets and forwarding the sensed data to the sink is a challenge problem. In this paper, we address the Maximum Directional Cover Tree (MDCT) problem of organizing the directional sensors into a group of non-disjoint subsets to extend the network lifetime. Each subset in which the directional sensors cover all the targets and forward the sensed data to the sink is activated at one time. For the MDCT problem, we first present an energy consumption model which mainly takes into account the energy consumption for rotation work. We also develop the Directional Coverage and Connectivity (DCC)-greedy algorithm to solve the MDCT problem. To evaluate the algorithm, we conduct simulations and show that it can extend the network lifetime.

The Study for ENHPP Software Reliability Growth Model Based on Kappa(2) Coverage Function (Kappa(2) 커버리지 함수를 이용한 ENHPP 소프트웨어 신뢰성장모형에 관한 연구)

  • Kim, Hee-Cheul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.12
    • /
    • pp.2311-2318
    • /
    • 2007
  • Finite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. Accurate predictions of software release times, and estimation of the reliability and availability of a software product require Release times of a critical element of the software testing process : test coverage. This model called Enhanced non-homogeneous Poission process(ENHPP). In this paper, exponential coverage and S-shaped model was reviewed, proposes the Kappa coverage model, which make out efficiency application for software reliability. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on SSE statistics and Kolmogorov distance, for the sake of efficient model, was employed. Numerical examples using real data set for the sake of proposing Kappa coverage model was employed. This analysis of failure data compared with the Kappaa coverage model and the existing model(using arithmetic and Laplace trend tests, bias tests) is presented.

Sensor Node Deployment in Wireless Sensor Networks Based on Tabu Search Algorithm (타부 서치 알고리즘 기반의 무선 센서 네트워크에서 센서 노드 배치)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.5
    • /
    • pp.1084-1090
    • /
    • 2015
  • In this paper, we propose a Tabu search algorithm to efficiently deploy the sensor nodes for maximizing the network sensing coverage in wireless sensor networks. As the number of the sensor nodes in wireless sensor networks increases, the amount of calculation for searching the solution would be too much increased. To obtain the best solution within a reasonable execution time in a high-density network, we propose a Tabu search algorithm to maximize the network sensing coverage. In order to search effectively, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum network sensing coverage and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

The Comparative Study for ENHPP Software Reliability Growth Model based on Modified Coverage Function (변형 커버리지 함수를 고려한 ENHPP 소프트웨어 신뢰성장 모형에 관한 비교 연구)

  • Kim, Hee-Cheul;Kim, Pyong-Koo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.89-96
    • /
    • 2007
  • Finite failure NHPP models presented in the literature exhibit either constant. monotonic increasing or monotonic decreasing failure occurrence rates per fault. Accurate predictions of software release times. and estimation of the reliability and availability of a software product require quality of a critical element of the software testing process : test coverage. This model called Enhanced non-homogeneous Poission process(ENHPP). In this paper, exponential coverage and S-type model was reviewed, proposes modified(the superosition and mixture) model, which make out efficiency application for software reliability. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method. model selection based on SSE statistics for the sake of efficient model, was employed.

  • PDF

The Study for ENHPP Software Reliability Growth Model based on Superposition Coverage Function (중첩커버리지 함수를 고려한 ENHPP 소프트웨어 신뢰성장 모형에 관한 연구)

  • Kim, Hee-Cheul;Shin, Hyun-Cheul
    • Convergence Security Journal
    • /
    • v.7 no.3
    • /
    • pp.7-13
    • /
    • 2007
  • Finite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. Accurate predictions of software release times, and estimation of the reliability and availability of a software product require quantification of a critical element of the software testing process : test coverage. This model called Enhanced non-homogeneous poission process (ENHPP). In this paper, exponential coverage and S-shaped model was reviewed, proposes the superposition model, which maked out efficiency application for software reliability. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on SSE statistics for the sake of efficient model, was employed.

  • PDF

Comparison of semiparametric methods to estimate VaR and ES (조건부 Value-at-Risk와 Expected Shortfall 추정을 위한 준모수적 방법들의 비교 연구)

  • Kim, Minjo;Lee, Sangyeol
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.1
    • /
    • pp.171-180
    • /
    • 2016
  • Basel committee suggests using Value-at-Risk (VaR) and expected shortfall (ES) as a measurement for market risk. Various estimation methods of VaR and ES have been studied in the literature. This paper compares semi-parametric methods, such as conditional autoregressive value at risk (CAViaR) and conditional autoregressive expectile (CARE) methods, and a Gaussian quasi-maximum likelihood estimator (QMLE)-based method through back-testing methods. We use unconditional coverage (UC) and conditional coverage (CC) tests for VaR, and a bootstrap test for ES to check the adequacy. A real data analysis is conducted for S&P 500 index and Hyundai Motor Co. stock price index data sets.

The Study on the Seed Mixture for the Revegetation of the Cut-slopes (비탈면의 조기식생녹화를 위한 식물배합에 관한 연구)

  • 김남춘;석원진;남상준
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.26 no.3
    • /
    • pp.8-18
    • /
    • 1998
  • This study was to make a effective seed mixture types with Korean native plants by researching te seed timing of suitable woody plants and competitive germination results of various plants for the purpose of cut-slotes revegetation. The results are summarized as follows. 1. In field polystand experiment, comparative among severalcomposition combination for early coverage shows good condition. 2. In combination for early-coverage, mixture of native woody plants only seeded in May and June shows over 90% coverage. It was not inferior to the other mixture types. So mixture of Albizzia Julibrissin, Cymbopogon doeringii, Alnus hirsuta and Indigfera pseudo-tinctoria is able to use to mixture type. 3.In case of combination for scenic beauty, Rhus chinensis shows low germination in the mixture for scenic beauty. But 90 days after seeded in May, it recorded maximum 44 cm height, seeded in June recorede 18 cm height. 4. Lespedeza crytobotrya shows good elongation in the combination for early coverage and scenic beauty, but that effects on elongation of other plants. So, it demands close investigation about suitable mixing rate of plants. 5. Alnus hirsuta, Pinus thunbergii, Betula platyphylla, Spiraea prunifolia var. simpliciflora have been rarely germinated. So, the mixture of these plants wasn't adequate to use for revegatation.

  • PDF