• Nuclear Engineering and Technology
• /
• v.54 no.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.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.257-264
• /
• 2001

We developed a SIFG (Slice-based Information Graph), which modelled the information flow on program on the basis of the information flow of data tokens on data slices. Then we defied a SCM (Slice-based complexity measure), which measured the program complexity by measuring the complexity of information flow on SIFG. SCM satisfied the necessary properties for complexity measure proposed by Briand et al. SCM could measure not only the control and data flow on program but also the physical size of program unlike the existing measures.

• Nuclear Engineering and Technology
• /
• v.42 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.183-191
• /
• 2001

We develop the new data s]ice representation, called the data value flow graph(VFG), for modeling the information flow oil data slices. Then we define a slice complexity measure by using the existing flow complexity measure in order to measure the complexity of the information flow on VFG. We show relation of the slice complexity on a slice with the slice complexity on a procedure. We also demonstrate the measurement scale factors through a set of atomic modifications and a concatenation operator on VFG.

• Nuclear Engineering and Technology
• /
• v.35 no.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
• /
• v.5 no.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.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.335-342
• /
• 1995

In this pater, we present a syntactic software complexity measure based on program control structure using Petri Nets. Since control structure in program may be segregated by three structures such as sequence, condition and iteration structures, we are proposed a structured complexity measure based on program control structure after represented by Petri Nets. Finally, we compare our result with other measures of program complexity.

• The Journal of Korea Robotics Society
• /
• v.7 no.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.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• 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