• Title/Summary/Keyword: simple frame

Search Result 589, Processing Time 0.027 seconds

A Study on the Simple Design Method of Semi-Rigid Connection with Angle in Steel Structure (강구조에서 ㄱ형강을 이용한 반강접 접합의 간편 설계)

  • Heo, Myong-Jae;Kim, Hong-Geun;Choi, Won-Gu
    • Journal of Korean Society of Steel Construction
    • /
    • v.23 no.3
    • /
    • pp.261-273
    • /
    • 2011
  • Recently, the demands for steel frame are increasing because of the trend and due to the demand for bigger and higher buildings. In the analysis of typical steel frame, connections are based on the idealized fixed or pinned connection. A fixed connection assumes that the relative angle of each member before deformation is the same after the transformation. Therefore, the stiffener reinforces the connection to sufficient rigidity and stability of the panel zone. In the economical aspect, however, the necessity of connection that the stiffener reinforcement has omitted is increasing due to the excessive production as well as labor costs of connection. In contrast, pinned connection is assumed that bending moments between the beams and columns do not transfer to each member. This is easy to make in the plant and the construction is simple. However, the structural efficiency is reduced in pinned connection because connection cannot transfer moments. The introduction of this semirigid process can decide efficient cross-sectional dimensions that promote ease in the course of structural erection, as performed by members in the field-a call for safety in the entire frame. Therefore, foreign countries exert efforts to study the practical behavior and the results are applied to criterion. This paper analyzes the semirigid connection of domestic steel by design specifications of AISC/LRFD and make data bank that pertain to each steel. After wards, the results are compared to those of idealized connection; at the same time, this paper presents a design method that matches economic efficiency, end-fixity, and rotational stiffness.

Implementation of Q3 Adaptor ATM Connection and FR Interworking Management in ATM Switch (ATM 교환기의 Q3 Adaptor ATM 연결 및 FR 연동 관리 구현)

  • 나성욱
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.85-87
    • /
    • 2002
  • 본 논문은 SNMP(Simple Network Management Protocol)기반의 ATM 교환 장비를 CMIP(common management information protocol)기반의 관리망에 연동하기 위한 Q3 Adaptor 기능 중 ATM 연결 관리와 Frame Relay 연동 관리를 소개한다. 본 논문의 ATM연결 관리는 점대점(Point-to-Point Permanent Virtual Connection) PVC(P)로 한정하고, FR 연동 관리는 ATM/FR 연결의 One-to-One PVC로 한정하며 ATM 밀 ATM/FR 연결에 대하여 CMIP Manager, Q3 Adaptor 및 교환 장비의 DB간 불일치 현상을 극복하기 위한 현행화 기능도 소개한다.

  • PDF

An efficient architecture for motion estimation processor satisfying CCITT H.261 (CCITT H.261를 위한 효율적인 구조의 움직임 추정 프로세서 VLSI 설계)

  • 주락현;김영민
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.30-38
    • /
    • 1995
  • In this paper, we propose an efficient architecture for motion estimation processor which performs one of essential functions in moving picture coding algorithms. Simple control mechanism of data flow in register array which stores pixel data, parallel processing of pixel data and pipelining scheme in arithmetic umit allow this architecture to process a 352*288 pixel image at the frame rate of 30fs, which is compatable with CCITT standard H.261.

  • PDF

Efficient Analysis for Vertical Vibration of Multistory Buildings (다층 건축구조물의 효율적인 연직진동해석)

  • 이동근;안상경
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.04a
    • /
    • pp.129-136
    • /
    • 1999
  • This research proposes an effective analytical methodology for vertical vibration of three dimensional frame structures including slabs. The consideration of slabs, although allows more precise results, requires large amount of computer time and memory space due to the use of plane stress elements. In consideration of these problems, a method to properly manage nodal points and degrees of freedom is proposed based on matrix condensation technique. Also studied is the use of substructure method to obtain fast and reliable results with simple input data when they are applied to conventional building structures.

  • PDF

New Sensorless Control of PMSM using Reactive Power (무효전력을 이용한 영구자석 동기전동기의 새로운 센서리스 제어)

  • Han, Yoon-Seok;Choi, Jung-Soo;Kim, Young-Seok;Shin, Jae-Wha
    • Proceedings of the KIEE Conference
    • /
    • 2001.04a
    • /
    • pp.237-239
    • /
    • 2001
  • This paper presents a new speed sensorless control method of permanent magnet synchronous motors based on instantaneous reactive power. The proposed system is constructed in a synchronously rotating reference frame and is very simple. The new approach is not dependent upon the stator resistance, nor is it affected by mechanical motor parameters. The effectiveness of the proposed system is confirmed by the simulation results.

  • PDF

