bluuebunny/crossref_metadata_2025 huggingface dataset:
A statistical study of the accuracy of floating point number systems
Authors: Kuki H. , Cody W. J.
Published: July 2002

This paper presents the statistical results of tests of the accuracy of certain arithmetic systems in evaluating sums, products and inner products, and analytic error estimates for some of the computations. The arithmetic systems studied are 6-digit hexadecimal and 22-digit binary floating point number representations combined with the usual chop and round modes of arithmetic with various numbers of guard digits, and with a modified round mode with guard digits. In a certain sense, arithmetic systems differing only in their use of binary or hexadecimal number representations are shown to be approximately statistically equivalent in accuracy. Further, the usual round mode with guard digits is shown to be statistically superior in accuracy to the usual chop mode in all cases save one. The modified round mode is found to be superior to the chop mode in all cases.
The Computer Museum member's first field trip
Authors: Bell Gordon
Published: July 2002

The Computer Museum's first considered priority is to save history, the second is to display it, and the third is to interpret its historic role.
Special message from the presidents of ACM and the IEEE Computer Society
Authors: Brandin David H. , Garcia Oscar N.
Published: July 2002

In the changing computer world of multiple opportunities, the greatest difficulty lies in deciding which of the many possible dreams to strive for, what goals to set. The IEEE Computer Society and the Association for Computing Machinery, the two largest and fastest growing professional organizations in the computer field, have come to share more or less independently, a great number of common objectives. The distinction between the two societies is no longer clear. What might once have been a clear separation of interest and programs is now a continuum with most of our activities intertwined.
From Washington
Authors: Steier Rosalie
Published: July 2002

Congress is paying careful attention to threats to U.S. high technology from two areas: trademark and patent infringement and proposed foreign violation of U.S. copyright laws.

Computer technology is becoming a major victim of the nearly $8 billion counterfeit business threatening the American economy. Some recent product examples include fake Apple computers seized by U.S. Customs and reverse engineered Apples and other microcomputers on sale in Hong Kong for $300, about a third of the price of a genuine product. U.S. firms fear losses large enough to hinder research and development efforts. This would result in erosion of their technological edge.
An application of artificial intelligence to operations research
Authors: Marcus Robert
Published: July 2002

An extension of critical path scheduling to a case where there are alternate methods for completing a project is introduced. Three solution methods are presented including one based on the heuristic search algorithm used in artificial intelligence.
Toward friendly user MIS implementation
Authors: DeSanctis Gerardine , Courtney James F.
Published: July 2002

Recent management information systems (MIS) and computer science literature advocates the development of “user-friendly” systems as a means of overcoming implementation problems. However, implementation research suggests that it is not enough that the technology be friendly to the user. The user must also be friendly to the system. In formulating solutions to implementation problems, the field of organization development (OD) may serve as a knowledge base for practitoners and researchers. OD and MIS share common goals, common theoretical foundations, and common problems. Consequently, OD techniques may be useful in alleviating certain behavioral problems encountered in MIS implementation. OD concepts and techniques such as planned organizational change, survey feedback, group diagnostic meetings, communication training, role negotiation, and training labs may be used when implementing or changing systems. The premise is that use of these measures will lead to more successful MIS projects.
Representing super-sparse matrices with perturbed values
Authors: Greenberg Harvey J. , O'Neill Richard P.
Published: July 2002

This paper describes a form of purposeful data perturbation in a linear programming model which pertains to uncertainties in the magnitudes of the matrix coefficients. A problem in value pool construction is described first, then a resolution based on a new concept, “covering lattices.” Computer representations of real values, limited by finite precision, is an example of a covering lattice. After presenting the strategy and tactical variations, the effects of resident distortion are analyzed. Several theorems are presented that measure bias under a variety of assumptions. An appendix is included that contains mathematical proofs.
Comparison of synonym handling and bucket organization methods
Authors: Quittner P. , Csóka S. , Halász S. , Kotsis D. , Várnai K.
Published: July 2002

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 methods are compared. Practical guidelines for determining bucket sizes and load factors are presented. It is proved that open addressing is almost always superior to external chaining and the optimal bucket size is between 1 and 4.
Microcomputers as remote nodes of a distributed system
Authors: Pechura Michael A.
Published: July 2002

