{"title":"2005年东海岸计算机代数日:海报摘要","authors":"I. Ajwa","doi":"10.1145/1080368.1080372","DOIUrl":null,"url":null,"abstract":"We present a system that allows wireless smartphones to be used for mathematics communication, that is, for the creation and exchange of mathematical formulas, diagrams, and text between two or more participants. The system enables two or more persons with smartphones or traditional computers to participate in a session. Each of the participants may convey textual, graphical and mathematical information to the other participants. Users can draw, edit, and label geometric shapes, send chat messages, and compose formulas. A turn taking mechanism moderates the communication. The system also supports the addition of services that can be used to provide individual users with additional functionality. Currently, a L ATEX rendering service is available to allow users to create and share mathematical formulas in typeset quality. As the use of smartphones becomes more widespread we expect that our system will be used by online communities such as the Math Forum at Drexel University. Students and teachers of all levels use the Math Forum in order to ask questions, solve problems, and pursue interests in mathematics. The service Ask Dr. Mathreceives as many as 9,000 questions a month and over 200 trained volunteers—teachers, professionals in the workplace, college students, and hobbyists—answer close to 4,000 of these directly within a few hours of their submission. Over 7,800 questions and answers have been published in public archives, with another 400,000 questions and 120,000 answers stored for research and future use. Currently the Math Forum receives about 1.7 million visits a month, and approximately 450,000 of those include the Dr. Math area. Some of the challenges of developing a system for mobile communication of high school mathematics are posed by the input and output limitations of the devices and the enormous heterogeneity of the available hardware platforms. We are using the Treo 600 as our hardware platform. Our software is written in pure Java and can potentially be run on any platform that supports the Java Virtual Machine. Our software architecture makes it easy to add new local or remote services to enhance the communication. Using Riemannian SVD for Problems in Approximate Algebra Brad Botting, Mark Giesbrecht, John May University of Waterloo Abstract. Many problems in abstract algebra can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest multivariate polynomial which factors, and finding the nearest polynomial which functionally decomposes, can all be cast as so-called Structured Total Least Squares (STLS) problems. More generally, given a basis of “structure” matrices X1, ...,Xm for a vector spaceV of structured matrices, and a matrix A in V, the STLS problem seeks to find the nearest B to A in V such thatB is singular. Many problems in abstract algebra can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest multivariate polynomial which factors, and finding the nearest polynomial which functionally decomposes, can all be cast as so-called Structured Total Least Squares (STLS) problems. More generally, given a basis of “structure” matrices X1, ...,Xm for a vector spaceV of structured matrices, and a matrix A in V, the STLS problem seeks to find the nearest B to A in V such thatB is singular.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"East coast computer algebra day 2005: poster abstracts\",\"authors\":\"I. Ajwa\",\"doi\":\"10.1145/1080368.1080372\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a system that allows wireless smartphones to be used for mathematics communication, that is, for the creation and exchange of mathematical formulas, diagrams, and text between two or more participants. The system enables two or more persons with smartphones or traditional computers to participate in a session. Each of the participants may convey textual, graphical and mathematical information to the other participants. Users can draw, edit, and label geometric shapes, send chat messages, and compose formulas. A turn taking mechanism moderates the communication. The system also supports the addition of services that can be used to provide individual users with additional functionality. Currently, a L ATEX rendering service is available to allow users to create and share mathematical formulas in typeset quality. As the use of smartphones becomes more widespread we expect that our system will be used by online communities such as the Math Forum at Drexel University. Students and teachers of all levels use the Math Forum in order to ask questions, solve problems, and pursue interests in mathematics. The service Ask Dr. Mathreceives as many as 9,000 questions a month and over 200 trained volunteers—teachers, professionals in the workplace, college students, and hobbyists—answer close to 4,000 of these directly within a few hours of their submission. Over 7,800 questions and answers have been published in public archives, with another 400,000 questions and 120,000 answers stored for research and future use. Currently the Math Forum receives about 1.7 million visits a month, and approximately 450,000 of those include the Dr. Math area. Some of the challenges of developing a system for mobile communication of high school mathematics are posed by the input and output limitations of the devices and the enormous heterogeneity of the available hardware platforms. We are using the Treo 600 as our hardware platform. Our software is written in pure Java and can potentially be run on any platform that supports the Java Virtual Machine. Our software architecture makes it easy to add new local or remote services to enhance the communication. Using Riemannian SVD for Problems in Approximate Algebra Brad Botting, Mark Giesbrecht, John May University of Waterloo Abstract. Many problems in abstract algebra can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest multivariate polynomial which factors, and finding the nearest polynomial which functionally decomposes, can all be cast as so-called Structured Total Least Squares (STLS) problems. More generally, given a basis of “structure” matrices X1, ...,Xm for a vector spaceV of structured matrices, and a matrix A in V, the STLS problem seeks to find the nearest B to A in V such thatB is singular. Many problems in abstract algebra can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest multivariate polynomial which factors, and finding the nearest polynomial which functionally decomposes, can all be cast as so-called Structured Total Least Squares (STLS) problems. More generally, given a basis of “structure” matrices X1, ...,Xm for a vector spaceV of structured matrices, and a matrix A in V, the STLS problem seeks to find the nearest B to A in V such thatB is singular.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1080368.1080372\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1080368.1080372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们提出了一个系统,允许无线智能手机用于数学交流,也就是说,用于创建和交换数学公式,图表,以及两个或更多参与者之间的文本。该系统允许两个或两个以上的人使用智能手机或传统电脑参加会议。每个参与者都可以向其他参与者传达文本、图形和数学信息。用户可以绘制、编辑和标记几何形状,发送聊天消息,以及编写公式。轮流机制缓和了交流。该系统还支持添加服务,可用于为个人用户提供额外的功能。目前,L ATEX渲染服务允许用户创建和共享具有排版质量的数学公式。随着智能手机的使用越来越普遍,我们预计我们的系统将被在线社区使用,比如德雷塞尔大学的数学论坛。各级学生和教师利用数学论坛提出问题,解决问题,追求数学兴趣。“问数学博士”服务每月收到多达9000个问题,200多名训练有素的志愿者——教师、职场专业人士、大学生和业余爱好者——在他们提交的几个小时内直接回答了近4000个问题。超过7800个问题和答案已在公共档案中公布,另有40万个问题和12万个答案被存储以供研究和未来使用。目前,数学论坛每月的访问量约为170万次,其中约有45万次访问包括数学博士区域。开发高中数学移动通信系统的一些挑战是由于设备的输入和输出限制以及可用硬件平台的巨大异质性。我们使用Treo 600作为我们的硬件平台。我们的软件是用纯Java编写的,可以在任何支持Java虚拟机的平台上运行。我们的软件架构可以很容易地添加新的本地或远程服务来增强通信。利用黎曼SVD求解近似代数问题Brad Botting, Mark Giesbrecht, John May抽象代数中的许多问题可以重新表述为结构化线性逼近问题。寻找具有最接近给定相对素数多项式的GCD的多项式,寻找最接近因子的多元多项式,以及寻找最接近函数分解的多项式等问题,都可以被视为所谓的结构化总最小二乘(STLS)问题。更一般地说,给定一组“结构”矩阵X1,…,对于结构化矩阵的向量空间ev,以及矩阵a在V中的Xm, STLS问题寻求在V中找到离a最近的B,使得B是奇异的。抽象代数中的许多问题可以重新表述为结构化线性逼近问题。寻找具有最接近给定相对素数多项式的GCD的多项式,寻找最接近因子的多元多项式,以及寻找最接近函数分解的多项式等问题,都可以被视为所谓的结构化总最小二乘(STLS)问题。更一般地说,给定一组“结构”矩阵X1,…,对于结构化矩阵的向量空间ev,以及矩阵a在V中的Xm, STLS问题寻求在V中找到离a最近的B,使得B是奇异的。
East coast computer algebra day 2005: poster abstracts
We present a system that allows wireless smartphones to be used for mathematics communication, that is, for the creation and exchange of mathematical formulas, diagrams, and text between two or more participants. The system enables two or more persons with smartphones or traditional computers to participate in a session. Each of the participants may convey textual, graphical and mathematical information to the other participants. Users can draw, edit, and label geometric shapes, send chat messages, and compose formulas. A turn taking mechanism moderates the communication. The system also supports the addition of services that can be used to provide individual users with additional functionality. Currently, a L ATEX rendering service is available to allow users to create and share mathematical formulas in typeset quality. As the use of smartphones becomes more widespread we expect that our system will be used by online communities such as the Math Forum at Drexel University. Students and teachers of all levels use the Math Forum in order to ask questions, solve problems, and pursue interests in mathematics. The service Ask Dr. Mathreceives as many as 9,000 questions a month and over 200 trained volunteers—teachers, professionals in the workplace, college students, and hobbyists—answer close to 4,000 of these directly within a few hours of their submission. Over 7,800 questions and answers have been published in public archives, with another 400,000 questions and 120,000 answers stored for research and future use. Currently the Math Forum receives about 1.7 million visits a month, and approximately 450,000 of those include the Dr. Math area. Some of the challenges of developing a system for mobile communication of high school mathematics are posed by the input and output limitations of the devices and the enormous heterogeneity of the available hardware platforms. We are using the Treo 600 as our hardware platform. Our software is written in pure Java and can potentially be run on any platform that supports the Java Virtual Machine. Our software architecture makes it easy to add new local or remote services to enhance the communication. Using Riemannian SVD for Problems in Approximate Algebra Brad Botting, Mark Giesbrecht, John May University of Waterloo Abstract. Many problems in abstract algebra can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest multivariate polynomial which factors, and finding the nearest polynomial which functionally decomposes, can all be cast as so-called Structured Total Least Squares (STLS) problems. More generally, given a basis of “structure” matrices X1, ...,Xm for a vector spaceV of structured matrices, and a matrix A in V, the STLS problem seeks to find the nearest B to A in V such thatB is singular. Many problems in abstract algebra can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest multivariate polynomial which factors, and finding the nearest polynomial which functionally decomposes, can all be cast as so-called Structured Total Least Squares (STLS) problems. More generally, given a basis of “structure” matrices X1, ...,Xm for a vector spaceV of structured matrices, and a matrix A in V, the STLS problem seeks to find the nearest B to A in V such thatB is singular.