2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第7页

Catamorphism Generation and Fusion Using Coq 利用Coq产生变质与聚变

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.32

Simon Robillard

引用次数: 0

Load Scheduling in a Cloud Based Massive Video-Storage Environment 基于云的海量视频存储环境中的负载调度

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.54

K. Bayyapu, Paul F. Fischer

引用次数: 4

Efficient Converting of Large Sparse Matrices to Quadtree Format 大型稀疏矩阵到四叉树格式的有效转换

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.25

I. Šimeček, D. Langr, Jan Trdlicka

引用次数: 1

Performance Evaluation of Fuzzy Automata Using VHDL Simulation 基于VHDL仿真的模糊自动机性能评价

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.34

Daniel Butoianu, Doru Todinca

引用次数: 2

Guiding Random Test Generation for Intra-class Dataflow Coverage 指导类内数据流覆盖的随机测试生成

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.28

Petru Florin Mihancea, Edit Mercedes Mera-Batiz, M. Minea

引用次数: 0

Solving Parametric Sparse Linear Systems by Local Blocking, II 用局部块法求解参数稀疏线性系统，2

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1145/2733693.2733712

Tateaki Sasaki, D. Inaba, F. Kako

引用次数: 1

New Arithmetic Algorithms for Hereditarily Binary Natural Numbers 遗传二进制自然数的新算法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.23

Paul Tarau

引用次数: 3

Enhanced Gradient Descent Algorithms for Complex-Valued Neural Networks 复值神经网络的增强梯度下降算法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.44

Călin-Adrian Popa

引用次数: 5

A Distributed-Memory Parallelization of a Shared-Memory Parallel Ensemble Kalman Filter 共享内存并行集成卡尔曼滤波器的分布式并行化

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.67

M. Rostami, H. M. Bucker, C. Vogt, Ralf Seidler, David Neuhauser, V. Rath

{"title":"A Distributed-Memory Parallelization of a Shared-Memory Parallel Ensemble Kalman Filter","authors":"M. Rostami, H. M. Bucker, C. Vogt, Ralf Seidler, David Neuhauser, V. Rath","doi":"10.1109/SYNASC.2014.67","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.67","url":null,"abstract":"Inverse problems arise in various areas of science and engineering. These problems are not only difficult to solve numerically, but they also require a large amount of computer resources both in time and memory. It is therefore not surprising that inverse problems are often solved using techniques from high-performance computing. We consider the parallelization of an inverse problem in the field of geothermal reservoir engineering. In this particular scientific application, the underlying software package is already parallelized using the shared-memory programming paradigm Open MP. Here, we present an extension of this parallelization to distributed memory enabling a hybrid Open MP/MPI parallelization. The situation is different from the standard way of hybrid parallel programming because the data structures of the Open MP-parallelized code differ from those in the serial implementation. We exploit this transformation of the data structures in our distributed-memory strategy for parallelizing an ensemble Kalman filter, a particular method for the solution of inverse problems. We describe this novel parallelization strategy, introduce a performance model, and present timing results on a compute cluster using nodes with 2 sockets, each equipped with Intel Xeon X5675 Westmere EP processors with 6 cores. All timing results are obtained with a pure MPI parallelization without using any Open MP threads.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122119184","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

On Corank Two Edge-Bipartite Graphs and Simply Extended Euclidean Diagrams 关于Corank两边二部图和简单扩展欧几里得图

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.17

Marcin Gąsiorek, D. Simson, Katarzyna Zając

{"title":"On Corank Two Edge-Bipartite Graphs and Simply Extended Euclidean Diagrams","authors":"Marcin Gąsiorek, D. Simson, Katarzyna Zając","doi":"10.1109/SYNASC.2014.17","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.17","url":null,"abstract":"We continue the Coxeter spectral study of finite connected loop-free edge-bipartite graphs Δ, with m+2 ≥ 3 vertices (a class of signed graphs), started in [SIAM J. Discrete Math., 27(2013), 827-854] by means of the complex Coxeter spectrum speccΔ ⊆ C and presented in our talks given in SYNASC12 and SYNASC13. Here, we study non-negative edge-bipartite graphs of corank two, in the sense that the symmetric Gram matrix GΔ ∈ Mm+2(Z) of Δ is positive semi-definite of rank m ≥ 1. Extending each of the simply laced Euclidean diagrams Am, m ≥ 1, Dm, m ≥ 4, Ẽ6, Ẽ7, Ẽ8 by one vertex, we construct a family of loop-free corank two diagrams Ãm2, D̃m2, Ẽ62, Ẽ72, Ẽ82 (called simply extended Euclidean diagrams) such that they classify all connected corank two loop-free edge-bipartite graphs Δ, with m + 2 ≥ 3 vertices, up to Z-congruence Δ ~z Δ'. Here Δ ~z Δ' means that GΔ', = Btr ·GΔ ·B, for some B ∈ Mm+2(Z) such that det B = ±1. We present algorithms that generate all such edge-bipartite graphs of a given size m + 2 ≥ 3, together with their Coxeter polynomials, and the reduced Coxeter numbers, using symbolic and numeric computer calculations in Python. Moreover, we prove that for any corank two connected loop-free edge-bipartite graph Δ, with m + 2 ≥ 3 vertices, there exists a simply extended Euclidean diagram D such that Δ ~z D.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130178122","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