subscribe to arXiv mailings

arXiv:2109.08655 ?[ pdf , other ]? cs.IR cs.DL doi 10.1007/9783319620756_9 Semantic Preserving Bijective Mappings of Mathematical Formulae between Document Preparation Systems and Computer Algebra Systems Authors: Howard S. Cohl , Moritz Schubotz , Abdou Youssef , André GreinerPetter , Jürgen Gerhard , Bonita V. Saunders , Marjorie A. ~McClain Abstract : Document preparation systems like LaTeX offer the ability to render mathematical expressions as one would write these on paper. Using LaTeX, LaTeXML, and tools generated for use in the National Institute of Standards (NIST) Digital Library of Mathematical Functions, semantically enhanced mathematical LaTeX markup (semantic LaTeX) is achieved by using a semantic macro set. Computer algebra systems… ▽ More Document preparation systems like LaTeX offer the ability to render mathematical expressions as one would write these on paper. Using LaTeX, LaTeXML, and tools generated for use in the National Institute of Standards (NIST) Digital Library of Mathematical Functions, semantically enhanced mathematical LaTeX markup (semantic LaTeX) is achieved by using a semantic macro set. Computer algebra systems (CAS) such as Maple and Mathematica use alternative markup to represent mathematical expressions. By taking advantage of Youssef's PartofMath tagger and CAS internal representations, we develop algorithms to translate mathematical expressions represented in semantic LaTeX to corresponding CAS representations and vice versa. We have also developed tools for translating the entire Wolfram Encoding Continued Fraction Knowledge and University of Antwerp Continued Fractions for Special Functions datasets, for use in the NIST Digital Repository of Mathematical Formulae. The overall goal of these efforts is to provide semantically enriched standard conforming MathML representations to the public for formulae in digital mathematics libraries. These representations include presentation MathML, content MathML, generic LaTeX, semantic LaTeX, and now CAS representations as well. △ Less Submitted 17 September, 2021; originally announced September 2021. Comments: Proceedings of the 10th International Conference on Intelligent Computer Mathematics (CICM) arXiv:1906.06251 ?[ pdf , other ]? cs.AI cs.LO cs.SC doi 10.1007/9783030412586_15 Effective problem solving using SAT solvers Authors: Curtis Bright , Jürgen Gerhard , Ilias Kotsireas , Vijay Ganesh Abstract : In this article we demonstrate how to solve a variety of problems and puzzles using the builtin SAT solver of the computer algebra system Maple. Once the problems have been encoded into Boolean logic, solutions can be found (or shown to not exist) automatically, without the need to implement any search algorithm. In particular, we describe how to solve the $n$queens problem, how to generate and… ▽ More In this article we demonstrate how to solve a variety of problems and puzzles using the builtin SAT solver of the computer algebra system Maple. Once the problems have been encoded into Boolean logic, solutions can be found (or shown to not exist) automatically, without the need to implement any search algorithm. In particular, we describe how to solve the $n$queens problem, how to generate and solve Sudoku puzzles, how to solve logic puzzles like the Einstein riddle, how to solve the 15puzzle, how to solve the maximum clique problem, and finding GraecoLatin squares. △ Less Submitted 16 September, 2019; v1 submitted 14 June, 2019; originally announced June 2019. Comments: To appear in Proceedings of the Maple Conference 2019 arXiv:1809.00371 ?[ pdf , other ]? cs.CR PostQuantum Secure Cryptographic Algorithms Authors: Xenia Bogomolec , Jochen Gerhard Abstract : An overview on current developments in post quantum cryptography An overview on current developments in post quantum cryptography △ Less Submitted 12 September, 2018; v1 submitted 2 September, 2018; originally announced September 2018. arXiv:1206.0919 ?[ pdf , other ]? hepph cs.DC cs.PF hepth doi 10.1016/j.cpc.2012.09.013 Relativistic Hydrodynamics on Graphic Cards Authors: Jochen Gerhard , Volker Lindenstruth , Marcus Bleicher Abstract : We show how to accelerate relativistic hydrodynamics simulations using graphic cards (graphic processing units, GPUs). These improvements are of highest relevance e.g. to the field of highenergetic nucleusnucleus collisions at RHIC and LHC where (ideal and dissipative) relativistic hydrodynamics is used to calculate the evolution of hot and dense QCD matter. The results reported here are based o… ▽ More We show how to accelerate relativistic hydrodynamics simulations using graphic cards (graphic processing units, GPUs). These improvements are of highest relevance e.g. to the field of highenergetic nucleusnucleus collisions at RHIC and LHC where (ideal and dissipative) relativistic hydrodynamics is used to calculate the evolution of hot and dense QCD matter. The results reported here are based on the Sharp And Smooth Transport Algorithm (SHASTA), which is employed in many hydrodynamical models and hybrid simulation packages, e.g. the Ultrarelativistic Quantum Molecular Dynamics model (UrQMD). We have redesigned the SHASTA using the OpenCL computing framework to work on accelerators like graphic processing units (GPUs) as well as on multicore processors. With the redesign of the algorithm the hydrodynamic calculations have been accelerated by a factor 160 allowing for eventbyevent calculations and better statistics in hybrid calculations. △ Less Submitted 9 September, 2012; v1 submitted 5 June, 2012; originally announced June 2012. Comments: Details and discussions added, replaced with accepted version. (15 pages, 8 figures, 2 listings) .

From：


监测目标主题

(1)

系统抽取对象

机构

(4)

(2)

(2)

(1)

地理

(2)

活动

出版物

(1)

(1)

人物

(2)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

系统抽取主题

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

(1)

