• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.257-267
• /
• 2005

The real-time operating system(RTOS) simulator, one of the tools provided by RTOS development environment, allows users to develop and debug application programs even before the target hardware is ready. Thus, most of commercial RTOS development environments provide with RTOS simulator for the purpose. But they are implemented to simulate only functional aspects on a host system, so that it is not possible to estimate execution time of application programs on the target hardware. Since the real-time system has to complete program executions in predetermined time, the RTOS simulator that can estimate the execution time is yeW useful in the development phase. In this study, we develop a machine instruction-level RTOS simulator that is able to estimate execution time of application programs on a target hardware, and prove its functionality and accuracy by using test .programs.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• Journal of Korean Elementary Science Education
• /
• v.39 no.1
• /
• pp.133-144
• /
• 2020

The purpose of this study is to identify the effect of Teacher Participation-oriented Education Program (TPEP) for Elementary School Teachers to Improve Class Expertise in Science Classes with a focus on visual attention. The participants were two elementary school teachers in Seoul and taught science subjects. The lesson topic applied to this study were 'Structure and Function of Our Body' in the second semester of fifth grade and 'Volcano and Earthquake' in the second semester of fourth grade. The mobile eye tracker SMI's ETG 2w, which is a binocular tracking system was used in this study. In this study, the actual practice time, participant's visual attention, visual intake time average, and visual intake time average were analyzed by class phase. The results of the study are as follows. First, as a result of analyzing the actual class execution time, the actual class execution time was almost in line with the lesson plan after the TPEP application. Second, visual attention in the areas related to teaching and learning activities was high after applying TPEP. Factors affecting the progress of the class and cognitive burdens were identified quantitatively and objectively through visual attention. Third, as a result of analyzing the visual intake time average of participants, there was a statistically significant difference in all classes. Fourth, as a result of analyzing the visual intake time average of participants, the results were statistically significant in the introduction(video), activity 1, activity 2, and activity 3 stages in the lecture type class. The Teacher Participation-oriented Education Program (TPEP) for Elementary School Teachers to Improve Class Expertise in Science Classes can extend elementary science class expertise such as self-class analysis, eye tracking, linguistic, gesture, and class design beyond traditional class analysis and consulting.

• Korean Journal of Construction Engineering and Management
• /
• v.6 no.3 s.25
• /
• pp.156-166
• /
• 2005

The purpose of this study is to present proper VE application methods to euly design phases. Since VE methodology is more effective on early stage of design phase, the study focused on application of VE methodology in early stage of design process. With the examination of past studies, obstacles of VE application in domestic construction industry are defined. To solve these problems, this paper presents (1) subdivision of VE execution time, (2) an appropriate VE targeting method for construction industry, (3) a resonable and practical function analysis process, and (4) modified design-VE job plan.

• Journal of KIISE:Software and Applications
• /
• v.37 no.9
• /
• pp.669-675
• /
• 2010

For detecting requirement errors in early system development phase, the behaviors of a system should be described in formal methods and be analyzed with analysis techniques such as reachability analysis and cycle detection. However, since they are usually based on explicit exploration of system state space, state explosion problem may be occurred when a system becomes complex. That is, the memory and execution time for exploration exponentially increase due to a huge state space. In this paper, we analyze the fundamental causes of this problem in concurrent systems and explore the state space without composing concurrent state spaces for reducing the memory requirement for exploration. Also our new technique keeps a visited history minimally for reducing execution time. Finally we represent experimental results which show the efficiency of our technique.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.849-854
• /
• 2004

This paper proposes an algorithm to enhance the execution time of kNN in the document classification. The proposed algorithm is to enhance the execution time by minimizing the computing cost of the similarity between two documents by using the list of pairs, while the conventional kNN uses the iist of pairs. The 1ist of pairs can be obtained by applying the matrix transposition to the list of pairs at the training phase of the document classification. This paper analyzed the proposed algorithm in the time complexity and compared it with the conventional kNN. And it compared the proposed algorithm with the conventional kNN by using routers-21578 data experimentally. The experimental results show that the proposed algorithm outperforms kNN about $90{\%}$ in terms of the ex-ecution time.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.55-61
• /
• 2010

It is of great practical interest to deciding when to stop testing a software system in development phase and transfer it to the user. This decision problem called an optimal release policies. In this paper, because of the possibility of introducing new faults when correcting or modifying the software, we were researched release comparative policies which based on infinite failure NHPP model and types of interval failure times. The policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement can optimal software release times. In a numerical example, applied data which were patterns, if intensity function constant or increasing, decreasing, estimated software optimal release time.

• International Journal of Contents
• /
• v.16 no.1
• /
• pp.25-33
• /
• 2020

We develop a simulation method that affords very high variability of virtual pedagogical situations involving many independent plans, still achieves authoring (or implementation) scalability. While each individual plan would be coherently drawn up by an agent for its respective goal, those independently-made plans might be coincidentally intertwined in their execution. The inevitable non-determinism involved in this multi-event plan encompassing pre-planned and unforeseen events is resolved by (multi-phase) dynamic planning and articulated sequencing of events in contrast to static planning and monolithic authoring in conventional narrative systems. Connections between events are dictated by their associated rules and their actual connections are dynamically determined in execution time by current conditions of background-world. This unified connection scheme across pre-planned and unforeseen events allows a multi-plan, multi-agent situation to be coherently planned and executed in a global scale. To further the variability of a situation, the inter-event coupling is made in a fine level of action along with a limited episteme of each agent involved. We confirm analytically the viability of our approach with respect to the situation variability and authoring scalability, and demonstrate its practicality with an implementation of a composite situation.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.2
• /
• pp.71-76
• /
• 2015

In similarity join processing, a general technique employs a generation-verification framework, which includes two phases: the first phase generates a set of candidate pairs from a collection of records; and the second phase verifies each candidate pair by computing real similarity. In order to reduce the number of candidate pairs in the verification phase, the median of one record of each candidate pair is used as a filter in this paper to test whether the other record can has the proper number of overlapped tokens. We propose a similarity join algorithm with the median filter, and show that the proposed algorithm has better performance in execution time than recent algorithms without the filter through extensive experiments on real-world datasets.

• Journal of Fisheries and Marine Sciences Education
• /
• v.24 no.2
• /
• pp.272-285
• /
• 2012

The purpose of this study was to develop the Learning Strategy e-Learning Contents based on the storytelling in university students. The objective of the Learning Strategy e-Learning Contents based on the storytelling was to increase in learning skill which university students will use to keep major learning during their courses. The Learning Strategy e-Learning Contents was based on the results of pre-research on storytelling and learning skill. In order to verify the effectiveness of the Learning Strategy e-Learning Contents based on the storytelling, it was analyzed to validity of contents by five professionals. The results of the study were as follows. The Learning Strategy e-Learning Contents based on the storytelling for increasing in learning skill of university students consisted of 15 sessions which proceeding a per semester: the starting phase(1-2), the execution phase(3-13), and the ending phase(14-15). The subjects were 20 university students who had randomly assigned to an experimental group(10) and a control group(10). Subjects completed a learning skill scale. Data analyses were conducted using ANCOVA. The results of the analyses revealed that subjects of experimental group showed significantly higher scores on learning skill than one of control group. Based on the above results, it is concluded that the Learning Strategy e-Learning Contents based on the storytelling was effective in improving learning skill of university students.