• Communications of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.905-913
• /
• 2022

We characterize metrizability and submetrizability for point-open, open-point and bi-point-open topologies on C(X, Y), where C(X, Y) denotes the set of all continuous functions from space X to Y ; X is a completely regular space and Y is a locally convex space.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.433-440
• /
• 2002

In this paper, we first prove the existence of fixed points for fuzzy mappings that satisfy a certain contractive condition. Also, we give a fixed point theorem for generalized contractive fuzzy mapping by using Caristi's by fixed point theorem.

• The Pure and Applied Mathematics
• /
• v.14 no.1 s.35
• /
• pp.1-5
• /
• 2007

We study the topological magnitude of a special subset from the distribution subsets in a self-similar Cantor set. The special subset whose every element has no accumulation point of a frequency sequence as some number related to the similarity dimension of the self-similar Cantor set is of the first category in the self-similar Cantor set.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.2
• /
• pp.167-174
• /
• 2018

The heater is applied to the lunar lander for securing its survivability under severe lunar thermal environment during 14 days of night time. For this, the heater on/off set-points shall be determined to minimize the power consumption due to the limited power generation of lunar lander during night time. In addition, the temperature changes of the lander according to the heater set-point is also an important factor because it is related to thermo-mechanical reliability on solder joint of on-board electronics. In this study, we investigated thermo-mechanical reliability on solder joint according to the heater set-point by using commercial reliability and a life prediction tool of Sherlock based on the thermal analysis results of lunar lander that is a year of the mission lifetime.

• Journal of Power Electronics
• /
• v.18 no.2
• /
• pp.445-455
• /
• 2018

A novel algorithm is proposed to regulate the neutral point potential in neutral point clamped three-level inverters. Oscillations of the neutral point potential and an unbalanced dc-link voltage cause distortions of the output voltage. Large capacitors, which make the application costly and bulky, are needed to eliminate oscillations. Thus, the algorithm proposed in this paper utilizes the finite-control-set model predictive control and the multistage medium vector to solve these issues. The proposed strategy consists of a two-step prediction and a cost function to evaluate the selected multistage medium vector. Unlike the virtual vector method, the multistage medium vector is a mixture of the virtual vector and the original vector. In addition, its amplitude is variable. The neutral point current generated by it can be used to adjust the neutral point potential. When compared with the virtual vector method, the multistage medium vector contributes to decreasing the regulation time when the modulation index is high. The vectors are rearranged to cope with the variable switching frequency of the model predictive control. Simulation and experimental results verify the validity of the proposed strategy.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.31-39
• /
• 2001

Presented in this paper are algorithms to compute the positions of vertices and equations of edges of the Voronoi diagram of a circle set. The circles are located in a Euclidean plane, the radii of the circles are not necessarily equal and the circles are not necessarily disjoint. The algorithms correctly and efficiently work when the correct topology of the Voronoi diagram was given. Given three circle generators, the position of the Voronoi vertex is computed by treating the plane as a complex plane, the Z-plane, and transforming it into another complex plane, the W-plane, via the Mobius transformation. Then, the problem is formulated as a simple point location problem in regions defined by two lines and two circles in the W-plane. And the center of the inverse-transformed circle in Z-plane from the line in the W-plane becomes the position of the Voronoi vertex. After the correct topology is constructed with the geometry of the vertices, the equations of edge are computed in a rational quadratic Bezier curve farm.

• International Journal of CAD/CAM
• /
• v.11 no.1
• /
• pp.18-26
• /
• 2011

This paper proposes a new solid-shape modeling system based on a lusterware-image illustration. The proposed method reconstructs a three dimensional solid shape from a set of rough sketches that are typically drawn in the early stages of the design process. The sketches do not have to be strictly accurate, and this tolerance to the roughness of the input sketches is one of the major advantages of the proposed method. The proposed system creates an initial shape based on the silhouette of the input lusterware-images. Then the user can edit the initial shape with intuitive cutting and dishing-up operations, which are based on sketching user interface. To achieve the goal, the system retains the geometric model with two representations: a point-set data and a volume data. This dual data structure allows the program to create an initial shape from the input images with little computational cost, and the user can apply cutting and dishing-up operations without substantially increasing computational and memory requirements. In this research, we have tested the proposed system by reconstructing solid models of some mechanical parts from rough sketches. The experimental results indicate that the proposed method is useful for the prototyping of a solid shape.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.16 no.1
• /
• pp.31-49
• /
• 2012

In this paper, we propose a very efficient method which reconstructs the high resolution surface from a set of unorganized points. Our method is based on the level set method using adaptive octree. We start with the surface reconstruction model proposed in [20]. In [20], they introduced a very fast and efficient method which is different from the previous methods using the level set method. Most existing methods[21, 22] employed the time evolving process from an initial surface to point cloud. But in [20], they considered the surface reconstruction process as an elliptic problem in the narrow band including point cloud. So they could obtain very speedy method because they didn't have to limit the time evolution step by the finite speed of propagation. However, they implemented that model just on the uniform grid. So they still have the weakness that it needs so much memories because of being fulfilled only on the uniform grid. Their algorithm basically solves a large linear system of which size is the same as the number of the grid in a narrow band. Besides, it is not easy to make the width of band narrow enough since the decision of band width depends on the distribution of point data. After all, as far as it is implemented on the uniform grid, it is almost impossible to generate the surface on the high resolution because the memory requirement increases geometrically. We resolve it by adapting octree data structure[12, 11] to our problem and by introducing a new redistancing algorithm which is different from the existing one[19].

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.240-245
• /
• 1998

Fuzzy information retrieval which uses the concept of fuzzy relation is able to retrieve documents in the way based on not morphology but semantics, dissimilar to traditional information retrieval theories. Fuzzy information retrieval logically consists of three sets : the set of documents, the set of terms and the set of queries. It maintains a fuzzy relational matrix which describes the relationship between documents and terms and creates a thesaurus with fuzzy relational product. It also provides the user with documents which are relevant to his query. However, there are some problems on building a thesaurus with fuzzy relational product such that it has big time complexity and it uses fuzzy values to be processed with flating-point. Actually, fuzzy values have to be expressed and processed with floating-point. However, floating-point operations have complex logics and make the system be slow. If it is possible to exchange fuzzy values with binary values, we could expect sp eding up building the thesaurus. In addition, binary value expressions require just a bit of memory space, but floating -point expression needs couple of bytes. In this study, we suggest a new method of building a thesaurus, which accelerates the operation of the system by pre-applying an ${\alpha}$-cut. The experiments show the improvement of performance and reliability of the system.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.227-245
• /
• 2011

In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.