1<!doctype html> 2<html lang="ko"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1"><meta name="description" content="POSTECH LST Lab. â Stochastic Systems Lab. ì 조·ìì¬ íì´ë°ì´ì 모ë¸(MFM, MatFM), Graph Ontology, Queueing-Informed Machine Learningì ì°êµ¬í©ëë¤."><meta name="theme-color" content="#172937"><meta name="robots" content="index, follow"><title>ì°êµ¬ ë¶ì¼ | LST Lab. · Stochastic Systems Lab.</title><link rel="icon" type="image/png" href="../assets/favicon.png"><link rel="preconnect" href="https://rsms.me" crossorigin><link rel="preconnect" href="https://cdn.jsdelivr.net" crossorigin><link rel="stylesheet" href="../assets/webfonts.css?v=19"><link rel="stylesheet" href="../assets/styles.css?v=19">
2<script defer src="../assets/content.js?v=19"></script>
2<script id="portrait-data" defer src="../assets/portraits.js"></script>
2<script defer src="../assets/gallery-data.js"></script>
2<script defer src="../assets/computing-data.js?v=19"></script>
2<script defer src="../assets/content-model.js?v=19"></script>
2<script defer src="../assets/app.js?v=19"></script>
2</head><body data-route="/research" data-root=".." data-portable="false"><a href="#main" class="skip-link">본문ì¼ë¡ ì´ë / Skip to content</a><header class="site-header" id="site-header"><div class="container header-inner"><a class="brand" href="../index.html" aria-label="íë¥ ìì¤í
ì°êµ¬ì¤ · LST Lab. · POSTECH í"><img src="../assets/lst-logo.png" alt="LST Lab. ë¡ê³ " width="38" height="43"><span class="brand-copy"><span class="brand-name">íë¥ ìì¤í
ì°êµ¬ì¤</span><span class="brand-sub">LST Lab.<span class="brand-affiliation"> · POSTECH</span></span></span></a><nav class="nav" id="primary-nav" aria-label="주ì ë©ë´"><div class="nav-research"><div class="nav-research-top"><a href="../research/index.html" aria-current="page">Research</a><button class="research-toggle" data-action="research-menu" aria-controls="research-dropdown" aria-expanded="false" aria-label="ì°êµ¬ íì ë©ë´ ì´ê¸°"><svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="m9 5 7 7-7 7"/></svg></button></div><div class="research-dropdown" id="research-dropdown" hidden><a href="../research/index.html" aria-current="page">ì°êµ¬ ê°ì</a><a href="../research/mfm/index.html" >MFM · MatFM</a><a href="../research/graph/index.html" >Graph Ontology</a><a href="../research/qiml/index.html" >Queueing-Informed ML</a><a href="../research/computing/index.html" >ì°êµ¬ ì¸íë¼ Â· Computing</a><a href="../research/presentations/index.html" >íì ë°í · Presentations</a></div></div><a href="../projects/index.html" >Projects</a><a href="../people/index.html" >People</a><a href="../publications/index.html" >Publications</a><a href="../news/index.html" >News</a><a href="../gallery/index.html" >Gallery</a><a href="../join/index.html" class="nav-join" >Join Us</a></nav><div class="header-controls"><button class="lang-button" data-action="language" aria-label="Switch to English"><span class="language-full"><b>KO</b> / EN</span><span class="language-compact">EN</span></button><button class="menu-toggle" data-action="menu" aria-label="ë©ë´ ì´ê¸°" aria-expanded="false" aria-controls="primary-nav"><svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 6h16M4 12h16M4 18h16"/></svg></button></div></div></header><main id="main" tabindex="-1"><section class="page-head"><div class="container"><div class="breadcrumb"><a href="../index.html">Home</a><svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="m9 5 7 7-7 7"/></svg><span>Research</span></div><div class="eyebrow">Research</div><h1>ë°ì´í°ë¥¼ ëì´,<br>ìì¤í
ì ì´í´íë íìµ.</h1><p class="lead">ë°ì´í°ë¥¼ ì íìµíë ê²ë§ì¼ë¡ ì¶©ë¶í ê¹ì? LST Lab.ì íë¥ ì 구조, ì§ìì ê´ê³, ì°ì
íì¥ì ì ì½ì í¨ê» ê³ ë ¤íë ì°êµ¬ë¥¼ ì§í¥í©ëë¤.</p></div></section><section class="section"><div class="container"><div class="research-grid"><a class="research-card foundation" href="../research/mfm/index.html"><div class="card-visual"><span class="card-number">01</span><svg viewBox="0 0 340 180" xmlns="http://www.w3.org/2000/svg" role="img" aria-label="MFMê³¼ MatFMì ì¸ì½ë·ëì½ë ì°êµ¬ 구조"><title>MFMê³¼ MatFMì ì¸ì½ë·ëì½ë ì°êµ¬ 구조</title><defs><marker id="tip-d9" markerWidth="7" markerHeight="7" refX="6" refY="3.5" orient="auto"><path d="M0 0 7 3.5 0 7Z" fill="#849aa8"/></marker><marker id="redtip-d9" markerWidth="7" markerHeight="7" refX="6" refY="3.5" orient="auto"><path d="M0 0 7 3.5 0 7Z" fill="#ad1940"/></marker></defs><path d="M83 61h34" fill="none" stroke="#849aa8" stroke-width="1.7" marker-end="url(#tip-d9)"/><path d="M83 120h34" fill="none" stroke="#849aa8" stroke-width="1.7" marker-end="url(#tip-d9)"/><path d="M212 61h24" fill="none" stroke="#849aa8" stroke-width="1.7" marker-end="url(#tip-d9)"/><path d="M212 120h24" fill="none" stroke="#849aa8" stroke-width="1.7" marker-end="url(#tip-d9)"/><rect x="8" y="40" width="76" height="43" rx="11" fill="#e9f3f7" stroke="#b7d7e4"/><text x="46" y="65.98" fill="#09698c" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="14" font-weight="700" text-anchor="middle"><tspan x="46" dy="0">MFM</tspan></text><rect x="8" y="99" width="76" height="43" rx="11" fill="#f2edf8" stroke="#d6c6e8"/><text x="46" y="124.98" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="14" font-weight="700" text-anchor="middle"><tspan x="46" dy="0">MatFM</tspan></text><rect x="118" y="40" width="94" height="43" rx="11" fill="#e9f3f7" stroke="#b7d7e4"/><text x="165" y="64.7" fill="#09698c" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="700" text-anchor="middle"><tspan x="165" dy="0">ENCODER</tspan></text><rect x="118" y="99" width="94" height="43" rx="11" fill="#f2edf8" stroke="#d6c6e8"/><text x="165" y="123.7" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="700" text-anchor="middle"><tspan x="165" dy="0">ENCODER</tspan></text><rect x="237" y="40" width="94" height="43" rx="11" fill="#e9f3f7" stroke="#b7d7e4"/><text x="284" y="64.7" fill="#09698c" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="700" text-anchor="middle"><tspan x="284" dy="0">DECODER</tspan></text><rect x="237" y="99" width="94" height="43" rx="11" fill="#f2edf8" stroke="#d6c6e8"/><text x="284" y="123.7" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="700" text-anchor="middle"><tspan x="284" dy="0">DECODER</tspan></text><text x="165" y="166" fill="#62717b" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="500" text-anchor="middle"><tspan x="165" dy="0">ì¼ë°í</tspan></text><text x="284" y="166" fill="#62717b" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="500" text-anchor="middle"><tspan x="284" dy="0">í¹í</tspan></text></svg></div><div class="card-body"><div class="card-kicker">MFM & MatFM</div><h3>ì 조·ìì¬<br>íì´ë°ì´ì
모ë¸</h3><p>ì ì¡° ê³µì ê³¼ ìì¬Â·íí©ë¬¼ ë°ì´í°ë¥¼ íìµíê³ , ë¤ìí íì¥ê³¼ ê³¼ì ì ì ìíë 모ë¸ì ì°êµ¬í©ëë¤.</p><div class="chips"><span class="chip">Multimodal</span><span class="chip">Generalization</span><span class="chip">Specialization</span></div><div class="card-bottom"><span>ì°êµ¬ ìì¸í 보기</span>
2<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></div></div></a><a class="research-card graph" href="../research/graph/index.html"><div class="card-visual"><span class="card-number">02</span><svg viewBox="0 0 340 180" xmlns="http://www.w3.org/2000/svg" role="img" aria-label="ì¬ì©ì·ìì´í
·문ì·ì
무ì ì§ìê·¸ëí"><title>ì¬ì©ì·ìì´í
·문ì·ì
무ì ì§ìê·¸ëí</title><defs><marker id="tip-d10" markerWidth="7" markerHeight="7" refX="6" refY="3.5" orient="auto"><path d="M0 0 7 3.5 0 7Z" fill="#849aa8"/></marker><marker id="redtip-d10" markerWidth="7" markerHeight="7" refX="6" refY="3.5" orient="auto"><path d="M0 0 7 3.5 0 7Z" fill="#ad1940"/></marker></defs><path d="M64 62L172 41" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M172 41L277 74" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M277 74L231 143" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M231 143L99 145" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M99 145L64 62" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M64 62L231 143" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M172 41L99 145" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><path d="M172 41L231 143" fill="none" stroke="#c3b3d6" stroke-width="1.7" /><circle cx="64" cy="62" r="25" fill="#fff" stroke="#cbb9df"/><text x="64" y="66" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="600" text-anchor="middle"><tspan x="64" dy="0">User</tspan></text><circle cx="172" cy="41" r="25" fill="#fff" stroke="#cbb9df"/><text x="172" y="45" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="600" text-anchor="middle"><tspan x="172" dy="0">Item</tspan></text><circle cx="277" cy="74" r="29" fill="#fff" stroke="#cbb9df"/><text x="277" y="78" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="600" text-anchor="middle"><tspan x="277" dy="0">Document</tspan></text><circle cx="231" cy="143" r="25" fill="#fff" stroke="#cbb9df"/><text x="231" y="147" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="600" text-anchor="middle"><tspan x="231" dy="0">Task</tspan></text><circle cx="99" cy="145" r="25" fill="#fff" stroke="#cbb9df"/><text x="99" y="149" fill="#7040a1" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="600" text-anchor="middle"><tspan x="99" dy="0">Context</tspan></text><circle cx="169" cy="96" r="9" fill="#7040a1"/></svg></div><div class="card-body"><div class="card-kicker">Personalization & Enterprise Context</div><h3>Graph Ontology</h3><p>ê°ì¸Â·ìì´í
·문ì·ì
무ì ê´ê³ë¥¼ 구조ííì¬ ê°ì¸í ì¶ì²ê³¼ 기ì
문ìì ë§¥ë½ ì´í´ë¥¼ ì°êµ¬í©ëë¤.</p><div class="chips"><span class="chip">Knowledge Graph</span><span class="chip">Ontology</span><span class="chip">Context</span></div><div class="card-bottom"><span>ì°êµ¬ ìì¸í 보기</span><svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></div></div></a><a class="research-card qiml" href="../research/qiml/index.html"><div class="card-visual"><span class="card-number">03</span><svg viewBox="0 0 340 180" xmlns="http://www.w3.org/2000/svg" role="img" aria-label="ê´ì¸¡ ë°ì´í°ì ë기모íì ê²°í©íë íìµ êµ¬ì¡°"><title>ê´ì¸¡ ë°ì´í°ì ë기모íì ê²°í©íë íìµ êµ¬ì¡°</title><defs><marker id="tip-d11" markerWidth="7" markerHeight="7" refX="6" refY="3.5" orient="auto"><path d="M0 0 7 3.5 0 7Z" fill="#849aa8"/></marker><marker id="redtip-d11" markerWidth="7" markerHeight="7" refX="6" refY="3.5" orient="auto"><path d="M0 0 7 3.5 0 7Z" fill="#ad1940"/></marker></defs><path d="M99 92h49" fill="none" stroke="#849aa8" stroke-width="1.7" marker-end="url(#tip-d11)"/><path d="M206 92h47" fill="none" stroke="#849aa8" stroke-width="1.7" marker-end="url(#tip-d11)"/><rect x="10" y="65" width="91" height="54" rx="11" fill="#ffffff" stroke="#d5e0e6"/><text x="55.5" y="95.84" fill="#172937" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="12" font-weight="700" text-anchor="middle"><tspan x="55.5" dy="0">DATA</tspan></text><rect x="148" y="56" width="60" height="74" rx="11" fill="#e9f5f1" stroke="#b9dcd2"/><text x="178" y="98.12" fill="#1c7868" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="16" font-weight="700" text-anchor="middle"><tspan x="178" dy="0">ML</tspan></text><rect x="255" y="65" width="75" height="54" rx="11" fill="#ffffff" stroke="#d5e0e6"/><text x="292.5" y="95.52" fill="#172937" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="11" font-weight="700" text-anchor="middle"><tspan x="292.5" dy="0">ì측</tspan></text><text x="179" y="35" fill="#1c7868" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="10" font-weight="650" text-anchor="middle"><tspan x="179" dy="0">QUEUEING MODEL</tspan></text><path d="M179 40v15" fill="none" stroke="#1c7868" stroke-width="1.7" marker-end="url(#tip-d11)"/><text x="170" y="155" fill="#62717b" font-family="Inter,Pretendard,Apple SD Gothic Neo,Malgun Gothic,NanumGothic,sans-serif" font-size="11" font-weight="500" text-anchor="middle"><tspan x="170" dy="0">Data loss + Queueing residual</tspan></text></svg></div><div class="card-body"><div class="card-kicker">Operational Dynamics & Learning</div><h3>Queueing-Informed<br>Machine Learning</h3><p>ë기ì´ë¡ ìì ì»ì ìì¤í
ì ëì 구조를 íìµì ë°ìíì¬, ê´ì¸¡ì´ ë¶ì¡±í ì´ììì¤í
ì ì´í´í©ëë¤.</p><div class="chips"><span class="chip">Queueing Theory</span><span class="chip">Fluid Models</span><span class="chip">ML</span></div><div class="card-bottom"><span>ì°êµ¬ ìì¸í 보기</span>
2<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></div></div></a></div><div class="vision-note"><svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><circle cx="12" cy="12" r="9"/><path d="M12 11v6M12 7v1"/></svg><p>ì¸ ì°êµ¬ì¶ì ê°ìì ì°êµ¬ 문ì 를 ë°ì ìí¤ë©°, ì¥ê¸°ì ì¼ë¡ ë°ì´í° íí·ì§ì ë§¥ë½Â·ì´ì ëìíì ì°ê²°ì ì§í¥í©ëë¤. ìë 구조ëë ì°êµ¬ ê°ìì´ë©°, ìì±ë ë¨ì¼ íµí© 모ë¸ì ì미íì§ ììµëë¤.</p></div><div class="spacer-top"><div class="section-head"><div><div class="eyebrow">The mathematical foundation</div><h2>ìë¡ì´ AI를 ë·ë°ì¹¨íë ìíì 기ë°.</h2><p>íë¥ ìì¤í
ì°êµ¬ë ìë¡ì´ AI ì°êµ¬ì ë³ííë ì°êµ¬ì¤ì íµì¬ ì¶ì
ëë¤.</p></div></div><div class="content-grid"><div class="content-box"><span class="box-number">01 / STOCHASTIC SYSTEMS</span><h3>ë기ì´ë¡ ê³¼ íë¥ ê³¼ì </h3><p>ìê°ì ë°ë¼ ë³íë ë기ìì¤í
, ì 체·íì° ê·¼ì¬, ìì¤í
ì±ë¥ ë¶ìì ì°êµ¬í©ëë¤.</p></div><div class="content-box"><span class="box-number">02 / RELIABILITY</span><h3>ì 뢰ì±ê³¼ ì ì§ë³´ì</h3><p>ë¤ì 구ì±ììë¡ ì´ë£¨ì´ì§ ìì¤í
ì ì´í, ê³ ì¥, ì ì§ë³´ì ìì¬ê²°ì ì ì°êµ¬í©ëë¤.</p></div><div class="content-box"><span class="box-number">03 / DECISIONS UNDER UNCERTAINTY</span><h3>ì뮬ë ì´ì
ê³¼ ìµì í</h3><p>ì
ë ¥ ë¶íì¤ì±ì ê³ ë ¤íë ì뮬ë ì´ì
ê³¼ ê°ê±´í ìì¬ê²°ì ë°©ë²ì ì°êµ¬í©ëë¤.</p></div></div></div><div class="presentations-callout"><div><div class="eyebrow">Presentations</div><h3>ì°êµ¬ë¥¼ ëëë ì리.</h3><p>íì ëí ë°íì ì´ì² ê°ì°ì ì 목·ì ì·íì¬ ê¸°ë¡ì ì´í´ë³´ì¸ì.</p></div><a class="btn secondary" href="../research/presentations/index.html">íì ë°í ì´í´ë³´ê¸°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div><p class="source-note"><a class="text-link" href="../publications/index.html">ê´ë ¨ ê¸°ë¡ ë³´ê¸°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></p></div></section><section class="section compute-teaser-section"><div class="container"><div class="compute-teaser"><div class="compute-teaser-copy"><div class="eyebrow">Computing infrastructure</div><h2>ì°êµ¬ ìì´ëì´ë¥¼,<br>ì¤ì ì¤íì¼ë¡.</h2><p>RTX 4090, RTX PRO 6000, H200 기ë°ì ì°êµ¬ì© GPU ì¸íë¼ë¥¼ ë³´ì íê³ ìì¼ë©°, 2026ë
11ì ì¶ê° ëì
ì ê³ííê³ ììµëë¤.</p><div class="compute-mini-stats"><div><strong>4<small> GPU</small></strong><span>íì¬ ë³´ì </span></div><div><strong>+13<small> GPU</small></strong><span>2026.11 ì¶ê° ëì
ìì </span></div></div><a class="btn primary" href="../research/computing/index.html">ì°êµ¬ ì¸íë¼ ì´í´ë³´ê¸°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div><figure class="compute-teaser-visual"><img src="../images/computing/gpu-server-illustration-thumb.webp" alt="GPU ìë² ì¸íë¼ ì¤ëª
ì© ìì± ì´ë¯¸ì§. ì¤ì ì°êµ¬ì¤ ì¤ì¹ ì¬ì§ì´ë í¹ì ì íì ì¸í·ì¥ì°© 구ì±ì ëíë´ì§ ììµëë¤." loading="lazy" width="1000" height="563"><figcaption>ìë² ì¸íë¼ ì¤ëª
ì© ìì± ì´ë¯¸ì§ · ì¤ë¬¼ ì¬ì§ ìë</figcaption></figure></div></div></section><section class="section wash related-research" data-research-topic="stochastic"><div class="container"><div class="section-head"><div><div class="eyebrow">Related research</div><h2>ê´ë ¨ ë
¼ë¬¸Â·íë¡ì í¸Â·ë°í.</h2><p>íë¥ ìì¤í
· ê¸°ë° ë°©ë²ë¡ </p></div></div><div class="relation-group"><h3>ë
¼ë¬¸ <span class="relation-count">43</span></h3><div class="related-papers"><article class="publication-item"><div class="pub-aside">2026<small>êµì íì ì§</small><small class="record-code">J48</small></div><div><span class="venue-tag">OR Spectrum</span><h3 style="margin-top:13px"><a href="../publications/J48/index.html">Overcoming the curse of dimension of the optimal group maintenance policy of a heterogeneous multi-component series system</a></h3><p class="authors"><span class="author-list" data-paper-id="J48"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Barde, S.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" title="êµì ì ì">Shin, H.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">48, 355â384</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J48/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1007/s00291-025-00831-0" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J48" aria-label="Overcoming the curse of dimension of the optimal group maintenance policy of a heterogeneous multi-component series system BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2026<small>êµì íì ì§</small><small class="record-code">J47</small></div><div><span class="venue-tag">OR Spectrum</span><h3 style="margin-top:13px"><a href="../publications/overlaps/index.html">Queueing Management for Reducing the Overlaps of Customers in Service Systems</a></h3><p class="authors"><span class="author-list" data-paper-id="overlaps"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Xu, J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span>; <span class="author-entry" data-author-index="2">Kong, M.</span>; <span class="author-entry" data-author-index="3">Pender, J.</span></span></p><p class="summary">ìë¹ì¤ ìì¤í
ìì ê³ ê° ê° ì²´ë¥ìê° ì¤ì²©ì ë¶ìíê³ ì´ë¥¼ ì¤ì´ë ì´ì ë°©ìì ì°êµ¬í©ëë¤.</p><p class="status">48, 325â354</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/overlaps/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1007/s00291-025-00816-z" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="overlaps" aria-label="Queueing Management for Reducing the Overlaps of Customers in Service Systems BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2026<small>êµì íì ì§</small><small class="record-code">J46</small></div><div><span class="venue-tag">Queueing Systems</span><h3 style="margin-top:13px"><a href="../publications/J46/index.html">Managing Queueing Systems with Gathering-Averse Customers: Staffing, Pooling, and Opening Hours</a></h3><p class="authors"><span class="author-list" data-paper-id="J46"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Xu, J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1">Huang, D.</span>; <span class="author-entry" data-author-index="2" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span>; <span class="author-entry" data-author-index="3">Pender, J.</span></span></p><p class="status">110(22), 1â64</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J46/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1007/s11134-026-09981-6" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J46" aria-label="Managing Queueing Systems with Gathering-Averse Customers: Staffing, Pooling, and Opening Hours BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2026<small>êµë´íì ì§</small><small class="record-code">D5</small></div><div><span class="venue-tag">Journal of Applied Reliability</span><h3 style="margin-top:13px"><a href="../publications/D5/index.html">Compressing the Markov Chain State Space for Circular k-out-of-n: G Balanced Systems under Sequential External Shocks</a></h3><p class="authors"><span class="author-list" data-paper-id="D5"><span class="author-entry" data-author-index="0" data-member-id="jaehyoung-ju" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ju, J.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" data-member-id="yongkyu-cho" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">26(1), 1â9</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/D5/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="D5" aria-label="Compressing the Markov Chain State Space for Circular k-out-of-n: G Balanced Systems under Sequential External Shocks BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article></div><details class="relation-more"><summary>ëë¨¸ì§ 39ê±´ ë 보기</summary><div class="related-papers"><article class="publication-item"><div class="pub-aside">2025<small>êµì íì ì§</small><small class="record-code">J51</small></div><div><span class="venue-tag">Annals of Operations Research</span><h3 style="margin-top:13px"><a href="../publications/J51/index.html">Overlap approximation schemes in time-varying many-server queues</a></h3><p class="authors"><span class="author-list" data-paper-id="J51"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Xu, J.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">Online published</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J51/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1007/s10479-025-06846-8" target="_blank" rel="noopener noreferrer">
2ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J51" aria-label="Overlap approximation schemes in time-varying many-server queues BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2025<small>êµì íì ì§</small><small class="record-code">J45</small></div><div><span class="venue-tag">IEEE Transactions on Reliability</span><h3 style="margin-top:13px"><a href="../publications/J45/index.html">Analysis on non-monotone control-limit condition-based maintenance policies</a></h3><p class="authors"><span class="author-list" data-paper-id="J45"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Barde, S.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">74(4), 5765â5779</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J45/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/TR.2025.3582813" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J45" aria-label="Analysis on non-monotone control-limit condition-based maintenance policies BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2025<small>êµì íì ì§</small><small class="record-code">J43</small></div><div><span class="venue-tag">Probability in the Engineering and Informational Sciences</span><h3 style="margin-top:13px"><a href="../publications/erlang/index.html">The Number of Overlapping Customers in Erlang-A Queues: An Asymptotic Approach</a></h3><p class="authors"><span class="author-list" data-paper-id="erlang"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì) · êµì ì ì">Pender, J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì), êµì ì ì">1,*</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2">Xu, J.</span></span></p><p class="summary">ì 체·íì° ê·¼ì¬ë¥¼ íì©íì¬ Erlang-A ë기ìì¤í
ì ê³ ê° ì¤ì²© ì를 ë¶ìí©ëë¤.</p><p class="status">39(3), 344â369</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/erlang/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1017/S0269964824000251" target="_blank" rel="noopener noreferrer">
2ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="erlang" aria-label="The Number of Overlapping Customers in Erlang-A Queues: An Asymptotic Approach BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2025<small>êµì íì ì§</small><small class="record-code">J42</small></div><div><span class="venue-tag">Computers & Industrial Engineering</span><h3 style="margin-top:13px"><a href="../publications/J42/index.html">The benefits of a dual-lane zone picking system with buffer-free conveyor lanes: An analytical approach</a></h3><p class="authors"><span class="author-list" data-paper-id="J42"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Tran-Vo, T. H.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" title="êµì ì ì">Hong, S.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">207, 111278</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J42/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1016/j.cie.2025.111278" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J42" aria-label="The benefits of a dual-lane zone picking system with buffer-free conveyor lanes: An analytical approach BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2025<small>êµì íì ì§</small><small class="record-code">J41</small></div><div><span class="venue-tag">Technometrics</span><h3 style="margin-top:13px"><a href="../publications/J41/index.html">Strata Design for Variance Reduction in Stochastic Simulation</a></h3><p class="authors"><span class="author-list" data-paper-id="J41"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Park, J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span>; <span class="author-entry" data-author-index="2" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="3">Shashaani, S.</span></span></p><p class="status">67(5), 203â214</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J41/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/00401706.2024.2416411" target="_blank" rel="noopener noreferrer">
2ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J41" aria-label="Strata Design for Variance Reduction in Stochastic Simulation BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2024<small>êµì íì ì§</small><small class="record-code">J38</small></div><div><span class="venue-tag">IEEE Transactions on Reliability</span><h3 style="margin-top:13px"><a href="../publications/J38/index.html">Condition-based Selective Maintenance Optimization for Large-scale Systems Consisting of Many Homogeneous Units</a></h3><p class="authors"><span class="author-list" data-paper-id="J38"><span class="author-entry" data-author-index="0" data-member-id="euihwan-lee" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Lee, E.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="jaehyoung-ju" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ju, J.</strong></span>; <span class="author-entry" data-author-index="2">Byon, E.</span>; <span class="author-entry" data-author-index="3" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">73(2), 1393â1406</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J38/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/TR.2023.3335903" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J38" aria-label="Condition-based Selective Maintenance Optimization for Large-scale Systems Consisting of Many Homogeneous Units BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2024<small>íìë
¼ë¬¸</small><small class="record-code">T-phuc-nguyen</small></div><div><span class="venue-tag">POSTECH</span><h3 style="margin-top:13px"><a href="../publications/T-phuc-nguyen/index.html">Robust Portfolio Optimization using Sentiment-based Uncertainty Sets</a></h3><p class="authors"><span class="author-list" data-paper-id="T-phuc-nguyen"><span class="author-entry" data-author-index="0" data-member-id="phuc-nguyen" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Nguyen, P. T. H.</strong></span></span></p><p class="status">M.S. thesis</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/T-phuc-nguyen/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="T-phuc-nguyen" aria-label="Robust Portfolio Optimization using Sentiment-based Uncertainty Sets BibTeX">
2BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2024<small>íìë
¼ë¬¸</small><small class="record-code">T-seung-min-baik</small></div><div><span class="venue-tag">POSTECH</span><h3 style="margin-top:13px"><a href="../publications/T-seung-min-baik/index.html">Robust Input Sampling Strategies for Stochastic Simulations with Uncertain Input Model</a></h3><p class="authors"><span class="author-list" data-paper-id="T-seung-min-baik"><span class="author-entry" data-author-index="0" data-member-id="seung-min-baik" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Baik, S. M.</strong></span></span></p><p class="status">Ph.D. thesis</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/T-seung-min-baik/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="T-seung-min-baik" aria-label="Robust Input Sampling Strategies for Stochastic Simulations with Uncertain Input Model BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2023<small>êµì íì ì§</small><small class="record-code">J37</small></div><div><span class="venue-tag">IISE Transactions</span><h3 style="margin-top:13px"><a href="../publications/J37/index.html">QoS-aware energy-efficient workload routing and server speed control policy in data centers: a robust queueing theoretic approach</a></h3><p class="authors"><span class="author-list" data-paper-id="J37"><span class="author-entry" data-author-index="0" data-member-id="seung-min-baik" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Baik, S. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">55(12), 1242â1255</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J37/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/24725854.2023.2183531" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J37" aria-label="QoS-aware energy-efficient workload routing and server speed control policy in data centers: a robust queueing theoretic approach BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2023<small>êµì íì ì§</small><small class="record-code">J36</small></div><div><span class="venue-tag">IEEE Access</span><h3 style="margin-top:13px"><a href="../publications/J36/index.html">Reliability Improvement of Circular k-out-of-n: G Balanced Systems through Center of Gravity</a></h3><p class="authors"><span class="author-list" data-paper-id="J36"><span class="author-entry" data-author-index="0" data-member-id="yongkyu-cho" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="seung-min-baik" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Baik, S. M.</strong></span>; <span class="author-entry" data-author-index="2" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">11, 91407â91422</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J36/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/ACCESS.2023.3308204" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J36" aria-label="Reliability Improvement of Circular k-out-of-n: G Balanced Systems through Center of Gravity BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2023<small>êµì íí ë
¼ë¬¸</small><small class="record-code">C2</small></div><div><span class="venue-tag">Winter Simulation Conference</span><h3 style="margin-top:13px"><a href="../publications/C2/index.html">Robust Importance Sampling for Stochastic Simulations with Uncertain Parametric Input Model</a></h3><p class="authors"><span class="author-list" data-paper-id="C2"><span class="author-entry" data-author-index="0" data-member-id="seung-min-baik" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Baik, S. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span>; <span class="author-entry" data-author-index="2">Byon, E.</span></span></p><p class="status">397â408</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/C2/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/WSC60868.2023.10407266" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="C2" aria-label="Robust Importance Sampling for Stochastic Simulations with Uncertain Parametric Input Model BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2023<small>ìí¹íì´í¼</small><small class="record-code">W2</small></div><div><span class="venue-tag">Working paper</span><h3 style="margin-top:13px"><a href="../publications/W2/index.html">Distributionally Robust Stratified Sampling for Stochastic Simulations With Multiple Uncertain Input Models</a></h3><p class="authors"><span class="author-list" data-paper-id="W2"><span class="author-entry" data-author-index="0" data-member-id="seung-min-baik" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Baik, S. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1">Byon, E.</span>; <span class="author-entry" data-author-index="2" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">Working-paper record · 2023</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/W2/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="W2" aria-label="Distributionally Robust Stratified Sampling for Stochastic Simulations With Multiple Uncertain Input Models BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2022<small>êµì íì ì§</small><small class="record-code">J34</small></div><div><span class="venue-tag">Operations Research Letters</span><h3 style="margin-top:13px"><a href="../publications/J34/index.html">General EM Algorithm for Fitting Non-Monotone Hazard Functions from Truncated and Censored Observations</a></h3><p class="authors"><span class="author-list" data-paper-id="J34"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Barde, S.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" title="êµì ì ì">Shin, H.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">50(5), 476â483</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J34/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1016/j.orl.2022.07.001" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J34" aria-label="General EM Algorithm for Fitting Non-Monotone Hazard Functions from Truncated and Censored Observations BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2022<small>êµì íì ì§</small><small class="record-code">J33</small></div><div><span class="venue-tag">IISE Transactions</span><h3 style="margin-top:13px"><a href="../publications/J33/index.html">Optimal budget allocation for stochastic simulation with importance sampling: exploration vs. replication</a></h3><p class="authors"><span class="author-list" data-paper-id="J33"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">54(9), 881â893</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J33/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/24725854.2021.1953197" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J33" aria-label="Optimal budget allocation for stochastic simulation with importance sampling: exploration vs. replication BibTeX">
2BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2022<small>êµì íì ì§</small><small class="record-code">J32</small></div><div><span class="venue-tag">IEEE Access</span><h3 style="margin-top:13px"><a href="../publications/J32/index.html">Power- and QoS-Aware Job Assignment with Dynamic Speed Scaling for Cloud Data Center Computing</a></h3><p class="authors"><span class="author-list" data-paper-id="J32"><span class="author-entry" data-author-index="0" data-member-id="yongkyu-cho" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">10, 38284â38298</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J32/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/ACCESS.2022.3165566" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J32" aria-label="Power- and QoS-Aware Job Assignment with Dynamic Speed Scaling for Cloud Data Center Computing BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2021<small>êµì íì ì§</small><small class="record-code">J31</small></div><div><span class="venue-tag">Annals of Applied Statistics</span><h3 style="margin-top:13px"><a href="../publications/J31/index.html">Nonparametric Importance Sampling for Wind Turbine Reliability Analysis with Stochastic Computer Models</a></h3><p class="authors"><span class="author-list" data-paper-id="J31"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Li, S.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">15(4), 1850â1871</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J31/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1214/21-AOAS1490" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J31" aria-label="Nonparametric Importance Sampling for Wind Turbine Reliability Analysis with Stochastic Computer Models BibTeX">
2BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2021<small>êµì íì ì§</small><small class="record-code">J29</small></div><div><span class="venue-tag">IEEE Transactions on Reliability</span><h3 style="margin-top:13px"><a href="../publications/J29/index.html">Uncertainty Quantification for Extreme Quantile Estimation with Stochastic Computer Models</a></h3><p class="authors"><span class="author-list" data-paper-id="J29"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Pan, Q.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">70(1), 134â145</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J29/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/TR.2020.2980448" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J29" aria-label="Uncertainty Quantification for Extreme Quantile Estimation with Stochastic Computer Models BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2020<small>êµì íì ì§</small><small class="record-code">J27</small></div><div><span class="venue-tag">IEEE Transactions on Reliability</span><h3 style="margin-top:13px"><a href="../publications/J27/index.html">Economic Design and Maintenance of a Circular k-out-of-n: G Balanced System with Load-Sharing Units</a></h3><p class="authors"><span class="author-list" data-paper-id="J27"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Endharta, A. J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">69(4), 1465â1479</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J27/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/TR.2020.2969236" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J27" aria-label="Economic Design and Maintenance of a Circular k-out-of-n: G Balanced System with Load-Sharing Units BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2020<small>êµì íì ì§</small><small class="record-code">J25</small></div><div><span class="venue-tag">Naval Research Logistics</span><h3 style="margin-top:13px"><a href="../publications/J25/index.html">Adaptive Importance Sampling for Extreme Quantile Estimation with Stochastic Black Box Computer Models</a></h3><p class="authors"><span class="author-list" data-paper-id="J25"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Pan, Q.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span>; <span class="author-entry" data-author-index="2" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="3">
2Lam, H.</span></span></p><p class="status">67(7), 524â547</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J25/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1002/nav.21938" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J25" aria-label="Adaptive Importance Sampling for Extreme Quantile Estimation with Stochastic Black Box Computer Models BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2020<small>êµì íì ì§</small><small class="record-code">J24</small></div><div><span class="venue-tag">Operations Research Letters</span><h3 style="margin-top:13px"><a href="../publications/J24/index.html">Fitting Discrete Phase-type Distribution from Censored and Truncated Observations with Pre-specified Hazard Sequence</a></h3><p class="authors"><span class="author-list" data-paper-id="J24"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Barde, S.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2" title="êµì ì ì">Shin, H.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">48(3), 233â239</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J24/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1016/j.orl.2020.02.009" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J24" aria-label="Fitting Discrete Phase-type Distribution from Censored and Truncated Observations with Pre-specified Hazard Sequence BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2020<small>êµì íì ì§</small><small class="record-code">J23</small></div><div><span class="venue-tag">Annals of Operations Research</span><h3 style="margin-top:13px"><a href="../publications/J23/index.html">Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates</a></h3><p class="authors"><span class="author-list" data-paper-id="J23"><span class="author-entry" data-author-index="0" data-member-id="yongkyu-cho" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">293, 27â55</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J23/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1007/s10479-019-03511-9" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J23" aria-label="Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2019<small>íìë
¼ë¬¸</small><small class="record-code">T-yongkyu-cho</small></div><div><span class="venue-tag">POSTECH</span><h3 style="margin-top:13px"><a href="../publications/T-yongkyu-cho/index.html">Resource Management in Data Centers for Energy-Efficiency, Time-Stable Performance, and Quality-of-Service</a></h3><p class="authors"><span class="author-list" data-paper-id="T-yongkyu-cho"><span class="author-entry" data-author-index="0" data-member-id="yongkyu-cho" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong></span></span></p><p class="status">Ph.D. thesis</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/T-yongkyu-cho/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="T-yongkyu-cho" aria-label="Resource Management in Data Centers for Energy-Efficiency, Time-Stable Performance, and Quality-of-Service BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2018<small>êµì íì ì§</small><small class="record-code">J20</small></div><div><span class="venue-tag">Reliability Engineering & System Safety</span><h3 style="margin-top:13px"><a href="../publications/J20/index.html">Reliability Evaluation of Circular k-out-of-n: G Balanced Systems through Minimal Path Sets</a></h3><p class="authors"><span class="author-list" data-paper-id="J20"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Endharta, A. J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1">Yun, W. Y.</span>; <span class="author-entry" data-author-index="2" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">180, 226â236</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J20/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1016/j.ress.2018.07.023" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J20" aria-label="Reliability Evaluation of Circular k-out-of-n: G Balanced Systems through Minimal Path Sets BibTeX">
2BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2018<small>êµì íì ì§</small><small class="record-code">J18</small></div><div><span class="venue-tag">Stochastic Models</span><h3 style="margin-top:13px"><a href="../publications/J18/index.html">Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes</a></h3><p class="authors"><span class="author-list" data-paper-id="J18"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Pender, J.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">34(2), 186â206</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J18/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/15326349.2018.1425886" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J18" aria-label="Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2018<small>êµì íì ì§</small><small class="record-code">J17</small></div><div><span class="venue-tag">Networks</span><h3 style="margin-top:13px"><a href="../publications/J17/index.html">Energy Efficiency of Data Center Operating Practices: Server Clustering, Powering On/Off, and Bang-Bang Control</a></h3><p class="authors"><span class="author-list" data-paper-id="J17"><span class="author-entry" data-author-index="0" data-member-id="yongkyu-cho" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">71(2), 107â119</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J17/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1002/net.21752" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J17" aria-label="Energy Efficiency of Data Center Operating Practices: Server Clustering, Powering On/Off, and Bang-Bang Control BibTeX">
2BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2018<small>íìë
¼ë¬¸</small><small class="record-code">T-euihwan-lee</small></div><div><span class="venue-tag">POSTECH</span><h3 style="margin-top:13px"><a href="../publications/T-euihwan-lee/index.html">Condition-based Selective Maintenance Optimization for a Large-scale Non-Markovian System</a></h3><p class="authors"><span class="author-list" data-paper-id="T-euihwan-lee"><span class="author-entry" data-author-index="0" data-member-id="euihwan-lee" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Lee, E.</strong></span></span></p><p class="status">M.S. thesis</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/T-euihwan-lee/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="T-euihwan-lee" aria-label="Condition-based Selective Maintenance Optimization for a Large-scale Non-Markovian System BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2017<small>êµì íì ì§</small><small class="record-code">J16</small></div><div><span class="venue-tag">INFORMS Journal on Computing</span><h3 style="margin-top:13px"><a href="../publications/J16/index.html">Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues</a></h3><p class="authors"><span class="author-list" data-paper-id="J16"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Pender, J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">29(4), 688â704</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J16/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1287/ijoc.2017.0760" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J16" aria-label="Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2017<small>êµì íì ì§</small><small class="record-code">J12</small></div><div><span class="venue-tag">Operations Research Letters</span><h3 style="margin-top:13px"><a href="../publications/J12/index.html">Diffusion Limits for the (MAPt/PHt/â)N Queueing Network</a></h3><p class="authors"><span class="author-list" data-paper-id="J12"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Pender, J.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">45(3), 248â253</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J12/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1016/j.orl.2017.03.006" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J12" aria-label="Diffusion Limits for the (MAPt/PHt/â)N Queueing Network BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2017<small>êµì íì ì§</small><small class="record-code">J11</small></div><div><span class="venue-tag">IISE Transactions</span><h3 style="margin-top:13px"><a href="../publications/J11/index.html">Condition-based joint maintenance optimization for a large-scale system with homogeneous units</a></h3><p class="authors"><span class="author-list" data-paper-id="J11"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">49(5), 493â504</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J11/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/0740817X.2016.1241457" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J11" aria-label="Condition-based joint maintenance optimization for a large-scale system with homogeneous units BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2017<small>íìë
¼ë¬¸</small><small class="record-code">T-insoo-jung</small></div><div><span class="venue-tag">POSTECH</span><h3 style="margin-top:13px"><a href="../publications/T-insoo-jung/index.html">A Markov Chain Analysis of State Transitions of Chronic Diseases using Medical Checkup Data</a></h3><p class="authors"><span class="author-list" data-paper-id="T-insoo-jung"><span class="author-entry" data-author-index="0" data-member-id="insoo-jung" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Jung, I.</strong></span></span></p><p class="status">M.S. thesis</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/T-insoo-jung/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="T-insoo-jung" aria-label="A Markov Chain Analysis of State Transitions of Chronic Diseases using Medical Checkup Data BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2017<small>ìí¹íì´í¼</small><small class="record-code">W1</small></div><div><span class="venue-tag">Working paper</span><h3 style="margin-top:13px"><a href="../publications/W1/index.html">A Markov Chain Analysis for State Transitions of Hypertension Using Medical Checkup Data</a></h3><p class="authors"><span class="author-list" data-paper-id="W1"><span class="author-entry" data-author-index="0" data-member-id="insoo-jung" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Jung, I.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1">Kim, J. H.</span>; <span class="author-entry" data-author-index="2">Kang, S.-H.</span>; <span class="author-entry" data-author-index="3" data-member-id="professor" title="êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">Working-paper record · 2017</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/W1/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="W1" aria-label="A Markov Chain Analysis for State Transitions of Hypertension Using Medical Checkup Data BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2015<small>êµì íì ì§</small><small class="record-code">J8</small></div><div><span class="venue-tag">IEEE Communications Letters</span><h3 style="margin-top:13px"><a href="../publications/J8/index.html">A simple analysis of the transient period in peer-to-peer networks</a></h3><p class="authors"><span class="author-list" data-paper-id="J8"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì), êµì ì ì">1,*</sup></span></span></p><p class="status">19(9), 1528â1531</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J8/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/LCOMM.2015.2446486" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J8" aria-label="A simple analysis of the transient period in peer-to-peer networks BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2015<small>êµì íì ì§</small><small class="record-code">J7</small></div><div><span class="venue-tag">IEEE Transactions on Reliability</span><h3 style="margin-top:13px"><a href="../publications/J7/index.html">Reliability evaluation of large-scale systems with identical units</a></h3><p class="authors"><span class="author-list" data-paper-id="J7"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Byon, E.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">64(1), 420â434</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J7/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/TR.2014.2368895" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J7" aria-label="Reliability evaluation of large-scale systems with identical units BibTeX">
2BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2014<small>êµì íì ì§</small><small class="record-code">J5</small></div><div><span class="venue-tag">Performance Evaluation</span><h3 style="margin-top:13px"><a href="../publications/J5/index.html">A distributed speed scaling and load balancing algorithm for energy efficient data centers</a></h3><p class="authors"><span class="author-list" data-paper-id="J5"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · êµì ì ì · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì), êµì ì ì">1,*</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="yongkyu-cho" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Cho, Y.</strong></span></span></p><p class="status">79, 120â133</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J5/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1016/j.peva.2014.07.008" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J5" aria-label="A distributed speed scaling and load balancing algorithm for energy efficient data centers BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2013<small>êµì íì ì§</small><small class="record-code">J4</small></div><div><span class="venue-tag">IIE Transactions</span><h3 style="margin-top:13px"><a href="../publications/J4/index.html">Integrating virtualization, voltage scaling and powering on/off servers in data centers for energy efficiency</a></h3><p class="authors"><span class="author-list" data-paper-id="J4"><span class="author-entry" data-author-index="0" title="주ì ì(ì 1ì ì)">Gallego, J.<sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" data-member-id="professor" title="LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong></span>; <span class="author-entry" data-author-index="2">Polansky, R.</span>; <span class="author-entry" data-author-index="3">Perez, E.</span>; <span class="author-entry" data-author-index="4">Ntaimo, L.</span>; <span class="author-entry" data-author-index="5" title="êµì ì ì">Gautam, N.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">45(10), 1114â1136</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J4/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/0740817X.2012.762484" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J4" aria-label="Integrating virtualization, voltage scaling and powering on/off servers in data centers for energy efficie
2ncy BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2013<small>êµì íì ì§</small><small class="record-code">J3</small></div><div><span class="venue-tag">INFORMS Journal on Computing</span><h3 style="margin-top:13px"><a href="../publications/J3/index.html">Critically loaded time-varying multiserver queues: computational challenges and approximations</a></h3><p class="authors"><span class="author-list" data-paper-id="J3"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Gautam, N.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">25(2), 285â301</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J3/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1287/ijoc.1120.0502" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J3" aria-label="Critically loaded time-varying multiserver queues: computational challenges and approximations BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2010<small>êµì íì ì§</small><small class="record-code">J2</small></div><div><span class="venue-tag">IIE Transactions</span><h3 style="margin-top:13px"><a href="../publications/J2/index.html">Transient analysis of queues for peer-based multimedia content delivery</a></h3><p class="authors"><span class="author-list" data-paper-id="J2"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Gautam, N.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">42(12), 881â896</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J2/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1080/0740817X.2010.491501" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J2" aria-label="Transient analysis of queues for peer-based multimedia content delivery BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2010<small>êµì íì ì§</small><small class="record-code">J1</small></div><div><span class="venue-tag">IEEE/ACM Transactions on Networking</span><h3 style="margin-top:13px"><a href="../publications/J1/index.html">Epidemic-based information dissemination in wireless mobile sensor networks</a></h3><p class="authors"><span class="author-list" data-paper-id="J1"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1" title="êµì ì ì">Gautam, N.<sup class="author-role" aria-label="êµì ì ì">*</sup></span></span></p><p class="status">18(6), 1738â1751</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/J1/index.html">
2ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><a class="btn secondary" href="https://doi.org/10.1109/TNET.2010.2048122" target="_blank" rel="noopener noreferrer">ë
¼ë¬¸ ì문<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M14 4h6v6M20 4 10 14M20 14v6H4V4h6"/></svg></a><button class="btn secondary" data-bib="J1" aria-label="Epidemic-based information dissemination in wireless mobile sensor networks BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article><article class="publication-item"><div class="pub-aside">2007<small>êµì íí ë
¼ë¬¸</small><small class="record-code">C1</small></div><div><span class="venue-tag">IEEE Conference on Decision and Control</span><h3 style="margin-top:13px"><a href="../publications/C1/index.html">Optimal Policies for Control of Peers in Online Multimedia Services</a></h3><p class="authors"><span class="author-list" data-paper-id="C1"><span class="author-entry" data-author-index="0" data-member-id="professor" title="주ì ì(ì 1ì ì) · LST Lab. 구ì±ì · 졸ì
ì í¬í¨"><strong class="lab-author">Ko, Y. M.</strong><sup class="author-role" aria-label="주ì ì(ì 1ì ì)">1</sup></span>; <span class="author-entry" data-author-index="1">Chamberland, J.-F.</span>; <span class="author-entry" data-author-index="2">Gautam, N.</span></span></p><p class="status">3800â3805</p></div><div class="pub-actions"><a class="btn secondary" href="../publications/C1/index.html">ìì¸ ì ë³´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a><button class="btn secondary" data-bib="C1" aria-label="Optimal Policies for Control of Peers in Online Multimedia Services BibTeX">BibTeX <svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="8" y="8" width="12" height="13" rx="2"/><path d="M16 8V3H3v13h5"/></svg></button></div></article></div></details></div><div class="relation-group"><h3>íë¡ì í¸ <span class="relation-count">10</span></h3><div class="project-grid"><article class="project-card"><div class="agency">íêµíê³µì°ì£¼ì°ì
</div><h3><a href="../projects/kai-2022/index.html">ë°ì´í° ì¦ê° ë° íë¥ ì ìµì í 기ë°ì PBL ì¬ê³ ·ì¸ì¼í°ë¸ ìµì í ëª¨ë¸ ì°êµ¬</a></h3><span class="dates">2022.06 â 2022.11</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/kai-2022/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">íêµì°êµ¬ì¬ë¨</div><h3><a href="../projects/dr-simulation/index.html">ì
ë ¥ ë¶íì¤ì±ì ë°ìí ë¶í¬ì ê°ê±´ ì뮬ë ì´ì
ëª¨ë¸ ê°ë°</a></h3><span class="dates">2021.09 â 2024.02</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/dr-simulation/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">íêµì°êµ¬ì¬ë¨Â·ê¸°ì´ì°êµ¬ì¤ì§ìì¬ì
</div><h3><a href="../projects/brl/index.html">
2ìì°ì ·ì¸ìì ìíì ë¶íì¤ì± ì ëí ê¸°ë° ì°¨ì¸ë ë°°ì ê³íµ ìµì ì´ì ì°êµ¬ì¤</a></h3><span class="dates">2021.06 â 2024.02</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/brl/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">íêµíê³µì°ì£¼ì°ì
</div><h3><a href="../projects/kai-2021/index.html">ë°ì´í°ë§ì´ë 기ë°ì PBL ì¬ê³ ·ì¸ì¼í°ë¸ ìµì í ëª¨ë¸ ì°êµ¬</a></h3><span class="dates">2021.04 â 2021.12</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/kai-2021/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article></div><details class="relation-more"><summary>ëë¨¸ì§ 6ê±´ ë 보기</summary><div class="project-grid"><article class="project-card"><div class="agency">ìì´ì¹ìëì§</div><h3><a href="../projects/henergy-2020/index.html">ì ë ¥ì¤ê° ì
ì°°ì ìí ESS ìµì ì´ì ·ì ë ¥ ìì ì측 ê°ì ë° ìê·ëª¨ PV ë°ì ë íµí© ì측</a></h3><span class="dates">2020.02 â 2021.07</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/henergy-2020/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">ìì´ì¹ìëì§</div><h3><a href="../projects/henergy-2019/index.html">ì ë ¥ì¤ê° ì
ì°°ì ìí ESS ìµì ì´ì ë° ìê·ëª¨ PV ë°ì ë íµí© ì측</a></h3><span class="dates">2019.01 â 2020.01</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/henergy-2019/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">í¬ì¤ì½</div><h3><a href="../projects/microgrid/index.html">ë¶ì°í ì ë ¥ì¸íë¼ì ë¹
ë°ì´í° ê¸°ë° ìëì§ ìê¸ ì측 ë° ë¹ì© ìµìí ì´ì© ìê³ ë¦¬ì¦</a></h3><span class="dates">2018.01 â 2018.11</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/microgrid/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">íêµì°êµ¬ì¬ë¨</div><h3><a href="../projects/datacenter-2016/index.html">ì¤ë§í¸ê·¸ë¦¬ë íê²½ì ë°ìí ëê·ëª¨ ë°ì´í°ì¼í°ì ìëì§ ìµì ì´ì ìê³ ë¦¬ë¬ ë° ì¤ì¦ ì°êµ¬</a></h3><span class="dates">2016.11 â 2021.10</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/datacenter-2016/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">í¼ì ê·¸ë¡ì°</div><h3><a href="../projects/battery/index.html">ì 기ìëì°¨ ë°°í°ë¦¬ ì§ë¨ ìê³ ë¦¬ë¬ ë° ì§ë¨Â·ì ì§ë³´ì ì리모í ê°ë°</a></h3><span class="dates">2014.11 â 2016.10</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/battery/index.html">
2ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article><article class="project-card"><div class="agency">íêµì°êµ¬ì¬ë¨</div><h3><a href="../projects/datacenter-2014/index.html">ìëì§ ê³ í¨ì¨ ë°ì´í° ì¼í°ë¥¼ ìí ì»´í¨í
ìì ê³í ë° ì´ì</a></h3><span class="dates">2014.05 â 2017.04</span><div class="project-bottom"><span class="chip">íë¥ ìì¤í
</span><a class="text-link" href="../projects/datacenter-2014/index.html">ê³¼ì ìê°<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></article></div></details></div><p class="source-note">ê´ë ¨ 기ë¡ì ì°êµ¬ 주ì ë³ ì°ê²°ì 기ì¤ì¼ë¡ íìí©ëë¤. ì§í ì¤ì¸ ê³¼ì ë ë°íê° í´ë¹ 모ë¸ì ì¤ì¦ ìë£ë¥¼ ë»íì§ë ììµëë¤.</p></div></section><section class="section"><div class="container"><div class="join-banner"><div><div class="eyebrow">Your next research question</div><h2>ë¤ì ì°êµ¬ ì§ë¬¸ì, í¨ê» ì°¾ìê°ëë¤.</h2><p>ì´ë¡ ê³¼ ì¤ì 문ì 를 í¨ê» í구íê³ ì¶ì íìì 기ë¤ë¦½ëë¤. ê´ì¬ 주ì ì ë°°ê²½ì ìë ¤ 주ì¸ì.</p></div><a class="btn" href="../join/index.html">ëíì ì§í ìë´<svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.65" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><path d="M4 12h15m-6-6 6 6-6 6"/></svg></a></div></div></section></main><footer class="site-footer" id="site-footer"><div class="container"><nav class="footer-directory" aria-label="ì¬ì´í¸ ìë´"><a href="../people/professor/index.html">êµì ìê°</a><a href="../people/alumni/index.html">졸ì
ì</a><a href="../honors/index.html">ìì·주ì íë</a><a href="../research/presentations/index.html">íì ë°í</a><a href="../gallery/index.html">Gallery</a><a href="../resources/index.html">íìµ ìë´</a><a href="../contact/index.html">ì°ë½ì²</a><a href="../sources/index.html">ì¬ì´í¸ ì´ì© ìë´</a></nav><div class="original-footer"><a class="footer-institution-brand" href="../index.html" aria-label="LST Lab · POSTECH">
2<img src="../images/branding/postech_lst.png" alt="POSTECH · LST Lab" width="2768" height="733" loading="lazy"></a><div class="original-footer-address"><strong>Address</strong><p>Department of Industrial and Management Engineering, POSTECH, 77, Cheongam-ro, Nam-gu, Pohang, Gyeongbuk, Korea (37673)</p><a href="tel:+82542792717">Tel: +82-54-279-2717</a></div></div><div class="original-footer-bottom"><span>COPYRIGHT 2025 Pohang University of Science and Technology. ALL RIGHTS RESERVED.</span><a href="https://www.postech.ac.kr/kor/usage-guide/privacy_policy.do" target="_blank" rel="noopener noreferrer">ê°ì¸ì ë³´ì·¨ê¸ì²ë¦¬ë°©ì¹¨</a><a class="footer-postech" href="https://www.postech.ac.kr/" target="_blank" rel="noopener noreferrer"><img src="../images/branding/postech_silver.png" alt="POSTECH" width="1172" height="164" loading="lazy"></a></div></div></footer><button class="top-button" data-action="top" aria-label="맨 ìë¡"><svg class="icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="1.7"><path d="m6 14 6-6 6 6"/></svg></button><noscript><p style="padding:20px">ê²ì·í·ë°ëª¨ìë JavaScriptê° íìí©ëë¤. ì°ë½ì²: [email protected]</p></noscript></body></html>
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.