• Title/Summary/Keyword: Load-sharing

Search Result 400, Processing Time 0.029 seconds

A Comparative Study of Structural Analysis on DCM Improved by Pile and Block Type (말뚝식과 블록식이 혼합된 시멘트혼합처리공법(DCM)의 구조체 해석 비교 연구)

  • Shin, Hyun Young;Kim, Byung Il;Kim, Kyoung O;Han, Sang Jae
    • Journal of the Korean Geotechnical Society
    • /
    • v.30 no.4
    • /
    • pp.5-19
    • /
    • 2014
  • In this study, the structural analysis is performed on the method of shallow block and deep cement mixing pile, and then their characteristics and associated behaviors were analyzed. In the case of continuous beam analysis, the predicted settlement was very small, and shear force and bending stress are somewhat overestimated. The frame method is similar to numerical analysis in the internal force shallow block and long pile, but because the settlement of pile is underestimated, the additional calculation using the reaction of the long pile is necessary. For soil arching method and piled raft foundation method, the excessive axial force of long pile was predicted because the load sharing of pile is very large compared to the other methods. In the behavior of the shallow block and deep pile method, the settlement of shallow block and contact pressure are much in the center than the edge. In the estimating method considering the interaction between improved material and ground, the load sharing of the soil-cement pile ranges from 20% to 45%, and the stress ratio is 2.0~5.0 less than piled DCM. The maximum member forces at the boundary conditions of pile head are similar, but in fixed head the axial force and vertical displacement are different in accordance with pile arrangement.

Maximizing Bandwidth Utilization by Sharing Method of SSID Hiding in Multiple Wireless Routers (다중 무선 공유기에서 SSID Hiding 공유 기법을 이용한 대역폭 이용률 극대화)

  • Yoon, Young-Hyo;Kim, Myung-Won;Kwak, Hu-Keun;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.15C no.2
    • /
    • pp.111-118
    • /
    • 2008
  • A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select any one of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on SSID(Service Set IDentifier) hiding. The proposed scheme keeps checking the available bandwidth of all the possible wireless routers in a time interval and select the most available one. If a new client appears, the most available router is visible to him or her whereas the others are not visible. This is handled by SSID hiding in the proposed scheme. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

Study on the Effectiveness of Preloading Method on Reinforcement of the Pile Foundation by 3D FEM Analysis (3차원 수치해석을 이용한 공동주택 수직증축용 기초 보강 선재하공법 효과 분석)

  • Wang, Cheng-Can;Han, Jin-Tae;Jang, Young-Eun;Ha, Ik-Soo;Kim, Seok-Jung
    • Journal of the Korean Geotechnical Society
    • /
    • v.34 no.1
    • /
    • pp.47-57
    • /
    • 2018
  • In recent years, vertical extension remodeling of apartment building is considered as one of the efficient ways to broaden and enhance the utilization of existing buildings due to the rapid development of population and decrement of land resources. The reinforcement of foundation is of great importance to bearing the additional load caused by the added floors. However, because of the additional load, the carried load by the existing piles would be in excess of its allowable bearing capacity. In this study, a conceptual construction method called preloading method was presented. The preloading method applies force onto the reinforcing pile before vertical extension construction. The purpose of preloading is to transfer partial load applied on the existing piles to reinforcing piles in order to keep each pile not exceeding the allowable capacity and to mobilize resistance of reinforcing pile by developing relative settlement. The feasibility and effect of preloading method was investigated by using finite numerical method. Two simulation models, foundation reinforcement with preloading and without preloading, were developed through PLAXIS 3D program. Numerical results showed that the presented preloading method is capable of sharing partial carried load of existing pile and develops the mobilization of reinforcing pile's frictional resistance.

A Study on Reactive Congestion Control with Loss Priorities in ATM Network (ATM 네트워크에서 우선권을 갖는 반응 혼잡 제어에 관한 연구)

  • Park, Dong-Jun;Kim, Hyeong-Ji
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.697-708
    • /
    • 1996
  • In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

  • PDF

A Dynamic Transaction Routing Algorithm with Primary Copy Authority (주사본 권한을 이용한 동적 트랜잭션 분배 알고리즘)

  • Kim, Ki-Hyung;Cho, Hang-Rae;Nam, Young-Hwan
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1067-1076
    • /
    • 2003
  • Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

