• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.9
• /
• pp.1399-1407
• /
• 2004

Structural optimization has been carried out in continuous design space or in discrete design space. Generally, available designs are discrete in design practice. However, the methods for discrete variables are extremely expensive in computational cost. An iterative optimization algorithm is proposed for design in a discrete space, which is called a sequential algorithm using orthogonal arrays (SOA). We demonstrate verifying the fact that a local optimum solution can be obtained from the process with this algorithm. The local optimum solution is defined in a discrete design space. Then the search space, which is a set of candidate values of each design variables formed by the neighborhood of a current design point, is defined. It is verified that a local optimum solution can be found by sequentially moving the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained by using the SOA algorithm

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1005-1010
• /
• 2004

The structural optimization has been carried out in the continuous design space or in the discrete design space. Generally, available designs are discrete in design practice. But methods for discrete variables are extremely expensive in computational cost. In order to overcome this weakness, an iterative optimization algorithm was proposed for design in the discrete space, which is called as a sequential algorithm using orthogonal arrays (SOA). We focus to verify the fact that the local solution can be obtained throughout the optimization with this algorithm. The local solution is defined in discrete design space. Then the search space, which is the set of candidate values of each design variables formed by the neighborhood of current design point, is defined. It is verified that a local solution can be founded by moving sequentially the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained using the SOA algorithm

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.408-413
• /
• 2001

The structural optimization is carried out in the continuous design space or discrete design space. Methods for discrete variables such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions for constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

• Journal of Korea Multimedia Society
• /
• v.20 no.7
• /
• pp.1090-1101
• /
• 2017

This study analyzes spatial density and integration of Space Syntax and Discrete Event Simulation (DEVS) of complex system theory and analyzes spatial structure by property, type and depth. The aim of this study is to secure the validity of the theoretical application. The study evaluated the correlation between spatial density and integration by setting up eight types of analysis models. In addition, analyzed the correlation of structural characteristics and approached the application of discrete event simulation of spatial syntax theory. It is confirmed that the concept of integration of spatial syntax theory and analysis using discrete event simulation are valid as new spatial analysis methodology. Also expect that realistic and concrete predictions will be possible if discrete event simulation evolves into research for space allocation and space efficiency optimization.

• Honam Mathematical Journal
• /
• v.37 no.4
• /
• pp.487-504
• /
• 2015

For a smooth plane curve, the curvature can be characterized by the rate of change of the angle between the tangent vector and a fixed vector. In this article we prove that the curvature of a space curve can also be given by the rate of change of the locally defined angle between the tangent vector at a point and the nearby point. By using height functions, we introduce turning angle of a space curve and characterize the curvature by the rate of change of the turning angle. The main advantage of the turning angle is that it can be used to characterize the curvature of discrete curves. For this purpose, we introduce a discrete turning angle and a discrete curvature called visual curvature for space curves. We can show that the visual curvature is an approximation of curvature for smooth curves.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.10
• /
• pp.1621-1626
• /
• 2001

The structural optimization have been carried out in the continuous design space or in the discrete design space. Methods fur discrete variables such as genetic algorithms , are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete des inn space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions leer constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

• The Mathematical Education
• /
• v.59 no.1
• /
• pp.47-62
• /
• 2020

Understanding the concept of probability distribution becomes more important. We considered probabilities defined in the sample space, the definition of discrete random variables, the probability of defined discrete probability distribution, and the relationship between them as knowledge of discrete probability distribution, and investigated the understanding degree of the mathematics preservice teachers. The results are as follows. Firstly, about 70% of preservice teachers who participated in this study expressed discrete probability distribution graphs in ordered pairs or continuous distribution. Secondly, with regard to the two factors for obtaining discrete probability distributions: probability for each element in the sample space and the concept of random variables that convert each element in the sample space into a real value, only 13% of the preservice teachers understood and addressed both factors. Thirdly, 39% of the preservice teachers correctly responded to whether different probability distributions can be defined for one sample space. Fourthly, when the probability of each fundamental event was determined to obtain the probability distribution of the discrete random variables defined in the undefined sample space, approximately 70% habitually calculated by the uniform probability. Finally, about 20% of preservice teachers understood the meaning and relationship of binomial distribution, discrete random variables, and sample space. In relation, clear definitions and full explanations of concept need to be provided from textbooks and a program to improve the understanding of preservice teachers need to be developed.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.3
• /
• pp.407-414
• /
• 1996

In this paper we consider the variable structure control for a class of discrete-time uncertain multivariable systems where the nominal system is linear. Discrete-time switching dynamics are introduced so that a new type of state trajectories called sliding mode may exist on the sliding surface by state feedback. The quantitative analysis for the matched uncertainties will show that every response of the system with the proposed switching dynamics is bounded within small neighborhoods of the state-space origin. Also, by the similarity transformation it will be shown that the eigenvalues of the closed-loop systems are composed of those of the subsystems which govern the range-space dynamics and null-space dynamics. It will be also shown that ideal sliding mode can be obtained in the absence of uncertainties due to one-step attraction to the sliding surface regardless of initial position of states. (author). 12 refs., 2 figs.

• 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.