• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제23권1호
• /
• pp.53-72
• /
• 2009

영재교육의 목표는 영재의 창의성을 신장하는 방향으로 전환되고 있다. 따라서 이를 위한 교수-학습 프로그램의 개발과 보급이 시급하다. 이에 따라 본 연구에서는 PCM모형을 활용하여 영재 프로그램을 개발하고 이를 영재아동들에게 투입하여 그 실효성에 대해 질적 연구를 통해 알아보았다. 그 결과 PCM 프로그램은 영재아동들의 정의적, 인지적 특성 변화에 긍정적인 영향을 주었다. 또한 영재아동들에게 수준에 맞는 활동을 제공하여 학생들의 학습욕구를 충족시켜주었다. 따라서 PCM 프로그램은 초등학교 영재에게 적합한 프로그램이었다.

• 전자공학회논문지B
• /
• 제29B권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• 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.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• 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.

• 응용통계연구
• /
• 제25권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).

• 한국정보처리학회논문지
• /
• 제6권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• 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.

• 한국정보통신학회논문지
• /
• 제16권3호
• /
• pp.391-398
• /
• 2012

병렬 프로그램은 의도되지 않은 비결정적인 수행을 야기하므로 공유 메모리를 사용하는 병렬 프로그램에서는 경합을 탐지하는 것은 매우 중요하다. 수행 중 기법에서 경합을 탐지하기 위해서 요구되는 기억장소의 부담은 매우크다. 특히 동기화가 있는 병렬 프로그램에서 경합 탐지에 필요한 기억 공간의 문제는 더욱 심각하다. 그래서, 본 논문에서는 원시 프로그램의 시멘틱을 유지하면서 동기화를 가지는 공유 메모리 병렬 프로그램의 디버깅을 위한 루프 분리 기법을 제시한다. 이것은 동기화를 가지는 병렬 프로그램의 수행 중 경합 탐지에 필요로 하는 기억공간의 복잡성을 줄일 수 있고, 루프 분리된 프로그램을 수행 중에 감시하여 최초 경합들을 탐지할 수 있다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.607-610
• /
• 2007

본 논문에서는 OpenMP 기반의 병렬프로그램을 대상으로 각 스레드의 수행양상을 추적할 수 있는 감시 시스템을 제안한다. 기존의 감시 시스템은 각 스레드의 레이블링 정보를 이용하여 접근역사를 통한 분석기법이 대부분 이였다. 이는 대량의 정보 생성으로 인한 시간적, 공간적 복잡도를 높이는 문제점을 가진다. 본 논문에서는 관심 정보에 따른 스레드만을 대상으로 추적 정보를 생성하고 사용자에게 직관성 높은 정보로 제공하기 위한 시각화 시스템을 동시에 제공한다. 시각화를 위한 모델은 영상정보를 기반하여 구성되며 이는 영상처리 기법을 통하여 프로그램 수행양상을 인지할 수 있게 한다. 따라서, 본 논문은 병렬프로그램을 효과적으로 디버깅할 수 있는 환경을 제공한다.

• Journal of Information Processing Systems
• /
• 제6권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.