• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.77-86
• /
• 2000

Consumers facing a large number of brands to choose from are known to use simplified heuristic to screen a set of relevant brands called the consideration set from the whole alternatives, Purchase decisions are then made from the brands in the consideration set, Two approaches have been suggested to model the two-stage choice process., One is to treat the con-sideration set as a crisp set (e.g Roberts and Lattin 1991) The other is to treat the set as a fuzzy set (e.g. Fortheringham 1988) The paper empirically compares the two types of models using data for soft drinks sneakers and departments. The results show that a model employing the crisp set approach fits the data better than that with the fuzzy set approach and better than a single-stage choice logit model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.53-56
• /
• 2000

In this paper, we define a concept of some set-theoretical operations of L-R type fuzzy numbers and discuss some properties of these concepts. Using these results, we discuss a concept of cardinality of type-two fuzzy sets.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.139-158
• /
• 1995

A temporal database systems provides timing information and maintains history of data compared to the conventional database system. In this paper, we present a temporal relational database which use an interval-stamping method for instant-based events and for interval-based states. A set of temporal algebraic operators are developed on an instance of time and interval of time so that we can manipulate events and states at a same time. The set of operation is the basis for creating a relational algebra that is closed for temporal relations. And temporal SQL is also suggested as a temporal query relational language for our algebraic operations on temporal relations.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.59-69
• /
• 2009

The element reduction of a multiset S is to reduce the number of repetitions of an element in S by a predetermined number. Privacy-preserving element reduction of a multiset is an important tool in private computation over multisets. It can be used by itself or by combination with other private set operations. Recently, an efficient privacy-preserving element reduction method was proposed by Kissner and Song [7]. In this paper, we point out a mathematical flaw in their polynomial representation that is used for the element reduction protocol and provide its correction. Also we modify their over-threshold set-operation protocol, using an element reduction with the corrected representation, which is used to output the elements that appear over the predetermined threshold number of times in the multiset resulting from other privacy-preserving set operations.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.1
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Journal of the military operations research society of Korea
• /
• v.8 no.2
• /
• pp.57-68
• /
• 1982

Bimatrix games are the two-person non-zero-sum non-cooperative games. These games were studied by Mills, Lemke, Howson, Millham, Winkels, and others. This paper is a systematic and synthetic survey relevant to bimatrix games. Among the many aspects of researches on bimatrix games, emphasis in this paper is placed on the relation of the equilibrium set to Nash subsets. Topics discussed are as follows: Properties of equilibrium point; The structure of equilibrium set; Relation of Nash subsets to equilibrium set; Algorithm for finding the equilibrium points; Concepts of solutions on bimatrix games.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.215-215
• /
• 1988

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.59-65
• /
• 1988

This paper discusses the problem of coordinating aggregate planning and production schedules, minimizing the combined set-up inventory and capacity costs. In this study, by using the relation of fixed production quantity and the number of set-up we develop a heuristirc procedure of solving the discrete demand, fixed production quantity, variable capacity problem. First, we obtain the trade-off between set-up cost and capacity cost, then search the point minimizing the combined inventory and capacity costs.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.127-127
• /
• 1993

Separating Hyperplane의 기하학적인 성질을 이용하여, 일반적인 Closed Convex Set들의 교집합에 속하는 점을 찾아가는 방법을 제안하고, 교집합에 속하는 점을 찾아가는 과정에서 그 교집합의 공집합 여부를 판정할 수 있는 방법을 제안하였다. 이 기법은 기존의 방법들이 가정하는 수렴조건보다 더 일반적인 조건 하에서도 수렴성을 갖는 것을 증명할 수 있었으며, 그 교집합의 공집합 여부를 선형부동식 해의 존재 유무로 판정할 수 있는 방법을 제시하였다. 몇가지 특수한 경우의 Convex Set들의 경우에 대한 기법의 적용 결과도 알아 보기로 한다.