• 제목/요약/키워드: constraint-based

검색결과 1,646건 처리시간 0.025초

Constraint-corrected fracture mechanics analysis of nozzle crotch corners in pressurized water reactors

  • Kim, Jong-Sung;Seo, Jun-Min;Kang, Ju-Yeon;Jang, Youn-Young;Lee, Yun-Joo;Kim, Kyu-Wan
    • Nuclear Engineering and Technology
    • /
    • 제54권5호
    • /
    • pp.1726-1746
    • /
    • 2022
  • This paper presents fracture mechanics analysis results for various cracks located at pressurized water reactor pressure vessel nozzle crotch corners taking into consideration constraint effect. Technical documents such as the ASME B&PV Code, Sec.XI were reviewed and then a fracture mechanics analysis procedure was proposed for structural integrity assessment of various nozzle crotch corner cracks under normal operation conditions considering the constraint effect. Linear elastic fracture mechanics analysis was performed by conducting finite element analysis with the proposed analysis procedure. Based on the evaluation results, elastic-plastic fracture mechanics analysis taking into account the constraint effect was performed only for the axial surface crack of the reactor pressure vessel outlet nozzle with cladding. The fracture mechanics analysis result shows that only the axial surface crack in the reactor pressure vessel outlet nozzle has the stress intensity factor exceeding the low bound of upper-shelf fracture toughness irrespectively of considering the constraint effect. It is confirmed that the J-integral for the axial crack of the outlet nozzle does not exceed the ductile crack initiation toughness. Hence, it can be ensured that the structural integrity of all the cracks is maintained during the normal operation.

전자상거래에서의 벡터 공간 모델링을 통한 Configuration 시스템 (Configuration System through Vector Space Modeling In I-Commerce)

  • 김세형;조근식
    • 지능정보연구
    • /
    • 제7권1호
    • /
    • pp.149-159
    • /
    • 2001
  • 최근 전자상거래에는 일대일 마케팅이나 협력적 정보여과기법등을 이용한 다양한 추천서비스가 도입되고 있다. 이러한 추천 서비스의 형태는 다양한 제약 조건을 갖고 계산 복잡도가 높은 제품의 경우에는 고객을 만족시킬 만큼 적절한 추천서비스가 이루어지기 어려울 것으로 본다. 본 논문에서는 Clancey의 Classification Problem Solving 방법과 제약조건 기반 Configuration기술을 통합하여, 이러한 문제를 해결할 수 있는 방법을 제시하였다. 이 방법은 Clancey의 이론에 따라 구성 복잡도가 높은 제품의 해집합 도메인을 분할하여 문제의 복잡도를 줄일 수 있도록 하였으며, 여기에서 선택된 도메인을 제약조건 기반 Configuration기술에 적용시킴으로써, 구매자와 제품 컴포넌트 사이에 존재하는 제약조건을 처리할 수 있도록 하였다. 제약조건기반 Configuration기술은 구매자에게 적합한 제품을 구성하기 위해서 제막 조건 판촉 문제(Constraint Satisfaction Problem; CSP)해결 기법을 이용한다. 또한 Clancey이론은 구매자의 만족도를 고려하기 위해서 정보검색 분야의 벡터공간 모델링 방법을 변형하여 적용하였다. 마지막으로 본 모델의 평가를 위해 전체 시스템의 수행시간 및 구매자 만족도를 비교 분석하였다

  • PDF

무선 센서 네트웍에서 에너지 효율적인 집단화를 위한 경험적 백트랙 탐색 알고리즘 (Heuristic Backtrack Search Algorithm for Energy-efficient Clustering in Wireless Sensor Networks)

  • 손석원
    • 한국컴퓨터정보학회논문지
    • /
    • 제13권5호
    • /
    • pp.219-227
    • /
    • 2008
  • 제약만족문제(Constraint Satisfaction Problem)의 연구에서 밝혀졌듯이, 제약최적화 문제(Constraint Optimization Problem)를 효율적으로 풀기 위해서는 변수순서화의 경험적 방법이 매우 중요하다. 이기종이 혼합된 무선 센서 네트웍의 에너지 효율적인 집단화 같은 문제는 클러스터 헤드가 기지국에 가깝게 위치하려는 경향이 있다. 본 논문은 이 집단화 문제를 풀기 위해서 정적 우선순위 변수 순서화에 기반을 둔 새로운 접근방법을 제시하고. pnode 라는 새로운 알고리즘을 제안한다. 이 pnode 알고리즘은 우선순위가 가장 높은 변수를 다음 변수로 선택한다. 집단화문제에 있어서 우선순위가 높다는 것은 클러스터 헤드가 최적지역에 근접하게 된다는 것을 의미하며 이것은 문제의 성격상 미리 정해진다. 클러스터화 된 센서 네트웍에서 클러스터 헤드는 에너지 소비가 가장 많이 일어나는 곳이기 때문에 센서 노드뿐만 아니라 클러스터 헤드에서 발생하는 최대 에너지 소비를 최소화하도록 만드는 방법을 찾는 것이 본 논문의 목적이다. pnode알고리즘을 사용하여 시뮬레이션 한 결과 제안된 방법이 다른 방법들보다 우수함을 알 수 있었다.

  • PDF

