• 제목/요약/키워드: geometric progression

검색결과 37건 처리시간 0.024초

Numerical simulations of progression of damage in concrete embedded chemical anchors

  • Sasmal, S.;Thiyagarajan, R.;Lieberum, K.H.;Koenders, E.A.B.
    • Computers and Concrete
    • /
    • 제22권4호
    • /
    • pp.395-405
    • /
    • 2018
  • In this paper, the performance of post-installed adhesive bonded anchor embedded in concrete is assessed using numerical simulations. This study aims at studying the influence of parameters on the performance of a chemically bonded anchorage system. Non-linear finite element modelling and simulations are carried out by properly using the material properties and phenomenon. Materials parameters such as characteristic length, fracture energy, damage criteria, tension retention and crack width of concrete and interface characteristics are carefully assigned so as to obtain a most realistic behaviour of the chemical anchor system. The peak strength of two different anchor systems obtained from present numerical studies is validated against experimental results. Furthermore, validated numerical models are used to study the load transferring mechanism and damage progression characteristics of various anchors systems where strength of concrete, strength of epoxy, and geometry and disposition of anchors are the parameters. The process of development of strain in concrete adjacent to the anchor and energy dissipated during the course of damage progression are analysed. Results show that the performance of the considered anchorage system is, though a combined effect of material and geometric parameters, but a clear distinction could be made on the parameters to achieve a desired performance based on strength, slip, strain development or dissipated energy. Inspite the increase in anchor capacity with increase in concrete strength, it brings some undesirable performance as well. Furthermore, the pullout capacity of the chemical anchor system increases with a decrease in disparity among the strength of concrete and epoxy.

영상의 그림자 영역 경계 검출 및 복원 연구 (Extracting Shadow area and recovering of image)

  • 최연웅;전재용;박정남;조기성
    • 한국측량학회:학술대회논문집
    • /
    • 한국측량학회 2007년도 춘계학술발표회 논문집
    • /
    • pp.169-173
    • /
    • 2007
  • Nowadays the aerial photos is using to get the information around our spatial environment and it increases by geometric progression in many fields. The aerial photos need in a simple object such as cartography and ground covey classification and also in a social objects such as the city plan, environment, disaster, transportation etc. However, the shadow, which includes when taking the aerial photos, makes a trouble to interpret the ground information, and also users, who need the photos in their field tasks, have restriction. This study, for removing the shadow, uses the single image and the image without the source of image and taking situation. Also, this study present clustering algorism based on HIS color model that use Hue, Saturation and Intensity, especially this study used I(intensity) to extract shadow area from image. And finally by filtering in Fourier frequency domain creates the intrinsic image which recovers the 3-D color information and removes the shadow.

  • PDF

MOVING OBJECT JOIN ALGORITHMS USING TB- TREE

  • Lee Jai-Ho;Lee Seong-Ho;Kim Ju-Wan
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.309-312
    • /
    • 2005
  • The need for LBS (Loc,ation Based Services) is increasing due to the wnespread of mobile computing devices and positioning technologies~ In LBS, there are many applications that need to manage moving objects (e.g. taxies, persons). The moving object join operation is to make pairs with spatio-temporal attribute for two sets in the moving object database system. It is import and complicated operation. And processing time increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we apply spatial join methods to moving objects join. We propose two kind of join methods with TB- Tree that preserves trajectories of moving objects. One is depth first traversal spatio-temporaljoin and another is breadth-first traversal spatio-temporal join. We show results of performance test with sample data sets which are created by moving object ,generator tool.

  • PDF

Spatio- Temporal Join for Trajectory of Moving Objects in the Moving Object Database

  • Lee Jai-Ho;Nam Kwang-Woo;Kim Kwang-Soo
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
    • /
    • pp.287-290
    • /
    • 2004
  • In the moving object database system, spatiotemporal join is very import operation when we process join moving objects. Processing time of spatio-temporal join operation increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we propose spatio-temporal join algorithm with TB-Tree that preserves trajectories of moving objects, and show result of test. We first present basic algorithm, and propose cpu-time tunning algorithm and IO-time tunning algorithm. We show result of test with data set created by moving object generator tool.

  • PDF

A study of energy absorption and exposure buildup factors in natural uranium

  • Salehi, Danial;Sardari, Dariush;Jozani, M.S.
    • Advances in materials Research
    • /
    • 제4권1호
    • /
    • pp.23-30
    • /
    • 2015
  • Energy absorption and exposure buildup factor have been computed for natural uranium in the energy range of 0.05-15MeV up to penetration depth of 40 mfp. Five-parameter geometric progression (G-P) fitting method has been used to compute buildup factors of uranium. The variation of energy absorption and exposure buildup factors with, penetration depth and incident photon energies for the uranium has been studied. It has been concluded that the values of energy absorption and exposure buildup factors are very large at 0.15 MeV.

