• Title/Summary/Keyword: Design complexity

Search Result 1,995, Processing Time 0.026 seconds

Development of the Optimal Performance Based Seismic Design Method for 2D Steel Moment Resisting Frames (2차원 철골 구조물의 최적 성능기반 내진설계법 개발)

  • Kwon Bong-Keun;Lee Hyun-Kook;Kwon Yun-Man;Park Hyo-Seon
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2005.04a
    • /
    • pp.636-643
    • /
    • 2005
  • Recently, performance based seismic design (PBSD) methods have been suggested in numerous forms and widely studied as a new concept of seismic design. The PBDSs are far from being practical method due to complexity of algorithms resided in the design philosophy. In this paper, optimal seismic design method based on displacement coefficient method (DCM) described in FEMA 273 is developed. As an optimizer simple genetic algorithms are used for implementations. In the optimization problem formulated in this Paper, strength design criteria stiffness design criteria, and nonlinear response criteria specified in DCM are included in design constraints. The optimal performance based design(OPBD) method is applied to seismic design of a 3-story two-dimensional steel frame structures.

  • PDF

MECHANICAL DESIGN APPROACH FOR THE VIRTUAL MOCK-UP STUDY OF BUILDING ENVELOPE DESIGN AND FABRICATION

  • Minjung M.;Yongcheol L.
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.158-162
    • /
    • 2013
  • Building envelope systems with growing complexity in geometry and performance criteria demand adapted workflow processes toward the efficient integration of their design and fabrication. To facilitate integration of the workflow process, this study analyzes relationships among teams who share digital models and exchange information that help project participants identify areas of improvement in task allocation and exchanges among various actors, systems, and activities. In addition, major gaps identified in knowledge transfer, project tracking, and design integration during the performance evaluation stages, emphasize the need for a more comprehensive approach to integrating the design, the fabrication, and the construction parameters of building envelope systems. To evaluate the effectiveness of streamlining interactions of design parameters with fabrication constraints and constructability assessments, this paper examines a mechanical design approach as it applies to various project scenarios to develop a mechanical solution for streamlining building envelope design and construction workflow.

  • PDF

Application Analysis of Artificial Intelligence Technology in Museum Concept Design

  • Chen Xi;Jeanhun Chung
    • International journal of advanced smart convergence
    • /
    • v.12 no.4
    • /
    • pp.321-327
    • /
    • 2023
  • The current rapid development of artificial intelligence technology has involved all aspects of the production field. The development of various algorithms and programs has pushed artificial intelligence to a new peak. Due to its complexity and diversity in the field of architectural design, the positive impact of artificial intelligence technology on architectural design is discussed from the perspective of conceptual design. For museums, which are one of the increasingly popular public facilities, the introduction of artificial intelligence technology has provided certain help in assisting the conceptual design of the museum. This article analyzes the theoretical and practical support of artificial intelligence technology in improving conceptual design, analyzing the architectural appearance, structural layout, materials, etc., to increase the feasibility and practicality of assisting conceptual design. It has certain reference significance for building a modern, advanced, international and interactive modern museum.

The Design of $GF(2^m)$ Multiplier using Multiplexer and AOP (Multiplexer와AOP를 적응한 $GF(2^m)$ 상의 승산기 설계)

  • 변기영;황종학;김흥수
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.40 no.3
    • /
    • pp.145-151
    • /
    • 2003
  • This study focuses on the hardware implementation of fast and low-complexity multiplier over GF(2$^{m}$ ). Finite field multiplication can be realized in two steps: polynomial multiplication and modular reduction using the irreducible polynomial and we will treat both operation, separately. Polynomial multiplicative operation in this Paper is based on the Permestzi's algorithm, and irreducible polynomial is defined AOP. The realization of the proposed GF(2$^{m}$ ) multipleker-based multiplier scheme is compared to existing multiplier designs in terms of circuit complexity and operation delay time. Proposed multiplier obtained have low circuit complexity and delay time, and the interconnections of the circuit are regular, well-suited for VLSI realization.

Self-organized Learning in Complexity Growing of Radial Basis Function Networks

  • Arisariyawong, Somwang;Charoenseang, Siam
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.30-33
    • /
    • 2002
  • To obtain good performance of radial basis function (RBF) neural networks, it needs very careful consideration in design. The selection of several parameters such as the number of centers and widths of the radial basis functions must be considered carefully since they critically affect the network's performance. We propose a learning algorithm for growing of complexity of RBF neural networks which is adapted automatically according to the complexity of tasks. The algorithm generates a new basis function based on the errors of network, the percentage of decreasing rate of errors and the nearest distance from input data to the center of hidden unit. The RBF's center is located at the point where the maximum of absolute interference error occurs in the input space. The width is calculated based on the standard deviation of distance between the center and inputs data. The steepest descent method is also applied for adjusting the weights, centers, and widths. To demonstrate the performance of the proposed algorithm, general problem of function estimation is evaluated. The results obtained from the simulation show that the proposed algorithm for RBF neural networks yields good performance in terms of convergence and accuracy compared with those obtained by conventional multilayer feedforward networks.

  • PDF

