• Communications for Statistical Applications and Methods
• /
• v.20 no.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.

• Phonetics and Speech Sciences
• /
• v.13 no.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.

• International Journal of Reliability and Applications
• /
• v.6 no.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.

• Communications for Statistical Applications and Methods
• /
• v.17 no.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.

• Communications for Statistical Applications and Methods
• /
• v.14 no.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.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.35-42
• /
• 2009

This paper proposes a new coverage algorithm for intelligent robot. Many algorithms for improving the performance of coverage have been focused on minimizing the total coverage completion time. However, if one does not have enough time to finish the whole coverage, the optimal path could be different. To tackle this problem, we propose a new coverage algorithm, which we call MaxCoverage algorithm, for covering maximal area within the deadline. The MaxCoverage algorithm decides the navigation flow by greedy algorithm for Set Covering Problem. The experimental results show that the MaxCoverage algorithm performs better than other algorithms for random deadlines.

• Communications for Statistical Applications and Methods
• /
• v.18 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.61-69
• /
• 2010

An autonomous robot must have a global workspace map in order to cover the complete workspace. However, most previous coverage algorithms assume that they have a grid workspace map that is to be covered before running the task. For this reason, most coverage algorithms can not be applied to complete coverage tasks in unknown environments. An autonomous robot has to build a workspace map by itself for complete coverage in unknown environments. Thus, we propose a new DmaxCoverage algorithm that allows a robot to carry out a complete coverage task in unknown environments. This algorithm integrates a SLAM algorithm for simultaneous workspace map building. Experimentally, we verify that DmaxCoverage algorithm is more efficient than previous algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.848-850
• /
• 2014

Mobile Ad hoc Networks(MANET) is consist of node that has mobility, MANET build cluster formation for using energy efficient. In existing LEACH algorithm elect cluster head node in coverage area by distribution function. However, when the cluster head node, that elected by distribution function, is divided coverage area unevenly, the network can't consumption energy efficiency. To solve this problem, we proposed CSWC(Coverage Scheduling Weight-value Control) algorithm. When the coverage area is divided nonchalance, proposed algorithm increased number of hops, that determines coverage area, for balance coverage area. As the result proposed algorithm is set balance coverage area, the network consumption energy efficiency.

• International Journal of Quality Innovation
• /
• v.5 no.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.