A time-sharing system may be extended into a general-purpose distributed computing facility through the use of remote microcomputer systems. In such an extension the microcomputer system is not merely a remote terminal but a complete computer system. It becomes part of an integrated network of computers, each with significant local computational power with access to host system data resources. The implementation described emphasizes ease-of-use by minimizing any differences between local and remote data use.
Comments on program specification and testing
Authors: House Roger
Published: July 2002

The data processing discipline is in a deplorable state, says Roger House. The author reviews an earlier study, in which programmers were largely unsuccessful in finding known errors in a test program. House shows that the fault lies not with the subjects but with the generally poor procedures underlying the writing of much contemporary software, including the test program in question. He analyzes the example, offers several specific critiques, and enumerates good software-writing practices.
An overrelaxation for a numerical inverse of a constant
Authors: Asai Hitohisa
Published: July 2002

When division is performed by a power series implementation with additions, subtractions, digit shifts, and multiplications, the convergence rate of the power series is important in practical application. Particularly if the rate of the power series is close to one, the convergence is slow and therefore a special method to accelerate the convergence is needed. Without such an acceleration, the power series implementation is less attractive. An acceleration method is proposed for the slow convergence rate. First, the worst case convergence rate of the power series is determined for a given appropriate acceleration factor. Next, a simple way to choose the appropriate acceleration factor is presented.
Analysis of locking policies in database management systems
Authors: Potier D. , Leblanc Ph.
Published: July 2002

Consistency control has to be enforced in database management systems (DBMS) where several transactions may concurrently access the database. This control is usually achieved by dividing the database into locking units or granules, and by specifying a locking policy which ensures integrity of the information. However, a drawback of integrity enforcement through locking policies is the degradation of the global system performance. This is mainly due to the restriction imposed by the locking policies to the access of transactions to the database, and to the overheads involved with the management of locks. A framework for the quantitative analysis of the impact of these factors on the performance of DBMS is presented in this paper. In a first step, the main factors which determine the behavior of these systems are pointed out and analyzed independently. The results hereby obtained are aggregated in a second step to yield a global performance evaluation. Throughout this hierarchical modeling approach various analytical techniques are used and the results are illustrated by numerical examples. The paper concludes by pointing out the final results' sensitivity to some basic assumptions concerning transaction behavior and the need for more experimental studies in this area.
Permutation of data blocks in a bubble memory
Authors: Bongiovanni Gian Carlo , Luccio Fabrizio
Published: July 2002

A common internal organization of bubble memories consists of a set of (minor) loops, connected through another (major) loop. The problem of obtaining any given permutation of the minor loop contents in minimum time is studied in this paper. A lower bound to the number of steps required by a permutation algorithm is derived, and the class of optimum algorithms is identified.
A methodology for the design of distributed information systems
Authors: Bucci Giacomo , Streeter Donald N.
Published: July 2002

A macro model of a distributed information system in presented. The model describes the major costs of using an information system from the perspective of the end-user. The model is intended to provide guidance to the system designer by making evident the effect of various design and operating parameters on overall cost per transaction. The technique is illustrated by application to the design of an interactive transaction processing system.
Consumer difficulties with computerized transactions
Authors: Sterling T. D.
Published: July 2002

The prevalence with which errors may be encountered by the
end targets
of a computerized process is assessed. How many and what type of errors occur? How easily are they corrected? What is the reaction of consumers to errors—to a failure to correct them? What can be learned by designers of large management packages from such data?

Results show that with the present state of the art, approximately 40 percent of individuals (or households) having
average
contacts with different types of accounts experience one or more errors per year. Eighty percent relate to billing. Attempts to correct errors often turned out to be difficult and not always successful.

There appears to be some conflict between computer-using organizations and their public. Also the role of poor management packages including poor software is indicated. While most management systems may be adequate, results of the survey raise concerns about the timeless and the number of designs of very large linked program packages (as EFT for instance).
Detection of combined occurrences
Authors: Zobrist Albert L. , Carlson Frederick R.
Published: July 2002

In this paper it is supposed that the variables x
1
, … , x
n
each have finite range with the variable x
i
taking on p
i
possible values and that the values of the variables are changing with time. It is supposed further that it is desired to detect occurrences in which some subset of the variables achieve particular values. Finally, it is supposed that the problem involves the detection of a large number of combined occurrences for a large number of changes of values of variables. Two efficient solutions for this problem are described. Both methods have the unusual property of being faster for systems where the sum p
1
+ … + p
n
is larger. The first solution is error-free and suitable for most cases. The second solution is slightly more elegant and allows negation as well as conjunction, but is subject to the possibility of errors. An error analysis is given for the second method and an empirical study is reported.
Cost/utilization
Authors: Borovits Israel , Ein-Dor Philip
Published: July 2002

