Displaying similar documents to “Symbol Declarations in Mathematical Writing”

A new interpretor for PARI/GP

Bill Allombert (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

When Henri Cohen and his coworkers set out to write PARI twenty years ago, GP was an afterthought. While GP has become the most commonly used interface to the PARI library by a large margin, both the gp interpretor and the GP language are primitive in design. Paradoxically, while gp allows to handle very high-level objects, GP itself is a low-level language coming straight from the seventies. We rewrote GP as a compiler/evaluator pair, implementing several high-level features...

Towards Reverse Engineering of PDF Documents

Baker, Josef B., Sexton, Alan P., Sorge, Volker

Similarity:

We present a progress report on our ongoing project of reverse engineering scientific PDF documents. The aim is to obtain mathematical markup that can be used as source for regenerating a document that resembles the original as closely as possible. This source can then be a basis for further document processing. Our current tool uses specialised PDF extraction together with image analysis to produce near perfect input for parsing mathematical formula. Applying a linear grammar and specific...

Towards a Flexible Author Name Disambiguation Framework

Bolikowski, Łukasz, Dendek, Piotr Jan

Similarity:

In this paper we propose a flexible, modular framework for author name disambiguation. Our solution consists of the core which orchestrates the disambiguation process, and replaceable modules performing concrete tasks. The approach is suitable for distributed computing, in particular it maps well to the MapReduce framework. We describe each component in detail and discuss possible alternatives. Finally, we propose procedures for calibration and evaluation of the described system. ...

Real-valued GCS classifier system

Łukasz Cielecki, Olgierd Unold (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

Learning Classifier Systems (LCSs) have gained increasing interest in the genetic and evolutionary computation literature. Many real-world problems are not conveniently expressed using the ternary representation typically used by LCSs and for such problems an interval-based representation is preferable. A new model of LCSs is introduced to classify real-valued data. The approach applies the continous-valued context-free grammar-based system GCS. In order to handle data effectively, the...