On Facilitating RFID Tag Read Processes via a Simple Parameter Estimation

  • Park, Young-Jae;Kim, Young-Beom
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1C
    • /
    • pp.38-44
    • /
    • 2012
  • In this paper, we first formulate an optimal design problem for RFID tag identification processes and then propose a simplified estimation method for determining optimal frame sizes and termination time under an independence assumption. Through computer simulations we show that the proposed scheme outperforms Vogt's scheme in terms of identification delay.

A Study on the Transplantation Methods of Large Trees - The Case of Celtis Sinensis in Chonan and Ginkgo biloba in Andong - (대형 수목의 이식공법 - 천안시 팽나무와 안동시 은행나무 사례 -)

  • 임재홍;이재근;김학범
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.30 no.4
    • /
    • pp.92-104
    • /
    • 2002
  • This study investigates, analyzes, and summarizes Dansplantation techniques and methods through practical methodology centering on fieldwork in order to present effective planting methods for large trees that have important significance. The conclusions are as follows : 1. The transplantation process of a large tree generally consists of the stages of digging up a tree, manufacturing a carrier frame, loading the tee on a vehicle, transporting, transplanting the tree, installing a strut and maintaining and managing the new transplant. In addition, planting a tree on a mounted place includes the primary procedures of trimming out the root, and preparing for transplanting the tree on a mounted place, as well as the secondary work of trimming out the root, transplanting a tree on a mounted place, maintenance and management. 2. In order to decide on a transplantation method for a large-sized tree, a structure calculation has to be performed first. That is, one must calculate the weight of the tree and the allowable stress of the strut (H-beam, etc.) fhst and then decide on the upper method through computer modeling based upon this structural calculation. 3. As a result of the analysis of a transplanted tree using the life soil method, it was confirmed that large quantities of feeder roots had developed around the root within a short time after the transplantation. The life soil method has proven to be very effective for transplantation of large-sized trees. 4. As for the production method of an H-beam strut frame, it was found that the manufacturing process and disassembly process were simple and proper; therefore, the H-beam frame is an appropriate structure to be used in the transplantation of large trees. 5. The concavo-convex method, which consists of filling the life soil in the concavo-convex area around the root, was found to be a method that promotes the growth of feeder roots within a short period of time and saves the supply of water at the same time.

Object Tracking for Elimination using LOD Edge Maps Generated from Canny Edge Maps (캐니 에지 맵을 LOD로 변환한 맵을 이용하여 객체 소거를 위한 추적)

  • Jang, Young-Dae;Park, Ji-Hun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.333-336
    • /
    • 2007
  • We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. Our method consists of two parts: first we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. To reduce side-effects because of irrelevant edges, we start our basic tracking by using strong Canny edges generated from large image intensity gradients of an input image. We get more edge pixels along LOD hierarchy. LOD Canny edge pixels become nodes in routing, and LOD values of adjacent edge pixels determine routing costs between the nodes. We find the best route to follow Canny edge pixels favoring stronger Canny edge pixels. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.

  • PDF

($OntoFrame^{(R)}$;an Information Service System based on Semantic Web Technology (시맨틱 웹 기술 기반 정보서비스 시스템 $OntoFrame^{(R)}$)

  • Sung, Won-Kyung;Lee, Seung-Woo;Hahn, Sun-Hwa;Jung, Han-Min;Kim, Pyung;Lee, Mi-Kyung;Park, Dong-In
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2008.04a
    • /
    • pp.87-88
    • /
    • 2008
  • As an information service system based on semantic web technology, $OntoFrame^{(R)}$ takes aim at a framework for providing analysis and fusion services of academic information. It currently consists of three parts: ontologies representing knowledge schema derived from academic information, $OntoURI^{(R)}$ which makes academic information into knowledge, and $OntoReasoner^{(R)}$ which performs inference and search on the knowledge. Unlike existing search engines which provides simple search services, our system provides, based on semantic web technology, several semantic and analytic services such as year-based topic trends in academic information, related topics, topic-based researchers and institutes, researcher network, statistics and regional distribution of academic information.

  • PDF

Time Slot Assignment Algorithm with Graph Coloring (그래프 채색에 의한 타임 슬롯 할당 알고리즘)

  • Kwon, Bo-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.52-60
    • /
    • 2008
  • A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.