• The Journal of Korean Physical Therapy
• /
• v.22 no.5
• /
• pp.25-31
• /
• 2010

Purpose: The purpose of this study is to provide an efficient and scientific basis for muscle activity (%MVIC) of RA, EO, VL, HS muscles and balance in soccer players through dynamic lumbar stability exercise and static lumbar stability exercise. Methods: This study included 23 soccer players belonging to D University of J province who attended the program for 30 minutes at a time and three times a week for 4 weeks. Of these 13 attended the dynamic lumbar stability exercise (DLSE) program and 10 the static lumbar stability exercise (SLSE) program. The differences between the effects of the dynamic lumbar stability exercise program and static lumbar stability exercise program were analyzed. Results: To increase muscle activity (%MVIC) and balance (WPL), the dynamic lumbar stability exercise program was more effective than was the static lumbar stability exercise program. 1) The %MVIC of trunk muscle (RA &EO) and lower extremitys muscle (VL & HS) increased from before training to after training in the case of the participants who performed the dynamic lumbar stability exercise. 2) The whole path length (WPL) decreased from before the training to after the training. The 2 groups significantly differed in this regard. Conclusion: Dynamic lumbar stability exercise program helps to improve the balancing ability and muscle activity in a soccer players who requires both muscle activity and balance than does any other players.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.1
• /
• pp.140-148
• /
• 2004

A novel rapid prototyping (RP) process, a full-automated transfer type variable lamination manufacturing process (Full-automated VLM-ST) has been developed. In the full-automated VLM-ST process, a vacuum chuck and a rectilinear motion system transfer the EPS foam material in the form of the plate with two pilot holes to the rotary supporting stage. The supplied material is then cut into an automated unit shape layer (AUSL) with a desired width, a desired length, a desired slope on the side surface, and a pair of reference shapes, which is called the guide shape (GS)’, including two pilot holes in accordance with CAD data through cutting in two steps using a four-axis synchronized hotwire cutter. Then, each AUSL is stacked by setting each AUSL with two pilot holes in the building plate with two pilot pins, and subsequently, adhesive is applied onto the top surface of the stacked AUSL by a bonding roller and pressure is simultaneously given to the bottom surface of the stacked AUSL. Finally, three-dimensional shapes are rapidly and automatically fabricated. This paper describes the method to generate guide shapes in AUSL data for the full-automated VLM-ST process. In order to examine the applicability of the method to generate guide shapes, three-dimensional shapes, such as a piston shape and a human head shape, are fabricated from the full-automated VLM-ST apparatus.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.269-281
• /
• 2011

For the MD-TIX(multidimensional type inheritance index) that supports query processing for the type inheritance concept in XML databases, this paper presents an index tuning algorithm that enhances the performance of the XML query processing according to the query pattern. The MD-TIX uses a multidimensional index structure to support complex XML queries involving both nested elements and type inheritance hierarchies. In this index tuning algorithm, we first determine a shape of index page regions by using the query information about the user's query pattern, and then construct an optimal MD-TIX by applying a region splitting strategy that makes the shape of the page regions into the predetermined one. The performance evaluation results indicate that the proposed tuning algorithm builds an optimal MD-TIX by a given query pattern, and in the case of the three-dimensional query regions for the nested predicates of path length 2, the performance is much enhanced according to the skewed degree of the query region's shape.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 2003.11a
• /
• pp.136-136
• /
• 2003

In fiber optic networks, system size and cost can be significantly reduced by development of optical components through planar optical waveguides. One important step to realize the compact optical devices is to develop planar optical amplifier to compensate the losses in splitter or other components. Planar amplifier provides optical gain in devices less than tens of centimeters long, as opposed to fiber amplifiers with lengths of typically tens of meters. To achieve the same amount of gain between the planar and fiber optical amplifier, much higher Er doping levels responsible for the gain than in the fiber amplifier are required due to the reduced path length. These doping must be done without the loss of homogeniety to minimize Er ion-ion interactions which reduce gain by co-operative upconversion. Sol-gel process has become a feasible method to allow the incorporation of Er ion concentrations higher than conventional glass melting methods. In this work, Er-doped $SiO_2$-A1$_2$ $O_3$ films were prepared by two different method via sol -Eel process. Tetraethylorthosilicate(TEOS)/aluminum secondary butoxide [Al (OC$_4$ $H_{9}$)$_3$], methacryloxypropylcnethoxysaane(MPTS)/aluminum secondary butofde [Al(OC$_4$ $H_{9}$)$_3$] systems were used as starting materials for hosting Er ions. Er-doped $SiO_2$-A1$_2$ $O_3$ films obtahed after heat-treating, coatings on Si substrate were characterized by X-ray din action, FT-IR, and N-IR fluorescence spectroscopy. The luminescence properties for two different processing procedure will be compared and discussed from peak intensity and life time.

