• Title/Summary/Keyword: solution design

Search Result 4,812, Processing Time 0.072 seconds

Local Solution of a Sequential Algorithm Using Orthogonal Arrays in a Discrete Design Space (이산설계공간에서 직교배열표를 이용한 순차적 알고리듬의 국부해)

  • Yi, Jeong-Wook;Park, Gyung-Jin
    • 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

Local Solution of Sequential Algorithm Using Orthogonal Arrays in Discrete Design Space (이산설계공간에서 직교배열표를 이용한 순차적 알고리듬의 국부해)

  • Yi, Jeong-Wook;Park, Gyung-Jin
    • 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

  • PDF

Global Optimization Using a Sequential Algorithm with Orthogonal Arrays in Discrete Space (이산공간에서 순차적 알고리듬(SOA)을 이용한 전역최적화)

  • Cho, Bum-Sang;Lee, Jeong-Wook;Park, Gyung-Jin
    • Proceedings of the KSME Conference
    • /
    • 2004.11a
    • /
    • pp.858-863
    • /
    • 2004
  • In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.

  • PDF

Optimization of DL-EPR Test Solution for Duplex Stainless Steel S31083 Using Taguchi Design (다구찌 설계를 이용한 듀플렉스 스테인리스강 S31083용 DL-EPR 시험용액의 최적화)

  • Jung, Kwang-Hu;Kim, Seong-Jong
    • Corrosion Science and Technology
    • /
    • v.20 no.2
    • /
    • pp.77-84
    • /
    • 2021
  • This study aims to optimize the DL-EPR test solution for duplex stainless steel S31083 using the Taguchi design. The test solution parameters applied to the Taguchi design are H2SO4, NaCl, KSCN concentration, and temperature. In the experimental design, an orthogonal array of 4 levels 4 factor L16(44) was used. Output values for the orthogonal array were used for resolution (degree of sensitization) and selective etch (Ia) values. The optimal test solution conditions were selected by comparing the normalized S/N ratio for the two reaction properties. As a result, the H2SO4 and NaCl were identified as the main factors influencing the sensitivity measurement, but the delta statistics showed that the KSCN concentration and temperature had relatively low influence. The optimal condition was identified as 1.5 M H2SO4+0.03 M KSCN+1.5M NaCl at 30 ℃. The degree of sensitization presented a tendency to depend on the heat treatment temperature and time in the optimal test solution. This investigation confirmed the possibility of optimizing the experiment solution for the DL-EPR test of stainless steel using the Taguchi technique.

A Study on the Optimum Design Using FEM and ADS (FEM과 ADS를 이용한 최적설계에 관한 연구)

  • Kim, M.J.;Lee, S.S.;Park, J.H.;Kim, S.M.;Jeon, E.C.
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.146-151
    • /
    • 2001
  • This study is an investigation for the ADS optimum design by using FEM. We write out program which express ADS perfectly and reduce the required time for correcting of model to the minimum in solution and manufacture result. We complete algorithm which can plan optimum forming of model by feedback error information in CAE. For that, we draw up ADS program which modeling rachet wheel by using visual LISP and telegraph to ANSYS, structural solution program, we can solve stress solution. Then we correct model by feedback date obtaining in solution process, repeat course following stress solution again and do modeling rachet wheel for optimum forming. That is our aim. As a result of experience, we can develope automatic design program using Visual LISP and exhibit ADS as modeling third dimension CAD for optimum design. Also, we develop optimum design algorithm using ADS and FEM. In rachet wheel, greatest equivalence stress originates in key groove comer and KS standard is proved the design for security.

  • PDF

