Search

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper contains the doscription of a method of computation of the power spectrum of a stochastic signal that minimizes the error intrinsic with the direct way of computation. The method is a generalization of the mean value rejection and prewhitening techniques. It grounds itself on the adaptive construction of a filter which transforms the true spectrum in a white one by means of the linear filtering of the signal given, whichever the true spectrum may be. The method is suitable of automatic computation in digital form. Various examples of the results obtained by means of a Fortran IV program, also given in the paper, are furnished and discussed. [ABSTRACT FROM AUTHOR]

In a previous paper the numerical solution of a particular boundary-value problem for the «weakly linear» equation was obtained and the convergence of a suitable finite-difference scheme was proved. This paper is concerned with the more general equation where; the solution is obtained using the same finite-difference scheme as in the previous paper, and sufficient condition for its convergence are given for this new case [ABSTRACT FROM AUTHOR]

This paper deals with the language PREFOR, an extention of FORTRAN IV which allows to represent with single identifiers sets of data widely arbitrary and of variable length, The language allows to act upon the sets and upon FORTRAN variables by means of programme defined operators. The declarations of the new operands and operators are added to FORTRAN statements as well as executable statements, describing the calculations upon such elements and FORTRAN expressions, and other organizing statements concerning the dynamic storage assignement required by the variable length operands. Furthermore, referring to the characteristics of dynamic storage organization upon which the language is based, the paper shows the rules for the translation of a PREFOR programme into a FORTRAN programme which can be compiled and executed as usual. Finally a programme is described which can perform this translation upon the IBM 7040 and 7090 and the UNIVAC 1108 processors. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Some authors have proved that a minimal two-level NAND or NOR network can be obtained by the convetional procedures for determining minimal normal forms. But when either the complements of some input variables are not available or the gates have a limited number of inputs, the two-level synthesis is generally impossible; and no procedure has been described for the minimal sunthesis of networks having more than two levels of gates. In this paper some new procedures are described for the synthesis of NAND or NOR networks having more than two levels of gates. In the first sections the properties are briefly described, by which a NAND or NOR expression is equivalent to a conventional expression containing only the AND and OR operators; also, the problem of determining a minimal two-level NAND or NOR network is summarized. Then the synthesis of three-level NAND or NOR networks is considered, in case that both the true and complemented values of input variables are available, and the gates can have an unlimited number of inputs (condition 1). A new procedure is described which makes it possible to find one of the minimal NAND or NOR networks, having a tree-shaped structure, and which gives also quasi-minimal solutions for the general case in which the output of a gate can be connected to the inputs of more than one gate of the next level. The procedure derives from the methods described in a preceding paper by the present author for determining the minimal «sums of products of sums» of an assigned function; but some properties and the particular definition of cost make it possible to apply a computation technique, which simplifies this problem considerably. Then the synthesis problem is considered when the gates can have an unlimited number of inputs but the complements of some of the input variables are not available (condition 2). In this case the two-level synthesis is generally impossible (a simple necessary and sufficient condition for a two-level solution to exist is proved); on the contrary, a three-level NAND or NOR network always exists, which implements the assigned function. This network can be determined with the procedure which has been described for determining the minimal three-level networks in condition 1, but the new conditions simplify the problem and a remarkable reduction of the computation work is possible. Lastly the following cases are considered: In these cases a two- or a three-level synthesis may be impossible, but one can always verify whether a two- or a three-level network implementing the assigned function exists. However a simple procedure is described, which always makes it possible to find a quasi-minimal solution characterized by more than three levels of gates. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In questo lavoro si esaminano la stabilità e la convergenza di un procedimento di integrazione numerica per problemi parabolici lineari a coefficienti variabili. Il procedimento è di tipo seriale, cioè viene discretizzata solo la variabile temporale, risolvendo ad ogni passo una equazione differenziale ordinaria con valori agli estremi. Il procedimento è particolarmente adatto per calcolatori di tipo ibrido. This paper takes under examination stability and convergence of a numerical method for the integration of linear parabolic problems with variable coefficients. The method is a serial procedure, i. e. only the time variable is discretized, and at every step it is necessary to solve an ordinary differential equation with boundary values. At the beginning the procedure was thought for hybrid computers. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The Rabins cut-point theorem gives some conditions on acceptance of a probabilistic langnage by a finite state automaton. In the present, paper we will generalize Rabin's results by studying the possibility of reducing a coutext-free or right-linear grammar with infinite non-terminal symbols to an equivalent grammar with a finite number of non-terminal symbols. We will show that reducibility is related to some topological properties of non-terminal symbols, which we will consider as a metric space. Finally, as an application, we will use the above methods in the study of certain classes of weighted languages. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The paper deals with a method for the constrained minimization of a n-variable non-linear function. The method is quite fast to find the minimum also in its neighborhood and therefore it may be used for the solution of non-linear systems. The way to deal with the linear or non-linear constraints makes calculation time reasonable also in difficult problems. The method is essentially based on the local second-order approximation of the objective function (and so it is exact for quadratic functions) and on diagonalization of the associated quadratic form. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper we prove that Dahlquist's definition of stability is adegnate for the differential system is n×n constant matrix with Jordan form not diagonal, but with characteristic roots equal to zero. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Some statements obtained in a previous paper, concerning an estimate of the error in the quadrature formulas of Newton-Cotes, are here considered in more detail. [ABSTRACT FROM AUTHOR]

