Studies in object-oriented programming backbone implementations

This work is a combination of conceptual and hands on based study aimed at laying a foundation for practical Object-Oriented software construction. First it presents a conceptual study of a number of backbone concepts of modern Object-Oriented Programming (OOP) languages. Secondly, it attempts to demonstrate real-life implementations of these concepts using Python Programming Language. This work touches on practical issues on Class and Object Creation, especially on the syntax and creation, and demystifies the subject matter using a simple table of rules. The OOP concept of Inheritance was studied, with focus on the three major types of inheritance. The self-argument, and constructors were studied, with focus on the three constructors - default, parameterized, and non-parameterized constructors. A brief discussion, and pictorial illustration was also made on the disparity between normal mathematical functions and OOP method calls. Further areas of studies are the concept of overriding between the parent and child class, as well as the OOP puzzle commonly known as Diamond Problem, including code segment and diagrammatic illustration of Python-based solutions. There are a number of other back-bone concepts in OOP not covered in this study, such as Encapsulation, Abstraction, Meta-Programming, among others, which will form areas of focus in future studies. Effort was made to enhance the overall presentation through practical illustrations using source codes, annotated diagrams, and discussions. It is hoped that this work will be very useful to researchers and other practitioners in Object Oriented implementations.

FAST ROBUST ARITHMETICS FOR GEOMETRIC ALGORITHMS AND APPLICATIONS TO GIS

Geometric predicates are used in many GIS algorithms, such as the construction of Delaunay Triangulations for Triangulated Irregular Networks (TIN) or geospatial predicates. With floating-point arithmetic, these computations can incur roundoff errors that may lead to incorrect results and inconsistencies, causing computations to fail. This issue has been addressed using a combination of exact arithmetics for robustness and floating-point filters to mitigate the computational cost of exact computations. The implementation of exact computations and floating-point filters can be a difficult task, and code generation tools have been proposed to address this. We present a new C++ meta-programming framework for the generation of fast, robust predicates for arbitrary geometric predicates based on polynomial expressions. We show examples of how this approach produces correct results for GIS data sets that could lead to incorrect predicate results for naive implementations. We also show benchmark results that demonstrate that our implementation can compete with state-of-the-art solutions.

Profane Illuminations: Robert Anton Wilson’s Hedonic Ascesis

The writer Robert Anton Wilson (1932–2007) played a significant intellectual role in the American counterculture in the late 1970s, 1980s, and 1990s. Drawing from a wide range of discourses, as well as his own occultural fictions and personal experiments in “hedonic engineering,” Wilson presented a pluralistic view of reality that combined a pragmatic skepticism with a creative and esoteric embrace of the “meta-programming” possibilities of altered states of consciousness. In his 1975 Illuminatus! trilogy, written with Robert Shea, Wilson wove anarchist, psychedelic, and occult themes into a prophetic conspiracy fiction written with a satiric and willfully pulp sensibility. Ritually experimenting with psychedelic drugs and sexual magic – experiences related in his 1977 book Cosmic Trigger – Wilson developed a wayward if deeply self-reflexive theory and dialectical method of visionary practice, one that, amidst the paranoia, presented its own deconstructive and libertarian vision of gnosis. This essay contextualizes and unpacks Wilson’s visionary pragmatism in terms of Foucault’s roughly contemporaneous notion of “technologies of self,” later elaborated by Peter Sloterdijk as “anthropotechnics.” It also traces the specific debts that Wilson owed to other esoteric and psychedelic technologists of the self, including Aleister Crowley, Timothy Leary, and John Lilly.

Variational Quantum Chemistry Programs in JaqalPaq

We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at Sandia National Laboratories. Our exemplars use the variational quantum eigensolver (VQE) quantum algorithm to compute the ground state energies of the H2, HeH+, and LiH molecules. Since the exemplars focus on how to program in JaqalPaq, the calculations of the second-quantized Hamiltonians are performed with the PySCF python package, and the mappings of the fermions to qubits are obtained from the OpenFermion python package. Using the emulator functionality of JaqalPaq, we emulate how these exemplars would be executed on an error-free QSCOUT platform and compare the emulated computation of the bond-dissociation curves for these molecules with their exact forms within the relevant basis.

TNL: NUMERICAL LIBRARY FOR MODERN PARALLEL ARCHITECTURES

We present Template Numerical Library (TNL, www.tnl-project.org) with native support of modern parallel architectures like multi–core CPUs and GPUs. The library offers an abstract layer for accessing these architectures via unified interface tailored for easy and fast development of high-performance algorithms and numerical solvers. The library is written in C++ and it benefits from template meta–programming techniques. In this paper, we present the most important data structures and algorithms in TNL together with scalability on multi–core CPUs and speed–up on GPUs supporting CUDA.