• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.589-594
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the losed loop problem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and efficiently. This algorithm is a hybrid type of using both declarative description (constraint represention) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 디지털산업정보학회논문지
• /
• 제6권4호
• /
• pp.45-56
• /
• 2010

This paper suggests constraint data modeling based on constraint data presentation techniques to perform complex spatial database operation naturally. We were able to identify the limitation of extendibility of dimension and non-equal framework via relevant research for former schema of spatial database and query processing. Therefore we described generalized tuple of spatial data and the definition of suggested constraint data modeling. Also we selected MLPQ/PReSTO tool among constraint database prototype and compare standard functionality of ARC/VIEW. Then we design scenario for spatial operation using MLPQ/PReSTO and we suggested application effect after query processing. Based on above explanation, we were able to identify that we can process spatial data naturally and effectively using simple constraint routine on same framework via constraint data modeling.

• 한국정밀공학회지
• /
• 제14권9호
• /
• pp.116-123
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the closed loop porblem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and effi- ciently. This algorithm is a hybrid type of using both declarative description (constraint representation) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

• 한국통신학회논문지
• /
• 제29권5B호
• /
• pp.508-519
• /
• 2004

이 논문에서는 MPLS를 사용한 인터넷 트래픽 엔지니어링에 사용될 수 있는 다중경로 한계조건 기반 라우팅 알고리즘을 제안한다. 기존에 사용되던 한계조건 기반 최단경로 라우팅 알고리즘은 트래픽 엔지니어링의 중요한 요소 중에 하나인 대역폭 한계조건이 큰 간을 가지는 경우에는 조건을 만족하는 경로를 찾지 못할 확률이 높아진다. 제안된 다중경로 알고리즘은 대역폭 한계조건을 만족하는 하나의 경로를 찾을 수 없는 경우, 대역폭 조건을 여러 개의 작은 값으로 나누어 각각의 작은 대역폭 한계조건에 대해 다중경로를 찾는 알고리즘이다. 시뮬레이션을 통하여 제안한 알고리즘을 사용할 경우 주어진 네트웍 상황과 대역폭 한계 조건에서 더 높은 경로설정 성공확률을 나타내며, 네트웍 자원 이용률도 개선되는 것을 보였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1098-1100
• /
• 2005

The floorplanning problem is an essential design step in VLSI layout design and it is how to place rectangular modules as density as possible. And then, as the DSM advances, the VLSI chip becomes more congested even though more metal layers are used for routing. Usually, a VLSI chip includes several buses. As design increases in complexity, bus routing becomes a heavy task. To ease bus routing and avoid unnecessary iterations in physical design, we need to consider bus planning in early floorplanning stage. In this paper, we propose a floorplanning method for topological constraint consisting of bus constraint and memory constraint. The proposed algorithms based on Genetic Algorithm(GA) is adopted a sequence pair. For selection control, new objective functions are introduced for topological constraint. Studies on floor planning and cell placement have been reported as being applications of GA to the LSI layout problem. However, no studies have ever seen the effect of applying GA in consideration of topological constraint. Experimental results show improvement of bus and memory constraint.

• 한국시뮬레이션학회논문지
• /
• 제18권2호
• /
• pp.57-64
• /
• 2009

물리적 기반의 다이내믹 시뮬레이션에 있어서 안정적이고 효율적인 제한 시스템은 매우 중요한 요소 중 하나이다. 본 논문은 기존에 널리 사용되고 있는 제한 시스템들(Lagrange Multiplier method, Baumgarte stabilization method, Post-stabilization Method, Implicit constraint enforcement method, Fast projection method)에 대한 분석과 평가를 통해 제한 시스템을 사용하고자 하는 사용자들에게 적절한 선택을 할 수 있는 지침을 제공하고자 한다. 본 논문은 기존의 제한 방법들에 대한 수학적 수식들이 설명되어 있고, 제한 오차 비교, 계산 비용, 동적 움직임 분석 등을 통해 기존 제한 시스템들 각각에 대한 평가를 제공한다.

• Journal of Mechanical Science and Technology
• /
• 제18권1호
• /
• pp.122-131
• /
• 2004

A constraint equation-based control law design for large angle attitude maneuvers of flexible spacecraft is addressed in this paper The tip displacement of the flexible spacecraft model is prescribed in the form of a constraint equation. The controller design is attempted in the way that the constraint equation is satisfied throughout the maneuver. The constraint equation leads to a two-point boundary value problem which needs backward and forward solution techniques to satisfy terminal constraints. An observer-based tracking control law takes the constraint equation as the input to the dynamic observer. The observer state is used in conjunction with the state feedback control law to have the actual system follow the observer dynamics. The observer-based tracking control law eventually turns into a stabilized system with inherent nature of robustness and disturbance rejection in LQR type control laws.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.141-144
• /
• 2007

Given a number of training data, a traditional BPN is normally trained by minimizing the absolute difference between target outputs and approximate outputs. When BPN is used as a meta-model for inequality constraint function, approximate optimal solutions are sometimes actually infeasible in a case where they are active at the constraint boundary. The paper describes the development of the efficient BPN based meta-model that enhances the constraint feasibility of approximate optimal solution. The modified BPN based meta-model is obtained by including the decision condition between lower/upper bounds of a constraint and an approximate value. The proposed approach is verified through a simple mathematical function and a ten-bar planar truss problem.

• Structural Engineering and Mechanics
• /
• 제47권1호
• /
• pp.131-147
• /
• 2013

In this paper, constraint-based fracture mechanics analyses of hollow cylinders with internal circumferential crack under tensile loading are conducted. Finite element analyses of the cracked cylinders are carried out to determine the fracture parameters including elastic T-stresses, and fully-plastic J-integrals. Linear elastic finite element analysis is conducted to obtain the T-stresses, and elastic-plastic analysis is conducted to obtain the fully plastic J-integrals. A wide range of cylinder geometries are studied, with cylinder radius ratios of $r_i/r_o$ = 0.2 to 0.8 and crack depth ratio a/t = 0.2 to 0.8. Fully plastic J-integrals are obtained for Ramberg-Osgood power law hardening material of n = 3, 5 and 10. These fracture parameters are then used to construct conventional and constraint-based failure assessment diagrams (FADs) to determine the maximum load carrying capacity of cracked cylinders. It is demonstrated that these tensile loaded cylinders with circumferential cracks are under low constraint conditions, and the load carrying capacity are higher when the low constraint effects are properly accounted for, using constraint-based FADs, comparing to the predictions from the conventional FADs.