In this paper procedures are described allowing the calculation of the cutter position at any given time in two axis, contouring, numerically controlled machinetools. It is assumed that input data define the profile being machined and the cutter offsct and feedrate. The profile consists of straight lines and arcs. It is allowed the cutter offset to be redefined during the machining operation. Procedures mainly consist of a staircase approximation of the theoretical tool-path, as defined from the geometry of the profile and the cutter offset. They require only additions, subtractions and comparisons and are intended for implementation by low-cost special purpose computers. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The first part of this paper describes the I.D.S. technique. This allows retrieval, insertion and repeal of informations in a rapid and compact way through chains and levels of records defined as Master and Details. The second part shows a simple application to a typical manufacturing problem. [ABSTRACT FROM AUTHOR]

This paper describes the development of a particular model of a gas transmission system which permits the study of pressure pulsations in reciprocating compressor installations. The validity of the model is confirmed by some experimental tests. *** DIRECT SUPPORT *** A01P1021 00010 [ABSTRACT FROM AUTHOR]

The paper shows an iterative procedure by which, starting from an approximate value of a root, z= x+ jy, of an algebraic equation F(z)=0, a sequence of values { z} is obtained, aproximating the corresponding exact root; under certain conditions. The method is based upon the well known «regula falsi» for functions of two variables. [ABSTRACT FROM AUTHOR]

The techniques mentioned in this paper have been developed at CERN as part of the extensive changeover to computerized data handling which has occurred over the last few years in particle physics. The role of modern digital computers in a High Energy Nuclear Physics laboratory is briefly reviewed and the remarkable degree of automation achieved in the design and evaluation of spark chamber experiments is emphasized. In particular, methods for automatic interpretation of photographic information and on-line acquisition of experimental data are discussed. [ABSTRACT FROM AUTHOR]

The paper deals with the application of the Rutishauser's QD-algorithm to the evaluation of special functions in automatic computing, through the transformation of the partial sum of a power series into a convergent of the corresponding continued fraction. Results of numerical experiments are given and discussed both for elementary functions (which lend themselves to a fairly unifed treatment) and for various higher functions, for some of which a continued fraction expansion is not previously known. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The analysis of the dynamic behaviour of nuclear reactors requires the solution of the space time multigroup neutron diffusion equations which form a system of partial differential equations of parabolic type. Using the method of «lines», the problem is reduced to finding the solution of an ordinary matrix differential equation. Some numerical methods commonly used have been tested and the results compared. These approaches require, at each time step, the solution of a large system of linear equations. To this end, iterative methods are used and, to have acceptable running times, the choice of a convenient scheme is an important question. In this paper a non linear iterative procedure described by Wachspress is considered. This method is based on a variational acceleration procedure which is periodically applied to an otherwise conventional linear iteration. Illustrative results and numerical comparisons with some widely used iterative methods are given. [ABSTRACT FROM AUTHOR]

