英語論文セミナー 2020

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

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

開催日: 7月末を予定

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

会場: 研究室

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

選んだ論文を記入してください． すでに他の人が選んだ論文と同じ論文は選べません。 ぶつかった場合には調整が必要です。

• 　　氏名　:　 論文タイトル
• 1) 米谷元汰 : Calibrating an eCompass in the Presence of Hard- and Soft-Iron Interference
• 2) CHEN JIA HAUR : An O(n) Algorithm for determining the subregion-tree
• 3) 松浦清太 : Handwritten Digit Recognition Based on Classification Functions
• 4) 赫亜州 ： Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• 5) 井口凌真：Symbolic Algorithms for Token Swapping
• 6) 渡邉 虎太郎 : Multi-Valued Decision Diagrams in Importance Analysis Based on Minimal Cut Vectors
• 7) 今野圭祐 : Toward Effective Utilization of Methane: Machine Learning Prediction of Adsorption Energies on Metal Alloys
• 8) 玉川皓規 : Capacity Limits of Fully Binary CNN
• 9)サイケイエツ ：Layout Optimization for Quantum Circuits with linear Nearest Neighbor Architectures
• 10) 山崎琢磨 : Scaling Word2Vec on Big Corpus
• 11) 後藤友希 : Marginalized Kernels Between Labeled Graphs
• 12) 伊藤大修 : Classic Nintendo games are (computationally) hard

自分が読みたい論文を選んでください．

by Hirayama

臨時で研究室Webサイトに論文PDFを置きました。著作物ですので、当研究室の学生のみアクセスしてください。一般公開しません。学内限定公開です。

https://www.kono.cis.iwate-u.ac.jp/~hirayama/Papers/

上記ページは学内限定公開ですので、学内PCからアクセスするか、自宅PCからはVPN接続してください。詳しくは情報基盤センターのVPN接続の利用方法を参照してください。

以下から選んでみてください。 論文はまだ追加されるかもしれませんが、今あるうちから選んでかまいません。

• Proceedings of ISMVL 2020から (~hirayama/Papers/4jkenshu-2020/ISMVL2020_Accepted_Draft/参照)。 平山が注目している論文は下記:
  • ISMVL_2020_paper_3.pdf
  • ISMVL_2020_paper_8.pdf
  • ISMVL_2020_paper_29.pdf
  • ISMVL_2020_paper_51.pdf
  • ISMVL_2020_paper_60.pdf
• 昨年の候補から(~hirayama/Papers/4jkenshu-2019/)
• 過去の候補から(~hirayama/Papers/4jkenshu-20??/)
• ページ下方の「By M1 Akaishi」から
• 下記の候補から

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

• Ali2018_Function_design_for_minimum_multiple-control_Toffoli_circuits_of_reversible_adder-subtractor_blocks_and_arithmetic_logic_units.pdf
• Gaur2019_Design_of_Reversible_Arithmetic_Logic_Unit_with_Built-In_Testability.pdf
• Pedram2016_Layout_Optimization_for_Quantum_Circuits_with_Linear_Nearest_Neighbor_Architectures.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

by Yamanaka

読みたい論文の候補を作ってから私に相談してください．相談しながら決めましょう． インターネットで検索すれば論文のPDFファイルは見れることがほとんどです． 見つけられない場合は，私が送ります．

Calibration

• Talat Ozyagcilar, Calibrating an eCompass in the Presence of Hard and Soft-Iron Interference, Freescale Semiconductor, Application Note, No. AN4246, 2013.
• Talat Ozyagcilar, Implementing a Tilt-Compensated eCompass using Accelerometer and Magnetometer Sensors, Freescale Semiconductor, Application Note, No. AN4246, 2013.

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.
• T. Toyao, K. Suzuki, S. Kikuchi, S. Takakusagi, K. Shimizu, I. Takigawa, Toward effective utilization of methane: machine learning prediction of adsorption energies on metal alloys, J. Phys. Chem. C, 2018, 122 (15): 8315-8326.
• I. Takigawa, H. Mamitsuka, Generalized sparse learning of linear models over the complete subgraph feature set, IEEE Trans. Pattern Anal. Mach. Intell. 2017, 39 (3): 617-624.
• I. Takigawa, K. Shimizu, K. Tsuda, S. Takakusagi, Machine-learning prediction of d-band center for metals and bimetals, RSC Adv. 2016, 6: 52587-52595.
• I. Takigawa, H. Mamitsuka, Efficiently mining δ-tolerance closed frequent subgraphs, Machine Learning, 2011, 82 (2): 95-121.

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 M1 Akaishi