英語論文セミナー 2019

（注意！！：論文情報はまだ 作成中です．Apr 02, 2019） --> 2019バージョンになりました．

論文を読みます．４年生は各自，自分が読みたい論文を選んでください． 2014年度までは、授業の一貫としてやっていましたが、2015年度からは研究室での取り組みとして行います．

開催日: 7月末を予定

原稿締切: 開催日の一週間前までにA4（表裏）1枚のレジュメを完成させる（担当教員からOKをもらう）

会場: 研究室

発表時間 1人30分程度（発表12分，質疑応答18分）の予定

選んだ論文を記入してください．

• 氏名: 論文タイトル
• 福士遼: A. Yada, K. Nagata, Y. Ando, T. Matsumura, S. Ichinoseki, and K. Sato, Machine learning approach for prediction of reaction yield with simulated catalyst parameters, Chemistry Letters, no.3, vol.47, 2018
• 高橋青玄: D.T. Ahneman, J.G. Estrada, S. Lin, S.D. Dreher, and A.G. Doyle, Predicting reaction performance in C–N cross-coupling using machine learning, Science, vol.360, no.6385, April 2018.
• 高瀬祐: Talat Ozyagcilar, Implementing a Tilt-Compensated eCompass using Accelerometer and Magnetometer Sensors Freescale Semiconductor Application Note, Document Number: AN4248, Rev. 3, 01/2012
• 山口拓也: T. Korenaga, R. Sasaki, T. Takemoto, T. Yasuda, and M. Watanabe, Computationally-Led Ligand Modification using Interplay between Theory and Experiments: Highly Active Chiral Rhodium Catalyst Controlled by Electronic Effects and CH–p Interactions, Advanced Synthesis and Catalysis, vol. 360, pp.322–333, 2017.
• 赤石譲: Ali2016_New_two-qubit_gate_library_with_entanglement
• 佐藤廉: One strike against the min-max degree triangulation problem
• 江渡崇陽:Ali2018_Function_design_for_minimum_multiple-control_Toffoli_circuits_of_reversible_adder-subtractor_blocks_and_arithmetic_logic_units
• 齋藤早彩: A Novel Machine Learning Algorithm to Reduce Prediction Error and Accelerate Learning Curve for Very Large Datasets(ISMVL19_paper_38.pdf)
• 戸澤菜々子:R. Bellman, Dynamic Programming Treatment of the Travelling Salesman Problem, J. ACM, vol.9, pp.61-63, 1962
• 藤澤柚子:Tasmin2018_FPGA_synthesis_of_dynamic_learning_tree_with_high-level_programming_language

自分が読みたい論文を選んでください． 論文は各教員が持っていますので、来てくれれば内容を見ることができます．

by Hirayama

以下から選んでみてください。

• Proceedings of ISMVL 2019から (~hirayama/Papers/4jkenshu-2019/ISMVL2019_Accepted_Draft/参照)
• 昨年の候補から(~hirayama/Papers/4jkenshu-2018/)
• 過去の候補から(~hirayama/Papers/4jkenshu-20??/)
• ページ下方の「By M2 Kaunuma」，「By M2 Maki」から
• 下記の候補から

これらの論文のPDFおよび出典情報は、~hirayama/Papers/4jkenshu-2019/にあります。 .pdfが論文のPDFファイルで、.txtが論文の出典情報です。

• Ali2016_New_two-qubit_gate_library_with_entanglement.pdf
• Ali2018_Function_design_for_minimum_multiple-control_Toffoli_circuits_of_reversible_adder-subtractor_blocks_and_arithmetic_logic_units.pdf
• Aloul2001_MINCE_A_Static_Global_Variable-Ordering_for_SAT_and_BDD.pdf
• Aloul2003_FORCE_A_Fast_and_Easy-To-Implement_Variable-Ordering_Heuristic.pdf
• Pedram2016_Layout_Optimization_for_Quantum_Circuits_with_Linear_Nearest_Neighbor_Architectures.pdf
• Pontarelli2015_Low_Delay_Single_Symbol_Error_Correction_Codes_Based_on_Reed_Solomon_Codes.pdf
• Saab1994_An_Effective_Solution_to_the_Linear_Placement_Problem.pdf
• Shafaei2013_Optimization_of_Quantum_Circuits_for_Interaction_Distance_in_Linear_Nearest_Neighbor_Architectures.pdf
• Tasmin2018_FPGA_synthesis_of_dynamic_learning_tree_with_high-level_programming_language.pdf

