• Title/Summary/Keyword: constraint-based analysis

Search Result 481, Processing Time 0.023 seconds

Enhancement of Computational Efficiency of Reliability Optimization Method by Approximate Evaluation of Sub-Optimization Problem (부 최적화 문제의 근사적인 계산을 통한 신뢰도 최적설계 방범의 효율개선)

  • Jeong, Do-Hyeon;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.10
    • /
    • pp.1597-1604
    • /
    • 2001
  • Alternative computational scheme is presented fur reliability based optimal design using a modified advanced first order second moment (AFOSH) method. Both design variables and design parameters are considered as random variables about their nominal values. Each probability constraint is transformed into a sub -optimization problem and then is resolved with the modified Hasofer- Lind-Rackwitz-Fiessler (HL-RF) method for computational efficiency and convergence. A method of design sensitivity analysis for probability constraint is presented and tested through simple examples. The suggested method is examined by solving several examples and the results are compared with those of other 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
    • Journal of Ocean Engineering and Technology
    • /
    • v.24 no.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.

Analysis of Stress-Strain Hysteresis Behavior in Metal Composites (단섬유 금속복합재료의 응력-변형률 히스테리시스 거동 해석)

  • 김홍건
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1997.10a
    • /
    • pp.132-139
    • /
    • 1997
  • The strengthening mechanism of short fiber or whisker reinforced metal matrix composites has been studied by a continuum mechanics treatment utilizing finite element analysis (FEM). To assess the tensile and compressive constitutive responses, a constraint-unconstraint comparative study based on stree-strain hysteresis loop has been performed. For analysis procedures, the aligned axisymmetric single fiber model and the stress grouping technique have been implemented to evaluate the domain-based field quantities. Results indicated that the development of significant triaxial stresses within the matrix both for the tensile and compressive loading, due to the constraint imposed by reinforcements, provides and important contribution to strengthening. It was also found that fiber stresses are not only sensitive to the fiber/fiber interaction effects but also substantially contribute to the composite strengthening both for the tensile and compressive loading.

  • PDF

영한자동번역에서의 두단계 영어 전산문법

  • 최승권
    • Language and Information
    • /
    • v.4 no.1
    • /
    • pp.97-109
    • /
    • 2000
  • Application systems of natural language processing such as machine translation system must deal with actual texts including the full range of linguistic phenomena. But it seems to be impossible that the existing grammar covers completely such actual texts because they include disruptive factors such as long sentences, unexpected sentence patterns and erroneous input to obstruct well-formed analysis of a sentence. In order to solve analysis failure due to the disruptive factors or incorrect selection of correct parse tree among forest parse trees, this paper proposes two-level computational grammar which consists of a constraint-based grammar and an error-tolerant grammar. The constraint-based computational grammar is the grammar that gives us the well-formed analysis of English texts. The error-tolerant computational grammar is the grammar that reconstructs a comprehensible whole sentence structure with partially successful parse trees within failed parsing results.

  • PDF

