• Title/Summary/Keyword: constraint satisfaction

Search Result 169, Processing Time 0.028 seconds

Constraint Satisfaction Algorithm in Constraint Network using Simulated Annealing Method (Simulated Annealing을 이용한 제약 네트워크에서의 제약 충족방식에 관한 연구)

  • 차주헌;이인호;김재정
    • 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.

  • PDF

Constraint satisfaction algorithm in constraint network using simulated annealing method (Simulated Annealing을 이용한 제약 네트워크에서의 제약 충족 방식에 관한 연구)

  • Cha, Joo-Heon;Lee, In-Ho;Kim, Jay J.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.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.

  • PDF

A study of the impact of constraint factors of festival participation and negotiation efforts of festival participant on festival satisfaction (축제의 참여제약 요인과 관람객의 협상노력을 통한 축제만족에 대한 연구)

  • Kim, Han-Joo
    • Management & Information Systems Review
    • /
    • v.33 no.2
    • /
    • pp.205-223
    • /
    • 2014
  • A study of the impact of constraint factors of festival participation and negotiation efforts of festival participant on festival satisfaction. This study reviewed earlier studies about festival and verified an impact of the leisure constraint factors of festival participant and the negotiation efforts on festival satisfaction by considering previous literature. Hypotheses based on literature reviews were analyzed emprically. According to the result of study, in aspect of the relationship between constraint factors of festival participation(intrapersonal constraint, interpersonal constraint, structural constraint) and negotiation efforts of festival participation, both interpersonal constraint and structural constraint have positive influence on constraint negotiation efforts. However, intrapersonal constraint factor influenced negatively. Also, the results revealed that in aspect of the relationship among festival participation, festival experience recognition, and satisfaction, festival participation have positive influence on cognitive and emotional experience and finally satisfaction.

  • PDF

The Leisure Constraint and Leisure Life Satisfaction of the Institutionalized Elderly in Seoul - Focusing on the Free Institutionalized Elderly - (서울시 시설거주 노인의 여가프로그램제약정도와 여가생활만족도 - 무료양로시설을 중심으로 -)

  • Park Mee Sok
    • Journal of the Korean Home Economics Association
    • /
    • v.43 no.4 s.206
    • /
    • pp.203-223
    • /
    • 2005
  • This study investigated the leisure constraints and leisure life satisfaction of the institutional elderly. The respondents were 302 elderly people residing in 5 free institutionalized elderly homes in Seoul. The data were analyzed by frequency analysis, factor analysis, One-way ANOVA, Duncan's post hoc test and regression analysis using SPSS WIN 12.0 program. Exploratory factor analysis revealed that the 10 items in the proposed scale could be grouped into four factors of constraint on leisure:'physical constraint','psychological constraint','interpersonal constraint', and 'structural constraint 'There were differences in leisure constraints according to sex, age, education degree, interaction with facility colleagues, and interaction with facility staff. There were differences in leisure life satisfaction according to sex, age, having religion or not, interaction with facility colleagues, interaction with facility staff and leisure constraints. Regression analysis results indicated that the main effective factors of leisure life satisfaction were leisure constraints.

Constraint Satisfaction and Uncertain Knowledge (제약 조건 만족과 불확실한 지식의 처리)

  • Shin, Yang-Kyu
    • Journal of the Korean Data and Information Science Society
    • /
    • v.6 no.2
    • /
    • pp.17-27
    • /
    • 1995
  • We propose a framework for representing and processing uncertain knowledge on the basis of constraint satisfaction. A system of equations and/or inequalities can be considered as a set of constraints that should be solved, and each constraint in the set is transformed into a corresponding logical formula which can be solved through a constraint solving program. Most of rule-based systems, for instance, use a simple probabilistic theory in order to maintain uncertain knowledge, therefore uncertain knowledge can be represented and processed in the constraint satisfaction program quite efficiently.

  • PDF