by Yamanaka

論文は `~yamanaka/Papers/4jkenshu-2019/' の中にあります． 見つからない場合は私に声をかけてください． 2019年度は，機械学習アルゴリズムの論文を勉強したいと思いますので，「Machine Learning」の欄から選んでください． よろしくお願いします．

Machine Learning

• A. Yada, K. Nagata, Y. Ando, T. Matsumura, S. Ichinoseki, and K. Sato, Machine learning approach for prediction of reaction yield with simulated catalyst parameters, Chemistry Letters, no.3, vol.47, 2018. [YadaNAMIS2018.pdf]
• D.T. Ahneman, J.G. Estrada, S. Lin, S.D. Dreher, and A.G. Doyle, Predicting reaction performance in C–N cross-coupling using machine learning, Science, vol.360, no.6385, April 2018. [AhnemanELDD-science-2018.pdf]
• T. Korenaga, R. Sasaki, T. Takemoto, T. Yasuda, and M. Watanabe, Computationally-Led Ligand Modification using Interplay between Theory and Experiments: Highly Active Chiral Rhodium Catalyst Controlled by Electronic Effects and CH–p Interactions, Advanced Synthesis and Catalysis, vol. 360, pp.322–333, 2017.
• D. Duvenaud, D. Maclaurin, J.A. Iparraguirre, R.G. Bombarelli, T. Hirzel, A.A. Guzik, R.P. Adams, Convolutional Networks on Graphs for Learning Molecular Fingerprints, in Proceedings of Advances in Neural Information Processing Systems 28 (NIPS2015), pp.2224-2232, 2015.

Exact Exponential Algorithms

• R. Bellman, Dynamic Programming Treatment of the Travelling Salesman Problem, J. ACM, vol.9, pp.61-63, 1962.
• M. Held and R.M. Karp, A dynamic programming approach to sequencing problems, Journal of SIAM, vol.10, pp.196-210, 1962. [HK62.pdf]
• R.E. Tarjan and A.E. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6(3), 537-546, 1977.

Floorplans

• An O(n) algorithm for determining the subregion-tree representation of a rectangular dissection, SIAM Journal of Computing, vol.22, no.1, pp.79-101, Feb 1993.
• Z.C. Shen and C.C.N. Chu, Bounds on the Number of Slicing, Mosaic, and General Floorplans, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.22, no.10, Oct. 2003.

Algorithm and Computational Complexity

• G. Aloupis, E.D. Demaine, A. Guo, and G. Viglietta, Classic nintendo games are (computationally) hard, In Proceedings of The 7th International Conference on FUN with Algorithms (FUN 2014), Lecture Notes in Computer Science, vol.8496, pp.40-51, 2014.
• M.R. Garey and D.S. Johnson, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, no.3, pp.237-267, 1976. [GJ76.pdf]
• V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, vol.37, pp.27-35, 1991.

Token-swapping, Amidakuji and Permutation

• A. Caprara, Sorting Permutations by Reversals and Eulerian Cycle Decompositions, SIAM Journal on Discrete Mathemtics, vol.12, no.1, pp.91--110, 1999.
• S. Felsner On the number of arrangements of pseudolines, Discrete & Computational Geometry, vol.18, pp.257-267, 1997. [F97.pdf]
• M.R. Jerrum, The Complexity of Finding Minimum-length Generator Sequences, Theoretical Computer Science, vol.36, pp.265-289, 1985. [J85.pdf]
• M. Jerrum, A Compact Representation for Permutation Groups, Journal of Algorithms vol.7, pp.60-78, 1986.
• J. Kawahara, T. Saitoh, and R. Yoshinaka, The time complexity of the token swapping problem and its parallel variants, Proc. of 11th Internatioal Conference and Workshops on Algorithms and Computation, Lecture Notes on Computer Science, vol.10167, pp.448-459, 2017

Enumeration and Counting

• (*) D. Avis, Generating rooted triangulations without repetitions, Algorithmica, vol.16, pp.618-632. [A96.pdf]
• L.A. Goldberg, Efficient Algorithms for Listing Unlabeled Graphs, Journal of Algorithms vol.13, pp.128-143, 1992. [hard copy only] (challenging)
• P.A. Golovach, P. Heggernes, D. Kratsch, Enumerating minimal connected dominating sets in graphs of bounded chordality, Theoretical Computer Science, vol.630, pp.63-75, 2016.
• P. Hanlon, Counting Interval Graphs, Transactions of the Mathematical Society, vol.272, no.2, pp.383-426, 1982. [H82.pdf] (challenging)
• S. Maxwell, M.R. Chance, and M. Koyuturk, Efficiently enumerating all connected induced subgraphs of a large molecular network, Proc of AlCoB 2014, LNBI, vol.8542, pp.171-182, 2014
• K. Tani, I. Shirakawa, and S. Tsukiyama, An Algorithm to Enumerate All Rectangular Dual Graphs, Electronics and Communications in Japan, Part 3, vol.3, pp.52-62, 1989. [TST89.pdf]
• (*) R.C. Read and R.E. Tarjan, Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning. Trees, Networks 5, 237-252, 1975.
• T Uno, Constant Time Enumeration by Amortization. In Proc. of Symposium on Algorithms and Data Structures (WADS 2015), Lecture Notes in Computer Science, vol 9214, pp.593-605, 2015. U15.pdf
• K. Wasa, H. Arimura, and T. Uno, Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph, Proc. of ISAAC 2014, pp 94-102, 2014.

Reconfiguration Problems

• T. Ito, E.D. Demaine, N.J.A. Harvey, C.H. Papadimitriou, M. Sideri, R. Uehara, Y. Uno, On the complexity of reconfiguration problems, Theoretical Computer Science, vol.412, pp.1054-1065, 2011. [IDHPSUU11.pdf]
• A.E. Mouawad, N. Nishimura, V. Raman, N. Simjour, and A. Suzuki, On the parameterized complexity of reconfiguration problems, Proc. of IPEC, LNCS, vol.8246, pp.281-294, 2013.

Misc.

A. Shafaei, M. Saeedi, and M. Pedram, Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures, in Proceedings of the 50th Annual Design Automation Conference (DAC '13), pp.1-6.

by M2 Kainuma

/home/kono/kainuma/master/Paper内

• M. Sarkar and P. Ghosal and S.P. Mohanty, Reversible Circuit Synthesis Using ACO and SA based Quine-McCluskey method, Circuits and Systems (MWSCAS), 2013 IEEE 56th International Midwest Symposium on, August, 2013, pp.416--419. [Reversible Circuit Synthesis Using ACO and SA based Quine-McCluskey method.pdf]
• M. Li and Y. Zheng and M.S. Hsiao and C. Huang, Reversible Logic Synthesis Through Ant Colony Optimization, Design, Automation \& Test in Europe Conference & Exhibition (DATE), 2010, March, pp.307--310. [Reversible Logic Synthesis Through Ant Colony Optimization.pdf]
• G. Yang and X. Song and W.N.N. Hung and M.A. Perkowski, Fast synthesis of exact minimal reversible circuits using group theory, ASP-DAC '05 Proceedings of the 2005 Asia and South Pacific Design Automation Conference, 2005, pp.1002--1005. [Fast synthesis of exact minimal reversible circuits using group theory.pdf]

by M2 Maki

/home/kono/makky/paper内

• Fadi A. Aloul and Igor L. Markov and Karem A. Sakallah, MINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation, j-jucs, pp.1562-1596, 2004[paper1.pdf]
• Robert Wille and Nils Quetschlich and Yuma Inoue and Norihito Yasuda and Shin{-}ichi Minato, Using {\textbackslash}pi DDs for Nearest Neighbor Optimization of Quantum Circuits, {Reversible Computation - 8th International Conference, {RC} 2016, Bologna, Italy, July 7-8, 2016, Proceedings}, pp.181-196, 2016[paper2.pdf]
• M. Szyprowski and P. Kerntopf, Reducing quantum cost in reversible toffoli circuits, Proc. 10th Reed- Muller Workshop, pp. 127–136, 2011.[paper3.pdf]
• Zulehner A., Gasser S., Wille R. (2017) Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A∗. In: Phillips I., Rahaman H. (eds) Reversible Computation. RC 2017. Lecture Notes in Computer Science, vol 10301. Springer, Cham[paper4.pdf]
• Meza, Edgar & Fernández, Joni & Baran, Benjamin & Lima, Joaquín. (2015). A Parallel Approach to Convert Quantum Circuits to an LNN Architecture.[paper5.pdf]