• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.691-699
• /
• 2009

Recently, the ERO protocol has been adopted as a standard to protect the routing optimization mode introduced by MIPv6. This protocol uses the public key cryptography and the early binding update method to improve the Return Routeability protocol while optimizing both security and performance. On the other hand, though various security approaches including the ERO protocol have been proposed for MIPv6, they lack formal verification. Especially, to our best knowledge, there is no formal analysis on the ERO protocol. In order to provide a good example for formal analysis on MIPv6 security protocols, this paper verifies the correctness of the ERO protocol through BAN-logic. For this goal, BAN-logic is extended to consider the address tests on the mobile nodes's CoA and HoA. It is expected that the analysis presented in this paper will be useful for the formal verifications on the security protocols related to MIPv6.

• 한국신재생에너지학회:학술대회논문집
• /
• 2011.11a
• /
• pp.87.2-87.2
• /
• 2011

Many type of fuel cell stacks have been developed to improve the efficiency of reactants usage. The cascade type fuel cell stack using dead end operation is able to attain above 99% usage of hydrogen and oxygen. It is sectionalized to several parts and the residual reactants which are used previous parts would be supplied again to next parts which have less number of cells in dead end operation stack. The oversupply of reactants which is usually 120%~150% of the theoretical amount to generate current for preventing the flooding effect could be provided to each part except the last one. The final section which is called monitoring cells is supposed to be supplied insufficient the fuel or oxidant that would have some accumulated inert gas from former parts. It makes some voltage drop in the part and the fresh reactants must be supplied to the part for recovering it by venting the residual gas. So the usage of fuel and oxidant is depend on the time and frequency of opening valves for venting of residual gas and it is important to optimize the vent logic for achieving higher usage of hydrogen and oxygen. In this research, many experiments are performed to find optimal condition by evaluating the effect of time and frequency under several power conditions using over 100kW class fuel cell module. And the characteristics of the monitoring cells are studied to know the proper cell voltage which decide the condition of opening the vent valve for stable performance of the cascade type fuel cell module.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.1
• /
• pp.219-224
• /
• 2016

The vibration control performance of a semi-active damper connected to adjacent buildings subjected to seismic loads was investigated. The MR damper was used as a semi-active control device. A fuzzy logic control algorithm was used for effective control of the adjacent buildings connected to the MR damper. In the buildings control coupled with a MR damper, the response reduction of one building results in an increase in the response in another building. Because of these conflict characteristics, multi-objective optimization is required. Therefore, a fuzzy logic control algorithm for the control of a MR damper was optimized using a multi-objective genetic algorithm. Based on numerical analyses, the semi-active fuzzy control of MR damper for adjacent coupled buildings can provide good control performance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.4
• /
• pp.293-298
• /
• 2016

Document summarization is an important task in various areas where the goal is to select a few the most descriptive sentences from a given document as a succinct summary. Even without training data of human labeled summaries, there has been several interesting existing work in the literature that yields reasonable performance. In this paper, within the same unsupervised learning setup, we propose a more principled learning framework for the document summarization task. Specifically we formulate an optimization problem that expresses the requirements of both faithful preservation of the document contents and the summary length constraint. We circumvent the difficult integer programming originating from binary sentence selection via continuous relaxation and the low entropy penalization. We also suggest an efficient convex-concave optimization solver algorithm that guarantees to improve the original objective at every iteration. For several document datasets, we demonstrate that the proposed learning algorithm significantly outperforms the existing approaches.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.75-80
• /
• 2001

Rule inconsistency is an important issue that is needed to be addressed while designing efficient and optimal fuzzy rule bases. Automatic generation of fuzzy rules from data sets, using machine learning techniques, can generate a significant number of redundant and inconsistent rules. In this study we have shown that it is possible to provide a systematic approach to understand the fuzzy rule inconsistency problem by using the proposed measure called the Commonality measure. Apart from introducing this measure, this paper describes an algorithm to optimize a fuzzy rule base using it. The optimization procedure performs elimination of redundant and/or inconsistent fuzzy rules from a rule base.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.113-118
• /
• 2001

In this paper, we develop an optimal intelligent digital redesign method for a class of fuzzy-model-based controllers, effective for stabilization of continuous-time complex nonlinear systems. Takagi-Sugeno (TS) fuzzy model is used to extend the results of the classical digital redesign technique to complex nonlinear systems. Unlike the conventional intelligent digital redesign technique reported in the literature, the proposed method utilized the recently developed LMI optimization technique to obtain a digitally redesigned fuzzy-model-based controller. Precisely speaking, the intelligent digital redesign problem is converted to an equivalent optimization problem, and the LMI optimization method is used to find the digitally redesigned fuzzy-model-based controller. A numerical example is provided to evaluate the feasibility of the proposed approach.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.35-43
• /
• 2001

In this paper, we propose a design method for GBSB (generalized brain-state-in-a-box) based associative memories. Based on the theoretical investigation about the properties of GBSB, we parameterize the solution space utilizing the limited number of parameters sufficient to represent the solution space and appropriate to be searched. Next we formulate the problem of finding a GBSB that can store the given pattern as stable states in the form of constrained optimization problems. Finally, we transform the constrained optimization problem into a SDP(semidefinite program), which can be solved by recently developed interior point methods. The applicability of the proposed method is illustrated via design examples.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.233-238
• /
• 2003

Living creatures maintain their variety through speciation, which helps them to have more fitness for an environment. So evolutionary algorithm based on biological evolution must maintain variety in order to adapt to its environment. In this paper, we utilize the concept of speciation. Each individual of population creates their offsprings using mutation, and next generation consists of them. Each individual explores search space determined by mutation. Useful search space is extended by differentiation, then population explorers whole search space very effectively. If evolvable hardware evolves through mutation, it is useful way to explorer search space because of less varying inner structure. We verify the effectiveness of the proposed method by applying it to two optimization problems.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.14-21
• /
• 1997

In delay-optimized designs, timing failures due to manufacturing delay defects are more likely to occur because the average timing slacks of paths decrease and the system becomes more sensitive to smaller delay defect sizes. In this paper, the impact of delay optimized logic circuits on delay fault testing will be discussed and compared to the case for non-optimized designs. First, we provide a timing optimization procedure and show that the resultant density function of path delays is a delta function. Next we also discuss the impact of timing optimization on the yield of a manufacturing process and the defect level for delay faults. Finally, we will give some recommendations on the determination of the system clock time so that the delay-optimized design will have the same manufacturing yield as the non-optimized design and on the determination of delay fault coverage in the delay-optimized design in order to have the same defect-level for delay faults as the non-optimized design, while the system clock time is the same for both designs.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1993.10a
• /
• pp.16-16
• /
• 1993

The efficient use of capital intensive FMS requires determination of effective dispatching priority with which the parts of the selected part types are to be inputed into the system. This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS, Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness, Computational performance of the algorithm shows that good solutions can be obtained within a reasonable amount of computations. The paper also compares the performance of the "optimal" or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules such as SPT, EDD and SLACK.