This paper provides a description of the programming language Pascal. It has been published to enable those without easy access to the official BSI ‘draft for comment’ to comment on the description.
This paper provides a description of the programming language Pascal. It has been published to enable those without easy access to the official BSI ‘draft for comment’ to comment on the description.
A Workshop in Two Year College Programs in Computer science was held August 11-13, 1975 in Gloucester Point, Virginia. Sponsored by the ACM's Special Interest Group in Computer science Education (SIGCSE), it broug...
详细信息
ISBN:
(纸本)9781450374125
A Workshop in Two Year College Programs in Computer science was held August 11-13, 1975 in Gloucester Point, Virginia. Sponsored by the ACM's Special Interest Group in Computer science Education (SIGCSE), it brought thirteen community and junior college participants together at the Virginia Institute for Marine science (VIMS) to work toward recommendations for a two year program.
In this article, we focus on the communication costs of three symmetric matrix computations: i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) ii) adding the result of the multiplic...
In this article, we focus on the communication costs of three symmetric matrix computations: i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. The symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.
This book constitutes the proceedings of the 4th International Conference on Social Informatics, SocInfo 2012, held in Lausanne, Switzerland, in December 2012. The 21 full papers, 18 short papers included in this vol...
详细信息
ISBN:
(数字)9783642353864
ISBN:
(纸本)9783642353857
This book constitutes the proceedings of the 4th International Conference on Social Informatics, SocInfo 2012, held in Lausanne, Switzerland, in December 2012.
The 21 full papers, 18 short papers included in this volume were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections named: social choice mechanisms in the e-society,computational models of social phenomena, social simulation, web mining and its social interpretations, algorithms and protocols inspired by human societies, socio-economic systems and applications, trust, privacy, risk and security in social contexts.
暂无评论