• Journal of Digital Convergence
• /
• 제14권11호
• /
• pp.357-367
• /
• 2016

In this study, we examined the impact on balance ability and jump performance of soccer players with functional ankle instability using virtual reality based neuromuscular posture control fusion training. Soccer players were divided into 15 people of virtual reality-based neuromuscular posture control fusion training group and 15 people of common treadmill training group and performed for 30 minutes three times a week for 8 weeks. In order to evaluate the balance of ability, using biorescue, it measured surface area, whole path length, limit of stability. In order to measure jump performance, it measured counter movement jump with arm swing and standing long jump. The results showed the statistically significant difference in the balance comparison of surface area, whole path length, limited of stability and the jump performance comparison of counter movement jump with arm swing, standing long jump. As a result, virtual reality-based neuromuscular posture control fusion training was found to be more effective to improve its balance ability and jump performance than common treadmill training.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제12권1호
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• Structural Engineering and Mechanics
• /
• 제11권2호
• /
• pp.199-210
• /
• 2001

Axially compressed circular cylinders repeat symmetry-breaking bifurcation in the postbuckling region. There exist stable equilibria with all symmetry broken in the buckled configuration, and the minimum postbuckling strength is attained at the deep bottom of closely spaced equilibrium branches. The load level corresponding to such postbuckling stable solutions is usually much lower than the initial buckling load and may serve as a strength limit in shell stability design. The primary concern in the present paper is to compute these possible postbuckling stable solutions at the deep bottom of the postbuckling region. Two computational approaches are used for this purpose. One is the application of individual procedures in computational bifurcation theory. Path-tracing, pinpointing bifurcation points and (local) branch-switching are all applied to follow carefully the postbuckling branches with the decreasing load in order to attain the target at the bottom of the postbuckling region. The buckled shell configuration loses its symmetry stepwise after each (local) branch-switching procedure. The other is to introduce the idea of path jumping (namely, generalized global branch-switching) with static imperfection. The static response of the cylinder under two-parameter loading is computed to enable a direct access to postbuckling equilibria from the prebuckling state. In the numerical example of an elastic perfect circular cylinder, stable postbuckling solutions are computed in these two approaches. It is demonstrated that a direct path jump from the undeformed state to postbuckling stable equilibria is possible for an appropriate choice of static perturbations.

• Korean Journal of Optics and Photonics
• /
• 제5권2호
• /
• pp.217-224
• /
• 1994

The combination of both phase-shifting convolution and 2-bit quantization smoothing filter was used to reduce speckle noise from saw-tooth speckle fringes phase map, obtained in phase-shifting speckle interferometer. The phase-shifting convolution showed the noise reduction capability of speckle fringe without destroying edge information across 271 jump. Also, it was shown that the 2-bit quantization smoothing filter was superior to average, low-pass filter and median filter in speeding up smoothing process and enhancing SIN ratio. Finally, a path dependent unwrapping algorithm was used to unwrap a noise reduced 271 modulo speckle phasemap. semap.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• 제34S권6호
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.59-62
• /
• 2000

In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

• Journal of the Korean Ceramic Society
• /
• 제32권11호
• /
• pp.1292-1300
• /
• 1995

The ionic conductivity of NASICON solid electrolytes was simulated by using Monte Carlo Method (MCM). There were included two conduction paths: (1) Na1-Na2 and (2) Na1-Na2 including Na2-Na2. We assumed that mid-Na ions provde an additional driving force for Na mobile ions due to the interionic repulsion between Na1 and Na2 ions. The inflection point of vacancy availability factor, V has been shown at nearby x=2, the maximum mid-Na ions. The inflection point of vacancy availability factor, V has been shown at nearby x=2, the maximum mid-Na sites are occupied. The effective jump frequency factor, V has been shown at nearby x=2, the maximum mid-Na sites are occupied. The effective jump frequency factor, W increased rapidly with the composition at low temperature, but decreased at high temperature region. On Na1-Na2 conduction path, the minimum of charge correlation factor, fc and the maximum of $\sigma$T were appeared at x=2.0. this indicated that mid-Na ions affect on the high ionic conductivity behavior. At the whole range of NASICON composition, 1n $\sigma$T vs. 1/T* plots have been shown Arrhenius behavior but 1n (VWFc) vs. 1/T* have been shown the Arrhenius type tendency at x=2, which mid-Na is being the maximum. The results of MCM agreed with the experimental one when the chosen saddle point value was 6$\varepsilon$ : 3$\varepsilon$. Here the calculated characteristic parameter of materials, K and the phase transition temperature were -4.001$\times$103 and 178$^{\circ}C$ (1/T*=1.92, 1000/T=2.22), respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.869-874
• /
• 2004

