• Title/Summary/Keyword: Coverage Problem

Search Result 360, Processing Time 0.04 seconds

Automated Test Data Generation for Dynamic Branch Coverage (동적 분기 커버리지를 위한 테스트 데이터 자동 생성)

  • Chung, In Sang
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.7
    • /
    • pp.451-460
    • /
    • 2013
  • In order to achieve high test coverage, it is usual to generate test data using various techniques including symbolic execution, data flow analysis or constraints solving. Recently, a technique for automated test data generation that fulfills high coverage effectively without those sophisticated means has been proposed. However, the technique shows its weakness in the generation of test data that leads to high coverage for programs having branch conditions where different memory locations are binded during execution. For certain programs with flag conditions, in particular, high coverage can not be achieved because specific branches are not executed. To address the problem, this paper presents dynamic branch coverage criteria and a test data generation technique based on the notion of dynamic branch. It is shown that the proposed technique compared to the previous approach is more effective by conducting experiments involving programs with flag conditions.

An optimized deployment strategy of smart smoke sensors in a large space

  • Liu, Pingshan;Fang, Junli;Huang, Hongjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.11
    • /
    • pp.3544-3564
    • /
    • 2022
  • With the development of the NB-IoT (Narrow band Internet of Things) and smart cities, coupled with the emergence of smart smoke sensors, new requirements and issues have been introduced to study on the deployment of sensors in large spaces. Previous research mainly focuses on the optimization of wireless sensors in some monitoring environments, including three-dimensional terrain or underwater space. There are relatively few studies on the optimization deployment problem of smart smoke sensors, and leaving large spaces with obstacles such as libraries out of consideration. This paper mainly studies the deployment issue of smart smoke sensors in large spaces by considering the fire probability of fire areas and the obstacles in a monitoring area. To cope with the problems of coverage blind areas and coverage redundancy when sensors are deployed randomly in large spaces, we proposed an optimized deployment strategy of smart smoke sensors based on the PSO (Particle Swarm Optimization) algorithm. The deployment problem is transformed into a multi-objective optimization problem with many constraints of fire probability and barriers, while minimizing the deployment cost and maximizing the coverage accuracy. In this regard, we describe the structure model in large space and a coverage model firstly, then a mathematical model containing two objective functions is established. Finally, a deployment strategy based on PSO algorithm is designed, and the performance of the deployment strategy is verified by a number of simulation experiments. The obtained experimental and numerical results demonstrates that our proposed strategy can obtain better performance than uniform deployment strategies in terms of all the objectives concerned, further demonstrates the effectiveness of our strategy. Additionally, the strategy we proposed also provides theoretical guidance and a practical basis for fire emergency management and other departments to better deploy smart smoke sensors in a large space.

Optimization of PSG Flowing and Metallization for Step Coverage Improvement (스텝 커버리지를 위한 PSG와 기첩처리 공정 조건의 개선)

  • 김도진;이종덕
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.19 no.6
    • /
    • pp.91-95
    • /
    • 1982
  • One significant problem which arises during the fabrication of LSI and/or VLSI is how to make a good step coverage for aluminum. One way developed in this study is to flow PSG containing 8.0 wt.% - 8.6 wt.% of phosphorus at 95$0^{\circ}C$ for 30 minutes in steam and to depo3it aluminum of 1 urn thickness at $250^{\circ}C$.

  • PDF

An Optimization Algorithm for the Maximum Lifetime Coverage Problems in Wireless Sensor Network

  • Ahn, Nam-Su;Park, Sung-Soo
    • Management Science and Financial Engineering
    • /
    • v.17 no.2
    • /
    • pp.39-62
    • /
    • 2011
  • In wireless sensor network, since each sensor is equipped with a limited power, efficient use of the energy is important. One possible network management scheme is to cluster the sensors into several sets, so that the sensors in each of the sets can completely perform the monitoring task. Then the sensors in one set become active to perform the monitoring task and the rest of the sensors switch to a sleep state to save energy. Therefore, we rotate the roles of the active set among the sensors to maximize the network lifetime. In this paper, we suggest an optimal algorithm for the maximum lifetime coverage problem which maximizes the network lifetime. For comparison, we implemented both the heuristic proposed earlier and our algorithm, and executed computational experiments. Our algorithm outperformed the heuristic concerning the obtained network lifetimes, and it found the solutions in a reasonable amount of time.

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.

