• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.49-54
• /
• 2008

In order to do a maintenance task, a maintenance operator should learn the basic skills of the maintenance task such as assembly and disassembly (A/D). However, the key of the learning process is to learn the A/D task intuitively and naturally. Haptic guidance promises to give effectiveness and benefit qualitatively since a person can be trained to do the optimal task based on information that comes from an expert, database, or intelligent algorithms. By applying haptic guidance, a maintenance training process can be made more intuitive and natural in a virtual environment. This paper describes the development of a maintenance training system by using haptic guidance.

• Journal of Information Technology Services
• /
• v.12 no.1
• /
• pp.309-321
• /
• 2013

In current complex nature of management with task-structures, a method to reach the enterprise's informationalization success is not common. To satisfy these various requirement, improving the usability of information technology (IT) is a key factor which defining the level of organizational requirement first. Imposing an IT-solution which has excess service of the organization's previous task-environment, procedure and scope is not effective to SME-level unit, which unit could not have a formal organization structure and task structure. SME level informationalization will be success if each function realizes easier on the task-employee's viewpoint. Achieving this objective, a solution provider or department must reflect their work characteristics of nature which has least level of work performing resistance. It is most useful system for SME level unit, if a provider develops single programs which based on task activities, and each program can configure network-linking.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.613-626
• /
• 2011

In this paper, we focus on the pinwheel task model with a variable voltage processor with d discrete voltage/speed levels. We propose an intra-task DVS algorithm, which constructs a minimum energy schedule for k tasks in O(d+k log k) time We also give an inter-task DVS algorithm with O(d+n log n) time, where n denotes the number of jobs. Previous approaches solve this problem by generating a canonical schedule beforehand and adjusting the tasks' speed in O(dn log n) or O($n^3$) time. However, the length of a canonical schedule depends on the hyper period of those task periods and is of exponential length in general. In our approach, the tasks with arbitrary periods are first transformed into harmonic periods and then profile their key features. Afterward, an optimal discrete voltage schedule can be computed directly from those features.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.102-108
• /
• 2020

One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.621-630
• /
• 2018

Selection of a suitable task from the extensively available large set of tasks is an intricate job for the developers in crowdsourcing software development (CSD). Besides, it is also a tiring and a time-consuming job for the platform to evaluate thousands of tasks submitted by developers. Previous studies stated that managerial and technical aspects have prime importance in bringing success for software development projects, however, these two aspects can be more effective and conducive if combined with human aspects. The main purpose of this paper is to present a conceptual framework for task assignment model for future research on the basis of personality types, that will provide a basic structure for CSD workers to find suitable tasks and also a platform to assign the task directly. This will also match their personality and task. Because personality is an internal force which whittles the behavior of developers. Consequently, this research presented a Task Assignment Model (TAM) from a developers point of view, moreover, it will also provide an opportunity to the platform to assign a task to CSD workers according to their personality types directly.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.693-700
• /
• 2012

The effective extraction of key frames from a video stream is an essential task for summarizing and representing the content of a video. Accordingly, this paper proposes a new and fast method for extracting key frames from a compressed video. In the proposed approach, after the entire video sequence has been segmented into elementary content units, called shots, key frame extraction is performed by first assigning the number of key frames to each shot, and then distributing the key frames over the shot using a probabilistic approach to locate the optimal position of the key frames. The main advantage of the proposed method is that no time-consuming computations are needed for distributing the key frames within the shots and the procedure for key frame extraction is completely automatic. Furthermore, the set of key frames is independent of any subjective thresholds or manually set parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4533-4551
• /
• 2014

The effective extraction of key frames from a video stream is an essential task for summarizing and representing the content of a video. Accordingly, this paper proposes a new and fast method for extracting key frames from a compressed video. In the proposed approach, after the entire video sequence has been segmented into elementary content units, called shots, key frame extraction is performed by first assigning the number of key frames to each shot, and then distributing the key frames over the shot using a probabilistic approach to locate the optimal position of the key frames. Moreover, we implement our proposed framework in Android to confirm the validity, availability and usefulness. The main advantage of the proposed method is that no time-consuming computations are needed for distributing the key frames within the shots and the procedure for key frame extraction is completely automatic. Furthermore, the set of key frames is independent of any subjective thresholds or manually set parameters.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.1
• /
• pp.30-40
• /
• 2011

In recent years, driver information systems (DIS's) became popular and the use of DIS's increased significantly. A majority of DIS's provides touch-screen interfaces because of intuitiveness of the interaction and the flexibility of interface design. In many cases, touch-screen interfaces are mainly manipulated by fingers. In this case, investigating the effect of touch-key sizes on usability is known to be one of the most important research issues, and lots of studies address the effect of touch-key size for mobile devices or kiosks. However, there is few study on DIS's. The importance of touch-key size study for DIS's should be emphasized because it is closely related to safety issues besides usability issues. In this study, we investigated the effect of touch-key sizes of DIS's while simulated driving (0, 50, and 100km/h) considering driving safety (lateral deviation, velocity deviation, total glance time, mean glance time, total time between glances, mean number of glances) and usability of DIS's (task completion time, error rate, subjective preference, NASA TLX) simultaneously. As a result, both of driving safety and usability of DIS's increased as driving speed decreased and touch-key size increased. However, there were no significant differences when touch-key size is larger than a certain level (in this study : 17.5mm).

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.4
• /
• pp.193-199
• /
• 2012

Virtualization allows multiple commodity operating systems to share on a single physical machine. Resource allocation among virtual machines is a key to determine virtual machine performance. To satisfy time-sensitive task on a domain, hypervisor needs to observe the resource requirements and allocates proper amount of CPU resources in a timely manner. In this paper, we propose a realtime credit scheduler for latency sensitive application on virtual machines. The key idea is to register a time event in the Xen hypervisor. Experiment result shows that the proposed scheme is superior to Credit scheduler.