• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.655-659
• /
• 2004

In this literature, the selection of data set among the universe set is carried out with the fuzzy entropy function. By the definition of fuzzy entropy, the fuzzy entropy function is proposed and the proposed fuzzy entropy function is proved through the definition. The proposed fuzzy entropy function calculate the certainty or uncertainty value of data set, hence we can choose the data set that satisfying certain bound or reference. Therefore the reliable data set can be obtained by the proposed fuzzy entropy function. With the simple example we verify that the proposed fuzzy entropy function select reliable data set.

• Industrial Engineering and Management Systems
• /
• v.10 no.3
• /
• pp.221-231
• /
• 2011

One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have been few exact approaches. In this paper, we suggest an improved optimal algorithm for the minimum connected dominating set problem, and extensive computational results showed that our algorithm outperformed the previous exact algorithms. Also, we suggest a new heuristic algorithm to find the connected dominating set and computational results show that our algorithm is capable of finding good quality solutions quite fast.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.183-187
• /
• 2003

In this paper, we describe an implementation method of "set constraints logic language" using the logic language Prolog. "Set constraints logic language" is a programming language with a new paradigm that uses the "set theory" in programming. In this paper, we explain "set constraints problem solver" that has been proposed by A. Dovier and his researchers and we describe an implementation method of this solver using Prolog. We ran easily implement the "set constraints problem solver" in Prolog, since Prolog easily implements nondeterministic problems and provides a data structure railed list. We have applied the language to several application fields to show the usefulness of the language.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• Honam Mathematical Journal
• /
• v.27 no.3
• /
• pp.405-419
• /
• 2005

We present some properties characterizing the Mandelbrot set of quadratic rational maps. Any quadratic rational map is conjugate to either $z^2+c$ or ${\lambda}(z+1/z)+b$. For ${\mid}{\lambda}{\mid}=1$, we find the figure of the Mandelbrot set $M_{\lambda}$, the set of parameters b for which the Julia set of ${\lambda}(z+1/z)+b$ is connected. It is seen to be the whole complex plane if ${\lambda}{\neq}1$, but it is intricate fractal if ${\lambda}=1$. This supplements the work already investigated for the case ${\mid}{\lambda}{\mid}>1$.

• International Journal of Aerospace System Engineering
• /
• v.2 no.2
• /
• pp.73-78
• /
• 2015

According to the characteristic of carrier-based aircraft, the method of solving safe set during arresting landing is discussed in this paper based on optimal control and invariant set theory. The safe sets of carrier aircraft are evaluated in different states on the characteristic of longitudinal augmented system by using the level set method. Then, the influence on the boundary of safe set under various factors is analyzed. At last, the maneuverability envelope protection is established based on the corresponding theory, and the validity of the system is verified through simulation. The results demonstrate preliminarily that: compared with mass and thrust, the elevator is the greatest influence factor for the boundary of safe set; the dynamic trajectory of carrier-based aircraft can be located at the interior of safe set effectively with the maneuverability envelope protection.

• Nuclear Engineering and Technology
• /
• v.25 no.3
• /
• pp.457-469
• /
• 1993

JEF-1-based 50-group cross section set for fast reactor calculations was generated using NJOY system. The set was then examined by analyzing measured integral quantities such as criticality and central reaction rate ratios for 27 fast critical assemblies. The calculated results using the new set were also compared with those of ENDF/B-IV or-V-based fast set. In general, the JEF-1-based set shows an improvement in predicting measured integral quantities in comparison with the previous set. With a few exceptions, JEF-1 results are comparable to those of ENDF/B-V.

• Review of KIISC
• /
• v.7 no.3
• /
• pp.23-38
• /
• 1997

SET은 인터넷과 같은 개방형 통신망에서 안전하고 효율적인 신용카드 기반의 전자 결제를 수행하기 위해 개발된 전자 지불 표준 프로토콜이다. SET을 기반으로하는 전자 지불 시스템은 크게 카드를 소지하고 있는 고객(Cardholder), 상품을 판매하고 대금 결제를 요구하는 상인(Merchant)기존의 은행과 연동하기위한 지불 게이트웨이(Payment gateway)로 구성되며 부가적인 요소로 인증기관(CA)을 포함하고 있다. SET은 고객과 상인, 상인과 은행간의 안전한 거래를 지원하기 위해 여러 가지의 강력한 암호화 알고리즘을 채용하고 있으며 이러한 SET의 보안성은 전자 상거래의 보급에 커다란 기여를 할 것으로 예상된다. 본 논문에서는 기존의 전자 지불 방식을 특성별로 분류하여 그 기능과 구성에 대해 검토하고 SET에서 사용된 보안 기술과 SET을 기반으로 하는 전자지불 시스템의 기능과 특성을 검토·분석한다.

• Annals of Fuzzy Mathematics and Informatics
• /
• v.16 no.3
• /
• pp.261-284
• /
• 2018

In this paper, we recall the definition of soft set, fuzzy soft set, hesitant fuzzy set and hesitant fuzzy soft set and some of their examples. We define the concept of hesitant fuzzy soft multiset which combines hesitant fuzzy soft set and soft multiset theory. We also define basic terms in hesitant fuzzy soft multiset with relevant examples. Some basic operations such as restricted intersection, extended intersection, union, restricted union, AND-product and OR-product and their properties are given, supported with illustrative examples. We finally establish some important results, including De Morgan's inclusions and laws.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.381-393
• /
• 2012

In this paper, we introduce the Choquet-Pettis integral of set-valued mappings and investigate some properties and convergence theorems for the set-valued Choquet-Pettis integrals.