2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

On Ladder Operators for Little q-Jacobi Polynomials and Their Generalizations 小q-Jacobi多项式的阶梯算子及其推广

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.20

G. Filipuk, Maciej Haneczok

引用次数: 0

Algebraic Properties of Generalized Multisets 广义多集的代数性质

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.55

A. Alexandru, Gabriel Ciobanu

引用次数: 8

Evaluating Moldability of LHCb Jobs for Multicore Job Submission 多核作业提交LHCb作业的可塑性评价

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.74

N. Rauschmayr, A. Streit

引用次数: 3

Specifying Languages and Verifying Programs with K 使用K指定语言和验证程序

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.81

Grigore Roşu

引用次数: 4

Computing Origami Universal Molecules with Cyclic Tournament Forests 用循环锦标赛森林计算折纸通用分子

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.13

J. Bowers, I. Streinu

引用次数: 4

Algorithmic Experiences in Coxeter Spectral Study of P-critical Edge-Bipartite Graphs and Posets p临界边二部图和偶集Coxeter谱研究的算法经验

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.56

A. Polak, D. Simson

{"title":"Algorithmic Experiences in Coxeter Spectral Study of P-critical Edge-Bipartite Graphs and Posets","authors":"A. Polak, D. Simson","doi":"10.1109/SYNASC.2013.56","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.56","url":null,"abstract":"We study P-critical edge-bipartite graphs (bigraphs for short) Δ with n ≥ 2 vertices, by means of the nonsymmetric Gram matrix ǦΔ ∈ Mn(Z), the Coxeter matrix CoxΔ := -ǦΔ · ǦΔ-tr ∈ Mn(Z), its Coxeter polynomial coxΔ(t) = det(t · E + ǦΔ · ǦΔ-tr), and its Coxeter spectrum sρeccΔ. We recall that Δ is positive if the symmetric matrix ǦΔ := ǦΔ + ǦΔtr is positive definite; and Δ is P-critical if it is not positive and each of its proper full subbigraphs is positive. It is easy to see that if two bigraphs Δ, Δ' are Z-bilinear equivalent Δ ≈Z Δ' (i.e., there exists a matrix B ∈ Gl(n, Z) such that ǦΔ = Btr · ǦΔ' · B) then their Coxeter spectra speccΔ and speccΔ' coincide; but the converse implication does not hold in general. One of the main questions of the Coxeter spectral analysis of connected P-critical bigraphs Δ, Δ' is whether the congruence Δ ≈Z Δ' holds if and only if speccΔ = speccΔ'. In this note we discuss the problem in case when n ≤ 10 and Δ and Δ' are P-critical looρ-free bigraphs such that their Euclidean types DΔ, DΔ' ∈ {An, n > 1, D̃m, m ≥ 4, Ẽ6,Ẽ7, Ẽ8} coincide. In particular, we get an affirmative answer to the stated question, for a large class of P-critical bigraphs and Tits P-critical finite posets. By applying symbolic and numerical algorithms in Maple and C# we compute the set of Coxeter polynomials coxΔ(t) for P-critical loop-free bigraphs Δ, with at most 10 vertices.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128079569","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}

引用次数: 5

Optimization and Parallelization of Emedge3D on Shared Memory Architecture Emedge3D在共享内存架构上的优化与并行化

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.72

M. Kuhn, G. Latu, S. Genaud, N. Crouseilles

引用次数: 2

An Extension of the Interpreter Pattern to Define Domain-Parametric Rewriting Systems 定义域参数重写系统的解释器模式的扩展

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.32

L. Capra, Vincenzo Stile

{"title":"An Extension of the Interpreter Pattern to Define Domain-Parametric Rewriting Systems","authors":"L. Capra, Vincenzo Stile","doi":"10.1109/SYNASC.2013.32","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.32","url":null,"abstract":"The Interpreter design pattern provides an elegant and natural way of implementing systems based on term-rewriting in a OO fashion. The idea is simply associating each term of a language, either terminal or non-terminal, with a corresponding class provided with a suitable simplify() method.Reducing a term to a normal form is thus performed through a series of recursive calls to such a method.The main weakness of this approach is that it does not take into account similarities existing among different domains, thus enforcing programmers to pollute generic and domain-specific rules. The resulting code if often wordy, hard to maintain, non-reusable. In this paper we adapt the Interpreter pattern so that a clean separation between generic (common to different domains) and domain-specific rules is possible. The new pattern significantly helps design even complex rewriting systems. A running example which refers to a generic Logical domain is used throughout the paper. An application to High Level Petri nets analysis is sketched. Without any loss of generality we refer to Java as representative of a large class of languages.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133918859","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

Non-interleaving Operational Semantics for Geographically Replicated Databases 地理复制数据库的非交错操作语义

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.64

Gabriel Ciobanu, Ross Horne

引用次数: 4

On Algebraic Preprocessing of Floating-Point DAEs for Numerical Model Simulation 用于数值模型仿真的浮点DAEs代数预处理研究

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.18

Tateaki Sasaki, Tetsu Yamaguchi

引用次数: 2