In-Chan Choi

In-Chan Choi

Auto-generated profile, based on publicly available information

In-Chan Choi

School of Industrial Management Engineering Korea University 5 ga Anam-dong Seongbuk-gu 136-713 Seoul Republic of Korea

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2002 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
ICIn-Chan Choi
In-Chan Choi
DCDae-Sik Choi
Dae-Sik Choi

27 April 2015 in Journal of the Association for Information Science and Technology
Verified
Journal Article
Closed access
PDF file
YWYanshan Wang
Yanshan Wang
JLJae‐Sung Lee
Jae‐Sung Lee
ICIn‐Chan Choi
In‐Chan Choi

25 May 2006
Verified
Conference Paper
Closed access
YSYosung Shim
Yosung Shim
Jiwon A. ChungJiwon A. Chung
Jiwon A. Chung
ICIn-Chan Choi
In-Chan Choi
Cluster analysis is widely used in the initial stages of data analysis and data reduction. The K-means algorithm, a nonhierarchical clustering algorithm, has regained popularity among researchers in data mining and knowledge discovery, partly because of its low time complexity. The algorithm requires the number of clusters as an input parameter. When the parameter value is not known a priori, a researcher often has to use a cluster validity index to search for a suitable parameter value. In this study, we use computational experiments to examine the performance of cluster validity indices with the K-means algorithm. Our analysis parallels the study performed by Milligan and Cooper on cluster validity indices; we use hierarchical clustering algorithms and present observations and conclusions resulting from the simulation study

1 January 2014 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
FWFeng Wang
Feng Wang
ICInchan Choi
Inchan Choi
This paper studies a single‐period supply chain with a buy‐back contract under a Stackelberg game model, in which the supplier (leader) decides on the wholesale price, and the retailer (follower) responds to determine the retail price and the order quantity. We analytically investigate the decentralized retailer’s optimal decision. Our results demonstrate that the retailer has a unique optimal simultaneous decision on the retail price and the order quantity, under a mild restriction on the demand distribution. Moreover, as it can be shown that the decentralized supply chain facing price‐sensitive random demand cannot be coordinated with buy‐back contract, we propose a scheme for the system to achieve Pareto‐improvement. Theoretical analysis suggests that there exists a unique Pareto‐equilibrium for the supply chain. In particular, when the Pareto‐equilibrium is reached, the supply chain is coordinated. Numerical experiments confirm our results.

9 February 2023 in IEEE Access
Verified
Journal Article
Open access
YJYoung-Min Jun
Young-Min Jun
ICIn-Chan Choi
In-Chan Choi
Multi-bit Toffoli gates form an essential quantum gate class for quantum algorithms. For the scalable implementation of a quantum algorithm, a multi-bit Toffoli gate should be efficiently decomposed into elementary single- or multi-qubit quantum gates, such as CNOT, T, and Hadarmard. We propose an engineering method for the practical synthesis of multi-bit Toffoli gates. Two optimization models and their closed-form solutions are presented for optimal decomposition of the multi-bit Toffoli gate. These models are based on linearized multi-objective integer programming with parameters such as the targeting ancillae number, ancillae states, and basis gates. This method supports the systematic handling of quantum circuit constraints, such as the total number of available qubits and limit on circuit depth, drawn from various quantum hardware specifications. Our approach shows promise in a noisy intermediate-scale quantum environment, providing a quick and optimal method to synthesize multi-bit Toffoli gates with characteristics such as diverse and unpredictable quantum hardware specifications.

22 June 2021 in PLOS ONE
Verified
Journal Article
Open access
PDF file
JJJihye Jung
Jihye Jung
ICIn-Chan Choi
In-Chan Choi
Quantum computing is a newly emerging computing environment that has recently attracted intense research interest in improving the output fidelity, fully utilizing its high computing power from both hardware and software perspectives. In particular, several attempts have been made to reduce the errors in quantum computing algorithms through the efficient synthesis of quantum circuits. In this study, we present an application of an optimization model for synthesizing quantum circuits with minimum implementation costs to lower the error rates by forming a simpler circuit. Our model has a unique structure that combines the arc-subset selection problem with a conventional multi-commodity network flow model. The model targets the circuit synthesis with multiple control Toffoli gates to implement Boolean reversible functions that are often used as a key component in many quantum algorithms. Compared to previous studies, the proposed model has a unifying yet straightforward structure for exploiting the operational characteristics of quantum gates. Our computational experiment shows the potential of the proposed model, obtaining quantum circuits with significantly lower quantum costs compared to prior studies. The proposed model is also applicable to various other fields where reversible logic is utilized, such as low-power computing, fault-tolerant designs, and DNA computing. In addition, our model can be applied to network-based problems, such as logistics distribution and time-stage network problems.