Analysis of Load-Settlement Behaviour Characteristics of Granular Compaction Piles from the Model Tests (모형실험에 의한 조립토 다짐말뚝의 하중-침하 관련 거동특성 분석)

  • Kim, Hong-Taek;Kang, Yun
    • Journal of the Korean GEO-environmental Society
    • /
    • v.5 no.4
    • /
    • pp.33-45
    • /
    • 2004
  • In the present study, more systematic laboratory model tests under various conditions are carried out to investigate load-sharing characteristics among the granular pile and adjacent soils and bearing capacity characteristics with different pile lengths. Further to evaluate effects of both a loading area and a spacing of pile installation on the bearing capacity and bearing capacity characteristics of each pile in group, model test results are also analyzed for the purpose of an efficient design of granular compaction piles. From the analysis of the model test results, it is found that the ultimate capacity of granular compaction group piles increases with a decrease in the installation distance among granular piles. It is also found that the dominant failure mode of the granular compaction piles is bulging failure. It is further realized that the length of a granular pile could not significantly affect on the ultimate granular pile capacity.

  • PDF

Providing survivability for virtual networks against substrate network failure

  • Wang, Ying;Chen, Qingyun;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4023-4043
    • /
    • 2016
  • Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.

Effects of Dietary formulated feed Additive on Growth Performance and Carcass Traits in Hanwoo Steers (반추위 발효 조절 항생제 대체 물질이 한우 거세우 생산성과 육질특성에 미치는 영향)

  • Ryu, Chaehwa;Park, Hae-Ryoung;Cho, Sangbuem;Choi, Nag-Jin
    • Korean Journal of Organic Agriculture
    • /
    • v.24 no.4
    • /
    • pp.869-879
    • /
    • 2016
  • The present study was conducted to evaluate the effects of dietary formulated feed additive on growth performance and carcass traits of Hanwoo steers. A formulated feed additive reported to reduce heat load in the rumen in our previous research was used (Cho et al., 2014). Total 32 herds of Hanwoo steers were assigned into two groups of control and treatment. Total mixed ration was provided as basal diet for cattle and 100 g of additive was supplemented on diet for treatment. Feeding trial was performed during 120 days before slaughter. For growth performance, 3 periods (0~90 days; 90~120 days; 0~120 days) were allotted and average daily gain, feed requirement and final body weight were determined. Loin meat between $12^{th}$ and $13^{th}$ rib was used for meat quality analysis after slaughtering. Only $1^{st}$ period showed significantly improved growth performance of treatment (P<0.05) and there were no significant difference in other periods. At $3^{rd}$ periods (overall), a trend of increased average daily gain was found at treatment (P=0.075). Carcass performance and quality did not show significant differences between treatment and control (P>0.05). In meat quality, treatment showed significant increment in all measured meat colors (P<0.05) and significantly less sharing force compared to the control (P<0.05). Although no significant difference in growth performance and carcass yield were found, remarkably improved economic status was detected in treatment group. In conclusion, it could be suggested that application of a formulated feed additive specialized in reduction of heat load in the rumen was able to increase economical balance through enhancing heat stress condition of ruminant and growth.

A Study of Music Recommendation System in P2P Network using Collaborative Filtering (P2P 환경에서 협업 필터링을 이용한 음악 추천 시스템에 대한 연구)

  • Won, Hee-Jae;Park, Kyu-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1338-1346
    • /
    • 2008
  • In this paper, we propose a new P2P-based music recommendation system. In comparison with previous system in client-server environment, the proposed system shows higher quality of music recommendation through real-time sharing of music preference information between peers. A collaborative filtering is implemented as a recommendation algorithm. As a user preference profile, we use the inherit KID music genre index contained in all legitimate music file instead of music feature vectors as in previous research so that the proposed system can mitigate the performance degradation and high computational load caused by feature inaccuracy and feature extraction. The performance of the proposed system is evaluated in various ways with real 16-weeks transaction data provided by Korean music portal, 5 company and it shows comparative quality of recommendation with only small amount of computational load.

  • PDF

Performance Analysis of a NOW According to the Number of Processes and Execution Time (프로세스의 수와 실행시간에 따른 NOW의 성능 분석)

  • 조수현;김영학
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.3
    • /
    • pp.135-145
    • /
    • 2002
  • Recently, instead of a high-cost supercomputer, there haws been widely used a NOW system that consists of low-cost PCs and workstations connected all over the network In a NOW, performance for parallel processing depends on the computation pouter of each computer and communication time. Currently, a lot of methods have been proposed in order to increase the performance of parallel processing. However, the previous results have been studied in the view of balancing work load as the computation pouter of each computer. If a computer has multiple work precesses in a NOW, we can predict a decrease of communication tire needed in message passing, Therefore, in this paper, we analyzes factors of improving the performance in the view of work precesses, and evaluates experimently an effect on total performance as the number of work processes increases. Also, we propose a new broadcasting method to be used in experiment of this paper. This paper uses the LAM/MPI for an experimental evaluation.

  • PDF