• Title/Summary/Keyword: block trace

Search Result 61, Processing Time 0.022 seconds

Behavior of one way reinforced concrete slabs with styropor blocks

  • Al-Azzawi, Adel A.;Abbas, J;Al-Asdi, Al-Asdi
    • Advances in concrete construction
    • /
    • v.5 no.5
    • /
    • pp.451-468
    • /
    • 2017
  • The problem of reducing the self-weight of reinforced concrete structures is very important issue. There are two approaches which may be used to reduced member weight. The first is tackled through reducing the cross sectional area by using voids and the second through using light weight materials. Reducing the weight of slabs is very important as it constitutes the effective portion of dead loads in the structural building. Eleven slab specimens was casted in this research. The slabs are made one way though using two simple supports. The tested specimens comprised three reference solid slabs and eight styropor block slabs having (23% and 29%) reduction in weight. The voids in slabs were made using styropor at the ineffective concrete zones in resisting the tensile stresses. All slab specimens have the dimensions ($1100{\times}600{\times}120mm$) except one solid specimens has depth 85 mm (to give reduction in weight of 29% which is equal to the styropor block slab reduction). Two loading positions or cases (A and B) (as two-line monotonic loads) with shear span to effective depth ratio of (a/d=3, 2) respectively, were used to trace the structural behavior of styropor block slab. The best results are obtained for styropor block slab strengthened by minimum shear reinforcement with weight reduction of (29%). The increase in the strength capacity was (8.6% and 5.7%) compared to the solid slabs under loading cases A and B respectively. Despite the appearance of cracks in styropor block slab with loads lesser than those in the solid slab, the development and width of cracks in styropor block slab is significantly restricted as a result of presence a mesh of reinforcement in upper concrete portion.

MATRIX PRESENTATIONS OF THE TEICHMULLER SPACE OF A PUNCTURED TORUS

  • Kim, Hong-Chan
    • The Pure and Applied Mathematics
    • /
    • v.11 no.1
    • /
    • pp.73-88
    • /
    • 2004
  • A punctured torus $\Sigma(1,1)$ is a building block of oriented surfaces. The goal of this paper is to formulate the matrix presentations of elements of the Teichmuller space of a punctured torus. Let $\cal{C}$ be a matrix presentation of the boundary component of $\Sigma(1,1)$.In the level of the matrix group $\mathbb{SL}$($\mathbb2,R$) we shall show that the trace of $\cal{C}$ is always negative.

  • PDF

Security Audit System for Secure Router

  • Doo, So-Young;Kim, Ki-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1602-1605
    • /
    • 2005
  • An audit tracer is one of the last ways to defend an attack for network equipments. Firewall and IDS which block off an attack in advance are active way and audit tracing is passive way which analogizes a type and a situation of an attack from log after an attack. This paper explains importance of audit trace function in network equipment for security and defines events which we must leave by security audit log. We design and implement security audit system for secure router. This paper explains the reason why we separate general audit log and security audit log.

  • PDF

A Global Compaction of Microprograms Using Triangular Matrices and Junctiuon Blocks (삼각행렬과 접합블럭을 이용한 마이크로프로그램의 광역적 최적화)

  • Choi, Ki Ho;Lim, In Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.5
    • /
    • pp.681-691
    • /
    • 1986
  • To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.

  • PDF

An Offline FTL Algorithm to Verify the Endurance of Flash SSD (플래시 SSD의 내구성을 검증하기 위한 FTL 오프라인 알고리즘)

  • Jung, Ho-Young;Lee, Tae-Hwa;Cha, Jae-Hyuk
    • Journal of Digital Contents Society
    • /
    • v.13 no.1
    • /
    • pp.75-81
    • /
    • 2012
  • SSDs(Solid State Drives) have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An SSD has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of SSDs. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose trace driven offline optimal algorithms for garbage collection of FTL. The proposed algorithm always guarantees minimal number of erase operation. In addition, we verify our proposed algorithm using TPC trace.

Efficient Implementation of SOVA for Turbo Codes (Turbo code를 위한 효율적인 SOVA의 구현)

  • 이창우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11C
    • /
    • pp.1045-1051
    • /
    • 2003
  • The SOVA, which produces the soft decision value, can be used as a sub-optimum solution for concatenated codes such as turbo codes, since it is computationally efficient compared with the optimum MAP algorithm. In this paper, we propose an efficient implementation of the SOVA used for decoding turbo codes, by reducing the number of calculations for soft decision values and trace-back operations. In order to utilize the memory efficiently, the whole block of turbo codes is divided into several sub-blocks in the proposed algorithm. It is demonstrated that the proposed algorithm requires less computation than the conventional algorithm, while providing the same overall performance.