The inverse kinematics of five-axis milling machines produce large errors near stationary points of the required surface. When the tool travels cross or around the point the rotation angles may jump considerably leading to unexpected deviations from the prescribed trajectories. We propose three new algorithms to repair the trajectories by adjusting the rotation angles in such a way that the kinematics error is minimized. Given the tool orientations and the inverse kinematics of the machine, we first eliminate the jumping angles exceeding ${\pi}$ by using the angle adjustment algorithm, leaving the jumps less than ${\pi}$ to be further optimized. Next, we propose to apply an angle switching algorithm to compute the rotations and identify an optimized sequence of rotations by the shortest path scheme. Further error reduction is accomplished by the angle insertion algorithm based an o special interpolation to obtain the required rotations near the singularity. We have verified the algorithms by five-axis milling machines, namely, MAHO600E at the CIM Lab of Asian Institute of Technology and HERMLE UWF902H at the CIM Lab of Kasetsart University.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.160-163
• /
• 1993

In this paper, design of an automatic grinding robot system for car brazing bead is introduced. Car roof and side panels are joined using brazing, and then the brazing bead is processed so that the bead is invisible after painting. Up to now the grinding process is accomplished manually. The difficulties in automation of the grinding process are induced by variation of position and shape of the bead and non-uniformity of the grinding area due to surface deformation. For each car, the grinding area including the brazing bead is sensed and then modeled using a 2-D optical sensor system. Using these model data, the position and the direction of discrete points on the car, body surface are obtained to produce grinding path for a 6 degrees of freedom grinding robot. During the process, it is necessary to sense the reaction forces continuously to prepare for the unexpected circumstances. In addition, to meet the line cycle time it is necessary to reduce the required time in sensing, signal processing, modeling, path planning and data transfer by utilizing real-time communication of the information. The key technique in the communication and integration of the complex information is obtaining in-field reliability. This automatic grinding robot system may be regarded as a jump in the intelligent robot processing technique.

• International Journal of Aeronautical and Space Sciences
• /
• 제11권4호
• /
• pp.326-337
• /
• 2010

This work addresses problems regarding trajectory planning for unmanned aerial vehicle sensors. Such sensors are used for taking measurements of large nonlinear systems. The sensor investigations presented here entails methods for improving estimations and predictions of large nonlinear systems. Thoroughly understanding the global system state typically requires probabilistic state estimation. Thus, in order to meet this requirement, the goal is to find trajectories such that the measurements along each trajectory minimize the expected error of the predicted state of the system. The considerable nonlinearity of the dynamics governing these systems necessitates the use of computationally costly Monte-Carlo estimation techniques, which are needed to update the state distribution over time. This computational burden renders planning to be infeasible since the search process must calculate the covariance of the posterior state estimate for each candidate path. To resolve this challenge, this work proposes to replace the computationally intensive numerical prediction process with an approximate covariance dynamics model learned using a nonlinear time-series regression. The use of autoregressive time-series featuring a regularized least squares algorithm facilitates the learning of accurate and efficient parametric models. The learned covariance dynamics are demonstrated to outperform other approximation strategies, such as linearization and partial ensemble propagation, when used for trajectory optimization, in terms of accuracy and speed, with examples of simplified weather forecasting.