Showing papers in "Information Processing Letters in 1972"

TL;DR: P can be chosen to I&E the centroid oC the triangle formed by X, y and z and Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P.

TL;DR: A comparison was made of the performance in an automatic information retrieval environment of user queries and document abstracts available in natural language form in both English and French to indicate that the automatic indexing and retrieval techniques used appear equally effective in handling the query and document texts in both languages.

TL;DR: This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.

TL;DR: In this article, individual horizons of a number of profiles were sampled for micromorphological study and no clay films were observed in thin sections representing the B-horizons free in carbonate.

TL;DR: Three new algorithms for traversing trees without the use of a stack are described: the first requires the same amount of memory, the address fields and tag bit that represent the tree, and three storage cells, and the last two can be used on a tree that is stored in a read-only memory.

TL;DR: The only objective of the note is to describe the parallel yrocessing of processes in the LTM network that are both quite efficient in terms of progrzlmming effort and appear to be andogous to human behavior.

TL;DR: Careful design of the data structures and the hardware interface permit the mini-computer to generate each scan line as needed without having to resort to a brute force solution of generating a bit-image for the whole page for off-line printing.

TL;DR: The syntax has been used as a basis for the study of the draft reports on ALGOL 68 and as a frame for the design of the compiler, and parts of it which are not bounded-context have been rewritten in bounde&context form.

TL;DR: These papers describe only one approach to l language extensiiility ~ Letichevskii adopts a set-theoretic approach to the description of macroextensible languages, while the second gives a description of the PL.0 compile time facility.

TL;DR: A new pseudorandom number generator is presented that uses additive operations in mod ii arithmetics only and preserves its good properties for all reasonable choices of the vah 2s of rasameters and it is usually faster than multiplicative congruential generators.