<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Changhyun Kwon | Main / RecentChanges</title>
<link>http://www.chkwon.net/rss</link>
<description>Main.RecentChanges</description>
<lastBuildDate>Mon, 13 Feb 2012 18:43:59 GMT</lastBuildDate>
<item>
<title>MATLAB</title>
<link>http://www.chkwon.net/Main/MATLAB</link>
<description><![CDATA[<div class='toc'><p><a name='toc' id='toc'></a><b>Table of Contents</b> (<a id="tocidtog" href="javascript:toggle('tocid');">hide</a>)</p><ol class='toc' id='tocid'><li>1.&#8194;<a href='#toc1'>Some Readings</a></li><li>2.&#8194;<a href='#toc2'>MATLAB Central File Exchange</a></li><li>3.&#8194;<a href='#toc3'>Recipes</a><ol class='toc'><li>3.1&#8194;<a href='#toc4'>Some useful expressions</a></li><li>3.2&#8194;<a href='#toc5'>How to control the number of markers in figure?</a></li></ol></li></ol></div>
<div class='vspace'></div><h1><a name='toc1' id='toc1'></a>1.&#8194;  Some Readings</h1>
<ul><li>(<a class='urllink' href='http://www.glue.umd.edu/~tvp/401/matlabprob.html' title='' rel='nofollow'>LINK</a>) - Common Problems with MATLAB
</li><li>(<a class='urllink' href='http://www.rz.uni-freiburg.de/dienste/plattformen/ibm/compserver/frames/matlab/techdoc/matlab_prog/ch7_perf.html' title='' rel='nofollow'>LINK</a>) - Maximizing MATLAB Performance
</li><li>(<a class='urllink' href='http://unix.eng.ua.edu/MathWorks/manuals/techdoc/matlab_prog/ch8_pr18.html' title='' rel='nofollow'>LINK</a>) - Optimizing for Speed
</li><li>(<a class='urllink' href='http://www-h.eng.cam.ac.uk/help/tpl/programs/Matlab/faster_scripts.html' title='' rel='nofollow'>LINK</a>) - Matlab - faster scripts
</li><li>(<a class='urllink' href='http://www-h.eng.cam.ac.uk/help/tpl/programs/Matlab/tricks.html' title='' rel='nofollow'>LINK</a>) - Matlab vectorisation tricks
</li><li>(<a class='urllink' href='http://www.mathworks.com/support/tech-notes/1100/1109.shtml' title='' rel='nofollow'>LINK</a>) -  Code Vectorization Guide
</li><li><a class='urllink' href='http://www.spatial-econometrics.com/' title='' rel='nofollow'>Econometrics Toolbox for MATLAB</a>
</li></ul><div class='vspace'></div><h1><a name='toc2' id='toc2'></a>2.&#8194;  MATLAB Central File Exchange</h1>
<ul><li><a class='urllink' href='http://www.mathworks.com/matlabcentral/fileexchange/16179-save2pdf' title='' rel='nofollow'><code>save2pdf</code></a> - Save figures as PDF files
</li><li><a class='urllink' href='http://www.mathworks.com/matlabcentral/fileexchange/25298-fig2texps-export-matlab-figure-to-latex' title='' rel='nofollow'><code>fig2texPS</code></a> - Export MATLAB figures to LaTeX
</li><li><a class='urllink' href='http://www.mathworks.com/matlabcentral/fileexchange/22022' title='' rel='nofollow'><code>matlab2tikz</code></a> - Save MATLAB figures as <code>tikzpicture</code> in LaTeX.
</li></ul><div class='vspace'></div><h1><a name='toc3' id='toc3'></a>3.&#8194; Recipes</h1>
<h2><a name='toc4' id='toc4'></a>3.1&#8194;  Some useful expressions </h2>
<ul><li>Custom function
</li></ul>
<div class='sourceblock ' id='sourceblock1'>
  <div class='sourceblocktext'><div class="matlab">x = fminunc<span class="br0">&#40;</span>@<span class="br0">&#40;</span>x<span class="br0">&#41;</span> myfun<span class="br0">&#40;</span>x,a<span class="br0">&#41;</span>,x0<span class="br0">&#41;</span>;<br />
&#160; myfun = @<span class="br0">&#40;</span>x<span class="br0">&#41;</span> x+<span class="nu0">2</span>+a;</div></div>
  <div class='sourceblocklink'></div>
</div>

<ul><li>2D plotting of 3D data
</li></ul>
<div class='sourceblock ' id='sourceblock2'>
  <div class='sourceblocktext'><div class="matlab"><span class="kw2">plot</span><span class="br0">&#40;</span><span class="br0">&#91;</span><span class="nu0">1</span>:<span class="nu0">10</span><span class="br0">&#93;</span>, <span class="kw2">squeeze</span><span class="br0">&#40;</span>r<span class="br0">&#40;</span><span class="nu0">1</span>,<span class="nu0">1</span>,:<span class="br0">&#41;</span><span class="br0">&#41;</span><span class="br0">&#41;</span>;</div></div>
  <div class='sourceblocklink'></div>
</div>

<ul><li>Repeat matrix
</li></ul>
<div class='sourceblock ' id='sourceblock3'>
  <div class='sourceblocktext'><div class="matlab"><span class="kw2">repmat</span><span class="br0">&#40;</span>A, <span class="br0">&#91;</span><span class="nu0">1</span>,<span class="nu0">1</span>,N<span class="br0">&#93;</span><span class="br0">&#41;</span>;</div></div>
  <div class='sourceblocklink'></div>
</div>

<ul><li>Setting font sizes in plots
</li></ul>
<div class='sourceblock ' id='sourceblock4'>
  <div class='sourceblocktext'><div class="matlab"><span class="kw2">set</span><span class="br0">&#40;</span><span class="nu0">0</span>,<span class="co2">'DefaultAxesFontSize'</span>,<span class="nu0">14</span><span class="br0">&#41;</span></div></div>
  <div class='sourceblocklink'></div>
</div>

<div class='vspace'></div><h2><a name='toc5' id='toc5'></a>3.2&#8194;  How to control the number of markers in figure?</h2>
<p>When the size of data is large, using markers in plot is a pain. MATLAB simply puts all the data points with markers, so the plot looks very ugly. I found that drawing three times for a data series looks stupid, but definitely works. Please see the following codes as an example:
</p>
<div class='vspace'></div>
<div class='sourceblock ' id='sourceblock5'>
  <div class='sourceblocktext'><div class="matlab">num_data = <span class="nu0">200</span>;<br />
num_marker = <span class="nu0">10</span>;<br />
marker_space = num_data / num_marker;<br />
<br />
<span class="co1">% x data</span><br />
x = <span class="kw2">linspace</span><span class="br0">&#40;</span><span class="nu0">0</span>,<span class="nu0">2</span>,num_data<span class="br0">&#41;</span>; <br />
<br />
<span class="co1">% y data</span><br />
y1 = <span class="kw2">exp</span><span class="br0">&#40;</span>x<span class="br0">&#41;</span>;<br />
y2 = <span class="nu0">5</span>-<span class="kw2">exp</span><span class="br0">&#40;</span>-x<span class="br0">&#41;</span>;<br />
<br />
<span class="co1">% make font size big</span><br />
<span class="kw2">set</span><span class="br0">&#40;</span><span class="nu0">0</span>,<span class="co2">'DefaultAxesFontSize'</span>,<span class="nu0">14</span><span class="br0">&#41;</span> <br />
<br />
<span class="co1">% draw a figure</span><br />
fig1 = <span class="kw2">figure</span>;<br />
<span class="kw2">hold</span> on; <span class="kw2">grid</span> on;<br />
<br />
<span class="co1">% (1) these two for legend</span><br />
plot1 = <span class="kw2">plot</span><span class="br0">&#40;</span>x<span class="br0">&#40;</span><span class="nu0">1</span><span class="br0">&#41;</span>,y1<span class="br0">&#40;</span><span class="nu0">1</span><span class="br0">&#41;</span>, <span class="co2">'ko-'</span>,<span class="co2">'LineWidth'</span>,<span class="nu0">2</span><span class="br0">&#41;</span>;<br />
plot2 = <span class="kw2">plot</span><span class="br0">&#40;</span>x<span class="br0">&#40;</span><span class="nu0">1</span><span class="br0">&#41;</span>,y2<span class="br0">&#40;</span><span class="nu0">1</span><span class="br0">&#41;</span>, <span class="co2">'b*--'</span>,<span class="co2">'LineWidth'</span>,<span class="nu0">2</span><span class="br0">&#41;</span>;<br />
<br />
<span class="co1">% (2) these two for markers</span><br />
<span class="kw2">plot</span><span class="br0">&#40;</span>x<span class="br0">&#40;</span><span class="nu0">1</span>:marker_space:num_data<span class="br0">&#41;</span>, y1<span class="br0">&#40;</span><span class="nu0">1</span>:marker_space:num_data<span class="br0">&#41;</span>, <span class="co2">'ko'</span>,<span class="co2">'LineWidth'</span>,<span class="nu0">2</span><span class="br0">&#41;</span>;<br />
<span class="kw2">plot</span><span class="br0">&#40;</span>x<span class="br0">&#40;</span><span class="nu0">1</span>:marker_space:num_data<span class="br0">&#41;</span>, y2<span class="br0">&#40;</span><span class="nu0">1</span>:marker_space:num_data<span class="br0">&#41;</span>, <span class="co2">'b*'</span>,<span class="co2">'LineWidth'</span>,<span class="nu0">2</span><span class="br0">&#41;</span>;<br />
<br />
<span class="co1">% (3) these two for lines</span><br />
<span class="kw2">plot</span><span class="br0">&#40;</span>x,y1,<span class="co2">'k'</span>,<span class="co2">'LineWidth'</span>,<span class="nu0">2</span><span class="br0">&#41;</span>;<br />
<span class="kw2">plot</span><span class="br0">&#40;</span>x,y2,<span class="co2">'b--'</span>,<span class="co2">'LineWidth'</span>,<span class="nu0">2</span><span class="br0">&#41;</span>;<br />
<br />
<span class="kw2">legend</span><span class="br0">&#40;</span><span class="co2">'y_1'</span>,<span class="co2">'y_2'</span>,<span class="co2">'Location'</span>,<span class="co2">'Best'</span><span class="br0">&#41;</span>;<br />
<span class="kw2">xlabel</span><span class="br0">&#40;</span><span class="co2">'Name of x data \gamma '</span><span class="br0">&#41;</span>;<br />
<span class="kw2">ylabel</span><span class="br0">&#40;</span><span class="co2">'Name of y data'</span><span class="br0">&#41;</span>;<br />
<br />
<span class="co1">% save the figure as a 600-dpi PDF file</span><br />
save2pdf<span class="br0">&#40;</span><span class="co2">'figure_filename'</span>,fig1,<span class="nu0">600</span><span class="br0">&#41;</span>;</div></div>
  <div class='sourceblocklink'></div>
</div>

<p class='vspace'>To save the figure as a PDF file, I recommend <a class='urllink' href='http://www.mathworks.com/matlabcentral/fileexchange/16179-save2pdf' title='' rel='nofollow'><code>save2pdf</code></a>. The result is:
</p><div> <img width='600' src='http://www.chkwon.net/pmwiki/uploads/Main/matlab_marker_plot.png' alt='' title='' /> </div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2012-02-13T18:43:59Z</dc:date>
<pubDate>Mon, 13 Feb 2012 18:43:59 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>LaTeX</title>
<link>http://www.chkwon.net/Main/LaTeX</link>
<description><![CDATA[<div class='toc'><p><b>Table of Contents</b> (<a id="tocidtog" href="javascript:toggle('tocid');">hide</a>)</p><ol class='toc' id='tocid'><li>1.&#8194;<a href='#toc1'>How to start LaTeX (Windows)</a></li><li>2.&#8194;<a href='#toc2'>Sample Tasks to Complete for Beginners</a></li><li>3.&#8194;<a href='#toc3'>Readings</a><ol class='toc'><li>3.1&#8194;<a href='#toc4'>TeX books</a></li></ol></li><li>4.&#8194;<a href='#toc5'>Links</a></li><li>5.&#8194;<a href='#toc6'>Useful Tools</a><ol class='toc'><li>5.1&#8194;<a href='#toc7'>Graphics</a></li></ol></li><li>6.&#8194;<a href='#toc8'>Topics</a><ol class='toc'><li>6.1&#8194;<a href='#toc9'>Citation and Bibliography</a></li><li>6.2&#8194;<a href='#toc10'>Merge</a></li><li>6.3&#8194;<a href='#toc11'>Beamer</a></li><li>6.4&#8194;<a href='#toc12'>Fonts</a></li><li>6.5&#8194;<a href='#toc13'>TeXLive + ko.tex</a></li><li>6.6&#8194;<a href='#toc14'>SumatraPDF + TeXmaker inverse search setup</a></li><li>6.7&#8194;<a href='#toc15'>How to use TeX in GMail and any other website with Firefox</a></li><li>6.8&#8194;<a href='#toc16'>Installing a Spell Checker for TeXworks</a></li><li>6.9&#8194;<a href='#toc17'>CV Templates</a></li><li>6.10&#8194;<a href='#toc18'>Grammar Check</a></li></ol></li></ol></div>
<div class='vspace'></div><h1><a name='toc6' id='toc6'></a>4.&#8194;  How to start LaTeX (Windows)</h1>
<p>I use <a class='urllink' href='http://www.tug.org/texlive/' title='' rel='nofollow'>TeX Live</a> and <a class='urllink' href='http://www.tug.org/texworks/' title='' rel='nofollow'>TeXworks</a>. However, for beginning users, MikTeX and WinEdt might be easier.
</p>
<div class='vspace'></div><ol><li>Download and install <a class='urllink' href='http://www.miktex.org/' title='' rel='nofollow'>MikTeX</a>. (MikTeX is free.)
</li><li>Download and install <a class='urllink' href='http://www.winedt.com/' title='' rel='nofollow'>WinEdt</a>. (WinEdt is a shareware.)
</li><li>Read <a class='urllink' href='http://www.ctan.org/tex-archive/info/lshort/' title='' rel='nofollow'>this document</a>. (This is available for many languages; <a class='urllink' href='http://mirror.ctan.org/info/lshort/english/lshort-letter.pdf' title='' rel='nofollow'>English</a>, <a class='urllink' href='http://mirror.ctan.org/info/lshort/korean/lshort-kr.pdf' title='' rel='nofollow'>Korean</a>, and so on.)
</li><li>Start it.
</li></ol><div class='vspace'></div><h1><a name='toc7' id='toc7'></a>5.&#8194;  Sample Tasks to Complete for Beginners</h1>
<p>After reading the <a class='urllink' href='http://www.ctan.org/tex-archive/info/lshort/' title='' rel='nofollow'>this document</a>, you may try to complete the following tasks:
</p>
<div class='vspace'></div><ol><li>Produce a final PDF file using 'pdflatex', not 'latex'.
</li><li>Include a PDF image file (not JPG, GIF, PNG, EPS, etc) to the document.
</li><li>Write a table.
</li><li>Learn how to manage .bib files. I recommend <a class='urllink' href='http://jabref.sourceforge.net/' title='' rel='nofollow'>JabRef</a>.
</li><li>Using .bib and 'bibtex', cite a reference and create a final PDF file that includes a bibliography.
</li></ol><p class='vspace'>There are several ways to create a final PDF file and include images. I just prefer 'pdflatex' and PDF image formats to other methods and formats.
</p>
<div class='vspace'></div><h1><a name='toc8' id='toc8'></a>6.&#8194;  Readings</h1>
<ul><li><a class='urllink' href='http://www.ctan.org/tex-archive/info/lshort/' title='' rel='nofollow'>The Not So Short Introduction to LaTeX2e</a> - by Tobias Oetiker, Hubert Partl, Irene Hyna and Elisabeth Schlegl - A really nice manual for beginners
</li><li><a class='urllink' href='http://mirrors.ctan.org/info/math/voss/mathmode/Mathmode.pdf' title='' rel='nofollow'>Math mode</a>: A superb explanation of the amsmath package and other math-related issues -- Herbert Voß
<div class='vspace'></div></li><li><a class='urllink' href='http://en.wikibooks.org/wiki/LaTeX' title='' rel='nofollow'>LaTeX Wikibook</a> - This contains good resources for both beginners and intermediate users. A PDF version is available <a class='urllink' href='http://upload.wikimedia.org/wikipedia/commons/2/2d/LaTeX.pdf' title='' rel='nofollow'>here</a>.
<div class='vspace'></div></li><li><a class='urllink' href='http://mirror.ctan.org/info/l2tabu/english/l2tabuen.pdf' title='' rel='nofollow'>Obsolete packages and commands</a> - Mark Trettin (Translated by Jürgen Fenn)
</li><li><a class='urllink' href='http://uit.no/castl/4727/?colapsemenu=colapsemenu' title='' rel='nofollow'>LaTeX for Linguists</a> (but general enough) - Sylvia Blaho and Patrik Bye
</li><li><a class='urllink' href='http://www.andy-roberts.net/misc/latex/index.html' title='' rel='nofollow'>Getting to grips with LaTeX</a> - Andrew Roberts
</li><li><a class='urllink' href='http://www.eng.cam.ac.uk/help/tpl/textprocessing/' title='' rel='nofollow'>Text Processing using LaTeX</a> - Cambridge University
<div class='vspace'></div></li><li><a class='urllink' href='http://www.macrotex.net/texbooks/' title='' rel='nofollow'>Recommended TeX and LaTeX Books</a> - Adam H. Lewenberg
</li></ul><div class='vspace'></div><h2><a name='toc9' id='toc9'></a>6.1&#8194;  TeX books</h2>
<ul><li><a class='urllink' href='http://mirrors.ctan.org/info/gentle/gentle.pdf' title='' rel='nofollow'>A Gentle Introduction to TeX</a> -- Michael Doob
</li><li><a class='urllink' href='http://mirrors.ctan.org/info/impatient/book.pdf' title='' rel='nofollow'>TeX for the Impatient</a> -- Paul W. Abrahams, Kathryn A. Hargreaves, and Karl Berry
</li></ul><div class='vspace'></div><h1><a name='toc10' id='toc10'></a>7.&#8194;  Links</h1>
<ul><li><a class='urllink' href='http://www.ctan.org/' title='' rel='nofollow'>CTAN</a> - the Comprehensive TeX Archive Network 
<div class='vspace'></div></li><li><a class='urllink' href='http://www.tug.org/' title='' rel='nofollow'>TUG</a> - TeX  Users Group
</li><li><a class='urllink' href='http://www.ktug.or.kr' title='' rel='nofollow'>KTUG</a> - Korean TeX  Users Group {ko}
</li><li><a class='urllink' href='http://tex.stackexchange.com/' title='' rel='nofollow'>Tex LaTeX Stack Exchange</a> - collaborative Q&amp;A
<div class='vspace'></div></li><li><a class='urllink' href='http://www.esm.psu.edu/psuthesis/' title='' rel='nofollow'>PSU Thesis</a> - Penn State University Thesis Package
</li><li><a class='urllink' href='http://www.chkwon.net/pmwiki/uploads/Main/PSUThesisSWP.zip' title='' rel='nofollow'>PSU Thesis SWP</a> - PSU Thesis Package for <a class='urllink' href='http://www.mackichan.com' title='' rel='nofollow'>Scientific Workplace</a>
<div class='vspace'></div></li><li><a class='urllink' href='http://www.fauskes.net/pgftikzexamples/' title='' rel='nofollow'>PGF and TikZ examples gallery</a> 
</li></ul><div class='vspace'></div><h1><a name='toc11' id='toc11'></a>8.&#8194;  Useful Tools</h1>
<ul><li><a class='urllink' href='http://jabref.sourceforge.net/' title='' rel='nofollow'>JabRef</a>- Java GUI for managing BibTeX and other bibliographies
</li><li><a class='urllink' href='http://www.ctan.org/tex-archive/support/excel2latex/' title='' rel='nofollow'>Excel To LaTeX Conversion</a> -- You can create LaTeX codes for tables from an Excel spreadsheet directly.
</li><li><a class='urllink' href='http://detexify.kirelabs.org/classify.html' title='' rel='nofollow'>Detexify</a> -- Drawing a symbol will give you the LaTeX code for it.
</li><li><a class='urllink' href='http://william.famille-blum.org/software/sumatra/index.html' title='' rel='nofollow'>SumatraPDF for TeX users</a> -- This lightweight PDF viewer allows updating the document without closing/reloading, and allows inverse search.
</li><li><a class='urllink' href='http://hevea.inria.fr/index.html' title='' rel='nofollow'>HeVeA</a> - A good HTML translator for LaTeX. 
</li><li><a class='urllink' href='http://tug.org/applications/tex4ht/mn.html' title='' rel='nofollow'>TeX4ht</a> - The best HTML translator for LaTeX that I know of. The HTML version of my <a class='wikilink' href='http://www.chkwon.net/Main/CV'>CV</a> is created by the htlatex command of TeX4ht.
</li></ul><div class='vspace'></div><h2><a name='toc12' id='toc12'></a>8.1&#8194;  Graphics</h2>
<ul><li><a class='urllink' href='http://vectormagic.stanford.edu/' title='' rel='nofollow'>VectorMagic</a> - Vectorize your image
</li><li><a class='urllink' href='http://latexpix.comyr.com/latexpix.htm' title='' rel='nofollow'>LaTeXPiX</a>
</li><li><a class='urllink' href='http://inkscape.org/' title='' rel='nofollow'>Inkscape</a> - This is an open source alternative to Adobe Illustrator. Inkscape can export drawings as LaTeX codes (save as PDF).
<ul><li><a class='urllink' href='http://pav.iki.fi/software/textext/#instructions-for-windows' title='' rel='nofollow'>textext</a> - An Inkscape extension to enter LaTeX equations in Inkscape
</li></ul></li><li><a class='urllink' href='http://www.imagemagick.org/' title='' rel='nofollow'>ImageMagick</a> - command-line based image manipulation tool; especially useful for converting image formats
</li></ul>
<div class='sourceblock ' id='sourceblock6'>
  <div class='sourceblocktext'><div class="dos">mogrify -format jpg *.png<br />
convert filename.jpg filename.png</div></div>
  <div class='sourceblocklink'></div>
</div>

<div class='vspace'></div><h1><a name='toc13' id='toc13'></a>9.&#8194;  Topics </h1>
<h2><a name='toc14' id='toc14'></a>9.1&#8194;  Citation and Bibliography</h2>
<ul><li><a class='urllink' href='http://merkel.zoneo.net/Latex/natbib.php' title='' rel='nofollow'>Natbib reference sheet</a>
</li><li><a class='urllink' href='http://www.chkwon.net/pmwiki/uploads/Main/bibtex_guide_kim.pdf' title='' rel='nofollow'>A BibTeX Guide via Examples</a> - Ki-Joo Kim 
</li><li><a class='urllink' href='http://jo.irisson.free.fr/bstdatabase/index.php' title='' rel='nofollow'>LaTeX Bibliography Styles Database</a>
</li><li>Which packages needed for a bibliogrpahy style? See the examples in <a class='urllink' href='http://mirror.cac.psu.edu/pub/CTAN/biblio/bibtex/contrib/' title='' rel='nofollow'>this</a> and <a class='urllink' href='http://www.math.utah.edu/pub/tex/bibtex/' title='' rel='nofollow'>this</a>.
</li></ul><div class='vspace'></div><h2><a name='toc15' id='toc15'></a>9.2&#8194;  Merge</h2>
<ul><li><a class='urllink' href='http://faq.ktug.or.kr/mywiki/PDFMerge' title='' rel='nofollow'>LINK</a> {ko} - PDFMerge
</li><li><a class='urllink' href='http://www.ktug.or.kr/jsboard/read.php?table=contrib&amp;no=611' title='' rel='nofollow'>LINK</a> {ko} - <em>combine</em> package
</li></ul><div class='vspace'></div><h2><a name='toc16' id='toc16'></a>9.3&#8194;  Beamer</h2>
<p>Beamer is to generate presentation slides.
</p>
<div class='vspace'></div><ul><li><a class='urllink' href='http://mirrors.ctan.org/macros/latex/contrib/beamer/doc/beameruserguide.pdf' title='' rel='nofollow'>The Beamer class User Guide</a>
<div class='vspace'></div></li><li><a class='urllink' href='http://www.math.umbc.edu/~rouben/beamer/' title='' rel='nofollow'>A Beamer Quick Guide</a> 
</li><li><a class='urllink' href='http://www.uncg.edu/cmp/reu/presentations/Charles%20Batts%20-%20Beamer%20Tutorial.pdf' title='' rel='nofollow'>A Beamer Tutorial in Beamer</a> -- Charles T. Batts
</li><li><a class='urllink' href='http://www.chkwon.net/pmwiki/uploads/Main/beamer_guide_kim.pdf' title='' rel='nofollow'>Beamer v3.0 Guide</a> - Ki-Joo Kim
</li><li><a class='urllink' href='http://faq.ktug.or.kr/wiki/uploads/MathFonts.pdf' title='' rel='nofollow'>Math Fonts in Beamer</a>
</li><li><a class='urllink' href='http://deic.uab.es/~iblanes/beamer_gallery/index.html' title='' rel='nofollow'>Beamer theme gallery</a>
</li></ul><div class='vspace'></div><h2><a name='toc17' id='toc17'></a>9.4&#8194;  Fonts</h2>
<ul><li><a class='urllink' href='http://www.tug.dk/FontCatalogue/' title='' rel='nofollow'>The LaTeX Font Catalogue</a>
</li><li><a class='urllink' href='http://ctan.tug.org/tex-archive/info/Free_Math_Font_Survey/survey.html' title='' rel='nofollow'>A Survey of Free Math Fonts for TeX and LaTeX</a>
</li><li><a class='urllink' href='http://data12.da.funpic.de/LaTeX/Schriften/miktex_fonts.pdf' title='' rel='nofollow'>MiKTEX 2.3 Font Test</a>
</li><li><a class='urllink' href='http://tex.loria.fr/general/new/fntguide.html' title='' rel='nofollow'>LaTeX2e font selection</a>
<div class='vspace'></div></li><li>Arial
</li></ul>
<div class='sourceblock ' id='sourceblock7'>
  <div class='sourceblocktext'><div class="latex"><span class="sy0">\</span><span class="kw1">usepackage</span><span class="sy0">[</span><span class="re2">T1</span><span class="sy0">]{</span><span class="re9">fontenc<span class="sy0">}</span><br />
<span class="sy0">\</span><span class="kw1">usepackage</span><span class="sy0">[</span><span class="re2">scaled</span><span class="sy0">]{</span>uarial<span class="sy0">}</span><br />
<span class="sy0">\</span><span class="kw1">renewcommand</span>*<span class="re12">\familydefault</span><span class="sy0">{</span><span class="re12">\sfdefault</span></span><span class="sy0">}</span></div></div>
  <div class='sourceblocklink'></div>
</div>

<ul><li>Times Roman
</li></ul>
<div class='sourceblock ' id='sourceblock8'>
  <div class='sourceblocktext'><div class="latex"><span class="sy0">\</span><span class="kw1">usepackage</span><span class="sy0">{</span><span class="re9">mathptmx</span><span class="sy0">}</span></div></div>
  <div class='sourceblocklink'></div>
</div>

<ul><li>Palatino
</li></ul>
<div class='sourceblock ' id='sourceblock9'>
  <div class='sourceblocktext'><div class="latex"><span class="sy0">\</span><span class="kw1">usepackage</span><span class="sy0">{</span><span class="re9">mathpazo</span><span class="sy0">}</span></div></div>
  <div class='sourceblocklink'></div>
</div>

<ul><li>Helvetica
</li></ul>
<div class='sourceblock ' id='sourceblock10'>
  <div class='sourceblocktext'><div class="latex"><span class="sy0">\</span><span class="kw1">usepackage</span><span class="sy0">[</span><span class="re2">T1</span><span class="sy0">]{</span><span class="re9">fontenc<span class="sy0">}</span><br />
<span class="sy0">\</span><span class="kw1">usepackage</span><span class="sy0">[</span><span class="re2">scaled</span><span class="sy0">]{</span>helvet<span class="sy0">}</span><br />
<span class="sy0">\</span><span class="kw1">renewcommand</span>*<span class="re12">\familydefault</span><span class="sy0">{</span><span class="re12">\sfdefault</span></span><span class="sy0">}</span></div></div>
  <div class='sourceblocklink'></div>
</div>

<div class='vspace'></div><h2><a name='toc18' id='toc18'></a>9.5&#8194;  TeXLive + ko.tex </h2>
<p><a class='urllink' href='http://project.ktug.or.kr/ko.TeX/' title='' rel='nofollow'>ko.TeX</a> is a Korean typesetting package.
</p><ul><li>This is for Windows distribution.
</li></ul>
<div class='sourceblock ' id='sourceblock11'>
  <div class='sourceblocktext'><div class="dos"><span class="co2">:: To add ko.tex to your TeXLive installation:</span><br />
tlmgr --location=http://ftp.ktug.or.kr/KTUG/texlive/2011 install collection-kotex<br />
<span class="co2"><br />
:: To update the TeX tree:</span><br />
mktexlsr <br />
<span class="co2"><br />
:: To update some font maps:</span><br />
updmap-sys --enable Map=xxxx.map</div></div>
  <div class='sourceblocklink'></div>
</div>

<div class='vspace'></div><h2><a name='toc19' id='toc19'></a>9.6&#8194;  SumatraPDF + TeXmaker inverse search setup</h2>
<p>At the command line, enter (Windows):
</p>
<div class='sourceblock ' id='sourceblock12'>
  <div class='sourceblocktext'><div class="dos">&#34;C:\Program Files\SumatraPDF\SumatraPDF.exe&#34; -inverse-search &#34;C:\Program Files\Texmaker\texmaker.exe '<span class="sy0">%</span><span class="re2">f</span>' -line <span class="sy0">%</span><span class="re2">l</span>&#34;</div></div>
  <div class='sourceblocklink'></div>
</div>

<p>Change the paths appropriately.
</p>
<p class='vspace'>Or, use <a class='urllink' href='http://william.famille-blum.org/software/sumatra/index.html' title='' rel='nofollow'>SumatraPDF for TeX users</a> and change the option:
</p>
<div class='sourceblock ' id='sourceblock13'>
  <div class='sourceblocktext'><div class="dos">C:\Program Files\Texmaker\texmaker.exe &#34;<span class="sy0">%</span><span class="re2">f</span>&#34; -line <span class="sy0">%</span><span class="re2">l</span></div></div>
  <div class='sourceblocklink'></div>
</div>

<p class='vspace'>However, <a class='urllink' href='http://www.tug.org/texworks/' title='' rel='nofollow'>TeXworks</a> has a nice PDF viewer with a built-in inverse search functionality. TeXworks is probably already installed with your TeX distribution.
</p>
<div class='vspace'></div><h2><a name='toc20' id='toc20'></a>9.7&#8194;  How to use TeX in GMail and any other website with Firefox</h2>
<p>If you use Firefox, you can use send emails with TeX-rendered equation images. 
</p><ul><li><a class='urllink' href='http://thewe.net/tex/' title='' rel='nofollow'>TeX the World</a>
</li></ul><div class='vspace'></div><h2><a name='toc21' id='toc21'></a>9.8&#8194;  Installing a Spell Checker for TeXworks</h2>
<ol><li>Go <a class='urllink' href='http://wiki.services.openoffice.org/wiki/Dictionaries' title='' rel='nofollow'>here</a> and obtain appropriate dictionary files. For example, <a class='urllink' href='http://ftp.services.openoffice.org/pub/OpenOffice.org/contrib/dictionaries/en_US.zip' title='' rel='nofollow'>US English</a>.
</li><li>Follow <a class='urllink' href='http://code.google.com/p/texworks/wiki/SpellingDictionaries' title='' rel='nofollow'>this direction</a> to install the obtained dictionary files.
<ul><li>For Windows 7  place .dic and .aff files in the following directory:
</li></ul></li></ol>
<div class='sourceblock ' id='sourceblock14'>
  <div class='sourceblocktext'><div class="dos"><span class="co2">:: TeXLive</span><br />
C:\Users\<span class="sy0">&lt;</span>user name<span class="sy0">&gt;</span>\.texlive2011\texmf-config\texworks\dictionaries<br />
<span class="co2"><br />
:: MikTeX</span><br />
C:\Users\<span class="sy0">&lt;</span>user name<span class="sy0">&gt;</span>\AppData\Local\MiKTeX\<span class="sy0">&lt;</span>MiKTeX version<span class="sy0">&gt;</span>\TeXworks\<span class="sy0">&lt;</span>TeXworks version<span class="sy0">&gt;</span>\dictionaries</div></div>
  <div class='sourceblocklink'></div>
</div>

<p class='vspace'>Then, restart TeXworks and select the installed dictionary in Edit &gt; Spelling menu.
</p>
<div class='vspace'></div><h2><a name='toc22' id='toc22'></a>9.9&#8194;  CV Templates</h2>
<ul><li><a class='urllink' href='http://nitens.org/taraborelli/cvtex' title='' rel='nofollow'>Dario Taraborelli's template</a> - A very good template. My <a class='wikilink' href='http://www.chkwon.net/Main/CV'>CV</a> is based on this template with some modifications.
</li><li><a class='urllink' href='http://www.cv-templates.info/' title='' rel='nofollow'>The CV Inn</a> 
</li><li><a class='urllink' href='http://tex.stackexchange.com/questions/80/latex-template-for-resume-curriculum-vitae' title='' rel='nofollow'>LaTeX template for resume/curriculum vitae</a> - a stackexchange entry
</li></ul><div class='vspace'></div><h2><a name='toc23' id='toc23'></a>9.10&#8194;  Grammar Check</h2>
<p>One missing functionality in LaTeX is a grammar checker, while Microsoft Word has the best grammar checker. To use MS Word's grammar checker, I do as follows:
</p><ol><li>After all writing is done, convert .tex to .html using the htlatex command of <a class='urllink' href='http://tug.org/applications/tex4ht/mn.html' title='' rel='nofollow'>TeX4ht</a>.
</li><li>Open the html file in a web browser and copy all contents to the clipboard.
</li><li>Open MS Word and paste to a blank document.
</li><li>Check grammar.
</li></ol><div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2012-01-30T03:26:30Z</dc:date>
<pubDate>Mon, 30 Jan 2012 03:26:30 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>MyName</title>
<link>http://www.chkwon.net/Main/MyName</link>
<description><![CDATA[<p>My name is 권창현 in Korean. Its break-down is as follows:
</p>
<div class='vspace'></div>
<table border='1' ><tr ><th  align='center'>Language</th><th  align='center'>Family Name</th><th  align='center' colspan='2'>Given Name</th></tr>
<tr ><td  align='center'>English</td><td  align='center'><a class='urllink' href='http://en.wikipedia.org/wiki/Kwon' title='' rel='nofollow'>Kwon</a></td><td  align='center'>Chang</td><td  align='center'>hyun</td></tr>
<tr ><td  align='center'>Korean</td><td  align='center'><span style='font-size:144%'>권</span></td><td  align='center'><span style='font-size:144%'>창</span></td><td  align='center'><span style='font-size:144%'>현</span></td></tr>
<tr ><td  align='center'><a class='urllink' href='http://en.wikipedia.org/wiki/Hanja' title='' rel='nofollow'>Hanja</a></td><td  align='center'><span style='font-size:144%'>權</span></td><td  align='center'><span style='font-size:144%'>昶</span></td><td  align='center'><span style='font-size:144%'>賢</span></td></tr>
</table>
<div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2012-01-29T02:46:37Z</dc:date>
<pubDate>Sun, 29 Jan 2012 02:46:37 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>Teaching</title>
<link>http://www.chkwon.net/Main/Teaching</link>
<description><![CDATA[<h3>University at Buffalo</h3>
<p>Current students are required to access <a class='urllink' href='http://ublearns.buffalo.edu' title='' rel='nofollow'>UBlearns</a>.
</p>
<div class='vspace'></div><ul><li>IE 320 Engineering Economy (Spring 2012)
</li></ul><p>Applied concepts of economic decision making, including present worth analysis, cash flow equivalence, replacement analysis, equipment selection. Open to students in any discipline.
<a class='urllink' href='http://www.chkwon.net/courses/IE320.pdf' title='' rel='nofollow'>[Sample Syllabus (subject to change)]</a>
</p>
<div class='vspace'></div><ul><li>IE 326 Planning for Production and Service Enterprises (Fall 2008, 2009, 2010, 2011) 
</li></ul><p>Examines principles central to the planning of a production process. Topics include forecasting, location analysis, inventory management, supply chain management, push and pull systems, shop scheduling and lean manufacturing. 
<a class='urllink' href='http://www.chkwon.net/courses/IE326.pdf' title='' rel='nofollow'>[Sample Syllabus (subject to change)]</a>
</p>
<div class='vspace'></div><ul><li>IE 459/514 Revenue Management (Spring 2009, 2010, 2011) 
</li></ul><p>Revenue Management (RM), or Yield Management, is a set of operational tools for generating more revenue with resource allocations and/or dynamic pricing. In this course, we will cover the fundamental concepts of RM, with mathematical models and algorithms, including capacity control, network capacity control, overbooking, dynamic pricing, customer choice modeling, pricing under competition, estimation and forecasting. By the end of this course, students will be able to understand the basic principles of RM, build mathematical models and suggest proper computational solution methods.
<a class='urllink' href='http://www.chkwon.net/courses/IE459-514.pdf' title='' rel='nofollow'>[Sample Syllabus (subject to change)]</a>
</p>
<div class='vspace'></div><ul><li>IE 671 Nonlinear Programming (Fall 2009, 2011) 
</li></ul><p>Introduces single and multivariate classical optimization and Kuhn-Tucker theory. Computational methods, including penalty function, barrier function, gradient, are discussed.
<a class='urllink' href='http://www.chkwon.net/courses/IE671.pdf' title='' rel='nofollow'>[Sample Syllabus (subject to change)]</a>
</p>
<div class='vspace'></div><ul><li>IE 677 Network Optimization (Fall 2010) 
</li></ul><p>Introduces solutions to graph theory and optimization problems on directed and undirected graphs. Network flow, transportation, assignment, maximum flow, shortest path, and minimum spanning tree problems are discussed. Some nonlinear network problems including traffic assignment are also discussed.
<a class='urllink' href='http://www.chkwon.net/courses/IE677.pdf' title='' rel='nofollow'>[Sample Syllabus (subject to change)]</a>
</p>
<div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2012-01-19T18:18:26Z</dc:date>
<pubDate>Thu, 19 Jan 2012 18:18:26 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>QR</title>
<link>http://www.chkwon.net/Main/QR</link>
<description><![CDATA[<p>Changhyun (Chang) Kwon
</p>
<p class='vspace'>Assistant Professor<br>
Department of Industrial &amp; Systems Engineering<br>
University at Buffalo, SUNY<br>
400 Bell Hall, Buffalo, NY 14260, USA
</p>
<p class='vspace'>E-mail: <a href="mailto:chkwon@buffalo.edu">chkwon@buffalo.edu</a><br>
</p>
<p class='vspace'>Web: <a class='urllink' href='http://www.chkwon.net' title='' rel='nofollow'>http://www.chkwon.net</a>
</p>
<p class='vspace'>Office Phone: 716-645-4705
</p>
<p class='vspace'>If you leave a voice message to the above number, Dr. Kwon will receive an email and may check it within an hour or so.
</p>
<div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2012-01-17T17:08:30Z</dc:date>
<pubDate>Tue, 17 Jan 2012 17:08:30 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>Places</title>
<link>http://www.chkwon.net/Main/Places</link>
<description><![CDATA[<div class='toc'><p><b>Table of Contents</b> (<a id="tocidtog" href="javascript:toggle('tocid');">hide</a>)</p><ol class='toc' id='tocid'><li>1.&#8194;<a href='#toc1'>Musuem / Art Gallery</a></li><li>2.&#8194;<a href='#toc2'>National Parks / State Parks</a></li><li>3.&#8194;<a href='#toc3'>Campgrounds</a></li><li>4.&#8194;<a href='#toc4'>Zoo / Aquarium / Botanical Garden</a></li><li>5.&#8194;<a href='#toc5'>Children's Museum</a></li><li>6.&#8194;<a href='#toc6'>University</a></li><li>7.&#8194;<a href='#toc7'>Airports - Destinations and Transfers</a></li></ol></div>
<div class='vspace'></div><h3>Musuem / Art Gallery</h3>
<ul><li>U.S.A.
<ul><li><a class='urllink' href='http://www.albrightknox.org/' title='' rel='nofollow'>Albright-Knox Art Gallery</a>, Buffalo, NY
</li><li><a class='urllink' href='http://www.bmoca.org/' title='' rel='nofollow'>Boulder Museum of Contemporary Art</a>, Boulder, CO
</li><li><a class='urllink' href='http://www.imamuseum.org/' title='' rel='nofollow'>Indianapolis Museum of Art (IMA)</a>, Indianapolis, IN
</li><li><a class='urllink' href='http://www.moca.org/' title='' rel='nofollow'>Museum of Contemporary Art (MOCA)</a>, Los Angeles, CA
</li><li><a class='urllink' href='http://www.mcachicago.org/' title='' rel='nofollow'>Museum of Contemporary Art Chicago</a>, Chicago, IL
</li><li><a class='urllink' href='http://www.mcadenver.org/' title='' rel='nofollow'>Museum of Contemporary Art Denver</a>, Denver, CO
</li><li><a class='urllink' href='http://www.moma.org/' title='' rel='nofollow'>Museum of Modern Art (MoMA)</a>, New York, NY
</li><li><a class='urllink' href='http://www.slam.org/' title='' rel='nofollow'>Saint Louis Art Museum</a>, St. Louis, MO
</li><li><a class='urllink' href='http://www.sfmoma.org/' title='' rel='nofollow'>San Franscisco Museum of Modern Art (SFMOMA)</a>, San Franscisco, CA
</li><li><a class='urllink' href='http://www.toledomuseum.org/' title='' rel='nofollow'>Toledo Museum of Art (TMA)</a>, Toledo, OH
</li></ul><div class='vspace'></div></li><li>Canada
<ul><li><a class='urllink' href='http://www.ago.net/' title='' rel='nofollow'>Art Gallery of Ontario (AGO)</a>, Toronto, Ontario
</li><li><a class='urllink' href='http://www.mmfa.qc.ca/' title='' rel='nofollow'>Montreal Museum of Fine Arts</a>, Montreal, Quebec
</li><li><a class='urllink' href='http://www.gallery.ca/' title='' rel='nofollow'>National Gallery of Canada</a>, Ottawa, Ontario
</li></ul><div class='vspace'></div></li><li>Europe
<ul><li><a class='urllink' href='http://www.britishmuseum.org/' title='' rel='nofollow'>British Museum</a>, London, U.K.
</li><li><a class='urllink' href='http://www.kunsthaus.ch/' title='' rel='nofollow'>Kunsthaus Zurich</a>, Zurich, Switzerland
</li></ul></li></ul><div class='vspace'></div><h3>National Parks / State Parks</h3>
<ul><li>U.S.A.
<ul><li><a class='urllink' href='http://www.nps.gov/alcatraz' title='' rel='nofollow'>Alcatraz Island</a>, CA
</li><li><a class='urllink' href='http://www.nps.gov/badl/index.htm' title='' rel='nofollow'>Badlands National Park</a>, SD
</li><li><a class='urllink' href='http://parks.state.co.us/parks/goldengatecanyon/Pages/GoldenGateStatePark.aspx' title='' rel='nofollow'>Golden Gate State Canyon State Park</a>, CO
</li><li><a class='urllink' href='http://www.nps.gov/moru/index.htm' title='' rel='nofollow'>Mount Rushmore National Memorial</a>, SD
</li><li><a class='urllink' href='http://www.niagarafallsstatepark.com/' title='' rel='nofollow'>Niagara Falls State Park</a>, NY
</li><li><a class='urllink' href='http://www.nps.gov/romo/' title='' rel='nofollow'>Rocky Mountain National Park</a>, CO
</li></ul></li></ul><div class='vspace'></div><h3>Campgrounds</h3>
<ul><li>U.S.A.
<ul><li><a class='urllink' href='http://parks.state.co.us/Parks/GoldenGateCanyon/Camping/Pages/GoldenGateCanyonCamping.aspx' title='' rel='nofollow'>Reverend's Ridge</a>, CO
</li><li><a class='urllink' href='http://www.nps.gov/romo/planyourvisit/camping.htm' title='' rel='nofollow'>Timber Creek Campground</a>, CO
</li></ul></li></ul><div class='vspace'></div><h3>Zoo / Aquarium / Botanical Garden</h3>
<ul><li>U.S.A.
<ul><li><a class='urllink' href='http://www.denverzoo.org/' title='' rel='nofollow'>Denver Zoo</a>, Denver, CO
</li><li><a class='urllink' href='http://www.sfzoo.org/' title='' rel='nofollow'>San Francisco Zoo</a>, San Francisco, CA
</li><li><a class='urllink' href='http://www.lowryparkzoo.com/' title='' rel='nofollow'>Lowry Park Zoo</a>, Tampa, FL
</li><li><a class='urllink' href='http://www.omahazoo.com/' title='' rel='nofollow'>Omaha's Henry Doorly Zoo</a>, Omaha, NE
</li><li><a class='urllink' href='http://www.zooamerica.com/' title='' rel='nofollow'>Zoo America</a>, Hershey, PA
<div class='vspace'></div></li><li><a class='urllink' href='http://www.aqua.org/' title='' rel='nofollow'>National Aquarium in Baltimore</a>, Baltimore, MD
</li><li><a class='urllink' href='http://www.flaquarium.org/' title='' rel='nofollow'>Florida Aquarium</a>, Tampa, FL
</li></ul><div class='vspace'></div></li><li>Canada
<ul><li><a class='urllink' href='http://www2.ville.montreal.qc.ca/jardin/jardin.htm' title='' rel='nofollow'>Montreal Botanical Garden</a>, Montreal, Quebec
</li></ul><div class='vspace'></div></li><li>Asia
<ul><li><a class='urllink' href='http://www.busanaquarium.com' title='' rel='nofollow'>Busan Aquarium</a>, Busan, Korea
</li><li><a class='urllink' href='http://www.coexaqua.co.kr/' title='' rel='nofollow'>COEX Aquarium</a>, Seoul, Korea
</li></ul></li></ul><div class='vspace'></div><h3>Children's Museum</h3>
<ul><li>U.S.A.
<ul><li><a class='urllink' href='http://www.chicagochildrensmuseum.org/' title='' rel='nofollow'>Chicago Children's Museum</a>, Chicago, IL
</li><li><a class='urllink' href='http://www.mychildsmuseum.org/' title='' rel='nofollow'>Children's Museum of Denver</a>, Denver, CO
</li><li><a class='urllink' href='http://www.museumofplay.org/' title='' rel='nofollow'>Strong National Museum of Play</a>, Rochester, NY
</li></ul><div class='vspace'></div></li><li>Canada
<ul><li><a class='urllink' href='http://www.civilization.ca/cmc/canadian-childrens-museum/childrens-museum2' title='' rel='nofollow'>Canadian Children's Museum</a>, Ottawa, Ontario
</li></ul></li></ul><div class='vspace'></div><h3>University</h3>
<ul><li>U.S.A.
<ul><li><a class='urllink' href='http://www.bgsu.edu' title='' rel='nofollow'>Bowling Green State University</a>, Bowling Green, OH
</li><li><a class='urllink' href='http://www.cmu.edu' title='' rel='nofollow'>Carnegie Mellon University</a>, Pittsburgh, PA
</li><li><a class='urllink' href='http://www.cwru.edu' title='' rel='nofollow'>Case Western Reserve University</a>, Cleveland, OH
</li><li><a class='urllink' href='http://www.gmu.edu/arlington/' title='' rel='nofollow'>George Mason University Arlington Campus</a>, Arlington, VA
</li><li><a class='urllink' href='http://www.georgetown.edu' title='' rel='nofollow'>Georgetown University</a>, Washington, D.C.
</li><li><a class='urllink' href='http://www.lhup.edu/' title='' rel='nofollow'>Lock Haven University</a>, Lock Haven, PA
</li><li><a class='urllink' href='http://www.northwestern.edu/' title='' rel='nofollow'>Northwestern University</a>, Evanston, IL
</li><li><a class='urllink' href='http://www.okstate.edu' title='' rel='nofollow'>Oklahoma State University</a>, Stillwater, OK
</li><li><a class='urllink' href='http://www.psu.edu' title='' rel='nofollow'>Pennsylvania State University</a>, State College, PA
</li><li><a class='urllink' href='http://www.aa.psu.edu/' title='' rel='nofollow'>Pennsylvania State University, Altoona</a>, Altoona, PA
</li><li><a class='urllink' href='http://www.princeton.edu' title='' rel='nofollow'>Princeton University</a>, Princeton, NJ
</li><li><a class='urllink' href='http://www.rit.edu' title='' rel='nofollow'>Rochester Institute of Technology</a>, Rochester, NY
</li><li><a class='urllink' href='http://www.buffalo.edu' title='' rel='nofollow'>University at Buffalo</a>, Buffalo, NY
</li><li><a class='urllink' href='http://www.colorado.edu' title='' rel='nofollow'>University of Colorado, Boulder</a>, Boulder, CO
</li><li><a class='urllink' href='http://www.ucdenver.edu' title='' rel='nofollow'>University of Colorado, Denver</a>, Denver, CO
</li><li><a class='urllink' href='http://www.uchicago.edu' title='' rel='nofollow'>University of Chicago</a>, Chicago, IL
</li><li><a class='urllink' href='http://www.uhm.hawaii.edu/' title='' rel='nofollow'>University of Hawaii at Manoa</a>, Honolulu, HI
</li><li><a class='urllink' href='http://www.maryland.edu' title='' rel='nofollow'>University of Maryland</a>, College Park, MD
</li><li><a class='urllink' href='http://www.miami.edu' title='' rel='nofollow'>University of Miami</a>, Miami, FL
</li><li><a class='urllink' href='http://www.nebraska.edu' title='' rel='nofollow'>University of Nebraska, Lincoln</a>, Lincoln, NE
</li><li><a class='urllink' href='http://www.unr.edu/' title='' rel='nofollow'>University of Nevada, Reno</a>, Reno, NV
</li><li><a class='urllink' href='http://www.upenn.edu' title='' rel='nofollow'>University of Pennsylvania</a>, Phildadelphia, PA
</li><li><a class='urllink' href='http://www.rochesteru.edu' title='' rel='nofollow'>University of Rochester</a>, Rochester, NY
</li><li><a class='urllink' href='http://www.utexas.edu' title='' rel='nofollow'>University of Texas, Austin</a>, Austin, TX
</li><li><a class='urllink' href='http://www.stanford.edu' title='' rel='nofollow'>Stanford University</a>, Palo Alto, CA
</li><li><a class='urllink' href='http://www.syracuse.edu' title='' rel='nofollow'>Syracuse University</a>, Syracuse, NY
</li></ul><div class='vspace'></div></li><li>Canada
<ul><li><a class='urllink' href='http://www.mcgill.ca/' title='' rel='nofollow'>McGill University</a>, Montreal, Quebec
</li><li><a class='urllink' href='http://www.utoronto.ca' title='' rel='nofollow'>University of Toronto</a>, Toronto, Ontario
</li><li><a class='urllink' href='http://www.uwo.ca/' title='' rel='nofollow'>University of Western Ontario</a>, London, Ontario
</li></ul><div class='vspace'></div></li><li>Europe
<ul><li><a class='urllink' href='http://www.ethz.ch/index_EN' title='' rel='nofollow'>ETH Zurich</a>, Zurich, Switzerland
</li><li><a class='urllink' href='http://www.uni-karlsruhe.de' title='' rel='nofollow'>Universitat Karlsruhe</a>, Karlsruhe, Germany
</li></ul><div class='vspace'></div></li><li>Asia
<ul><li><a class='urllink' href='http://www.nus.edu.sg/' title='' rel='nofollow'>National University of Singapore</a>, Singapore
<div class='vspace'></div></li><li><a class='urllink' href='http://www.ajou.ac.kr' title='' rel='nofollow'>Ajou University</a>, Suwon, Korea
</li><li><a class='urllink' href='http://www.chonbuk.ac.kr' title='' rel='nofollow'>Chonbuk National University</a>, Jeonju, Korea
</li><li><a class='urllink' href='http://www.cnu.ac.kr' title='' rel='nofollow'>Chungnam National University</a>, Daejeon, Korea
</li><li><a class='urllink' href='http://www.ewha.ac.kr' title='' rel='nofollow'>Ewha Womans University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www.hongik.ac.kr' title='' rel='nofollow'>Hongik University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www.kaist.ac.kr' title='' rel='nofollow'>Korea Advanced Institute of Science and Technology (KAIST)</a>, Daejeon, Korea
</li><li><a class='urllink' href='http://www.korea.ac.kr' title='' rel='nofollow'>Korea University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www.knu.ac.kr' title='' rel='nofollow'>Kyungpook National University</a>, Daegu, Korea
</li><li><a class='urllink' href='http://www.pnu.ac.kr' title='' rel='nofollow'>Pusan National University</a>, Busan, Korea
</li><li><a class='urllink' href='http://www.snu.ac.kr' title='' rel='nofollow'>Seoul National University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www.swu.ac.kr' title='' rel='nofollow'>Seoul Women's University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www.sogang.ac.kr' title='' rel='nofollow'>Sogang University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www.skku.ac.kr' title='' rel='nofollow'>Sungkyunkwan University</a>, Seoul, Korea
</li><li><a class='urllink' href='http://www/unist.ac.kr' title='' rel='nofollow'>Ulsan National Institute of Science and Technology (UNIST)</a>, Ulsan, Korea
</li><li><a class='urllink' href='http://www.yu.ac.kr' title='' rel='nofollow'>Yeungnam University</a>, Gyeongsan, Korea
</li><li><a class='urllink' href='http://www.yonsei.ac.kr' title='' rel='nofollow'>Yonsei University</a>, Seoul, Korea
</li></ul></li></ul><div class='vspace'></div><h3>Airports - Destinations and Transfers</h3>
<ul><li>U.S.A.
<ul><li>(ATL) <a class='urllink' href='http://www.atlanta-airport.com/' title='' rel='nofollow'>Hartsfield-Jackson Atlanta Int'l Airport</a>, Georgia
</li><li>(AUS) <a class='urllink' href='http://www.ci.austin.tx.us/austinairport/' title='' rel='nofollow'>Austin-Bergstrom Int'l Airport</a>, Texas
</li><li>(BUF) <a class='urllink' href='http://www.buffaloairport.com/' title='' rel='nofollow'>Buffalo Niagara Int'l Airport</a>, New York
</li><li>(BWI) <a class='urllink' href='http://www.bwiairport.com/en' title='' rel='nofollow'>Baltimore/Washington Int'l Thrugood Marshall Airport</a>, Maryland
</li><li>(CLE) <a class='urllink' href='http://www.clevelandairport.com/site/375/default.aspx' title='' rel='nofollow'>Cleveland Hopkins Int'l Airport</a>, Ohio
</li><li>(CLT) <a class='urllink' href='http://charmeck.org/city/charlotte/Airport/Pages/default.aspx' title='' rel='nofollow'>Charlotte Douglas Int'l Airport</a>, North Carolina
</li><li>(CVG) <a class='urllink' href='http://www.cvgairport.com/' title='' rel='nofollow'>Cincinnati/Northern Kentucky Int'l Airport</a>, (Cincinnati, Ohio), (Hebron, Kentucky)
</li><li>(DEN) <a class='urllink' href='http://www.flydenver.com/' title='' rel='nofollow'>Denver Int'l Airport</a>, Colorado
</li><li>(FSD) <a class='urllink' href='http://www.sfairport.com/' title='' rel='nofollow'>Sioux Falls Regional Airport</a>, South Dakota
</li><li>(HNL) <a class='urllink' href='http://hawaii.gov/hnl/' title='' rel='nofollow'>Honolulu Int'l Airport</a>, Hawaii
</li><li>(IAD) <a class='urllink' href='http://www.metwashairports.com/dulles/dulles.htm' title='' rel='nofollow'>Washington Dulles Int'l Airport</a>, (Washington, DC), (Chantilly, Virginia)
</li><li>(JFK) <a class='urllink' href='http://www.panynj.gov/airports/jfk.html' title='' rel='nofollow'>John F. Kennedy Int'l Airport</a>, New York City, New York
</li><li>(LAX) <a class='urllink' href='http://www.lawa.org/welcomelax.aspx' title='' rel='nofollow'>Los Angeles Int'l Airport</a>, California
</li><li>(MCI) <a class='urllink' href='http://www.flykci.com/' title='' rel='nofollow'>Kansas City Int'l Airport</a>, Missouri
</li><li>(MCO) <a class='urllink' href='http://www.orlandoairports.net/' title='' rel='nofollow'>Orlando Int'l Airport</a>, Florida
</li><li>(MIA) <a class='urllink' href='http://www.miami-airport.com/' title='' rel='nofollow'>Miami Int'l Airport</a>, Florida
</li><li>(MKE) <a class='urllink' href='http://www.mitchellairport.com/' title='' rel='nofollow'>General Mitchell Int'l Airport</a>, Milwaukee, Wisconsin
</li><li>(MSP) <a class='urllink' href='http://www.mspairport.com/' title='' rel='nofollow'>Minneapolis - St. Paul Int'l Airport</a>, Minnesota
</li><li>(OKC) <a class='urllink' href='http://www.flyokc.com/' title='' rel='nofollow'>Will Rogers World Airport</a>, Oklahoma City, Oklahoma
</li><li>(ORD) <a class='urllink' href='http://www.ohare.com/' title='' rel='nofollow'>Chicago O'Hare Int'l Airport</a>, Illinois
</li><li>(PHL) <a class='urllink' href='http://www.phl.org/' title='' rel='nofollow'>Philadelphia Int'l Airport</a>, Pennsylvania
</li><li>(PIT) <a class='urllink' href='http://www.pitairport.com' title='' rel='nofollow'>Pittsburgh Int'l Airport</a>, Pennsylvania
</li><li>(RNO) <a class='urllink' href='http://renoairport.com/' title='' rel='nofollow'>Reno-Tahoe Int'l Airport</a>, Nevada
</li><li>(SAN) <a class='urllink' href='http://www.san.org/' title='' rel='nofollow'>San Diego Int'l Airport</a>, California
</li><li>(SBA) <a class='urllink' href='http://www.flysba.com/' title='' rel='nofollow'>Santa Barbara Airport</a>, California
</li><li>(SCE) <a class='urllink' href='http://www.statecollegeairport.org/' title='' rel='nofollow'>University Park Airport</a>, State College, Pennsylvania
</li><li>(SEA) <a class='urllink' href='http://www.portseattle.org/seatac/' title='' rel='nofollow'>Seattle-Tacoma Int'l Airport</a>, California
</li><li>(SFO) <a class='urllink' href='http://www.flysfo.com/' title='' rel='nofollow'>San Francisco Int'l Airport</a>, California
</li><li>(TPA) <a class='urllink' href='http://www.tampaairport.com/' title='' rel='nofollow'>Tampa Int'l Airport</a>, Florida
</li><li>(TUL) <a class='urllink' href='http://www.tulsaairports.com/' title='' rel='nofollow'>Tulsa Int'l Airport</a>, Oklahoma
</li></ul><div class='vspace'></div></li><li>Canada
<ul><li>(YUL) <a class='urllink' href='http://www.admtl.com/passager/Home.aspx' title='' rel='nofollow'>Montreal-Pierre Elliott Tredeau Int'l Airport</a>, Quebec
</li><li>(YYZ) <a class='urllink' href='http://www.gtaa.com/en/home/' title='' rel='nofollow'>Toronto Pearson Int'l Airport</a>, Ontario
</li></ul><div class='vspace'></div></li><li>Asia
<ul><li>(ICN) <a class='urllink' href='http://www.airport.kr/eng/airport/' title='' rel='nofollow'>Incheon Int'l Airport</a>, Korea
</li><li>(NRT) <a class='urllink' href='http://www.narita-airport.jp/en/' title='' rel='nofollow'>Narita Int'l Airport</a>, Japan
</li><li>(PUS) <a class='urllink' href='http://www.airport.co.kr/doc/gimhae_eng/index.jsp' title='' rel='nofollow'>Gimhae Int'l Airport</a>, Korea
</li><li>(SIN) <a class='urllink' href='http://www.changiairport.com/' title='' rel='nofollow'>Singapore Changi Int'l Airport</a>, Singapore
</li><li>(TAE) <a class='urllink' href='http://www.airport.co.kr/doc/daegu_eng/' title='' rel='nofollow'>Daegu Int'l Airport</a>, Korea
</li></ul><div class='vspace'></div></li><li>Europe
<ul><li>(FRA) <a class='urllink' href='http://www.frankfurt-airport.com/' title='' rel='nofollow'>Frankfurt Airport</a>, Germany
</li><li>(LHR) <a class='urllink' href='http://www.heathrowairport.com/' title='' rel='nofollow'>London Heathrow Airport</a>, United Kingdom
</li><li>(ZHR) <a class='urllink' href='http://www.zurich-airport.com/' title='' rel='nofollow'>Zurich Airport</a>, Switzerland
</li></ul></li></ul><div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2012-01-15T02:50:32Z</dc:date>
<pubDate>Sun, 15 Jan 2012 02:50:32 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>Research</title>
<link>http://www.chkwon.net/Main/Research</link>
<description><![CDATA[<p><strong><em>If we knew what it was we were doing, it would not be called research, would it?</em></strong>
- Albert Einstein
</p>
<div class='vspace'></div><h3>Research Interests</h3>
<ul><li>Methodology:
<ul><li>Nonlinear Optimization, Infinite Dimensional Optimization, Optimal Control
</li><li>Variational Inequalities, Game Theory, Equilibrium Programming
</li></ul></li><li>Application:
<ul><li>Transportation and Traffic Theory, Congestion Pricing, Hazardous Material Transportation
</li><li>Revenue Management, Dynamic Pricing, e-Commerce, Online Advertisement
</li></ul></li></ul><p class='vspace'>Dr. Kwon's research has been supported by various funding agencies including the National Science Foundation, the U.S. Department of Transportation, and the Embassy of Canada in Washington D.C.
</p>
<div class='vspace'></div><ul><li><a class='urllink' href='http://hazmat.chkwon.net' title='' rel='nofollow'>NSF sponsored research in hazardous materials transportation</a>
</li></ul><div class='vspace'></div><h3>Journals and Conferences</h3>
<ul><li><a class='wikilink' href='http://www.chkwon.net/Main/Journals'>A list of academic journals</a> that are relevant to my research.
</li><li><a class='wikilink' href='http://www.chkwon.net/Main/Conferences'>A collection of conferences</a> where my works were presented. (Some links may not work; The list has not been updated for a while.)
</li></ul><div class='vspace'></div><!--l. 16--><p class="noindent" > <script type="text/javascript" language="javascript"> function toggle(abstract) { var divele = document.getElementById(abstract+"div"); var button = document.getElementById(abstract); if(divele.style.display == "block") { divele.style.display = "none"; button.innerHTML = "[show abstract]"; } else { divele.style.display = "block"; button.innerHTML = "[hide abstract]"; } } </script> 
</p>
<h3 class="likesectionHead"><a 
 id="x1-1000"></a>Grants</h3>
<!--l. 7--><p class="noindent" >
     </p><dl class="enumerate"><dt class="enumerate">
  1. </dt><dd 
class="enumerate"><span 
class="eccc-1000">(PI) </span>&#8220;Towards Socially and Economically Sustainable Urban Developments&#8221;, U.S. Department
     of Transportation through University Transportation Research Center, Region II, Research
     Initiative, co-Is: Jiyoung Park (UB), Qian Wang (UB), 12/23/2011 - 09/30/2012
     </dd><dt class="enumerate">
  2. </dt><dd 
class="enumerate"><span 
class="eccc-1000">(PI) </span>&#8220;Processing Area Improvement Initiative&#8221;, Goodwill Industries of WNY, Inc. through the
     Center for Industrial Effectiveness, 11/30/2011 - 5/30/2012
     </dd><dt class="enumerate">
  3. </dt><dd 
class="enumerate"><span 
class="eccc-1000">(PI)   </span>&#8220;Collaborative   Research:   Regulating   Hazardous   Materials   Transportation   by
     Multi-Objective Dual Toll Pricing&#8221;, National Science Foundation,  co-PIs: Rajan Batta (UB)
     and Young-Jun Son (U Arizona), 09/01/2011 - 08/31/2014 <a 
href="http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=1068585" >[CMMI-1068585]</a>
     </dd><dt class="enumerate">
  4. </dt><dd 
class="enumerate"><span 
class="eccc-1000">(PI) </span>&#8220;Robust Routing for Hazardous Materials Transportation with Conditional Value-at-Risk
     on  Time-Dependent  Networks&#8221;,  U.S.  Department  of  Transportation  through  University
     Transportation Research Center, Region II, Faculty Development Minigrants,  07/01/2011 -
     09/30/2012 <a 
href="http://rip.trb.org/browse/dproject.asp?n=28668" >[49111-07-23]</a>
     </dd><dt class="enumerate">
  5. </dt><dd 
class="enumerate"><span 
class="eccc-1000">(PI) </span>&#8220;Food Service Efficiency &amp; Capacity Analysis Study/Assessment&#8221;, Efficient Schools Team,
     LLC., Buffalo, NY, through The Center for Industrial Effectiveness,  03/30/2011 - 09/30/2011
     </dd><dt class="enumerate">
  6. </dt><dd 
class="enumerate"><span 
class="eccc-1000">(PI)            </span>&#8220;Economic             Implications             of             the             Canada-US
     Border Bridges: Applying a Transportation-Combined Multiregional Input-Output Model for
     Canada and the U.S.&#8221;, Embassy of Canada in Washington, D.C.,  co-PI: Jiyoung Park (UB),
     03/01/2011 - 02/28/2012 <a 
href="http://www.canadainternational.gc.ca/washington/studies-etudes/recipients-destinaires.aspx?lang=eng#research-recherche" >[link]</a>
     </dd><dt class="enumerate">
  7. </dt><dd 
class="enumerate">The Canadian-American Studies Committee, Fall 2010 Grant Competition,  with Jiyoung Park
     (UB), 2010
     </dd><dt class="enumerate">
  8. </dt><dd 
class="enumerate">Multiregional Policy Analysis LLC,  2010.
     </dd></dl>
<!--l. 8--><p class="noindent" >
</p>
<h3 class="likesectionHead"><a 
 id="x1-2000"></a>Publications</h3>
<!--l. 1--><p class="noindent" >
</p>
<h4 class="subsectionHead"><a 
 id="x1-3000"></a>Working Papers</h4>
<!--l. 2--><p class="noindent" >
                                                                                   
                                                                                   
     </p><dl class="enumerate"><dt class="enumerate">
  1. </dt><dd 
class="enumerate">Kang,  Y.<sup><span 
class="cmmi-7">&#x22C6;</span></sup>,  R.  Batta  and  C.  Kwon,  &#8220;Value-at-Risk  Model  for  Hazardous  Material
     Transportation&#8221;  <a 
href="http://www.chkwon.net/papers/kang2011a.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='kang2011a' href="javascript:toggle('kang2011a')">[show abstract]</a><div id='kang2011adiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>This paper introduces a Value-at-Risk (VaR) model to generate route choices for a hazmat shipment based on a specified risk confidence level. The objective is to determine a route which minimizes the likelihood that the risk will be greater than a set threshold. Several properties of the VaR model are established. An exact solution procedure is proposed and tested to solve the single-trip problem. To test the applicability of the approach, routes obtained from the VaR model are compared with those obtained from other hazmat objectives, on a numerical example as well as a hazmat routing scenario derived from the Albany district of New York State. Depending on the choice of the confidence level, the VaR model gives different paths from which we conclude that the route choice is a function of the level of risk tolerance of the decision-maker. Further refinements of the VaR model are also discussed.<br/><br/></div>
     </dd><dt class="enumerate">
  2. </dt><dd 
class="enumerate">Kang, Y.<sup><span 
class="cmmi-7">&#x22C6;</span></sup>, R. Batta and C. Kwon, &#8220;Generalized Route Planning Model for Hazardous Material
     Transportation with VaR and Equity Considerations&#8221;  <a 
href="http://www.chkwon.net/papers/kang2011b.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='kang2011b' href="javascript:toggle('kang2011b')">[show abstract]</a><div id='kang2011bdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In an earlier paper, Kang, Batta, and Kwon (2011) introduced the Value-at-Risk (VaR) framework and applied it to the case of routing a single hazmat trip. In this paper, we develop upon this work in two important ways. First, we show how to apply the VaR concept to a more realistic multi-trip multi-hazmat type framework which aims at determining routes that minimize the global VaR value while satisfying equity constraints. Second, we show how to embed the solution algorithm for the single hazmat trip problem into a Lagrangian relaxation framework to obtain an efficient solution method for this general case. We test our computational experience based on a real-life hazmat routing scenario in the Albany district of New York State. Our results indicate that one can achieve a high degree of risk dispersion while controlling the VaR value within the desired confidence level.<br/><br/></div>
     </dd><dt class="enumerate">
  3. </dt><dd 
class="enumerate">Kwon,  C.,  T.  Lee,  P.  Berglund<sup><span 
class="cmmi-7">&#x22C6;</span></sup>,  &#8220;Robust  Shortest  Path  Problems  with  Two  Uncertain
     Multiplicative Cost Coefficients&#8221;  <a 
href="http://www.chkwon.net/papers/kwon2012rsp.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='kwon2012rsp' href="javascript:toggle('kwon2012rsp')">[show abstract]</a><div id='kwon2012rspdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>We consider a robust shortest path problem when the cost coefficient is a multiplication of two uncertain parameters. We first show that the robust problem can be solved by a dual variable enumeration with with shortest path problems as subproblems. We propose another path enumeration solution approach using a $K$-shortest paths finding algorithm that may be efficient in many real cases. An application in hazardous materials transportation is discussed and the solution methods are illustrated by numerical examples.<br/><br/></div>
     </dd><dt class="enumerate">
  4. </dt><dd 
class="enumerate">Ahmed, M. T.<sup><span 
class="cmmi-7">&#x22C6;</span></sup> and C. Kwon, &#8220;Optimal Contract Problems in Online Advertising with Risk
     Considerations&#8221;  <a 
href="http://www.chkwon.net/papers/ahmed2012.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='ahmed2011a' href="javascript:toggle('ahmed2011a')">[show abstract]</a><div id='ahmed2011adiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper, we study optimal contract problems for online display advertisements with pay-per-view pricing scheme. We first provide and analyze a single contract model, which is shown to be equivalent to the newsvendor problem. We then consider a stochastic optimization problem with two different contracts and show that no mixed contract is optimal for risk-neutral publisher. However, we show that a mixed contract strategy may be optimal when we consider the risk attitude of the publisher. Numerical experiments illustrate the change of optimal strategy for different risk levels.<br/><br/></div>
     </dd></dl>
<!--l. 1--><p class="noindent" >(<span 
class="cmmi-10">&#x22C6; </span>= Dr. Kwon&#8217;s students)
</p><!--l. 3--><p class="noindent" >
</p>
<h4 class="subsectionHead"><a 
 id="x1-4000"></a>Journal Articles (Published or To Appear)</h4>
<!--l. 4--><p class="noindent" >
     </p><dl class="enumerate"><dt class="enumerate">
  1. </dt><dd 
class="enumerate">Ahmed,  M.T.<sup><span 
class="cmmi-7">&#x22C6;</span></sup>  ,  and  C.  Kwon  (2012),  &#8220;Pricing  Game  of  Online  Display  Advertisement
     Publishers&#8221;, <span 
class="ecti-1000">European Journal of Operational Research</span>, 219, 477-487. <a 
href="http://dx.doi.org/10.1016/j.ejor.2012.01.008" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/ahmed2012ejor.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='ahmed2012ejor' href="javascript:toggle('ahmed2012ejor')">[show abstract]</a><div id='ahmed2012ejordiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>We consider an online display advertisement publisher who maximizes the revenue by optimal pricing in an oligopoly setting. Each publisher interacts with others though setting cost-perimpression (CPM) that affects the demand for everyone. Using the pseudoconcavity of the objective function, we study the best response of the publisher while her strategy space changes. We also consider the sensitivity of the publisher while other publishers changes their CPM. In both cases, the best response of the publisher depends entirely on her current best response CPM. We provide an algorithm for finding the equilibrium and illustrate by numerical examples.<br/><br/></div>
     </dd><dt class="enumerate">
  2. </dt><dd 
class="enumerate">Jung, T.<sup><span 
class="cmmi-7">&#x22C6;</span></sup> and C. Kwon (2011), &#8220;Retailer-Supplier Matching: an Application of the Deferred
     Acceptance Algorithm&#8221;  <span 
class="ecti-1000">International Journal of Services Operations and Informatics</span>, 6(3),
     248&#8211;258. <a 
href="http://dx.doi.org/10.1504/IJSOI.2011.041420" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/jung2011ijsoi.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='jung2011ijsoi' href="javascript:toggle('jung2011ijsoi')">[show abstract]</a><div id='jung2011ijsoidiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper, we apply matching theory to supply chain coordination. We present mathematical optimization models similar to the newsvendor problem to provide appropriate conditions for retailer-supplier matching. In particular, our matching algorithm, compared to the general matching theory, has uniquely been affected by contract sizes and ordering sequences. We also study that our matching application guarantees stable and optimal outcomes. Numerical examples with various parameter settings are provided to test the feasibility of the matching algorithms. We find that we can avoid the worst matching case when we use the proposed matching algorithms.<br/><br/></div>
     </dd><dt class="enumerate">
  3. </dt><dd 
class="enumerate">Srinivasan, A.<sup><span 
class="cmmi-7">&#x22C6;</span></sup>  and C. Kwon, &#8220;Operations of Online Advertising Services and Publisher&#8217;s
     Option&#8221;, <span 
class="ecti-1000">Journal of the Operational Research Society</span>, in print. <a 
href="http://dx.doi.org/10.1057/jors.2011.84" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/srinivasan2011jors.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='srinivasan2011jors' href="javascript:toggle('srinivasan2011jors')">[show abstract]</a><div id='srinivasan2011jorsdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>We analyse the use of options for online advertisement publishers. By providing a discount or rewards to advertisers, publishers can utilize their uncertain service capacity, page-views, more efficiently. We use Generalized Nash Bargaining to study the feasibility of the option contract and solve for an optimal value for the option price. We compare the revenues and benefits from advertisements under the option contract, with those without the options using numerical studies. We also study the impact of pricing and other components in the game on the optimal option price, the publisher's revenues, and the advertiser's benefits from the advertisements.<br/><br/></div>
     </dd><dt class="enumerate">
  4. </dt><dd 
class="enumerate">Chung, B.D., J. Li, T. Yao, C. Kwon and T. L. Friesz (2011), &#8220;Demand Learning and Dynamic
     Pricing under Competition in a State-Space Framework &#8221;, <span 
class="ecti-1000">IEEE Transactions on Engineering</span>
     <span 
class="ecti-1000">Management</span>, in print <a 
href="http://dx.doi.org/10.1109/TEM.2011.2140323" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/chung2011ieee.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='chung2011ieee' href="javascript:toggle('chung2011ieee')">[show abstract]</a><div id='chung2011ieeediv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper, we propose a revenue optimization framework integrating demand learning and dynamic pricing for firms in monopoly or oligopoly markets. We introduce a state-space model for this revenue management problem, which incorporates game-theoretic demand dynamics and nonparametric techniques for estimating the evolution of underlying state variables. Under this framework, stringent model assumptions are removed. We develop a new demand learning algorithm using Markov chain Monte Carlo methods to estimate model parameters, unobserved state variables, and functional coefficients in the nonparametric part. Based on these estimates, future price sensitivities can be predicted, and the optimal pricing policy for the next planning period is obtained. To test the performance of demand learning strategies, we solve a monopoly firm's revenue maximizing problem in simulation studies. We then extend this paradigm to dynamic competition, where the problem is formulated as a differential variational inequality. Numerical examples show that our demand learning algorithm is efficient and robust.<br/><br/></div>
     </dd><dt class="enumerate">
  5. </dt><dd 
class="enumerate">Wang, J.<sup><span 
class="cmmi-7">&#x22C6;</span></sup>, Y. Kang<sup><span 
class="cmmi-7">&#x22C6;</span></sup>, C. Kwon and R. Batta, &#8220;Dual Toll Pricing for Hazardous Material
     Transport with Linear Delay&#8221;, <span 
class="ecti-1000">Networks and Spatial Economics</span>, accepted <a 
href="http://dx.doi.org/10.1007/s11067-011-9156-9" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/wang2011nets.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='wang2011nets' href="javascript:toggle('wang2011nets')">[show abstract]</a><div id='wang2011netsdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper, we propose a dual toll pricing method to mitigate risk of hazardous materials (hazmat) transportation. We aim to simultaneously control both regular and hazmat vehicles to reduce the risk. In our model, we incorporate a new risk measure to consider duration-population-frequency of hazmat exposure. We first formulate the model as a Mathematical Program with Equilibrium Constraints (MPEC). Then we decompose the MPEC formulation into first-stage and second-stage problems. Separate methods are developed to solve each stage. A numerical example is provided and possible extensions are discussed.<br/><br/></div>
     </dd><dt class="enumerate">
  6. </dt><dd 
class="enumerate">Friesz, T. L., T. I. Kim, C. Kwon and M. A. Rigdon (2011), &#8220;Approximate Network Loading
     and Dual Time Scale Dynamic User Equilibrium&#8221;, <span 
class="ecti-1000">Transportation Research Part B</span>, 45(1),
     176-207. <a 
href="http://dx.doi.org/10.1016/j.trb.2010.05.003" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/friesz2011trb.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='friesz2011trb' href="javascript:toggle('friesz2011trb')">[show abstract]</a><div id='friesz2011trbdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.<br/><br/></div>
     </dd><dt class="enumerate">
  7. </dt><dd 
class="enumerate">Moon.  Y.  and  C.  Kwon  (2011),  &#8220;Online  Advertisement  Service  Pricing  and  an  Option&#8221;,
     <span 
class="ecti-1000">Electronic Commerce Research and Applications</span>, 10(1), 38-48. <a 
href="http://dx.doi.org/10.1016/j.elerap.2010.04.005" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/moon2011ecra.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='moon2011ecra' href="javascript:toggle('moon2011ecra')">[show abstract]</a><div id='moon2011ecradiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>For the Internet advertisement market, we consider a contract problem between advertisers and publishers. Among several ways of pricing online advertisements, the methods based on cost-per-impression (CPM) and cost-per-click (CPC) are the two most popular. The CPC fee is proportional to the click-through rate (CTR), which is uncertain and makes decisions of advertisers and publishers difficult. In this paper, we suggest a hybrid pricing scheme: advertisers pay the minimum of CPM and CPC fees by purchasing an option from publishers. To determine the option price, we consider a Nash bargaining game for negotiation between an advertiser and a publisher and provide the solution. Further, we show that such option contracts will help the advertiser avoid high cost and the publisher generate more revenue. The option contract will also improve the contract feasibility, compared to CPM and CPC.<br/><br/></div>
     </dd><dt class="enumerate">
  8. </dt><dd 
class="enumerate">Kwon, C. (2011), &#8220;Single-Period Balancing of Pay-Per-Click and Pay-Per-View Online Display
     Advertisements&#8221;, <span 
class="ecti-1000">Journal of Revenue and Pricing Management</span>, 10(3), 261-270. <a 
href="http://dx.doi.org/10.1057/rpm.2009.43" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/kwon2009jrpm.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='kwon2009jrpm' href="javascript:toggle('kwon2009jrpm')">[show abstract]</a><div id='kwon2009jrpmdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this article, we study a balancing problem of web publishers for pay-per-view and pay-per-click contracts for online display advertising. Considering the details of contracts, we refine prior research results on the recommendation of optimal strategies. We examine the problem by formalizing a simple stochastic optimization problem for a single period of advertising contracts. We investigate how pricing and other contract components will affect the optimal display strategies analytically and numerically.<br/><br/></div>
     </dd><dt class="enumerate">
  9. </dt><dd 
class="enumerate">Kwon,  C.,  T.  L.  Friesz,  R.  Mookherjee,  T.  Yao  and  B.  Feng  (2009),  &#8220;Non-cooperative
                                                                                   
                                                                                   
     Competition Among Revenue Maximizing Service Providers with Demand Learning&#8221;, <span 
class="ecti-1000">European</span>
     <span 
class="ecti-1000">Journal of Operational Research</span>, 197(3), 981-996. <a 
href="http://dx.doi.org/10.1016/j.ejor.2007.12.041" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/kwon2009ejor.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='kwon2009ejor' href="javascript:toggle('kwon2009ejor')">[show abstract]</a><div id='kwon2009ejordiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>This paper recognizes that in many decision environments in which revenue optimization is attempted, an actual demand curve and its parameters are generally unobservable. Herein, we describe the dynamics of demand as a continuous time differential equation based on an evolutionary game theory perspective. We then observe realized sales data to obtain estimates of parameters that govern the evolution of demand; these are refined on a discrete time scale. The resulting model takes the form of a differential variational inequality. We present an algorithm based on a gap function for the differential variational inequality and report its numerical performance for an example revenue optimization problem.<br/><br/></div>
     </dd><dt class="enumerate">
 10. </dt><dd 
class="enumerate">Kwon, C. and T. L. Friesz (2008), &#8220;Valuation of American Options by the Gradient Projection
     Method&#8221;, <span 
class="ecti-1000">Applied Mathematics and Computation</span>, 206(1), 380-388. <a 
href="http://dx.doi.org/10.1016/j.amc.2008.09.024" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/kwon2008amc.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='kwon2008amc' href="javascript:toggle('kwon2008amc')">[show abstract]</a><div id='kwon2008amcdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>We study an equivalent optimization problem with an inequality constraint and boundary conditions, whose necessary condition for optimality is the variational inequality presentation of American options. To solve the problem, we use the gradient projection method, with discretizations both in time and space. We tested the algorithm and compared with the projective successive over-relaxation method.<br/><br/></div>
     </dd><dt class="enumerate">
 11. </dt><dd 
class="enumerate">Friesz, T. L. and C. Kwon (2008), &#8220;Supply Chain Design in Perfect Competition&#8221;, <span 
class="ecti-1000">International</span>
     <span 
class="ecti-1000">Journal of Services Operations and Informatics</span>, 3(3/4), 340-356. <a 
href="http://dx.doi.org/10.1504/IJSOI.2008.021343" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/friesz2008ijsoi.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='friesz2008ijsoi' href="javascript:toggle('friesz2008ijsoi')">[show abstract]</a><div id='friesz2008ijsoidiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper, we apply the theory of optimal control and theory of traffic assignment for supply chain design in perfect competition. We model the time staging and generalised routing of input factors needed for production by a firm. The production process will typically involve several stages, and as such is described by paths through a production network whose nodes are the various stages of production. We develop an algorithm and test it for a small numerical example.<br/><br/></div>
     </dd><dt class="enumerate">
 12. </dt><dd 
class="enumerate">Miller,  T.  C.,  T.  L.  Friesz,  R.  L.  Tobin  and  C.  Kwon  (2007),  &#8220;Reaction  Function  Based
     Dynamic Location Modeling in Stackelberg-Nash-Cournot Competition&#8221;, <span 
class="ecti-1000">Networks and Spatial</span>
     <span 
class="ecti-1000">Economics</span>, 7(1), 77-97. <a 
href="http://dx.doi.org/10.1007/s11067-006-9013-4" ><span 
class="ecrm-0700">[DOI]</span></a> <a 
href="http://www.chkwon.net/papers/miller2007nets.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='miller2007nets' href="javascript:toggle('miller2007nets')">[show abstract]</a><div id='miller2007netsdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>We formulate a dynamic facility location model for a firm locating on a discrete network. It is assumed that this locating firm will act as the leader firm in an industry characterized by Stackelberg leader-follower competition. The firm's I competitors are assumed to act as Cournot firms and are each assumed to operate under the assumption of zero conjectural variation with respect to their I-1 Cournot competitors. Using sensitivity analysis of variational inequalities within a hierachical mathematical programming approach, we develop reaction function based dynamic models to optimize the Stackelberg firm's location decision. In the second half of this paper, we use these models to illustrate through a numerical example the insights yielded by our approach.<br/><br/></div></dd></dl>
<!--l. 71--><p class="noindent" >
</p>
<h4 class="subsectionHead"><a 
 id="x1-5000"></a>Edited Books</h4>
<!--l. 72--><p class="noindent" >
     </p><dl class="enumerate"><dt class="enumerate">
  1. </dt><dd 
class="enumerate">Batta, R. and C. Kwon, &#8220;Handbook of OR/MS Models in Hazardous Materials Transportation&#8221;,
     Springer (In Progress)</dd></dl>
<!--l. 76--><p class="noindent" >
</p>
<h4 class="subsectionHead"><a 
 id="x1-6000"></a>Refereed Proceedings</h4>
<!--l. 77--><p class="noindent" >
     </p><dl class="enumerate"><dt class="enumerate">
  1. </dt><dd 
class="enumerate">C. Kwon (2011), &#8220;Conditional Value-at-Risk Model for Hazardous Materials Transportation&#8221;, in
     <span 
class="ecti-1000">Proceedings of the 2011 Winter Simulation Conference</span>, S. Jain, R. R. Creasey, J. Himmelspach,
     K. P. White, and M. Fu, eds. pp. 1708-1714 <a id='kwon2011wsc' href="javascript:toggle('kwon2011wsc')">[show abstract]</a><div id='kwon2011wscdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>This paper investigates how the conditional value-at-risk (CVaR) can be used to mitigate risk in hazardous materials (hazmat) transportation. Routing hazmat must consider accident probabilities and accident consequences that depend on the hazmat types and route choices. This paper proposes a new method for mitigating risk based on CVaR measure. While the CVaR model is popularly used in financial portfolio optimization problems, its application in hazmat transportation is new. A computational method for determining the optimal CVaR route is proposed and illustrated by a case study in the road network surrounding Albany, NY. <br/><br/></div>
     </dd><dt class="enumerate">
  2. </dt><dd 
class="enumerate">Jeong, B., C. Kwon, Y.S. Zhang, and S. Yang (2010), &#8220;Evaluating the Research Performance of
     a R&amp;D Program: an Application of DEA&#8221;, <span 
class="ecti-1000">Proceedings of the International Multi-Conference</span>
     <span 
class="ecti-1000">of Engineers and Computer Scientists 2010 Vol III</span>. <a 
href="http://www.chkwon.net/papers/jeong2010imecs.pdf" ><span 
class="ecrm-0700">[PDF]</span></a>
     </dd><dt class="enumerate">
  3. </dt><dd 
class="enumerate">Friesz, T. L., M. A. Rigdon and C. Kwon (2008), &#8220;A New Gradient Projection Algorithm
     for the Dynamic User Equilibrium Problem&#8221;, <span 
class="ecti-1000">International Symposium on Dynamic Traffic</span>
     <span 
class="ecti-1000">Assignment 2008</span>
     </dd><dt class="enumerate">
  4. </dt><dd 
class="enumerate">Friesz,  T.  L.,  C.  Kwon  and  M.  A.  Rigdon  (2007),  &#8220;A  Model  of  Competition  in  Service
     Management&#8221;,  <span 
class="ecti-1000">Proceedings  of  2007  IEEE/INFORMS  International  Conference  on  Service</span>
     <span 
class="ecti-1000">Operations and Logistics, and Informatics </span><a 
href="http://dx.doi.org/10.1109/SOLI.2007.4383870" ><span 
class="ecrm-0700">[DOI]</span></a>
     </dd><dt class="enumerate">
  5. </dt><dd 
class="enumerate">Friesz,  T.  L.,  C.  Kwon  and  R.  Mookherjee  (2007),  &#8220;A  Computable  Theory  of  Dynamic
     Congestion  Pricing&#8221;,  In:  <span 
class="ecti-1000">Transportation  and  Traffic  Theory  2007:  Papers  selected  for</span>
     <span 
class="ecti-1000">presentation at ISTTT17, a peer reviewed series since 1959</span>, R. E. Allsop, M. G. H. Bell and
     B. G. Heydecker (Eds.), pp. 1-26. <a 
href="http://www.chkwon.net/papers/friesz2007isttt.pdf" ><span 
class="ecrm-0700">[PDF]</span></a> <a id='friesz2007isttt' href="javascript:toggle('friesz2007isttt')">[show abstract]</a><div id='friesz2007istttdiv' class='abstractbg' style="display:none; background-color: #FFFF99"><br/>In this paper we present a theory of dynamic congestion pricing for the day-to-day as well as the within-day time scales. The equilibrium design problem emphasized herein takes the form of an MPEC, which we call the Dynamic Optimal Toll Problem with Equilibrium Constraints, or DOTPEC. The DOPTEC formulation we employ recalls an important earlier result that allows the equilibrium design problem to be stated as a single level problem, a result which is surprisingly little known. The DOPTEC maintains the usual design objective of minimizing the system travel cost by appropriate toll pricing. We describe how an infnite dimensional mathematical programming perspective may be employed to create an algorithm for the DOTPEC. A numerical example is provided.<br/><br/></div>
                                                                                   
                                                                                   
     </dd><dt class="enumerate">
  6. </dt><dd 
class="enumerate">Friesz, T. L., C. Kwon, A. Chow and B. Heydecker (2007), &#8220;A Dynamic Efficient Toll Problem&#8221;,
     <span 
class="ecti-1000">The Sixth Triennial Symposium on Transportation Analysis (TRISTAN VI)</span>
     </dd><dt class="enumerate">
  7. </dt><dd 
class="enumerate">Friesz, T. L., R. Mookherjee and C. Kwon (2006), &#8220;Dynamic Non-cooperative Games as a
     Foundation for Modeling Dynamic User Equilibrium&#8221;, <span 
class="ecti-1000">The First International Symposium on</span>
     <span 
class="ecti-1000">Dynamic Traffic Assignment </span><a 
href="http://www.chkwon.net/papers/friesz2006dta.pdf" ><span 
class="ecrm-0700">[PDF]</span></a>
     </dd><dt class="enumerate">
  8. </dt><dd 
class="enumerate">Friesz,  T.  L.,  C.  Kwon  and  R.  Mookherjee  (2006),  &#8220;A  Computable  Theory  of  Dynamic
     Congestion Pricing&#8221;, <span 
class="ecti-1000">The First International Symposium on Dynamic Traffic Assignment</span>
     </dd><dt class="enumerate">
  9. </dt><dd 
class="enumerate">Kwon, C. and T. L. Friesz (2006), &#8220;Valuation of American Options by the Gradient Projection
     Method&#8221;, <span 
class="ecti-1000">College of Engineering Research Symposium 2006, Penn State University</span></dd></dl>
<!--l. 101--><p class="noindent" >
</p>
<h4 class="subsectionHead"><a 
 id="x1-7000"></a>Book Chapters</h4>
<!--l. 102--><p class="noindent" >
     </p><dl class="enumerate"><dt class="enumerate">
  1. </dt><dd 
class="enumerate">Friesz, T. L., T. I. Kim, C. Kwon and M. A. Rigdon (2010), &#8220;Computing Dual Time Scale
     Dynamic User Equilibria&#8221;, in <span 
class="ecti-1000">New Developments in Transport Planning: Advances in Dynamic</span>
     <span 
class="ecti-1000">Traffic Assignment  </span>(Eds.:  C.  M.  J.  Tampere,  F.  Viti  and  L.  H.  Immers),  Edward  Elgar
     Publishing. <a 
href="http://www.e-elgar.co.uk/Bookentry_DESCRIPTION.lasso?id=13831" ><span 
class="ecrm-0700">[LINK]</span></a>
     </dd><dt class="enumerate">
  2. </dt><dd 
class="enumerate">Friesz, T. L., C. Kwon and D. Bernstein (2009), &#8220;Evolutionary and Preferential Attachment
     Models of Demand Growth&#8221;, in <span 
class="ecti-1000">Complexity and Spatial Networks: In Search of Simplicity </span>(Eds.:
     Aura Reggiani and Roberto Patuelli), Springer-Verlag. <a 
href="http://www.springer.com/economics/regional+science/book/978-3-642-01553-3" ><span 
class="ecrm-0700">[LINK]</span></a> <a 
href="http://dx.doi.org/10.1007/978-3-642-01554-0" ><span 
class="ecrm-0700">[DOI]</span></a>
     </dd><dt class="enumerate">
  3. </dt><dd 
class="enumerate">Friesz, T. L., C. Kwon and D. Bernstein (2007), &#8220;Analytical Dynamic Traffic Assignment
     Model" in <span 
class="ecti-1000">Handbook of Transport Modelling 2nd Edition  </span>(Eds.: D. A. Hensher and K. J.
     Button), Elsevier. <a 
href="http://www.amazon.com/Handbook-Transport-Modelling-Second-Handbooks/dp/0080453767" ><span 
class="ecrm-0700">[LINK]</span></a>
     </dd><dt class="enumerate">
  4. </dt><dd 
class="enumerate">Friesz, T. L. and C. Kwon (2007), &#8220;Strategic Freight Network Planning Models and a Dynamic
     Oligopolistic Urban Freight Network" in <span 
class="ecti-1000">Handbook of Transport Modelling 2nd Edition </span>(Eds.:
     D. A. Hensher and K. J. Button), Elsevier. <a 
href="http://www.amazon.com/Handbook-Transport-Modelling-Second-Handbooks/dp/0080453767" ><span 
class="ecrm-0700">[LINK]</span></a></dd></dl>
 

<div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2011-12-31T13:06:38Z</dc:date>
<pubDate>Sat, 31 Dec 2011 13:06:38 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>HomePage</title>
<link>http://www.chkwon.net/Main/HomePage</link>
<description><![CDATA[<div><img src='http://www.chkwon.net/pmwiki/uploads/Main/chang_ub.jpg' alt='' title='' /> </div>
<p class='vspace'><a class='wikilink' href='http://www.chkwon.net/Main/MyName'>Changhyun Kwon</a> is an Assistant Professor in <a class='urllink' href='http://www.ise.buffalo.edu' title='' rel='nofollow'>Industrial &amp; Systems Engineering</a> at <a class='urllink' href='http://www.buffalo.edu' title='' rel='nofollow'>University at Buffalo</a>, the State University of New York. His research interests include transportation systems analysis and service operations problems. His research has been supported by various organizations including the National Science Foundation, the U.S. Department of Transportation, and Canadian Embassy. He received a PhD in <a class='urllink' href='http://www.ie.psu.edu' title='' rel='nofollow'>Industrial Engineering</a> in 2008 and an M.S. in Industrial Engineering and <a class='urllink' href='http://www2.ie.psu.edu/or/index.html' title='' rel='nofollow'>Operations Research</a> in 2005, both from <a class='urllink' href='http://www.psu.edu' title='' rel='nofollow'>the Pennsylvania State University</a>. He also received a B.S. in <a class='urllink' href='http://me.kaist.ac.kr/' title='' rel='nofollow'>Mechanical Engineering</a> from <a class='urllink' href='http://www.kaist.edu' title='' rel='nofollow'>KAIST</a> in 2000. 
</p>
<p class='vspace'>Graduate students who joined UB recently may find <a class='wikilink' href='http://www.chkwon.net/Main/AGuideToBeginningGraduateStudentsAtUB'>A Guide To Beginning Graduate Students At UB</a> helpful. The guide may also be helpful to graduate students in other universities. See also <a class='wikilink' href='http://www.chkwon.net/Main/Resources'>Resources</a> for many other useful information.
</p>
<div class='vspace'></div><h2>Contact </h2>
<ul><li>400 <a class='urllink' href='http://maps.google.com/maps/ms?ie=UTF8&amp;oe=UTF-8&amp;hl=en&amp;msa=0&amp;msid=202336617780477830410.0004a37ce2d712c7659a8&amp;ll=43.001697,-78.78695&amp;spn=0.00849,0.01929&amp;z=16' title='' rel='nofollow'>Bell Hall</a>, <a class='urllink' href='http://www.buffalo.edu/buildings/building?id=BELL' title='' rel='nofollow'>University at Buffalo</a> (SUNY), Buffalo, NY 14260
</li><li>Tel: +1-716-645-4705
</li><li>Fax: +1-716-645-3302
</li><li>Email: <a href="mailto:chkwon@buffalo.edu">chkwon@buffalo.edu</a>
</li><li><a href="http://www.linkedin.com/in/chkwon" ><img src="http://www.linkedin.com/img/webpromo/btn_liprofile_blue_80x15.png" width="80" height="15" border="0" alt="View Changhyun Kwon's profile on LinkedIn" /></a>
</li></ul><p class='vspace'><a class='wikilink' href='http://www.chkwon.net/Main/CV'>CV</a> | <a class='wikilink' href='http://www.chkwon.net/Main/Research'>Research</a> | <a class='wikilink' href='http://www.chkwon.net/Main/Teaching'>Teaching</a> | <a class='wikilink' href='http://www.chkwon.net/Main/Resources'>Resources</a> | <a class='wikilink' href='http://www.chkwon.net/Main/Personal'>Personal</a> | <a class='wikilink' href='http://www.chkwon.net/Main/Search'>Search</a>
<br/><br/><br/>
</p>
<p class='vspace'><a href="http://www.flickr.com/photos/chkwon/6139024792/" title="Buffalo Skyline by ch.kwon, on Flickr"><img src="http://farm7.static.flickr.com/6205/6139024792_d5bb49836c_z.jpg"  alt="Buffalo Skyline"></a>
</p>
<div class='vspace'></div><div id="number" style="color:white"></div>
<p><script type="text/javascript"> 
var today = new Date(); 
var day2000 = new Date("January 8, 2000"); 
var days = -1 * ( Math.ceil((day2000 - today) / 1000 / 24 / 60 / 60) ); 
document.getElementById('number').innerHTML= days;
</script>	
</p>
<div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2011-12-05T18:35:49Z</dc:date>
<pubDate>Mon, 05 Dec 2011 18:35:49 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>Career</title>
<link>http://www.chkwon.net/Main/Career</link>
<description><![CDATA[<h2>Links</h2>
<ul><li><a class='urllink' href='http://www2.informs.org/employment.html' title='' rel='nofollow'>INFORMS Employment Services</a>
</li><li><a class='urllink' href='http://www.siam.org/careers/' title='' rel='nofollow'>SIAM Careers</a>
</li><li><a class='urllink' href='http://www.iienet2.org/Landing.aspx?id=388' title='' rel='nofollow'>IIE Jobs</a>
</li><li><a class='urllink' href='http://www.asce.org/careers/' title='' rel='nofollow'>ASCE Careers</a>
<div class='vspace'></div></li><li><a class='urllink' href='http://www.mathjobs.org/' title='' rel='nofollow'>Jobs for Mathematicians</a>
</li><li><a class='urllink' href='http://www.ams.org/employment' title='' rel='nofollow'>AMS Careers and Employment</a>
<div class='vspace'></div></li><li><a class='urllink' href='http://www.jobs.ac.uk/' title='' rel='nofollow'>Jobs.ac.uk</a>
<div class='vspace'></div></li><li><a class='urllink' href='http://www.phds.org/' title='' rel='nofollow'>PhDs.org</a>
</li><li><a class='urllink' href='http://www.academickeys.com/' title='' rel='nofollow'>AcademicKeys.com</a>
</li><li><a class='urllink' href='http://www.academiccareers.com/' title='' rel='nofollow'>Academic Careers Online</a>
</li><li><a class='urllink' href='http://chronicle.com/jobs/' title='' rel='nofollow'>Careers, The Chronicle of Higher Education</a>
</li><li><a class='urllink' href='http://www.postdocjobs.com/' title='' rel='nofollow'>PostDoc Jobs</a>
</li><li><a class='urllink' href='http://www.findapostdoc.com/' title='' rel='nofollow'>Find a Post Doc</a>
<div class='vspace'></div></li><li><a class='urllink' href='http://www.higheredjobs.com/faculty/search.cfm?JobCat=146' title='' rel='nofollow'>HigherEdJobs Industrial Engineering Faculty Jobs</a>
</li><li><a class='urllink' href='http://www.higheredjobs.com/faculty/search.cfm?JobCat=115' title='' rel='nofollow'>HigherEdJobs Civil and Environmental Engineering Faculty Jobs</a>
</li><li><a class='urllink' href='http://www.higheredjobs.com/faculty/search.cfm?JobCat=104' title='' rel='nofollow'>HigherEdJobs Mathematics Faculty Jobs</a>
</li></ul><div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2011-11-30T14:53:13Z</dc:date>
<pubDate>Wed, 30 Nov 2011 14:53:13 GMT</pubDate>
<author>chang</author>
</item>
<item>
<title>Linux</title>
<link>http://www.chkwon.net/Main/Linux</link>
<description><![CDATA[<h2>Ubuntu</h2>
<p>I believe Ubuntu is the best linux distribution for any personal use. Its support for package install/update/remove is really powerful and easy to use even for beginners like me. 
</p><ul><li><a class='urllink' href='http://www.ubuntulinux.org' title='' rel='nofollow'>Ubuntu Linux</a>
</li><li><a class='urllink' href='http://www.ubuntuforums.org' title='' rel='nofollow'>Ubuntu Forums</a>
</li><li><a class='urllink' href='http://www.ubuntuguide.org' title='' rel='nofollow'>Unofficial Ubuntu Starter Guide</a>
</li></ul><div class='vspace'></div><h2>Linux Community</h2>
<ul><li><a class='urllink' href='http://www.kldp.org' title='' rel='nofollow'>KLDP</a> {ko}
</li><li><a class='urllink' href='http://www.linux-sarang.net' title='' rel='nofollow'>Linux Sarang Net</a> {ko}
</li></ul><div class='vspace'></div><h2>Tutorials</h2>
<ul><li><a class='urllink' href='http://www.viemu.com/a_vi_vim_graphical_cheat_sheet_tutorial.html' title='' rel='nofollow'>Graphical vi-vim Cheat Sheet and Tutorial</a>
</li></ul><div class='vspace'></div><h2><a class='urllink' href='http://psung.blogspot.com/2010/09/thinkpad-trackpoint-scrolling-in-ubuntu.html' title='' rel='nofollow'>Thinkpad TrackPoint Scrolling in Ubuntu</a></h2>
<div class='vspace'></div>
]]></description><dc:contributor>chang</dc:contributor>
<dc:date>2011-10-22T15:46:23Z</dc:date>
<pubDate>Sat, 22 Oct 2011 15:46:23 GMT</pubDate>
<author>chang</author>
</item>
</channel>
</rss>

