首页 > 最新文献

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

英文 中文
A Theory and an Algorithm of Approximate Gröbner Bases 近似Gröbner基的理论与算法
Tateaki Sasaki
In this paper, we treat polynomials with coefficients of floating-point numbers. The conventional concept of ideal breaks down for such polynomials, and we first define a concept of "approximate ideal''. Then, introducing "accuracy-guarding reductions'', we define approximate Groebner bases and give an algorithm for computing the approximate Groebner bases. We prove several theorems showing basic properties of approximate Groebner bases. The algorithm has been implemented, and we explain the approximate Groebner bases concretely by instructive examples.
在本文中,我们处理系数为浮点数的多项式。对于这类多项式,传统的理想概念被打破了,我们首先定义了“近似理想”的概念。然后,引入“精度保护约简”,定义近似Groebner基,并给出近似Groebner基的计算算法。我们证明了几个定理,证明了近似格罗布纳基的基本性质。该算法已实现,并通过实例具体说明了近似格罗布纳基。
{"title":"A Theory and an Algorithm of Approximate Gröbner Bases","authors":"Tateaki Sasaki","doi":"10.1109/SYNASC.2011.12","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.12","url":null,"abstract":"In this paper, we treat polynomials with coefficients of floating-point numbers. The conventional concept of ideal breaks down for such polynomials, and we first define a concept of \"approximate ideal''. Then, introducing \"accuracy-guarding reductions'', we define approximate Groebner bases and give an algorithm for computing the approximate Groebner bases. We prove several theorems showing basic properties of approximate Groebner bases. The algorithm has been implemented, and we explain the approximate Groebner bases concretely by instructive examples.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131872581","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}
引用次数: 9
On the Interpolation Trigonometric Polynomial with an Arbitrary Even Number of Nodes 关于任意偶数节点的插值三角多项式
E. Scheiber
The trigonometric interpolation polynomial with an arbitrary even number of nodes is computed in connection with other well known results.
结合其他已知结果,计算了具有任意偶数节点的三角插值多项式。
{"title":"On the Interpolation Trigonometric Polynomial with an Arbitrary Even Number of Nodes","authors":"E. Scheiber","doi":"10.1109/SYNASC.2011.13","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.13","url":null,"abstract":"The trigonometric interpolation polynomial with an arbitrary even number of nodes is computed in connection with other well known results.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121718440","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 Kahan's Rules for Determining Branch Cuts 论Kahan确定分支切割的规则
F. Chyzak, J. Davenport, C. Koutschan, B. Salvy
In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring problems. The main focus is on the question of determining possible branch cuts. We explore the extent to which the treatment of branch cuts can be rendered (more) algorithmic, by adapting Kahan's rules to the differential equation setting.
在计算机代数中,有不同的方法来接近函数的数学概念,其中一种方法是将它们定义为微分方程的解。我们比较了不同的方法,并讨论了出现的问题。主要焦点是确定可能的分支削减问题。我们通过将Kahan的规则适应于微分方程设置,探索分支切割的处理可以呈现(更多)算法的程度。
{"title":"On Kahan's Rules for Determining Branch Cuts","authors":"F. Chyzak, J. Davenport, C. Koutschan, B. Salvy","doi":"10.1109/SYNASC.2011.51","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.51","url":null,"abstract":"In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring problems. The main focus is on the question of determining possible branch cuts. We explore the extent to which the treatment of branch cuts can be rendered (more) algorithmic, by adapting Kahan's rules to the differential equation setting.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124715307","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
Towards Extracting Semantic Information from Texts 面向文本语义信息提取的研究
Diana Trandabat
This paper presents the general architecture of a system which creates a map of semantic information around a named entity (Person, Organization, etc.). Thus, after the user specifies a named entity, the system searches on the web and returns the first 200 web pages containing the specified entity, applies semantic roles on the returned paragraphs, and extracts a map of related actions involving the searched entity. This map of actions can then be chronologically ordered, thus illustrating the actions a certain entity has performed in a specific time frame (or at least the way it is reflected by the online world).
本文介绍了一个系统的一般架构,该系统围绕命名实体(人、组织等)创建语义信息映射。因此,在用户指定一个命名实体之后,系统在web上搜索并返回包含指定实体的前200个网页,对返回的段落应用语义角色,并提取涉及搜索实体的相关操作的映射。这个行动地图可以按时间顺序排列,从而说明特定实体在特定时间框架内执行的行动(或者至少是在线世界反映的方式)。
{"title":"Towards Extracting Semantic Information from Texts","authors":"Diana Trandabat","doi":"10.1109/SYNASC.2011.47","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.47","url":null,"abstract":"This paper presents the general architecture of a system which creates a map of semantic information around a named entity (Person, Organization, etc.). Thus, after the user specifies a named entity, the system searches on the web and returns the first 200 web pages containing the specified entity, applies semantic roles on the returned paragraphs, and extracts a map of related actions involving the searched entity. This map of actions can then be chronologically ordered, thus illustrating the actions a certain entity has performed in a specific time frame (or at least the way it is reflected by the online world).","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131093793","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
Pattern Detection Model for Monitoring Distributed Systems 分布式系统监控的模式检测模型
Cristian-Mircea Dinu, Florin Pop, V. Cristea
The ever-increasing size, variety and complexity of distributed systems necessitate the development of highly automated and intelligent solutions for monitoring system parameters. In the context of Large Scale Distributed Systems, automatically detecting events and activity patterns will provide self-organization abilities and increase the dependability of these systems. We present in this paper a model for representing a wide variety of patterns in the parallel time series describing the distributed system parameters and states. Based on this model, we outline an application architecture for a system that employs advanced machine learning techniques for detecting and learning patterns in a distributed system with only minimal user input. The application is implemented as an add-on to the highly successful MonALISA monitoring framework for distributed systems. We test and validate the proposed model in real-time using the large amount of monitoring data provided by the MonALISA system. The novelty of this solution consists of the expressiveness of the model and the advanced automated data analysis for pattern learning and recognition in a long-time monitored system.
分布式系统的规模、种类和复杂性不断增加,需要开发高度自动化和智能的系统参数监控解决方案。在大规模分布式系统的环境中,自动检测事件和活动模式将提供自组织能力,并增加这些系统的可靠性。本文提出了一个模型,用于表示描述分布式系统参数和状态的并行时间序列中的各种模式。基于该模型,我们概述了一个系统的应用程序架构,该系统采用先进的机器学习技术来检测和学习分布式系统中的模式,只需最少的用户输入。该应用程序作为非常成功的用于分布式系统的MonALISA监视框架的附加组件实现。我们利用MonALISA系统提供的大量监测数据对所提出的模型进行了实时测试和验证。该解决方案的新颖之处在于模型的可表达性和用于长期监控系统中的模式学习和识别的高级自动数据分析。
{"title":"Pattern Detection Model for Monitoring Distributed Systems","authors":"Cristian-Mircea Dinu, Florin Pop, V. Cristea","doi":"10.1109/SYNASC.2011.22","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.22","url":null,"abstract":"The ever-increasing size, variety and complexity of distributed systems necessitate the development of highly automated and intelligent solutions for monitoring system parameters. In the context of Large Scale Distributed Systems, automatically detecting events and activity patterns will provide self-organization abilities and increase the dependability of these systems. We present in this paper a model for representing a wide variety of patterns in the parallel time series describing the distributed system parameters and states. Based on this model, we outline an application architecture for a system that employs advanced machine learning techniques for detecting and learning patterns in a distributed system with only minimal user input. The application is implemented as an add-on to the highly successful MonALISA monitoring framework for distributed systems. We test and validate the proposed model in real-time using the large amount of monitoring data provided by the MonALISA system. The novelty of this solution consists of the expressiveness of the model and the advanced automated data analysis for pattern learning and recognition in a long-time monitored system.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"657 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116095204","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
Reachability Analysis of Time Basic Petri Nets: A Time Coverage Approach 时间基Petri网的可达性分析:一种时间覆盖方法
C. Bellettini, L. Capra
We introduce a technique for reach ability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. The technique consists of building a symbolic reach ability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly infinite) tree-tree. The graph construction algorithm has been automated by a tool-set, briefly described in the paper together with its main functionality and analysis capability. A running example is used throughout the paper to sketch the symbolic graph construction. A use case describing a small real system - that the running example is an excerpt from - has been employed to benchmark the technique and the tool-set. The main outcome of this test are also presented in the paper. Ongoing work, in the perspective of integrating with a model-checking engine, is shortly discussed.
我们介绍了一种时间-基本(TB) Petri网的可及性分析技术,这是一种用于实时系统的强大形式,其中时间约束表示为间隔,表示可能的过渡触发时间,其边界是标记时间描述的函数。该技术包括建立一个依赖于某种时间覆盖的符号到达能力图,并克服了结核病网络唯一可用的分析仪的局限性,该分析仪反过来基于对(可能无限的)树的有时间限制的检查。图的构造算法已经通过一个工具集实现了自动化,文中简要描述了它的主要功能和分析能力。本文通过一个运行的例子来描述符号图的构造。描述一个小型真实系统的用例(运行的示例是其中的摘录)已经被用来对技术和工具集进行基准测试。本文还介绍了本次试验的主要结果。从与模型检查引擎集成的角度来看,将简要讨论正在进行的工作。
{"title":"Reachability Analysis of Time Basic Petri Nets: A Time Coverage Approach","authors":"C. Bellettini, L. Capra","doi":"10.1109/SYNASC.2011.16","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.16","url":null,"abstract":"We introduce a technique for reach ability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. The technique consists of building a symbolic reach ability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly infinite) tree-tree. The graph construction algorithm has been automated by a tool-set, briefly described in the paper together with its main functionality and analysis capability. A running example is used throughout the paper to sketch the symbolic graph construction. A use case describing a small real system - that the running example is an excerpt from - has been employed to benchmark the technique and the tool-set. The main outcome of this test are also presented in the paper. Ongoing work, in the perspective of integrating with a model-checking engine, is shortly discussed.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120839440","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}
引用次数: 12
期刊
2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1