• The KIPS Transactions:PartB
• /
• v.18B no.1
• /
• pp.29-38
• /
• 2011

In order to derive domain-independent heuristics from the specification of a planning problem, it is required to relax the given problem and then solve the relaxed one. In this paper, we present a new planning graph, Merged Planning Graph(MPG), and GD heuristics for solving contingent planning problems with both uncertainty about the initial state and non-deterministic action effects. The merged planning graph is an extended one to be applied to the contingent planning problems from the relaxed planning graph, which is a common means to get effective heuristics for solving the classical planning problems. In order to get heuristics for solving the contingent planning problems with sensing actions and non-deterministic actions, the new graph utilizes additionally the effect-merge relaxations of these actions as well as the traditional delete relaxations. Proceeding parallel to the forward expansion of the merged planning graph, the computation of GD heuristic excludes the unnecessary redundant cost from estimating the minimal reachability cost to achieve the overall set of goals by analyzing interdependencies among goals or subgoals. Therefore, GD heuristics have the advantage that they usually require less computation time than the overlap heuristics, but are more informative than the max and the additive heuristics. In this paper, we explain the experimental analysis to show the accuracy and the search efficiency of the GD heuristics.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2002.02a
• /
• pp.600-606
• /
• 2002

이제까지 전자코 시스템을 이용하여 각각의 식용유에 대한 가열시간과 가열온도에 대한 특성을 분석하였다. 전자코시스템의 센서에서 출력되는 $R_{gas}$/ $R_{air}$를 그래프분석을 통하여 센서가 반응하는 성향을 알 수 있었다. 그리고 주성분 분석의 score plot을 이용하여 PCI의 0을 중심으로 (+)영역에서 가열시간이 짧게 나타나고, (-)영역에서는 가열시간이 길게 나타나는데 이는 가열 시간에 따른 신선도를 예측 할 수 있음을 시사하였다. 그리고 주성분 분석의 loads plot을 이용하여 비슷한 향 성분에 반응하는 각 센서의 성향을 파악 할 수 있었다. 마지막으로 군집분석을 통하여 각 식용유의 종류와 가열온도와 가열 시간에 따른 센서의 상사성을 이용하여 전자코 시스템의 설계에 있어 식용유의 향 특성에 맞는 센서를 선택 시 유용하게 이용 될 것으로 사료된다. 결과적으로 전자코 시스템은 식용유의 유통과 소비과정에서 흔히 발생되는 휘발성 향 특성을 이용하여 가열시간에 따른 식용유의 품질관리와 품질 검사를 비롯한 신선도를 예측할 수 있으며 이를 이용하여 제조 및 유통 그리고 조리 과정에서 보다 효율적으로 사용 될 것으로 예상된다.상된다.

• Journal of Educational Research in Mathematics
• /
• v.16 no.1
• /
• pp.59-78
• /
• 2006

As a theoretical background for this research, the literatures which focus on the rationale of teaching and learning of connecting with mathematics and science in calculus were investigated. And teaching and learning material of connecting with mathematics and science in calculus was developed. And then, based on the case study using this material, the research questions were analyzed in depth. Students could understand mean-velocity, instant-velocity, and acceleration in the experimenting process of constant acceleration movement. Also Students could understand fundamental ideas that instant-velocity means slope of the tangent line at one point on the time-displacement graph and rate of distance change means rate of area change under a time-velocity graph.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.521-528
• /
• 2004

In this-paper, we propose a new task scheduling scheme for bus-based cluster architectures and analyze performance of the scheduling scheme which has been implemented in a PC cluster. The implemented scheme schedules the tasks of a task graph to the processors of a PC cluster, and it reduces parallel execution time by selectively duplicating critical tasks using heuristic. Experimental results show that the proposed scheduling scheme produces better parallel execution time than the other scheduling scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2435-2446
• /
• 1998

In this paper. We describe a dataflow model for efficient execution of a functional logic language and a method of translation a functional logic language into a dataflow graph. To explore parallelism and intelligent backtracking, we us model in which clause and function are represented as independent dataflow graph. The node denotes basic actions to be performed when the clause and function are executed. The dataflow mechanism allows an operation to be executed as soon as all its operands are available. Since the operations can never be executed earlier, a dataflow model is an excellent base for increasing execution speed. We did decrease a delay time with concurrent execution of dependency analysis and subgoal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2755-2761
• /
• 2012

In this paper, a lane detection algorithm using Eccentricity calculation is proposed. Lane detection is used for lane departure warning which can support safe driving to prevent accidents. In other to enhance the detection rate, we define the Eccentricity calculation which is introduced in graph theory, and evaluate the Eccentricity. The Eccentricity for any straight line is equal to 1, hence computing the Eccentricity allows the implementation of a first order equation. As a results of simulation, we confirmed that the proposed algorithm was enhanced by time and space complexity, and superior to the performance of the conventional lane detections.

• Journal of Korea Game Society
• /
• v.17 no.1
• /
• pp.89-98
• /
• 2017

This paper presents a novel ARAP (as-rigid-as-possible) approach to real-time simulation of physics-based deformation. To cope with one, two and three dimensional deformable bodies in an efficient, robust and uniform manner, we introduce a deformation graph of oriented particles and formulate the corresponding ARAP deformation energy. For stable time integration of the oriented particles, we develop an implicit integration scheme formulated in a variational form. Our method seeks the optimal positions and rotations of the oriented particles by iteratively applying an alternating local/global optimization scheme. The proposed method is easy to implement and computationally efficient to simulate complex deformable models in real time.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.31-39
• /
• 2015

The degree-constrained minimum spanning tree (d-MST) problem is considered NP-complete for no exact solution-yielding polynomial algorithm has been proposed to. One thus has to resort to an heuristic approximate algorithm to obtain an optimal solution to this problem. This paper therefore presents a polynomial time algorithm which obtains an intial solution to the d-MST with the help of Kruskal's algorithm and performs k-opt on the initial solution obtained so as to derive the final optimal solution. When tested on 4 graphs, the algorithm has successfully obtained the optimal solutions.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.73-82
• /
• 2003

In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.4
• /
• pp.23-28
• /
• 2000

We introduce a new method for constructing a dynamic Delaunay triangulation for a set S of n sites in the plane under the $L_{\infty}(L_1)$ metric. We find that the quadrant neighbor graph is contained in the Delaunay triangluation and that at least one edge of each triangle in the Delaunay triangulation is contained in the quadrant neighbor graph. By using these observations and employing a range tree scheme, we present a method that dynamically maintains the $L_{\infty}(L_1)$ Delaunay triangulation under insertions and deletions in $O(log^2n)$ amortized time and O(log n) expected time.