• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.199-209
• /
• 1998

Since most engineering problems have had open-ended and ill-defined characteristics, design process is in advance attended with determination of alternatives based on realistic constraints after definition of appropriate problem. And it is completed with selection of best alternative through their comparison and investigation, and with performance of selected-alternative's detail design. As the process of structural design compared with that of general design, this paper presents a paradigm which can generate structural design alternatives, select optimum structure among them and simultaneously set its optimum design variables in reference of several objective as a result in more extended design region. For this purpose, specialized genetic algorithms which can handle design alternatives and multicriteria problems is used.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.193-209
• /
• 1998

The objective of this paper is to present a methodology for design of the FMS by using a new modeling tool which is called SE&TPN(Safe Extended & Timed Petri Net). A FMS, which consists of various machine groups, may produce machine parts in different physical dimensions and lot size. The approach involves the SE&TPN modeling by Petri-nets. The proposed algorithm can handle determining of firing count vector by incidence matrix and adjustment of conflict using the marking of SE&TPN. The SE&TPN is defined as nets that can have at most one token in one place and can have elements such as permissive arcs and inhibitor arcs in addition to elements. The SE&TPN with permissive arcs and inhibitor arcs are intuitively direct approach to increase the modeling power of the SE&TPN. Finally, this paper is to develop a modulation to optimize the system problems of FMS using SE&TPN which describes exactly features of Petri Nets.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.41-52
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more machines can be assigned to an operator. The machines are grouped into two types and there are more than one machines in each group. The type of machine in which a job can be processed, is determined. However, an operator can handle both types of machine. The elementary operations of a job are classified into three classes : machine-controlled elements, operator-controlled elements and machine/operator- controlled elements. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A heuristic solution procedure is suggested for allocating jobs to machines and allocating machines to operators. The performance of the algorithm is evaluated with various data set.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.704-708
• /
• 2002

Production scheduling has been one of the most critical issues in a manufacturing environment Job-shop scheduling problems(JSP) are well know from the standpoint of production planning and operations control in this research scheduling against due date is a measure of performance and the objective is minimizing total weighted tardiness This paper presents an idea of decomposition of the problem and shows robustmess of the schedule under various disturbances along with exact and approximation methods. The proposed method can indeed handle shop disturbances more effectively when compared with traditional and dynamic scheduling methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.05a
• /
• pp.1-4
• /
• 2004

Need safety diagnostic indicator pointer that is objective as estimation basis to be scientific and manages systematically safety existing condition and level for city gas facilities. Safety diagnostic indicator pointer can divide by greatly two. One is management (Software) side that one that differ with mechanical (Hardware) side that handle laying stress on equipment connected with safety manages organization and management connected with safety. Weight appropriates according to specific gravity that relevant element occupies in facilities. To give so big value in particular element in grant of weight pays attention because break balance of whole guideline and should gives. Finally, efficient safety net may see effect before self-regulation inside by minimum target establishment by government and legal, systematic countermeasure establishment for this, strict law application and each business proprietor and though activity and user's active safety activity forms harmony properly.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.3 no.1
• /
• pp.65-75
• /
• 1993

Fuzzy data is a phenomenon often occurring in real life. There is the inherent vagueness of classification terms referring to a continuous scale, the uncertainty of linguistic terms such as "I almost agree" or the vagueness of terms and concepts due to the statistical variability in communication [20] and many more. Previously, such fuzzy data was approximated by non-fuzzy (crisp) data, which obviously did not lead to a correct and precise representation of the real world. Fuzzy set theory has been developed to represent and manipulate fuzzy data [18]. Explicitly managing the degree of fuzziness in databases allows the system to distinguish between what is known, what is not known and what is partially known. Systems in the literature whose specific objective is to handle imprecision in databases present various approaches. This paper is concerned with the different ways uncertainty and imprecision are handled in database design. It outlines the major areas of fuzzification in (relational) database systems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.4
• /
• pp.254-268
• /
• 2013

For real-world clustering tasks, the input data is typically not easily separable due to the highly complex data structure or when clusters vary in size, density and shape. Kernel-based clustering has proven to be an effective approach to partition such data. In this paper, we provide an overview of several fuzzy kernel clustering algorithms. We focus on methods that optimize an fuzzy C-mean-type objective function. We highlight the advantages and disadvantages of each method. In addition to the completely unsupervised algorithms, we also provide an overview of some semi-supervised fuzzy kernel clustering algorithms. These algorithms use partial supervision information to guide the optimization process and avoid local minima. We also provide an overview of the different approaches that have been used to extend kernel clustering to handle very large data sets.

• Structural Engineering and Mechanics
• /
• v.53 no.2
• /
• pp.337-354
• /
• 2015

In this article, free vibration of functionally graded (FG) elliptic plates subjected to various classical boundary conditions has been investigated. Literature review reveals no study has been performed based on functionally graded elliptic plates till date. The mechanical kinematic relations are considered based on classical plate theory. Rayleigh-Ritz technique is used to obtain the generalized eigenvalue problem. The material properties of the FG plate are assumed to vary along thickness direction of the constituents according to power-law form. Trial functions denoting the displacement components are expressed in simple algebraic polynomial forms which can handle any edge support. The objective is to study the effect of geometric configurations and gradation of constituent volume fractions on the natural frequencies. New results for frequency parameters are incorporated after performing a test of convergence. A comparison study is carried out with existing literature for validation in special cases. Three-dimensional mode shapes for circular and elliptic FG plates are also presented with various boundary conditions at the edges.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.