• 제목/요약/키워드: Problem Decomposition

검색결과 586건 처리시간 0.077초

Role of Artificial Neural Networks in Multidisciplinary Optimization and Axiomatic Design

  • Lee, Jong-Soo
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2008년도 추계학술대회A
    • /
    • pp.695-700
    • /
    • 2008
  • Artificial neural network (ANN) has been extensively used in areas of nonlinear system modeling, analysis and design applications. Basically, ANN has its distinct capabilities of implementing system identification and/or function approximation using a number of input/output patterns that can be obtained via numerical and/or experimental manners. The paper describes a role of ANN, especially a back-propagation neural network (BPN) in the context of engineering analysis, design and optimization. Fundamental mechanism of BPN is briefly summarized in terms of training procedure and function approximation. The BPN based causality analysis (CA) is further discussed to realize the problem decomposition in the context of multidisciplinary design optimization. Such CA is also applied to quantitatively evaluate the uncoupled or decoupled design matrix in the context of axiomatic design with the independence axiom.

  • PDF

공공성을 고려한 열차용량 할당 (Train-Fleet Assignment based on Public Interests)

  • 오석문;손무성;최인찬;최인상
    • 한국철도학회논문집
    • /
    • 제8권6호
    • /
    • pp.602-609
    • /
    • 2005
  • In this paper, we consider the train-fleet assignment problem to determine fleet assignment and seat allocation synchronously. An integer programming model of the problem and a decomposition-based solution approach are developed to handle short-term period deterministic orgin-destination demands. The primary objective used in the developed model is to maximize the total number of passengers transported during peak load periods, such as Chuseok national holiday period. Thus, in developing the model we choose to profit-pursuing system. We also show how the proposed model can be readily modified to incorporate profit-maximization. Using the empirical data sets provided by a Korean railroad company, we have tested the proposed solution approach and carried out various comparison analyses by varying traffic demand patterns and train schedules. The computational experiments reveal that the proposed solutions approach produces high quality solutions in reasonable computation time.

삭마 및 열분해 반응을 고려한 고체 추진기관의 열해석 (Thermal decomposition and ablation analysis of solid rocket propulsion)

  • 김연철
    • 한국추진공학회:학술대회논문집
    • /
    • 한국추진공학회 2010년도 제34회 춘계학술대회논문집
    • /
    • pp.113-122
    • /
    • 2010
  • 고체추진기관의 연소 환경에서 복잡한 형상을 갖는 내열 복합재료의 온도, 밀도분포 및 삭마두께를 예측할 수 있는 방법을 개발하였다. 복합재료의 내부 열반응은 Arrhenius 모델을 이용하였으며, 표면 삭마반응은 Zvyagin 이론을 사용하였다. 표면 삭마에 의한 경계조건 및 격자 이동은 상용해석 코드에서 활용되는 Rezoning-remeshing 기법을 사용하였다. 형상이 복잡한 부품으로 이루어진 2차원 축대칭 노즐 조립체에 적용된 방법은 향후 3차원 FEM 열구조 해석에 활용을 목표로 발전될 것이다.

  • PDF

준정부호 스펙트럼의 군집화 (Semidefinite Spectral Clustering)

  • 김재환;최승진
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
    • /
    • pp.892-894
    • /
    • 2005
  • Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.

  • PDF

Reconstruction of missing response data for identification of higher modes

  • Shrikhande, Manish
    • Earthquakes and Structures
    • /
    • 제2권4호
    • /
    • pp.323-336
    • /
    • 2011
  • The problem of reconstruction of complete building response from a limited number of response measurements is considered. The response at the intermediate degrees of freedom is reconstructed by using piecewise cubic Hermite polynomial interpolation in time domain. The piecewise cubic Hermite polynomial interpolation is preferred over the spline interpolation due to its trend preserving character. It has been shown that factorization of response data in variable separable form via singular value decomposition can be used to derive the complete set of normal modes of the structural system. The time domain principal components can be used to derive empirical transfer functions from which the natural frequencies of the structural system can be identified by peak-picking technique. A reduced-rank approximation for the system flexibility matrix can be readily constructed from the identified mass-orthonormal mode shapes and natural frequencies.

