• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.133-146
• /
• 1994

Conditional constraints are frequently used to represent relations. To use these conditional constraints, it is necessary to develop an appropriate logic in which these conditional constraints can be represented and manipulated. Nevertheless, there has been little research that addresses interval-based conditional constraints. The proposed approach addresses the use of conditional constraints involving intervals in constraint networks. Two algorithms are presented: (1) a propagation algorithm for an interval-based conditional constraint, which is similar to one for an exact-value conditional constraint; (2) a propagation algorithm for interval-based conditional constraints which satisfy some conditions. The former can be applied to any conditional constraint. However, with the former algorithm, conditional constraints are usually categorized into the cases that they cannot be propagated. After investigating several methods in which most conditional constraints can be propagated, we propose the latter algorithm under certain condition that usually results in smaller resulting design space comparing to the former.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.323-324
• /
• 2008

In this paper, we present performance comparison of two methods to localize multiple robots. One is extended Kalman filter and the other is constraint propagation technique. Extended Kalman filter is conventional probabilistic method which gives the sub-optimal estimation rather than guarantee any boundary for true position of robot. In case of constraint propagation, it can give a boundary containing true robot position value. Especially, we deal with cooperative localization problem in outdoor environment for multiple robots equipped with GPS, gyro meter, wheel encoder. In simulation results, we present strength and weakness for localization methods based on extend Kalman filter and constraint propagation technique.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.301-311
• /
• 2000

For effective part modifications which is necessary in the design process frequently, variational geometric modeling with constraint management being used in a wide. Most variational geometric modeling methods, however, manage just the constraints about sketch elements used for generation of primitives. Thus, not only constraint propagation but also re-build of various modeling operations stored in the modeling history is necessary iota part geometry modifications. Especially, re-build of high-cost Boolean operations is apt to deteriorate overall modeling efficiency abruptly. Therefore, in this paper we proposed an algorithm that can handle all geometric entities of the part directly. For this purpose, we introduced eight type geometric constraints to the various geometric calculations about all geometric entities in sweepings and Boolean operations as well as the existing constraints of the sketch elements. The algorithm has a merit of rapid part geometric modifications through only constraint propagation without rebuild of modeling operations which are necessary in the existing variational geometric modeling method.

• Journal of Ocean Engineering and Technology
• /
• v.5 no.2
• /
• pp.58-66
• /
• 1991

Not only difference of fatigue crack growth and propagation behavior resulted from the grain size, the hardness ratio and volume fraction in M.E.F. dual phase steel composed of martensite in hard phase and ferrite in soft phase, but also the effects of the plastic constraint were investigated by fracture mechanics and microstructural method. The main results obtained are as follows: 1) The fatigue endurance of M.E.F. steel increases with decreasing the grain size, increasing the ratio of hardness and volume fraction. 2) The initiation of slip and crack occures faster as the stress level goes higher. These phenomena result from the plastic constraint effect of the second phase. 3) The crack propagation rate in the constant stress level is faster as the grain size gets larger, the ratio of hardness lower and volume fraction smaller.

• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.98-107
• /
• 2015

Hierarchical constraints and constraint satisfaction were analyzed in order to solve the problem of conflict detection in collaborative design. The constraints were divided into two sets: one set consisted of known constraints and the other of unknown constraints. The constraints of the two sets were detected with corresponding methods. The set of the known constraints was detected using an interval propagation algorithm, a back propagation (BP) neural network was proposed to detect the set with the unknown constraints. An immune algorithm (IA) was utilized to optimize the weights and the thresholds of the BP neural network, and the steps were designed for the optimization process. The results of the simulation indicated that the BP neural network that was optimized by IA has a better performance in terms of convergent speed and global searching ability than a genetic algorithm. The constraints were described using the eXtensible Markup Language (XML) for computers to be able to automatically recognize and establish the constraint network. The implementation of the conflict detection system was designed based on constraint satisfaction. A wind planetary gear train is taken as an example of collaborative design with a conflict detection system.

• Journal of Ocean Engineering and Technology
• /
• v.5 no.2
• /
• pp.198-198
• /
• 1991

Not only difference of fatigue crack growth and propagation behavior resulted from the grain size, the hardness ratio and volume fraction in M.E.F. dual phase steel composed of martensite in hard phase and ferrite in soft phase, but also the effects of the plastic constraint were investigated by fracture mechanics and microstructural method. The main results obtained are as follows: 1) The fatigue endurance of M.E.F. steel increases with decreasing the grain size, increasing the ratio of hardness and volume fraction. 2) The initiation of slip and crack occures faster as the stress level goes higher. These phenomena result from the plastic constraint effect of the second phase. 3) The crack propagation rate in the constant stress level is faster as the grain size gets larger, the ratio of hardness lower and volume fraction smaller.

• Information Systems Review
• /
• v.5 no.2
• /
• pp.203-217
• /
• 2003

Constraint Programming and Optimization have developed in different fields to solve common problems in real world. In particular, constraint propagation and linear Programming are their own fundamental and complementary techniques with the potential for integration to benefit each other. This intersection has evoked the efforts to combine both for a solution method to combinatorial optimization problems. Attempts to combine them have mainly focused on incorporating either technique into the framework of the other with traditional models left intact. This paper argues that integrating both techniques into an old modeling fame loses advantages from another and the integration should be molded in a new framework to be able to exploit advantages from both. The paper propose a declarative modeling framework in which the structure of the constraints indicates how constraint programming and optimization solvers can interact to solve problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.249-268
• /
• 2014

Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to reconstruct the similarity matrix, and then rank medical images on this new manifold. In contrast to most of the algorithms that only concern manifold structure, the proposed method integrates pairwise constraint information in a feedback procedure and resolves the small sample size and the asymmetrical training typically in relevance feedback. We also introduce a long-term feedback strategy for our retrieval tasks. Experiments on two medical image datasets indicate the proposed approach can significantly improve the performance of medical image retrieval. The experiments also indicate that the proposed approach outperforms previous relevance feedback models.

• Journal of Advanced Marine Engineering and Technology
• /
• v.33 no.4
• /
• pp.539-544
• /
• 2009

The constraint effect $A_2$ has to be evaluated within plastic region near crack tip front using opening displacement. Plastic boundary and stress or strain conditions in the vicinity of the crack tip using recrystallization heat treatment was represented. It was found that the plastic deformation boundary by recrystallization heat treatment method was the true strain of ${\epsilon}t$ = 0.05mm/mm. With the estimation of constraint effects $A_2$, the region of proper displacement measurement point near crack tip was between 0mm and 1mm distance toward direction of crack propagation, and was between 1mm to 3mm distance toward direction of load line.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• 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.