• School Mathematics
• /
• v.7 no.2
• /
• pp.123-137
• /
• 2005

Elementary combinatorial problem may be classified into three different combinatorial models(selection, distribution, partition). The main goal of this research is to determine the effect of type of combinatorial operation and implicit combinatorial model on problem difficulty. We also classified errors in the understanding combinatorial problem into error of order, repetition, permutation with repetition, confusing the type of object and cell, partition. The analysis of variance of answers from 339 students showed the influence of the implicit combinatorial model and types of combinatorial operations. As a result of clinical interviews, we particularly noticed that some students were not able to transfer the definition of combinatorial operation when changing the problem to a different combinatorial model. Moreover, we have analysed textbooks, and we have found that the exercises in these textbooks don't have various types of problems. Therefore when organizing the teaching , it is necessary to pose various types of problems and to emphasize the transition of combinatorial problem into the different models.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.379-390
• /
• 2005

In this paper, we introduce a new combinatorial auction mechanism - N-Bilateral Optimized Combinatorial Auction (N-BOCA). N-BOCA is a flexible iterative combinatorial auction model that offers optimized trading for multi-suppliers and multi-purchasers in the supply chain. We design the N-BOCA system from the perspectives of architecture, protocol, and trading strategy. Under the given N-BOCA architecture and protocol, auctioneers and bidders have diverse decision strategies for winner determination. This needs flexible modeling environments. Hence, we propose an optimization modeling agent for bid and auctioneer selection. The agent has the capability to automatic model formulation for Integer Programming modeling. Finally, we show the viability of N-BOCA through prototype and experiments. The results say both higher allocation efficiency and effectiveness compared with I-to-N general combinatorial auction mechanisms.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.43-55
• /
• 1996

Explicit formulas for bi-Hermite polynomials are found and their combinatorial model is considered. This combinatorial model is a generalization of the combinatorial model of Hermite polynomials as matching polynomials.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.139-161
• /
• 2006

In this paper, we introduce a new combinatorial auction mechanism - N-Bilateral Optimized Combinatorial Auction (N-BOCA). N-BOCA is a flexible iterative combinatorial auction model that offers optimized trading for multi-suppliers and multi-purchasers in the supply chain. We design the N-BOCA system from the perspectives of architecture, protocol, and trading strategy. Under the given N-BOCA architecture and protocol, auctioneers and bidders have diverse decision strategies f3r winner determination. This needs flexible modeling environments. Hence, we propose an optimization modeling agent for bid and auctioneer selection. The agent has the capability to automatic model formulation for Integer Programming modeling. Finally, we show the viability of N-BOCA through prototype and experiments. The results say both higher allocation efficiency and effectiveness compared with 1-to-N general combinatorial auction mechanisms.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1117-1133
• /
• 2019

We find the asymptotic behavior of Kirillov model for irreducible induced representations of $GL_2$ by using combinatorial methods.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.789-796
• /
• 1997

We consider a Pfaffian and its combinatorial model. We give a bijection between Pfaffian and the generating function of weights of generalized Young tableaux by this combinatorial model, and we find an explicit formula for the Pfaffian by this bijection.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.283-290
• /
• 2008

This paper is motivated by the problem of fitting a group of cuboids into a simplified rotating vessel of the artificial satellite. Here we introduce a combinatorial optimization model which reduces the three-dimensional layout problem with behavioral constraints to a finite enumeration scheme. Moreover, a global combinatorial optimization algorithm is described in detail, which is an improved graph-theoretic heuristic.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.4
• /
• pp.73-89
• /
• 2009

Circular shareholdings among three companies are formed when company A owns stock in company B, company B owns stock in company C, and company C owns stock in company A. Since circular shareholdings among large family-controlled firms are used to give the controlling shareholder greater control or more opportunities to expropriate minority investors, the government has encouraged large business groups to gradually remove their circular shareholdings. In this paper, we propose a combinatorial optimization model that can answer the question, which equity investments among complicated investment relationships of one large business group should be removed to resolve its circular shareholdings. To the best knowledge of the authors, our research is the first one that has approached the circular shareholding problem in respect of management science. The proposed combinatorial optimization model are formulated into integer programming problem and applied to some Korean major business groups.

• Molecules and Cells
• /
• v.44 no.7
• /
• pp.425-432
• /
• 2021

Aging is associated with functional and structural declines in organisms over time. Organisms as diverse as the nematode Caenorhabditis elegans and mammals share signaling pathways that regulate aging and lifespan. In this review, we discuss recent combinatorial approach to aging research employing C. elegans and mammalian systems that have contributed to our understanding of evolutionarily conserved aging-regulating pathways. The topics covered here include insulin/IGF-1, mechanistic target of rapamycin (mTOR), and sirtuin signaling pathways; dietary restriction; autophagy; mitochondria; and the nervous system. A combinatorial approach employing high-throughput, rapid C. elegans systems, and human model mammalian systems is likely to continue providing mechanistic insights into aging biology and will help develop therapeutics against age-associated disorders.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.