• Korean Institute of Interior Design Journal
• /
• v.19 no.6
• /
• pp.112-120
• /
• 2010

Human can recognize the environment by detecting spatial perception, and most of environmental perception depends on visual perception. In view that the acquisition of spatial information is accomplished through visual recognition, analysis of visual structure contained in the space is thought to be very important sector in studying the characteristic of the space. The history of studies on visual structure of space, however, wasn't too long, and furthermore most of the theories up to now focused on static and planar principles. Under this circumstance, this study is intended to suggest new theory by combining Isovist theory and VGA theory that have been actively discussed as the theory on visual perception-based spatial structure and supplementing them between each other to expand into 3-dimensional model. The suggested theory is a complex principle in dimensional and dynamic form in consideration of visual direction, which forms 3-dimentional virtual model that enables visualization of the property of spatial structure as the routine discriminating whether visual connection is made between viewing point and target point, and the target point is included in the visual field quadrangular pyramid or not. Such model was built up by an analysis application where four probe paths were applied to simulate the visual structure that occurs in virtual space, and then the characteristics were analyzed through quantification. In result, in spite of the path with equal space and equal length, significant difference in the acquired quantity of spatial information could be found depending on the probe sequence. On the contrary, it was found that probe direction may not affect the acquired quantity of information and visual property of the space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.168-177
• /
• 2005

In this paper, we numerically investigated the optimum pump light power resulting best compensation of pulse distortion due to both chromatic dispersion and self phase modulation (SPM) in long-haul 3×40 Gbps wavelength division multiplexing (WDM) systems. We used mid-span spectral inversion (MSSI) method with path-averaged intensity approximation (PAIA) as compensation approach, which have highly nonlinear dispersion shifted fiber (HNL-DSF) as nonlinear medium of optical phase conjugator (OPC) in the mid-way of total transmission line. We confirmed that HNL-DSF is an useful nonlinear medium in OPC for wideband WDM transmission, and in order to achieve the excellent compensation the pump light power is selected to equal the conjugated light power into the latter half fiber section with the input light power of WDM channel depending on total transmission length. Also we confirmed that compensation degree of WDM channel with small conversion efficiency is improved by using pump light power increasing power conversion ratio upper than 1.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.51-58
• /
• 2011

One of the objectives of research on routing methods in wireless sensor networks is maximizing the energy life of sensor nodes that have limited energy. In this study, we tried to even energy use in a wireless sensor network by giving a weight to the transition probability of ACS(Ant Colony System), which is commonly used to find the optimal path, based on the amount of energy in a sensor and the distance of the sensor from the sink. The proposed method showed improvement by 46.80% on the average in energy utility in comparison with representative routing method GPSR (Greedy Perimeter Stateless Routing), and its residual energy after operation for a specific length of time was 6.7% more on the average than that in ACS.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.8
• /
• pp.361-371
• /
• 2008

In this paper, the hypercube, hyperpetersen networks, whose degree is increasing in accordance with expansion of number of node and complete binary tree are one-to-one embedded into peterson-torus(PT) network which has fixed degree. The one-to-one embedding has less risk of overload or idle for the processor comparative to one-to-many and many-to-one embedding. For the algorithms which were developed on hypercube or hyperpetersen are used for PT network, it is one-to one embedded at expansion ${\doteqdot}1$, dilation 1.5n+2 and link congestion O(n) not to generate large numbers of idle processor. The complete binary tree is embedded into PT network with link congestion =1, expansion ${\doteqdot}5$ and dilation O(n) to avoid the bottleneck at the wormhole routing system which is not affected by the path length.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.476-484
• /
• 2008

Most string problems and their solutions are relevant to diverse applications such as pattern matching, data compression, recently bioinformatics, and so on. However, there have been few works on the relations between string problems and cryptographic problems. In this paper, we consider the following string reconstruction problems and show how these problems can be applied to cryptography. Given a string x of length n over a constant-sized alphabet ${\sum}$ and a set W of strings of lengths at most an integer $k({\leq}n)$, the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L is the sum of all lengths of strings in a given set, using suffix trees and a shortest path algorithm for directed acyclic graphs. The other is a dynamic version of the first problem and we propose an $O(k^3n+L)$-time algorithm. Finally, we show that exponentiation problems that arise in cryptography can be successfully reduced to these problems and propose a new solution for exponentiation.