• Steel and Composite Structures
• /
• 제26권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.

• 한국컴퓨터정보학회논문지
• /
• 제13권1호
• /
• pp.11-20
• /
• 2008

• 대한화학회지
• /
• 제42권4호
• /
• pp.5-480
• /
• 1998

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2016년도 자성 및 자성재료 국제학술대회
• /
• pp.45-45
• /
• 2016

• 충청수학회지
• /
• 제23권4호
• /
• pp.663-677
• /
• 2010

We investigate efficient method for the computation of resultant and discriminant of polynomials. The aim of this paper is to provide not only those values but also visual structure from elementary matrix calculation.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 제11회 음성통신 및 신호처리 워크샵 논문집 (SCAS 11권 1호)
• /
• pp.210-213
• /
• 1994

In this paper, we present a combination of trellis coded vector quantization and code-excited linear prediction coding, termed trellis excitation coding, for an efficient 4.8 kbps speech coding system. A training sequence-based algorithm is developed for designing an otimized codebook subject to the TEC structure. Also, we discuss the trellis symbol release rules that avoid excessive encoding delay. Finally, simulation results for the TEC coder are given at bit rate of 4.8 kbps.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.511-514
• /
• 1998

This paper proposes efficient methods that integrate and execute local plan rules of task agents in a multi-agent environment. In these methods, each agent's plan rules are represented in a network structure, and these networks are then collected by a single task agent to build a integrated domain network, which is exploited to achieve the goal. Agent problem solving by using the domain network enables a concurrent execution of plan rules that are sequential in nature.

• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2008년도 International Meeting on Information Display
• /
• pp.1171-1174
• /
• 2008

We studied the properties of vapor flux distributions of nozzle shaped thermal evaporation sources and the factors, which can change the flux distributions such as nozzle structure. We used a simulation and experiment methods for this study. By using the results of our study, we improved the Circular Nozzle Source, which can make uniform thin films without substrate rotation, into more efficient source.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.979-982
• /
• 1999

A new accurate as well as efficient multi-layer interconnect capacitance extraction method is presented. Since Multi-layer interconnects is too complicated to directly extract capacitances, it is simplified with virtual ground concept. To make the structure tractable, the shielding effects should be separately determined. Since the electric field shielding effects, and the solid-ground-based capacitance matrices can be readily determined from the layout geometry, the accurate as well as efficient quasi-3D capacitances concerned with an objective line can be readily determined. In order to demonstrate its efficiency and accuracy, the parameters and circuit responses were benchmarked with 3D-field-solver-based results.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.141-152
• /
• 1998

Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.