Search

The article analyzes existing and proposed American and foreign standards for one inch perforated paper tape for information interchange. This standard covers the physical dimensions of the paper tape and its perforations. The unpunched tape shall have an overall nominal width of 1,000 inch and shall have a nominal thickness of .004 inch. The tape shall be used for recording up to eight levels of information across the tape. The longitudinal center line of the feed holes shall be parallel with the reference edge of the tape and located .392 inch plus or minus .004 inch from the reference edge. The feed holes in the tape shall be fully punched and round with a diameter of .046 inch plus .002 minus .001 inch. The code holes in the tape shall be fully punched and round with a diameter of .072 inch plus or minus .002 inch. All holes punched in the tape shall nominally center on the true intersection of longitudinal and perpendicular transverse center lines spaced .100 inch apart.

The article presents several research papers relating to algorithms. The paper "Greatest Common Divisor of n Integers and Multipliers" presents an algorithm which calculates the greatest common divisor, IGCD, of n integers. Details of the method and comparisons to other algorithms are also given. The algorithm is a new version of the Euclidean algorithm for n integers. The n-1 calculations of the greatest common divisor of two integers is accomplished by means of a modified version of the Blankinship algorithm. The paper "Exponential Integral Ei (x)" presents the results of one phase of research carried out at the Jet Propulsion Laboratory, California Institute of Technology, under Contract NAS7-100, sponsored by the National Aeronautics and Space Administration. It presents an algorithm which was compiled and executed without any modification on a UNIVAC 1108 computer. An unfortunate precedent has been set in several recent algorithms of using an illegal FORTRAN construction.