• Archives of design research
• /
• v.14 no.3
• /
• pp.127-134
• /
• 2001

This study suggests a model of experimental visual artworks with interactive art forms in which 2-D paintings are transformed to interactive 3-D animation works. Multimedia programming was employed to evolve objective still paintings to the animation of computer 3-D images with respect to visual ideas derived from visual components in the still painting and to response to the reactions users. The format and technique of the art works are based upon the contents developed by the author and the research materials are selected from the surrealistic paintings of tile world-famous Belgian painter, Rene Magritte. In the present paper, following topics are discussed in detail: a study of various visual cases occurring in transforming still paintings to animation works containing interactive components; a study of 3-D imaging and image processing techniques to transform 2-D paintings to 3-D images; animation techniques for interaction and overall structuring techniques; multimedia programming and user interface.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.4
• /
• pp.265-276
• /
• 2005

ELECTRE IS requires the decision maker (DM) to specify several parameters such as weights, pseudo-criteria thresholds and the concordance level. Among these parameters, the concordance level has a significant effect on the outranking relation. And the number of alternatives selected may be sensitive to the value of these parameters. Therefore the DM may have to perform many iterations to obtain the desired number of alternatives in the kernel set. In this study, we developed a mixed-integer programming (MIP) model to elicit the concordance level and thereby to choose the desired number of alternatives in the kernel set. The MIP model can be applied in the interactive process so that the pseudo-criteria thresholds are adjusted according to the results of MIP model. Using the MIP model in the interactive process, we can reduce the number of iterations needed to perform ELECTRE IS.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.513-524
• /
• 2006

The ammunition allocation problem is a Multi-objective optimization(MOO) problem, maximizing fill-rate of multiple user troops and minimizing transportation time. Recent studies attempted to solve this problem by the prior preference articulation approach such as goal programming. They require that all the preference information of decision makers(DM) should be extracted prior to solving the problem. However, the prior preference information is difficult to implement properly in a rapidly changing state of war. Moreover they have some limitations such as heavy cognitive effort required to DM. This paper proposes a new ammunition allocation model based on more reasonable assumptions and uses an interactive MOO method to the ammunition allocation problem to overcome the limitations mentioned above. In particular, this article uses the GDF procedure, one of the well-known interactive optimization methods in the MOO liter-ature, in solving the ammunition allocation problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.111-126
• /
• 2002

This paper presents an interactive decision procedure to aggregate each group member's preferences when each group member articulates his or her preference information incompletely. An index, an indicative for the preference strength between alternatives, is derived to aid each decision maker to articulate preference information about alternatives. We develop a mathematical programming model that can establish dominance relations when the preference information about values of alternatives, attribute weights, and group member's importance weights are provided incompletely. Also, the preference relation between alternatives is to be considered in the model. Based on the preference strength measure and mathematical model, we develop an interactive group decision support procedure.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.163-175
• /
• 1997

This paper presents the algorithm for finding the compensatory solution for fuzzy multiobjective nonlinear programming problem using $\gamma$-operator. The proposed algorithm can be applied to all cases with multiobjective problems since the interactive process with a decision maker is simple, various uncertainties involved on decision making are eliminated and all the objectives are well balanced. On the basis of proposed algorithm, an illustrative numerical example is presented.

• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.116-124
• /
• 1987

This paper studies to develop the procedure which is combined by the progressive goals and progressive weights generation method. This procedure minimizes the number of questions the decision maker has to make, and also satisfies the generated minimum goal of each objective function. With the procedure developed, we are able to improve the previous multiple objective linear programming techniques in two points.

• The Pure and Applied Mathematics
• /
• v.3 no.1
• /
• pp.73-81
• /
• 1996

Multiple objective programming has been a popular research area since 1970. The pervasiveness of multiple objective in decision problems have led to explosive growth during the 1980's. Several approaches (interactive methods, feasible direction methods, criterion weight space methods, Lagrange multiplies methods, etc) have been developed for solving decision problems having multiple objectives. However there are still many mathematically challengings including multiple objective integer, nonlinear optimization problems which require further mathematically oriented research. (omitted)

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.75-80
• /
• 1996

Fuzzy approaches used to solve MONLP(Multiobjective Nonlinear Programming Problem) are based on the max-min method of fuzzy sets theory However, since the min operator noncompensatory, these approaches can not guarentee an efficient solution to the problem. In this paper, we presents an algorithm for finding the aggregation operator to find efficient solution. In particular, our presented algorithm is guarentee an efficient solution. On the basis of proposed algorithm, an illustrative numerical example is presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.14-30
• /
• 1985

Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools with satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design as interactive software package for microcomputers based on this method. From some computational experiences, we can state that the revised iterative goal simplex method using the sparsity technique is the most efficient one for microcomputer for solving goal programming problems.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.4
• /
• pp.1-6
• /
• 2004

For an e-learning class, many voice and video technics for enhancing student teacher interaction. But for programming exercise courses, it's very difficult to add interactive components via web browser. In this paper, we make an online algorithm bank to manage and search algorithms, build an programming exercise interface on web. Students can edit, compile and execute programs included in online algorithm bank. Online program compile and execution enhance e-learning effectiveness for programming courses, and make students feel ease for computer algorithms.