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

Three optical fuzzy calculating modules, MAX/MIN, NOT/THROUGH, and SUP/THROUGH operating modules, are proposed. The MAX/MIN operating on inputted 2 membership functions. The NOT/THROUGH operating module calculates the complement of the membership function. The SUP/THROUGH operating module outputs an image representing the supremum (least upper bound) of the membership function. The THROUGH operation passes the image of the inputted membership function from the entrance to the exit. This paper demonstrates that these modules can output the image into which the modules transform inputted images on the basis of operation on fuzzy logic.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1329-1334
• /
• 2019

We define the concept of a generator for a ${\mathbb{Z}}^k$-action T and show that T is expansive if and only it has a generator. Further, we prove several properties of a ${\mathbb{Z}}^k$-action including that the least upper bound of the set of expansive constants is not an expansive constant.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1523-1528
• /
• 2018

For $r{\geq}2$, let ${\mathcal{H}}$ be an r-uniform hypergraph with n vertices and m hyperedges. Let R be a random vertex set obtained by choosing each vertex of ${\mathcal{H}}$ independently with probability p. Let ${\mathcal{H}}[R]$ be the subhypergraph of ${\mathcal{H}}$ induced on R. We obtain an upper bound on the matching number ${\nu}({\mathcal{H}}[R])$ and a lower bound on the independence number ${\alpha}({\mathcal{H}}[R])$ of ${\mathcal{H}}[R]$. First, we show that if $mp^r{\geq}{\log}\;n$, then ${\nu}(H[R]){\leq}2e^{\ell}mp^r$ with probability at least $1-1/n^{\ell}$ for each positive integer ${\ell}$. It is best possible up to a constant factor depending only on ${\ell}$ if $m{\leq}n/r$. Next, we show that if $mp^r{\geq}{\log}\;n$, then ${\alpha}({\mathcal{H}}[R]){\geq}np-{\sqrt{3{\ell}np\;{\log}\;n}-2re^{\ell}mp^r$ with probability at least $1-3/n^{\ell}$.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2005.12a
• /
• pp.326-333
• /
• 2005

The purpose of this paper is to provide a decision support method to a rational buyer, who wants to pay the least price for the product with the highest quality and service. We suggest a minimum efficiency game model and DEA game model to valuate many vendors whose qualifies of outputs are measured by percentage. Our results gave a decision maker (buyer) the upper bound and lower bound of the true efficiency score of a decision making unit (vendor) with respect to the benchmark (target) set by the buyer. As a result, a buyer can choose the best vendor in terms of his/her preference.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.28 no.1
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.7
• /
• pp.540-547
• /
• 2004

Since speech enhancement algorithms based on Kalman/Wiener filter require a priori knowledge of the noise and have focused on the minimization of the variance of the estimation error between clean and estimated speech signal, small estimation error on the noise statistics may lead to large estimation error. However, H/sub ∞/ filter does not require any assumptions and a priori knowledge of the noise statistics, but searches the best estimated signal among the entire estimated signal by applying least upper bound, consequently it is more robust to the variation of noise statistics than Kalman/Wiener filter. In this paper, we Propose a speech enhancement method using HMM and multi H/sub ∞/ filters. First, HMM parameters are estimated with the training data. Secondly, speech is filtered with multiple number of H/sub ∞/ filters. Finally, the estimation of clean speech is obtained from the sum of the weighted filtered outputs. Experimental results shows about 1dB∼2dB SNR improvement with a slight increment of computation compared with the Kalman filter method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.421-426
• /
• 2007

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer $p{\geq}q$, the ${\lambda}_{p,q}$-number of graph G, denoted ${\lambda}(G;p,q)$, is the smallest span among all integer labellings of V(G) such that vertices at distance two receive labels which differ by at least q and adjacent vertices receive labels which differ by at least p. Van den Heuvel and McGuinness have proved that ${\lambda}(G;p,q){\leq}(4q-2){\Delta}+10p+38q-24$ for any planar graph G with maximum degree ${\Delta}$. In this paper, we studied the upper bound of ${\lambda}_{p,q}$-number of some planar graphs. It is proved that ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+2(2p-1)$ if G is an outerplanar graph and ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+6p-4q-1$ if G is a Halin graph.

• Geomechanics and Engineering
• /
• v.10 no.1
• /
• pp.59-76
• /
• 2016

The non-linear Hoek-Brown failure criterion has been widely accepted and applied to evaluate the stability of rock slopes under plane-strain conditions. This paper presents a kinematic approach of limit analysis to assessing the static and seismic stability of three-dimensional (3D) rock slopes using the generalized Hoek-Brown failure criterion. A tangential technique is employed to obtain the equivalent Mohr-Coulomb strength parameters of rock material from the generalized Hoek-Brown criterion. The least upper bounds to the stability number are obtained in an optimization procedure and presented in the form of graphs and tables for a wide range of parameters. The calculated results demonstrate the influences of 3D geometrical constraint, non-linear strength parameters and seismic acceleration on the stability number and equivalent strength parameters. The presented upper-bound solutions can be used for preliminary assessment on the 3D rock slope stability in design and assessing other solutions from the developing methods in the stability analysis of 3D rock slopes.