• Title/Summary/Keyword: design and analysis of algorithms

Search Result 620, Processing Time 0.028 seconds

Drift Design Method of High-rise Buildings Considering Design Variable Linking Strategy and Load Combinations (부재 그룹과 하중 조합을 고려한 고층건물 변위조절 설계법)

  • Seo, Ji-Hyun;Park, Hyo-Seon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.19 no.4 s.74
    • /
    • pp.357-367
    • /
    • 2006
  • Drift design methods using resizing algorithms have been presented as a practical drift design method since the resizing algorithms proposed easily find drift contribution of each member, called member displacement participation factor, to lateral drift to be designed without calculation of sensitivity coefficient or re-analysis. Weight of material to be redistributed for minimization of the lateral drift is determined according to the member displacement participation factors. However, resizing algorithms based on energy theorem must consider loading conditions because they have different displacement contribution according to different loading conditions. Furthermore, to improve practicality of resizing algorithms, structural member grouping is required in application of resizing algorithms to drift control of high-rise buildings. In this study, three resizing algorithms on considering load condition and structural member grouping are developed and applied to drift design of a 20-story steel-frame shear-wall structure and a 50-story frame shear-wall system with outriggers.

THE OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE ALL HINGE VERTICES ON INTERVAL GRAPHS

  • Bera, Debashis;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.2
    • /
    • pp.387-401
    • /
    • 2001
  • If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

Distributed/parallel Algorithm Simulator (분산 및 병렬 알고리즘 시뮬레이터)

  • ;R.S.Ramakrishna
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.777-779
    • /
    • 1999
  • A new distributed/parallel algorithm simulator, DASim(Distributed Algorithm Simulator), is proposed in this paper. The idea is to ease the task of design, analysis and implementation of distributed algorithms. A small high level language has been proposed for the purpose. Through this non-language specific high level language, the users are spared from the tedious details about how to program distributed or parallel algorithms. Further, visualization of these algorithms are pretty helpful to understand behaviors of these algorithms.

  • PDF

Optimal Design of a Smart Actuator by using of GA for the Control of a Flexible Structure Experiencing White Noise Disturbance

  • Han, Jungyoup;Heo, Hoon
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.125-129
    • /
    • 1996
  • This paper deals with the problem of placement/sizing of distributed piezo actuators to achieve the control objective of vibration suppression. Using the mean square response as a performance index in optimization, we obtain optimal placement and sizing of the actuator. The use of genetic algorithms as a technique for solving optimization problems of placement and sizing is explored. Genetic algorithms are also used for the control strategy. The analysis of the system and response moment equations are carried out by using the Fokker-Planck equation. This paper presents the design and analysis of an active controller and optimal placement/sizing of distributed piezo actuators based on genetic algorithms for a flexible structure under random disturbance, shows numerical example and the result.

  • PDF

Distributed Structural Analysis Algorithms for Large-Scale Structures based on PCG Algorithms (대형구조물의 분산구조해석을 위한 PCG 알고리즘)

  • 권윤한;박효선
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.12 no.3
    • /
    • pp.385-396
    • /
    • 1999
  • In the process of structural design for large-scale structures with several thousands of degrees of freedom, a plethora of structural calculations with large amount of data storage are required to obtain the forces and displacements of the members. However, current computational environment with single microprocessor such as a personal computer or a workstation is not capable of generating a high-level of efficiency in structural analysis and design process for large-scale structures. In this paper, a high-performance parallel computing system interconnected by a network of personal computers is proposed for an efficient structural analysis. Two distributed structural analysis algorithms are developed in the form of distributed or parallel preconditioned conjugate gradient (DPCG) method. To enhance the performance of the developed distributed structural analysis algorithms, the number of communications and the size of data to be communicated are minimized. These algorithms are applied to the structural analyses of three large space structures as well as a 144-story tube-in-tube framed structure.

  • PDF

FERET DATA SET에서의 PCA와 ICA의 비교

  • Kim, Sung-Soo;Moon, Hyeon-Joon;Kim, Jaihie
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2355-2358
    • /
    • 2003
  • The purpose of this paper is to investigate two major feature extraction techniques based on generic modular face recognition system. Detailed algorithms are described for principal component analysis (PCA) and independent component analysis (ICA). PCA and ICA ate statistical techniques for feature extraction and their incorporation into a face recognition system requires numerous design decisions. We explicitly state the design decisions by introducing a modular-based face recognition system since some of these decision are not documented in the literature. We explored different implementations of each module, and evaluate the statistical feature extraction algorithms based on the FERET performance evaluation protocol (the de facto standard method for evaluating face recognition algorithms). In this paper, we perform two experiments. In the first experiment, we report performance results on the FERET database based on PCA. In the second experiment, we examine performance variations based on ICA feature extraction algorithm. The experimental results are reported using four different categories of image sets including front, lighting, and duplicate images.

  • PDF