묵시적 제한방법을 이용한 옷 모델링 방법 (Cloth Modeling using Implicit Constraint Enforcement)

  • 홍민;이승현;박두순
    • 한국멀티미디어학회논문지
    • /
    • 제11권4호
    • /
    • pp.516-524
    • /
    • 2008
  • 본 논문은 기존에 연구되지 않았던 옷의 독특한 특징들을 묵시적 제한방법을 사용하여 강력한 제한력으로 구현하는 새로운 모델링 방법을 제안한다. 기존의 명시적 제한방법인 Baumgarte 안정화 방법은 해에 빠르게 수렴하도록 하기 위해 사용자가 시뮬레이션에 따라서 값이 달라지는 안정화 변수 값을 선택해야 하고, 시뮬레이션의 시간 간격 사용에 있어서 안정화에 한계가 있는 단점들이 있다. 본 논문은 큰 시간 간격에도 안정적이고, 안정화 변수 값을 요구하지 않고, 물리적으로도 적합한 물체의 움직임을 보장하는 묵시적 제한방법을 사용한다. 또한 묵시적 제한 방법의 계산 복잡도는 Baumgarte 안정화 방법과 같다. 본 논문은 묵시적 제한방법의 수식과 제한의 오차 분석을 설명하였고 옷의 솔기, 단추, 옷 주름, 옷의 구김, 과잉 늘어짐 방지 등의 복잡한 옷의 요소들에 대한 모델링 방법을 제시하였다. 본 논문에서 제안된 방법은 외부 상황에 의해 각종 제한들이 자동적으로 설정되고 제거되어 계산 비용을 절약함과 동시에 옷의 독특한 특징들의 구현을 통해 현실감 있는 옷 시뮬레이션의 결과들을 얻었다.

  • PDF

컴퓨터 그래픽스 특수효과를 위한 유체시뮬레이션 기법들 (FLUID SIMULATION METHODS FOR COMPUTER GRAPHICS SPECIAL EFFECTS)

  • 정문열
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2009년 추계학술대회논문집
    • /
    • pp.1-1
    • /
    • 2009
  • In this presentation, I talk about various fluid simulation methods that have been developed for computer graphics special effects since 1996. They are all based on CFD but sacrifice physical reality for visual plausability and time. But as the speed of computer increases rapidly and the capability of GPU (graphics processing unit) improves, methods for more physical realism have been tried. In this talk, I will focus on four aspects of fluid simulation methods for computer graphics: (1) particle level-set methods, (2) particle-based simulation, (3) methods for exact satisfaction of incompressibility constraint, and (4) GPU-based simulation. (1) Particle level-set methods evolve the surface of fluid by means of the zero-level set and a band of massless marker particles on both sides of it. The evolution of the zero-level set captures the surface in an approximate manner and the evolution of marker particles captures the fine details of the surface, and the zero-level set is modified based on the particle positions in each step of evolution. (2) Recently the particle-based Lagrangian approach to fluid simulation gains some popularity, because it automatically respects mass conservation and the difficulty of tracking the surface geometry has been somewhat addressed. (3) Until recently fluid simulation algorithm was dominated by approximate fractional step methods. They split the Navier-Stoke equation into two, so that the first one solves the equation without considering the incompressibility constraint and the second finds the pressure which satisfies the constraint. In this approach, the first step introduces error inevitably, producing numerical diffusion in solution. But recently exact fractional step methods without error have been developed by fluid mechanics scholars), and another method was introduced which satisfies the incompressibility constraint by formulating fluid in terms of vorticity field rather than velocity field (by computer graphics scholars). (4) Finally, I want to mention GPU implementation of fluid simulation, which takes advantage of the fact that discrete fluid equations can be solved in parallel.

  • PDF

Opposition Based Differential Evolution Algorithm for Dynamic Economic Emission Load Dispatch (EELD) with Emission Constraints and Valve Point Effects

  • Thenmalar, K.;Ramesh, S.;Thiruvenkadam, S.
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권4호
    • /
    • pp.1508-1517
    • /
    • 2015
  • Optimal Power dispatch is the short-term decision of the optimal output of a number of power generation facilities, to meet the system demand, with the objective of Power dispatching at the lowest possible cost, subject to transmission lines power loss and operational constraints. The operational constraint includes power balance constraint, generator limit constraint, and emission dispatch constraint and valve point effects. In this paper, Opposition based Differential Evolution Algorithm (ODEA) has been proposed to handle the objective function and the operational constraints simultaneously. Furthermore, the valve point loading effects and transmission lines power loss are also considered for the efficient and effective Power dispatch. The ODEA has unique features such as self tuning of its control parameters, self acceleration and migration for searching. As a result, it requires very minimum executions compared with other searching strategies. The effectiveness of the algorithm has been validated through four standard test cases and compared with previous studies. The proposed method out performs the previous methods.

