• Title/Summary/Keyword: constraint

Search Result 4,177, Processing Time 0.027 seconds

Experimental Constraint Effect $A_{2}$, Values depending on Displacement according to measuring Positions near Crack Front. (균열선단 근방 변위측정 위치에 따른 구속효과 $A_{2}$)

  • Han, Min-Su;Jang, Seok-Ki;Lee, Don-Chool;Kim, Seong-Jong
    • Proceedings of the KSME Conference
    • /
    • 2004.11a
    • /
    • pp.25-30
    • /
    • 2004
  • The magnitude of constraint effect $A_{2}$ values were experimentally estimated using displacement according to measuring positions on the non-linear elastic plastic fracture toughness estimate. For 25.4 mm thickness SS400 steel CT specimen, constraint effect $A_{2}$ values we re dependent on specimen configuration and on measured displacement near crack front. Commonly, Estimating constraint effect $A_{2}$ measuring position for displacement should be existed inside plastic region. Therefore, the ${\delta}_{5}$ method was not reliable for evaluation of constraint effect $A_{2}$ values because measuring position for displacement is in elastic region at crack growth initiation in this paper.

  • PDF

APPLICATION OF CONSTRAINT LOGIC PROGRAMMING TO JOB SEQUENCING

  • Ko, Jesuk;Ku, Jaejung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.617-620
    • /
    • 2000
  • In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

  • PDF

Safety Evaluation for PSCI-Beam by Tilt-Constructed with Constraint and Deviation of Bearings (받침의 구속과 편기를 갖는 경사지게 설치된 PSCI빔의 안전성 평가)

  • Park, Chang-Ho;Shin, Jae-In;Lee, Byeong-Ju;Seo, Sang-Gul
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2006.05a
    • /
    • pp.346-349
    • /
    • 2006
  • Superstructure of reinforced concrete bridges are shortened or elongated due to creep, drying shrinkage, temperature and so on. Most of bridge superstructures are free to shortening and elongation without constraint and stresses will not be induced by creep, drying shrinkage and temperature. But if bridge superstructure are constraint due to wrong setting and functional defects of bridge bearing, very large constraint forces can be induced. In this study, PSCI-Beam by tilt-constructed with constraint and deviation of bearings are presented and the effects of time-dependent constraint stress and temperature loads are investigated.

  • PDF

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

A study on fuzzy constraint line clustering for optical flow estimation (Optical Flow 추정을 위한 Fuzzy constraint Line Clustering에 관한 연구)

  • 김현주;강해석;이상홍;김문현
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.9
    • /
    • pp.150-158
    • /
    • 1994
  • In this paepr, Fuzzy Constraint Line Clustering (FCLC) method for optical flow estimation is proposed. FCLC represents the spatical and temporal gradients as fuzzy sets. Based on these sets, several constraint lines with different membership values are generated for the poxed whose velocity is to be estimated. We describe the process for obtaining the membership values of the spatial and temporal gradients and that of the corresponding constraint line. We also show the process for deciding the tightest cluster of point formalated by intersection between constraint lines. For the synthetic and real images, the results of FCLC are compared with of CLC.

  • PDF

OPF Algorithm of changing inequality constraint to equality constraint (부등호 제약조건의 등호제약조건화를 통한 OPF해석 알고리즘)

  • Choi, J.H.;Kim, K.J.;Jeon, D.H.;Rhim, C.H.;Lee, B.R.;Han, H.G.
    • Proceedings of the KIEE Conference
    • /
    • 1999.11b
    • /
    • pp.197-199
    • /
    • 1999
  • This paper deals with optimal power flow, which is optimal problem with equality constraint and inequality constraint. A algorithm of changing two constraints problem to one constraint - equality constraint problem - that make it analytical access for optimal power flow is presented.

  • PDF

BPN Based Approximate Optimization for Constraint Feasibility (구속조건의 가용성을 보장하는 신경망기반 근사최적설계)

  • Lee, Jong-Soo;Jeong, Hee-Seok;Kwak, No-Sung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • 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.

  • PDF

A Geometric Constraint Solver for Parametric Modeling

  • Jae Yeol Lee;Kwangsoo Kim
    • Korean Journal of Computational Design and Engineering
    • /
    • v.3 no.4
    • /
    • pp.211-222
    • /
    • 1998
  • Parametric design is an important modeling paradigm in CAD/CAM applications, enabling efficient design modifications and variations. One of the major issues in parametric design is to develop a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this appear, we propose a new approach to geometric constraint solving that employs a graph-based method to solve the ruler-and-compass constructible configurations and a numerical method to solve the ruler-and-compass non-constructible configurations, in a way that combines the advantages of both methods. The geometric constraint solving process consists of two phases: 1) planning phase and 2) execution phase. In the planning phase, a sequence of construction steps is generated by clustering the constrained geometric entities and reducing the constraint graph in sequence. in the execution phase, each construction step is evaluated to determine the geometric entities, using both approaches. By combining the advantages of the graph-based constructive approach with the universality of the numerical approach, the proposed approach can maximize the efficiency, robustness, and extensibility of geometric constraint solver.

  • PDF

Hierarchical Constraint Network Representation of Concurrent Engineering Models (동시성공학 모형의 계층적 제약식 네트워크 표현 방법론)

  • Kim, Yeong-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.3
    • /
    • pp.427-440
    • /
    • 1996
  • Constraint networks are a major approach to knowledge representation in Concurrent Engineering (CE) systems. The networks model various factors in CE as constraints linked by shared variables. Many systems have been developed to assist constraint network processing. While these systems can be useful, their underlying assumption that a solution must simultaneously satisfy all the constraints is often unrealistic and hard to achieve. Proposed in this paper is a hierarchical representation of constraint networks using priorities, namely Prioritized Constraint Network (PCN). A mechanism to propagate priorities is developed, and a new satisfiability definition taking into account the priorities is described. Strength of constraint supporters can be derived from the propagated priorities. Several properties useful for investigating PCN's and finding effective solving strategies ore developed.

  • PDF

A Study on the Dynamic Analysis of Railway Vehicle by Using Track Coordinate System (트랙좌표계를 이용한 철도차량의 동역학 해석에 관한 연구)

  • Kang, Juseok
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.21 no.2
    • /
    • pp.122-130
    • /
    • 2013
  • Rail geometries such as cant, grade and curvature can be easily represented by means of a track coordinate system. In this analysis, in order to derive a dynamic and constraint equation of a wheelset, the track coordinate system is used as an intermediate stage. Dynamic and constraint equations of railway vehicle bodies except the wheelset are written in the Cartesian coordinate system as a conventional method. Therefore, whole dynamic equations of a railway vehicle are derived by combining wheelset dynamic equations and dynamic equations of railway vehicle bodies. Constraint equations and constraint Jacobians are newly derived for the track coordinate system. A process for numerical analysis is suggested for the derived dynamic and constraint equations of a railway vehicle. The proposed dynamic analysis of a railway vehicle is validated by comparison against results obtained from VI-RAIL analysis.