An efficient algorithm is described for generating subsets of a set S which satisfy constraints of the form: 'If sj is a member of the subset, then sj must also be a member of the subset.' The algorithm has be...
详细信息
An efficient algorithm is described for generating subsets of a set S which satisfy constraints of the form: 'If sj is a member of the subset, then sj must also be a member of the subset.' The algorithm has been programmed in the WISP language and successfully run on the IBM 7094 in connection with a routine to detect feedback in multidimensional iterative networks. [ABSTRACT FROM AUTHOR]
A programming language is described which is applicable to problems conveniently described by transformation rules. By this is meant that patterns may be prescribed, each being associated with a skeleton, so that a se...
详细信息
A programming language is described which is applicable to problems conveniently described by transformation rules. By this is meant that patterns may be prescribed, each being associated with a skeleton, so that a series of such pairs may be searched until a pattern is found which matches an expression to be transformed. The conditions for a match are governed by a code which also allows subexpressions to be identified and eventually substituted into the corresponding skeleton. The primitive patterns and primitive skeletons are described, as well as the principles which allow their elaboration into more complicated patterns and skeletons. The advantages of the language are that it allows one to apply transformation rules to lists and arrays as easily as strings, that both patterns and skeletons may be defined recursively, and that as a consequence programs may be stated quite concisely. [ABSTRACT FROM AUTHOR]
PM is an IBM 7094 program system far formal manipulation of polynomials in any number of variables, with Integral coefficients unrestricted in size. Some of the formal operations which can be performed by the system a...
详细信息
PM is an IBM 7094 program system far formal manipulation of polynomials in any number of variables, with Integral coefficients unrestricted in size. Some of the formal operations which can be performed by the system are sums, differences, products, quotients, derivatives, substitutions and greatest common divisors. PM is based on the REECO III list processing system, which is described and compared with the LISP and SLIP systems. The PM subroutines for arithmetic of large integers are described as constituting an independently useful subsystem. PM is compared with the ALPAK system in several respects including the chokes of canonical forms for polynomials. A new algorithm for polynomial greatest common divisor calculation is mentioned, and examples are included to illustrate its superiority. [ABSTRACT FROM AUTHOR]
A technique for using a digital computer to draw both ordinary and time-lag root locus diagrams is described. Ordinary diagrams are drawn much faster and more accurately than ever before. Time-lag diagrams, which had ...
详细信息
A technique for using a digital computer to draw both ordinary and time-lag root locus diagrams is described. Ordinary diagrams are drawn much faster and more accurately than ever before. Time-lag diagrams, which had been impossible to obtain, are drawn with the same speed and accuracy as ordinary diagrams. [ABSTRACT FROM AUTHOR]
Describes the basic features, system characteristics and the control algorithm for a multi-programming system with rapid turnaround time. Machine configuration used; Design of basic switching algorithm for the system;...
详细信息
Describes the basic features, system characteristics and the control algorithm for a multi-programming system with rapid turnaround time. Machine configuration used; Design of basic switching algorithm for the system; Organization of the operating system into a set of programs.
Analyzes a petroleum blending problem to compare primal and primal-dual decomposition algorithms. Relevance of a substructure to the relative performance of the algorithms; Comparison of the absolute performance of th...
详细信息
Analyzes a petroleum blending problem to compare primal and primal-dual decomposition algorithms. Relevance of a substructure to the relative performance of the algorithms; Comparison of the absolute performance of the algorithms with a standard primal-Simplex solution without decomposition.
The article describes the features of the nonprocedural language (NPL) by the Advanced Language Development Committee of the SHARE FORTRAN project. This article is not a full description of NPL. Instead it is an exami...
详细信息
The article describes the features of the nonprocedural language (NPL) by the Advanced Language Development Committee of the SHARE FORTRAN project. This article is not a full description of NPL. Instead it is an examination and justification of those features which are not generally present in higher level languages and of other features for which the NPL approach is somewhat different from previous languages. Programming languages are most often written on coding sheets, punched at key punches or terminals, and listed on printers. While the specification of a publication language was considered essential, the first and most important goal of syntax design was to make the listings as readable, and to make the writing and punching as error free, as possible. A free-field format was chosen to help the terminal programmer. In most high level programming languages the basic element which denotes a certain action to be executed is called a statement and the collection of all the statements required to achieve solution lo the problem at hand is called a program.
暂无评论