ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612248

Kenneth King

引用次数: 0

The method of resultant descents for the minimization of an arbitrary function 求任意函数最小值的结果下降法

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612286

R. Finkel

引用次数: 4

Data processing compilers for small card reading computers 小型读卡机用数据处理编译器

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612276

P. Berger, Donald L. Sullivan

引用次数: 0

Isolation of control malfunctions in a digital computer 隔离数字计算机中的控制故障

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612210

K. Jacoby

引用次数: 1

A small special-purpose data retrieval system 一种小型的专用数据检索系统

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612253

Irving L. Wieselman, R. Williams

引用次数: 0

A method for finding a minimum of a multivariate function with applications to the reduction of missile and satellite data 一种求多元函数最小值的方法，并应用于导弹和卫星数据的约简

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612285

E. R. Lancaster

{"title":"A method for finding a minimum of a multivariate function with applications to the reduction of missile and satellite data","authors":"E. R. Lancaster","doi":"10.1145/612201.612285","DOIUrl":"https://doi.org/10.1145/612201.612285","url":null,"abstract":"Let (XI, X2, . . e , Xn) be an approximation to the location of a minim~ of the continuous function f (Xl, x2, . . . , Xn). Let h i be a number associated with x i, We define the following abbreviations: ~o ~ f(x~, x2,. o °, 4), f(X i + h i ) = f(Xl, X 2, ° ~ • ~ Xi + hi, . . . , Xn), z(x i h~, xj + hi) ~ f(Xl, . . . , X~ hi, o . ., Xj ÷ hi, . ° . , Xn), e~. Thus any variables not appearing in parentheses will be assumed to have the values at the point of approximation to the minimum. The method consists of fitting a complete second-degree polynomial in the n variables to the f~mction in the neighborhood of a minim~mLo Let this polynomial be n n n n-! (I) ~ fo ~ ~ bi ~i + 1⁄2 ~ a~ xi 2 ~ ~ T aij x~ ~j i=l i=l j =i+l i=l i To fit this polynomial to the function, we force the polynomial and the function to correspond at 1⁄2n(n + 3) points in addition to the point (Xl, . ° . , Xn, fo) ° The resulting set of simultaneous equations is solved for the coefficients b i and aij in (I). Then setting the partial derivatives of (I) equal to zero, we obtain a set of n simultaneous linear equations. The solution of this set gives a new approximation to the location of a minimum of the function.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121417779","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}

引用次数: 1

A linear selection diode steered core memory 一种线性选择二极管控制的磁芯存储器

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612256

R. Shevlin

引用次数: 0

The effect of simultaneity on sorting operations 同时性对排序操作的影响

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612252

S. Feerst, F. Sherwood

{"title":"The effect of simultaneity on sorting operations","authors":"S. Feerst, F. Sherwood","doi":"10.1145/612201.612252","DOIUrl":"https://doi.org/10.1145/612201.612252","url":null,"abstract":"The sorting method to be considered is a standard tape merge, modified to take advantage of whatever simultaneous operation capabillties are available. The two types of simultaneity to be considered here are: a) Read-Write and b) Read-Write-Compute. For analysis purposes the sorting method divides naturally into two parts: Phase One-the first tape passt wherein sorted strings of some length are produced from the original randomly arranged data~ by mesh sorting1 and Phase Two-all subsequent tape passes1 wherein the sorted strings produced by Phase One are merged until a single sorted string is obtained. Phase One A division of the internal memory into input and output sections indicates that with no simultaneity, or with read-write simultaneity~ sorted strings of length A/2 are produced1 where A equals the available work area. in the latter caser sharing the reading and writing produces some time advantage. if complete read-write-compute simultaneity exists the sorting method could produce sorted strings of length A/4 and minimize the time required for Phase One. These strings would be half the length of those produced using simultaneous read-write. The longer sorted strings can be handled with fewer passes in Phase Twot more than offsetting the extra time required to produce them in Phase One. Therefore1 even when simultaneous read-write-compute is available~, it is preferable to utilize only simultaneous read-write for Phase One.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407449","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}

引用次数: 1

Deflation by elementary rotations for the solution of algebraic eigenvalue problems 代数特征值问题解的初等旋转压缩

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612240

H. Rutishauser

{"title":"Deflation by elementary rotations for the solution of algebraic eigenvalue problems","authors":"H. Rutishauser","doi":"10.1145/612201.612240","DOIUrl":"https://doi.org/10.1145/612201.612240","url":null,"abstract":"For the case, that an eigenvector v of an arbitr~ real matrix A is known, several Authors have proposed methods to elimi~ nate the corresponding eigenvalue from the matrix, either by changing it to zero or bY reducing the order of the matrix by one° The present paper derives from the components v[k] of v a set of elementary (two-dimensional) orthogonal transformations~ which transform A into a matrix A I whose last column has only the diagonal element different from zero. The rules are as follows Start with B o = A, then transform for k = 1,2,..o~n~I Bk_ I into B k = U~ Bk_IUk , where U k is obtained from the unit matrix by replacing the following elements The element [k,k] by cos(t[k]) [k+1,k+1] by cos(t[k]) [k,k+1] by sin(t[k]) [k+1 ,k] by sin(t[k]) , and the rotation angle t[k] is determined by tg(t[k]) = ~ v[i] ~ /v[k+1 ] • Then Bn_ I will be the required matrix A I having zeros in the This process may be continued with the matrix A I until after n(n-1)/2 rotations, A is transformed to triangular form (but between a total of n-1 eigenvectors must be computed). This is certainly a nearly trivial modification of Jacobi's or Greenstadt's method. It has however some decisive advantages: a) If not all eigenvalues are wanted, the process may be stopped earlier. b) The convergence behavior of Greenstadt's method is still not quite known, whereas the method given here is iterative only with respect to the computation of the eigenvectors, but this is a well known procedure.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125522575","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}

引用次数: 1

Preparation of display maps with an electronic computer 用电子计算机编制显示地图

ACM '59 Pub Date : 1959-09-01 DOI: 10.1145/612201.612258

H. A. Bedient, J. R. Neilon, L. Lambert

{"title":"Preparation of display maps with an electronic computer","authors":"H. A. Bedient, J. R. Neilon, L. Lambert","doi":"10.1145/612201.612258","DOIUrl":"https://doi.org/10.1145/612201.612258","url":null,"abstract":"USAF The Joint Numerical Weather Prediction Unit has had a pressing require~ ment for preparation of results in two-dimensional contour map form° Since the unit operates essentially in real time, the displays must be ready immediately, for local use, or distribution by facsimile. Various techniques for doing this have been tried or proposed. From 1955 ~ 1959 we have repre~ sented contour fields by printing shading between alternate pairs of lines on an IBM 407-type line printer. The shading is derived by two dimensional quadratic interpolation of the variable to each point on the paper represented by a printer wheel then a decision as to whether this value is in a printable band. The resulting contour maps are able to represent very complex fields with odd shaped maxima and minima. The contour intervals need to be linear for simplicity and fringing will occur at discontinuities. Fringing can often be avoided by proper selection of values. The maps are presently copied by hand onto plastic overlays containing the background geography and copied by a diazo process. With the advent of high-speed curve plotters and digital to analogue converters an experiment was made to adapt these for complete mechanization of the map drawing process. To drive a curve plotter it is necessary","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128035415","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}

引用次数: 0

ACM '59最新文献