• Journal of applied mathematics & informatics
• /
• 제40권5_6호
• /
• pp.949-958
• /
• 2022

The aim of this papaer is to prove the discrete compactness property for modified Raviart-Thomas element(MRT) of lowest order on quadrilateral meshes. Then MRT space can be used for eigenvalue problems, and is more efficient than the lowest order ABF space since it has less degrees of freedom.

• 한국공간구조학회논문집
• /
• 제1권1호
• /
• pp.125-134
• /
• 2001

The objective of this study is the development of size discrete optimum design algorithm which is based on the GAs(genetic algorithms). The algorithm can perform size discrete optimum designs of space trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of space trusses and the constraints are limite state design codes(1998) and displacements. The basic search method for the optimum design is the GAs. The algorithm is known to be very efficient for the discrete optimization. This study solves the problem by introducing the GAs. The GAs consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. In the genetic process of the simple GAs, there are three basic operators: reproduction, cross-over, and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying GAs to optimum design examples.

• Architectural research
• /
• 제4권1호
• /
• pp.33-38
• /
• 2002

The objective of this study is the development of discrete optimum design algorithms which is based on the genetic algorithms. The developed algorithms was implemented in a computer program. For the optimum design, the objective function is the weight of space trusses structures and the constraints are stresses and displacements. This study solves the problem by introducing the genetic algorithms. The genetic algorithms consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed discrete optimum design algorithms was verified by applying the algorithms to optimum design examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.542-547
• /
• 2003

A new approach to design of a discrete-time robust $H_{\infty}$ filter in finite horizon case is proposed. It is shown that robust $H_{\infty}$ filtering problem can be cast into the minimization problem of an indefinite quadratic form, which can be solved by implementing the Kalman filter defined in Krein space. The proposed filter is readily derived by simply augmenting the state space model and has the robustness property against the parameter uncertainties of a given system.

• 대한지리학회지
• /
• 제46권3호
• /
• pp.366-381
• /
• 2011

일반적으로 이산적 입지 공간에서 경쟁적 입지 문제는 입지 후보지에 따라 수많은 조합의 경우가 발생하는 의사결정 문제이기 때문에, 수리적으로 계산하기가 쉽지 않다. 따라서 본 연구에서는 결정적 배분 형태를 가정한 이산적 입지 공간의 경쟁적 입지 문제를 보다 효율적으로 해결하기 위한 대안적 방법에 대해 논의한다. 제안된 방법론의 핵심은 입지 문제의 크기와 관련되는 잠재적 입지후보지의 개수를 기하학적 개념을 이용하여 줄이는 것이다. 사례 분석으로 경쟁이 가열화되고 있는 초고속 인터넷 시장을 대상으로 제안된 방법론을 적용하였는데 두 가지 다른 크기의 문제, 즉 연구 지역 전체에 대해 정의된 잠재적 입지 후보지와 GIS 기반의 기하학적 알고리즘에 의해 추출된 보다 적은 수의 잠재적 입지 후보지에 대해 계산 결과와 공간적 배열을 비교하였다. 사례 분석 결과, 두 문제 모두 고객 유치를 최대화시키는 동일한 최적 입지를 보여주는 한편, 적은 수의 잠재적 입지 후보지를 가진 경쟁적 입지 모델이 보다 효율적으로 해결될 수 있었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1986년도 하계학술대회논문집
• /
• pp.140-144
• /
• 1986

In this paper an FIR(finite impulse response) filter and smoother are introduced for discrete time-invariant state-space models with driving noises. The FIR structure not only quarantees the BIBO stability and the robustness to parameter changes but also improves the filter divergence problem. It is shown that the impulse responses of the FIR filter and the smoother are obtained by Riccati-type difference equations and that they are to be time-invariant and reduced to very simple forms. For implementational purpose, recursive forms of the FIR filler and smoother are derived with each other used as the adjoint variable.

• 대한기계학회논문집A
• /
• 제24권8호
• /
• pp.1940-1948
• /
• 2000

A design method for maximizing fatigue life of the deep groove ball bearing without enlarging mounting space is proposed by using a genetic algorithm. The use of gradient-based optimization methods for the design of the bearing is restricted because this design problem is characterized by the presence of discrete design variables such as the number of balls and standard ball diameter. Therefore, the design problem of rolling element bearings is a constrained discrete optimization problem. A genetic algorithm using real coding is used to efficiently find the optimum discrete design values. To effectively deal with the design constraints, a ranking method is suggested for constructing a fitness function in the genetic algorithm. Constrains for manufacturing are applied in optimization scheme. Results obtained for several 63 series deep groove ball bearings demonstrated the effectiveness of the proposed design methodology by showing that the average basic dynamic capacities of optimally designed bearings increased about 9-34% compared with the standard ones.

• 호남수학학술지
• /
• 제31권3호
• /
• pp.279-292
• /
• 2009

As a survey-type article, the paper reviews some results on a regular covering space in digital covering theory. The recent paper [10](see also [12]) established the notion of regular covering space in digital covering theory and studied its various properties. Besides, the papers [14, 16] developed a discrete Deck's transformation group of a digital covering. In this paper we study further their properties. By using these properties, we can classify digital covering spaces. Finally, the paper proposes an open problem.

• Journal of Ship and Ocean Technology
• /
• 제7권3호
• /
• pp.34-55
• /
• 2003

Explicit Kutta condition approximation, proved useful in existing time-domain solver of the unsteady propeller problem, requires a specified functional behavior of the vorticity in space near the trailing edge. In this paper, the strength of the discrete vortices is controlled to have a specified behavior in space in the frequency domain approach. A new formulation is introduced and is implemented for analysis of a lifting surface of a rectangular planform. Sample computations carried out according to the new formulation compares well with that of existing unsteady lifting problem in the time domain.

• 한국항공우주학회지
• /
• 제35권7호
• /
• pp.647-654
• /
• 2007

본 논문에서는 일정한 추력을 이용한 지구-달의 연료 최적 궤적해를 이용하여, 가변 추력기를 이용한 지구 탈출 궤적에서의 에너지 및 연료 최적 궤적을 설계하였다. 에너지 최적의 지구 탈출 궤적은 여러 차례 지구를 공전하게 되고, 궤도 천이 시간이 일반적인 궤도 천이 시간 보다 상대적으로 오래 소요되므로 최적화 문제를 해를 구하기가 쉽지 않다. 따라서 에너지 최적 해를 구하기 위하여, 초기 상태변수를 조정하면서 Discrete continuation의 기법을 적용하였다. 최적화 문제의 종말 조건은 일정한 추력기를 이용한 지구 탈출 궤적의 종말 조건을 이용하였고, 구속 시간은 일정한 추력기를 이용한 궤도 천이의 경우보다 큰 값으로 설정하였다. 한편, 연료 최적 궤적은 제어 입력의 형태가 불연속적이기 때문에 해를 구하기가 쉽지 않다. 따라서 연료 최적 궤적은 에너지 최적의 해와 호모토피(Homotopy) 기법을 적용시켜 그 해를 구하였다.