• Title/Summary/Keyword: PGPS

Search Result 6, Processing Time 0.029 seconds

Finite Element Analyses of Cylinder Problems Using Pseudo-General Plane Strain Elements(Planar Constraint) (유사 평면변형률 유한요소를 사용한 실린더 문제의 해석)

  • KWON YOUNG-DOO;KWON HYUN-WOOK;SHIN SANG-MOK;LEE CHAN-BOK
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.5 s.54
    • /
    • pp.66-75
    • /
    • 2003
  • Long cylinder, subjected to internal pressure, is important in the analysis and design of nuclear fuel rod structures. In many cases, long cylinder problems have been considered as a plane strain condition. However, strictly speaking, long cylinder problems are not plane strain problems, but rather a general plane strain (GPS) condition, which is a combination of a plane strain state and a uniform strain state. The magnitude of the uniform axial strain is required, in order to make the summation of the axial force zero. Although there has been the GPS element, this paper proposes a general technique to solve long cylinder problems, using several pseudo-general plane strain (PGPS) elements. The conventional GPS elements and PGPS elements employed are as follows: axisymmetric GPS element (GA3), axisymmetric PGPS element (PGA8/6), 2-D GPS element (GIO), 3-D PGPS element (PG20/16), and reduced PGPS elements (RPGA6, RPG20/16). In particular, PGPS elements (PGA8/6, PG20/16) can be applied in periodic structure problems. These finite elements are tested, using several kinds of examples, thereby confirming the validity of the proposed finite element models.

A Hierarchical Deficit Round-Robin Algorithm for Packet Scheduling (패킷 스케쥴링을 위한 결손 보완 계층적 라운드로빈 알고리즘)

  • Pyun Kihyun;Cho Sung-Ik;Lee Jong-Yeol
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.147-155
    • /
    • 2005
  • For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing(PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(log N) implementation complexity where N is the number of sessions.

Routing Algorithm for the Real-time Traffic Processing in the Internet (인터넷에서 실시간 트래픽 처리를 위한 라우팅 알고리즘)

  • 임철수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.181-181
    • /
    • 2000
  • We identified the performance problems of scheduling algorithms such as FCFS, and demonstrated the superiority of WFQ in terms of realtime performance measures. For this purpose, we presented the service scenario and performed the analysis for the delay bound and fairness which are required to support the realtime applications in the Internet.

  • PDF

A Hierarchical Round-Robin Algorithm for Rate-Dependent Low Latency Bounds in Fixed-Sized Packet Networks (고정크기 패킷 네트워크 환경에서 할당율에 비례한 저지연 한계를 제공하는 계층적 라운드-로빈 알고리즘)

  • Pyun Kihyun
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.254-260
    • /
    • 2005
  • In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.

A study of the GPS/Levelling in Jeju island using PGPS (제주지역에서 PGPS를 이용한 GPS 수준측량 적용)

  • 고인세;박준구;조진동;임영빈
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2004.04a
    • /
    • pp.3-8
    • /
    • 2004
  • This study describes the validation of the GPS/Levelling using GPS data that were obtained from three Permanent GPS stations of the Jeju island. Each orthometric height of three Permanent GPS stations was calculated from the Bench mark of levelling with Traverse-survey and relative baseline processing The test result shows that the error of closure of orthometric height was about 1.6cm and one of ellipsoidal height was about 1.5cm. This result represents that the geoidal height and undulations are regular in the Jeju island. According to the test results, it is identified that one can calculate the orthometric height using Permanent GPS station data rather than traditional levelling method which has a some complexity especially in Jeju island.

  • PDF

Mass Cultivation and Secondary Metabolite Analysis of Rhodobacter capsulatus PS-2 (광합성세균 Rhodobater capsulatus PS-2의 대량배양 최적화 및 대사산물 분석)

  • Bong, Ki Moon;Kim, Jong Min;Yoo, Jae-Hong;Park, In Chul;Lee, Chul Won;Kim, Pyoung Il
    • KSBB Journal
    • /
    • v.31 no.3
    • /
    • pp.158-164
    • /
    • 2016
  • Plant growth promoting (PGP) hormones, which are produced in a small quantity by bacteria, affect in plant growth and development. PGPs play an important role on the crop productivity in agricultural field. In this study, a photosynthetic bacterial strain producing the PGP was isolated from paddy soil. Bacterial isolate was gram negative, rod-shaped and motility positive. From the 16s rRNA gene sequence analysis, the isolate was identified as Rhodobacter capsulatus PS-2. The mass cultivation of R. capsulatus PS-2 was optimized by considering of the carbon, nitrogen and inorganic salt sources. Optimal medium composition was determined as Na-succinate 4.5 g, yeast extract 5 g, $K_2HPO_4$ 1 g, $MgSO_4$ 5 g, per liter. From the result of 500 L fermentation for 2 days using the optimal medium, the viable cells were $8.7{\times}10^9cfu/mL$. R. capsulatus PS-2 strain produced the carotenoid and indole-3-acetic acid (IAA). The carotenoid extraction and quantitative analysis were performed by HCl-assisting method. Total carotenoid contents from R. capsulatus PS-2 culture broth were measured as $7.02{\pm}0.04$ and $6.93{\pm}0.05mg/L$ under photoheterotrophic and chemoheterotrophic conditions, respectively. To measure the productivity of IAA, colorimetric method was employed using Salkowski reagent at optical density 535 nm. The results showed that the highest content of IAA was $197.44{\pm}5.92mg/L$ in the optimal medium supplemented with 0.3% tryptophan.