• Journal of the Korean Institute of Intelligent Systems
• /
• v.1 no.1
• /
• pp.9-25
• /
• 1991

This tutorial paper has been written for biologists, physicians or beginners in fuzzy sets theory and applications. This field is introduced in the framework of medical diagnosis problems. The paper describes and illustrates with practical examples, a general methodology of special interest in the processing of borderline cases, that allows a graded assignment of diagnoses to patients. A pattern of medical knowledge consists of a tableau with linguistic entries or of fuzzy propositions. Relationships between symptoms and diagnoses are interpreted as labels of fuzzy sets. It is shown how possibility measures (soft matching) can be used and combined to derive diagnoses after measurements on collected data. The concepts and methods are illustrated in a biomedical application on inflammatory protein variations. In the case of poor diagnostic classifications, it is introduced appropriate ponderations, acting on the characterizations of proteins, in order to decrease their relative influence. As a consequence, when pattern matching is achieved, the final ranking of inflammatory syndromes assigned to a given patient might change to better fit the actual classification. Defuzzification of results (i.e. diagnostic groups assigned to patients) is performed as a non fuzzy sets partition issued from a "separating power", and not as the center of gravity method commonly employed in fuzzy control. It is then introduced a model of fuzzy connectionist expert system, in which an artificial neural network is designed to build the knowledge base of an expert system, from training examples (this model can also be used for specifications of rules in fuzzy logic control). Two types of weights are associated with the connections: primary linguistic weights, interpreted as labels of fuzzy sets, and secondary numerical weights. Cell activation is computed through MIN-MAX fuzzy equations of the weights. Learning consists in finding the (numerical) weights and the network topology. This feed forward network is described and illustrated in the same biomedical domain as in the first part.

• Korean Institute of Interior Design Journal
• /
• v.14 no.3 s.50
• /
• pp.181-190
• /
• 2005

In accordance with the rapid growth of digital media in 1990s, the state of indetermination that is found in digital process has been emphasized in the field of natural science and philosophy. Digitalized space design has been dramatically developed and it raised heated debate and comment on 'folded space' The purpose of this thesis is to explore how the cognitive-ecological factors constitute fold structures in space design of the late 20th century. Syntax of space structure and geometric composition were analyzed to define what types of cognitive-ecological factors are contrived in the process of visual information. In particular, I put higher theoretical emphasis on what characteristics are ensued in the process of structuring spaces than any other subjects. Through theses analyses and discussions, I raised questions on what principles are operating to create new space design that counts on non-linear structure and its formational process. And I also observed what influences these structural principles of design could fundamentally bring to human beings. First, I proposed that we could overcome reductionist space design through cognitive-ecological approach. Some key concepts such as affordance, parallel processing, and redundancy were adopted as defining elements of non-linear structures. As a result of analyses, I found that the cognitive-ecological approach could substitute the reductionist space design of the past. What is also found is that the three variables are the ultimate ecological elements. In addition, as a methodological concept of fold structures, the form of 'topology' was highlighted because it could be a supporting idea to the cognitive-ecological factors. Second, I claimed that non-linear design is more experiential than rational linear design, and it is more efficiently correspondent to human being than any other forms. What is intended and implied in non-linear structure is also indicated.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.885-890
• /
• 2003

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member's arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.83-90
• /
• 2012

MANET(Mobile Ad-Hoc Network) has a weakness from a security aspect because it operates where no wired network is built, which causes the exposed media, dynamic topology, and the lack of both central monitoring and management. It is especially difficult to detect and mitigate a malicious node because there is not a mediator which controls the network. This kind of malicious node is closely connected to the routing in the field of study of Ad-Hoc security. Accordingly this paper proposes the method on how to enhance the security for the safe and effective routing by detecting the malicious node. We propose MBC(Identification technition of Malicious Behavior node based on Collaboration in MANET) that can effectively cope with malicious behavior though double detecting the node executing the malicious behavior by the collaboration between individual node and the neighbor, and also managing the individual nodes in accordance with the trust level obtained. The simulation test results show that MBC can find the malicious nodes more accurately and promptly that leads to the more effectively secure routing than the existing method.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.27-33
• /
• 2006

To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.209-216
• /
• 2009

In the wireless sensor network, flooding is required for the dissemination of queries and event announcements. The simple flooding causes the implosion and the overlap problems, so the simple flooding may result in the reduced network lifetime. Therefore, in this paper, we propose the flooding overlay structure (FOS) so that the overhead caused by flooding can be reduced. We propose two variants of FOS mechanisms, the centralized FOS (CFOS) and the distributed FOS (DFOS). In CFOS, the sink collects the network topology information and selects forwarding nodes based on that information. On the other hand, DFOS allows each sensor node to decide whether to act as a forwarding node or not based on its local information. For the performance evaluation of our proposed mechanisms, we carry out NS-2 based simulations and compare ours with the simple flooding and the gossiping. The simulation results indicate that the proposed FOS mechanisms outperform the simple flooding in terms of the network lifetime and the gossiping in terms of the data delivery ratio.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.393-406
• /
• 2009

This paper introduces two functions added to the current version of ns-2 simulator for better accuracy of IEEE 802.15.4 network simulations. The first one is to automatically place hidden nodes over the ring topology in which the coordinator is centered, when the number of hidden nodes and total number of nodes is given. Collisions of signals can be distinguished into the trace file according to the ways of participation of hidden nodes. The second one is the CCA deferment algorithm described in IEEE 802.15.4-2006 standard which is not implemented in the current version of ns-2. Owing to these additional functions, we can carry out the precise analysis of the performance effects of hidden nodes and CCA deferment algorithm on 802.15.4 networks. Simulation results present at least 66% of performance degradation in throughput and drastic increase of collision probability up to 90% from 65% by just a single hidden node. Besides, 2006 standard for CCA deferment algorithm gives 19% lower collision probability and 38% higher performance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1106-1118
• /
• 2006

The Internet has become an important instrument for providing many pieces of information to us. And server systems offer the various services after processing a volume of information, it's network topology also has been complex for providing information. Therefore this expansion means the importance of fast and sustained management of server systems. But most of server systems are located in fire-walls to allow only restricted access. Moreover, due to the difference of management based on the different operating system of each server system, management of server system is not to efficiency. That is, sever administrators have to manage by themselves many kinds of servers by using local-based or socket-based single access applications. Therefore, we design and implement a middleware system which allows to manage many kinds of severs integrally ruling XML-based Web Services which have distributed object technology such as CORBA, Java RMI and DCOM, but are free from platforms or development languages. System also provides location transparency and terminal independence and calls a server system management command to manage systems.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.413-422
• /
• 2007

This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.