• Title/Summary/Keyword: task complexity

Search Result 326, Processing Time 0.024 seconds

Task Types and Loads of Railway Worker (열차운용원의 직무유형 및 직무부하)

  • Han, Kyu-Min;Ko, Jong-Hyun;Jung, Won-Dea;Kang, Jung-Seok
    • Proceedings of the KSR Conference
    • /
    • 2007.05a
    • /
    • pp.1204-1208
    • /
    • 2007
  • In order to prevent railway accidents due to human errors which have been recognized to be the most important cause in the railway accidents, human errors should have been controlled based on systematical analysis of the human errors, and countermeasures should be derived to reduce human error probability. Among several factors inducing human errors, task load (or task complexity) is representative. In order to reduce the human error, a systematic analysis should be undertaken to evaluate task load. In this study, task load according to task types of railway worker who are a safety critical staff have been quantitatively analyzed based on NASA-TLX(Task Load Index).

  • PDF

Time-Efficient Voltage Scheduling Algorithms for Embedded Real-Time Systems with Task Synchronization (태스크 동기화가 필요한 임베디드 실기간 시스템에서 시간-효율적인 전압 스케쥴링 알고리즘)

  • Lee, Jae-Dong;Kim, Jung-Jong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.1
    • /
    • pp.30-37
    • /
    • 2010
  • Many embedded real - lime systems have adopted processors supported with dynamic voltage scal-ing(DVS) recently. Power is one of the important metrics for Optimization in the design and operation of embedded real-time systems. We can save considerable energy by using slowdown of processor sup-ported with DVS. In this paper, we improved the previous algorithm at a point of view of time complexity to calculate task slowdown factors for an efficient energy consumption in embedded real-time systems with task synchronization. We grasped the properties of the previous algorithm having $O(n^{2})$ time complexity through mathematical analysis and s simulation. Using its properties we proposed the improved algorithms with O(nlogn) and O(n) time complexity which have the same performance as the previous algorithm has.

Collaborative Information Seeking in Digital Libraries, Learning Styles, Users' Experience, and Task Complexity

  • Sangari, Mahmood;Zerehsaz, Mohammad
    • Journal of Information Science Theory and Practice
    • /
    • v.8 no.4
    • /
    • pp.55-66
    • /
    • 2020
  • The purpose of this study is to examine the relationship between collaborative information seeking and users' learning style preferences and their experience of information systems. The study investigates the role of four different factors including learning style, task complexity, and user experience in collaborative information seeking in digital environments. Sixty participants (30 pairs) were randomly chosen from volunteer graduate students of Kharazmi University (Iran). Participants completed Kolb's learning style questionnaire and a user experience questionnaire and then performed two information seeking tasks (one simple and one difficult) in a lab setting. They could exchange information with their partners or a librarian using Skype. The sessions were recorded using Camtasia. The results showed that with an increase in task difficulty, collaborative information seeking activities increased and more interactions with partners and the librarian occurred. The number of executive help-seeking requests was higher than the number of instrumental help-seeking requests. This research confirms that learning style is related to the way users interact with the digital library and help seeking. The research showed that in difficult tasks, the differences among users with different learning styles become more evident, and that generally interactions increase in more difficult tasks. Among the learning styles, the accommodating style had the highest number of relationships with collaborative information seeking variables. Most of the statistically significant relationships between users' prior computer experience and collaborative information seeking variables were related to the time variable.

Feasibility Test and Scheduling Algorithm for Dynamically Created Preemptable Real-Time Tasks

  • Kim, Yong-Seok
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.3
    • /
    • pp.396-401
    • /
    • 1998
  • An optimal algorithm is presented for feasibility test and scheduling of real-time tasks where tasks are preemptable and created dynamically. Each task has an arbitrary creation time, ready time, maximum execution time, and deadline. Feasibility test and scheduling are conducted via the same algorithm. Time complexity of the algorithm is O(n) for each newly created task where n is the number of tasks. This result improves the previous result of O(n log n). It is shown that the algorithm can be used for scheduling tasks with different levels of importance. Time complexity of the algorithm for the problem is O(n\ulcorner) which improves the previous results of O(n\ulcorner log n).

  • PDF

Eye-Tracking and Protocol Analyses of Expert and Novice Situation Awareness in Air Traffic Control (항공관제 상황인식에서 전문가와 초보자의 시선추적 및 프로토콜 분석)

  • Hyun, Suk-Hoon;Lee, Kyung-Soo;Kim, Kyeong-Tae;Sohn, Young-Woo
    • Journal of the Ergonomics Society of Korea
    • /
    • v.26 no.4
    • /
    • pp.17-24
    • /
    • 2007
  • Analyses of eye tracking and think-aloud protocol data were performed to examine novice-expert differences in perceptual and cognitive aspects of air traffic controllers' situation awareness. In Experiment 1, three groups of field air traffic controllers (experts, intermediates, novices) were asked to perceive situations that were manipulated by situation complexity. In Experiment 2, protocol analysis for previous situation awareness tasks was performed to extract different task models and strategy models as a function of expertise. Then delayed-recall task and interviews about air control plans for the recalled situations were also executed. Results showed that expert controllers concentrate only on several critical features and have their own strategies to reduce mental workloads.