A method is presented for evaluating computer system performance in terms of a cost/utilization factor and a measure of imbalance. These coefficients indicate the extent to which the total system cost is effectively utilized. The method includes a technique for the visual representation of system performance.
The stage hypothesis and the s-curve
Authors: Lucas Henry C. , Sutton Jimmy A.
Published: July 2002

This paper presents the results of a study testing the s-shaped budget curve of Nolan's stage model of computer development in an organization. Research on the data processing budgets of California counties fails to support the s-shaped curve or the use of budgets as a basis for a stage model. However, the results do not invalidate the concept of a stage model. The analysis suggest an alternative model of budget growth and a separation between models of budgeting growth and growth stages in the development of the computer resource.
A note on reflection-free permutation enumeration
Authors: Roy Mohit Kumar
Published: July 2002

Earlier it was shown by the present author [1] that among the classical algorithms for the generation of permutation sequences, only the Trotter-Johnson algorithm [2, 3] has the property that the reflection of any permutation in the first half of the enumeration appears only in the second half. Two permutations are called reflections of each other if one read from left to right is the same as the other read from right to left. Lenstra [4] has discussed the usefulness of this property in certain applications. Recently Ives [5] has produced a series of four permutation algorithms of which two (algorithms
c
and
d
) possess the said property.
Intentional resolution of privacy protection in database systems
Authors: Minsky Naftaly
Published: July 2002

Traditionally, privacy protection in database systems is understood to be the control over what information a given user can get from a database. This paper is concerned with another, independent, dimension of privacy protection, the control over what a user is allowed to do with a piece of information supplied to him by the database. The ability to condition the supply of information on its intended use is called here “intentional resolution” of privacy protection.

The practical importance of intentional resolution is demonstrated by several examples, and its realization is discussed. It is shown that intentional resolution can be achieved, but that it involves a radical change from the traditional approach to the process of user-database interaction. In particular, it appears to be necessary for the database to impose a certain amount of control over the internal behavior of users' programs which interact with it. A model for user-database interaction which admits such a control is developed.
LG
Authors: Raymond J.
Published: July 2002

A conversational programming language for analytic geometry is described, together with some aspects of its implementation. The language allows the flexible definition of geometric objects and elements, computes their parameters, and displays the results. It also provides the capability of specifying a geometric figure via a collection of parameters and displaying various loci corresponding to these parameters. A third characteristic consists of the possibility of using this language to design other user oriented languages. LG has been specifically designed for use by nonprogrammers; it is easy to learn and very close to the natural language used in geometry.
Elementary divisors of tensor products
Authors: Marcus Marvin , Robinson Herbert
Published: July 2002

The elementary divisors of a tensor product of linear transformations have been known for 40 years. This paper provides a short, easily accessible proof of these results, and points out an interesting combinatorial consequence of the proof.
A system for typesetting mathematics
Authors: Kernighan Brian W. , Cherry Lorinda L.
Published: July 2002

This paper describes the design and implementation of a system for typesetting mathematics. The language has been designed to be easy to learn and to use by people (for example, secretaries and mathematical typists) who know neither mathematics nor typesetting. Experience indicates that the language can be learned in an hour or so, for it has few rules and fewer exceptions. For typical expressions, the size and font changes, positioning, line drawing, and the like necessary to print according to mathematical conventions are all done automatically. For example, the input sum from i=0 to infinity x sub i = pi over 2 produces ∑
∞

i
=0

x

i

= π/2

The syntax of the language is specified by a small context-free grammar; a compiler-compiler is used to make a compiler that translates this language into typesetting commands. Output may be produced on either a phototypesetter or on a terminal with forward and reverse half-line motions. The system interfaces directly with text formatting programs, so mixtures of text and mathematics may be handled simply.

This paper was typeset by the authors using the system described.
A cost oriented algorithm for data set allocation in storage hierarchies
Authors: Lum V. Y. , Senko M. E. , Wang C. P. , Ling H.
Published: July 2002

Data set allocation in today's multilevel storage systems is usually based on qualitative, ad hoc decisions. While it would be desirable to obtain an optimal solution to this allocation problem, it is clear that the number of parameters involved makes it intractable to straight-forward solution. In such a situation, we must find a set of assumptions which simplify the problem greatly, but which still provide a basis for considering all significant cost elements. This paper presents such a first, quantitative allocation step. It considers many of the significant detailed costs of system utilization, data storage, data staging, and data migration. Although many avenues of further improvement are available, the present algorithm seems to be usefully accurate. As such, it can aid in quantifying the problems of data set allocation, storage system configuration, and new device designs.
Significant event simulation
Authors: Babich Alan F. , Grason John , Parnas David L.
Published: July 2002

