Tuesday 13th November 2012
London Mathematical Society
http://www.lms.ac.uk/content/computer-science-day

This one-day meeting is run by the LMS Computer Science Colloquium in
association with the EPSRC Network on Numerical Algorithms and High
Performance Computing. The aim of the colloquium is to provide an
opportunity for dialogue between researchers working in the
Mathematics of Numerical Algorithms and Computer Scientists working in
Formal Verification of numerical programs.

The speakers are

- Jean-Michel Muller (ENS Lyon)
- David Monniaux (CNRS/VERIMAG Grenoble)
- Daniel Kroening (University of Oxford)
- George A. Constantinides (Imperial College London)

日時：10月17日（水）16:30-18:00

講師：田中健一郎氏（公立はこだて未来大学 システム情報科学部）

題目：周期的な係数関数を持つ微分作用素の固有値問題に対するSinc数値計算法

会場：一橋大学国立キャンパス　第３研究館３階共同会議室
　　　こちらの40番の建物になります。
　　　http://www.hit-u.ac.jp/guide/campus/campus/

幹事：小林健太 kenta.k@r.hit-u.ac.jp

本講演では，中尾充宏校長（佐世保工業高等専門学校），木下武彦研究員（京都大学RIMS）と講演者による，放物型初期値境界値問題に関する共同研究の成果を発表する．特に，熱方程式に対する時間方向に補間を用いた近似の誤差評価，その応用による線形放物型問題に解を与える作用素のノルム評価，及びこれらの応用による非線形問題の解の存在に対する計算機援用証明について述べる．

詳細:

http://www.infsup.jp/utnas/

　本シンポジウムは、平成24年度E-サイエンス若手・女性研究者助成事業の採択者による成果発表、および東京大学情報基盤センタ－が実施する若手利用者推薦制度における平成24年度後期採択者の課題内容を紹介するシンポジウムです。 

日　時： 

2012年10月17日（水）10:00 ～ 18:30（懇親会：19:00～）

会　場：

東京大学柏キャンパス第2総合研究棟　情報基盤センター　3階 315会議室

参加費：

シンポジウム参加無料、懇親会4,000円（懇親会のみ事前申込）

詳細：

http://www.cc.u-tokyo.ac.jp/event/sympo/14/

============================================================================
13:50 - 14:00 Introduction by Professor Suda

14:00 - 15:00
Surrogate-Assisted Software Auto-Tuning

Professor Weichung Wang
Department of Mathematics
National Taiwan University

Abstract:
Software auto-tuning is a board area with various applications. In auto-tuning, a set of parameters are determined to achieve particular goals such as performance optimization and load balance. On the other hand, many computer experiments can be formulated as auto-tuning problems. In this talk, we focus on surrogate-assisted approaches on parameters determinations for particular goals in different computer experiment problems. By using limited computational resources, surrogates are constructed to approximate the true response functions that are usually unknown and/or complicated. To construct the surrogates, existed statistical tools such as Kriging (Gaussian process) and expected improvement can be useful in many smooth response functions. We also develop the "overcomplete basis surrogate methodology" for complicated and oscillatory response functions. Several examples, e.g. chaotic light sources, eigenvalue solver, and photonic crystal bandgap, will be presented to illustrate the efficiency of the surrogate-assisted approaches.

15:00 - 15:15 Break

15:15 - 16:15
New Directions in Auto-tuning Higher-level Motifs

Dr. Shoaib Kamil
Computer Science Engineer
Future Technologies Group
Computational Research Division
Lawrence Berkeley National Laboratory

Abstract:
Auto-tuning has been traditionally applied to numeric kernels that are relatively simple and solve a fixed problem that cannot be substantially changed by the programmer. In this talk, I present some insights for auto-tuning higher-level motifs such as graph algorithms and others that require higher-level functions. Furthermore, some results of co-tuning from auto-tuning kernels that use other auto-tuned kernels inside will be presented. The talk's purpose is to spur discussion on techniques for co-tuning that are more tractable than the current brute-force approaches.

16:15 - Closing by Professor Katagiri

============================================================================