発表論文

学位論文

• Takayuki Osogami, Analysis of multiserver systems via dimensionality reduction of Markov chains, Ph.D. thesis, School of Computer Science, Carnegie Mellon University, June 2005.


• 恐神貴行, 光同期レシーバ回路を用いたクロック供給システム, 卒業論文, 東京大学 工学部, 1998年2月.
  

論文誌, 査読あり

• [TOMACS08] Takayuki Osogami, "Finding probably best systems quickly via simulations," ACM Transactions on Modeling and Computer Simulation, accepted for publication, 2008.


• [PE06b] Adam Wierman, Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf, "How many servers are best in a dual-priority M/PH/k system?," Performance Evaluation, 63(12):1253-1272, 2006.
• [PE06a] Takayuki Osogami and Mor Harchol-Balter, "Closed Form Solutions for Mapping General Distributions to Minimal PH Distributions," Performance Evaluation, Special issue for the selected best papers of TOOLS 2003, 63(6):524-552, 2006.


• [QUESTA05] M. Harchol-Balter, T. Osogami, A. Scheller-Wolf, and A. Wierman, "Multi-server queueing systems with multiple priority classes," Queueing Systems: Theory and Applications, 51(3-4):331-360, 2005.
• [PE05] Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf, "Analysis of cycle stealing with switching costs and thresholds," Performance Evaluation, 61(4): 347-369, 2005.


• [HEUR03] Takayuki Osogami and Hiroyuki Okano, "Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics," Journal of Heuristics, 9: 29-49, 2003.

国際会議・研究会論文, 査読あり

• [DSN08] Sei Kato and Takayuki Osogami, "Evaluating availability under quasi-heavy-tailed repair times," The 38th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2008), pages 442-451, Anchorage, AK, June 2008.


• [QEST07] Takayuki Osogami, "Relations in the central limit theorem version of the response time law," The 4th International Conference on the Quantitative Evaluation of SysTems (QEST 2007) , pages 69-78, Edinburgh, Scotland, September 2007.
• [SIGMETRICS07] Takayuki Osogami and Sei Kato, "Optimizing system configurations quickly by guessing at the performance," The ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2007), pages 145-156, San Diego, CA, June 2007.
• [MAMA07] Takayuki Osogami, "Accuracy of measured throughputs and mean response times," The Ninth Workshop on Mathematical Performance Modeling and Analysis (MAMA 2007), San Diego, CA, June 2007; ACM Performance Evaluation Review, 25(2):9-11.


• [SIGMETRICS06] Takayuki Osogami and Toshinari Itoko, "Finding probably better system configurations quickly," The ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2006), pages 264-275, Saint-Malo, France, June 2006.
• [MAMA06] Takayuki Osogami, "Finding probably best system configurations quickly," The Eighth Workshop on Mathematical Performance Modeling and Analysis (MAMA 2006), Saint-Malo, France, June 2006; ACM Performance Evaluation Review, 34(3):39-41, 2006.
  


• [SIGMETRICS05] Adam Wierman,  Mor Harchol-Balter, and Takayuki Osogami, "Nearly Insensitive Bounds on SMART Scheduling," The ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2005), pages 205-216, Banff, Canada, June 2005.
• [MAMA05] Mor Harchol-Balter, Takayuki Osogami, Alan Scheller-Wolf, "Robustness of Threshold Policies for Beneficiary-Donor Model," The Seventh Workshop on Mathematical Performance Modeling and Analysis (MAMA 2005), Banff, Canada, June 2005; ACM Performance Evaluation Review, 33(2):36-38, 2005.
  


• [MAMA04] Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, and Alan Scheller-Wolf, "A recursive analysis technique for multi-dimensionally infinite Markov chains," The Sixth Workshop on Mathematical Performance Modeling and Analysis (MAMA 2004), New York, NY, June 2004; ACM Performance Evaluation Review, 32(2):3-5, 2004.


• [MASCOTS03] Adam Wierman, Takayuki Osogami, and Jorgen Olsen, "A Unified Framework for Modeling TCP-Vegas, TCP-SACK, and TCP-Reno," The 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2003), pages 269-278, Orlando, FL, October 2003.
• [TOOLS03b] Takayuki Osogami and Mor Harchol-Balter, "A Closed-form Solution for Mapping General Distributions to Minimal PH Distributions," The 12th International Conference on Modelling Tools and Techniques for Computer and Communication System Performance Evaluation (TOOLS 2003), pages 200-217, Urbana, IL, September 2003.
• [TOOLS03a] Takayuki Osogami and Mor Harchol-Balter, "Necessary and Sufficient Conditions for Representing General Distributions by Coxians," The 12th International Conference on Modelling Tools and Techniques for Computer and Communication System Performance Evaluation (TOOLS 2003), pages 182-199, Urbana, IL, September 2003.
• [SIGMETRICS03] Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf, "Analysis of Cycle Stealing with Switching Cost," The ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2003), pages 184-195, San Diego, CA, June 2003.
• [SPAA03] Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, and Mark S. Squillante, "Cycle Stealing under Immediate Dispatch Task Assignment," The Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), pages 274-285, San Diego, CA, June 2003.
• [MAMA03] Adam Wierman, Takayuki Osogami, and Jorgen Olsen, "Modeling TCP-Vegas under On/Off Traffic," The Fifth Workshop on Mathematical Performance Modeling and Analysis (MAMA 2003), San Diego, CA, September 2003; ACM Performance Evaluation Review, 31, pages 6-8, 2003.
• [ICDCS03] Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, and Mark S. Squillante, "Analysis of Task Assignment with Cycle Stealing under Central Queue," The 23rd IEEE International Conference on Distributed Computing Systems (ICDCS 2003), pages 628-637, Providence, RI, May 2003.


