• Communications of Mathematical Education
• /
• v.23 no.1
• /
• pp.53-72
• /
• 2009

The purpose of the study was to develop a program based on PCM(Parallel Curriculum Model) model for the gifted students, and investigate the effectiveness of the program with qualitative research methods. This program was designed to encourage the gifted students to explore mathematics that is closely related to the real world. The results of the study revealed that the program based on the PCM model had positive effect on the gifted students emotionally and cognitively. In conclusion, PCM program is considered an appropriate program for the gifted students of elementary school.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.11-17
• /
• 1992

This paper is to propose an analytical queuing model for parallel processing of sequential program with nested loops. The analytical results are compared with the results from the implemented multiprocessor system composed of four intel 8088 microprocessor, eight 2KB shared common memories, and a hardware token ring. At results, this study shows that the processed results are almost similar in proposed analytical model and real system. Proposed analytical model can be applied to evaluate parallel processing of sequential program with nested loops.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.519-522
• /
• 2001

In this paper, I propose double parallel manipulator for machining work. And I derive an kinematics by combining the kinematics of the central axis and the kinematics of the link train of linear actuator. The Jacobian of the central axis and the Jacobian of the link train of the linear actuators are induced by a motor algebra and they are combined to an entire Jacobian matrix to transform the velocity of the end effector to those of linear actuators. And then this paper presents the development of control system and user interface program for machining work.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.535-540
• /
• 2000

This paper presents the development of a Parallel-Typed CNC Machining Tool. It is specially designed to machine a complex shaped workpiece by controlling the orientation of the tool. The inverse/direct kinematics of a parallel mechanism is derived and implemented in a PC based controller. With graphics icons, the GUI (Graphic User Interface) program is developed for the CNC programing. The calibration is accomplished by geometric constraint motion, which is a parallel motion of the platform with respect to a table. The calibration result is introduced and the future study is proposed.

• The Korean Journal of Applied Statistics
• /
• v.25 no.4
• /
• pp.633-640
• /
• 2012

Biological methods are described for the assay of certain substances and preparations whose potency cannot be adequately assured by chemical or physical analysis. The principle applied through these assays is of a comparison with a standard preparation to determine how much of the examined substance produces the same biological effects as a given quantity (the Unit) of the standard preparation. In these dilution assays, to estimate the relative potencies of the unknown preparations to the standard preparations, it is necessary to compare dose-response relationships of standard and unknown preparations. The dose-response relationship in the dilution assay is non-linear and sigmoid when a wide range of doses is applied. The parallel line model (applied to the dose region with the steepest slope) is used to estimate the relative potency. In this paper, the statistical theory in the parallel line model is explained with an application to a dilution assay data. The parallel line method is implemented in a SAS program and is available at the author's homepage(http://cafe.daum.net/go.analysis).

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.792-803
• /
• 1999

Most data parallel language compilers are source-to-source translators. Most Compilers of HPF which is recognized as a standard data parallel language convert a parallel program in PHF in a Fortran 77 program inserted message passing primitives. By the way, they currently generate significant amount of ineffective codes in the course of the conversion. Especially, FORALL construct is converted into several DO loops, so loop overhead of these codes is very increased. In this paper, we define and use relation distance vector to keep necessary informations. Then we evaluate and analyze execution time for the codes converted by our method and by PARADIGM method for various array sizes.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.715-718
• /
• 2000

Although shared memory parallel programs are designed to be deterministic both in their final results and intermediate states, the races that occur when different processes access a common memory location in an order not guaranteed by synchronization could result in unintended non-deterministic executions of the program. So, Detecting races, particularly first data races, is important for debugging explicit shared memory parallel programs. It is possible that all data races reported by other on-the-fly algorithms would disappear once the first races were removed. To detect races parallel programs with nested loops and inter-thread coordination, it must guarantee the order of synchronization operations in an execution instance. In this paper, we propose an improved restructuring method that guarantee ordering execution instance and preserve the semantics of original program. This method requires O(np) time and (s + up) space, where n is the number of total operations, s is the number of synchronization operations and p is the number of parallelism in the execution. Also, this method makes on-the-fly detection of parallel program with nested loops and inter-thread coordination more easily in space and time complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.391-398
• /
• 2012

Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended non-deterministic executions of the programs. Previous on-the-fly techniques to detect races in parallel programs with general inter-thread coordination show serious space overhead which depends on the maximum parallelism of the program. Therefore, this paper presents a loop splitting technique for on-the-fly race detection of parallel programs which is more efficient in space complexity than previous techniques. This loop splitting technique is the debugged program which preserves semantics of the original program. Monitering loop splitting program in on-the-fly can detect first races.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.607-610
• /
• 2007

In this paper, proposes the monitoring system it will be able to trace the executed of each threads in OpenMP based a parallel program. The monitoring system of existing in uses each threads label information and the analysis technique which uses the access-history was most. This has the problem which raises the time and space complexity which is caused by with massive information creation. In this paper, only the thread which includes interest information it creates tracking information with the target. And it provides information which is intuitive to the user it provides the visualization system for to a same time. The visualization model is composed the images-information of a base. This does to be it will be able to understandable a program execute situation using an image processing technique. Therefore, this paper provides the parallel program an effective debugging environment.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.537-552
• /
• 2010

Software Debugging is the most time consuming and costly process in the software development process. Many techniques have been proposed to isolate different faults in a program thereby creating separate sets of failing program statements. Debugging in parallel is a technique which proposes distribution of a single faulty program segment into many fault focused program slices to be debugged simultaneously by multiple debuggers. In this paper we propose a new technique called Faulty Slice Distribution (FSD) to make parallel debugging more efficient by measuring the time and labor associated with a slice. Using this measure we then distribute these faulty slices evenly among debuggers. For this we propose an algorithm that estimates an optimized group of faulty slices using as a parameter the priority assigned to each slice as computed by value of their complexity. This helps in the efficient merging of two or more slices for distribution among debuggers so that debugging can be performed in parallel. To validate the effectiveness of this proposed technique we explain the process using example.