• Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.132-139
• /
• 2016

In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP) and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA) is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3108-3120
• /
• 2019

Point cloud is widely used in 3D applications due to the recent advancement of 3D data acquisition technology. Polygonal mesh-based compression has been dominant since it can replace many points sharing a surface with a set of vertices with mesh structure. Recent point cloud-based applications demand more point-based interactivity, which makes point cloud compression (PCC) becomes more attractive than 3D mesh compression. Interestingly, an exploration activity has been started to explore the feasibility of PCC standard in MPEG. In this paper, a new color attribute compression method is presented for point cloud data. The proposed method utilizes the spatial redundancy among color attribute data to construct a color palette. The color palette is constructed by using K-means clustering method and each color data in point cloud is represented by the index of its similar color in palette. To further improve the compression efficiency, the spatial redundancy between the indices of neighboring colors is also removed by marking them using a flag bit. Experimental results show that the proposed method achieves a better improvement of RD performance compared with that of the MPEG PCC reference software.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.527-559
• /
• 2017

The main motivation of this article is to generalized the concept of fuzzy ideals, (${\alpha},{\beta}$)-fuzzy ideals, (${\in},{\in}{\vee}q_k$)-fuzzy ideals of semigroups. By using the concept of $q^{\delta}_K$-quasi-coincident of a fuzzy point with a fuzzy set, we introduce the notions of (${\in},{\in}{\vee}q^{\delta}_k$)-fuzzy left ideal, (${\in},{\in}{\vee}q^{\delta}_k$)-fuzzy right ideal of a semigroup. Special sets, so called $Q^{\delta}_k$-set and $[{\lambda}^{\delta}_k]_t$-set, condition for the $Q^{\delta}_k$-set and $[{\lambda}^{\delta}_k]_t$-set-set to be left (resp. right) ideals are considered. We finally characterize different classes of semigroups (regular, left weakly regular, right weakly regular) in term of (${\in},{\in}{\vee}q^{\delta}_k$)-fuzzy left ideal, (${\in},{\in}{\vee}q^{\delta}_k$)-fuzzy right ideal and (${\in},{\in}{\vee}q^{\delta}_k$)-fuzzy ideal of semigroup S.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.1-6
• /
• 2014

Most of the previous algorithms focus on computing the convex hull for a set of points. In this paper, we present a method for approximating the convex hull for a set of spheres with various radii in discrete space. Computing the convex hull for a set of spheres is a base technology for many applications that study structural properties of molecules. We present a voxel map data structures, where the molecule is represented as a set of spheres, and corresponding algorithms. Based on CUDA programming for using the parallel architecture of GPU, our algorithm takes less than 40ms for computing the convex hull of 6,400 spheres in average.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.1
• /
• pp.113-121
• /
• 2003

This paper is concerned with some properties of stable domains and limit functions. Using the relationship between cycles of periodic stable domains and orbits of critical points and using the Sullivan theorem [19], we prove that the value of a constant limit function in some stable domain for a rational function f of degree at least two lies in the closure of the set of critical orbits of f.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.553-581
• /
• 2016

The purpose of this paper is to prove some fixed point theorems in a complete metric space equipped with a partial ordering using w-distances together with the aid of an altering functions and new functions of admissible type.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.375-388
• /
• 2013

In this paper, we introduce an iterative sequence for finding solution of a system of mixed equilibrium problems and the set of fixed points of a nonexpansive mapping in Hilbert spaces. Then, the weak and strong convergence theorems are proved under some parameters controlling conditions. Moreover, we apply our result to fixed point problems, system of equilibrium problems, general system of variational inequalities, mixed equilibrium problem, equilibrium problem and variational inequality.

• Journal of the Korean Society of Safety
• /
• v.12 no.3
• /
• pp.45-51
• /
• 1997

To evaluate the elastic-plastic fracture toughness by this modified offset method, the origin of J-R curve is set with drawing the blunting line on the maximum point of the negative crack growth and R curve is modified by adding the blunting factor of the experimented point on the R curve. The elastic-plastic fracture toughness $J_{IC]$ of A5083-H112 material by the modified offset method we 44kN/m on the smooth CT specimens.

• Asian Journal of Turfgrass Science
• /
• v.9 no.2
• /
• pp.131-136
• /
• 1995

The herb, shrub, understory and canopy strata, which arbitrarily delineated by size classes, were sampled separately. The former one were sampled by the pin-point quadrat method. And remaining three by size quadrats, diversity (H= =$\Sigma$ Pi log Pi) of of each stratum was estimated for each set of census data. Species diversity within a stratum was independent of sample plot size above a minimum cumulative area. Diversity based on plotless and plot samples could he determined by the same equation, and by pooling the data needed to estimate diversity of each stratum.