• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.339-350
• /
• 2006

The bifurcation point where a satellite component buds from another component is characterized by the existence of the common tangent line between the two osculating components appearing in the degree-n bifurcation set. We investigate the existence, location and number of bifurcation points for satellite components budding from the main component in the degree-n bifurcation set as well as a parametric boundary equation of the main component of the degree-n bifurcation set. Cusp points are also located on the boundary of the main component. Typical degree-n bifurcation sets and their components are illustrated with some computational results.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.151-156
• /
• 2012

The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.17-22
• /
• 2009

In this paper, we discuss two fundamental issues of hybrid scene representation: constructing and rendering. A hybrid scene consists of triangular meshes and point-set models. Consider the maturity of modeling techniques of triangular meshes, we suggest that generate a point-set model from a triangular mesh might be an easier and more economical way. We improve stratified sampling by introducing the concept of priority. Our method has the flexibility that one may easily change the importance criteria by substituting priority functions. While many works were devoted to blend rendering results of point and triangle, our work tries to render point-set models and triangular meshes as individuals. We propose a novel way to eliminate depth occlusion artifacts and to texture a point-set model. Finally, we implement our rendering algorithm with the new features of the shader model 4.0 and turns out to be easily integrated with existing rendering techniques for triangular meshes.

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

An efficient and robust algorithm to compute the exact Voronoi diagram of a circle set is presented. The circles are located in a two dimensional Euclidean space, the radii of the circles are non-negative and not necessarily equal, and the circles are allowed to intersect each other. The idea of the algorithm is to use the topology of the point set Voronoi diagram as a seed so that the correct topology of the circle set Voronoi diagram can be obtained through a number of edge flipping operations. Then, the geometries of the Voronoi edges of the circle set Voronoi diagram are computed. In particular, this paper discusses the topological aspect of the algorithm, and the following paper discusses the geometrical aspect. The main advantages of the proposed algorithm are in its robustness, speed, and the simplicity in its concept as well as implementation. Since the algorithm is based on the result of the point set Voronoi diagram and the flipping operation is the only topological operation, the algorithm is always as stable as the Voronoi diagram construction algorithm of a point set.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.4
• /
• pp.279-288
• /
• 2023

We obtain a Chandrabhan type fixed point theorem for a multimap having a non-compact domain and a weakly closed graph, and taking convex values only on a quasi-convex subset of Hausdorff locally convex topological vector space. We introduce the definition of Chandrabhan-set and find a sufficient condition for every countably condensing multimap to have a relatively compact Chandrabhan-set. Finally, we establish a new version of Sadovskii fixed point theorem for multimaps.

• The Korean Journal of Food And Nutrition
• /
• v.31 no.2
• /
• pp.272-277
• /
• 2018

This research was conducted to elucidate the optimum conditions for the antibacterial activity of konjak jelly using the evolutionary operation-factorial design technique. In the first set of experiments, concentration of a coagulation agent, soaking liquid, and temperature of water were set to 0.4%, $0.6{\times}10^{-2}N$, and $65^{\circ}C$ as a central point, respectively. The highest antibacterial activity was acquired at E21, in which the number of bacteria was 1.25 log cfu/g. Because the code of changes in the main effect was (-), it could be decided that the central point of the first set was not the optimum point. Although antibacterial activity in the second set was improved, the values of the main effect were higher than that of changes in the mean effect. The central point of third set was concentration of coagulation agent 0.8%, concentration of soaking liquid $1.0{\times}10^{-2}N$, and temperature of water $65^{\circ}C$. It was found that the antibacterial activity of central point in the third set was highest among all the tested set. Further, all the necessary conditions were appropriate to reach the optimum condition. The antibacterial activity of the central point in third set was more than 1,000 times higher than that of E11, in first set.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.155-165
• /
• 2020

In this paper, we propose a smart thermostat temperature set-point control method based on machine learning and rule engine, which controls thermostat's temperature set-point so that it can achieve energy savings as much as possible without sacrifice of occupants' comfort while users' preference usage pattern is respected. First, the proposed method periodically mines data about how user likes for heating (winter)/cooling (summer) his or her home by learning his or her usage pattern of setting temperature set-point of the thermostat during the past several weeks. Then, from this learning, the proposed method establishes a weekly schedule about temperature setting. Next, by referring to thermal comfort chart by ASHRAE, it makes rules about how to adjust temperature set-points as much as low (winter) or high (summer) while the newly adjusted temperature set-point satisfies thermal comfort zone for predicted humidity. In order to make rules work on time or events, we adopt rule engine so that it can achieve energy savings properly without sacrifice of occupants' comfort. Through experiments, it is shown that the proposed smart thermostat temperature set-point control method can achieve better energy savings while keeping human comfort compared to other conventional thermostat.

• The Pure and Applied Mathematics
• /
• v.28 no.3
• /
• pp.253-266
• /
• 2021

In this paper, we generalize the notion of comparable set-valued mappings by introducing two types of 𝓡-closed set-valued mappings and utilize these to obtain an analogue of celebrated Mizoguchi and Takahashi fixed point theorem in relational metric spaces. To annotate the claims and usefulness of such findings, we prove fixed point results for both set-valued and single-valued mappings and validate the assertions with the help of examples. In this way, these investigations extend, modify and generalize some prominent recent fixed point results obtained by Tiammee and Suantai [24], Amini-Harandi and Emami [4], Prasad and Dimri [19] and several others in the settings of relational metric spaces.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.411-417
• /
• 2005

We present a method to reconstruct a canal surface from a point cloud (a set of unorganized points). A canal surface is defined as a swept surface of a moving sphere with varying radii. By using the shrinking and moving least-squares methods, we reduce a point cloud to a thin curve-like point set which can be approximated to the spine curve of a canal surface. The distance between a point in the thin point cloud and a corresponding point in the original point set represents the radius of the canal surface.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.195-205
• /
• 2024

In this paper, we consider the set of periodic shadowable points for homeomorphisms of a compact metric space, and we prove that this set satisfies some properties such as invariance and being a G_δ set. Then we investigate implication relations related to sets consisting of shadowable points, periodic shadowable points and uniformly expansive points, respectively. Assume that the set of periodic points and the set of periodic shadowable points of a homeomorphism on a compact metric space are dense in X. Then we show that a homeomorphism has the periodic shadowing property if and only if so is the restricted map to the set of periodic shadowable points. We also give some examples related to our results.