Updating Algorithms of Finite Element Model Using Singular Value Decomposition and Eigenanalysis (특이값 분해와 고유치해석을 이용한 유한요소모델의 개선)

  • 김홍준;박영필
    • Journal of KSNVE
    • /
    • v.9 no.1
    • /
    • pp.163-173
    • /
    • 1999
  • Precise and reasonable modelling is necessary and indispensable to the analysis of dynamic characteristics of mechanical structures. Also. the effective prediction of the change of modal properties due to the variation of design parameters is required especially for the application of finite element method to the structural dynamics problems. To meet those necessity and requirement, three model updating algorithms are proposed for finite element methods. Those algorithms are based on sensitivity analysis of the modal data obtained from experimental modal analysis(EMA) and analytical modal analysis(AMA). The adapted sensitivity analysis methods of the algorithms are 1)eigensensitivity(EGNS) method. 2)frequency response function sensitivity(FRFS) method. 3)sensitivity based element-by-element method (SBEEM), Singular value decomposition(SVD) is used for performing eigenanalysis and parameter estimation in the updating process. Those algorithms are applied to finite element of a plate and the updating capability of each algorithm is compared in terms of accuracy. reliability and stability of the updating process. It is shown that the model updating method using frequency response function is superior to the other methods in view of various updating capabilities.

  • PDF

Time-Efficient Trajectory Planning Algorithms for Multiple Mobile Robots in Nuclear/Chemical Reconnaissance System (화방 정찰 체계에서의 다수의 이동 로봇을 위한 시간 효율적인 경로 계획 알고리즘에 대한 연구)

  • Kim, Jae-Sung;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.10
    • /
    • pp.1047-1055
    • /
    • 2009
  • Since nuclear and chemical materials could damage people and disturb battlefield missions in a wide region, nuclear/chemical reconnaissance systems utilizing multiple mobile robots are highly desirable for rapid and safe reconnaissance. In this paper, we design a nuclear/chemical reconnaissance system including mobile robots. Also we propose time-efficient trajectory planning algorithms using grid coverage and contour finding methods for reconnaissance operation. For grid coverage, we performed in analysis on time consumption for various trajectory patterns generated by straight lines and arcs. We proposed BCF (Bounded Contour Finding) and BCFEP (Bounded Contour Finding with Ellipse Prediction) algorithms for contour finding. With these grid coverage and contour finding algorithms, we suggest trajectory planning algorithms for single, two or four mobile robots. Various simulations reveal that the proposed algorithms improve time-efficiency in nuclear/chemical reconnaissance missions in the given area. Also we conduct basic experiments using a commercial mobile robot and verify the time efficiency of the proposed contour finding algorithms.

Global Optimization of Composite Structures Using Triangular Patch Algorithm (삼각 패치 알고리듬을 이용한 복합 재료 구조물의 전체 최적화)

  • O, Seung-Hwan;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.4
    • /
    • pp.671-684
    • /
    • 2001
  • Several design problems of composite structures are studied via a global optimizer based on attraction regions. MSC/NASTRAN is adopted for static and eigenvalue analysis. The method of modified feasible direction in DOT is used for local optimization. Through the review of global optimization algorithms, the triangular patch algorithm is selected because the algorithm is known to be efficient, robust and powerful for general nonlinear optimization problems. For general applicability, various mechanical properties are considered as design objectives; strain energy, eigenvalue, weight, displacement, and buckling load. In all cases considered, the triangular patch algorithm results in a lot of optimum points and useful design patterns, that are not easy by local algorithms or conventional global algorithms can be determined.

Optimal Design for 3D Structures Using Artificial Intelligence : Its Application to Micro Accelerometer (인공지능을 이용한 3차원 구조물의 최적화 설계 : 마이크로 가속도계에 적용)

  • Lee, Joon-Seong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.445-450
    • /
    • 2004
  • This paper describes an optimal design system for multi-disciplinary structural design. An automatic finite element (FE) mesh generation technique, which is based on the fuzzy knowledge processing and computational geometry technique, is incorporated into the system, together with a commercial FE analysis code and a commercial solid modelers. An optimum design solution or satisfactory solutions are then automatically searched using the genetic algorithms modified for real search space, together with the automated FE analysis system. With an aid of genetic algorithms, the present design system allows us to effectively obtain a multi-dimensional solutions. The developed system is successfully applied to the shape design of a micro accelerometer based on a tunnel current concept.