Scientific papers

General information

There are two distinct collections of papers, corresponding to two periods in my career. The papers on physics have been written during my time as a PHD student in theoretical physics, at Eindhoven University of Technology, from april 1980 to july 1984. Of these papers only hard copies are available (if at all). Contact me if you are interested. The papers on computer science date from my employment as a university teacher (assistant professor) at the computer science department, also at Eindhoven University of Technology, from august 1984 to march 1997.

Papers on Physics

  1. R.M.C. Ahn, J.P.H.W. van den Eijnde, C.J. Reuver, B.J. Verhaar and I.F. Silvera, Surface spin relaxation of stabilized atomic hydrogen , Phys. Rev. B 26 (1982) 452-455
  2. R.M.C. Ahn, J.P.H.W. van den Eijnde and B.J. Verhaar, Calculation of nuclear-spin-relaxation rate for spin-polarized atomic hydrogen, Phys. Rev. B 27 (1983) 5424-5432
  3. J.P.H.W. van den Eijnde, C.J. Reuver and B.J. Verhaar, Improvements in the description of the surface spin relaxation of atomic hydrogen, Phys. Rev. B 28 (1983Z) 6309-6315
  4. W.M. de Muynck and J.P.H.W. van den Eijnde, A derivation of local commutativity from macrocausality using a quantum mechanical theory of measurement, Found. Phys. 14 (1984) 111-146
  5. B.J. Verhaar, J.P.H.W. van den Eijnde, M.A.J. Voermans and M.M.J. Schaffrath, Scattering length and effective range in two dimensions; application to adsorbed hydrogen atoms, J. Phys. A 17 (1984) 595-598
  6. B.J. Verhaar, L.P.H. de Goey, E.J.D. Vredenbregt and J.P.H.W. van den Eijnde, Scattering length and effective range for scattering in a plane and higher dimensions, Phys. Lett. A 110 (1985) 371-374
  7. B.J. Verhaar, L.P.H. de Goey, J.P.H.W. van den Eijnde and E.J.D. Vredenbregt, Scattering length and effective range for scattering in a plane and higher dimensions, Phys. Rev. A 32 (1985) 1424-1429

Papers on Computing Science

A JvdE number indicates a personal note, whereas a CSN number refers to a Technical Report in the series Computing Science Notes of the Department of Computing Science, Eindhoven University of Technology (reviewed by two peers). Contact the department secretary for more information or hard copies. Alternatively, you can contact me. For most papers zipped electronic versions are available on this site.

You may click on the ps links to download zipped postscript versions of the corresponding documents. Sorry, no (La)TeX or DVI, I don't like TeX. All source zip files contain a single postscript file, generated by the ChiWriter word processor (by Horstmann Software Design Corporation (C)). The code was accepted by a Qume QMS PS 810 postscript laser printer, but since it is supposed to be standard postscript it should print on any postscript printer (sometimes the header should be changed, ask you local guru). A flexible alternative, printing to any modern printer on most platforms, would be to use Ghostview (GSView). With that shareware application you can view the documents on screen and print to any printer you have installed.

If you happen to be a ChiWriter fan like I used to be, you may download the original ChiWriter documents for viewing or printing by clicking the Chi links. For most documents you will need to install my extended font sets for ChiWriter version 3 or version 4, in order to see the extra math symbols I defined. Note that there exists a ChiWriter to TeX converter.

  1. A calculational approach to graph problems, JvdE 88/8, December 1988, 8 pages: Presentation of a general methodology for solving problems on directed graphs, using fixed point theory and some novel programming constructs. (ps - Chi)
  2. Left bottom and right top segments, JvdE 90/6, February 1990, 24 pages. Preprint of a paper in Sci. Comp. Prog. 15 (1990) 79-94 ((C) Elsevier Science Publishers b.v.): A class of segment programming problems is formulated and solved, using a few simple preprocessed functions. (ps - Chi)
  3. The set of reachables computed as a generalized fixed point , JvdE 90/3, May 1990, 17 pages: Derivation of the solution for the reachable vertices problem in a directed graph, using abstraction, set calculus, a generalized fixed point theorem, and implementation techniques. (ps - Chi)
  4. Cyclicity of a directed graph, JvdE 90/5, May 1990, 17 pages: Derivation of an algorithm that decides whether a given graph is cyclic; for reasons of efficiency the specification using paths is transformed into a fixed point characterization using the successor function, and then the algorithm is derived using set and weakest precondition calculus. (ps - Chi)
  5. Set algorithmic language, JvdE 91/9, May 1991, 27 pages: An introduction to an abstract programming language and methodology for solving set and graph problems; among the topics treated are types, set and function calculus, primitive and structured statements with weakest precondition characterization and invariance theorems for design purposes. (ps - Chi)
  6. Algorithms on acyclic graphs, JvdE 91/14, November 1991, 20 pages: Derivation of an algorithm for a general class of problems, concerning the calculation of functions on the nodes of directed, acyclic graphs, using fixed point theory. (ps - Chi)
  7. Program derivation in acyclic graphs and related problems, CSN 92/04, JvdE 92/21, July 1992, 82 pages: Solving recursive equations using acyclic graphs and function calculus; in the development of the theory several interesting graph problems turn up and are solved elegantly, like cyclicity testing, graph inversion and topological sorting. (ps - Chi)
  8. Conservative fixpoint functions on a graph , CSN 92/05, JvdE 92/15, April 1992, 27 pages. Later appeared in: R.S. Bird, C.C. Morgan and J.C.P. Woodcock eds., Mathematics of Program Construction, 2nd International Conference, June/July 1992, vol. 669 LNCS, 80-100, Springer Verlag, 1993: Derivation of a solution for a class of problems on a directed graph, including the 'capacity problem', using fixed point theory, (lifted) partial functions and theorems about new programming constructs. (ps - Chi)
  9. Roland C. Backhouse, J.P.H.W. van den Eijnde, and A.J.M. van Gasteren, Calculating path algorithms, Sci. Comp. Prog. 22 (1994) 3-19: An elegant derivation of a class of programming problems, including the capacity problem, using regular algebra and matrix calculus. (dvi: DVI-file!)
  10. Calculation with induction using sets, JvdE 94/22, 26 pages: Presentation of point-free theorems about well-foundedness and mathematical induction, in terms of ordinary set calculus. (ps - Chi)
  11. A ring of subtracters, in E.H.L. Aarts et al.: Simplex Sigillum Veri, TUE, 1995, 117-122

Papers on e-learning

The scientific products below were realized during my affiliation with the Open University of the Netherlands at Heerlen.
  1. Joop van den Eijnde et al., De werking van computersystemen, part 1-4, text book for distance learning, course T., Open University of the Netherlands, Heerlen, August 1999
  2. Joop van den Eijnde and Koos Baas, Elektronische cursusboeken, zinvol of zinloos?, TW Bulletin of the Open University of the Netherlands, Heerlen, Edition Summer 1999
  3. Joop van den Eijnde, ECB handleiding, electronic book at, Open University of the Netherlands, Heerlen, July 2000
  4. Joop van den Eijnde, 5 lectures on e-learning (2.2 MB), Open University of the Netherlands, 1998-2001
  5. Koos Baas, Joop van den Eijnde and Judith Junger, A Practical Model for the Development of Web Based Interactive Courses, Proceedings of the 31st ASEE/IEEE Frontiers in Education Conference, Reno October 10-13, 2001, paper T2F

Last updated May 31st, 2006
Back to Professional home page
Back to Joop's home page in English.
Terug naar Joop's home page in het Nederlands