CCF-TFNSG: Uniting the Discrete Methods, Optimization and the CISE Community with Community Studying Matrix Operations, Tensors,Verifiable Computational Experiments and Scalability

CCF-TFNSG：将离散方法、优化和CISE社区与研究矩阵运算、张量、可验证计算实验和可扩展性的社区结合起来2009年SIAM年会在科罗拉多州丹佛市举行。在年度会议上，通常有大量SIAM计算机科学与工程小组的代表，他们研究矩阵运算，张量，可验证计算和可扩展性，但很少或没有CISE社区，离散方法或优化社区的代表。作为研究促进这种互动的可行性的试点努力，来自SIAM离散数学活动小组的Lenore Cowen和来自CS和E SIAM活动小组的Tamara Kolda主持了2008年SIAM年会。在CS和E方面，组织了一个完整的CS和E轨道，以及一个关于数值线性代数和张量方法的会议主题。在离散和CISE方面，组织了一个特别的网络主题：生物，社会和互联网。2009年，Lenore Cowen同意通过离散数学活动小组在SIAM年会上组织一个轨道。离散数学活动小组每年举办两次会议，并且每年与ACM SIGACT共同举办SODA（离散算法会议）。该提案的目标是让通常参加SIAM离散数学和ACM-SIAM SODA会议的参与者社区参加年度会议的小型研讨会，旨在促进共同感兴趣的主题的互动。我们的计划有三个方面：1)让CS和E方面的Bruce Hendrickson主持一个关于组合科学计算的小型研讨会，同时让CS和E方面的人主持一个关于张量和数据挖掘的小型研讨会（可能是Tammy Kolda）。2)重复网络：生物，社会和互联网的主题，在几个小型研讨会上邀请CISE的人；3)邀请一些核心的离散数学和优化的人，在SIAM年度会议之外，共同举办一个宴会，以纪念丹尼·克莱特曼？75岁生日。结果将是一个真正跨学科的会议。我们要求捐款2万美元，用于支持小型研讨会演讲者的注册费、交通费和住宿费；这笔资金将分配给28-32名小型专题讨论会的发言者，并优先向来自较远地区和/或没有其他旅费补助来源的发言者提供资金。我们要求额外拨款1.5万美元作为研究生出席会议的旅费，并将尽一切努力扩大研究生的参与范围。会议期间的非siam活动，也就是为Danny Kleitman举办的宴会，不需要任何资金吗？年代的生日。宴会费用由参加者自理。

CCF-TFNSG: Uniting Discrete Methods, Optimization and the CISE Community with the Community studying Matrix Operations, Tensors, Verifiable Computational Experiments and ScalabilityThe 2009 SIAM Annual meeting is taking place in Denver, Colorado. There is typically a great deal of representation of the SIAM Computer Science and Engineering group at the Annual meeting that studies matrix operations, tensors, verifiable computing and scalability, but little or no representation of the CISE Community, the Discrete Methods or the Optimization Communities. As a pilot effort to study the feasibility of promoting such interaction, Lenore Cowen from the SIAM Discrete Math activity group, and Tamara Kolda from the CS and E SIAM activity group, chaired the 2008 SIAM Annual Meeting. On the CS and E side, both a full CS and E track was organized, and also a meeting theme of Numerical Linear Algebra and Tensor methods. On the Discrete and CISE side, a special theme of Networks: Biological, Social and Internet was organized. In 2009, Lenore Cowen has agreed to organize a track at the SIAM Annual meeting through the Discrete Math activity group. The Discrete Math activity group runs its own biannual conference, plus it and ACM SIGACT co-run SODA (The Discrete Algorithms conference) every year. The goal of this proposal is to get participant communities that normally attend the SIAM Discrete Math and the ACM-SIAM SODA conferences to come attend the annual meeting in minisymposium sessions design to promote interaction in topics in mutual interest. Our plan for this is threefold: 1) To have Bruce Hendrickson on the CS and E side run a minisymposium on Combinatorial Scientific Computing, and also to have someone on the CS and E side run a minisymposium on tensors and data mining (possibly Tammy Kolda). 2) To have a repeat of the Networks: Biological, Social and Internet theme for several minisymposia to bring in the CISE people and 3) To bring in some of the core Discrete Math and Optimization people by co-locating a banquet, separate from the SIAM annual meeting, in honor of Danny Kleitman?s 75th birthday. The result will hopefully be a truly interdisciplinary meeting. We ask for $20,000 to help support registration, travel and housing fees for minisymposium speakers; this will be spread among 28-32 minisymposium speakers, with preference for funds going to those coming from further away and/or who do not have other sources of grant money for travel. We ask for an additional $15,000 for travel grants for graduate student attendance, and every effort will be made to reach out and broaden participation to a diverse group of graduate students. No money is requested for the non-SIAM activities at the meeting, i.e. the banquet in honor of Danny Kleitman?s birthday. Participants will cover the cost of the banquet on their own.