• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.413-414
• /
• 2008

Abstract should be in English. The leaning angle optimization of turbine blade using the genetic algorithm was conducted in this paper. The calculation CFD technique was based upon the Diagonalized Alternating Directional Implicit scheme(DADI) with algebraic turbulencemodeling. The leaning angle of VKI turbine blade was represented using B-spline curve. The control points are the design variable. Genetic algorithm was taken into account as an optimization tool. The objective was to minimize the total pressure loss. The optimized final geometry shows the better aerodynamic performance compared with the initial turbine blade.

• Journal of the Korean Society for Railway
• /
• v.6 no.4
• /
• pp.294-299
• /
• 2003

Using a conventional railway, a tilting train was applied as a means of improving vehicle speed during curve negotiation without any modification of infrastructure. As a study for the optimum design of the tilting mechanism of a tilting vehicle, the kinematics sensitivity of the tilting mechanism was analyzed. Using the geometric relationship of the linkage-type tilting mechanism, the relationship of the parameters and the performance index was defined using nonlinear algebraic equations. With the defined relation, the effect of change in the parameters on the performance was analyzed. The analysis result can be used in the optimum design of a tilting mechanism that considers the track environment, vehicle and operational condition in which the tilting vehicle is applied.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.3
• /
• pp.305-320
• /
• 2020

This study aims to generalize MINRES-N2 method [1]. It means that we tend to obtain an algorithm to transfer each normal matrix - that its eigenvalues belong to an algebraic curve of low degree k- to its condensed form through using a unitary similarity transformation. Then, we aim to obtain a method to solve a system of linear equations that its coefficient matrix is equal to such a matrix by utilizing it. Finally this method is compared to the well-known GMRES method through using numerical examples. The results obtained through examples show that the given method is more efficient than GMRES.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.686-689
• /
• 2008

The leaning angle optimization of turbine blade using the genetic algorithm was conducted in this paper. The calculation CFD technique was based upon the Diagonalized Alternating Directional Implicit scheme(DADI) with algebraic turbulence modeling. The leaning angle of VKI turbine blade was represented using B-spline curve. The control points are the design variable. Genetic algorithm was taken into account as an optimization tool. The objective was to minimize the total pressure loss. The optimized final geometry shows the better aerodynamic performance compared with the initial turbine blade.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.27 no.1
• /
• pp.75-82
• /
• 1991

The present paper describes a preliminary design method by using the computer graphics for creation of the fore and after body profiles of fishing vessel. It is well known that the Form Parameter design method has some merits at an early stage of design, and the B-spline curve generation technique has some prior properties in representing hull form with the computer graphic. The B-spline curve generation technique combined with the form parameter design method is employed to generate the profiles of fishing vessel. For fore body the stem profiles with bulbous bulb or without one are considered. And for after body the stern profiles of cruiser type and the transom type are generated with stern bulb or with shoe piece. Several examples will shown.

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.695-706
• /
• 2014

Various properties of digital covering spaces have been substantially used in studying digital homotopic properties of digital images. In particular, these are so related to the study of a digital fundamental group, a classification of digital images, an automorphism group of a digital covering space and so forth. The goal of the present paper, as a survey article, to speak out utility of digital covering theory. Besides, the present paper recalls that the papers [1, 4, 30] took their own approaches into the study of a digital fundamental group. For instance, they consider the digital fundamental group of the special digital image (X, 4), where X := $SC^{2,8}_4$ which is a simple closed 4-curve with eight elements in $Z^2$, as a group which is isomorphic to an infinite cyclic group such as (Z, +). In spite of this approach, they could not propose any digital topological tools to get the result. Namely, the papers [4, 30] consider a simple closed 4 or 8-curve to be a kind of simple closed curve from the viewpoint of a Hausdorff topological structure, i.e. a continuous analogue induced by an algebraic topological approach. However, in digital topology we need to develop a digital topological tool to calculate a digital fundamental group of a given digital space. Finally, the paper [9] firstly developed the notion of a digital covering space and further, the advanced and simplified version was proposed in [21]. Thus the present paper refers the history and the process of calculating a digital fundamental group by using various tools and some utilities of digital covering spaces. Furthermore, we deal with some parts of the preprint [11] which were not published in a journal (see Theorems 4.3 and 4.4). Finally, the paper suggests an efficient process of the calculation of digital fundamental groups of digital images.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.555-561
• /
• 2009

In lieu of section profile data, a fitting of the bored tunnel shape is more significant confirmation for maintenance of a tunnel. Before the permit on the completion of a tunnel, deformation of the completed tunnel with respect to the design model are considered. And deformation can be produced at continuously along the entire of the tunnel section. This study firstly includes an analysis of algebraic approach and test it with an observed field data. And then a number of methods, line search method, genetic algorithm, and pattern search methods, are compared with the 3D tunnel shape fitting. Algebraic methods can solve a simple circular cylinder type as like a railway tunnel. However, a more complex model (compound circular curve and non circular) as like a highway tunnel has to be solved with soft computing tools in the cause of conditional constraints. The genetic algorithm and pattern search methods are computationally more intensive, but they are more flexible at a complex condition. The line search method is fastest, but it needs a narrow bounds of the initial values.

• Journal of Mechanical Science and Technology
• /
• v.18 no.1
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• Advances in Energy Research
• /
• v.7 no.2
• /
• pp.85-100
• /
• 2020

Distributed energy resources (DERs) are essential for coping with growing multiple energy demands. A microgrid (MG) is a small-scale version of the power system which makes possible the integration of DERs as well as achieving maximum demand-side management utilization. Hence, this study focuses on the analysis of optimal power dispatch considering economic aspects in a multi-carrier microgrid (MCMG) with price-responsive loads. This paper proposes a novel time-based demand-side management in order to reshape the load curve, as well as preventing the excessive use of energy in peak hours. In conventional studies, energy consumption is optimized from the perspective of each infrastructure user without considering the interactions. Here, the interaction of energy system infrastructures is considered in the presence of energy storage systems (ESSs), small-scale energy resources (SSERs), and responsive loads. Simulations are performed using GAMS (General Algebraic modeling system) to model MCMG, which are connected to the electricity, natural gas, and district heat networks for supplying multiple energy demands. Results show that the simultaneous operation of various energy carriers, as well as utilization of price-responsive loads, lead to better MCMG performance and decrease operating costs for smart distribution grids. This model is examined on a typical MCMG, and the effectiveness of the proposed model is proven.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.426-435
• /
• 2005

this paper, we made out blocking probability analysis for a new authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Besides, we proposed advanced handover method and blocking probability analysis for wireless PKI. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate, queue service rate, queue size