• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.496-502
• /
• 2006

The complexity of IC has rapidly increased as VLSI fabrication technology has grown up quickly. This paper proposes verification methods for data conflicts and protocol between IPs for SoC with coverage metrics. The high-level events is defined to cooperation between blocks or process statement in HDL, or a sequence of performing a job compared to low-level event. They are classified into two categories, resource conflicts and protocol or specification-dependent conflicts. And two coverage metrics used for code coverage in low-level event are proposed to verify the hish-level events. The events of resource conflicts can be detected by using statement coverage metric if global signal or variable has flags in a testbench program, and protocol-dependent events can be checked by data flow metric or path metric.

• 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.

• International Journal of Reliability and Applications
• /
• v.4 no.3
• /
• pp.131-139
• /
• 2003

There is a new trend of incorporating software coverage metrics into software modelling. This paper proposes and empirically evaluates a software reliability growth model, which relates reliability to coverage. The proposed model is derived by modifying the assumptions on which Veevers and Marshall model is based.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.23 no.3
• /
• pp.80-93
• /
• 1995

The purpose of this study was to assess functioni fo urban greenspace to reduce atmospheric CO\sub 2\ concentration. The study quantified carbon storage in urban greenspace and carbon emission by fossil fuel consumptio in Chuncheon. The amount of carbon storage in vegetation by land use type was 0.02kg/$m^2$ for commercial land, 4.36kg/$m^2$ for natural land, and 0.54kg/$m^2$ for the other urban lands. In 1994, total amount of carbon emission by fossil fuel consumption was about 257,358 metric tons, and the per capita carbon emission was 1.4 metric ton. Total amount of carbon storage in vegetation was 42,942 metric tons, approximately 17% of the carbon emission. This study excluded quantification of carbon storage in soils. The role of urban greenspace to sequester atomspheric carbon might be much greater, if a soil greenspace to sequester atmospheric carbon might be much greater, if a soil greenspace to sequester atmospheric carbon might be much greater, if a soil carbon storage is included quantification of carbon storage is included. However, increasing coverage of trees and managing them for healthy growth would not be sufficient for avoiding adverse impacts by future climate change. Additional measures should be followed such as an increase of energy use efficiency and development of substitute energy.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.4
• /
• pp.266-276
• /
• 2001

Due to the rapid development of semiconductor technology, the complexity of VLSI circuits has heavily increased. With the increased densities of integrated circuits, several different types of faults can occur Thus, testing such circuits is becoming a sever problem. Delay testing can detect system timing failures caused by delay faults. However, the conventional delay fault coverage in terms of the number of detected faults may not be an effective measure of delay testing because, unlike a stuck-at-faults, the impact of a delay fault is dependent on its delay defect size rather than on its existence. Thus, the effectiveness of delay testing is dependent on the propagation delay of the path to be tested, the delay defect size, and the system clock interval. This paper proposes a new delay defect fault coverage that considers both propagation delay of the path to be tested and additional delay defect size. And the relationship between delay defect fault coverage and defect level is analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.204-211
• /
• 2012

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.55-62
• /
• 2010

Monitoring systems are able to report certain events at region of interest(ROI) and to take an appropriate action. From industrial product line full of robots to fire detection, intrusion detection, smart grid application, environmental pollution alarm system, monitoring system has widely used in diverse industry sector. Recently, due to advance of wireless communication technology and availability of low cost sensors, intelligent and/or smart monitoring systems such as sensor networks has been developed. Several deployment methods are introduced to meet various monitoring needs and deployment performance criteria are also summarized to be used to identify weak point and be useful at designing monitoring systems. Both efficiency during deployment and usefulness after the deployment should be assessed. Efficiency factors during deployment are elapsed time, energy required, deployment cost, safety, sensor node failure rate, scalability. Usefulness factors after deployment are ROI coverage, connectivity, uniformity, target density similarity, energy consumption rate per unit time and so on.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.4
• /
• pp.24-24
• /
• 2001

빠른 반도체 기술의 발전으로 인하여 VLSI 회로의 복잡도는 크게 증가하고 있다. 그래서 복잡한 회로를 테스팅하는 것은 아주 어려운 문제로 대두되고 있다. 또한 집적회로의 증가된 집적도로 인하여 여러 가지 형태의 고장이 발생하게 됨으로써 테스팅은 더욱 중요한 문제로 대두되고 있다. 이제까지 일반적으로 지연 고장 테스팅에 대한 신뢰도는 가정된 고장의 개수에 대한 검출된 고장의 개수로 표현되는 전통적인 고장 검출율로서 평가되었다. 그러나 기존의 교장 검출율은 고장 존재의 유무만을 고려한 것으로써 실제의 지연 고장 테스팅에 대한 신뢰도와는 거리가 있다. 지연 고장 테스팅은 고착 고장과는 달리 경로의 진행 지연과 지연 결함 크기 그리고 시스템 동작 클럭 주기에 의존하기 때문이다. 본 논문은 테스트 중인 경로의 진행 지연과 지연 결함 크기를 고려한 새로운 고장 검출율 메트릭으로서지연 결함 고장 검출율(delay defect fault coverage)을 제안하였으며, 지연 결함 고장 검출율과 결함 수준(defect level)과의 관계를 분석하였다

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.