{"title":"Algorithm for Julian dates","authors":"R. Branham","doi":"10.1145/219340.219343","DOIUrl":"https://doi.org/10.1145/219340.219343","url":null,"abstract":"C functions are given that allow one to calculate a Julian day number for a day, month, and year on the Julian calendar, take a Julian day number and convert it to a day, month, and year on the Julian calendar, and find the day of the week that corresponds to a day, month, and year on the Julian calendar.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131756210","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}
{"title":"Interval rational = algebraic","authors":"V. Kreinovich","doi":"10.1145/219340.219342","DOIUrl":"https://doi.org/10.1145/219340.219342","url":null,"abstract":"Rational functions can be defined as compositions of arithmetic operations (+, -,.,:). What class of functions will be get if we add to this list the \"interval\" operation (that transforms a function f of n variables and given intervals X1, ...., Xn into the bounds for the range f(X1, ..., Xn))? In this paper, we prove that adding this \"interval\" operation to rational functions leads exactly to the set of all (locally) algebraic functions.In other words, algebraic functions can be described as compositions of arithmetic operations and the \"interval\" operation.This result provides an additional explanation of why naive interval computations sometimes overshoot:• the desired dependency is (locally) a genera algebraic function;• naive interval methods results in a (locally) rational function;• not all algebraic functions are rational.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124517118","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}
{"title":"A compilation of automatic differentiation tools presented at the 1995 international convention on industrial and applied mathematics, Hamburg","authors":"C. Bischof, F. Dilley","doi":"10.1145/221332.221333","DOIUrl":"https://doi.org/10.1145/221332.221333","url":null,"abstract":"This document was compiled for the minisymposium on automatic differentiation tools presented at the 1995 International Convention on Industrial and Applied Mathematics, Hamburg. The document was compiled by Chris Bischof and Fred Dilley of Argonne National Laboratory with contributions by Mike Bartholomew-Biggs, Stephen Brown, Alan Carle, Bruce Christianson, David Cowey, Frederic Eyssette, David M. Gay, Ralf Giering, Andreas Griewank, Jim Horwedel, Peyvand Khademi, K. Kubota, Andrew Mauer, Michael B. Monagan, John Pryce, John Reid, Andreas Rhodin, Nicole Rostaing-Schmidt, and Jean Utke.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"52 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113970897","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}
{"title":"When is double rounding innocuous?","authors":"Samuel Figueroa","doi":"10.1145/221332.221334","DOIUrl":"https://doi.org/10.1145/221332.221334","url":null,"abstract":"Double rounding is the phenomenon that occurs when the result of an operation is rounded to fit some intermediate destination, and then again when delivered to its final destination. This can be a common occurrence when using some floating-point arithmetic engines which lack single precision registers: results of operations are typically rounded to fit in a register, whose width may be double precision or wider, before being stored in some memory location possibly in a format narrower than that of the registers. Examples of such floating-point arithmetic engines include Intel's x87 series and IBM's POWER architecture. (Implementations of the latter are found in some IBM workstations.)","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130257366","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}
{"title":"The SuperPascal software","authors":"P. B. Hansen","doi":"10.1145/221332.221335","DOIUrl":"https://doi.org/10.1145/221332.221335","url":null,"abstract":"Pascal is still the most widely used programming language in computer science textbooks. Building on that tradition I have developed SuperPascal as a publication language for parallel scientific computing. SuperPascal extends a subset of IEEE Standard Pascal with deterministic statements for parallel processes and synchronous message passing. Recursive procedures may be combined with parallel statements. A tutorial illustrates the parallel features of SuperPascal by examples [1]. The language report defines the syntax and semantics concisely [2]. The book Studies in Computational Science includes the complete SuperPascal text of portable multicomputer programs for linear equations, n-body simulation, matrix multiplication, all-pairs shortest paths, sorting, fast Fourier transforms, simulated annealing, prireality testing, Laplace's equation, and forest fire simulation [3]. A portable implementation of SuperPascal has been developed on a Sun workstation under Unix. It consists of a compiler and an interpreter written in Pascal. To obtain the SuperPascal software, use anonymous FTP from the directory pbh at top.cis.syr, edu. The software includes a user manual [4], and software notes [5]. At Syracuse University, the book and the software have been used in a course on \"The Art of Multicomputer Programming.\"","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124442974","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}
{"title":"Regarding test functions for multi-dimensional integration","authors":"W. J. Whiten, L. Kocis","doi":"10.1145/214437.214440","DOIUrl":"https://doi.org/10.1145/214437.214440","url":null,"abstract":"Monte Carlo and quasi Monte Carlo (ie using low discrepancy sequences) methods (Bratley & Fox 1988, Joe & Sloan 1993, Krommer & Ueberhuber 1994, Lyness 1989, Niederreiter 1978, Sloan & Kachoyan 1987) are used to approximate an integral by the average value of function samples:[EQUATION 1]where v is the volume of integration (taken here to be the unit multi-dimensional cube) and x is a vector with an element for each of the dimensions of the multidimensional space. In the case of Monte Carlo the points xp are chosen at random, while in quasi Monte Carlo the points are chosen to cover the integration volume as uniformly as possible. For numerical integration over a large number of dimensions these two techniques are often the only methods available.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665680","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}
{"title":"Determination of parameter relations within non-linear models","authors":"W. J. Whiten","doi":"10.1145/192527.192535","DOIUrl":"https://doi.org/10.1145/192527.192535","url":null,"abstract":"Unknown parameter relations within a non-linear model can be investigated by linearising and the creation of an artificial zero point from which the parameter relation can be constructed using linear regression techniques.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114648604","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}
{"title":"Variants of matrix-matrix multiplication for Fortran-90","authors":"C. Douglas, G. Slishman","doi":"10.1145/181498.181500","DOIUrl":"https://doi.org/10.1145/181498.181500","url":null,"abstract":"The Fortran-90 standard requires an intrinsic function matmul which multiplies two matrices together to produce a third as the result. However, the standard does not specify which algorithm to use. We consider an extension to the matmul syntax which allows a Winograd variant of Strassen's algorithm to be added. We discuss an implementation that is in a commercial Fortran-90 offering.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125531352","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}
{"title":"How to stabilize a fixed point","authors":"K. Briggs","doi":"10.1145/181498.181499","DOIUrl":"https://doi.org/10.1145/181498.181499","url":null,"abstract":"While reading the thesis on 'Renormalization in area preserving maps' by Robert Mackay (Princeton 1982), I noticed an intriguing method proposed for computing an unstable fixed point of a nonlinear operator, in the case where we know approximately the eigenvalue of the linearized operator. Mackay attributed this method to his advisor Martin Kruskal. Although simple and practical, I had not seen this idea before, and since an error in the thesis makes it unnecessarily difficult to follow, I thought this presentation would be of interest. All credit is due to Mackay and Kruskal.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129625550","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}
{"title":"A comment on the Eispack machine epsilon routine","authors":"T. Hopkins, J. Slater","doi":"10.1145/165639.165641","DOIUrl":"https://doi.org/10.1145/165639.165641","url":null,"abstract":"We analyze the algorithm used to generate the value for the machine epsilon in the Eispack suite of routines and show that it can fail on a binary floating-point system. The comments in the code describing the conditions under which this method will work are not restrictive enough and we provide a replacement set of assumptions. We conclude by suggesting how the algorithm may be modified to overcome most of the shortcomings.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610052","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号
