• 아동학회지
• /
• 제12권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.

• 대한인간공학회지
• /
• 제34권3호
• /
• pp.235-245
• /
• 2015

Objective: The purpose of this study is to develop visual complexity metrics based on theoretical bases. Background: With the development of IT technologies, drivers process a large amount of information caused by automotive human-machine interface (HMI), such as a cluster, a head-up display, and a center-fascia. In other words, these systems are becoming more complex and dynamic than traditional driving systems. Especially, these changes can lead to the increase of visual demands. Thus, a concept and tool is required to evaluate the complicated systems. Method: We reviewed prior studies in order to analyze the visual complexity. Based on complexity studies and human perceptual characteristics, the dimensions characterizing the visual complexity were determined and defined. Results: Based on a framework and complexity dimensions, a set of metrics for quantifying the visual complexity was developed. Conclusion: We suggest metrics in terms of perceived visual complexity that can evaluate the in-vehicle displays. Application: This study can provide the theoretical bases in order to evaluate complicated systems. In addition, it can quantitatively measure the visual complexity of In-vehicle information system and be helpful to design in terms of preventing risks, such as human error and distraction.

• Nuclear Engineering and Technology
• /
• 제45권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.

• 한국멀티미디어학회논문지
• /
• 제21권8호
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.

• 대한인간공학회지
• /
• 제32권1호
• /
• pp.59-68
• /
• 2013

Objective: The purpose of this paper is to introduce a task complexity model combining task design aspects and complexity dimensions and to explain an approach to identifying and organizing task complexity factors based on the model. Background: Task complexity is a critical concept in describing and predicting human performance in complex systems such as nuclear power plants(NPPs). In order to understand the nature of task complexity, task complexity factors need to be identified and organized in a systematic manner. Although several methods have been suggested for identifying and organizing task complexity factors, it is rare to find an analytical approach based on a theoretically sound model. Method: This study regarded a task as a system to be designed. Three levels of design ion, which are functional, behavioral, and structural level of a task, characterize the design aspects of a task. The behavioral aspect is further classified into five cognitive processing activity types(information collection, information analysis, decision and action selection, action implementation, and action feedback). The complexity dimensions describe a task complexity from different perspectives that are size, variety, and order/organization. Combining the design aspects and complexity dimensions of a task, we developed a model from which meaningful task complexity factors can be identified and organized in an analytic way. Results: A model consisting of two facets, each of which is respectively concerned with design aspects and complexity dimensions, were proposed. Additionally, twenty-one task complexity factors were identified and organized based on the model. Conclusion: The model and approach introduced in this paper can be effectively used for examining human performance and human-system interface design issues in NPPs. Application: The model and approach introduced in this paper could be used for several human factors problems, including task allocation and design of information aiding, in NPPs and extended to other types of complex systems such as air traffic control systems as well.

• Journal of information and communication convergence engineering
• /
• 제4권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.

• 정보처리학회논문지D
• /
• 제8D권3호
• /
• pp.257-264
• /
• 2001

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

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제13권5호
• /
• pp.465-472
• /
• 2013

This paper presents a low-complexity triple-error-correcting parallel Bose-Chaudhuri-Hocquenghem (BCH) decoder architecture and its efficient design techniques. A novel modified step-by-step (m-SBS) decoding algorithm, which significantly reduces computational complexity, is proposed for the parallel BCH decoder. In addition, a determinant calculator and a error locator are proposed to reduce hardware complexity. Specifically, a sharing syndrome factor calculator and a self-error detection scheme are proposed. The multi-channel multi-parallel BCH decoder using the proposed m-SBS algorithm and design techniques have considerably less hardware complexity and latency than those using a conventional algorithms. For a 16-channel 4-parallel (1020, 990) BCH decoder over GF($2^{12}$), the proposed design can lead to a reduction in complexity of at least 23 % compared to conventional architecttures.

• 한국정보통신학회논문지
• /
• 제5권1호
• /
• pp.183-191
• /
• 2001

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

• Journal of Communications and Networks
• /
• 제10권4호
• /
• pp.396-402
• /
• 2008

The use of network coding in wireless networks has been proposed in the literature for energy efficient broadcast. However, the decoding complexity of existing algorithms is too high for low-complexity devices. In this work we formalize the all-to-all information exchange problem and shows how to optimize the transmission scheme in terms of energy efficiency. Furthermore, we prove by construction that there exists O(1) -complexity network coding algorithms for grid networks which can achieve such optimality. We also present low-complexity heuristics for random. topology networks. Simulation results show that network coding algorithms outperforms forwarding algorithms in most cases.