• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.8
• /
• pp.104-111
• /
• 2009

In this paper, the gear design program is presented. The profile of gears is created using classical mathematic formulations. In each gear, a kinematic joint is applied and one can define the 20 contact condition between gear pairs. Initial and boundary conditions such as force, torque, velocity, acceleration, etc. can be set. Thus, it is possible to analyze dynamic characteristics of gear pairs such as reaction moment and the variation of angular velocity. In order to find the optimal profile of gear pairs, two optimization methods based on design of experiments are inserted in the program; One is the Taguchi method and the other is the response surface analysis method. To verify the program, the rack & pinion gear is created and analyzed. Simulation results show that the developed program is useful and result data is reliable.

• The Bulletin of The Korean Astronomical Society
• /
• v.45 no.1
• /
• pp.61.1-61.1
• /
• 2020

We examine the HI gas kinematics and distribution of galaxy pairs in group or cluster environment from high-resolution Australian Square Kilometre Array Pathfinder (ASKAP) WALLABY pilot observations. We use 22 well-resolved galaxies in the Hydra cluster of which 4 galaxies are visually identified as pairs and others are isolated ones. We perform profile decomposition of HI velocity profiles of the galaxies using a new tool, BAYGAUD which enables us to separate a line-of-sight velocity profile into an optimal number of Gaussian components based on Bayesian MCMC techniques. All the HI velocity profiles of the galaxies are decomposed into kinematically cold or warm gas components with their velocity dispersion, 4~8 km/s or > 8 km/s, respectively. We derive the mass fraction of the kinematically cold gas with respect to the total HI gas mass, f = log10(M_cold / M_HI), of the galaxies and correlate them with their dynamical mass. The cold gas reservoir of the paired galaxies in the Hydra cluster is found to be relatively higher than that of the isolated ones which show a negative correlation with the dynamical mass in general.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.165-172
• /
• 2012

The query of the K closest object pairs between two object sets frequently occurs at recently retrieval systems. The circular location property of objects should be considered for efficiently process queries finding such a K nearest object pair. In this paper, we propose the optimal algorithm finding the K object pairs which are closest to each other in a search space with a circular domain and show its performance by experiments. The proposed algorithm optimizes the cost of finding the K nearest object pairs by using the circular search distances which is much applied the circular location property.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.12-17
• /
• 2009

We consider an OFDM based multiple AF relaying systems. Since the channel between first hop (source station-relay station) and second hop (relay station -destination station) varies independently, the subcarrier in the first hop can be paired to another subcarrier in the second hop for the increase of the system capacity. The conventional pairing which uses the brute force searching requires large complexity while giving optimal pairing for maximum system capacity. In this paper, we present sub-optimal subcarrier pairing scheme with low complexity. Every RS firstly pairs the subcarrier with the highest channel gain in the first hop to the subcarrier with highest channel gain in the second hop. The pair with the highest SNR among all the pairs is determined as final selected pair and the corresponding subcarriers are not selected at other RSs in the next paring iteration. This process is repeated until all the subcarriers are paired. Simulation results show the proposed pairing scheme achieves near optimal performance with low complexity.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.285-292
• /
• 2000

A new method for the 3D automatic registration of the multiple range images has been developed for the 3D scanners(non-contact coordinates measurement systems). In the existing methods, the user usually has to input more than 3 pairs of corresponding points for the iterative registration process. The major difficulty of the existing systems lies in that the input corresponding points must be selected very carefully because the optimal searching process and the registration results mostly depend upon the accuracy of the selected points. In the proposed method, this kind of difficulty is greatly mitigated even though it needs only 2 pairs of the corresponding input points. Several registration examples on the 3D measured data have been presented and discussed with the introduction to the proposed algorithm.

• Proceedings of the Korean Institute of Surface Engineering Conference
• /
• 2005.11a
• /
• pp.179-180
• /
• 2005

Non linear finite element analyses were performed in various configurations of stem-ball head. High stresses were found for the cases when the stem tended to penetrate less into the ball head. An upgraded design of the cone may improve the loading of the ball head to resist trauma-like loading more effectively than manipulating the ball diameter. When the surgeon needs to use small ball heads (i.e. 22 mm), the use of zirconia seems to be appropriate also. After simulating a trauma like loading of the materials, it was found that the deepness of the cone to locate the stem is of major importance for the performance of the device. Further work, considering more sizes for the cone design should be performed in order to determine an optimal depth for the cone in relation to the diameter of the ball head. Also the simulation of contacts pairs including polyethylene and CoCr is important for further research.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.582-584
• /
• 2019

In this paper, dispersion-managed optimal link configuration with the repetitive distribution of the pairs of residual dispersion per span, in which optical phase conjugator placed at midway, is proposed. It is confirmed that the proposed optical link configuration is better than the conventional dispersion-managed link for the performance improvement of wavelength division multiplexed channels.

• Spatial Information Research
• /
• v.17 no.4
• /
• pp.455-462
• /
• 2009

A method to find the nearly optimal PSNR values for compression was tried to remotely sensed images. There is no rule to find the best wavelet pairs for image processing. The expected wavelet pairs following the suggested algorithm showed the optimal result for various kinds of images. Firstly, the PSNR variations with three wavelet families were analyzed. In many cases the longer wavelet filter shows the higher PSNR value, but the rate is getting less in orthogonal wavelet families. Wavelets with moderate filter length are suggested at the point of computational cost. For biorthogonal families it was hard to predict from the length of filters. Multiresolution wavelet analysis was used up to level 3 with three kinds of wavelet families. Biorthogonal wavelet family showed irregular pattern to get the maximum PSNR values, while orthogonal wavelet families showed regular pattern. In orthogonal wavelet families the nearly optimal wavelet pair can be predicted from the level 1.