• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.21-26
• /
• 1998

In this paper, we consider generalized concepts of cardinality of a fuzzy sets and obtaind some properties of new concepts of fuzzy-valued cardinality of type 2 fuzzy sets as fuzzy-valued functions. Also, we investigate examples for the calculation of the generalized cardinality of fuzzy-valued functions and compared with concepts of cardinality of a fuzzy set and a fuzzy-valued function.

• Kyungpook Mathematical Journal
• /
• v.46 no.2
• /
• pp.231-233
• /
• 2006

We characterize those commutative semigroups S such that every non-isomorphic homomorphic image of S has smaller cardinality than S. We also characterize commutative groups with the same property.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.857-862
• /
• 1987

Given a network with k specified vertices bi called centers, a cardinality constrained cover is a family {Bi} of k subsets covering the vertex set of a network, such that each subset Bi corresponds to and contains center bi, and satisfies a given cardinality constraint. A set of cardinality constrained overlapping territories is a cardinality constrained cover such that the total sum of T(B$_{i}$) for all subsets is minimum among all cardinality constrained covers, where T(B$_{i}$) is the summation of the shortest path lengths from center bi to every vertex in B$_{I}$. This paper considers a problem of finding a set of cardinality constrained overlapping territories. and proposes an algorithm for the Problem which has the time and space complexities are O(k$^{3}$$\mid$V$\mid$$^{2}$) and O(k$\mid$V$\mid$+$\mid$E$\mid$), respectively, where V and E are the sets of vertices and edges of a given network, respectively. The concept of overlapping territories has a possibility to be applied to a job assignment problem.oblem.

• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.187-193
• /
• 2014

In this paper, we want to represent a method for ranking of two exponential trapezoidal fuzzy numbers. In this study a new Cardinality between exponential trapezoidal fuzzy numbers is proposed. Cardinality in this method is relatively simple and easier in computation and ranks various types of exponential fuzzy numbers. For the validation the results of the proposed approach are compared with different existing approaches.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.265-272
• /
• 1999

In this paper we define generalized concepts of cardinal-ity of a fuzzy-valued function and obtained some properties of these new concepts.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.184-191
• /
• 1999

The k most vital arcs (k-MVA) of a maximum flow problem is defined as those k arcs whose simultaneous removal from the network causes the greatest decrease in the throughput capability of the remaining system between a specified pair of nodes. In this study, we present a method for determining all the k-MVA in maximum flow problem using a minimal cardinality cut algorithm and k-th minimal cut ranking algorithm. For ranking cardinality cuts, we use Hamacher's ranking algorithm for cut capacity and by comparing present residual capacity of cardinality cut with expected residual capacity of next cardinality cut, we also present termination condition for this algorithm. While the previous methods cannot find all the alternatives for this problem, a method presented here has advantage of determining all the k-MVA.

• Industrial Engineering and Management Systems
• /
• v.16 no.1
• /
• pp.118-128
• /
• 2017

Uncertain factors in finical markets make the prediction of future returns and risk of asset much difficult. In this paper, a model,assuming the admissible errors on expected returns and risks of assets, assisted in the multiperiod mean variance portfolio selection problem is built. The model considers transaction costs, upper bound on borrowing risk-free asset constraints, cardinality constraints and threshold constraints. Cardinality constraints limit the number of assets to be held in an efficient portfolio. At the same time, threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Because of these limitations, the proposed model is a mix integer dynamic optimization problem with path dependence. The forward dynamic programming method is designed to obtain the optimal portfolio strategy. Finally, to evaluate the model, our result of a meaning example is compared to the terminal wealth under different constraints.

• Korean Journal of Child Studies
• /
• v.26 no.2
• /
• pp.43-53
• /
• 2005

The purpose of this study was to investigate children's acquisition of cardinality in terms of a framework that isolates two cognitive components, analysis of knowledge and control of processing. The subjects were 30 4-and 5- year-olds who were asked to solve three problems that required an understanding of cardinality. The problems were designed to place different demands on these processing components on the tasks than the 4-year-olds and correlastion among scores on the three tasks show that there is no correlation between the tower task assessing control and the two tasks that assessed analysis. The implications of the results are that aspects of symbolic development may be a broadly based process that extends beyond domain-specific boundaries.

• Annual Conference on Human and Language Technology
• /
• 2020.10a
• /
• pp.27-31
• /
• 2020

본 논문에서는 BERT가 합성된 새로운 Transformer 구조를 제안한 선행연구를 보완하기 위해 cardinality residual connection을 적용한 새로운 구조의 모델을 제안한다. Transformer의 인코더와 디코더의 셀프어텐션에 BERT를 각각 합성한 모델의 잔차연결을 수정하여 학습 속도와 번역 성능을 개선하고자 한다. 그리고 가중치를 다르게 부여하는 실험으로 어텐션을 선택하는 효과적인 방법을 제시하고 원문의 언어에 맞는 BERT를 사용하는 이유를 설명한다. IWSLT14 독일어-영어 말뭉치와 AI hub에서 제공하는 영어-한국어 말뭉치를 이용한 실험에서는 제안하는 방법의 모델이 기존 모델에 비해 더 나은 학습 속도와 번역 성능을 보였다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.