• Journal of applied mathematics & informatics
• /
• v.35 no.3_4
• /
• pp.331-347
• /
• 2017

Soft sets are fantastic mathematical tools to handle imprecise and uncertain information in complicated situations. In this paper, we defined the hybrid structure which is the combination of soft set and complex number representation of intuitionistic fuzzy set. We defined basic set theoretic operations such as complement, union, intersection, restricted union, restricted intersection etc. for this hybrid structure. Moreover, we developed this theory to establish some more set theoretic operations like Disjunctive sum, difference, product, conjugate etc.

• Journal of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1239-1260
• /
• 2021

We study the set of star operations on local Noetherian domains D of dimension 1 such that the conductor (D : T) (where T is the integral closure of D) is equal to the maximal ideal of D. We reduce this problem to the study of a class of closure operations (more precisely, multiplicative operations) in a finite extension k ⊆ B, where k is a field, and then we study how the cardinality of this set of closures vary as the size of k varies while the structure of B remains fixed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.28-31
• /
• 1996

A bag is a set-like entity which can contain repeated elements. Fuzzy bags have been studied by Yager, who defined their basic relations and operations. However, his definitions of the basic relations and operations are inconsistent with the corresponding relations and operations for ordinary fuzzy sets. The present paper presents new basic relations and operations of fuzzy bags using a grade sequence for each element of the universal set. Moreover the .alpha.-cut, t-norms, the extension principle, and the composition of fuzzy bag relations are described.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.13-26
• /
• 1992

Set-up reduction is an important aspect of the Japanese Just-In-Time (JIT) and Zero Inventory (ZI) concepts. In this paper, we first analyze the effects of set-up cost reduction on tatal inventory, average lot size and forecast horizon in the dynamic lot size model. We also examine the various effects of set-up cost reduction in the EOQ model and explain why many Japanese firms try to cut set-up cost and/or set-up time greatly.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.2
• /
• pp.253-266
• /
• 2011

We would like to generalize about trapezoidal fuzzy set and to calculate four operations based on the Zadeh's extension principle for two generalized trapezoidal fuzzy sets. And we roll up triangular fuzzy numbers and generalized triangular fuzzy sets into it. Since triangular fuzzy numbers and generalized triangular fuzzy sets are generalized trapezoidal fuzzy sets, we need no more the separate painstaking calculations of addition, subtraction, multiplication and division for two such kinds once the operations are done for generalized trapezoidal fuzzy sets.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.184-189
• /
• 2011

Generalized intuitionistic fuzzy soft set theory, proposed by Park et al. [Journal of Korean Institute of Intelligent Systems 21(3) (2011) 389-394], has been regarded as an effective mathematical tool to deal with uncertainties. In this paper, we prove that certain De Margan's law hold in generalized intuitionistic fuzzy soft set theory with respect to union and intersection operations on generalized intuitionistic fuzzy soft sets. We discuss the basic properties of operations on generalized intuitionistic fuzzy soft sets such as necessity and possibility. Moreover, we illustrate their interconnections between each other.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1257-1265
• /
• 2004

In this paper, We describe a change set that is to manage historical information and to maintain ontologies during long term. We propose several storage policies of ontology using a change set. A change set includes a change operation set and temporal dimensions. A change operation set is composed with schema change operations and data change operations. We propose three storage policies that are storing all the change sets and storing the change sets and versions periodically, storing the change sets and the versions using sum of change operations. Also, we present the experimental results for evaluating the performance of different storage policies.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.125-135
• /
• 2000

Many different statistical and artificial intelligent techniques have been applied to improve the predictability of credit rating. Hybrid models and systems have also been developed by effectively combining different modeling processes or combining the outcomes of individual models. In this paper, we introduced the rough set theory and developed a hybrid credit rating system that combines individual outcomes in terms of rough set theory. An experiment was conducted to compare the prediction capability of the system with those of other methods. The proposed system based on rough set method outperformed the others.

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

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

• Journal of the military operations research society of Korea
• /
• v.8 no.1
• /
• pp.53-70
• /
• 1982

This thesis develops a more realistic and applicable new set covering model that is adjusted and supplied by the existing set covering models, and induces an algorithm for solving the new set covering model, and applies the new model and the algorithm to an actual set covering problems. The new set covering model introduces a probabilistic covering aistance ($0{\eqslantless}p{\eqslantless}1$)or time($0{\eqslantless}p{\eqslantless}1$) instead of a deterministic covering distance(0 or 1) or time (0 or 1) of the existing set covering model. The existing set covering model has not considered the merit of the overcover of customers. But this new set covering model leads a concept of this overcover to a concept of the parallel system reliability. The algorithm has been programmed on the UNIVAC 9030 for solving large-scale covering problems. An application of the new set covering model is presented in order to determine the locations of the air surveillance radars as a set covering problem for a case-study.