• 제목/요약/키워드: COVERAGE

검색결과 4,948건 처리시간 0.025초

Virtual Coverage: A New Approach to Coverage-Based Software Reliability Engineering

  • Park, Joong-Yang;Lee, Gyemin
    • Communications for Statistical Applications and Methods
    • /
    • 제20권6호
    • /
    • pp.467-474
    • /
    • 2013
  • It is common to measure multiple coverage metrics during software testing. Software reliability growth models and coverage growth functions have been applied to each coverage metric to evaluate software reliability; however, analysis results for the individual coverage metrics may conflict with each other. This paper proposes the virtual coverage metric of a normalized first principal component in order to avoid conflicting cases. The use of the virtual coverage metric causes a negligible loss of information.

Designing a large recording script for open-domain English speech synthesis

  • Kim, Sunhee;Kim, Hojeong;Lee, Yooseop;Kim, Boryoung;Won, Yongkook;Kim, Bongwan
    • 말소리와 음성과학
    • /
    • 제13권3호
    • /
    • pp.65-70
    • /
    • 2021
  • This paper proposes a method for designing a large recording script for open domain English speech synthesis. For read-aloud style text, 12 domains and 294 sub-domains were designed using text contained in five different news media publications. For conversational style text, 4 domains and 36 sub-domains were designed using movie subtitles. The final script consists of 43,013 sentences, 27,085 read-aloud style sentences, and 15,928 conversational style sentences, consisting of 549,683 tokens and 38,356 types. The completed script is analyzed using four criteria: word coverage (type coverage and token coverage), high-frequency vocabulary coverage, phonetic coverage (diphone coverage and triphone coverage), and readability. The type coverage of our script reaches 36.86% despite its low token coverage of 2.97%. The high-frequency vocabulary coverage of the script is 73.82%, and the diphone coverage and triphone coverage of the whole script is 86.70% and 38.92%, respectively. The average readability of whole sentences is 9.03. The results of analysis show that the proposed method is effective in producing a large recording script for English speech synthesis, demonstrating good coverage in terms of unique words, high-frequency vocabulary, phonetic units, and readability.

A Coverage Function for Arbitrary Testing Profile and Its Performance

  • Park Joong-Yang;Fujiwara Takaji;Park Jae-Heung
    • International Journal of Reliability and Applications
    • /
    • 제6권2호
    • /
    • pp.87-99
    • /
    • 2005
  • Coverage-based software reliability growth models (SRGMs) have been developed and successfully applied in practice. Performance of a coverage-based SRG M depends on the coverage function employed by the SRGM. When the coverage function represents the coverage growth behavior well irrespective of type of the testing profile the corresponding coverage-based SRGM is expected to be widely applicable. This paper first conducts a study of selecting the most representative coverage functions among the available coverage functions. Then their performances are empirically evaluated and compared. The result provides a foundation for developing widely applicable coverage-based SRGMs and monitoring the progress of a testing process.

  • PDF

Selection of a Predictive Coverage Growth Function

  • Park, Joong-Yang;Lee, Gye-Min
    • Communications for Statistical Applications and Methods
    • /
    • 제17권6호
    • /
    • pp.909-916
    • /
    • 2010
  • A trend in software reliability engineering is to take into account the coverage growth behavior during testing. A coverage growth function that represents the coverage growth behavior is an essential factor in software reliability models. When multiple competitive coverage growth functions are available, there is a need for a criterion to select the best coverage growth functions. This paper proposes a selection criterion based on the prediction error. The conditional coverage growth function is introduced for predicting future coverage growth. Then the sum of the squares of the prediction error is defined and used for selecting the best coverage growth function.

A Class of Discrete Time Coverage Growth Functions for Software Reliability Engineering

  • Park, Joong-Yang;Lee, Gye-Min;Park, Jae-Heung
    • Communications for Statistical Applications and Methods
    • /
    • 제14권3호
    • /
    • pp.497-506
    • /
    • 2007
  • Coverage-based NHPP SRGMs have been introduced in order to incorporate the coverage growth behavior into the NHPP SRGMs. The coverage growth function representing the coverage growth behavior during testing is thus an essential factor of the coverage-based NHPP SRGMs. This paper proposes a class of discrete time coverage growth functions and illustrates its application to real data sets.

