ACM '58Pub Date : 1958-06-11DOI: 10.1145/610937.610939
T. Engelhart
{"title":"Numerical treatment of a set of fourth order hyperbolic differential equations","authors":"T. Engelhart","doi":"10.1145/610937.610939","DOIUrl":"https://doi.org/10.1145/610937.610939","url":null,"abstract":"The equations discussed here are those governing the bending of an elastic column when one end is given a known axial velocity. Existing solutions to this problem have assumed an infinite speed of propagation of the stress wave, The work described in this paper was originally started to determine when existing solutions are valid, and to devise practical methods of solution for those situations not adequately covered at present.","PeriodicalId":174899,"journal":{"name":"ACM '58","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1958-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '58Pub Date : 1958-06-11DOI: 10.1145/610937.610992
Michael Zarechnak
{"title":"Structural analysis in machine translation","authors":"Michael Zarechnak","doi":"10.1145/610937.610992","DOIUrl":"https://doi.org/10.1145/610937.610992","url":null,"abstract":"One of the research units of the current Georgetown University project in Machine Translation has developed a general analysis technique for solving the MT problem, based on the concept of structural transfer from the source to the target language. At the present time the research is being applied to Russian-English MT.","PeriodicalId":174899,"journal":{"name":"ACM '58","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1958-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '58Pub Date : 1958-06-11DOI: 10.1145/610937.610984
E. Bareiss
{"title":"Resultant procedure","authors":"E. Bareiss","doi":"10.1145/610937.610984","DOIUrl":"https://doi.org/10.1145/610937.610984","url":null,"abstract":"The resultant procedure is a method for finding simultaneously all zeros of polynomials with real coefficients° There are no restrictions on the multiplicity of either the real or complex zeros. To obtain the absolute values of the zeros, the method relies on the proper use of the Graeffe algorithm. It was necessary to redevelop the root-squaring method and modify it so that polynomial equations with complex roots of arbitrary multiplicity or with cyclotomic polynomials as factors could be handled with equal ease by a high speed computer. The principle of the resultant procedure is given below. After the absolute value p of a root o~ of the polynomial equation P(x) = a O x n + a I x n-I + \" \" ' + a n = O has been found, the resultant R(p) of this polynomial P(x) and the quadratic Q(x) = x 2 + p x + ~2 is determined by a recurrence formula. This resultant is apolynomial in p of degree n. P(x) and Q(x) have a common factor if R(p) = O. Hence the real roots pj which satisfy the condition Ipji ~ 2p yield the real parts, pj/2, of the roots o~ of modulus p. We actually compute p* which usually carries a small error. Hence R(p) = O may yield complex roots p* which satisfy Ip*I ~ 2 p*. The theory shows that the relative error of I)* is of the same order of magnitude as the relative error in p*. Therefore, the resultant procedure is numerically stable. The different steps to be taken to design and/or use the corresponding code are ou t l i ned be low. A. P r e l i m i n a r y C o n s i d e r a t i o n s . (1)","PeriodicalId":174899,"journal":{"name":"ACM '58","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1958-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125868411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '58Pub Date : 1958-06-11DOI: 10.1145/610937.610956
H. Bratman, Ira V. Boldt
{"title":"SHARE 709 system supervisory control","authors":"H. Bratman, Ira V. Boldt","doi":"10.1145/610937.610956","DOIUrl":"https://doi.org/10.1145/610937.610956","url":null,"abstract":"Fundamental to the 709 System is the supervisory program which is responsible for maintaining the computer in continuous operation during the processing of a group of independent Jobs~ This program consists of a manifold of subroutines which perform a variety of communication and service functions. In particulars the supervisory program:. makes available to an operating program the basic components of the system: SCAT, the Debugging Routines, and the Input and Output Translators; ° provides (optional) standard action in any trapping situation, such as a floating point spill; 3-controls automatic input and output editing; ~. maintains accounting and other records; 5. provides inter-job continuity; 6. furnishes a running account of its activities to the operator. The input for the supervisory system is a peripherally prepared tape containing a group of jobs, each with its input data. The entire group of Jobs is processed in one or more aphases.m The number of phases needed to complete any particular Job depends upon the method of input and output editing the job uses. Final output accumulates on one or more peripheral output tapes. All peripheral input and output tapes, and the binary mediary tapes which transfer Jobs and data from phases to phase, are read or written through system subroutines. Four types of Jobs are recognized by the system on the basis of the input and output editing used. An input tape may contain Jobs of any or all of these type s~ 20-1","PeriodicalId":174899,"journal":{"name":"ACM '58","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1958-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133209893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
