Patent GB-1176497-A (GB)
Title: Pneumatic Threshold-Value Switch
Inventor: TOPFER HEINZ
IPC: F15B5/00
Filed: 1967-03-10
Abstract: 1,176,497. Pneumatic threshold device. REGLERWERK DRESDEN, VEB. 10 March, 1967, No. 11321/67. Heading G4P. In accordance with whether a control pressure 21, Fig. 1, exceeds or not exceeds a threshold level set by a spring 5 (or by a supplementary pneumatic signal Fig. 2, not shown) supply pressure 18 is either applied, or not applied, respectively, to an output 19. Whilst the control pressure 21 is below the threshold level supply pressure 18 is communicated to chambers 12 and 13, a piston 10 being in its righthand position sealing 11 a vent to atmosphere, and a double-diaphragm unit 14 is moved leftwards closing the connection between the supply pressure 18 and the output 19 at a seal 16. When, however,. the control pressure 21 exceeds the threshold level, the piston 10 is held away from the seal 11 by a shaft 6, and therefore the pressure in chambers 12 and 13 falls to atmospheric and the double-diaphragm 14 moves back to its position substantially as shown in the drawing.  1,176,532. Table look-up in data processing apparatus. HONEYWELL Inc. 6 Jan., 1967 [20 Jan., 1966], No. 898/67. Heading G4A. In data processing apparatus, table look-up is performed by logically combining the base address of the table with the location within the table of the required item. The main memory of a computer contains instructions and operands, both of a variable number of characters, and being accessed character by character. Each character comprises six data bits, a parity bit and two bits to define the limits of an instruction or operand. An instruction to perform table look-up in the main memory specifies the starting address of an item to be translated, the starting address of the sequence of addresses where the result is to be placed, the base address (two characters) of the table, and (one character) whether the characters of the item to be translated are to be translated one or two at a time and whether each entry in the table is one or two characters in length. The 3-character address register of the main memory receives the base address into its two most significant character positions and, depending on the options specified by the last character of the instruction above, receives one or two characters of the item to be translated into the lowest or two lowest order character positions of the register respectively, these latter character or characters being shifted one bit position to high order or not. When the characters thus inserted into the address register thus overlap, each two overlapping bits are ORed. Larger shifts are mentioned. Provision is made for incrementing or decrementing the address to obtain the next stored character. A control memory is provided to store instruction counts, operand address, and working registers. Other registers and an adder are provided, and it is mentioned that the computer is capable of both binary and decimal arithmetic. Indexed and indirect addressing are mentioned. If an item is untranslatable using the table, the system may branch to another routine (not described), the two instruction counts being interchanged.