July 22 - August 3, 2018

Main Organizers:

• Ilkyoo Choi (Hankuk University of Foreign Studies)
• Suil O (SUNY-Korea)

Additional Organizers for summer of 2018:

• Jongyook Park (Wonkwang University)
• Sun-Young Nam (Sogang University)

• Wonkwang University

Accomodation

• 익산유스호스텔 (전라북도 익산시 마한로 11)

July 22 (Sunday)

• 13:00 -- 14:00 registration & check in
• 14:00 -- 18:00 introduction and problem session
• 18:00 -- dinner

July 23 (Monday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch + coffee break
• 14:00 -- 18:00 afternoon research session
• 18:00 -- banquet

July 24 (Tuesday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 25 (Wednesday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 15:00 lecture 1 (Jeong Rye Park): Hungarian Algorithm

할당문제는 기계를 작업장에, 일꾼을 직업에, 축구선수를 포지션에 할당하는 것이다. 목표는 효율성이 최대가 되거나, 총비용이 최소가 되는 최적의 할당 방법을 결정하는 것이다. 본 발표에서는 할당문제를 그래프로 표현하여 최적의 해를 찾을 수 있는 방법을 소개하며, 실제 산업현장에서 적용가능 하다는 것을 확인할 것이다.

• 15:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 26 (Thursday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 27 (Friday)

• 10:00 -- 11:00 lecture 2 (Minwon Na): Optimal non-projective linear codes constructed from down-sets

By an optimal linear code we mean that it has the highest minimum distance with prescribed length and dimension. In this talk, we construct several families of optimal linear codes over the finite field $\mathbb{F}_p$ by making use of down-sets generated by one maximal element of $\mathbb{F}^n_p$.

• 11:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 28 (Saturday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 29 (Sunday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 30 (Monday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

July 31 (Tuesday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 15:00 afternoon research session
• 15:00 -- 16:00 lecture 3 (JiSun Huh): Generating functions and bijections

For many of the counting problems, generating functions are very useful for finding relations between some sequences. In this talk, we will see an example which shows how generating functions and bijections are used to find and explain some relations between two sequences.

• 16:00 -- 18:00 afternoon research session
• 18:00 -- dinner

August 1 (Wednesday)

• 10:00 -- 18:00 research activity
• 18:00 -- banquet

August 2 (Thursday)

• 10:00 -- 12:00 morning research session
• 12:00 -- 14:00 lunch
• 14:00 -- 18:00 afternoon research session
• 18:00 -- dinner

August 3 (Friday)

• 10:00 -- 12:00 morning research session & wrap up
• 12:00 -- 14:00 lunch