• Journal of applied mathematics & informatics
• /
• v.40 no.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.

• Journal of Korean Association for Spatial Structures
• /
• v.1 no.1 s.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
• /
• v.4 no.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.10a
• /
• 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.

• Journal of the Korean Geographical Society
• /
• v.46 no.3
• /
• pp.366-381
• /
• 2011

A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.

• Proceedings of the KIEE Conference
• /
• 1986.07a
• /
• 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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• 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.

• Honam Mathematical Journal
• /
• v.31 no.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
• /
• v.7 no.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.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.7
• /
• pp.647-654
• /
• 2007

A Discrete continuation Method/homotopy approaches are studied for energy/fuel optimal low thrust Earth escape trajectory by solving a two point boundary value problem(TPBVP). Recently, maneuvers using low thrust propulsion system have been identified as emerging technologies. The low thruster is considered as the main actuator for orbit maneuvers. The cost function consists of a energy/fuel consumption function, and constraints are position and velocity vectors at the terminal escape point. Solving the minimum energy/fuel problem directly is not an easy task, so we adopt the homotopy analysis. Using a solution of the minimum energy, which is solved by discrete continuation method, we obtain the solution of the minimum fuel problem.