• 제목/요약/키워드: Complexity measure

검색결과 307건 처리시간 0.028초

Determining the complexity level of proceduralized tasks in a digitalized main control room using the TACOM measure

  • Inseok Jang;Jinkyun Park
    • Nuclear Engineering and Technology
    • /
    • 제54권11호
    • /
    • pp.4170-4180
    • /
    • 2022
  • The task complexity (TACOM) measure was previously developed to quantify the complexity of proceduralized tasks conducted by nuclear power plant operators. Following the development of the TACOM measure, its appropriateness has been validated by investigating the relationship between TACOM scores and three kinds of human performance data, namely response times, human error probabilities, and subjective workload scores. However, the information reflected in quantified TACOM scores is still insufficient to determine the levels of complexity of proceduralized tasks for human reliability analysis (HRA) applications. In this regard, the objective of this study is to suggest criteria for determining the levels of task complexity based on logistic regression between human error occurrences in digitalized main control rooms and TACOM scores. Analysis results confirmed that the likelihood of human error occurrence according to the TACOM score is secured. This result strongly implies that the TACOM measure can be used to identify the levels of task complexity, which could be applicable to various research domains including HRA.

슬라이스 기반 복잡도 척도 (A Slice-based Complexity Measure)

  • 문유미;최완규;이성주
    • 정보처리학회논문지D
    • /
    • 제8D권3호
    • /
    • pp.257-264
    • /
    • 2001
  • 본 논문은 데이터 슬라이스에서의 데이터 토큰들의 정보 흐름에 기초하여 프로그램에서의 정보 흐름을 모델링하는 SIFG(Slicw-based information Graph)를 개발하였다. 다음으로, SIFG에서의 정보 흐름의 복잡도 측정을 통해서 프로그램의 복잡도를 측정하기 위해 SCM(Slice-based Complexity Measure)을 정의하였다. SCM은 Briand가 제시하는 복잡도 메트릭에 필요한 특성들을 만족하였고, 그리고 기존 척도들과는 달리, SCM은 프로그램 내에서의 제어와 데이터 흐름뿐만 아니라 프로그램의 물리적 크기를 반영하는 측정이 이루어졌다.

  • PDF

INVESTIGATING THE APPROPRIATENESS OF THE TACOM MEASURE - APPLICATION TO THE COMPLEXITY OF PROCEDURALIZED TASKS FOR HIGH SPEED TRAIN DRIVERS

  • Park, Jin-Kyun;Jung, Won-Dea;Ko, Jong-Hyun
    • Nuclear Engineering and Technology
    • /
    • 제42권1호
    • /
    • pp.115-124
    • /
    • 2010
  • According to wide-spread experience in many industries, a procedure is one of the most effective countermeasures to reduce the possibility of human related problems. Unfortunately, a systematic framework to evaluate the complexity of procedural tasks seems to be very scant. For this reason, the TACOM measure, which can quantify the complexity of procedural tasks, has been developed. In this study, the appropriateness of the TACOM measure is investigated by comparing TACOM scores regarding the procedural tasks of high speed train drivers with the associated workload scores measured by the NASA-TLX technique. As a result, it is observed that there is a meaningful correlation between the TACOM scores and the associated NASA-TLX scores. Therefore, it is expected that the TACOM measure can properly quantify the complexity of procedural tasks.

슬라이스 복잡도 측정을 위한 VFG의 사용 (The Use of VFG for Measuring the Slice Complexity)

  • 문유미;최완규;이성주
    • 한국정보통신학회논문지
    • /
    • 제5권1호
    • /
    • pp.183-191
    • /
    • 2001
  • 본 논문은 데이터 슬라이스에서의 정보 흐름을 모델링하기 위해서 데이터 값 흐름 그래프(VFG: data Value Flow Graph)라고 하는 새로운 데이터 슬라이스(data slice) 표현을 개발한다. 다음으로, VFG에서의 정보 흐름의 복잡도를 측정하기 위해 기존의 흐름 복잡도를 이용하여 슬라이스 복잡도 척도를 정의한다. 본 연구에서는 각 슬라이스에 대한 슬라이스 복잡도와 전체 슬라이스 복잡도 간의 관계를 보여주고, VFG에서의 극소 수정(atomic modification)과 합성 연산자(concatenation operator)를 통해서 슬라이스 복잡도 척도의 스케일(scale) 인자들을 증명한다.

  • PDF