Loss of coolant accident analysis under restriction of reverse flow

  • Radaideh, Majdi I.;Kozlowski, Tomasz;Farawila, Yousef M.
    • Nuclear Engineering and Technology
    • /
    • v.51 no.6
    • /
    • pp.1532-1539
    • /
    • 2019
  • This paper analyzes a new method for reducing boiling water reactor fuel temperature during a Loss of Coolant Accident (LOCA). The method uses a device called Reverse Flow Restriction Device (RFRD) at the inlet of fuel bundles in the core to prevent coolant loss from the bundle inlet due to the reverse flow after a large break in the recirculation loop. The device allows for flow in the forward direction which occurs during normal operation, while after the break, the RFRD device changes its status to prevent reverse flow. In this paper, a detailed simulation of LOCA has been carried out using the U.S. NRC's TRACE code to investigate the effect of RFRD on the flow rate as well as peak clad temperature of BWR fuel bundles during three different LOCA scenarios: small break LOCA (25% LOCA), large break LOCA (100% LOCA), and double-ended guillotine break (200% LOCA). The results demonstrated that the device could substantially block flow reversal in fuel bundles during LOCA, allowing for coolant to remain in the core during the coolant blowdown phase. The device can retain additional cooling water after activating the emergency systems, which maintains the peak clad temperature at lower levels. Moreover, the RFRD achieved the reflood phase (when the saturation temperature of the clad is restored) earlier than without the RFRD.

AIOPro: A Fully-Integrated Storage I/O Profiler for Android Smartphones (AIOPro: 안드로이드 스마트폰을 위한 통합된 스토리지 I/O 분석도구)

  • Hahn, Sangwook Shane;Yee, Inhyuk;Ryu, Donguk;Kim, Jihong
    • Journal of KIISE
    • /
    • v.44 no.3
    • /
    • pp.232-238
    • /
    • 2017
  • Application response time is critical to end-user response time in Android smartphones. Due to the plentiful resources of recent smartphones, storage I/O response time becomes a major key factor in application response time. However, existing storage I/O trace tools for Android and Linux give limited information only for a specific I/O layer which makes it difficult to combine I/O information from different I/O layers, because not helpful for application developer and researchers. In this paper, we propose a novel storage I/O trace tool for Android, called AIOPro (Android I/O profiler). It traces storage I/O from application - Android platform - system call - virtual file system - native file system - page cache - block layer - SCSI layer and device driver. It then combines the storage I/O information from I/O layers by linking them with file information and physical address. Our evaluations of real smartphone usage scenarios and benchmarks show that AIOPro can track storage I/O information from all I/O layers without any data loss under 0.1% system overheads.

Multimedia Fingerprinting in DCT Block (DCT 블록의 멀티미디어 핑거프린팅)

  • Rhee, Kang-Hyeon
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.241-247
    • /
    • 2011
  • In this paper, it was implemented an algorithm of multimedia fingerprinting in DCT block. For the improvement of the limits of DRM’s ability, the proposed algorithm could be decided a responsibility boundary to judge a traitor who falsified the content according to perform separately a watermarking of content provider and a fingerprinting of content user. At the test image size($128{\times}128$) and block size($8{\times}8$) of the content provider, the measured PSNR is Inf~46.6dB with watermarking strength ${\Theta}=0.5{\sim}1.2$, and at a number of users and user's code length are n=7,15,31,63 and l=7,15,31,64 each, the measured PSNR is Inf~46.1 with fingerprinting code length l=7,15,31,63. Finally, a traitor tracing of the falsified content is approached to a trace ratio 1 which is extended to n-1.

Block Level Refinement of Popularity-Aware Interval Caching for Multimedia Streaming Servers (멀티미디어 스트리밍 서버를 위한 인기도 기반 인터벌 캐슁의 블록 수준 세분화 기법)

  • Kwon, Oh-Hoon;Kim, Tae-Seok;Bahn, Hyo-Kyung;Koh, Kern
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.4
    • /
    • pp.138-144
    • /
    • 2007
  • With recent proliferation of video-on-demand services, caching in a multimedia streaming server is becoming increasingly important. Previous studies have shown that request interval based caching and its extension for considering different video popularity performs well in various streaming environments. In this paper, we show that block level refinement of this existing scheme can further improve the performance of streaming servers. Trace driven simulations with real world VOD traces have shown that the proposed scheme improves the cache hit rate and the startup latency.