• Cartoon and Animation Studies
• /
• s.25
• /
• pp.87-108
• /
• 2011

Published comics are widely recognized as a popularity-gaining media as well as Soap opera and the movies, and it also has a established characteristic of category. However, compare to the multimedia such as the movies, soap opera and playes, the research on direction is not yet satisfactory This research mainly tries to investigate on, first, whether the theoretically classified functions do actually practice their parts or not, and else, what other additional functions should be considered, by classifying the set up of basic direction functions, angles and range, which the most-cited angle and distance notion of 'Ahn Su Cheol' in comic education field. First, although we tried to approach with the expectation of angle and distance set up that will have a high frequency of certain set ups according to the atmospheres of comics of genre, unlike the expectation, they are rather displayed depending on the personal taste of the writers. The functional aspects of angles and distance set up are the fixing that are only limited in the space of representation, and it is the set up of physical space that should come first as the function of expressing the intensity. As we investigate the characteristics of comic direction, this research will help the range of comic direction to be broadened.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1997.04a
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.599-604
• /
• 2005

This paper presents fuzzy rules to predict diagnosis of Wisconsin breast cancer with minimized number of feature in put using the neural network with weighted fuzzy membership functions (NEWFM) and the non-overlap area distribution measurement method. NEWFM is capable of self-adapting weighted membership functions from the given the Wisconsin breast cancer clinical training data. n set of small, medium, and large weighted triangular membership functions in a hyperbox are used for representing n set of featured input. The membership functions are randomly distributed and weighted initially, and then their positions and weights are adjusted during learning. After learning, prediction rules are extracted directly from n set of enhanced bounded sums of n set of small, medium, and large weighted fuzzy membership functions. Then, the non-overlap area distribution measurement method is applied to select important features by deleting less important features. Two sets of prediction rules extracted from NEWFM using the selected 4 input features out of 9 features outperform to the current published results in number of set of rules, number of input features, and accuracy with 99.71%.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.553-581
• /
• 2016

The purpose of this paper is to prove some fixed point theorems in a complete metric space equipped with a partial ordering using w-distances together with the aid of an altering functions and new functions of admissible type.

• East Asian mathematical journal
• /
• v.31 no.5
• /
• pp.653-658
• /
• 2015

In this paper, we consider split quaternionic functions defined on an open set of split quaternions and give the split quaternionic functions whose each inverse function is sp-hyperholomorphic almost everywhere on ${\Omega}$. Also, we describe the definitions and notions of pseudoholomorphic functions for split quaternions.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.15-29
• /
• 2024

Many academics employ various structures to expand topological space, including the idea of topology, as a result of the importance of topological space in analysis and some applications. One of the most notable of the generalizations was the definition of perfect functions in bitopological spaces, which was presented by Ali.A.Atoom and H.Z.Hdeib. We propose the notion of α- pairwise perfect functions in bitopological spaces and define different types of this concept in this study. Pairwise -T - α- perfect functions, pairwise -α-irr-perfect functions, and pairwise -T - α- irr-perfect functions, are all characterized in addition to pairwise -α-perfect functions. We go through their primary characteristics and show how they interact. Finally, under these functions, we introduce the images and inverse images of certain bitopological features. About these concepts, some product theorems have been discovered.

• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.1
• /
• pp.47-56
• /
• 2004

The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

• Journal of the military operations research society of Korea
• /
• v.7 no.1
• /
• pp.118-138
• /
• 1981

In many response surface optimization problems for industrial processes, there are more than two responses of interest, and we want to find the optimal levels of the factors that influence the responses. This paper is to propose how to set up the desirability functions to find the optimum for a given set of data, and to propose how to analyse the data and the desirability functions to determine an optimal operating condition for the factors. To implement the proposed method in practice, a FORTRAN computer program was written and explained. Finally, an industrial example is illustrated to explain the proposed technique and the source list of the computer program is attached for the users.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.399-405
• /
• 2010

Blind equalization techniques have been used in broadcast and multipoint communications. In this paper, two criteria of minimizing Euclidian distance between two probability density functions (PDFs) for adaptive blind equalizers are presented. For PDF calculation, Parzen window estimator is used. One criterion is to use a set of randomly generated desired symbols at the receiver so that PDF of the generated symbols matches that of the transmitted symbols. The second method is to use a set of Dirac delta functions in place of the PDF of the transmitted symbols. From the simulation results, the proposed methods significantly outperform the constant modulus algorithm in multipath channel environments.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.703-705
• /
• 2000

In this paper, we design a robust adaptive controller for a nonlinear systems with uncertainties to be rejected via disturbance adaptation law. The nonlinear system considered in this paper has unknown nonlinear functions being influenced by external disturbance. The upper bounds of unknown nonlinear functions at each time is estimated by using disturbance adaptation law. The estimated nonlinear functions are used to design stabilizing function and control of input. Tuning function is used to estimate unknown system parameter without overparametrization. A set-point regulation error converges to a residual set close to zero asymptotically fast.