• PNF and Movement
• /
• v.11 no.2
• /
• pp.49-56
• /
• 2013

Purpose : The purpose of this study was compared for rounded scapular between strechting on pectoralis minoor and strengthening on scapular stabilizer muscles. Methods : The main laboratory had an experiment of the exercise for rounded shoulder posture with 30 patients on a pectoralis minor stretching and scapula to stabilize the elastic band to divide into two groups in this study which were conducted. Results : Acromial height measured from changes of the rounded shoulder posture changes before and after workouts; stretching before exercise in the exercise group is from $94.19{\pm}3.47$ to after result of $94.84{\pm}3.19$, and the after exercise of an elastic band pre-exercise in the exercise group is from $93.60{\pm}3.42$ to $88.68{\pm}3.49$, dividing into two groups, which increased significantly. Compared to an acromial height variation results before and after workouts; stretching exercise group made $3.07{\pm}1.43$, $4.91{\pm}2.24$ and elastic band exercise group, $4.91{\pm}2.24$, which shows the difference between the two groups and was not statistically significant. Conclusion : Against a pectoralis minor that cause the findings of this study, RSP proximately shows serratus anterior and the strengthening of trapezius by exercises of the shoulder peaks which decrease in height arbitration scheme of a pectoralis minor stretching effect as shown. Therefore, it is expected RSP patients in clinical intervention methods combined with stretching exercises strengthens muscles against an elastic band exercise effective.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.25-33
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.