The Step Complexity Measure - Its Meaning and Applications

  • Park, Jinkyun;Wondea Jung;Kim, Jaewhan;Jaejoo Ha
    • Nuclear Engineering and Technology
    • /
    • 제35권1호
    • /
    • pp.80-90
    • /
    • 2003
  • According to related studies, it was revealed that the procedural deviation plays a significant role in initiating accidents or incidents. This means that, to maximize safety, it is indispensable to be able to answer the question of “why the operators deviate from procedures\ulcorner” In this study, the SC (step complexity) measure is introduced to investigate its applicability for studying the procedural deviation, since it was shown that the change of the operators' performance is strongly correlated with the change of SC scores. This means that the SC measure could play an important role for researches related to the procedural deviation, since it is strongly believed that complicated procedures would affect both the operator' performance and the possibility of the procedural deviation. Thus, to ensure this expectation, the meaning of the SC measure is investigated through brief explanations including the necessity, theoretical basis and verification activities of the SC measure. As a result, it is confirmed that the SC measure can be used to explain the change of the operators' performance due to the task complexity implied by procedures. In addition, it seems that the SC measure nay be useful for various purposes, particularly for scrutinizing the relationship between the procedural deviation and complicated procedures.

노트수에 의한 프로그램 복잡성 개선

  • 노철우
    • ETRI Journal
    • /
    • 제5권3호
    • /
    • pp.16-25
    • /
    • 1983
  • Increasing importance is being attached to the idea of measuring software characteristics. This paper deals with following things. First, a relation of program and flow graph is discussed. It describes a theoretic complexity measure and illustrates how it can be used to manage and control program complexity. Second, cyclomatic complexity measure is discussed. The complexity is independent of physical size and depends only on the decision structure of a program. Third, consider a knot which defines crossing point and provide the ordering of the nodes to make the transition from a two dimensional graph to a one dimensional program. A program modules that can improve FORTRAN IV program text is tested by knot counting and its control complexity is improved.

  • PDF

시계열 데이타의 흔돈도 분석 알고리즘에 관한 연구 (A Study on Complexity Measure Algorithm of Time Series Data)

  • 이병채;정기삼;이명호
    • 대한의용생체공학회:학술대회논문집
    • /
    • 대한의용생체공학회 1995년도 춘계학술대회
    • /
    • pp.281-284
    • /
    • 1995
  • This paper describes a complexity measure algorithm based on nonlinear dynamics(chaos theory). In order to quantify complexity or regularity of biomedical signal, this paper proposed fractal dimension-1 and fractal dimension-2 algorithm with digital filter. Approximate entropy algorithm which measure a system regularity are also compared. In this paper investigate what we quantify of biomedical signal. These quantified complexity measure may be a useful information about human physiology.

  • PDF

패트리넷트를 이용한 프로그램의 제어구분적 복잡도 (Software Complexity Measure Based on Program Control Structure Using Petri Nets)

  • 이종근;송유진
    • 한국정보처리학회논문지
    • /
    • 제2권3호
    • /
    • pp.335-342
    • /
    • 1995
  • 본 연구는 패트리네트를 이용한 소프트웨어의 이해용이성에 기인한 효율적인 복 잡도방법을 제시한다. 일반적으로 제어의 흐름에 있어서는 순차성과 조건문 그리고 반복문에 의한 구조적인 구분이 가능하므로 본 논문에서는 그러한 구조적인 부문을 패트리네트로 표현하여 각각의 이해용이성에 기인한 복잡도를 산출하여 종합적인 총 복잡도를 산출하였다. 또한 기존의 다른 복잡도와의 상관관계를 분석함으로 새로운 복 잡도의 신뢰성도 증명하였다.

  • PDF

로봇 운동솜씨의 작업 복잡도 (Task Complexity of Movement Skills for Robots)

  • 권우영;서일홍;이준구;유범재;오상록
    • 로봇학회논문지
    • /
    • 제7권3호
    • /
    • pp.194-204
    • /
    • 2012
  • Measuring task complexity of movement skill is an important factor to evaluate a difficulty of learning and/or imitating a task for autonomous robots. Although many complexity-measures are proposed in research areas such as neuroscience, physics, computer science, and biology, there have been little attention on the robotic tasks. To cope with measuring complexity of robotic task, we propose an information-theoretic measure for task complexity of movement skills. By modeling proprioceptive as well as exteroceptive sensor data as multivariate Gaussian distribution, movements of a task can be modeled as probabilistic model. Additionally, complexity of temporal variations is modeled by sampling in time and modeling as individual random variables. To evaluate our proposed complexity measure, several experiments are performed on the real robotic movement tasks.

PIM(Picture information measure)을 이용한 Wavelet기반 워터마킹 기법 (Wavelet Based Watermarking Technique Using PIM(Picture information measure))

  • 김윤평;김영준;이동규;한수영;이두수
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.1811-1814
    • /
    • 2003
  • In this paper, a novel watermarking technique is proposed to authenticate the owner-ship of copyright for the digital contents. Using the 2-level DWT(Discrete Wavelet Transform) we divide a specific frequency band into detailed blocks and apply PIM(picture information measure). After the complexity is calculated, the watermark is embedded in only on high complexity areas. Conventional watermarking technique damages to the original image, because it does not consider the feature of the whole area or a specific frequency band. Easily affected by noise and compression, it is difficult to extract the watermark. However, the proposed watermarking technique, considering the complexity of input image, does not damage to the original image Simulation result show that the proposed technique has the robustness of JPEG compression, noise and filtering such as a general signal processing

  • PDF