Architecture Design of PN Code Acquisition for MC-CDMA Systems (MC-CDMA 시스템용 PN 부호 동기획득 구조의 구현)

  • 노정민;이성주;김재석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.2
    • /
    • pp.117-125
    • /
    • 2003
  • In this paper, we propose a new code acquisition architecture having the features of low complexity and high speed for the MC-CDMA system. The newly designed searching finger has function of the searcher as well as the finger. The searching finger tests the PN code Phase as the searcher during the initial acquisition, and as the finger after the initial acquisition. The proposed system has reduced the average acquisition time of the PN codes to $T_{acq}$/19 in the 20MHz MC-CDMA system with 75% reduction of H/W complexity.y.

Optimal Buffer Allocation in Multi-Product Repairable Production Lines Based on Multi-State Reliability and Structural Complexity

  • Duan, Jianguo;Xie, Nan;Li, Lianhui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1579-1602
    • /
    • 2020
  • In the design of production system, buffer capacity allocation is a major step. Through polymorphism analysis of production capacity and production capability, this paper investigates a buffer allocation optimization problem aiming at the multi-stage production line including unreliable machines, which is concerned with maximizing the system theoretical production rate and minimizing the system state entropy for a certain amount of buffers simultaneously. Stochastic process analysis is employed to establish Markov models for repairable modular machines. Considering the complex structure, an improved vector UGF (Universal Generating Function) technique and composition operators are introduced to construct the system model. Then the measures to assess the system's multi-state reliability and structural complexity are given. Based on system theoretical production rate and system state entropy, mathematical model for buffer capacity optimization is built and optimized by a specific genetic algorithm. The feasibility and effectiveness of the proposed method is verified by an application of an engine head production line.

A Task Scheduling Strategy in a Multi-core Processor for Visual Object Tracking Systems (시각물체 추적 시스템을 위한 멀티코어 프로세서 기반 태스크 스케줄링 방법)

  • Lee, Minchae;Jang, Chulhoon;Sunwoo, Myoungho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.24 no.2
    • /
    • pp.127-136
    • /
    • 2016
  • The camera based object detection systems should satisfy the recognition performance as well as real-time constraints. Particularly, in safety-critical systems such as Autonomous Emergency Braking (AEB), the real-time constraints significantly affects the system performance. Recently, multi-core processors and system-on-chip technologies are widely used to accelerate the object detection algorithm by distributing computational loads. However, due to the advanced hardware, the complexity of system architecture is increased even though additional hardwares improve the real-time performance. The increased complexity also cause difficulty in migration of existing algorithms and development of new algorithms. In this paper, to improve real-time performance and design complexity, a task scheduling strategy is proposed for visual object tracking systems. The real-time performance of the vision algorithm is increased by applying pipelining to task scheduling in a multi-core processor. Finally, the proposed task scheduling algorithm is applied to crosswalk detection and tracking system to prove the effectiveness of the proposed strategy.

Design of Low Complexity Human Anxiety Classification Model based on Machine Learning (기계학습 기반 저 복잡도 긴장 상태 분류 모델)

  • Hong, Eunjae;Park, Hyunggon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.9
    • /
    • pp.1402-1408
    • /
    • 2017
  • Recently, services for personal biometric data analysis based on real-time monitoring systems has been increasing and many of them have focused on recognition of emotions. In this paper, we propose a classification model to classify anxiety emotion using biometric data actually collected from people. We propose to deploy the support vector machine to build a classification model. In order to improve the classification accuracy, we propose two data pre-processing procedures, which are normalization and data deletion. The proposed algorithms are actually implemented based on Real-time Traffic Flow Measurement structure, which consists of data collection module, data preprocessing module, and creating classification model module. Our experiment results show that the proposed classification model can infers anxiety emotions of people with the accuracy of 65.18%. Moreover, the proposed model with the proposed pre-processing techniques shows the improved accuracy, which is 78.77%. Therefore, we can conclude that the proposed classification model based on the pre-processing process can improve the classification accuracy with lower computation complexity.

Measurement of program volume complexity using fuzzy self-organizing control (퍼지 적응 제어를 이용한 프로그램 볼륨 복잡도 측정)

  • 김재웅
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.3
    • /
    • pp.377-388
    • /
    • 2001
  • Software metrics provide effective methods for characterizing software. Metrics have traditionally been composed through the definition of an equation, but this approach restricted within a full understanding of every interrelationships among the parameters. This paper use fuzzy logic system that is capable of uniformly approximating any nonlinear function and applying cognitive psychology theory. First of all, we extract multiple regression equation from the factors of 12 software complexity metrics collected from Java programs. We apply cognitive psychology theory in program volume factor, and then measure program volume complexity to execute fuzzy learning. This approach is sound, thus serving as the groundwork for further exploration into the analysis and design of software metrics.

  • PDF