• Title/Summary/Keyword: Data coverage

Search Result 1,406, Processing Time 0.03 seconds

Statistical Properties of News Coverage Data

  • Lim, Eunju;Hahn, Kyu S.;Lim, Johan;Kim, Myungsuk;Park, Jeongyeon;Yoon, Jihee
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.6
    • /
    • pp.771-780
    • /
    • 2012
  • In the current analysis, we examine news coverage data widely used in media studies. News coverage data is usually time series data to capture the volume or the tone of the news media's coverage of a topic. We first describe the distributional properties of autoregressive conditionally heteroscadestic(ARCH) effects and compare two major American newspaper's coverage of U.S.-North Korea relations. Subsequently, we propose a change point detection model and apply it to the detection of major change points in the tone of American newspaper coverage of U.S.-North Korea relations.

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

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.

A Sensing Radius Intersection Based Coverage Hole Recovery Method in Wireless Sensor Network (센서 네트워크에서 센싱 반경 교차점 기반 홀 복구 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.3
    • /
    • pp.431-439
    • /
    • 2021
  • Since the sensor nodes are randomly arranged in the region of interest, it may happen that the sensor network area is separated or there is no sensor node in some area. In addition, after the sensor nodes are deployed in the sensor network, a coverage hole may occur due to the exhaustion of energy or physical destruction of the sensor nodes. The coverage hole can greatly affect the overall performance of the sensor network, such as reducing the data reliability of the sensor network, changing the network topology, disconnecting the data link, and worsening the transmission load. Therefore, sensor network coverage hole recovery has been studied. Existing coverage hole recovery studies present very complex geometric methods and procedures in the two-step process of finding a coverage hole and recovering a coverage hole. This study proposes a method for discovering and recovering a coverage hole in a sensor network, discovering that the sensor node is a boundary node by itself, and determining the location of a mobile node to be added. The proposed method is expected to have better efficiency in terms of complexity and message transmission compared to previous methods.

On the Study of Perfect Coverage for Recommender System

  • Lee, Hee-Choon;Lee, Seok-Jun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.4
    • /
    • pp.1151-1160
    • /
    • 2006
  • The similarity weight, the pearson's correlation coefficient, which is used in the recommender system has a weak point that it cannot predict all of the prediction value. The similarity weight, the vector similarity, has a weak point of the high MAE although the prediction coverage using the vector similarity is higher than that using the pearson's correlation coefficient. The purpose of this study is to suggest how to raise the prediction coverage. Also, the MAE using the suggested method in this study was compared both with the MAE using the pearson's correlation coefficient and with the MAE using the vector similarity, so was the prediction coverage. As a result, it was found that the low of the MAE in the case of using the suggested method was higher than that using the pearson's correlation coefficient. However, it was also shown that it was lower than that using the vector similarity. In terms of the prediction coverage, when the suggested method was compared with two similarity weights as I mentioned above, it was found that its prediction coverage was higher than that pearson's correlation coefficient as well as vector similarity.

  • PDF

Systematic Determination of Number of Clusters Based on Input Representation Coverage (클러스터 분석을 위한 IRC기반 클러스터 개수 자동 결정 방법)

  • 신미영
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.6
    • /
    • pp.39-46
    • /
    • 2004
  • One of the significant issues in cluster analysis is to identify a proper number of clusters hidden under given data. In this paper we propose a novel approach to systematically determine the number of clusters based on Input Representation Coverage (IRC), which is newly defined as a quantified value of how well original input data in Gaussian feature space can be captured with a certain number of clusters. Furthermore, its usability and applicability is also investigated via experiments with synthetic data. Our experiment results show that the proposed approach is quite useful in approximately finding the real number of clusters implicitly contained in the data.

Assessment of Appropriateness of Standard for Insurance Coverage on Chemotherapy used in Non-small Cell Lung Cancer (NSCLC) (비소세포폐암에 사용되는 항암화학요법의 요양급여기준 적절성 평가)

  • Kim, Jeong-Yeon;Park, Eun-Ji;Bae, Min-Kyung;Yoon, Jeong-Hyun
    • Korean Journal of Clinical Pharmacy
    • /
    • v.21 no.3
    • /
    • pp.193-207
    • /
    • 2011
  • Purpose: The purpose of this study is to assess appropriateness of current standard for insurance coverage by Health Insurance Review & Assessment Service (HIRA) on chemotherapy used in the treatment of advanced non-small cell lung cancer (NSCLC), by reviewing a variety of clinical evidences, and thereby, if needed, to propose an updated evidence-based recommendations. Methods: We collected data from HIRA regarding on the insurance standard which includes the scope and conditions for coverage on systemic chemotherapy of NSCLC. We performed a search for clinical databases and examined the most current clinical evidence from clinical literature including various clinical practice guidelines. Based on the collected data the appropriateness of HIRA standard for insurance coverage of chemotherapy of NSCLC was assessed. Results: Collected data demonstrated that HIRA standard did not reflect the most current clinical practice and evidence. Some were inappropriately listed in HIRA formulary and accepted as a chemotherapy being covered by insurance, despite the lack of evidences of clinical efficacy or superiority over other chemotherapeutic agents or regimens. In addition, there seems to be a need for a modification on the standard for insurance coverage of certain newer chemotherapeutic agents based on the current accumulated data showing their clinical efficacy and benefits in the selected group of NSCLC patients. Therefore, we concluded that current HIRA standard for insurance coverage on chemotherapy of NSCLC needs to be revised and we proposed an updated recommendation based on these latest clinical evidences. Conclusion: The standard for insurance coverage of chemotherapy should be continually examined its appropriateness based on the most recent clinical evidences in a timely manner so as to provide the most effective and safe therapy to cancer patients.

Time Series Analysis of the Correlation Between the Number of Drug Crime Arrests and Media Coverage for Enhancing Police Response to Drug Crimes (경찰 대응 능력 강화를 위한 마약 범죄 검거 수와 언론보도량의 시계열 분석)

  • Jeong-Woo Lee;Seungkook Roh
    • Journal of Industrial Convergence
    • /
    • v.21 no.6
    • /
    • pp.13-21
    • /
    • 2023
  • The purpose of this study is to investigate the relationship between the amount of media coverage related to drug crimes and the actual number of drug-related arrests. It aims to determine the implications of this relationship for the formulation of police policies in response to drug crimes. To achieve this, we collected and analyzed 50,355 domestic online media coverage data from 2001 to 2022 and drug crime arrest data compiled by the National Police Agency. The analysis confirmed a significant causal relationship between the amount of online media coverage of drug crimes and the actual number of drug crime arrests. This relationship was found to be influenced by the existence of dominant issues and the relevance of famous incidents. It was determined that media coverage was also influenced by public interest beyond drug crime arrest numbers. Based on these research findings, the police have proposed the need to monitor the amount of crime-related media coverage and enhance security capabilities for crimes that receive public attention in order to gain the trust of the citizens.

Optimal Underwater Coverage of a Cellular Region by Autonomous Underwater Vehicle Using Line Sweep Motion

  • Choi, Myoung-Hwan
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.6
    • /
    • pp.1023-1033
    • /
    • 2012
  • An underwater planar covering problem is studied where the coverage region consists of polygonal cells, and line sweep motion is used for coverage. In many subsea applications, sidescan sonar has become a common tool, and the sidescan sonar data is meaningful only when the sonar is moving in a straight line. This work studies the optimal line sweep coverage where the sweep paths of the cells consist of straight lines and no turn is allowed inside the cell. An optimal line sweep coverage solution is presented when the line sweep path is parallel to an edge of the cell boundary. The total time to complete the coverage task is minimized. A unique contribution of this work is that the optimal sequence of cell visits is computed in addition to the optimal line sweep paths and the optimal cell decomposition.

Grid Coverage Component Development Reusing Existing Grid Coverage Components

  • Kim, Hong-Gab;Lim, Young-Jae;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1105-1107
    • /
    • 2003
  • Remote sensing data processing and analysis system can be developed based on the Grid Coverage Specification and this kind of system is also can be easily interoperate with GIS systems conforming OpenGIS specification. This paper proposes a method to implement easily and quickly the new grid coverages that provide new operations, or services, by reusing the existing grid coverage components, which is based on the fact that the pipeline constructed by grid coverages can be represented in one grid coverage. This method complements easily the deficiency of the existing grid coverage components and enables quick implementation of the new grid coverage that provides complex processing operations.

  • PDF