Approximate Optimization Using Moving Least Squares Response Surface Methods: Application to FPSO Riser Support Design

  • Song, Chang-Yong;Lee, Jong-Soo;Choung, Joon-Mo
    • 한국해양공학회지
    • /
    • 제24권1호
    • /
    • pp.20-33
    • /
    • 2010
  • The paper deals with strength design of a riser support installed on floating production storage and offloading (FPSO) vessel under various loading conditions - operation, extreme, damaged, one line failure case (OLFC) and installation. The design problem is formulated such that thickness sizing variables are determined by minimizing the weight of a riser support structure subject to stresses constraints. The initial design model is generated based on an actual FPSO riser support specification. The finite element analysis (FEA) is conducted using MSC/NASTRAN, and optimal solutions are obtained via moving least squares method (MLSM) in the context of response surface based approximate optimization. For the meta-modeling of inequality constraint functions of stresses, a constraint-feasible moving least squares method (CF-MLSM) is used in the present study. The method of CF-MLSM, compared to a conventional MLSM, has been shown to ensure the constraint feasibility in a case where the approximate optimization process is employed. The optimization results present improved design performances under various riser operating conditions.

Generation of synthetic accelerograms using a probabilistic critical excitation method based on energy constraint

  • Bazrafshan, Arsalan;Khaji, Naser
    • Earthquakes and Structures
    • /
    • 제18권1호
    • /
    • pp.45-56
    • /
    • 2020
  • The application of critical excitation method with displacement-based objective function for multi degree of freedom (MDOF) systems is investigated. To this end, a new critical excitation method is developed to find the critical input motion of a MDOF system as a synthetic accelerogram. The upper bound of earthquake input energy per unit mass is considered as a new constraint for the problem, and its advantages are discussed. Considering this constraint, the critical excitation method is then used to generate synthetic accelerograms for MDOF models corresponding to three shear buildings of 10, 16, and 22 stories. In order to demonstrate the reliability of generated accelerograms to estimate dynamic response of the structures, three target ground motions with considerable level of energy contents are selected to represent "real critical excitation" of each model, and the method is used to re-generate these ground motions. Afterwards, linear dynamic analyses are conducted using these accelerograms along with the generated critical excitations, to investigate the key parameters of response including maximum displacement, maximum interstory drift, and maximum absolute acceleration of stories. The results show that the generated critical excitations can make an acceptable estimate of the structural behavior compared to the target ground motions. Therefore, the method can be reliably implemented to generate critical excitation of the structure when real one is not available.

MMSE Transmit Optimization for Multiuser Multiple-Input Single-Output Broadcasting Channels in Cognitive Radio Networks

  • Cao, Huijin;Lu, Yanhui;Cai, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권9호
    • /
    • pp.2120-2133
    • /
    • 2013
  • In this paper, we address the problem of linear minimum mean-squared error (MMSE) transmitter design for the cognitive radio (CR) multi-user multiple-input single-output (MU-MISO) broadcasting channel (BC), where the cognitive users are subject to not only a sum power constraint, but also a interference power constraint. Evidently, this multi-constraint problem renders it difficult to solve. To overcome this difficulty, we firstly transform it into its equivalent formulation with a single constraint. Then by utilizing BC-MAC duality, the problem of BC transmitter design can be solved by focusing on a dual MAC problem, which is easier to deal with due to its convexity property. Finally we propose an efficient two-level iterative algorithm to search the optimal solution. Our simulation results are provided to corroborate the effectiveness of the proposed algorithm and show that this proposed CR MMSE-based scheme achieves a suboptimal sum-rate performance compared to the optimal DPC-based algorithm with less computational complexity.

시간 제약 조건 하에서 저전력을 고려한 CLB구조의 CPLD 기술 매핑 알고리즘 (CLB-Based CPLD Technology Mapping Algorithm for Power Minimization under Time Constraint)

  • 김재진;김희석
    • 대한전자공학회논문지SD
    • /
    • 제39권8호
    • /
    • pp.84-91
    • /
    • 2002
  • In this paper, we proposed a CLB-based CPLD technology mapping algorithm for power minimization under time constraint in combinational circuit. The main idea of our algorithm is to exploit the "cut enumeration and feasible cluster" technique to generate possible mapping solutions for the sub-circuit rooted at each node. In our technology mapping algorithm conducted a low power by calculating TD and EP of each node and decomposing them on the circuit composed of DAG. It also takes the number of input, output, and OR-term into account on condition that mapping can be done up to the base of CLB, and so it generates the feasible clusters to meet the condition of time constraint. Of the feasible clusters, we should first be mapping the one that h3s the least output for technology mapping of power minimization and choose to map the other to meet the condition of time constraint afterwards. To demonstrate the efficiency of our approach, we applied our algorithm to MCNC benchmarks and compared the results with those of the exiting algorithms. The experimental results show that our approach is shown a decrease of 46.79% compared with DDMAP and that of 24.38% for TEMPLA in the power consumption.