Subepithelial connective tissue graft in combination with enamel matrix derivative for root coverage within different case of gingival recession: Case report (법랑기질유도체와 결합조직이식술을 이용한 치근피개술: 치은퇴축과 관련된 다양한 증례)

  • Lee, Jae-Hong
    • The Journal of the Korean dental association
    • /
    • v.55 no.3
    • /
    • pp.230-239
    • /
    • 2017
  • Root coverage can be an efficacious treatment not only in aspect of dental symptoms like root caries and hypersensitivity, but also in aspect of esthetic problem. There are several predictable methods for gaining a connective tissue attachment to an exposed root surface. Among them, this case report will deal with three cases using enamel matrix derivative and connective tissue graft to recover esthetic and physiological periodontal environment and its form. This case report deals with three patients with gingival recession which has occurred by different causes. They were treated with de-epithelialized graft accompanied by application of enamel matrix derivative. 6-12 months later, all three patients showed considerable root coverage and clinically stable condition of healing. In conclusion, within the limitation of this study, de-epithelialized connective tissue graft accompanied by application of enamel matrix derivative shows stable and clinical acceptable results in aspect of root coverage.

  • PDF

HDRE: Coverage Hole Detection with Residual Energy in Wireless Sensor Networks

  • Zhang, Yunzhou;Zhang, Xiaohua;Fu, Wenyan;Wang, Zeyu;Liu, Honglei
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.493-501
    • /
    • 2014
  • Coverage completeness is an important indicator for quality of service in wireless sensor networks (WSN). Due to limited energy and diverse working conditions, the sensor nodes have different lifetimes which often cause network holes. Most of the existing methods expose large limitation and one-sidedness because they generally consider only one aspect, either coverage rate or energy issue. This paper presents a novel method for coverage hole detection with residual energy in randomly deployed wireless sensor networks. By calculating the life expectancy of working nodes through residual energy, we make a trade-off between network repair cost and energy waste. The working nodes with short lifetime are screened out according to a proper ratio. After that, the locations of coverage holes can be determined by calculating the joint coverage probability and the evaluation criteria. Simulation result shows that compared to those traditional algorithms without consideration of energy problem, our method can effectively maintain the coverage quality of repaired WSN while enhancing the life span of WSN at the same time.

Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.7
    • /
    • pp.33-40
    • /
    • 2015
  • The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.

BAYESIAN INFERENCE FOR FIELLER-CREASY PROBLEM USING UNBALANCED DATA

  • Lee, Woo-Dong;Kim, Dal-Ho;Kang, Sang-Gil
    • Journal of the Korean Statistical Society
    • /
    • v.36 no.4
    • /
    • pp.489-500
    • /
    • 2007
  • In this paper, we consider Bayesian approach to the Fieller-Creasy problem using noninformative priors. Specifically we extend the results of Yin and Ghosh (2000) to the unbalanced case. We develop some noninformative priors such as the first and second order matching priors and reference priors. Also we prove the posterior propriety under the derived noninformative priors. We compare these priors in light of how accurately the coverage probabilities of Bayesian credible intervals match the corresponding frequentist coverage probabilities.

Distributed Construction of Connected Cover Graph in Wireless Sensor Networks

  • Le, Duc Tai;Duc, Thang Le;Hwang, Boram;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.605-606
    • /
    • 2012
  • In this paper, we consider the problem of scheduling sensor activity to prolong the network lifetime while guaranteeing both discrete target coverage and connectivity among all the active sensors and the sink, called connected target coverage (CTC) problem. We proposed a distributed scheme called Distributed Lifetime-Maximizing Scheme (DLMS) to solve the CTC problem. Our proposed scheme significantly reduces the cost of the construction of the connected cover graphs in comparison with the some conventional schemes. In addition, the energy consumption is more balanced so that the network lifetime will be increased. Our simulation results show that DLMS scheme performs much better than the conventional schemes in terms of the network lifetime.