This article formalizes the amortized analysis of dynamic tables parameterized with their minimal and maximal load factors and the expansion and contraction factors. A full description is found in a companion paper [1]. theory Tables-real imports ../Amortized-Complexity/Amor begin fun Ψ :: bool ⇒ real ⇒ real ⇒ real ⇒ real ⇒ nat ⇒ real where Ψ b i d x 1 x 2 n = (if n ≥ x 2 then i∗(n − x 2) else ...

Main memory database management systems have become essential for response-time-bounded applications, such as those in telecommunications systems or Internet, where users frequently access a table in order to get information or check whether an element exists, and require the response to be as fast as possible. Continuous data growth is making it unaffordable to keep entire relations in memory ...

We present a new technique for the fast computation of near-monochromatic atmospheric transmittances in the infrared, utilizing compressed lookup tables, that is well suited for nadir viewing satellite and airplane observations. The algorithm is very simple to use in radiative transfer codes and is easily adapted to provide analytic Jacobians of radiances. A Singular Value Decomposition (SVD) i...

We previously developed the first method to predict real valued accessible surface area in proteins, which was shown to contain more information than 100% correct predictions in a binary space of exposure states. Neural networks used for solvent accessibility predictions, however work as good predictors with invisible modeling of knowledge they learn. In view of this a direct statistical analys...

Among many existing algorithms, convergence methods are the most popular means of computing square root and the reciprocal of square root of numbers. An initial approximation is required in these methods. Look up tables (LUT) are employed to produce the initial approximation. In this paper a number of methods are suggested to reduce the size of the look up tables. The precision of the initial a...