• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1047-1052
• /
• 2004

An efficient boundary-based technique is developed for addressing shape design sensitivity analysis in supercavitating flow problem. An analytical sensitivity formula in the form of a boundary integral is derived based on the continuum formulation for a general functional defined in potential flow problems. The formula, which is expressed in terms of the boundary solutions and shape variation vectors, can be conveniently used for gradient computation in a variety of shape design in potential flow problems. While the sensitivity can be calculated independent of the analysis means, such as the finite element method (FEM) or the boundary element method (BEM), the FEM is used for the analysis in this study because of its popularity and easy-touse features. The advantage of using a boundary-based method is that the shape variation vectors are needed only on the boundary, not over the whole domain. The boundary shape variation vectors are conveniently computed by using finite perturbations of the shape geometry instead of complex analytical differentiation of the geometry functions. The supercavitating flow problem is chosen to illustrate the efficiency of the proposed methodology. Implementation issues for and optimization procedure are addressed in this flow problem.

• Journal of Korean Association for Spatial Structures
• /
• v.4 no.4 s.14
• /
• pp.91-98
• /
• 2004

Genetic algorithm is one of the best ways to solve a discrete variable optimization problem. This method is an unconstrained optimization technique, so the constraints are handled in an implicit manner. The most popular way of handling constraints is to transform the original constrained problem into an unconstrained problem, using the concept of penalty function. I present the 3 fitness functions which represent the reject strategy, the penalty strategy, and the combined strategy. I make the design program using the 3 fitness Auctions and it is applied to the design problem of a gable frame and a 2 story 3 span frame.

• Korean Journal of Cognitive Science
• /
• v.14 no.2
• /
• pp.15-25
• /
• 2003

The Monkey and Banana Problem is an example commonly used for illustrating simple problem solving. It can be solved by conventional approaches, but this requires a procedural aspect when inferences are processed, and this fact works as a limitation condition in solving complex problems. However, if we use DNA computing methods which are naturally able to realize massive parallel processing. the Monkey and Banana Problem can be solved effectively without weakening the fundamental aims above. In this paper, we design a method of representing the problem using DNA molecules, and show that various solutions are generated through computer-simulations based on the design. The simulation results are obviously interesting in that these are contrary to the fact that the Prolog program for the Monkey and Banana Problem, which was implemented from the conventional point of view, gives us only one optimal solution. That is, DNA computing overcomes the limitations of conventional approaches.

• Industrial Engineering and Management Systems
• /
• v.8 no.1
• /
• pp.22-28
• /
• 2009

We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.

• Korean Institute of Interior Design Journal
• /
• v.20 no.6
• /
• pp.321-330
• /
• 2011

The purpose of this study is to propose how the interior of the child psychiatric therapy Environment should be designed according to different problems that children have. For the purpose, this research has been conducted with a literature review and an empirical survey. The subjects of the survey were 100 children, 58 male and 42 female, who were using child psychiatric therapy centers located in Busan. Findings are as follows: (1) Children with behavior problem($C_b$) showed a significantly higher satistaction with the entrance and the information in a given child psychiatric therapy space than children with emotional problem ($C_e$) did. (2) Spatial attitude of $C_e$ and $C_b$ were significantly differed. (3) Colors that were being preferred by $C_e$ were cold colors, for example, blue and indigo. While, $C_b$ were preferring warm colors such as red and yellow. (4) There was difference in the image of a entrance and classrooms at the child psychiatric therapy center that children had in mind, the two groups of children were quite differently feeling about the size and noise of the therapy space.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2357-2375
• /
• 2013

Message ferry is a controllable mobile node with large capacity and rechargeable energy to collect information from the sensors to the sink in wireless sensor networks. In the existing works, route of the message ferry is often designed from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such solutions, the ferry route is often a simple cycle, which starts from the sink, access all the sensors exactly once and moves back to the sink. In this paper, we consider a different case, where the ferry route is a closed walk that contains more than one simple cycle. This problem is defined as the Closed Walk Ferry Route Design (CWFRD) problem in this paper, which is an optimization problem aiming to minimize the average weighted delay. The CWFRD problem is proved to be NP-hard, and the Integer Linear Programming (ILP) formulation is given. Furthermore, a heuristic scheme, namely the Initialization-Split-Optimization (ISO) scheme is proposed to construct closed walk routes for the ferry. The experimental results show that the ISO algorithm proposed in this paper can effectively reduce the average weighted delay compared to the existing simple cycle based scheme.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.173-181
• /
• 2016

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

• Journal of the Korean earth science society
• /
• v.40 no.4
• /
• pp.436-445
• /
• 2019

This study presents how two types of integrated science and engineering lessons affect students' engineering problem solving skills and their perceptions of engineering. In total, 146 middle school students participated in this study. Eighty-six students participated in the Type I lesson (complete engineering design lesson with a science knowledge application) and 60 students participated in the Type II lesson (engineering design without a science knowledge application). Two main datasets, (1) students' Creative Engineering Problem Solving Propensity (CEPSP) measurement scores and (2) open-ended survey questions about students' perceptions of engineering, were collected before and after the lessons. The results of this study show that after participating in the Type I lesson, students' CEPSP scores significantly increased, whereas the CEPSP scores of the students who participated in the Type II lesson did not increase significantly. In addition, students who participated in the Type I lesson perceived engineering and the engineering integrated science lesson differently compared to the students who participated in the Type II lesson. The results of this study show that engineering integrated science, technology, engineering & mathematics (STEM) lessons should include a complete engineering design and a science knowledge application to improve students' engineering problem solving skills.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.215-218
• /
• 2004

The pseudolites are ground-based transmitters that can be configured to emit GPS-like signals with the purpose of enhancing the GPS by providing increased accuracy, integrity, and availability. Although the use of the pseudolites offers many potentially significant benefits, a number of technical issues must also be addressed. One is the pseudolite signal power level which is related with near-far problem, and other issues include deployment requirements, signal data rate, signal integrity monitoring, and user antenna location and sensitivity. In order to solve the near-far problem, the frequency offset or the pulsing schemes is implemented in most the pseudolites. However, in the case of the previous pulsing scheme with the fixed code pattern, the near-far problem still remains. This paper aims to design a sequential pulsing scheme to avoid the near-far problem. A pulse mode pseudolite has less interference than the continuous mode.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.