A Design and Implementation of a Solution for Real Detection of Information Leakage by Keylogging Attack (키로깅을 통한 정보유출 실시간 탐지 솔루션 설계 및 구현)

  • Choi, In Young;Choi, Ji Hun;Lee, Won Yeoul
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.10
    • /
    • pp.1198-1204
    • /
    • 2014
  • Most of vaccine type security solutions detect intrusion of computer virus or malicious code. However, they almost don't have functionalities of the information leakage detection. In particular, information leakage through keylogging attact cannot be detected. In this paper, we design and implement a solution to detect the leakage of information through keylogging attact. Proposed solution detects the user-specified information in real time. To detect the leakage of user-specified information, the solution extracts the payload field from each outbound packet and compares with user-specified information. We design the solution to reduce the effect on the packet transmission delay time due to packet monitoring operation. And we design a simple user interface. By proposed solution, user can response to intrusion or information leakage immediately because he or she can perceives a leakage of information in real time.

Environment Design Process Based on Systems Approach (체계적 접근방법에 의한 환경설계과정에 대한 고찰)

  • 이재익
    • Archives of design research
    • /
    • v.2 no.1
    • /
    • pp.99-106
    • /
    • 1989
  • Environmental designers face a wide range of problems to be solved in their day-to-day works. The scale and number of problems and so enormous that designers should be a way out to meet these complex situation. Lately, environmental design process based on systems a.pproach is chosen for design methodology. It is a very complicated procedure with many alternatives. It is a evolutionary process that establishes the solution of a series of problems. This study attempt to tell the designer how to find design solution to problems and how to organize form as solution problems. The model of this design process is largely composed of three phases; Phase I : Problem definition and existing system analysis. Phase II : design goals and objectives, design criteria Phase III : creative process of design form.

  • PDF

Process of Thinking on the Form in Product Design (제품디자인의 형용사고과정)

  • 조종호
    • Archives of design research
    • /
    • v.4 no.1
    • /
    • pp.31-37
    • /
    • 1991
  • Process of thinking on the form in product design includes the process in which unclear requirements are transformed into defined concepts, and the process in which the design as a form conforming to the concepts in conc1uded.(The former is called fconceptualizationJ which deals with abstract matters, and the latter "manipulation of the formJ which deals with more embodied matters) In conceptualization process the operation which transform the diverse requirements in the initial phase of de\ulcornersign to related linguistic expressions or to an image that directly suggests the form is executed. In the process of manipulation of the form the transformation to design as the description of relationships between the formal elements of the design solution resulted from the transformed requirements. It is the job of selecting the most suitable formal elements, balancing the relationships between them, out 01 the possibilities that reside in the individual attributes of formal elements, and finally leading to the design as the end solution. This writing focuses down to the wilfulness and ambiguity of design, and the diversity of design solution after the requirements, formal elements, and the process of relating the formal attributes to each other is built up the two phases.ases.

  • PDF

Co-evolutionary Structural Design Framework: Min(Volume Minimization)-Max(Critical Load) MDO Problem of Topology Design under Uncertainty (구조-하중 설계를 고려한 공진화 구조 설계시스템)

  • 양영순;유원선;김봉재
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.3
    • /
    • pp.281-290
    • /
    • 2003
  • Co Evolutionary Structural Design(CESD) Framework is presented, which can deal with the load design and structural topology design simultaneously. The load design here is the exploration algorithm that finds the critical load patterns of the given structure. In general, the load pattern is a crucial factor in determining the structural topology and being selected from the experts어 intuition and experience. However, if any of the critical load patterns would be excluded during the process of problem formation, the solution structure might show inadequate performance under the load pattern. Otherwise if some reinforcement method such as safety factor method would be utilized, the solution structure could result in inefficient conservativeness. On the other hand, the CESD has the ability of automatically finding the most critical load patterns and can help the structural solution evolve into the robust design. The CESD is made up of a load design discipline and a structural topology design discipline both of which have the fully coupled relation each other. This coupling is resolved iteratively until the resultant solution can resist against all the possible load patterns and both disciplines evolve into the solution structure with the mutual help or competition. To verify the usefulness of this approach, the 10 bar truss and the jacket type offshore structure are presented. SORA(Sequential Optimization & Reliability Assessment) is adopted in CESD as a probabilistic optimization methodology, and its usefulness in decreasing the computational cost is verified also.