A Mini-History of Computing

This book was produced by George K. Thiruvathukal for the American Institute of Physics to promote interest in the interdisciplinary publication, Computing in Science and Engineering. It accompanied a limited edition set of playing cards that is no longer available (except in PDF). This book features a set of 54 significant computers by era/category, including ancient calculating instruments, pre-electronic mechanical calculators and computers, electronic era computers, and modern computing (minicomputers, maniframes, personal computers, devices, and gaming consoles)

Role and use of nuclear theories and models in practical evaluation of neutron nuclear data needed for fission and fusion reactor design and other nuclear applications

A review of the various nuclear models used in the evaluation of neutron nuclear data for fission and fusion reactors is presented. Computer codes embodying the principles of the relevant nuclear models are compared with each other and with experimental data. The regions of validity and limitations of the conceptual formalisms are also included, along with the effects of the numerical procedures used in the codes themselves. Conclusions and recommendations for future demands are outlined.15 tables, 15 figures, 90 references. (auth

Analysis of A Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards

We discuss an approach for solving sparse or dense banded linear systems ${\bf A} {\bf x} = {\bf b}$ on a Graphics Processing Unit (GPU) card. The matrix ${\bf A} \in {\mathbb{R}}^{N \times N}$ is possibly nonsymmetric and moderately large; i.e., $10000 \leq N \leq 500000$. The ${\it split\ and\ parallelize}$(${\tt SaP}$) approach seeks to partition the matrix${\bf A}$into diagonal sub-blocks${\bf A}_i$,$i=1,\ldots,P$, which are independently factored in parallel. The solution may choose to consider or to ignore the matrices that couple the diagonal sub-blocks${\bf A}_i$. This approach, along with the Krylov subspace-based iterative method that it preconditions, are implemented in a solver called${\tt SaP::GPU}$, which is compared in terms of efficiency with three commonly used sparse direct solvers:${\tt PARDISO}$,${\tt SuperLU}$, and${\tt MUMPS}$.${\tt SaP::GPU}$, which runs entirely on the GPU except several stages involved in preliminary row-column permutations, is robust and compares well in terms of efficiency with the aforementioned direct solvers. In a comparison against Intel's${\tt MKL}$,${\tt SaP::GPU}$also fares well when used to solve dense banded systems that are close to being diagonally dominant.${\tt SaP::GPU}$ is publicly available and distributed as open source under a permissive BSD3 license.Comment: 38 page

History of computers. Reload

11

Student Attitudes Toward a New Application of Instructional Television in a Computer Programming Course

Higher Educatio

NASA Tech Briefs, November/December 1987

Topics include: NASA TU Services; New Product Ideas; Electronic Components and Circuits; Electronic Systems; Physical Sciences; Materials; Computer Programs; Mechanics; Fabrication Technology; Machinery; Mathematics and Information Sciences; Life Sciences

The machine refinement of raw graphic data for translation into a low level data base for computer aided architectural design (CAAD).

It is argued that a significant feature which acts as a disincentive against the adoption of CAAD systems by small private architectural practices, is the awkwardness of communicating with computers when compared with traditional drawing board techniques. This consideration, although not perhaps the dominant feature, may be mitigated by the development of systems in which the onus of communicating is placed on the machine, through the medium of an architect's sketch plan drawing. In reaching this conclusion, a design morphology is suggested, in which the creative generation of building designs is set in the context of the development of a 'data-base' of information which completely and consistently describes the architect's hypothetical building solution. This thesis describes research carried out by the author between 1981 and 1984, and describes the theory, development and application of algorithms to interpret architect's sketch plan drawings, and hence permit the encoding of building geometries for CAAD applications programs