This paper compares a new method of simulation organization, called the significant event method, with an old one, called the clock pulse method, using as examples two automobile traffic models. The significant event method is found to be more efficient than the clock pulse method at low levels of system interaction and less efficient at high levels. A simple mathematical model for the trade-off in the relative running time of the two methods is developed. The model aids in choosing between the two simulation methods for a particular experiment. It is concluded that the significant event method can be of value in the simulation of some systems when computational efficiency is of sufficient importance.
The digital simulation of river plankton population dynamics
Authors: Claudson R. Mark
Published: July 2002

This paper deals with the development of a mathematical model for and the digital simulation in Fortran IV of phytoplankton and zooplankton population densities in a river using previously developed rate expressions. In order to study the relationships between the ecological mechanisms involved, the simulation parameters were varied illustrating the response of the ecosystem to different conditions, including those corresponding to certain types of chemical and thermal pollution. As an investigation of the accuracy of the simulation methods, a simulation of the actual population dynamics of Asterionella in the Columbia River was made based on approximations of conditions in that river. Although not totally accurate, the simulation was found to predict the general annual pattern of plankton growth fairly well and, specifically, revealed the importance of the annual velocity cycle in determining such patterns. In addition, the study demonstrates the usefulness of digital simulations in the examinations of certain aquatic ecosystems, as well as in environmental planning involving such examinations.
Horner's rule for the evaluation of general closed queueing networks
Authors: Reiser M. , Kobayashi H.
Published: July 2002

The solution of separable closed queueing networks requires the evaluation of homogeneous multinomial expressions. The number of terms in those expressions grows combinatorially with the size of the network such that a direct summation may become impractical. An algorithm is given which does not show a combinatorial operation count. The algorithm is based on a generalization of Horner's rule for polynomials. It is also shown how mean queue size and throughput can be obtained at negligible extra cost once the normalization constant is evaluated.
A comment on the double-chained tree
Authors: Hu T. C.
Published: July 2002

In 1963, Sussenguth [8] suggested that a file should be organized as a double-chained tree for searching and updating. Patt [5] then obtained the optimum double-chained tree under the assumption that no key may prefix another and that all terminal nodes (items of information) have equal probabilities of being searched. Stanfel [6, 7] explored the relation between the double-chained tree and variable length code [3] and solved a special integer programming problem which corresponds to the case of equal probabilities of terminal nodes and a finite set of available symbols for keys with different costs.
Management science
Authors: Shanno David F. , Weil Roman L.
Published: July 2002

A brief history of integer and continuous nonlinear programming is presented as well as the current obstacles to practical use of these mathematical programming techniques. It is forecast that the useful contributions to nonlinear programming actually made in the next few years are more likely to be consolidations than theoretical breakthroughs. These contributions are likely to be the documentation of standard test problems, construction of user oriented software, and comparisons of currently known algorithms to demonstrate which techniques are best for specific problems.
Computers and employment
Authors: Borodin A. , Gotlieb C. C.
Published: July 2002

The relationship of computers and automation to employment is part of the more general relation of technological change to employment. The most obvious effect is that increases in productivity due to technology can eliminate jobs. Technology affects the individual worker, in the nature and amount of his work, and in his attitudes toward that work. Technological change affects the occupational structure of the entire labor force. Because of the central importance of these effects, the impact of technology has been the subject of extensive study by economists, sociologists, political scientists, and psychologists. Even within a single discipline, studies are often contradictory, and conclusions are colored by political overtones. We wish to delineate some of the issues, and present arguments given to support different viewpoints.
A processor allocation method for time-sharing
Authors: Mullery A. P. , Driscoll G. C.
Published: July 2002

A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists.
Numerical properties of the Ritz-Trefftz algorithm for optimal control
Authors: Bosarge W. E. , Johnson O. G.
Published: July 2002