• [ISAAC00] Takayuki Osogami and Hiroshi Imai, "Classification of Various Neighborhood Operations for the Nurse Scheduling Problem (Extended Abstract),"  The Eleventh Annual International Symposium on Algorithms And Computation (ISAAC 2000), Taipei, Taiwan, December (2000); in Lecture Notes in Computer Science, 1969: 72-83, 2000.

国際会議ポスター, 査読あり

• [WSC06] Takayuki Osogami, "Finding Probably Best Systems Quickly via Simulations," The 2006 Winter Simulation Conference (WSC 2006), Monterey, CA, December 2006.

招待論文・講演

• [IN07] 恐神貴行, "［招待講演］マルコフ連鎖の次元削減法とタスク割り当てルールの性能解析への応用," 電子情報通信学会 情報ネットワーク研究会, 愛知郡, 2007年2月.
  
• [ALLERTON04] Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf, Li Zhang, "Exploring Threshold-based Policies for Load Sharing," The Forty-Second Annual Allerton Conference on Communication, Control, and Computing, pages 1012-1021, Urbana, IL, September 2004.

翻訳/通訳

• J. Spohrer, P. P. Maglio, J. T. Kreulen, S. Srinivasan, "Becoming a Service Scientist," 情報処理, 47(5): 461-466, 2006年5月. 英日翻訳 with 鹿島久嗣, 加納真, and 水田秀行.


• サービスサイエンスシンポジウムにおいて日英通訳, 東京, 2005年9月.

書きかけの論文

• Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf, "Robustness and performance of threshold-based resource allocation policies."
• Takayuki Osogami, "Analysis of a QBD Process that Depends on Background QBD Processes."

その他の論文と発表

• 恐神貴行, "流体極限におけるLRUキャッシュアルゴリズム," 日本オペレーションズ・リサーチ学会2008年秋季研究発表会, 札幌, 2008年9月.
• 恐神貴行 and 平出涼, "2Qキャッシュアルゴリズムの流体解析" 待ち行列シンポジウム「確率モデルとその応用」, 京都, 2008年1月.
• 平出涼 and 恐神貴行, "依存する無効化を考慮したLRUアルゴリズムの流体解析", 待ち行列シンポジウム「確率モデルとその応用」, 京都, 2008年1月.
• 
  
• 恐神貴行, "確率モデルによるWebシステムの性能最適化", 東京工業大学情報理工学研究科講演会, 東京, 2007年10月.
• 恐神貴行, "手戻り構造行列による設計プロセスの最適化," スケジューリング・シンポジウム2007, 京都, 2007年9月.


• [NDRM06] Rikiya Takahashi and Takayuki Osogami, "Action-sensitive hidden Markov model of customer behavior," Tsukuba-Tohoku Joint Workshop on New Directions of Research in Marketing , Tsukuba, Japan, December 2006.
• "複数のサーバからなる様々なシステムの性能解析" 日本オペレーションズ・リサーチ学会　待ち行列研究部会, 東京, 2006年11月.
• "アメリカの大学院への留学" お茶の水女子大学理学部情報科学科, 東京, 2006年4月.
• "アメリカの大学院への留学" 東京工業大学数理・計算科学専攻 談話会, 東京, 2006年4月.
• "アメリカの大学院への留学" 東京大学情報科学科 なんでもセミナー, 東京, 2006年1月.


• "Approximating general distributions by minimal PH distributions," Workshop on Quantitative Models for Production and Communication Networks, Eindhoven, Netherlands, July 2004.
• "An adaptive threshold-based policy for sharing servers with affinities," INFORMS/APS Conference, Beijing, China, June 2004.
• "Designing good & robust policies," The ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2004), Work-in-progress session, New York, NY, June 2004.


• Alan Sheller-Wolf, Mor Harchol-Balter, Takayuki Osogami, and Adam Wierman, "A new dimensionality reduction approach applied to computer scheduling," INFORMS 2003, Atlanta, GA, October 2003.
• Mor Harchol-Balter, Takayuki Osogami, and Alan Scheller-Wolf, "Cycle Stealing and the Dimensionality Reduction Technique."
• Takayuki Osogami, Mor Harchol-Balter, and Alan Scheller-Wolf, "Performance Analysis of Benefits of Cycle Stealing."
• Alan Scheller-Wolf, Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, and Mark Squillante, "Analysis of Task Assignment."
• Adam Wierman, Mor Harchol-Balter, Takayuki Osogami, and Alan Scheller-Wolf, "Priority Scheduling in Multiserver System."


• 恐神貴行 and 今井浩, "Classification of various neighborhood operations for the nurse scheduling problem [full paper]," presented at 研究集会「最適化：モデリングとアルゴリズム」, 東京; 統計数理研究所共同研究リポート, 135, pp. 77-91, 2000年3月.


• Takayuki Osogami and Hiroyuki Okano, "Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics," INFORMS Fall Meeting, Philadelphia, PA, November 1999.
• 恐神貴行 and 岡野裕之, "ビン・パッキング問題における局所探索法と構築法との関係," presented at 第69回アルゴリズム研究会, 札幌; 情報処理学会研究報告, 99-AL-69-5, pp. 33-40, 1999年9月.


• Takayuki Osogami, "Approaches to 3D Free Form Cutting and Packing Problems and Their Applications: A Survey," IBM TRL Research Report, RT0287, 1998.