نتایج جستجو برای: pascal

تعداد نتایج: 4229  

Journal: :Behavior Research Methods & Instrumentation 1983

Journal: :Courrier du Centre international Blaise Pascal 2002

Journal: :Courrier du Centre international Blaise Pascal 1989

Journal: :LittéRéalité 2008

Journal: :Applied Mathematics and Computation 2016

Journal: :Softw., Pract. Exper. 1981
Per Brinch Hansen

This paper describes the considerations behind the design of the programming language Edison (Brinch Hansen 1981). Edison is deeply influenced by the advances made by Pascal (Wirth 1971) and its successors Concurrent Pascal (Brinch Hansen 1975) and Modula (Wirth 1977). In my attempt to learn from these previous efforts and improve on them I had to focus on both the virtues and defects of these ...

2009
Toru Nakahara T. Nakahara

In this article we shall give a survey of Hasse’s problem for integral power bases of algebraic number fields during the last half of century. Specifically, we developed this problem for the abelian number fields and we shall show several substantial examples for our main theorem [7] [9], which will indicate the actual method to generalize for the forthcoming theme on Hasse’s problem [15].

2004
Ashkan Ashrafi Peter M. Gibson

An involutory upper triangular Pascal matrix Un is investigated. Eigenvectors of Un and of UT n are considered. A characterization of Un is obtained, and it is shown how the results can be extended to matrices over a commutative ring with unity. © 2004 Elsevier Inc. All rights reserved.

1999
Jiri Kadlec

Implementation of floating point algorithms in FPGA (Field Programmable Gate Arrays) creates an open problem. One of possible solutions is the representation of floating point numbers as an integer (fixed point) logarithm (32 bit) [1]. Basic arithmetical operations can be performed in the logarithm numbering system which is suitable for FPGA and ASIC implementation. Simulator of such system has...

1996
William F. Klostermeyer Michael E. Mays Lubomir Soltes George Trapp

In general, we shall start with one 1 in the first row and three l's in the second row. The recurrence then determines the subsequent rows. The first few rows of the rhombus are given in Figure 2. We assume all blank positions are zero. So, for example, when calculating the second entry in the third row the two zeros are assumed to be up two places and up one and to the left. We call this array...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید