Peter J. Denning
Pages 553-554
The interface between a person and a computer can be looked at from either side. Programmers tend to view it from the inside; they consider it their job to defend the machine against errors made by its users. From the outside …
Barry Dwyer
Pages 556-561
Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program …
Tim Teitelbaum, Thomas Reps
Pages 563-573
Applications often require fitting straight lines to data that is input incrementally. The case where a data range [
&agr;k,
&ohgr;k] is received at each
tk,
t1 <
t2 < …
tn, is considered. An algorithm is presented that finds all the straight …
Joseph O'Rourke
Pages 574-578
A theoretical description of the access times required in open addressing and external chaining is given. Values are calculated for different record and bucket sizes and load factors, and the corresponding values for the two
…
P. Quittner, S. Csóka, S. Halász, D. Kotsis, K. Várnai
Pages 579-583
Shamir's scheme for sharing secrets is closely related to Reed-Solomon coding schemes. Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method.
R. J. McEliece, D. V. Sarwate
Pages 583-584
Several errors are noted in the formulation of econometric models describing computer price/performance patterns. An alternative model is presented which shows the effects of technological advances and computer size on price
…
Jane Fedorowicz
Pages 585-586
A computer program is described that acquires much of its knowledge from conversations among operators on Morse code radio networks. The system consists of a learning component and a language understander. The learning component …
Gail E. Kaiser
Pages 587-593
An abstract model of a processor is presented informally. The model can be used by itself to abstractly describe algorithms, or with a direct implementation to write and run programs, or as the foundation of a programming language …
Christopher E. Rothe
Pages 594-596
Flow expressions have been proposed as an extension of the regular expressions designed to model concurrency. We examine a simplification of these flow expressions which we call
shuffle expressions. We introduce two types of
…
Jay Gischer
Pages 597-605
J. C. Winterton
Page 606
E. G. Cale
Pages 606-607
G. K. Gupta
Pages 607-608
Michael R. Dunlavey, Lance A. Miller
Pages 608-609
James L. Patterson
Page 609
Robert L. Ashenhurst
Pages 618-623
