• 대한수학교육학회지:학교수학
• /
• 제7권2호
• /
• pp.123-137
• /
• 2005

순열 조합의 문제는 내재된 의미 구조에 의해 선택, 분배, 분할의 세 가지의 유형으로 분류될 수 있다. 본 연구에서는 순열 조합의 연산과 문제 유형의 변인이 문제의 난이도에 미치는 영향을 분석하였다 그리고 문제 이해과정에서의 오류를 순서, 중복, 대상의 구별, 같은 것이 있는 순열, 상자의 구별, 분할의 조건, 기타로 분류하고 이해 단계의 장애를 구체적으로 분석하였다. 연구 결과, 순열 조합 연산과 문제의 유형은 난이도에 유의미한 영향을 미치는 것으로 나타났다. 특히 학생들에게 선택, 분할, 분배 문제간의 변환은 쉽지 않으며 순열 조합의 문제에서 학생들이 겪는 어려움 중 하나는 바로 문제 유형의 차이에서 비롯된다는 것을 알 수 있었다. 또한 현 교과서에서는 선택, 분배, 분할을 고려한 다양한 문제 유형이 부족한 것으로 나타났다. 따라서 순열 조합의 지도에 있어 문제 유형을 활용하여 다양한 의미 구조의 문제를 제시하고, 공식위주가 아닌 문제 상황을 충분히 이해하고 이에 대한 해법을 변형, 확장하는 경험을 강조하는 것이 필요하다고 하겠다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2005년도 공동추계학술대회
• /
• 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.

• 대한수학회논문집
• /
• 제11권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.

• 지능정보연구
• /
• 제12권1호
• /
• pp.139-161
• /
• 2006

본 논문에서는 새로운 조합경매(combinational auction)모형인 다자간 최적화 경매모형(N-Bilateral Optimized Combinatorial Auction; N-BOCA)을 제시하였다. N-BOCA는 다수의 공급자 및 다수의 구매자간 최적화된 거래를 지원하는 조합경매모형이다. 특히 아키텍처, 거래규약, 거래전략 세가지 관점에서 N-BOCA 시스템을 설계하였다. 경매시장 참여자인 경매자들과 입찰자들은 특정 아키텍처 및 거래규약하에서 최적 거래 대상자 선정을 위한 다양한 전략을 가지게 되며 이러한 거래전략에 따른 유연한 의사결정 모델링 지원을 필요로 한다. 이에 본 논문에서는 최적의 입찰 및 경매자 선정을 위한 Integer Programming 모형 기반의 에이전트 시스템을 제시하였다. 아울러 N-BOCA모형의 유용성을 입증하기 위해 프로토타입과 실험결과를 제시하였다. 실험결과, 기존의 일대다 조합경매 모형 대비 높은 거래 성과를 나타내었다.

• 대한수학회논문집
• /
• 제34권4호
• /
• pp.1117-1133
• /
• 2019

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

• 대한수학회논문집
• /
• 제12권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
• /
• 제26권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.

• 한국경영과학회지
• /
• 제34권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
• /
• 제44권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년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• 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.