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

Long Integers and Polynomial Evaluation with Estrin's Scheme 用Estrin格式求长整数和多项式

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.17

Marco Bodrato, A. Zanoni

{"title":"Long Integers and Polynomial Evaluation with Estrin's Scheme","authors":"Marco Bodrato, A. Zanoni","doi":"10.1109/SYNASC.2011.17","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.17","url":null,"abstract":"In this paper the problem of univariate polynomial evaluation is considered. When both polynomial coefficients and the evaluation \"point\" are integers, unbalanced multiplications (one factor having many more digits than the other one) in classical Ruffini-Horner rule do not let computations completely benefit of sub quadratic methods, like Karatsuba, Toom-Cook and Schonhage-Strassen's. We face this problem by applying an approach originally proposed by Estrin to augment parallelism exploitation in computation. We show that it is also effective in the sequential case, whenever data dimensions grow, e.g. in the long integer case. We add some adjustments to Estrin's proposal obtaining a smoother behavior around corner cases, and to avoid performance degradation when most of the coefficients are zero. This way, a new general algorithm is obtained, improving both theoretical complexity and actual performance. The algorithm itself is very simple, and its use can be usefully extended to evaluation of polynomials on rationals or on polynomials (polynomial composition). Some tests, results and comparisons obtained with PARI/GP are also presented, for both dense and \"sparse\" polynomials.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"12 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":"116928843","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

Computational Tools for Mathematical Collaboration 数学协作的计算工具

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.64

S. Watt

引用次数: 0

Integration of Association Rule Detection with Rule-Based Ontological Support for Product Recommendation 关联规则检测与基于规则的本体支持在产品推荐中的集成

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.50

Anita Hejja, R. Buchmann, A. Szekely

{"title":"Integration of Association Rule Detection with Rule-Based Ontological Support for Product Recommendation","authors":"Anita Hejja, R. Buchmann, A. Szekely","doi":"10.1109/SYNASC.2011.50","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.50","url":null,"abstract":"Recommender systems can increase the sales by suggesting to users additional products, that were selected by their preferences. Availability of efficient mechanisms for generating the adequate products and for capturing the eligible information are the most important challenges of Web users. The Apriori algorithm is the best-known association rules mining algorithm, whose objective is to find all co-occurrence relationships between data items. In order to obtain a well defined information in an open standard format, we propose, an ontology-based recommender system, which describes the item features in terms of semantic concepts. In this paper, a methodology that combines the Apriori algorithm with a domain-specific ontology is proposed. The proposed model transfers the association rules on custom OWLIM rules, and by using OWLIM semantic repositories the detected associations will become public and can be interconnected with other information from the Internet. In this way, new facts can be deduced, therefore new relationships and rules between product items will be generated.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"11 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":"125410454","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}

引用次数: 2

Proof Techniques for Synthesis of Sorting Algorithms 排序算法综合的证明技术

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.23

I. Dramnesc, T. Jebelean

{"title":"Proof Techniques for Synthesis of Sorting Algorithms","authors":"I. Dramnesc, T. Jebelean","doi":"10.1109/SYNASC.2011.23","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.23","url":null,"abstract":"In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of existence of a sorted tuple is performed inductively and we design, implement, and experiment with different proof techniques: First we use a back-chaining mechanism similar to a Prolog engine for first order logic, in which meta-variables are used for finding the existential witnesses. In order to overcome the search space explosion, we introduce various specific prove-solve methods for the theory of tuples. For instance, the equivalence relation on tuples \"have same elements'' can be treated using a normal form based on multisets -- this leads to a very efficient inference rule for rewriting. When reasoning about sorting, we also have an ordering relation between elements. We extend this to an ordering between an element and a tuple, and even between tuples. Ordering relations create specific problems in Prolog style reasoning, because of transitivity and reflexivity. We demonstrate that ordering can be treated very efficiently by decomposing atomic statements into simpler ones (containing only symbols instead of terms), both for goals (backward reasoning) as well as for assumptions (forward reasoning). This leads to an interesting combination of backward and forward inferences which goes beyond and complements Prolog style reasoning. Finally, we develop a solving mechanism for finding sorted tuples, which performs the proof more efficiently, by combining relatively simple inference rules and small searches with goal directed solving rules. The techniques are implemented in the Theorem a system and are able to produce automatically proofs and algorithms for various problems: Insertion Sort, Insertion, Merge Sort, and Merge. Besides the special proof techniques, this work also gives useful hints about finding appropriate induction principles for tuples, as well as for the construction of appropriate collections of properties of tuples which are necessary for reasoning about sorting.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"16 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":"126439941","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}

引用次数: 14

An Upper Bound on Checking Test Complexity for Almost All Cographs 几乎所有图检验测试复杂度的上界

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.44

O. V. Zubkov, D. Chistikov, A. A. Voronenko

引用次数: 1

Communication Schemes of a Parallel Fluid Solver for Multi-scale Environmental Simulations 多尺度环境模拟中并行流体求解器的通信方案

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.7

J. Frisch, R. Mundani, E. Rank

引用次数: 10

Tracking Method for Reparametrized Geometrical Constraint Systems 重参数化几何约束系统的跟踪方法

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.26

Rémi Imbach, P. Mathis, P. Schreck

引用次数: 10

A Supervised Learning Process to Elicit Fraud Cases in Online Auction Sites 在线拍卖网站欺诈案例的监督学习过程

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.15

Vinicius Almendra, D. Enachescu

引用次数: 12

Symbol Elimination in Program Analysis 程序分析中的符号消除

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.60

Laura Kov´cs

引用次数: 0

Enhancing Objects' Autonomy through the Classification of Objects' Interactions 通过对象交互的分类增强对象的自主性

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.38

C. Sandru

引用次数: 0