• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.247-251
• /
• 1997

FCM(Fuzzy Cognitive Map) is a fuzzy signed directed graph for representing causal reasoning which has fuzziness between causal concepts. Authors have already proposed FCM-based fault diagnostic scheme and verified its usefulness. However, the previously proposed scheme has the problem of lower diagnostic resolution as in the case of other qualitative approaches. In order to improve the diagnostic resolution, a concept of fuzzy number is introduced into the basic FCM-based fault diagnostic algorithm. By incorporation the fuzzy number into fault FCM models, quantitative information such as the transfer gain between the state variables can be effectively utilized for better diagnostic resolution. Furthermore, an enhanced TAM(Temporal Associative Memory) recall procedure and modified and modified pattern matching scheme are also proposed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1362-1365
• /
• 1993

Fuzzy mathematics is used to elicit and evaluate human psychophysical responses in panel tests. The fundamental instrument used is a bar graph whose data is then converted to a paired comparison matrix. Form this matrix we use the theory of Perron and Froebenius to obtain an eigenvalue and eigenvector which indicates not only the panelist's comparitive responses but also the consistency of the responses from that panelist. Tests were done to evaluate the procedure.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.2
• /
• pp.108-113
• /
• 2005

This paper suggests a control method for an efficient topology/parameter evolution in a bond graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems. We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach in bond graph synthesis, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.91-98
• /
• 2009

In this paper, this model ensures confidentiality and integrity of mandatory access cotrol policy which based on fuzzy function with importance of information. And it solves authorization abuse problem through role graph creation algorithm and flowing policy that security grade is applied. Because this model composes role hierarchy which bind similar role concept to apply to commercial environment, it has expansile advantage by large scale security system as well as is easy that add new role.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.219-232
• /
• 1998

A lot of difficulties exist in analyzing the structure of a system owing to the complex and organic relations in the systems we face in reality. Focuses have been put on the research of optimal solution in a defined structure, however, on the assumption that the structure of the system has been already defined. With the grasping of the structure as the most prior condition, ISM(Interpretive Structural Modeling) and FSM(Fuzzy Structural Modeling) are suggested as solutions in this paper. ISM uses the systematic application of some elementary notions of graph theory and boolean algebra, FSM uses Fuzzy conception for representing relationship between elements. In FSM, the entries in the relation matrix are taken to value on the interval [0,1] by virtue of a fuzzy binary relation. Numeric examples are used as the actual application as follows.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.238-246
• /
• 2011

This paper proposes a new semantic representation and its associated similarity measure. The representation expresses textual context observed in a context of a certain term as a network where nodes are terms and edges are the number of cooccurrences between connected terms. To compare terms represented in networks, a graph kernel is adopted as a similarity measure. The proposed representation has two notable merits compared with previous semantic representations. First, it can process polysemous words in a better way than a vector representation. A network of a polysemous term is regarded as a combination of sub-networks that represent senses and the appropriate sub-network is identified by context before compared by the kernel. Second, the representation permits not only words but also senses or contexts to be represented directly from corresponding set of terms. The validity of the representation and its similarity measure is evaluated with two tasks: synonym test and unsupervised word sense disambiguation. The method performed well and could compete with the state-of-the-art unsupervised methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.132-139
• /
• 2008

This paper proposes a scatternet topology formation, self-healing, and self-routing path optimization algorithm based on Relative Neighborhood Graph. The performance of the algorithm using ns-2 and extensible Bluetooth simulator called blueware shows that even though RNG-FHR does not have superior performance, it is simpler and easier to implement in deploying the Ad-Hoc network in the distributed dynamic environments due to the exchange of fewer messages and the only dependency on local information. We realize that our proposed algorithm is more practicable in a reasonable size network than in a large scale.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.147-157
• /
• 2017

In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.

• Economic and Environmental Geology
• /
• v.50 no.3
• /
• pp.195-214
• /
• 2017

Statistical landslide susceptibility analysis, which is widely used among various landslide susceptibility analysis approaches, predicts the unstable area by analyzing statistical relationship between landslide occurrence locations and landslide controlling factors. However, uncertainties are involved in the procedures of the susceptibility analysis and therefore, fuzzy approach has been used to deal properly with uncertainties. The fuzzy approach used fuzzy set theory and fuzzy membership function to quantify uncertainties involved in landslide controlling factors. Various fuzzy approaches were suggested in the procedure of the membership value determination and fuzzy operation in the previous researches. However, few studies were carried out to compare the analysis results obtained from various approaches for membership function determination and fuzzy operation. Therefore, in this study, the authors selected Jinbu area, which a large number of landslides were occurred at in 2006, to apply two most commonly used methods, the frequency ratio and the cosine amplitude method to derive membership values for each controlling factor. In addition, the integration of different thematic layers to produce landslide susceptibility map was performed by several fuzzy operators such as AND, OR, algebraic product, algebraic sum and Gamma operator. The results of the landslide susceptibility analysis using two different methods for the determination of fuzzy membership values and various fuzzy operators were compared on the basis of ROC graph to check the feasibility of the fuzzy based landslide susceptibility analysis.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1482-1485
• /
• 2005

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD, inlining two dimensional DTD graph into flat feature values. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.