• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1300-1303
• /
• 2002

In this paper, we consider how to treat delay-time uncertainties caused by inter-die and intradie variabilities in evaluating the distribution of the critical delay of a CMOS combinatorial circuit, and formulate inter-die variability as a correlation of delays. Then, we propose an algorithm to evaluate the distribution of the critical delay based on the algorithm in ［1] which takes correlations into account. We also show some experimental results to see the effect of the formulation.

• East Asian mathematical journal
• /
• v.31 no.5
• /
• pp.659-665
• /
• 2015

Combining and specializing some known results, we establish six identities which depict six modular relations for the Roger-Ramanujan type identities and two equivalent representations for Jacobian identity expressed in terms of combinatorial partition identities and Ramanujan-Selberg continued fraction. Two q-product identities are also considered.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.695-696
• /
• 2009

• Journal of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.289-309
• /
• 2014

A combinatorial description of the crystal $\mathcal{B}({\infty})$ for finite-dimensional simple Lie algebras in terms of certain Young tableaux was developed by J. Hong and H. Lee. We establish an explicit bijection between these Young tableaux and canonical bases indexed by Lusztig's parametrization, and obtain a combinatorial rule for expressing the Gindikin-Karpelevich formula as a sum over the set of Young tableaux.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1281-1289
• /
• 2016

Richard Stanley suggested the problem of finding combinatorial proofs of formulas for counting regions of certain hyperplane arrangements defined by hyperplanes of the form $x_i=0$, $x_i=x_j$, and $x_i=2x_j$ that were found using the finite field method. We give such proofs, using embroidered permutations and linear extensions of posets.

• East Asian mathematical journal
• /
• v.28 no.1
• /
• pp.101-107
• /
• 2012

For each dimension exceeds 1, determining the number of multi-dimensional partitions of a positive integer is an open question in combinatorial number theory. For n ${\leq}$ 14 and d ${\geq}$ 1 we derive a formula for the function ${\wp}_d(n)$ where ${\wp}_d(n)$ denotes the number of partitions of n arranged on a d-dimensional space. We also give an another definition of the d-dimensional partitions using the union of finite number of divisor sets of integers.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1622-1625
• /
• 2002

This paper studies the bifurcation of combinatorial oscillations in coupled Duffing’s circuits when symmetry is broken. The system consists of two periodic farced circuits coupled by a linear resistor, These two periodic external forces are sinusoidal voltage sources with various phase-shift. We investigate the relation between phase-shift and periodic solutions by analyzing many bifurcation diagrams.

• Honam Mathematical Journal
• /
• v.38 no.4
• /
• pp.809-818
• /
• 2016

Chaudhary and Choi [7] presented 14 identities which reveal certain interesting interrelations among character formulas, combinatorial partition identities and continued partition identities. In this sequel, we aim to give slightly modified versions for 8 identities which are chosen among the above-mentioned 14 formulas.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.101-105
• /
• 2001

본 연구는 유연 생산 시스템에서 버퍼 할당 최적화 알고리즘을 제시한다. 기존의 연구들과는 달리 제안된 알고리즘은 시스템의 복잡성과 Combinatorial특성을 모두 다를 수 있다. 알고리즘은 시뮬레이션을 사용하여 시스템의 복잡성을 모델링하고 수정된 유전 알고리즘을 사용하여 Combinatorial특성을 다루며 버퍼를 최적으로 시스템에 할당하게 한다. 제안된 알고리즘은 첫 번째 제한된 버퍼가 있는 상황에서 시스템 Output을 최대화하는 목적함수를 사용하여 최적 버퍼할당을 찾아내는 것과, 두 번째 원하는 Output을 달성할 수 있는 최소의 총 버퍼 수와 할당을 찾아내는 두 가지 목적함수에 적용된다. 마지막으로 유연 생산 시스템의 성능을 결정짓는 다른 요소들과의 관계를 살펴보기 위해 무인 운반 시스템의 발주방식과 무인 운반차의 수 등을 변화시켜 실험을 수행하고 그 결과를 분석한다.