发布求助
文献互助 智能选刊 最新文献

SIGSAM Bull.最新文献

筛选
英文 中文
QEPCAD B: a program for computing with semi-algebraic sets using CADs QEPCAD B:一个用cad计算半代数集的程序
SIGSAM Bull. Pub Date : 2003-12-01 DOI: 10.1145/968708.968710
Christopher W. Brown
{"title":"QEPCAD B: a program for computing with semi-algebraic sets using CADs","authors":"Christopher W. Brown","doi":"10.1145/968708.968710","DOIUrl":"https://doi.org/10.1145/968708.968710","url":null,"abstract":"This report introduces QEPCAD, B, a program for computing with real algebraic sets using cylindrical algebraic decomposition (CAD). QEPCAD B both extends and improves upon the QEPCAD system for quantifier elimination by partial cylindrical algebraic decomposition written by Hoon Hong in the early 1990s. This paper briefly discusses some of the improvements in the implementation of CAD and quantifier elimination via CAD, and provides somewhat more detail on extensions to the system that go beyond quantifier elimination. The author is responsible for most of the extended features of QEPCAD B, but improvements to the basic CAD implementation and to the SACLIB library on which QEPCAD is based are the results of many people's work, including: George E. Collins, Mark J. Encarnación, Hoon Hong, Jeremy Johnson, Werner Krandick, Richard Liska, Scott McCallum, Nicolas Robidoux, and Stanly Steinberg. Source code, documentation and installation instructions for QEPCAD B are all available at www.cs.usna.edu/~qepcad.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114798123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 321
Memory cache and lisp: faster list processing via automatically rearranging memory 内存缓存和lisp:通过自动重新排列内存来更快地处理列表
SIGSAM Bull. Pub Date : 2003-12-01 DOI: 10.1145/968708.968711
R. Fateman
{"title":"Memory cache and lisp: faster list processing via automatically rearranging memory","authors":"R. Fateman","doi":"10.1145/968708.968711","DOIUrl":"https://doi.org/10.1145/968708.968711","url":null,"abstract":"The speed of modern computers can be increased by organizing computations so that memory access patterns correspond more closely to the memory cache-loading patterns implemented in the hardware. Rearranging code and data are each possible. Here we concentrate on automatic rearrangement of data, and examine the belief, common in some technical circles, that modern generational copying garbage collectors (GC) will improve data caching by relocating and compressing data, as a matter of normal processing. Since GC routines tend to be very well-tested and quite robust, if this belief can be confirmed by benchmarks, a GC could be a \"free\" way of reliably speeding up programs in practice.In fact, our tests show this speedup phenomenon can be measured in some but not all sample Lisp programs. A novelty in our tests (at least when this paper was written) was using a full Lisp system linked to free software (PAPI) to access hardware machine registers. PAPI allows us to count cache misses during full-speed computation. We conclude that after a GC cache misses may be significantly reduced in some examples. Reorganization by GC speeds up computation by as much by a factor of 4, but in some cases the effect is negligible (or may even slow computation slightly). In any case, no extra effort is required of the programmer or user to take advantage of the potential speedup.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128118140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Review of D-Branes by Clifford V. Johnson. Cambridge University Press 2002. 克利福德·v·约翰逊对D-Branes的评论。剑桥大学出版社，2002年。
SIGSAM Bull. Pub Date : 2003-12-01 DOI: 10.1145/968708.968715
A. Buchel
{"title":"Review of D-Branes by Clifford V. Johnson. Cambridge University Press 2002.","authors":"A. Buchel","doi":"10.1145/968708.968715","DOIUrl":"https://doi.org/10.1145/968708.968715","url":null,"abstract":"String theory provides a precise mathematical structure to address questions in the low energy gravity, black hole physics, and realizes a fruitful and promising tool for construction of phenomenologically realistic models of elementary particle physics. It is a leading candidate for the consistent unification of gravitation and quantum mechanics. A tremendous progress in string theory in the last couple years lead to new insights into the nonperturbative dynamics of strongly coupled gauge theories, and enriched our cosmological model building toolkit.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"353 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120876926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computational algebra and algebraic curves 计算代数与代数曲线
SIGSAM Bull. Pub Date : 2003-12-01 DOI: 10.1145/968708.968713
T. Shaska
{"title":"Computational algebra and algebraic curves","authors":"T. Shaska","doi":"10.1145/968708.968713","DOIUrl":"https://doi.org/10.1145/968708.968713","url":null,"abstract":"The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be approached from a computational viewpoint.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129718763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Polynomial solutions for first order ODEs with constant coefficients 常系数一阶ode的多项式解
SIGSAM Bull. Pub Date : 2003-09-01 DOI: 10.1145/990353.990360
Ruyong Feng, X. Gao
{"title":"Polynomial solutions for first order ODEs with constant coefficients","authors":"Ruyong Feng, X. Gao","doi":"10.1145/990353.990360","DOIUrl":"https://doi.org/10.1145/990353.990360","url":null,"abstract":"Most work on finding elementary function solutions for differential equations focussed on linear equations [4, 2, 6, 1, 3]. In this paper, we try to find polynomial solutions to non-linear differential equations. Instead of finding arbitrary polynomial solutions, we will find the polynomial general solutions. For example, the general solution for (d<i>y</i>/d<i>x</i>)<sup>2</sup> - 4<i>y</i> = 0 is <i>y</i> = (<i>x + c</i>)<sup>2</sup>, where <i>c</i> is an arbitrary constant. We give a necessary and sufficient condition for an ODE with constant coefficients to have polynomial general solutions. For a first order ODE of degree <i>n</i> and with constant coefficients, we give an algorithm of complexity <i>O</i>(<i>n</i><sup>9</sup>) to decide if it has a polynomial general solution and to compute the solution if it exists.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117001173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Sister Celine type algorithm for definite summation and integration 一个赛琳姐妹式的定求和和积分算法
SIGSAM Bull. Pub Date : 2003-09-01 DOI: 10.1145/990353.990369
B. Zimmermann
{"title":"A Sister Celine type algorithm for definite summation and integration","authors":"B. Zimmermann","doi":"10.1145/990353.990369","DOIUrl":"https://doi.org/10.1145/990353.990369","url":null,"abstract":"Sister Celine's method [2] computes a recurrence for a sum or multisum Σ<sup>∞</sup><inf><i>k</i> = 0 <i>f</i>(<i>n, k</i>)</inf> where <i>f</i>(<i>n, k</i>) is a given hypergeometric term. It was generalized to the <i>q</i>-hypergeometric case and to integrals [3].","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129269923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
LU based algorithms for characteristic polynomial over a finite field 有限域上基于LU的特征多项式算法
SIGSAM Bull. Pub Date : 2003-09-01 DOI: 10.1145/990353.990367
Clément Pernet, Z. Wan
{"title":"LU based algorithms for characteristic polynomial over a finite field","authors":"Clément Pernet, Z. Wan","doi":"10.1145/990353.990367","DOIUrl":"https://doi.org/10.1145/990353.990367","url":null,"abstract":"Linear algebra computation over finite fields is important because many symbolic computation problems directly or indirectly rely on linear algebra using efficient finite fields representation.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"13 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132272116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
On optimization problems 关于优化问题
SIGSAM Bull. Pub Date : 2003-09-01 DOI: 10.1145/990353.990368
Tianjiao Wu
{"title":"On optimization problems","authors":"Tianjiao Wu","doi":"10.1145/990353.990368","DOIUrl":"https://doi.org/10.1145/990353.990368","url":null,"abstract":"Let <b>R</b> = real field, <i>X</i> = (<i>x</i><inf>1</inf>, <i>x</i><inf>2</inf>,......, <i>x<inf>n</inf></i>), <i>D</i> a domain in <b>R</b><sup><i>n</i></sup>(<i>X</i>), <i>f</i>, <i>g<inf>i</inf></i>, <i>h<inf>i</inf></i> in <b>R</b>[X].","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122662692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
International symposium on symbolic and algebraic computation poster abstracts 2003 符号与代数计算国际研讨会海报摘要2003
SIGSAM Bull. Pub Date : 2003-09-01 DOI: 10.1145/1093528.1093529
Olga Caprotti
{"title":"International symposium on symbolic and algebraic computation poster abstracts 2003","authors":"Olga Caprotti","doi":"10.1145/1093528.1093529","DOIUrl":"https://doi.org/10.1145/1093528.1093529","url":null,"abstract":"ISSAC 2003 was held on July 3-6, 2003 at Drexel University in Philadelphia, USA. Below are the abstracts of posters that were accepted and presented at the conference. The best poster award committee, consisting of J. Davenport, D. Jeffrey, M. Monagan, T. Shaska, T. Sturm, N. Takayama, E. Volcheck and members of the poster committee, assigned the prize to B. Jüttler, J. Schicho, and M. Shalaby for their poster C1 Implicitization of Planar Curves. All posters are archived and are available in electronic form from http://www.acm.org/sigs/sigsam/issac/2003.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131390421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximate computation of pseudovarieties 伪变量的近似计算
SIGSAM Bull. Pub Date : 2003-09-01 DOI: 10.1145/990353.990359
Robert M Corless, H. Kai, S. Watt
{"title":"Approximate computation of pseudovarieties","authors":"Robert M Corless, H. Kai, S. Watt","doi":"10.1145/990353.990359","DOIUrl":"https://doi.org/10.1145/990353.990359","url":null,"abstract":"Many other combinatorial properties of the size of the Dixon matrix and the structure of the Dixon polynomial of a given polynomial system are related to the support hull of the polynomial system and their projections along different dimensions. This research is supported in part by NSF grant nos. CCR-0203051, CDA-9503064 and a grant from the Computer Science Research Institute at Sandia National Labs.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116060107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信