• 한국운동역학회지
• /
• 제23권2호
• /
• pp.169-177
• /
• 2013

The purpose of this study is to investigate the effect of aging and dual tasking to the postural control during quiet standing. It was hypothesized that the center of pressure (COP) dynamics would be differently affected by aging and characteristics of the task. Total 60 adults (35 young adults and 25 older adults) participated in this study. They conducted two different standing tasks (dual vs. Nondual) twice in a random order. Variability, complexity, coupling and symmetric index from the left, right and overall COPs were measured by various parameters in nonlinear, linear and frequency analyses methods. Results demonstrated that older adults had worse performance in postural control with decreased complexity in overall sway movement, and increased coupling between left and right limb COP movement, even though there was no significant difference in symmetric index. These tendencies are generally clearer in nonlinear measures at the dual task condition. Results implied that older adults had compensatory strategy in dual tasking which results in simple and combined postural movement patterns.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제1권1호
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.497-502
• /
• 1992

In this paper, a new design technique called Task Based Design (TBD) is proposed to design an optimal robot manipulator for a given task. Optimal design of a manipulator is difficult because it involves implicit and highly nonlinear functions of many design variables for a complex task. TBD designs an optimal manipulator which performs a given task best, by using a framework called Progressive Design which decomposes the complexity of the task into three steps: kinematic design, planning and kinematic control. An example of TBD is presented to demonstrate the efficiency and effectiveness of our framework.

• 산업경영시스템학회지
• /
• 제17권30호
• /
• pp.185-192
• /
• 1994

The complexity and consistency are important factors that affect human information processing in use of product. In this study, complexity and consistency of product(remote controller) are measured by Task Action Grammar(TAG) model. Also, new design alternative of the user interface is presented and evaluated. The results show that the consistent system and the good correspondence between hierarchical structure of system and user's mental model lead to the reduction of errors and enhanced user's performance.

• 한국융합학회논문지
• /
• 제11권5호
• /
• pp.165-173
• /
• 2020

무인 농기계의 출현으로 정밀 농업의 발전에 새로운 연구 콘텐츠가 등장했다. 무인 농기계의 핵심 기술 연구를 가속화시키기 위해 먼저 무인 농기계 지능 수준 분류가 일 차적 과제가 되어 왔다. 이에 본 연구는 무인 곡물 수확기, 작업, 운전 환경으로 구성된 복합 양방향 시스템을 연구 대상으로 하고, 무인 곡물 수확기의 지능화 수준을 등급화하고 분류하는 연구를 수행한다. 본 연구의 연구자들은 인적 개입 정도, 환경적 복잡성, 작업 복잡성으로 구성된 무인 곡물 수확기 차량의 평가 모델을 확립한다. 또한, 무인 곡물 수확기의 지능화 수준 등급화와 분류는 인적 개입 정도, 환경적 복잡성과 작업 난이도에 따라 이루어진다. 무인 농기계의 미래 발전 방향을 제시하고 있다.

• 한국콘텐츠학회논문지
• /
• 제18권11호
• /
• pp.484-492
• /
• 2018

본 연구의 목적은 수화물 검사 과제에서 장 복잡성과 위험물품 종류가 탐지율과 반응시간에 미치는 효과를 검증하는 것이었다. 참가자는 C 대학 학부생 62명이었고(남 45.2%, 여 54.8%), 평균 나이는 22.88세였다. 가상 수화물 심사(신호 탐지) 과제를 개발하여 사용하였고 참가자들은 실험에 대한 오리엔테이션과 과제 연습에 참가한 후 본 실험에 참가하였다. 참가자들은 총 200개의 수화물 검사 과제를 실시하였고 40개(20%)가 위험 물품을 포함하고 있었다. 본 연구의 독립변인 중 장 복잡성은 상(20개), 중(14개), 하(8개) 세 수준으로 위험 물품의 종류는 총, 칼, 액체, 그리고 라이터 4가지로 설정하였다. 종속변인은 위험 물품이 있는 이미지 중 표적 신호를 탐지한 비율(%)이었다. 연구 결과 장이 복잡할수록 탐지율이 유의미하게 감소하였고, 반응시간은 증가하였다. 그리고 위험 물품의 종류에 따라 탐지율과 반응시간은 달라지는 것으로 나타났다. 특히 칼의 탐지율이 가장 높았고 반응시간은 가장 짧았으며 액체의 탐지율이 가장 낮고, 반응시간은 길었다. 장 복잡성과 위험 물품의 상호작용 효과 역시 탐지율과 반응시간에 영향을 미쳤다. 칼은 장 복잡성에 영향을 받지 않았고, 라이터와 같이 작은 물품이 장 복잡성의 영향을 가장 크게 받은 것으로 나타났다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2006년도 추계학술대회 논문집
• /
• pp.1082-1087
• /
• 2006

Human factors still plays a significant role in railway accidents. The accidents often resulted from multiple causes of hardware failures and human errors. So to ensure the safety of railway operations, human error should be effectively prevented and managed. Among several factors influencing human performance, task load (or task complexity) is well known as a major contributor to human error. In order to reduce the potential of human error, a systematic analysis should be undertaken to evaluate task load and to reduce it by modifying task process and/or education&training. In this paper, we proposed a systematic framework for railway industry to perform task analysis and to evaluate task load, and applied it to KTX operational tasks. According to the application study, we identified 14 generic task types of KTX operation. And also this paper shows the quantitative task load of those generic tasks which were analyzed by NASA-TLX method.

• Journal of Information Processing Systems
• /
• 제10권2호
• /
• pp.193-214
• /
• 2014

Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

• 영어어문교육
• /
• 제17권4호
• /
• pp.207-227
• /
• 2011

This paper investigates how two different modes of feedback (selective vs. comprehensive) affect selected students' writing development in terms of three different types of measurement (accuracy, fluency, and complexity). 139 university students participated in the study, and 278 writing samples were analyzed. The results of the study indicate that participants who received selective feedback wrote more accurately and fluently than their counterparts. However, in terms of complexity, both selective and comprehensive groups showed no sign of improvement in semester-based investigations. The results of this study support Skehan's (2009) theory of trade-off effects, suggesting that 'natural' tension exists between accuracy and complexity when resources are limited. Moreover, this finding contrasts with the theory of Cognition Hypothesis, which proposes that task complexity will be associated with increases in complexity and accuracy. In the study, selected participants (N=21) strongly nominated their error sources as unfamiliarity toward using key words, usage, transition, and sentence types. This study not only contributes to the accumulation of our current knowledge in the related area of theory, but offers educational implications for those who are dealing with intermediate-level students when deciding what particular teaching content should constitute a priority within a limited instructional period.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.