In this paper the Ritz-Trefftz algorithm is applied to the computer solution of the state regulator problem. The algorithm represents a modification of the Ritz direct method and is designed to improve the speed of solution and the storage requirements to the point where real-time implementation becomes feasible. The modification is shown to be more stable computationally than the tradiational Ritz approach. The first concern of the paper is to describe the algorithm and establish its properties as a valid and useful numerical technique. In particular such useful properties as definiteness and reasonableness of condition are established for the method. The second part of the paper is devoted to a comparison of the new techniques with the standard procedure of numerically integrating a matrix Riccati equation to determine a feedback matrix. The new technique is shown to be significantly faster for comparable accuracy.
Constraint analysis for code generation
Authors: Van Eijk Koen , Mesman Bart , Alba Pinto Carlos A. , Zhao Qin , Bekooij Marco , Van Meerbergen Jef , Jess Jochen
Published: July 2002

Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by signal p processing applications and resource constraints implied by the processor architecture. In particular, limited resource availability (e.g.registers) poses a problem for traditional methods that perform code generation in separate stages (e.g., scheduling followed by register binding). This separation often results in suboptimality (or even infeasibility) of the generated solutions because it ignores the problem of phase coupling (e.g., since value lifetimes are a result of scheduling, scheduling affects the solution space for register binding). As a result, traditional methods need an increasing amount of help from the programmer (or designer) to arrive at a feasible solution. Because this requires an excessive amount of design time and extensive knowledge of the processor architecture, there is a need for automated techniques that can cope with the different kinds of contraints
during
scheduling. By exploiting these constraints to prune the schedule search space, the scheduler is often prevented from making a decision that inevitably violates one or more constraints. FACTS is a research tool developed for this purpose. In this paper we will elucidate the philosophy and concepts of FACTS and demonstrate them on a number of examples.
Comment on Cheney's list-compaction algorithm
Authors: Fenichel Robert R.
Published: July 2002

C.J. Cheney [2] implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory containing a copy of a list, can determine whether particular bit patterns within that memory are pointers to other list structure. The assumption is strong, and its effect is contrary to that of the list compaction which is his algorithm's purpose.
Experiments with an automated instructional system for numerical methods
Authors: Oldehoeft A. E. , Conte S. D.
Published: July 2002

A comer system was developed at Purdue University to teach portions of an undergraduate course in numerical methods. Each instructional unit or lesson is divided into three modes of instruction which allow the student to press from a computer-controlled presentation to a student-controlled investigation. The system is designed as a classroom-independent course of study, and has been used for two semesters by students in lieu of conventional classroom instruction. Initial measures of effectiveness, student acceptance, and operational cost are the result of testing the system independent of instructor intervention. The system is operational on a CDC 6500 with teletype terminals.
The role of programming in a Ph.D. computer science program
Authors: Arden Bruce W.
Published: July 2002

In this general paper the role of programming in advanced graduate training is discussed. Subject matter related to programming as well as programming per se is considered. The importance and application of formalism are considered and also the need for good empirical experimentation. A brief outline for a sequence of courses is included, and subject headings that have been obtained from an extensive bibliography are given. A bibliography of programming references is included.
Concepts of use in contour map processing
Authors: Morse Stephen P.
Published: July 2002

Generalized techniques are developed whose use can simplify the solution of problems relating to contour maps. One of these techniques makes use of the topological properties of contour maps. The topology is represented by a graphical structure in which adjacent contour lines appear as connected nodes. Another generalized technique consists of utilizing geometrical properties to determine the characteristics of straight lines drawn on the contour map. Both of these techniques have been applied to the problem of locating the ground track of an aircraft from elevation readings obtained during a flight.
A note on “A modification of Nordsieck's method using an ‘Off-Step’ point”
Authors: Blumberg John W. , Foulk Clinton R.
Published: July 2002

An examination was made of the experimental results presented by J.J. Kohfeld and G.T. Thompson [1] in their paper on a modification of Nordsieck's method for the numerical solution of ordinary differential equations, using a multiple precision arithmetic package [2] available on the IBM 7094 at The Ohio State University Computer Center. A comparison was made between the errors of the Nordsieck and the Gragg-Stetter-Nordsieck methods in which, after the starting procedure, the interval length “
h
” was held constant. Results relative to the five functions used by Kohfeld and Thompson are presented in Tables I and II (@
b
means 10

b

).
Automatic contour map
Authors: Cottafava G. , Le Moli G.
Published: July 2002

Some methods for contour mapping by means of a digital plotter are dicussed, and a new method is presented that is simple enough to be implemented by programs with a rather small number of instructions (about 120 FORTRAN IV instructions are required). Comparisons with some methods proposed by other authors are also performed.

A FORTRAN IV program implementing the proposed method is availabel at the Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano.
The emergence of a profession
Authors: Orden Alex
Published: July 2002

Computer programming deals with an enormous variety of activities and is carried on by people with a great variety of backgrounds. It seems clear that part but not all of this activity is evolving toward a distinct professional field, but that the scope of this emerging profession, and some of its economic, social, and educational characteristics are as yet by no means well defined. In this paper, these issues are examined and some opinions about them are expressed.
On the expected gain from adjusting matched term retrieval systems
Authors: Shumway R. H.
Published: July 2002

A file adjustment procedure based on maximizing the Bayes expected gain is proposed for matched term retrieval systems. The expected gain and its probability distribution are derived as a function of: (1) the prior proportion of omitted terms, and (2) the coefficient of separation between two distributions corresponding to values of an adjustment statistic. An example evaluates the gain parameters for a typical information retrieval system.
A note on multiplying boolean matrices II
Authors: Comstock D. R.
Published: July 2002

In a note by Baker [1], a method is given for getting the limiting connectivity matrix,
B
, of a matrix whose entries are Boolean 0's and 1's. Harary [2] suggests determining
A

n
-1

since
A

n
-1

=

A
n

= ··· , where
n
is the order of the matrix. The purpose of this note is to give a method for determining
A

n
-1

. The method is also applicable to finding the output matrix of a switching network as described in [3] and [4] where again
A

n
-1

=

A
n

= ··· , but
A
now has Boolean switching functions as entries instead of 0's and 1's.
An example in “significant-digit” arithmetic
Authors: Miller R. H.
Published: July 2002

Different methods of handling the summing process for the geometric series are shown to give results indicating widely differing significances when carried out in a machine incorporating “significant-digit” arithmetic.
report on CCITT data communications study group meeting
Authors: Gorn S. , Bemer R. W. , Green J. , Lohse E.
Published: July 2002

Data communications was the subject of a two-week meeting held 24 September through 4 October 1963, in Geneva, Switzerland, by the International Telegraph and Telephone Consultative Committee (CCITT) Special Study Group A. Previous meetings of this group had been held in Geneva in April, 1960, and October, 1961. The CCITT has traditionally been responsible for all standardization activities involving the public telecommunications network of the world. Among the 150 participants, there were eleven USA representatives who represented the Government, various business machine companies and the common carriers.
FORTRAN subroutines for time series data reduction
Authors: MacGowan Roger A.
Published: July 2002

For several years the author has been concerned with time series data reduction of guided missile data derived from tracking, telemetry and static test instrumentation. The data, which is acquired from many sources and comes in a great variety of formats and coding systems, must commonly be manipulated in a number of general ways before the calculation of functions specific to guided missile analysis is possible. The costs of programming many special purpose data reduction programs and the development time consumed in preparing and checking out these programs have strongly indicated the need for independent, general-purpose computer program modules or subroutines for data reduction. The philosophy arrived at by the author, is almost identical with that described in a recent publication by Healy and Bogert, and in a note by Bennet, but these individual module specifications are concerned with continuous functions, whereas the referenced article deals with spectral analysis.
Business Applications: GAN, a system for generating and analyzing activity networks
Authors: Schurmann A.
Published: July 2002

GAN, a system for
g
enerating
a
ctivity
n
etworks, is designed to save time in the preparation of activity networks and to deal conveniently with network programs. A defining description of a programming language designed for generating activity network from a set of standard networks is presented. Also, a general idea of a language for performing calculations on activity networks (scheduling activity networks) is given.
Solutions of combinatorial problems using generating functions on a variable-field computer
Authors: Weinberg G. M.
Published: July 2002

The utility of generating functions in solving combinatoria problems is discussed. Particular implementation results are presented and evaluated.
A method of syntax specification
Authors: Iverson Kenneth E.
Published: July 2002

The addition of a few simple conventions to the Backus Normal Form specification of a language provides a mode of description which is more compact and easier to prepare and use than either the standard BNF description [1] or the corresponding syntactical chart [2].
Performance evaluation of multiple time scale TCP under self-similar traffic conditions
Authors: Park Kihong , Tuan Tsunyi
Published: July 2002

Measurements of network traffic have shown that self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting long-range correlation structure in self-similar traffic for congestion control. We have advanced the framework of multiple time scale congestion control and shown its effectiveness at enhancing performance for rate-based feedback control. In this article, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale module that adjusts the aggressiveness of bandwidth consumpton behavior exhibited by TCP as a function of large time scale network state, that is, information that exceeds the time horizon of the feedback loop as determined by RTT. How to effectively utilize such information—due to its probabilistic nature, dispersion over multiple time scales, and realization on top of existing window-based congestion controls—is a nontrivial problem. First, we define a modular extension of TCP (a function call with a simple interface that applies to various flavors of TCP, e.g., Tahoe, Reno, and Vegas) and show that it significantly improves performance. Second, we show that multiple time scale TCP endows the underlying feedback control with proacativity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of three traffic control dimensions—tracking ability, connection duration, and fairness—on performance. Performance evaluation of multiple time scale TCP is facilitated by a simulation benchmark environment based on physical modeling of self-similar traffic. We explicate our methodology for disc
The structure of programming languages
Authors: Raphael Bertram
Published: July 2002

In this paper the major components of every programming language are identified as: (1) the elementary program statement, (2) mechanisms for linking elementary statements together, (3) the means by which a program can obtain data inputs. Several alternative forms of each of these components are also described, compared and evaluated. Many examples, frequently from list processing languages, illustrate the forms described.

The advantages, disadvantages and factors influencing the choice of a form of component for a language are discussed, and the paper concludes with the suggestion that programming languages evolve toward one which will permit all the most convenient ways of structuring programs, organizing systems and referencing data.
A comparison of the FORTRAN language implementation for several computers
Authors: Wright Donald L.
Published: July 2002

A feature-by-feature comparison is made of five different implementations of FORTRAN IV representing three different manufacturers. A table is constructed showing, where possible, the use of each feature in each implementation. Only those items which are different from, or have been added to FORTRAN II are shown.
Advanced programming and the aims of standardization
Authors: Gorn Saul
Published: July 2002

Some of the most advanced programming techniques have emerged either because of the complete lack of coordinated standards, or because there was too rigid standardization and too soon, whether it was planned that way or not. The standardization that was lacking, or too rigid, was in programming techniques, programming languages, programming terminology, equipment techniques, available equipment, and specification and documentation methods for equipment, programs, languages, and problems to be solved. For example, common programming languages developed because of the lack of standardized equipment or languages for their use.
Half rotations in
N
-dimensional Euclidean space
Authors: McCammon Richard B.
Published: July 2002

An iterative procedure is described for determining half rotations in n-dimensional Euclidean space. The method is a variant of the cyclic Jacobi procedure and utilizes elementary plane rotations to obtain the half rotation matrix. Numerical examples are given.
Data filtering applied to information storage and retrieval applications
Authors: Larsen Robert P.
Published: July 2002

Manipulation of data strings is the most complex processing function in information storage and retrieval applications. Data string manipulation is discussed within the context of an interpretive processing environment controlled by the use of procedural directives. The sequence of procedural directives is derived from a job assumed to be expressed in a user-oriented source language.

Each data string within the structured data environment (data bank) is explicitly or implicitly related to a format declaration residing in a format library. The processing mechanics associated with data string manipulation is developed in accordance with a generalized data filtering concept. This results in the implementation of a two-port data filter module that satisfies internal processing functions by filtering data strings through format declarations associated with its input and output ports.
Design of an improved transmission/data processing code
Authors: Bemer R. W. , Smith H. J. , Williams F. A.
Published: July 2002

Historically there has been strong difference of opinion in the construction of 6-bit (64-character) data codes, based upon whether the code is to be used for communications or data processing. This paper reports on investigation of an improved code which meets transmission requirements and requires very little modification for varied data processing usage.
A method for evaluating the area of the normal function
Authors: Baker Frank B.
Published: July 2002

Many statistical procedures require the cumulative area and ordinate of the normal function corresponding to a given deviate. The development of a computer program for the application of probit analysis [1] to bio-assay led to the method described here.
Read-backward polyphase sorting
Authors: Gilstad R. L.
Published: July 2002

Read-backward Polyphase sorting provides more efficient use of the tapes available to a sort than most other sorting techniques. Backward Polyphase produces a continuous merging process from
n
- 1 tapes where
n
is the total number of tapes being used in the sorting process. Any of the available presorting techniques may be used in conjunction with the Polyphase merge sort provided that the presort has the capability of producing both ascending and descending strings and distributing the strings on the various tapes as required by the Polyphase Merge.
Design and characteristics of a variable-length record sort using new fixed-length record sorting techniques
Authors: Goetz Martin A.
Published: July 2002

This paper describes the application of several new techniques for sorting fixed-length records to the problem of variable-length record sorting. The techniques have been implemented on a Sylvania 9400 computer system with 32,000 fixed-length words of memory. Specifically, the techniques sequence variable-length records of unrestricted size, produce long initial strings of data, merge strings of data at the power of
T
- 1, where
T
is the number of work tapes in a system, and do not restrict the volume of input data.
Conversion, reconversion and comparison techniques in variable-length sorting
Authors: Waks David J.
Published: July 2002

The logic is described for converting highly variable input records into a format that can be easily and efficiently processed by a sorting program.
1
The internal record formats are discussed in relation to (1) their conversion from input formats, (2) their reconversion to output formats, and (3) comparison techniques between internal formats.
An experimental computer program for hypothesis selection
Authors: Kochen M.
Published: July 2002

An algorithm for finding the characterization of a class of objects on the basis of a randomly ordered sequence of labeled individual objects—some members of the class, some not—is described. The class is characterized as a disjunction of terms, each term being a conjunction of attributes. “All red, round objects or all square, small objects” is an example. Mechanisms based on this algorithm are described in terms of such properties as the amount of storage available for recording instances and the number of instances which had to be examined until the class was first guessed.
A general formulation of storage allocation
Authors: Roberts A. E.
Published: July 2002

Formalization of a general computer storage allocation process is attempted. With a given computer
M
is associated a fictitious computer
M
′ essentially identical to
M
except in respect to possession of unbounded primary storage. Mappings of the total storage set (internal and external) of
M
into the direct address set of
M
′ are introduced. A program sequence
P
for
M
′ is termed
M
-admissible (relative to a specific execution time period) if there is a mapping under which
P
and its effective data referents are all located in the direct address set of
M
. Storage allocation is considered as a process of establishing for an arbitrary
M
′ program a sequence of mappings, a decoupling of the program into
M
-admissible subprograms and a linking set of interludes. An existence proof in terms of a completely interpretive
M
program as indicated. Some special cases are discussed. Various restrictions on generality of
M
′ programs are considered under which more practical realization of allocation processes becomes tractable.
Some thoughts on reconciling various character set proposals
Authors: Voorhees Edward A.
Published: July 2002

Recently there have appeared several proposals for expanded character sets. In general, these differ in the following respects:

the number of characters in the expanded set,

the characters selected,

card and/or tape code representation, and

superscripting and subscripting techniques.

Currently, it seems to be popular to talk in terms of establishing a “standard expanded character set.” In the opinion of the author, this will prove to be extremely difficult in practice and undesirable in theory. This does not mean, however, that there should be no attempt to achieve “minimal standard character subsets” for communication purposes and “universal languages.”
Character scanning on the IBM 7070
Authors: Speckhard A. E.
Published: July 2002

One general requirement in the construction of symbol manipulators and automatic programming systems is the need to scan a line of information, usually from left to right, and to break down or subdivided this line into words, phrases or some form of subgrouping. Assuming a natural or free form was allowed in the composition of the line, it will be necessary to examine in sequence each character of the line and, depending on the syntactical rules in force, accumulate characters into a word until a separator is recognized. For example, consider breaking down
AX, BX, CX
on the basis of the comma.
On programming the numerical solution of polynomial equations
Authors: Ellenberger Kenneth W.
Published: July 2002

Numerical techniques are presented for computing the roots of polynomial equations. By applying the recommended scaling and inversion rules, the basic Bistrow and Newton-Raphson iterative techniques can be applied with great reliability. Both a high degree of accuracy and rapid convergence are realized. Numerical examples are shown to illustrate the pitfalls and to show how these are circumvented by application of the recomended procedures.
MIRFAC: a compiler based on standard mathematical notation and plain English
Authors: Gawlik H. J.
Published: July 2002

A pilot version of the compiler MIRFAC, now in the operation, is described. The chief features of the system, which is intended for the solution of scientific problems, are the presentation of mathematical formulas entirely in standard textbook notation. The use of plain English for organizational instructions, automatic error diagnosis indicating the actual location of the error in the uncompiled program, and an attempt to minimize that fragmentation of the original problem statement which is a normal feature of programming systems.
A general program for the analysis of square and rectanglar lattice designs
Authors: Smillie K. W.
Published: July 2002

This paper describes a general-purpose program that will handle those incomplete block designs known as square and rectangular lattices. Flow diagrams are given so that the method of calculation may be programmed for any digital computer.