• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.528-530
• /
• 1999

This paper addresses the analysis and design of fuzzy control systems for a class of complex single input single output nonlinear systems. Firstly, the nonlinear system is represented by well-known Takagai-Sugeno (TS) fuzzy model and the global controller is constructed by compensating each linear model in the rule of TS fuzzy model. The design of conventional TS fuzzy-model-based controller usually is composed of two processes. One is to determine static state feedback gain of each local model and the other is to validate the stability of the designed fuzzy controller. In this paper, we propose an alternative of the design of TS fuzzy-model-based controller. The design scheme is based on the extension of conventional optimal control theory to the design of TS fuzzy-model-based controller. By using the proposed method the design and stability analysis of the TS fuzzy model-based controller is reduced to the problem of finding the solution of a set of algebraic Riccati equations. And we use the recently developed interior point method to find the solution of AREs, where AREs are recast as the LMI formulation. One simulation example is given to show the effectiveness and feasibility of the proposed fuzzy controller design method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.157-158
• /
• 2013

Data privacy and access control policies in computer clouds are a prime concerns while talking about the sensitive data. Authorized access is ensured with the help of secret keys given to a range of valid users. Granting the role access is a trivial matter but revoking user access is tricky and compute intensive. To revoke a user and making his data access ineffective the data owner has to compute new set of keys for the rest of effective users. This situation is inappropriate where user revocation is a frequent phenomenon. Time based revocation is another way to deal this issue where key for data access expires automatically. This solution rests in a very strong assumption of time determination in advance. In this paper we have proposed a mutable encryption for oblivious data access in cloud storage where the access key becomes ineffective after defined number of threshold by the data owner. The proposed solution adds to its novelty by introducing mutable encryption while accessing the data obliviously.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1997.06c
• /
• pp.89-98
• /
• 1997

This study was conducted to develop an automatic nutrient-solution control system for small-scale growers. The nutrient-solution control system consisted of a low-cost and precise metering device and a personal computer. The system controlled electric conductivity(EC) and pH of nutrient-solution based on the time-based feedback control method with the information about temperature, EC, and pH of the nutrient-soIution. The performance of the nutrient-solution control system was evaluated through the control of EC and pH while compared with those of commercial nutrient-solution control system. Also an experimental cultivation of tomato was conducted to verify and to improve the developed system. Results of this study were as follows. 1. An automatic nutrient-solution control system based on a low-cost and precise metering device was developed. 2. The developed system controlled EC and pH within $\pm$0.05 mS/cm and $\pm$0.2 pH full scale error respectively at $24^{/circ}C$. 3. When using the commercial system, the controlled values of EC and pH of the 500l of water were 1.29 mS/cm and 6.1 pH for the setting points of 1.4 mS/cm and 6.0 pH respectively at $22^{/circ}C$. 4. The developed nutrient-solution control system showed $\pm$0.05 mS/cm of deviation from the setting EC value over the experimental cultivation period. 5. The deviation from the average values of Ca and Mg mass content in the several nutrient-solution were 0.5% and 1.8% respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.680-688
• /
• 2001

In this paper, we propose a reliable method for searching the optimally performing generalized brain-state-in-a-box (GBSB) neural associative memory using an evolution program (EP) given a set of prototype patterns to be stored as stable equilibrium points. First, we exploit some qualitative guidelines necessary to synthesize the GBSB model. Next, we parameterize the solution space utilizing the limited number of parameters to represent the solution space. Then, we recast the synthesis of GBSB neural associative memories as two constrained optimization problems, which are equivalent to finding a solution to the original synthesis problem. Finally, we employ an evolution program (EP), which enables us to find an optimal set of parameters related to the size of domains of attraction (DOA) for prototype patterns. The validity of this approach is illustrated by a design example and computer simulations.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.55-64
• /
• 2023

The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.519-523
• /
• 2004

In this paper we challenge the user Authentication using KerberosV5 authentication protocol in WPKI environment. This paper is the security structure that defined in a WAP forum and security and watches all kinds of password related technology related to the existing authentication system. It looks up weakness point on security with a problem on the design that uses wireless public key based structure and transmission hierarchical security back of a WAP forum, and a server client holds for user authentication of an application layer all and all, and it provides one counterproposal. Therefore, We offer authentication way solution that connected X.509 V3 with using WIM for complement an authentication protocol KerberosV5 and its disadvantages.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.109-110
• /
• 2021

본 논문에서는 웹툰(Webtoon)에서 파생되어 현재 온라인 동영상 플랫폼에서 활발하게 저작되고 있는 영상툰을 위한 영상툰 저작 시스템의 설계를 설명한다. 설명하는 저작 시스템은 웹을 기반으로 설계하여 저작자의 접근성을 높이고 웹에 접근할 수 있는 어느 장소에서든 저작이 가능하다는 이점으로 인해 편의성을 높였다. 또한, 많이 사용되고 있는 영상 저작 프로그램의 기본 형태를 따라 설계를 진행하여 처음 접하는 사용자들이 익숙하게 작업할 수 있도록 하여 적응을 위한 시간을 최소한으로 줄이고 단기간 내에 익숙하게 사용할 수 있도록 설계하였다. 설계된 시스템은 제안한대로 사용자가 익숙하게 사용할 수 있는 구조로 구성하였고, 향후에는 영상툰을 위한 다양한 효과들을 추가하여 시스템의 유용성 및 편의성을 높일 예정이다.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.35-42
• /
• 2019

In this paper, we propose an approach to apply network-based moving target defense into Internet of Things (IoT) networks. The IoT is a technology that provides the high interconnectivity of things like electronic devices. However, cyber security risks are expected to increase as the interconnectivity of such devices increases. One recent study demonstrated a man-in-the-middle attack in the statically configured IoT network. In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. The approach continuously changes system's attack surface to prevent attacks. After analyzing IPv4 / IPv6-based moving target defense schemes and IoT network-related technologies, we present our approach in terms of addressing systems, address mutation techniques, communication models, network configuration, and node mobility. In addition, we summarize the direction of future research in relation to the proposed approach.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2187-2195
• /
• 2017

In order to solve the AC optimal power flow (OPF) problem considering the generators' on/off status, it is necessary to model the problem as mixed-integer nonlinear programming (MINLP). Because the computation time to find the optimal solution to the mixed-integer AC OPF problem increases significantly as the system becomes larger, most of the existing solutions simplify the problem either by deciding the on/off status of generators using a separate unit commitment algorithm or by ignoring the minimum output of the generators. Even though this kind of simplification may make the overall computation time tractable, the results can be significantly erroneous. This paper proposes a novel algorithm for the mixed-integer AC OPF problem, which can provide a near-optimal solution quickly and efficiently. The proposed method is based on a combination of the outer approximation method and the relaxed AC OPF theory. The method is applied to a real-scale power system that has 457 generators and 2132 buses, and the result is compared to the branch-and-bound (B&B) method and the genetic algorithm. The results of the proposed method are almost identical to those of the compared methods, but computation time is significantly shorter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.