• 제목/요약/키워드: Numeric solution

검색결과 29건 처리시간 0.023초

구배법 알고리즘에 의한 슬래브축열의 최적제어 해석 (An Analysis of the Optimal Control of Air-Conditioning System with Slab Thermal Storage by the Gradient Method Algorithm)

  • 정재훈
    • 설비공학논문집
    • /
    • 제20권8호
    • /
    • pp.534-540
    • /
    • 2008
  • In this paper, the optimal bang-bang control problem of an air-conditioning system with slab thermal storage was formulated by gradient method. Furthermore, the numeric solution obtained by gradient method algorithm was compared with the analytic solution obtained on the basis of maximum principle. The control variable is changed uncontinuously at the start time of thermal storage operation in an analytic solution. On the other hand, it is showed as a continuous solution in a numeric solution. The numeric solution reproduces the analytic solution when a tolerance for convergence is applied severely. It is conceivable that gradient method is effective in the analysis of the optimal bang-bang control of the large-scale system like an air-conditioning system with slab thermal storage.

유전알고리즘과 DNA 코딩을 이용한 Numeric 패턴인식 (Numeric Pattern Recognition Using Genetic Algorithm and DNA coding)

  • 백동화;한승수
    • 한국지능시스템학회논문지
    • /
    • 제13권1호
    • /
    • pp.37-44
    • /
    • 2003
  • 본 논문은 DNA coding 방법과 Genetic Algorithm(GA)을 사용하여 numeric(0~9) 패턴인식 성능을 비교 평가하였다. 이진스트링의 개체 집단 위에서 모의진화를 일으켜 효율적으로 최적 해를 탐색하는 GA와, 생체 분자인 DNA를 계산의 도구 및 정보 저장도구로 사용하며, Adenine(A), Cytosine(C), Guanine(G), Thymine(T)등의 4가지 염기를 사용하는 DNA coding 방법을 이용하여 numeric 패턴인식을 수행하였다. DNA coding 방법과 GA의 성능을 비교 평가하기 위해서 selection, crossover, mutation 등의 GA연산자를 DNA coding에 동일하게 적용하였다. 실험결과, DNA coding 방법은 GA보다 효과적으로 패턴인식을 수행하였다. GA에 비해 DNA coding 방법의 장점은 스트링의 길이가 가변적이고 해의 중복성을 가지며, 4가지 염기를 이용하기 때문에 해 표현이 다양함을 가지고 있다.

Convergence and Measurement of Inter-Departure Processes in a Pull Serial Line: Entropy and Augmented Lagrange Multiplier Approach

  • Choe, Sang-Woong
    • Industrial Engineering and Management Systems
    • /
    • 제1권1호
    • /
    • pp.29-45
    • /
    • 2002
  • In this study, we consider infinite supply of raw materials and backlogged demands as given two boundary conditions. And we need not make any specific assumptions about the inter-arrival of external demand and service time distributions. We propose a numeric model and an algorithm in order to compute the first two moments of inter-departure process. Entropy enables us to examine the convergence of this process and to derive measurable relations of this process. Also, lower bound on the variance of inter-departure process plays an important role in proving the existence and uniqueness of an optimal solution for a numeric model and deriving the convergence order of augmented Lagrange multipliers method applied to a numeric model. Through these works, we confirm some structural properties and numeric examples how the validity and applicability of our study.

A closed-form solution for a fluid-structure system: shear beam-compressible fluid

  • Keivani, Amirhossein;Shooshtari, Ahmad;Sani, Ahmad Aftabi
    • Coupled systems mechanics
    • /
    • 제2권2호
    • /
    • pp.127-146
    • /
    • 2013
  • A closed-form solution for a fluid-structure system is presented in this article. The closed-form is used to evaluate the finite element method results through a numeric example with consideration of high frequencies of excitation. In the example, the structure is modeled as a cantilever beam with rectangular cross-section including only shear deformation and the reservoir is assumed semi-infinite rectangular filled with compressible fluid. It is observed that finite element results deviate from the closed-form in relatively higher frequencies which is the case for the near field earthquakes.

Mathematical Thinking and Developing Mathematical Structure

  • Cheng, Chun Chor Litwin
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제14권1호
    • /
    • pp.33-50
    • /
    • 2010
  • The mathematical thinking which transforms important mathematical content and developed into mathematical structure is a vital process in building up mathematical ability as mathematical knowledge based on structure. Such process based on students' recognition of mathematical concept. Developing mathematical thinking into mathematical structure happens when different cognitive units are connected and compressed to form schema of solution, which could happen through some guided problems. The effort of arithmetic approach in problem solving did not necessarily provide students the structure schema of solution. The using of equation to solve the problem is based on the schema of building equation, and is not necessary recognizing the structure of the solution, as the recognition of structure may be lost in the process of simplification of algebraic expressions, leaving only the final numeric answer of the problem.

