• Title/Summary/Keyword: Slotted part

Search Result 18, Processing Time 0.038 seconds

Hydrodynamic performance of a vertical slotted breakwater

  • George, Arun;Cho, Il Hyoung
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.12 no.1
    • /
    • pp.468-478
    • /
    • 2020
  • The wave interaction problem with a vertical slotted breakwater, consisting of impermeable upper, lower parts and a permeable middle part, has been studied theoretically. An analytical model was presented for the estimation of reflection and transmission of monochromatic waves by a slotted breakwater. The far-field solution of the wave scattering involving nonlinear porous boundary condition was obtained using eigenfunction expansion method. The empirical formula for drag coefficient in the near-field, representing energy dissipation across the slotted barrier, was determined by curve fitting of the numerical solutions of 2-D channel flow using CFD code StarCCM+. The theoretical model was validated with laboratory experiments for various configurations of a slotted barrier. It showed that the developed analytical model can correctly predict the energy dissipation caused by turbulent eddies due to sudden contraction and expansion of a slotted barrier. The present paper provides a synergetic approach of the analytical and numerical modelling with minimum CPU time, for better estimation of the hydrodynamic performance of slotted breakwater.

Characteristics of Rotor Blade Tip Vortices with Spanwise Slots (스팬방향 슬롯을 가지는 회전익 끝와류의 특성)

  • Chung, Woon-Jin;Han, Yong-Oun
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.24 no.10
    • /
    • pp.1343-1350
    • /
    • 2000
  • The evolutionary structure of tip vortices has been investigated with a two-dimensional LDV system for a plain and a slotted blade, respectively. To analyze the effect of slots which bypasses a part of main stream into the tip face, velocity profiles, vortex sizes, their displacements and turbulence intensities during one revolution of the rotor were measured by the phase averaging process. For the comparison of circumferential velocity components of the plain blade and the slotted blade, the peak values of the slotted blade were lower than those of the plain blade, and axial velocity components of the slotted blade were considerably larger than those of the plain blade. The slotted rotor blade enlarged the core size and made the vortex delayed compared with those of the plain blade at the same wake ages. Turbulence profiles had peaks inside the core radii and decayed gradually in the radial direction of vortex coordinate. Also, using a quasi 3-D LDV measurement technique the budget of turbulence kinetic energy was analyzed in radial direction of the vortex core.

A Dual Slotted Ring Organization for Reducing Memory Access Latency in Distributed Shared Memory System (분산 공유 메모리 시스템에서 메모리 접근지연을 줄이기 위한 이중 슬롯링 구조)

  • Min, Jun-Sik;Chang, Tae-Mu
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.419-428
    • /
    • 2001
  • Advances in circuit and integration technology are continuously boosting the speed of processors. One of the main challenges presented by such developments is the effective use of powerful processors in shared memory multiprocessor system. We believe that the interconnection problem is not solved even for small scale shared memory multiprocessor, since the speed of shared buses is unlikely to keep up with the bandwidth requirements of new powerful processors. In the past few years, point-to-point unidirectional connection have emerged as a very promising interconnection technology. The single slotted ring is the simplest form point-to-point interconnection. The main limitation of the single slotted ring architecture is that latency of access increase linearly with the number of the processors in the ring. Because of this, we proposed the dual slotted ring as an alternative to single slotted ring for cache-based multiprocessor system. In this paper, we analyze the proposed dual slotted ring architecture using new snooping protocol and enforce simulation to compare it with single slotted ring.

  • PDF

A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System (RFID시스템에서 슬롯의 혼잡도를 이용한 DFS-ALOHA 알고리즘)

  • Lee, Jae-Ku;Choi, Seung-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.267-274
    • /
    • 2009
  • For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.

Tag Anti-Collision Algorithms in Passive and Semi-passive RFID Systems -Part II : CHI Algorithm and Hybrid Q Algorithm by using Chebyshev's Inequality-

  • Fan, Xiao;Song, In-Chan;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8A
    • /
    • pp.805-814
    • /
    • 2008
  • Both EPCglobal Generation-2 (Gen2) for passive RFID systems and Intelleflex for semi-passive RFID systems use probabilistic slotted ALOHA with Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti-collision algorithm. A better tag anti-collision algorithm can reduce collisions so as to increase the efficiency of tag identification. In this paper, we introduce and analyze the estimation methods of the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose two new tag anti-collision algorithms, which are Chebyshev's inequality (CHI) algorithm and hybrid Q algorithm, and compare them with the conventional Q algorithm and adaptive adjustable framed Q (AAFQ) algorithm, which is mentioned in Part I. The simulation results show that AAFQ performs the best in Gen2 scenario. However, in Intelleflex scenario the proposed hybrid Q algorithm is the best. That is, hybrid Q provides the minimum identification time, shows the more consistent collision ratio, and maximizes throughput and system efficiency in Intelleflex scenario.

