• Journal of Mechanical Science and Technology
• /
• v.16 no.5
• /
• pp.619-632
• /
• 2002

In recent study on design of experiments, the complicate metamodeling has been studied because defining exact model using computer simulation is expensive and time consuming. Thus, some designers often use approximate models, which express the relation between some inputs and outputs. In this paper, we review and compare the complicate metamodels, which are expressed by the interaction of various data through trying many physical experiments and running a computer simulation. The prediction model in this paper employs interpolation schemes known as ordinary kriging developed in the fields of spatial statistics and kriging in Design and Analysis of Computer Experiments (DACE) model. We will focus on describing the definitions, the prediction functions and the algorithms of two kriging methods, and assess the error measures of those by using some validation methods.

• International journal of advanced smart convergence
• /
• v.1 no.2
• /
• pp.34-38
• /
• 2012

The recent increase in use of the IEEE 802.15.4 standard for wireless connectivity in personal area networks makes of it an important technology for low-cost low-power wireless personal area networks. Studies showed that voice communications over IEEE 802.15.4 networks is feasible by Guaranteed Time Slot (GTS) allocation; but there are some constraints to accommodate voice transmission beyond two hops due to the excessive transmission delay. In this paper, we propose a GTS allocation scheme for bidirectional voice traffic in IEEE 802.15.4 multihop networks with the goal of achieving fairness and optimization of resource allocation. The proposed scheme uses a greedy algorithm to allocate GTSs to devices for successful completion of voice transmission with efficient use of bandwidth while considering closest devices with another factor for starvation avoidance. We analyze and validate the proposed scheme in terms of fairness and resource optimization through numeral analysis.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.307-314
• /
• 2006

Missile system. which requires high speed/high maneuverability is getting more important as a defensive weapon system. Integrated design environment which includes all related resources during the missile development process, is a very useful development tool, Therefor the design framework can perform the operation analysis and utilize design information for the efficient missile design. For this purpose, various analysis computer codes under heterogeneous platforms and operating systems, the database, the optimization module, and Ideas a commercial CAD are integrated using distributed. middleware. and the complicated GUI design has been made for the specific missile system design. Under the various constraint, maximize missile range and loadfactor with missile design computer framework.

• Proceedings of the KIEE Conference
• /
• 2008.10c
• /
• pp.62-64
• /
• 2008

본 논문에서는 기존의 Particle Swarm Optimization (PSO) 알고리즘에 반발 속도 (Repulsion Velocity) 개념을 도입한 개선된 PSO 알고리즘을 제안하였다. 낮은 적합도를 가지는 지역을 멀리하는 성질을 모사한 것이 반발 속도의 개념이다. 반발 속도의 개념을 도입한 제안된 알고리즘은 기존의 알고리즘에 비해서, 더 좋은 수렴 특성을 가지고, 더 빠른 계산 특성을 가짐을 알 수 있었다. 시험 함수를 통해서 제안된 알고리즘의 검증을 수행하였고, 외전형 영구자석형 전동기의 최적화에 적용하여서 그 결과를 나타내었다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.1
• /
• pp.36-43
• /
• 2016

The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.37 no.6
• /
• pp.539-544
• /
• 2013

This study provides a solution method for the inverse heat conduction problem based on a combination of a public domain CAE (computer aided engineering) software and a commercial CAO (computer aided optimization) software. The solver system has been implemented without any in-house coding. The proposed method is simple to implement. Moreover, it can be easily reproduced.

• 전기의세계
• /
• v.24 no.5
• /
• pp.107-110
• /
• 1975

This paper describes computational algorithms and a computer program for optimum determinations of wire conductor sizes of radial or tree-type distibution lones with given constraints. Here, The objective function is defined as the total summation of the volume or weight of respective conductor materials required for buildingup the entire distributing system. Four categories of constraints are applied to the obiective function. That is, on the respective load points constraint is imposed by a specified voltage drop limit, and the respective line elements are capable of carrying the current safely(safety current) and also must maintain the minimum thickness in viewpoint of mechanical strength and legal requirements. And finally, the conductor sizes have to be selected among the standardized size levels of the products. These kinds of optimization problems cannot be solved by the ordinary optimization tediniques such as the Linear Programming Method, SUMT Technique, etc. This paper, therefore, successfully devised the powerful alorithms to solve the problem, using the particular properties or characteristics ingerent to the radial or tree-type distribution system. The computer program developed from the algorithms was applied to several sample systems and shown to be exact and very efficient.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.285-288
• /
• 2017

기존의 임베디드 시스템의 경우 busybox를 이용하여 리눅스를 빌드하여 사용한다. 하지만 busybox에서 제공하는 기본 명령어만 사용할 수 있기 때문에 시스템 개발에 제한이 많다. 그러나 이와 달리 데비안이나 레드햇, 슬랙웨어 등의 리눅스 배포판은 다양한 명령어를 통해 시스템 개발의 자유를 보장할 수 있다. 그렇지만 busybox보다 운영체제의 크기가 크고 부팅속도도 느려 임베디드 시스템에 사용하기에 적합하지 않다. 이러한 문제를 해결하기 위해 본 논문에서는 리눅스 배포판을 최적화하여 기존 리눅스 배포판보다 크기가 작고 부팅속도가 빠른 최적화된 리눅스 배포판을 제안한다. 구현 및 성능 분석 결과 최적화된 리눅스 배포판은 기존의 리눅스 배포판보다 용량이 85.87% 줄었고, 기존 부팅 속도의 20%로 부팅 속도 또한 증가되었다.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.298-309
• /
• 2004

In this paper, a new evolutionary scheme to design a TSK fuzzy model from relevant data is proposed. The identification of the antecedent rule parameters is performed via the evolutionary algorithm with the unique fitness function and the various evolutionary operators, while the identification of the consequent parameters is done using the least square method. The occurrence of the multiple overlapping membership functions, which is a typical feature of unconstrained optimization, is resolved with the help of the proposed fitness function. The proposed algorithm can generate a fuzzy model with transparent membership functions. Through simulations on various problems, the proposed algorithm found a TSK fuzzy model with better accuracy than those found in previous works with transparent partition of input space.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.293-303
• /
• 2012

Sequential quadratic programming (SQP) has been one of the most important methods for solving nonlinear constrained optimization problems. Recently, filter method, proposed by Fletcher and Leyffer, has been extensively applied for its promising numerical results. In this paper, we present and study an active set SQP-filter algorithm for inequality constrained optimization. The active set technique reduces the size of quadratic programming (QP) subproblem. While by the filter method, there is no penalty parameter estimate. Moreover, Maratos effect can be overcome by filter technique. Global convergence property of the proposed algorithm are established under suitable conditions. Some numerical results are reported in this paper.