This paper describes a program for computer-aided design of digital systems. The implemented algorithm translates a system description written in a transfer language into a set of flow-tables, each one representing a sequential circuit of the system. The translation algorithm has been mechanized by a program written in the LISP 1.5 language. The output consists of a flow-table describing the system control unit and, in a concise form, of a set of flow-tables representing the processing unit of the system. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper describes the main features of a FORTRAN program, called SIC, which simulates the behavior of an hypothetical digital computer (CADIGE) used for didactical purposes in the computer science course offered to the electronic engineering students at the Università di Genova, Genoa, Italy. [ABSTRACT FROM AUTHOR]

In this paper the Author gives a method of solving numerically the problem: in λ and y ( x) unknowns, where ( x , y ), and ( x , y ), are the coordinates of two given points. [ABSTRACT FROM AUTHOR]

In dealing with some important problems of hydraulic engineering one needs to compute the integral which appears below. In this paper the Author gives a formula for this computation: the result is achieved more rapidly and with closer approximation than by classical methods. Furthermore, the asymptotic behaviour of the integral, when λ diverges, is studied. [ABSTRACT FROM AUTHOR]

In this paper we get three formulas to compute Fourier integral. The formulas are essentially a linear combination of values of the function f(t) with weight coefficients, which are independent of the f(t) and of the parameter ω. The formulas are obtained by means of a polinomial approximation of f(t) on each interval ( kmτ, ( k+1) mτ) where m is an integer and τ is the period of the trigonometric function. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper is described one general procedure of planing, based on this characteristics: The method has, in general, a good rate of convergency. [ABSTRACT FROM AUTHOR]

This paper deals with the choice of the investments by the utility principle. The problem is solved by the dinamic programming method assuming that the investments give random profits stochastically indipendent. [ABSTRACT FROM AUTHOR]

In this paper a program is described for the reduction of the astronomical time and azimuth observations. The program is based on the Mayer's formula and allows a separate computation of the clock correction and instrumental azimuth. As regards this last quantity the program foresees three interesting procedures for the utilization of each observed azimuth utilising polar or equatorial stars. Besides by means of this program is possible to utilise the valnes of the time transit obtained by a totalizator chronograph. The various approximations introduced in the program are discussed, putting in evidence the great accuracy of the program. [ABSTRACT FROM AUTHOR]

It is well known how investments, put into an economic system, wear out, so that after a certain time they finish. If we make an apt hypothesis, the rythm according to which the investments are put into the system determines the rythm according to which the investments are put into the system determines the rythm according to which these investments finish. It is easy to understand the meaning assumed by the ratio between the rithm according to which the investments, put into an economic system, finish and the rithm according to which these investments are put into the system. Because of its meaning, such a ratio is named growth ratio. The aim of this paper is to find out the rythms of investment, and hence of amortization, which implicate a pre-established course to the growth ratio. Such being the case we must observe that the knowledge of these rythms is necessary when the activities of the economic system need to be planned. [ABSTRACT FROM AUTHOR]

Recently, by using the method of dynamic programming, M. Volpato determined a policy of minimized costs to supply many destinations from a single source, the transport costs being functions (linear or not linear) which satisfy only the condition of inferior semi-continuity. Among the feasible policies he admitted also the indireact shipping from source to destination (i.e. a policy, where a larger quantity than required is sent to certain destination, and the surplus is delivered to a destination which follows it in a given order). In this paper the problem is studied for the case in which there is more than one source, and the availability of every source is limited. In this case it is possible to consider the problem as a multi-stage process, and to solve again it by the method of dynamic programming. [ABSTRACT FROM AUTHOR]

In this paper a process is suggested for the numerical approximation of the complex roots equations. [ABSTRACT FROM AUTHOR]