데드라인을 고려하는 효율적인 지능형 로봇 커버리지 알고리즘 (An Efficient Coverage Algorithm for Intelligent Robots with Deadline)

  • 전흥석;정은진;강현규;노삼혁
    • 정보처리학회논문지A
    • /
    • 제16A권1호
    • /
    • pp.35-42
    • /
    • 2009
  • 이 논문은 지능형 로봇을 위한 새로운 커버리지 알고리즘을 제안한다. 커버리지 알고리즘의 성능을 향상하기 위한 많은 연구들은 전체 커버리지 완료 시간을 최소화하는데 초점을 맞추어왔다. 그러나, 만일 전체 커버리지를 완료하기에 충분한 시간이 없다면, 최적의 경로는 달라질 수 있다. 이러한 문제를 해결하기 위하여 본 논문에서는 MaxCoverage라고 하는 데드라인이 있을 경우에 가능한 많은 면적을 커버하기 위한 새로운 커버리지 알고리즘을 제안한다. MaxCoverage 알고리즘은 이동 경로를 셋 커버 문제를 위한 그리디 알고리즘을 이용하여 결정한다. 실험 결과에 의하면 MaxCoverage 알고리즘은 임의의 데드라인에 대하여 다른 알고리즘들에 비해 향상된 성능을 보여준다.

Estimation of Coverage Growth Functions

  • Park, Joong-Yang;Lee, Gye-Min;Kim, Seo-Yeong
    • Communications for Statistical Applications and Methods
    • /
    • 제18권5호
    • /
    • pp.667-674
    • /
    • 2011
  • A recent trend in software reliability engineering accounts for the coverage growth behavior during testing. The coverage growth function (representing the coverage growth behavior) has become an essential component of software reliability models. Application of a coverage growth function requires the estimation of the coverage growth function. This paper considers the problem of estimating the coverage growth function. The existing maximum likelihood method is reviewed and corrected. A method of minimizing the sum of squares of the standardized prediction error is proposed for situations where the maximum likelihood method is not applicable.

미지의 환경에서 동작하는 SLAM 기반의 로봇 커버리지 알고리즘 (A Robot Coverage Algorithm Integrated with SLAM for Unknown Environments)

  • 박정규;전흥석;노삼혁
    • 한국컴퓨터정보학회논문지
    • /
    • 제15권1호
    • /
    • pp.61-69
    • /
    • 2010
  • 로봇이 동작하는 환경을 완벽하게 커버리지 하기 위해서는 전체환경 지도를 가지고 있어야 한다. 그러나 대부분의 기존 커버리지 알고리즘은 로봇이 동작하기 전 사전에 생성된 지도가 있어야 동작 한다. 이런 이유로 기존의 커버리지 알고리즘은 미지의 환경에 바로 적용할 수 없는 문제를 가지고 있다. 미지의 환경에서 로봇이 모든 영역을 커버리지 하기위해서는 로봇스스로 환경 지도를 생성할 수 있어야한다. 본 논문에서는 SLAM 알고리즘을 통합하여 미지의 환경에서 로봇이 환경 지도를 생성하며 생성된 지도를 기반으로 커버리지를 수행하는 DmaxCoverage 알고리즘을 제안한다. 시뮬레이션 실험을 통해서 DmaxCoverage 알고리즘이 기존의 커버리지 알고리즘에 비해서 효율적임을 증명하였다.

모바일 에드 혹 네트워크에서 커버리지 스케쥴링 제어 알고리즘 (Coverage Scheduling control Algorithm in MANET)

  • 오영준;이강환
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2014년도 추계학술대회
    • /
    • pp.848-850
    • /
    • 2014
  • 본 논문에서는 이동 에드혹 네트워크(Mobile Ad hoc network: MANET)에서의 상황인식 기반의 스케쥴링 기법인 CSWC(Coverage Scheduling Weight-value Control) 알고리즘을 제안한다. 기존의 LEACH 알고리즘은 확률적 분포 함수에 의해 커버리지 영역 안에 존재 하는 클러스터 헤드노드를 선택하여 중계노드로 통신한다. 하지만 확률적 분포함수에 의해 선택된 헤드 노드가 커버리지 영역에서 전송거리 비율이 비균형으로 나뉘어 전송할 경우, 노드의 에너지 소모가 일정하지 않아 효율적으로 사용하지 못하는 경우가 발생한다. 따라서 본 논문에서는 최적의 커버리지 영역을 설정하여 유지하는 CSWC알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘은 커버리지 영역이 비균형으로 설정되어 있을 경우, 커버러지 영역을 결정하는 홉 수를 증가시켜 최적의 커버리지 영역을 제공하는 알고리즘이다. 주어진 모의실험 환경에서 노드의 효율적인 커버리지 영역을 설정하여 네트워크의 최적화된 에너지 소모를 보여주고 있다.

  • PDF

Modelling the Failure Rate Function in Coverage and Software Reliability Growth

  • Park, Joong-Yang;Kim, Young-Soon;Park, Jae-Heung
    • International Journal of Quality Innovation
    • /
    • 제5권1호
    • /
    • pp.110-121
    • /
    • 2004
  • There is a new trend of incorporating software coverage metrics into software reliability modelling. This paper proposes a coverage-based software reliability growth model. Firstly, the failure rate function in coverage is analytically derived. Then it is shown that the number of detected faults follows a Nonhomogeneous Poisson distribution of which intensity function is the failure rate function in coverage. Practical applicability of the proposed models is examined by illustrative numerical examples.