• Title/Summary/Keyword: complexity control

Search Result 1,183, Processing Time 0.028 seconds

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

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

  • No, Cheol-U
    • 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.

  • PDF

A QUALITATIVE METHOD TO ESTIMATE HSI DISPLAY COMPLEXITY

  • Hugo, Jacques;Gertman, David
    • Nuclear Engineering and Technology
    • /
    • v.45 no.2
    • /
    • pp.141-150
    • /
    • 2013
  • There is mounting evidence that complex computer system displays in control rooms contribute to cognitive complexity and, thus, to the probability of human error. Research shows that reaction time increases and response accuracy decreases as the number of elements in the display screen increase. However, in terms of supporting the control room operator, approaches focusing on addressing display complexity solely in terms of information density and its location and patterning, will fall short of delivering a properly designed interface. This paper argues that information complexity and semantic complexity are mandatory components when considering display complexity and that the addition of these concepts assists in understanding and resolving differences between designers and the preferences and performance of operators. This paper concludes that a number of simplified methods, when combined, can be used to estimate the impact that a particular display may have on the operator's ability to perform a function accurately and effectively. We present a mixed qualitative and quantitative approach and a method for complexity estimation.

Robust Low-complexity Design for Tracking Control of Uncertain Switched Pure-feedback Systems with Unknown Control Direction (미지의 방향성을 갖는 불확실한 스위치드 순궤환 시스템의 추종 제어를 위한 강인 저 복잡성 설계)

  • Lee, Seung-Woo;Yoo, Sung-Jin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.1
    • /
    • pp.153-158
    • /
    • 2017
  • This paper investigates a robust low-complexity design problem for tracking control of uncertain switched pure-feedback systems in the presence of unknown control direction. The completely unknown non-affine nonlinearities are assumed to be arbitrarily switched. By combining the nonlinear error transformation technique and Nussbaum-type functions, a robust tracking controller is designed without using any adaptive function approximators. Thus, compared with existing results, the proposed control scheme has the low-complexity property. From Lyapunov stability theory, it is shown that the tracking error remains within the preassigned transient and steady-state error bounds.

The Effect of Occupational Information on the Cognitive Complexity of Adolescents (직업정보제공방식의 차이에 따른 청소년의 직업인지복잡성의 증대효과)

  • Lee, Yok
    • Korean Journal of Child Studies
    • /
    • v.12 no.2
    • /
    • pp.67-77
    • /
    • 1991
  • An investigation of the effect of occupational information on vocational cognitive complexity was conducted with 331 male and female adolescents in ninth grade. There were 2 experimental groups and 1 control group. Experimental group I was given only occupational information sheets (written form information) while group II was given occupational information through verbal instruction in addition to the occupational information sheets. A modified form of the cognitive complexity grid originally developed by Bodden (1970) was utilized to collect data on the subjects' vocational cognitive complexity. ANOVA and $Scheff{\acute{e}}$ tests revealed that there were significant differences between experimental group II and the other groups in vocational cognitive complexity. The cognitive complexity level of experimental group I and the control group for the most aspired occupation was significantly lower than for the least aspired occupation. However, the cognitive complexity level of experimental group II for the most aspired occupation was higher than for the least aspired occupation. The results suggest that just giving occupational information to adolescents may not be effective and giving occupational information may be effective only when the method of giving occupational information is active enough to induce adolescents' self-confirming cognitive process.

  • PDF

Balanced bitrate control of multiple videos in transcoding for multi-view service

  • Gankhuyag, Ganzorig;Choe, Yoonsik
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.168-172
    • /
    • 2015
  • In this paper, a balanced bitrate control in transcoding process based on video complexity measure for multi-view system which simultaneously shows multiple channels or video contents in single screen, is proposed. In order to consider the total quality of multiple video streams, the proposed algorithm reduces the complexity of multiple video stream and video quality differences at the same time by controlling bitrates of each stream by weighting when they are stitched for single screen. For the measure of complexity and quality differences between video streams, two different data: histogram of macroblock type and bitrate for each stream are used. The experimental result indicates that proposed algorithm decreases fluctuation of quality difference between videos in the multi-view system.

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

  • Lee, Jong-Geun;Song, Yu-Jin
    • 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.

  • PDF

Dynamic Control Algorithm of GOP Structure based on Picture Complexity (영상 복잡도에 기반한 GOP구조의 동적 제어 알고리즘)

  • 문영득;최금수
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.4
    • /
    • pp.258-264
    • /
    • 2004
  • This paper propose a method that GOP structure based on the picture complexity change realtime adaptive without pre-analysis or time delay. Proposed algorithm calculates the complexity of pictures at first, and the ratio of the complexity( X$\sub$p/ /X$\sub$i/) between P picture and I picture is calculated. The suitable M value for the three picture select by comparing with predetermined threshold. Used bit and vbv_delay the value of GOP is calculated according to selected M. Experimental results show that the prediction error is reduce than the fixed GOP structure. Since the complexity distribution of the sequence is different, applied limits of threshold value is changed, also.

Software Complexity and Management for Real-Time Systems

  • Agarwal Ankur;Pandya A.S.;Lbo Young-Ubg
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.1
    • /
    • pp.23-27
    • /
    • 2006
  • The discipline of software performance is very broad; it influences all aspects of the software development lifecycle, including architecture, design, deployment, integration, management, evolution and servicing. Thus, the complexity of software is an important aspect of development and maintenance activities. Much research has been dedicated to defining different software measures that capture what software complexity is. In most cases, the description of complexity is given to humans in forms of numbers. These quantitative measures reflect human-seen complexity with different levels of success. Software complexity growth has been recognized to be beyond human control. In this paper, we have focused our discussion on the increasing software complexity and the issue with the problems being faced in managing this complexity. This increasing complexity in turn affects the software productivity, which is declining with increase in its complexity.

A New Rate Control algorithm for Transcoder Based-on Bit-rate Reduction Characteristics of Requantization (재양자화 특성을 이용한 비트율 변환기의 전송률 제어 기법)

  • 서광덕;이상희;권순각;유국열;김재균
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1997.11a
    • /
    • pp.181-186
    • /
    • 1997
  • Transcoding is the key technique to further reduce the bit-rate of a previously compressed video. The performance of the transcoding is evaluated by the two factors, the accuracy on the target bit-rate and the complexity of the implementation. In this paper, were propose a new rate control algorithm which has very accurate bit-rate control performance and much smaller computational complexity. For the accuracy problem, we empirically observe the relationship between the quantization step size and generated bits in requantization process and then find that the relationship can be characterized as the new piece-wise linear model. For the complexity problem, we reduce the role of feedback rate control. The simulation results show that the proposed method gives the better performance in the accuracy with the same picture quality than conventional rat control algorithm.

  • PDF