• Journal of Internet of Things and Convergence
• /
• v.6 no.1
• /
• pp.83-95
• /
• 2020

Being a dense and complex task of precisely detecting the weeds in practical crop field environment, previous approaches lack in terms of speed of processing image frames with accuracy. Although much of the attention has been given to classify the plants diseases but detecting crop weed issue remained in limelight. Previous approaches report to use fast algorithms but inference time is not even closer to real time, making them impractical solutions to be used in uncontrolled conditions. Therefore, we propose a detection model for the complex rice weed detection task. Experimental results show that inference time in our approach is reduced with a significant margin in weed detection task, making it practically deployable application in real conditions. The samples are collected at two different growth stages of rice and annotated manually

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.50-60
• /
• 2004

Recently, most of the embedded system is required not only many functions but also real-time characteristics in purpose. In the hard real-time system, especially, strict deadline of periodic task can affect the performance of the system. In this paper, we design and implement the scheduler based on RM(Rate-Monotonic) rule. This scheduler makes feasible patterns based on EDF(Earliest deadline first) rule with extended schedulability inspection before execution, for periodic task-set that has high CPU utilization and then, execute periodic task-set depended on feasible patterns. The feasible pattern formed into EDF rule is capable of the efficiency of CPU up to 100 percentage and by the referenced execution of the feasible pattern is possible of removing the red-time scheduling overhead that is the defect of the order of dynamic assignment rule.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.158-163
• /
• 1986

This article surveys techniques and issues related to real time process control system developed for industrial control applications. It covers the system architecture and software engineering issues such as the design of data structures, scheduling of asynchronous task activities, management of shared resources, handling of interrupt and implementing an user friendly man-machine interface. Also problems associated with implementing a real-time system that supports dynamic configuration of data base is addressed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.120-120
• /
• 2000

In this study, in order to control real system under the environment of graphic user interface, study on the technique which can control real system without additional hardware drivers using virtual machine driver operated on the windows operating system. Consider the problem which is the error and the delay of a sampling time on the multi task processing through the load test of the experiment using graphic user interface.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.421-423
• /
• 1993

A real time simulation is an effective tool for use in design, performance evaluation, and testing of the vehicle dynamic system. An alternate approach is to use a computer system designed specifically to provide an integrated simulation environment in which all aspects of hardware-in-the-loop simulation task have been taken into account.

• Journal of the Ergonomics Society of Korea
• /
• v.30 no.2
• /
• pp.303-310
• /
• 2011

In this study, we employ CPM-GOMS analysis for explaining physical and cognitive processes and for quantitatively predicting when users are typing Korean text messages on mobile phones using both hands. First, we observe the behaviors of 10 subjects, when the subjects enter keypads with both hands. Then, basing upon MHP, we categorize the behaviors into perceptual, cognitive, motor operators, and then we analyze those operators. After that, we use the critical paths to model two task sentences. Also, we used Fitts' law method which was applied many times to predict text entering time on mobile phone to compare with the results of our CPM-GOMS model. We followed Lee's (2008) method that is well suited for text entry task using both hands and calculate total task time for each task sentences. For the sake of comparison between the actual data and the results predicted from our CPM-GOMS model, we empirically tested 10 subjects and concluded that there were no significant differences between the predicted values and the actual data. With the CPM-GOMS model, we can observe the human information processes composed on the physical and cognitive processes. Also we verified that the CPM-GOMS model can be well applied to predict the users' performance when they input text messages on mobile phones using both hands by comparing the predicted total task time with the real execution time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.414-414
• /
• 2000

This paper presents a method for building a real-time kernel of autonomous mobile robot control systems. Until now, most of robots have their own operation softwares dedicated only for their use. Sometimes, operation softwares were developed based on MS-DOS or other real -time kernel based on UNIX. However, MS-DOS has many restrictions for use as a robot operation system. Also, mix based real-time kernel has some Limitations for use with mobile robots. So, in this paper, we focus on building a real-time kernel based on Linux. The in this paper, the software modules of Task Management, Memory Management, Intertask Communication, and Synchronization are redesigned. To show the efficiency of the paper, it was applied to run Nomad Super Scout II avoiding obstacles detected by sonar sensor array.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.12-20
• /
• 2006

In scheduling of real-time tasks, the required hardware performance for a given set of tasks is determined based on the worst case execution time. For soft real-time tasks as multimedia applications, a lower performance hardware can service the tasks. Since the execution time of a task can vary in time, we can reclaim the slacks of early completed tasks for those of longer than average execution times. Then, the average ratio of deadline-miss can be lowered. This paper presents an algorithm, Aggressive Slack Reclamation (ASR), that tasks share slacks aggressively. A simulation result shows that ASR enhances the deadline-miss ratio and number of context switches than previous results.

• Journal of the Korean Society of Industry Convergence
• /
• v.18 no.4
• /
• pp.250-258
• /
• 2015

In this research, we proposed a new approach to implement the real-time motion control of biped robot based on voice command for unmanned FA. Voice is one of convenient methods to communicate between human and robots. To command a lot of robot task by voice, voice of the same number have to be able to be recognition voice is, the higher the time of recognition is. In this paper, a practical voice recognition system which can recognition a lot of task commands is proposed. The proposed system consists of a general purpose microprocessor and a useful voice recognition processor which can recognize a limited number of voice patterns. Given biped robots, each robot task is, classified and organized such that the number of robot tasks under each directory is net more than the maximum recognition number of the voice recognition processor so that robot tasks under each directory can be distinguished by the voice recognition command. By simulation and experiment, it was illustrated the reliability of voice recognition rates for application of the manufacturing process.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.243-254
• /
• 2005

Soft real-time applications such as multimedia feature highly variable processor requirements and probabilistic guarantees on deadline misses, meaning that each task in the application meets its deadline with a given probability. Thus, for such soft real-time applications, a system designer may want to improve the system utilization by allocating to each task a processor time less than its worst-case requirement, as long as the imposed probabilistic timing constraint is met. In this case, however, we have to address how to schedule jobs of a task that require more than (or, overrun) the allocated processor time to the task. In this paper, to address the overrun problem, we propose an overrun control method, which probabilistically controls the execution of overrunning jobs. The proposed overrun control method probabilistically allows overrunning jobs to complete for better system utilization, and also probabilistically prevents the overrunning jobs from completing so that the required probabilistic timing constraint for each task can be met. In the paper, we show that the proposed method outperforms previous methods proposed in the literature in terms of the overall deadline miss ratio, and that it is possible to synthesize the scheduling parameters of our method so that all tasks can meet the given probabilistic timing constraints.