Influence of the Leisure Constraint of a Private Security Guard on His/Her Task Stress and Life Satisfaction (민간경비원의 여가제약이 직무스트레스 및 생활만족에 미치는 영향)

  • Lee, Gun-Chun;Song, Kang-Young
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.359-366
    • /
    • 2010
  • The purpose of this study is to examine the influence of the leisure constraint of a private security guard on his/her task stress and life satisfaction. The subjects of this study were chosen among the private security guards working in Seoul based private security firms in 2009, and by going through judgement sampling, 300 cases were applied in the final analysis. Collected data went through factor analysis, reliability analysis, regression analysis, and path analysis by using SPSSWIN 17.0. In reference with the reliability of the questionnaire, Cronbach's $\alpha$ was over .600. The conclusion of this study is as following. Firstly, the leisure constraint of a private security guard affects his/her task stress. In other words, when peripheral and individual constraint increase, task stress is intensified, while task stress winds down when interpersonal constraint decreases. Secondly, the leisure constraint of a private security guard affects life satisfaction. That is, when individual constraint goes down, life satisfaction is improved. Thirdly, the task stress of a private security guard affects life satisfaction. when compensation and career development increase, life satisfaction rises. On the other hand when task characteristic is weakened, life satisfaction gets lower. Fourthly, the leisure constraint of a private security guard has a causal influence on task stress and life satisfaction. Accordingly, it becomes apparent that the task stress is a significant variable which intermediates the relation between leisure constraint and life satisfaction.

An Integration of Local Search and Constraint Programming for Solving Constraint Satisfaction Optimization Problems (제약 만족 최적화 문제의 해결을 위한 지역 탐색과 제약 프로그래밍의 결합)

  • Hwang, Jun-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.39-47
    • /
    • 2010
  • Constraint satisfaction optimization problem is a kind of optimization problem involving cost minimization as well as complex constraints. Local search and constraint programming respectively have been used for solving such problems. In this paper, I propose a method to integrate local search and constraint programming to improve search performance. Basically, local search is used to solve the given problem. However, it is very difficult to find a feasible neighbor satisfying all the constraints when we use only local search. Therefore, I introduced constraint programming as a tool for neighbor generation. Through the experimental results using weighted N-Queens problems, I confirmed that the proposed method can significantly improve search performance.

Relaxation Matching Algorithm Based on Global Structure Constraint Satisfaction (전역 구조 구속 조건에 기초한 Relaxation Matching 알고리즘)

  • Chul, Hur;Jeon, Yang-Bae;Kim, Seung-Min;Kim, Sang-Bong
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.706-711
    • /
    • 2001
  • This paper represents a relaxation matching algorithm based on global structure constraint satisfaction. Relaxation matching algorithm is a conventional approach to the matching problem. However, we confronted some problems such as null-matching and multi-matching problems by just using the relaxation matching technique. In order to solve the problems, in this paper, the matching problem is regarded as constraint satisfaction problem, and a relaxation matching algorithm is proposed based on global structure constraint satisfaction. The proposed algorithm is applied a landslide picture to show the effectiveness. When the algorithm is processed at landslide inspecting and monitoring system, motion parameters such as displacement area and its direction are computed. Once movement is recognized, displacements are estimated graphically with statistical amount in the image plane. Simulation has been done to prove the proposed algorithm by using time-sequence image of landslide inspection and monitoring system.

  • PDF

Development of an ergonomic control panel layout system and its application

  • 박성준;정의승;이상도;이동춘
    • Proceedings of the ESK Conference
    • /
    • 1995.10a
    • /
    • pp.172-181
    • /
    • 1995
  • A control panel layout system was developed to generate an ergrnomically sound panel design. A constraint satisfaction concept was introduced as a framework of incorporating diverse ergonomic design guidelines into the panel layout. An efficient search algorithm which can find a constraint satisfaction solution within a reasonable time was developed based on preprocess and look ahead procedures with the backjumping technique. The proto- type panel layaout system was developed on a SPARC workstation. The constraint satisfaction algorithm was programmed in C language with Motif as a GUI tool under the X-windows environment. The effectiveness of the prototype paned layout system was examined by a case study.

  • PDF

A Study on the Erection Scheduling in the Shipbuilding Using Constraint Satisfaction Technique (제약 만족 기법을 이용한 조선 산업에서의 탑재 일정 생성에 관한 연구)

  • Kim, Ki-Dong;Jang, Yong-Sung
    • Journal of Industrial Technology
    • /
    • v.19
    • /
    • pp.91-99
    • /
    • 1999
  • The dock is the most important resource in shipbuilding yard. Among the shipbuilding schedules, the ship erection schedule in a dock is preferentially built. As results of it, the other schedules(machining in plants, block assembly, pre-painting, pre-rigging, painting and etc) are made. In this study, ship erection scheduling is formulated using ILOG Scheduler. This study is to develop a new problem solving method for ship erection to make an effective schedule based on Constraint Satisfaction Technique(CST).

  • PDF