Some comments on the portability of a large algol program—the implementation of SID on KDF9

1971 ◽  
Vol 1 (4) ◽  
pp. 367-371 ◽  
Author(s):  
F. D. Brown ◽  
Valerie J. Calderbank ◽  
M. D. Poole
Keyword(s):  
Algol Program

scholarly journals University of Kiel Radiocarbon Measurements V

Radiocarbon ◽  
1970 ◽  
Vol 12 (2) ◽  
pp. 526-533 ◽  
Author(s):  
H. Willkomm ◽  
H. Erlenkeuser
Keyword(s):  
Recording System ◽  
Guard Ring ◽  
Data Recording ◽  
Automatic Data ◽  
Ring Counter ◽  
Algol Program ◽  
Proper Operation

Measurements reported in this paper were obtained with the 4.5 L and 3 L CO2 counters, details of which were given earlier (Radiocarbon, v. 11, p. 423). The automatic data recording system built in 1968 (Hänsel, 1968) is now operating for both counting apparatus. For each one the counts of the guard counters ring (A counts), the total counts of the C14 counter (B counts), the coincidences of central and guard ring counter (AB counts), and the anticoincidences (ĀB counts) are tape punched every 100th minute. By an ALGOL program, all counts are checked first for large disturbances. Secondly, equation B = AB + ĀB must hold (as an integral check for proper operation of logical circuitry and the data recording system) and finally statistical compatibility is examined before age and other data for the actual counting apparatus are computed. This detailed check of counting rates by computer has proved to be very efficient to yield reliable long-term measurements.

scholarly journals British Museum Natural Radiocarbon Measurements VII

Radiocarbon ◽  
1971 ◽  
Vol 13 (2) ◽  
pp. 157-188 ◽  
Author(s):  
Harold Barker ◽  
Richard Burleigh ◽  
Nigel Meeks
Keyword(s):  
Mass Spectrometer ◽  
Liquid Scintillation ◽  
Isotopic Fractionation ◽  
British Museum ◽  
Sample Weight ◽  
Experimental Procedure ◽  
King's College ◽  
Algol Program

Dates listed below are based on measurements made from June 1968 to May 1970 by the liquid scintillation technique using benzene. In general, the experimental procedure is as described previously (Barker, Burleigh, and Meeks, 1969a) with a few changes in detail. Data are now processed by computer using a comprehensive Algol program written by Andrew Barker, King's College, Univ. of London. There is no need to standardize on any particular sample weight and, as the benzene synthesizer can also deal with samples in the range up to the equivalent of 9 gm of carbon in a single synthesis, the amount of sample available is now less critical. However, for older material, a minimum of 1 gm of carbon is required. Another factor contributing to efficiency of operation is the “bomb” technique for sample combustion (Barker, Burleigh, and Meeks, 1969b), also mentioned in the previous date list. Finally, during 1969, an MS20 double collection mass spectrometer was acquired and all dates (but not all those in this list) are now corrected for isotopic fractionation.

Experiments with the Graph Traverser program

1966 ◽  
Vol 294 (1437) ◽  
pp. 235-259 ◽  
Keyword(s):  
Algebraic Manipulation ◽  
The Other ◽  
Simple Problem ◽  
Evaluation Function ◽  
Automatic Method ◽  
Goal State ◽  
Evaluation Functions ◽  
A Value ◽  
Algol Program ◽  
Intermediate States

An automatic method is described for the solution of a certain family of problems. To belong to this family a problem must be expressible in the language of graph theory as that of finding a path between two specified nodes of a specified graph. The method depends upon the evaluation of intermediate states of the problem according to the extent to which they have features in common with the goal state. We define evaluation functions each of which assigns to any state of the problem a value which is in some way related to its ‘distance’ from the goal state. Equivalently we assign to nodes of the corresponding graph values which are related to the distance over the graph from the goal node. Distance is reckoned as the smallest number of arcs needed to connect two nodes. An Algol program, the Graph Traverser, has been written to operate in this context. It is designed in a completely general way, and has two ‘empty’ procedures one of which must be written to specify the structure of the graph, that is the constraints of the problem, and the other to define an evaluation function. Results obtained by supplying the program with definitions of various sliding block puzzles and also a simple problem of algebraic manipulation are reported for a range of evaluation functions.

Sign in / Sign up

Export Citation Format

Share Document