• International Journal of Precision Engineering and Manufacturing
• /
• v.3 no.2
• /
• pp.15-21
• /
• 2002

A control-structure combined optimal design problem is discussed taking a 3-D truss structure as a design object. We use descriptor forms for a controlled object and a generalized plant because the structural parameters appear naturally in these farms. We consider not only minimum weight design problem for structure system, but also suppression problem of the effect of disturbances for control system as the purpose of the design. A numerical example shows the validity of combined optimal design of structure and control systems. We also consider the validity of sensor-actuator collocation for control system design in this paper.

• Research in Mathematical Education
• /
• v.14 no.1
• /
• pp.33-50
• /
• 2010

The mathematical thinking which transforms important mathematical content and developed into mathematical structure is a vital process in building up mathematical ability as mathematical knowledge based on structure. Such process based on students' recognition of mathematical concept. Developing mathematical thinking into mathematical structure happens when different cognitive units are connected and compressed to form schema of solution, which could happen through some guided problems. The effort of arithmetic approach in problem solving did not necessarily provide students the structure schema of solution. The using of equation to solve the problem is based on the schema of building equation, and is not necessary recognizing the structure of the solution, as the recognition of structure may be lost in the process of simplification of algebraic expressions, leaving only the final numeric answer of the problem.

• Journal of Power System Engineering
• /
• v.8 no.1
• /
• pp.69-74
• /
• 2004

A structure-control combined optimal design problem is discussed taking a 3-D truss structure as a design object. We use descriptor forms for a controlled object and a generalized plant because the structural parameters appear naturally in these forms. We consider not only minimum weight design problem for structure system, but also suppression problem of the effect of disturbances for control system as the purpose of the design. A numerical example shows the validity of combined optimal design of structure and control systems. We also consider the validity of sensor-actuator collocation for control system design in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.3
• /
• pp.218-222
• /
• 2011

This paper proposes a single-joint optical torque sensor with one body structure. Conventional optical torque sensors consist of three parts, two plates and an elastic structure. They have slightly slipping problem between plates and elastic structure due to the manufacturing tolerance. Since the order of measurement range of optical sensor is about ten micrometers, the slipping problem causes large measurement error, especially in the case of vibrational or high speed plant. This problem does not occur in the proposed design due to the one body structure. The proposed sensor has advantage of low cost, light weight, and small size. And it is easy to design and manufacture. Simulation works that analysis of stress and strain are performed accurately. To demonstrate the performance of proposed sensor, experiments were implemented to compare with a commercial force/torque sensor (ATI Mini45).

• Steel and Composite Structures
• /
• v.26 no.2
• /
• pp.163-170
• /
• 2018

The purpose of this paper is to present a new and efficient optimization algorithm called Jaya for optimum design of steel grillage structure. Constrained size optimization of this type of structure based on the LRFD-AISC is carried out with integer design variables by using cross-sectional area of W-shapes. The objective function of the problem is to find minimum weight of the grillage structure. The maximum stress ratio and the maximum displacement in the inner point of steel grillage structure are taken as the constraint for this optimization problem. To calculate the moment and shear force of the each member and calculate the joint displacement, the finite elements analysis is used. The developed computer program for the analysis and design of grillage structure and the optimization algorithm for Jaya are coded in MATLAB. The results obtained from this study are compared with the previous works for grillage structure. The results show that the Jaya algorithm presented in this study can be effectively used in the optimal design of grillage structures.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.3
• /
• pp.109-121
• /
• 2004

This paper presents an optimal design method for structure-borne durability of a vehicle body structure. Structure-borne durability design requires a new design that can increase fatigue lives of critical areas in a structure and must prohibit transition phenomenon of critical areas that results from modification of the structure at the same time. Therefore, the optimization problem fur structure-borne durability design are consists of an objective function and design constraints of 2 types; type 1-constraint that increases fatigue lives of the critical areas to the required design limits and type 2-constraint that prohibits transition phenomenon of critical areas. The durability design problem is generally dynamic because a designer must consider the dynamic behavior such as fatigue analyses according to the structure modification during the optimal design process. This design scheme, however, requires such high computational cost that the design method cannot be applicable. For the purpose of efficiency of the durability design, we presents a method which carry out the equivalent static design problem instead of the dynamic one. In the proposed method, dynamic design constraints for fatigue life, are replaced to the equivalent static design constraints for stress/strain coefficients. The equivalent static design constraints are computed from static or eigen-value analyses. We carry out an optimal design for structure-borne durability of the newly developed bus and verify the effectiveness of the proposed method by examination of the result.

• Communications of Mathematical Education
• /
• v.32 no.1
• /
• pp.37-57
• /
• 2018

In the early days, the use of concept maps in mathematics education focused on how to represent mathematical ideas in the concept map. In recent years, however, concept maps have proved beneficial for improving problem solving ability. Conceptual diagrams can be used for collaboration among students, tools for exploring problems, tools for introducing problem structures, tools for developing and systematizing knowledge systems. In this study, we focused on the structure analysis of mathematical problems using Concept Map based on the analysis of previous research. In addition, we have devised a method of using concept maps for problem analysis and a method of analysis of systematic mathematical problem structure. The method developed in this study was found to have significant value by applying to the university scholastic ability test.

• Cartoon and Animation Studies
• /
• s.50
• /
• pp.187-214
• /
• 2018

The problem-based storytelling of the three-act structure, which sees the plot of the story as a solution to the problem of the character, has been the guide of creation to the creator of popular stories since Aristotle. Also problem-based storytelling has served as a schema that provides dramatic catharsis to the audience of the story, and one of the dramatic catharsis It has been working as a schema. This problem - based storytelling has been used as a structure for story production programs that have been developed since the 1980s. However, this story authoring program is focused only on the external problem of the story, but it has the limitation of producing the story that can not solve the internal problem of the character and provide the catharsis. This paper analyze the plot structure of 'StoryHelper', which is a domestic story authoring program, and the ending of 900 films, both domestic and foreign, which are database in 'StoryHelper'. 'StoryHelper' presents a problem-based plot structure that can consider not only external problems but also internal problems by applying causality and mythical episodes. The structure of these plots is based on the parameters of external problem solving, unresolved internal problem solving, and unresolved variables maturity plot(542films), disillusion plot(111films), education plot(132films), tragedy plot(205films). The results of this analysis are expected to provide a meaningful structure for plot-based creative and creative program development.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.145-151
• /
• 2004

We present an efficient data structure to obtain the range minima in an away in constant time. Recently, suffix ways are extensively used to search DNA sequences fast in bioinformatics. In constructing suffix arrays, solving the range minima problem is necessary When we construct suffix arrays, we should solve the range minima problem not only in a time-efficient way but also in a space-efficient way. The reason is that DNA sequences consist of millions or billions of bases. Until now, the most efficient data structure to find the range minima in an way in constant time is based on the method that converts the range minima problem in an array into the LCA (Lowest Common Ancestor) problem in a Cartesian tree and then converts the LCA problem into the range minima problem in a specific array. This data structure occupies O( n) space and is constructed in O(n) time. However since this data structure includes intermediate data structures required to convert the range minima problem in an array into other problems, it requires large space (=13n) and much time. Our data structure is based on the method that directly solves the range minima problem. Thus, our data structure requires small space (=5n) and less time in practice. As a matter of course, our data structure requires O(n) time and space theoretically.