I have done a number of paintings over the years which I use in my lecture notes.
Some of my lecture notes have turned into books and I try to have these paintings
either as covers for the books or as insert pages.  The earlier paintings are done in acrylics
and the later ones are done in water based oils.

The Astronautical Years:

This is my Jupiter painting which was done in 1981 for my wife Pauli.

I am using this as the cover for the first volume of my notes on programming for complex models.
The title is "Complex Models On Graph Based Topological Spaces IIA: Basic Algorithms
and Their Implementation in Fortran, C and C++" and I'll be putting it on Lulu soon.
Here, I talk about learning to program in Fortran, C ( to properly introduce pointers) and then C++ to begin a study of class organization.  

This is my Saturn painting which I think was done in 9183 or 1984.

I am using this as the cover for the second volume of my notes on programming for complex models.
The title is "Complex Models On Graph Based Topological Spaces IIB: The Implementation of Neural Codes in MatLab, C and C++".  This book is an
attempt to show students with an interdisciplinary focus how to build implementations of a number of
neural codes.  I begin with standard versions of ODE solving code in both C and C++ and discuss solving Hodgkin - Huxley models.   Then I show how to implement Fast Fourier Transform ideas to make polynomial multiplication more efficient. These codes are just to warm the reader up to the neural code challenge. I implement code for the chain network and lagged network also.
All of this will prepares the reader for the even more sophisticated task of implementing
general graph models of networks.

This is my asteroid painting also done in probably 1984 or so. It shows a supernova burst which highlights an asteroid belt.

This book is the third of a collection of books which try to
train students and others how to program complex models
using first principles.  This one is called "Complex Models On Graph Based Topological Spaces IIC:
Factoring, Graphs and Basic Visualization". Previously, the first volume discussed
Fortran, C and C++ programming and the second volume
implemented a variety of more complicated things culminating
in codes for neural models.  This volume adds visualization
into the mix as learning about client - server event loops and
how they complicated programming really stretches one's
abilities.  It is the first time the reader really begins to think asynchronously! I also start the process of teaching you about dynamic binding
more carefully.  The graphical models lend themselves to this nicely.

This next image is not from a painting of mine. It is a photograph of art performance my son Quinn gave at the coffee house he was working at after he graduated from college. I cut out the outline of the character Schmoo you see from plywood, Quinn painted it and we transported it to the coffee house.  Customers  then worked on art and placed their finished pieces on the wall behind Schmoo. It was a lot of fun!

You can see all of his work at  The Art of Quinn Peterson.

This book is the fourth of a collection of books which try to
train students and others how to program complex models
using first principles.  It is called "Complex Models On Graph Based Topological Spaces IID:\\
Dynamic Programming, Visualization and Complexity Modeling".
Previously, the first volume discussed Fortran, C and C++ programming and the second volume
implemented a variety of more complicated things culminating in codes for neural models.  The third volume started discussing tree and graph code and the beginnings of visualization. This volume adds additional visualization tools into the mix as the reader continues to learn about client - server event loops and how this complicated programming really stretches your abilities.  It is the second time the reader really begins to think asynchronously as I started on that journey in volume three. I also continue start teaching about dynamic binding and the design of code for graphs of computational nodes and edges.  We also explicitly
discuss dynamic programming code with and without visualization components.