Design and comparative study of various Two-Dimensional Grain Configurations based on Optimization Method

  • Nisar, Khurram;Liang, Guozhu
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.226-234
    • /
    • 2008
  • Grain design has always been a vital and integral part of Solid Rocket Motor(SRM) design. Basing on the design objectives set by the system designer, the SRM designer has many options available for selecting the Grain configuration. Many of the available configurations may fulfill the required parameters of volumetric loading fraction, web fraction & Length to diameter ratios and produce internal ballistic results that may be in accordance to the design objectives. However, for any given set of design objectives, it is deemed necessary that best possible configuration be selected, designed and optimized. Hence optimal results of all applicable configurations are vital to be attained in order to compare and finalize the design that will produce most efficient performance. Generally the engineers pay attention and have skills on a specific grain configuration. The designing methodologies and computer codes available usually focus on single grain configuration may it be Star, Wagon Wheel or slotted tube. Hardly one can find a software or a design methodology where all such configurations can be worked on jointly and not only adequate designs be found but optimal solutions reached by applying an optimization method to find final design best suited for any design objective. In the present work design requirements have been set, grain configurations have been selected and their designing has been conducted. The internal ballistic parameters have been calculated and after finding the preliminary design solutions, the optimal solutions have been found. In doing so, software has been developed comprising of computer programs for designing the 2D grains including Star, Wagon Wheel and Slotted Tube configurations. The optimization toolbox of Matlab Fmincon has been used for getting optimal solutions. The affects of all the independent geometric design variables on the optimized solutions have been analyzed. Based on results attained from Optimization Method, an in depth comparison of Grain Configurations and analysis of performance prediction outputs have been conducted to come to conclusion as to which grain configuration is ideal for the current design requirement under study.

  • PDF

A Distribution Scheme for Continuous Media Contens over Peer-to-Peer Networks (P2P 네트웍에서 연속형 미디어 컨텐츠의 분산형 배포 기법)

  • Kwon Jin Baek;Yeom Heon Young;Lee Jeong Bae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.511-520
    • /
    • 2004
  • A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming ca-pacity increases, called FAST.

An Analysis on Combustion Instability in Solid Rocket Motor of 230mm Grade (230mm급 고체 추진기관의 연소불안정 거동 현상 분석)

  • Kwon, Tae-Hoon;Rho, Tae-Ho;Suh, Hyuk
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2009.05a
    • /
    • pp.177-180
    • /
    • 2009
  • A Possibility of combustion instability on longitudinal mode has a high level at large scale of L/D. Solid propellant has a metal particle and a grain of control to pressure oscillation. Solid rocket motor in slotted-tube grain controls pressure oscillation of longitudinal mode. If slot length is shot, pressure oscillation of longitudinal mode is amplified by cylinder part after middle phase of total burn time. A study has analyzed pressure oscillation of longitudinal mode at spectrum and acoustic modal analysis at pressure of result on static firing test.

  • PDF

Tag Anti-Collision Algorithms in Passive and Semi-passive RFID Systems -Part I : Adjustable Framed Q Algorithm and Grouping Method by using QueryAdjust Command- (수동형/반능동형 RFID 시스템의 태그 충돌 방지 알고리즘 -Part I : QueryAdjust 명령어를 이용한 AFQ 알고리즘과 Grouping에 의한 성능개선-)

  • Song, In-Chan;Fan, Xiao;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8A
    • /
    • pp.794-804
    • /
    • 2008
  • In this paper, we analyze the performance of probabilistic slotted anti-collision algorithm used in EPCglobal Class-1 Generation-2 (Gen2). To increase throughput and system efficiency, and to decrease tag identification time and collision ratio, we propose new tag anti-collision algorithms, which are FAFQ (fired adjustable flamed Q) algorithm and AAFQ (adaptive adjustable framed Q) algorithm, by using QueryAdjust command. We also propose grouping method based on Gen2 to improve the efficiency of tag identification. The simulation results show that all the proposed algorithms outperform Q algorithm, and AAFQ algorithm performs the best. That is, AAFQ has an increment of 5% of system efficiency and a decrement of 4.5% of collision ratio. For FAFQ and AAFQ algorithm, the performance of grouping method is similar to that of ungrouping method. However, for Q algorithm in Gen2, grouping method can increase throughput and system efficiency, and decrease tag identification time and collision ratio compared with ungrouping method.