• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.10
• /
• pp.77-85
• /
• 1993

In this paper, we present a method to solve a convexly combined fuzzy relational equation with generalized connectives. For this, we propose a neural network whose structure represents the fuzzy relational equation. Then we derive a learning algorithm by using the concept of back-propagation learning. Since the proposed method can be used for a general form of fuzzy relational equations, such fuzzy max-min or min-max relational equations can be treated as its special cases. Moreover, the relational structure adopted in the proposed neurocomputational approach can work in a highly parallel manner so that real-time applications of fuzzy sets are possibles as in fuzzy logic controllers, knowledge-based systems, and pattern recognition systems.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.492-495
• /
• 2003

Fuzzy Min-Max Neural Network(FMMNN) is a powerful classifier, It has, however, some problems. Learning result depends on the presentation order of input data and the training parameter that limits the size of hyperbox. The latter problem affects the result seriously. In this paper, the new approach to alleviate that without loss of on-line learning ability is proposed. The committee machine is used to achieve the multi-resolution FMMNN. Each expert is a FMMNN with fixed training parameter. The advantages of small and large training parameters are used at the same time. The parameters are selected by performance and independence measures. The Decision of each expert is guided by the gating network. Therefore the regional and parametric divide and conquer scheme are used. Simulation shows that the proposed method has better classification performance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.1
• /
• pp.60-71
• /
• 2015

In this paper, a matrix game is considered in which the elements are represented as Z-numbers. The objective is to formalize the human capability for solving decision-making problems in uncertain situations. A ranking method of Z-numbers is proposed and used to define pure and mixed strategies. These strategies are then applied to find the optimal solution to the game problem with an induced pay off matrix using a min max, max min algorithm and the multi-section technique. Numerical examples are given in support of the proposed method.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.9 no.4
• /
• pp.256-260
• /
• 2004

Melanin was decolorized by lignin peroxidase from Phanerochaete chrysosporium. This decolorization reaction showed a Michaelis-Mentens type relationship between the decolorization rate and concentration of two substrates: melanin and hydrogen peroxide. Kinetic constants of the decolorization reaction were 0.1 OD$\sub$475//min ($V_{max}$) and 99.7 mg/L ($K_{m}$) for melanin and 0.08 OD$\sub$475//min ($V_{max}$) and 504.9 ${\mu}$M ($K_{m}$) for hydrogen peroxide, respectively. Depletion of hydrogen peroxide interrupted the decolorization reaction, indicating the essential requirement of hydrogen peroxide. Pulsewise feeding of hydrogen peroxide continued the decolorizing reaction catalyzed by lignin peroxidase. These results indicate that enzymatic decolorization of melanin has applications in the development of new cosmetic whitening agents.

• Journal of Mechanical Science and Technology
• /
• v.17 no.4
• /
• pp.528-537
• /
• 2003

This paper proposes a 3-PPR planar parallel manipulator, which consists of three active prismatic Joints, three passive prismatic joints, and three passive rotational joints. The analysis of the kinematics and the optimal design of the manipulator are also discussed. The proposed manipulator has the advantages of the closed type of direct kinematics and a void-free workspace with a convex type of borderline. For the kinematic analysis of the proposed manipulator, the direct kinematics, the inverse kinematics, and the inverse Jacobian of the manipulator are derived. After the rotational limits and the workspaces of the manipulator are investigated, the workspace of the manipulator is simulated. In addition, for the optimal design of the manipulator, the performance indices of the manipulator are investigated, and then an optimal design procedure Is carried out using Min-Max theory. Finally. one example using the optimal design is presented.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.11
• /
• pp.167-173
• /
• 2002

The look up table method conventionally applied to control the inner temperature and humidity of a laver drying machine has repeatedly occurred not only laver's damage but also inferior goods since the reaching time at the optimum state takes a long time. In this paper, a fuzzy control theory instead of the look up table was proposed to reduce the reaching time at the optimum state. The proposed method used six input variables and four output variables for the fuzzy control, and a triangle rule for a fuzzifier, The Mandani's min-max method was applied to a fuzzy inference. Also, the mean method of maximum was applied to a defuzzifier. The method applied to the fuzzy controller contributed to reduce the reaching time at the optimum state, and to minimize not only laver's damage but also inferior goods.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.577-582
• /
• 2004

Double-ended Proirity queues(DEPQ) can be used in applications such as scheduling or sorting. The data structures for DEPQ can be con-structed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. This paper presents a novel fast implicit heap called 4-deapr$\ast$ which utilizes cache memory efficiently. Experimental results show that the 4-deap$\ast$ is faster than symmetric min-max heap as well as deap.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2002.10a
• /
• pp.349-352
• /
• 2002

In this paper, dynamic properties of fiber reinforced soils were investigated at shearing strains between $10^{-4}%\;and\;10^{-1}%$ using resonant column test. Resonant column test has been widely used as a primary laboratory testing technique in investigating dynamic soil properties expressed in term of shear modulus and material damping. At strains above elastic threshold, the variations of shear modulus(G) and damping ratio(D) were investigated. Based on test results, the small strain shear modulus($G_{max}$) and damping ratio($D_{min}$) were determined and the effects of confinement on $G_{max}$ and $D_{min}$ were characterized.

• Journal of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.177-191
• /
• 2001

We consider a linear differential game described by the delay-differential equation in a Hilbert space H; (※Equations, See Full-text) U and V are Hilbert spaces, and B(t) and C(t) are families of bounded operators on U and V to H, respectively. A(sub)0 generates an analytic semigroup T(t) = e(sup)tA(sub)0 in H. The control variables g, and u and v are supposed to be restricted in the norm bounded sets (※Equations, See Full-text). For given x(sup)0 ∈ H and a given time t > 0, we study $\xi$-approximate controllability to determine x($.$) for a given g and v($.$) such that the corresponding solution x(t) satisfies ∥x(t) - x(sup)0∥ $\leq$ $\xi$($\xi$ > 0 : a given error).

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.