DNA 코딩방법과 GA 코딩방법의 패턴인식 성능 비교에 관한 연구 (Performance Comparison on Pattern Recognition Between DNA Coding Method and GA Coding Method)

  • 백동화;한승수
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
    • /
    • pp.383-386
    • /
    • 2002
  • In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.

광속전달법에서의 효율적인 Form Factor 계산방법에 관한 연구 (The Study on form Factor Computation Methods in the Luminous Flux Transfer Method)

  • 최안섭
    • 한국조명전기설비학회:학술대회논문집
    • /
    • 한국조명전기설비학회 2001년도 학술대회논문집
    • /
    • pp.17-22
    • /
    • 2001
  • This paper gave a review of form factor computations in the luminous flux transfer method and practical application of DiLaura's recently developed form factor computation. A systematic analysis of how the results of a contour integration solution differ from those of existing numeric solutions were undertaken with a developed computer simulation program. Various situations between sending and receiving surfaces were considered, including the facing, size, and distance between surfaces.

  • PDF

풀흐름라인에서 변동성전파원리에 대한 증명 : 존재와 측정 (Proof of the Variability Propagation Principle in a Pull Serial Line : Existence and Measurement)

  • 최상웅
    • 한국경영과학회지
    • /
    • 제27권4호
    • /
    • pp.185-205
    • /
    • 2002
  • In this study, we consider infinite supply of raw materials and backlogged demands as given two boundary conditions. And we need not make any specific assumptions about the inter-arrival of external demand and service time distributions. Under these situations, the ultimate objective of this study is to prove the variability propagation principle in a pull serial line and is to measure it in terms of the first two moments of the inter-departure process subject to number of cards in each cell. Two preparations are required to achieve this objective : The one is to derive a true lower bound of variance of the inter-departure process. The other is to establish a constrained discrete minimax problem for the no backorder (backlogging) probabilities in each cell. We may get some fundamental results necessary to a completion for the proof through the necessary and sufficient conditions for existence of optimal solution of a constrained discrete minimax problem and the implicit function theorem. finally, we propose a numeric model to measure the variability propagation principle. Numeric examples show the validity and applicability of our study.

PSO의 특징과 차원성에 관한 비교연구 (Comparative Study on Dimensionality and Characteristic of PSO)

  • 박병준;오성권;김용수;안태천
    • 제어로봇시스템학회논문지
    • /
    • 제12권4호
    • /
    • pp.328-338
    • /
    • 2006
  • A new evolutionary computation technique, called particle swarm optimization(PSO), has been proposed and introduced recently. PSO has been inspired by the social behavior of flocking organisms, such as swarms of birds and fish schools and PSO is an algorithm that follows a collaborative population-based search model. Each particle of swarm flies around in a multidimensional search space looking for the optimal solution. Then, Particles adjust their position according to their own and their neighboring-particles experience. In this paper, characteristics of PSO such as mentioned are reviewed and compared with GA which is based on the evolutionary mechanism in natural selection. Also dimensionalities of PSO and GA are compared throughout numeric experimental studies. The comparative studies demonstrate that PSO is characterized as simple in concept, easy to implement, and computationally efficient and can generate a high-quality solution and stable convergence characteristic than GA.

유전 알고리즘에 의해 생성된 퍼지 소속함수를 갖는 교통 신호 제어 (Traffic Signal Control with Fuzzy Membership Functions Generated by Genetic Algorithms)

  • 김종완;김병만;김주연
    • 한국지능시스템학회논문지
    • /
    • 제8권6호
    • /
    • pp.78-84
    • /
    • 1998
  • 본 논문에서는 유전 알고리즘을 사용하는 퍼지 교통 제어기를 제안한다. 일반적인 퍼지 교통 제어기들은 사람에 의해 생성된 소속함수들을 사용한다. 그러나 이 방식은 퍼지 제어기를 설계하는데 최적의 해를 보장하지 못한다. 유전 알고리즘은 휴리스틱적인 특정 영역의 지식을 필요로 하는 최적화 문제의 좋은 해결 방법이다. 좋은 성능을 보이는 퍼지 소속함수를 찾기 위해서 적합도 함수가 정의되어야 한다. 그러나 교통 제어에서 적합도 함수를 수치 표현으로 정의하는 것은 쉽지 않다. 따라서 본 논문에서는 교통 시뮬레이터에 의해 얻어지는 성능척도로써 해의 적합도를 결정하는 시뮬레이션 접근법을 사용한다. 제안된 방법은 기존의 퍼지 제어기들에 비하여 우수한 성능을 보여준다.

  • PDF