Estimating People's Position Using Matrix Decomposition

  • Dao, Thi-Nga;Yoon, Seokhoon
    • International journal of advanced smart convergence
    • /
    • 제8권2호
    • /
    • pp.39-46
    • /
    • 2019
  • Human mobility estimation plays a key factor in a lot of promising applications including location-based recommendation systems, urban planning, and disease outbreak control. We study the human mobility estimation problem in the case where recent locations of a person-of-interest are unknown. Since matrix decomposition is used to perform latent semantic analysis of multi-dimensional data, we propose a human location estimation algorithm based on matrix factorization to reconstruct the human movement patterns through the use of information of persons with correlated movements. Specifically, the optimization problem which minimizes the difference between the reconstructed and actual movement data is first formulated. Then, the gradient descent algorithm is applied to adjust parameters which contribute to reconstructed mobility data. The experiment results show that the proposed framework can be used for the prediction of human location and achieves higher predictive accuracy than a baseline model.

ILLUMINATION ADUSTMENT FOR BRIDGE COATING IMAGES USING BEMD-MORPHOLOGY APPROACH

  • Po-Han Chen;Ya-Ching Yang;Luh-Maan Chang
    • 국제학술발표논문집
    • /
    • The 3th International Conference on Construction Engineering and Project Management
    • /
    • pp.224-229
    • /
    • 2009
  • Digital image recognition has been used for steel bridge surface assessment since late 1990s. However, the non-uniform illumination problems such as shades, shadows, and highlights are still challenges in image processing to date. Therefore, this paper develops a new approach to tackle the non-uniform illumination problem for rust image adjustment. The inhomogeneous illumination problem is divided into shades/shadows and highlights in this paper. The proposed BEMD-morphology approach (BMA) utilizes the bidimensional empirical mode decomposition to mitigate the shade/shadow effect, and the morphological processing to detect and replace the highlight area. Finally, the rust image processed with the BMA will be segmented by the K-Means algorithm, one of the most popular and effective methods, to show the effectiveness of illumination adjustment.

  • PDF

A DIRECT SOLVER FOR THE LEGENDRE TAU APPROXIMATION FOR THE TWO-DIMENSIONAL POISSON PROBLEM

  • Jun, Se-Ran;Kang, Sung-Kwon;Kwon, Yong-Hoon
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.25-42
    • /
    • 2007
  • A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.

궤도 다짐작업의 장기 일정계획문제에 관한 수리적 모형 고찰 (A study on the mathematical model of the long-term track tamping scheduling problem)

  • 오석문;이지하;박범환;이희업;홍순흠
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2005년도 추계학술대회 논문집
    • /
    • pp.1130-1137
    • /
    • 2005
  • This paper addresses the mathematical model of the long-term track tamping scheduling problem in the railway system. The proposed model is analyzed in problem size, then three solution approaches (relaxation, decomposition, and heuristic) are presented at the sketch level.

  • PDF

다중 사용자 OFDM 시스템의 최적 부채널 및 비트 할당: Dual-Decomposition 방법 (The Optimal Subchannel and Bit Allocation for Multiuser OFDM System: A Dual-Decomposition Approach)

  • 박태형;임성빈;서만중
    • 한국통신학회논문지
    • /
    • 제34권1C호
    • /
    • pp.90-97
    • /
    • 2009
  • OFDM (Orthogonal Frequency Division Multiplexing) 전송방식의 장점은 높은 주파수 효율, RF간섭에 대한 강인성, 낮은 다중 경로 왜곡 등을 들 수 있다. 다중 사용자 OFDM의 채널용량을 확대하기 위해서는 사용자간의 부채널과 비트 할당의 효율적인 알고리즘을 개발하여야 한다. 본 연구에서는 다중 사용자의 전송요구량을 만족하는 최적 부채널 및 비트 할당 문제를 0-1 정수계획법 모형으로 형성하고, 원래 문제의 선형계획법 완화 (linear programming relaxation)문제를 dual-decomposition과 subgradient 알고리즘을 사용하여 해를 구하는 효과적인 알고리즘을 제시한다. 또한 dual-decomposition으로 구한 목적함수값은 원래 문제의 선형계획법 완화문제의 최적목적함수 간과 동일함을 증명하였다 모의실험을 통하여 다수의 문제에 대하여 원래 문제의 최적 목적항수값에 대한 dual-decomposition으로 구한 하한의 성능을 제시하였다. MQAM (M-ary Quadrature Amplitude Modulation)을 사용하고 3개의 독립적인 Rayleigh 다중 경로로 구성된 주파수 선택적 채널을 가정한 경우 MATLAB을 사용한 모의실험에서 0-1 정수계획 법으로 구한 최적해의 성능을 실험하였다.