The Optimal Tracking Error of Active Stock Fund by Smart Beta Strategy (스마트 베타 전략에 따른 액티브 주식형 펀드의 최적 추적오차)

  • Jae-Hyun Lee
    • Asia-Pacific Journal of Business
    • /
    • v.13 no.4
    • /
    • pp.163-175
    • /
    • 2022
  • Purpose - This study introduces a methodology for finding the optimal tracking error of active stock funds. Tracking error is commonly used in risk budgeting techniques as a concept of cost for alpha creation. Design/methodology/approach - This study uses a post-optimal smart beta portfolio that maximizes alpha under the given tracking error constraint. Findings - As a result of the analysis, the smart beta strategy that maximized alpha under the constraint of 0.15% daily tracking error shows the highest IR. This means the maximum theoretically achievable efficiency. In this regard, a fixed-effect panel regression analysis is conducted to evaluate the active efficiency of domestic stock funds. In addition to control variables based on previous studies, the effect of tracking error on alpha is analyzed. The alpha used in this model is calculated using the smart beta portfolio according to the size of the constraint of the tracking error as a benchmark. Contrary to theoretical estimates, in Korea, the alpha performance is maximized under a daily tracking error of 0.1%. This indicates that the active efficiency of domestic equity funds is lower than the theoretical maximum. Research implications or Originality - Based on this study, it is expected that it can be used for active risk management of pension funds and performance evaluation of active strategies.

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

  • Hong, Min;Lee, Seung-Hyun;Park, Doo-Soon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.4
    • /
    • pp.516-524
    • /
    • 2008
  • This paper presents a new modeling technique for the simulation of cloth specific characteristics with a set of hard constraints using an implicit constraint enforcement scheme. A conventional explicit Baumgarte constraint stabilization method has several defects. It requires users to pick problem-dependent coefficients to achieve fast convergence and has inherent stabilization limits. The proposed implicit constraint enforcement method is stable with large time steps, does not require problem dependent feed-back parameters, and guarantees the natural physics-based motion of an object. In addition, its computational complexity is the same as the explicit Baumgarte method. This paper describes a formulation of implicit constraint enforcement and provides a constraint error analysis. The modeling technique for complex components of cloth such as seams, buttons, sharp creases, wrinkles, and prevention of excessive elongation are explained. Combined with an adaptive constraint activation scheme, the results using the proposed method show the substantial enhancement of the realism of cloth simulations with a corresponding savings in computational cost.

  • PDF

Specimen Thickness and Crack Depth Effects on J Testing and Crack Tip Constraint for Non-standard Specimen (시편두께 및 균열깊이 영향을 고려한 비표준시편의 J 시험법 및 구속효과의 정량화)

  • Kim, Jin-Su;Cho, Soo-Man;Kim, Yun-Jae;Kim, Young-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.9
    • /
    • pp.1531-1538
    • /
    • 2003
  • This paper compiles solutions of plastic $\eta$ factors and crack tip stress triaxialites for standard and nonstandard fracture toughness testing specimens, via detailed three-dimensional (3-D) finite element (FE) analyses. Fracture toughness testing specimens include a middle cracked tension (M(T)) specimen, SE(B), single-edge cracked bar in tension (SE(T)) and C(T) specimen. The ligament-to-thickness ratio of the specimen is systematically varied. It is found that the use of the CMOD overall provides more robust experimental J estimation than that of the LLD, for all cases considered in the present work. Moreover, the J estimation based on the load-CMOD record is shown to be insensitive to the specimen thickness, and thus can be used for testing specimen with any thickness. The effects of in-plane and out-of-plane constraint on the crack tip stress triaxiality are also quantified, so that when experimental J value is estimated according to the procedure recommended in this paper, the corresponding crack tip stress triaxiality can be estimated. Moreover, it is found that the out-of-plane constraint effect is related to the in-plane constraint effect.

In-Route Nearest Neighbor Query Processing Algorithm with Time Constraint in Spatial Network Databases (공간 네트워크 데이터베이스에서 시간제약을 고려한 경로 내 최근접 질의처리 알고리즘)

  • Kim, Yong-Ki;Kim, Sang-Mi;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.196-200
    • /
    • 2008
  • Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route-based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one.

Relationship between Constraint, Motive and Degree of Participation in Sport for All (사회체육활동 참여 제약과 동기 및 정도의 관계)

  • Kim, Kyong-Sik
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.11
    • /
    • pp.338-346
    • /
    • 2008
  • This study was to analyze the relationship between constraint, motive and degree of participation in sport for all. To attain the goal of this study described above paragraphs, the peoples dwelling in Chungnam, 2007 year were set as a collected group. Then, stratified cluster random sampling method, finally drew out and analyzed 400 people in total. The result of reliability check up was here below; over Chronbach's ${\alpha}=.687$. To analyze materials, reliability analysis, CFA and SEM were used as statistic analysis techniques. The conclusion based on above study method and the result of material analysis are here below. First, constraint influence on the motive of participation in sport for all. Second, motive influence on the degree of participation in sport for all. Third, constraint influence on the degree of participation in sport for all.

On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB Constrain (확장된 일반상한제약을 갖는 이차원 선형계획 배낭문제 연구)

  • Won, Joong-Yeon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.25-29
    • /
    • 2001
  • We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

  • PDF