대도시 교통문제 완화를 위한 간선도로별 신호체계의 최적설계에 관한 연구 (A Study on the Optimum Design of the Arterial-Based Signal System for the Relief of Transportation Problems in Metropolitan Areas)

  • 김태곤
    • 한국항만학회지
    • /
    • 제8권2호
    • /
    • pp.1-35
    • /
    • 1994
  • The main arterial which runs through the in City of Pusan, carries about 60% of downtown traffic or more, maintains about 20% yearly increase in traffic is severely suffering from the traffic congestion because of concentrated traffic volumes regardless of peak-time periods. The purpose of this study was to grasp the traffic, geometric, and signal conditions of the main arterial through the Videologging System Techniques, perform the transportation system analyses, and finally suggest the improvements which could increase the travel capacity, reduce the average delay and fuel consumption with the optimal conditions of signal system. The following conclusions were drawn : firstly the traffic system should be shifted for the travel distribution on the arterial during the peak time periods, secondly the roadway system of the arterial reviewed for left-turn traffic during the peak time periods, and thirdly the signal system of intersection reconstructed for signal optimization or progression within the range of cycle length suggested.

  • PDF

선분, 직선, 반직선의 학습 내용과 학습 계열 분석 (Contents and Sequences for Line Segments, Straight Lines, and Rays in Elementary Mathematics Curricula and Textbooks)

  • 김상미
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제37권4호
    • /
    • pp.635-652
    • /
    • 2023
  • 이 연구는 초등학교 수준에서 '선'의 학습 내용 즉, 선분, 직선, 반직선 등의 학습 내용과 학습 계열을 분석하였다. 수학과 교육과정 및 수학 교과서에서 1차부터 7차까지, 그 이후 2007 개정, 2009 개정, 2015 개정, 2022 개정에 이르기까지 각 시기에 선분, 직선, 반직선을 도입하는 시기와 그 표현을 통하여 학습 내용을 분석하였고, 그 학습 순서 및 활동 중점을 통하여 학습 계열을 분석하였다. 학습 내용의 도입 시기와 정의 방식의 변화 분석에서 본다면, 선분, 직선, 반직선을 주로 2차원 평면도형의 그 구성 요소로서 즉, 다각형의 변이나 각의 변으로서 다루어왔지만, 수학과 교과서에 비추어 볼 때 기초 도형으로서 선분, 직선, 반직선이라는 다양한 선을 탐색할 기회가 부족하였다. 둘째, 선분, 직선, 반직선의 정의에서 점과 선의 관계 설정 및 선들 사이의 관계 설정에 따라 개념 형성에 영향을 주며 이들을 비교하여 그 장단점을 교수학습 관련 연구 및 근거들이 요구된다. 셋째, 선분에서 곧은 선(최단거리)의 아이디어와 직선과 반직선에서 끝없이 나아가는 선(무한성)의 아이디어는 수학의 핵심적인 아이디어로서, 생활 주변의 여러 사물에서 선의 개념을 형성하고 점차 구체적인 선을 이상화하여 유클리드 기하의 도형으로 나아가도록 상상하고 경험하는 활동이 필요하다.

노인 주거환경의 개념과 유형화 연구 (A Study on the Concept of Elderly Housing Environment and Housing Types)

  • 김민수;이성미;이유진;이연숙;이선민
    • 한국실내디자인학회:학술대회논문집
    • /
    • 한국실내디자인학회 2006년도 춘계학술발표대회 논문집
    • /
    • pp.224-228
    • /
    • 2006
  • Recently, In Korea, diverse elderly facilities have increased by geometric progression cope with rapidly aging society. But, there haven't been enough systematic understanding about elderly housing. To approach the concept of elderly housing, the clear theory of its definition and types should be established. Thus, the purpose of this study is to set up the concept of elderly housing and clear definition, and to recreate criteria fit our situation. This study was proceeded by contents analysis of elderly housing environment in prior research. First, we understand the use of terms about elderly housing in references and redefine. Then, analyze the cases of categorizations in developed countries. Finally, the research point out current problems and make criteria in housing environmental aspects. This study leads new perspective to consist synthetic services according to special conditions of elderly, far from the economical point of view. It will contribute to understand elderly housing designing aging friendly environment.

  • PDF

디지털콘텐츠의 저장관리시스템 기술에 관한 연구 (A Study on the Technologies of Storage Management System for Digital Contents)

  • 조윤희
    • 한국도서관정보학회지
    • /
    • 제34권2호
    • /
    • pp.187-207
    • /
    • 2003
  • 정보기술과 인터넷의 진화에 따라 기하급수적으로 증가하는 디지털콘텐츠를 효율적으로 저장, 검색, 변경, 관리할 수 있는 네트워크 기반 저장관리시스템이 요구되고 있다. 분산 네트워크 환경하에 이 기종 시스템의 데이터 통합관리, 저장 장치의 효과적인 활용, 데이터 전송 한계 등의 문제에 대한 해결방안으로 SAN이 대두되었다. SAN은 개별적으로 서버에 연결되던 저장장치들을 광 채널과 같은 고속네트워크에 직접 연결시켜 대용량 데이터를 효과적으로 관리하고 공유할 수 있도록 해주는 시스템이다. 본 연구는 저장관리시스템의 기술과 표준화 및 시장동향 조사와 다중 시스템 저장장치의 통합과 저장장치의 가상화를 이루기 위한 구조와 구성장치 및 성능을 비교 분석하였다.

  • PDF

A Novel Resource Allocation Algorithm in Multi-media Heterogeneous Cognitive OFDM System

  • Sun, Dawei;Zheng, Baoyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권5호
    • /
    • pp.691-708
    • /
    • 2010
  • An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.