Investigating the Impact of Contextual Data Quality on Decision Performance (상황 데이터 품질이 의사결정 성과에 미치는 영향)

  • Jung, Won-Jin;Kim, Jong-Weon
    • Asia pacific journal of information systems
    • /
    • v.15 no.3
    • /
    • pp.41-64
    • /
    • 2005
  • The effects of information quality and the importance of information have been reported in the information Systems(IS) literature. However, little has been learned about the impact of data quality(DQ) on decision performance. Recognizing with this problem, this study explores the effects of contextual DQ on decision performance. To examine them, a laboratory experiment was conducted. Based on two levels of contextual DQ and two levels of task complexity, this study had a $2{\times}2$ factorial design. The dependent variables used to measure the outcomes of decision performance were problem-solving accuracy and time. The results demonstrated that the effects of contextual DQ on decision performance were significant. The findings suggest that decision makers can expect to improve their decision performance by enhancing contextual DQ. This research not only extends a body of research examining the effects of factors that can be tied to human decision-making performance, but also provides empirical evidence to validate and extend DeLone and McLean's IS success model.

Determination of Optimal Checkpoint Interval for RM Scheduled Real-time Tasks (RM 스케줄링된 실시간 태스크에서의 최적 체크 포인터 구간 선정)

  • Kwak, Seong-Woo;Jung, Young-Joo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.6
    • /
    • pp.1122-1129
    • /
    • 2007
  • For a system with multiple real-time tasks of different deadlines, it is very difficult to find the optimal checkpoint interval because of the complexity in considering the scheduling of tasks. In this paper, we determine the optimal checkpoint interval for multiple real-time tasks that are scheduled by RM(Rate Monotonic) algorithm. Faults are assumed to occur with Poisson distribution. Checkpoints are inserted in the execution of task with equal distance in the same task, but different distances in other tasks. When faults occur, rollback to the latest checkpoint and re-execute task after the checkpoint. We derive the equation of maximum slack time for each task, and determine the number of re-executable checkpoint intervals for fault recovery. The equation to check the schedulibility of tasks is also derived. Based on these equations, we find the probability of all tasks executed within their deadlines successfully. Checkpoint intervals which make the probability maximum is the optimal.

Effect of IT Acceptance Will and Stress on Task Performance (조직의 IT 도입 시 기술수용의지와 스트레스가 업무에 미치는 영향연구)

  • Kang, So-Ra;Kim, Yoo-Jung;Chun, Bang-Jee
    • Journal of Information Technology Applications and Management
    • /
    • v.18 no.4
    • /
    • pp.119-130
    • /
    • 2011
  • When an organization adopts new technology, performance through the technology is expected to be decided depending on attitudes of the members, in that technology produces performance only if the members zealously use it. Therefore, the members need to devote themselves to acquire and use the new technology. This attitude of members is called "IT acceptance will" (Ranarajan et al., 2005), and this research is to examine the effect of an individual's "IT acceptance will" on performance. Thus, this research analyzes what increases IT acceptance will and what effect IT acceptance will has on stress due to uncertainty of an organization-job complexity and role conflict- through new IT adoption. This research conducted a survey from July to September in 2009, targeting employees of government offices and public institutions in Kyunggi and Kyungnam provinces. Then, a total of 370 was collected and the final 344 was selected for our research analysis. As a result, this research found out that personal innovation and client orientation improved an individual's IT acceptance will, which improved performance through new IT adoption. However, the new IT adoption also increased job complexity and role conflict, but negative effects of stress on performance was not found as IT adoption will diminished the stress. Based on this result, this research discussed practical and academic implications and the limitations.

Delay Bound Analysis of Networks based on Flow Aggregation (통합 플로우 기반 네트워크의 지연시간 최대치 분석)

  • Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.107-112
    • /
    • 2020
  • We analyze the flow aggregate (FA) based network delay guarantee framework, with generalized minimal interleaved regulator (IR) initially suggested by IEEE 802.1 time sensitive network (TSN) task group (TG). The framework has multiple networks with minimal IRs attached at their output ports for suppressing the burst cascades, with FAs within a network for alleviating the scheduling complexity. We analyze the framework with various topology and parameter sets with the conclusion that the FA-based framework with low complexity can yield better performance than the integrated services (IntServ) system with high complexity, especially with large network size and large FA size.