• 제목/요약/키워드: A-Optimality

검색결과 575건 처리시간 0.03초

연료비 최소화를 위한 유무효 발전력 분담 (Minimization of Fuel Cost by Optimal Generation)

  • 이상중
    • 한국조명전기설비학회:학술대회논문집
    • /
    • 한국조명전기설비학회 2003년도 학술대회논문집
    • /
    • pp.289-290
    • /
    • 2003
  • This paper gives a method for the minimization of the fuel cost by optimal generation. Derivation of the sensitivity of system loss by optimization technique is introduced and the loss sensitivities are substituted into the optimality conditions to obtain the minimized fuel cost.

  • PDF

큰에디모사법을 이용한 최적 디퓨져내의 난류유동 해석 (Large Eddy Simulation of Turbulent Flow in an Optimal Diffuser)

  • 임석현;최해천
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2002년도 학술대회지
    • /
    • pp.811-814
    • /
    • 2002
  • Using a mathematical theory, we show that the optimality condition of a turbulent diffuser with maximum pressure recovery at the exit is zero shear stress along the wall. The optimal diffuser shape is designed through iterative procedures by using the $k-{\varepsilon}-{\nu}^{2}-f$ turbulence model for flow simulation. The Reynolds number based on the bulk mean velocity and the channel height at the diffuser entrance is 18,000. We also perform large eddy simulation to validate the shape design results and investigate the flow characteristics near the zero-skin friction wall. Results from large eddy simulation show that the skin friction is slightly higher than zero but is still very small as compared to that of the flat plate boundary layer flow Although the time-averaged wall shear stress is slightly above zero along the diffuser wall, instantaneous flow reversals occur intermittently. The streamwise mein velocity shows an asymptotic behavior of the half-power-law near the wall where the skin friction is close to zero.

  • PDF

수정된 Notz계획을 이용한 2차모형의 경제적 추정 (Economic Second-Order Modeling Using Modified Notz Design)

  • 윤태홍;변재현
    • 품질경영학회지
    • /
    • 제40권4호
    • /
    • pp.431-440
    • /
    • 2012
  • Purpose: In this paper we propose modified Notz designs which are useful to experimenters who want to adopt the sequential experimentation strategy and to estimate second-order regression model with as few experimental points as possible. Methods: We first present the design matrices and design points in two or three dimensional spaces for such small sized second-order designs as small composite, hybrid, and Notz designs. Modified Notz designs are proposed and compared with some response surface designs in terms of the total number of experimental points, the estimation capability criteria such as D- and A-optimality. Results: When sequential experimentation is necessary, the modified Notz designs are recommendable. Conclusion: The result of this paper will be beneficial to experimenters who need to do experiments more efficiently, especially for those who want to reduce the time of experimentation as much as possible to develop cutting-edge products.

Some Properties on Receding Horizon $H_{\infty}$ Control for Nonlinear Discrete-time Systems

  • Ahn, Choon-Ki;Han, Soo-Hee;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.460-465
    • /
    • 2004
  • In this paper, we present some properties on receding horizon $H_{\infty}$ control for nonlinear discrete-time systems. First, we propose the nonlinear inequality condition on the terminal cost for nonlinear discrete-time systems. Under this condition, noninceasing monotonicity of the saddle point value of the finite horizon dynamic game is shown to be guaranteed. We show that the derived condition on the terminal cost ensures the closed-loop internal stability. The proposed receding horizon $H_{\infty}$ control guarantees the infinite horizon $H_{\infty}$ norm bound of the closed-loop systems. Also, using this cost monotonicity condition, we can guarantee the asymptotic infinite horizon optimality of the receding horizon value function. With the additional condition, the global result and the input-to-state stable property of the receding horizon value function are also given. Finally, we derive the stability margin for the saddle point value based receding horizon controller. The proposed result has a larger stability region than the existing inverse optimality based results.

  • PDF

선형 회귀모형에서 벌점 추정량의 신의 성질에 대한 충분조건 (Sufficient conditions for the oracle property in penalized linear regression)

  • 권성훈;장재호;문혜성;이상인
    • 응용통계연구
    • /
    • 제34권2호
    • /
    • pp.279-293
    • /
    • 2021
  • 본 논문은 선형 회귀모형에서 벌점 추정량의 신의 성질에 대한 충분조건을 구성하는 방법을 소개하였다. 신의 추정량, 벌점 추정량, 신의 벌점 추정량, 신의 성질을 명확히 정의하였으며 이를 바탕으로 신의 성질에 대한 최적조건과 최적조건에 대한 충분조건을 구성하는 방법을 대부분의 벌점함수에 적용 가능하도록 하나의 통합된 원리로 소개하였다. 추가로 신의 성질에 대한 이해를 돕기 위해 간단한 예제와 함께 가상실험 결과를 첨부하였다.

하위박에 의한 도약율의 리듬화 (Rhythmization of Sprung Rhythm by a Sub-beat)

  • 손일권
    • 대한음성학회지:말소리
    • /
    • 제39호
    • /
    • pp.25-42
    • /
    • 2000
  • In this paper, I have shown how to associate a musical beat with a note within the framework of Optimality Theory. And the following hierarchy of constraints is suggested to associate a sub-beat with a note. Alternation Sub-beat CCC Head $\gg$ Beat-to-Note $\gg$ Note-to-Beat EQ-Beats Smaller Note Furthermore, I have tried to explain Sprung Rhythm with a musical beat system. I have suggested the following hierarchy for Sprung Rhythm. Head $\gg$ SCSR Using a sub-beat on the basis of Head $\gg$ SCSR shows the abrupt change of Sprung Rhythm well.

  • PDF

분산 메모리 시스템에서의 병렬 위상 최적설계 (Parallel Topology Optimization on Distributed Memory System)

  • 이기명;조선호
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2006년도 정기 학술대회 논문집
    • /
    • pp.291-298
    • /
    • 2006
  • A parallelized topology design optimization method is developed on a distributed memory system. The parallelization is based on a domain decomposition method and a boundary communication scheme. For the finite element analysis of structural responses and design sensitivities, the PCG method based on a Krylov iterative scheme is employed. Also a parallelized optimization method of optimality criteria is used to solve large-scale topology optimization problems. Through several numerical examples, the developed method shows efficient and acceptable topology optimization results for the large-scale problems.

  • PDF

투영법에 의한 성형계획문제의 시각적 표현에 관하여 (On the Visual Representation of Linear Programming Problem by a Projection Method)

  • 김우제;박순달
    • 한국경영과학회지
    • /
    • 제18권3호
    • /
    • pp.101-111
    • /
    • 1993
  • The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

  • PDF

Empirical Optimality of Coverage Design Criteria for Space-Filling Designs

  • Baik, Jung-Min
    • 응용통계연구
    • /
    • 제25권3호
    • /
    • pp.485-501
    • /
    • 2012
  • This research is to find a design D that minimizes forecast variance in d dimensions over the candidate space ${\chi}$. We want a robust design since we may not know the specific covariance structure. We seek a design that minimizes a coverage criterion and hope that this design will provide a small forecast variance even if the covariance structure is unobservable. The details of an exchange or swapping algorithm and several properties of the parameters of coverage criterion with the unknown correlation structures are discussed.

ANOTHER APPROACH TO MULTIOBJECTIVE PROGRAMMING PROBLEMS WITH F-CONVEX FUNCTIONS

  • LIU SANMING;FENG ENMIN
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.379-390
    • /
    • 2005
  • In this paper, optimality conditions for multiobjective programming problems having F-convex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function. Furthermore, an F-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of a saddle point are given.