Search Results for "zero"

...The user disposes of a graphical interface to control the program and modify conveniently some parameters, like the XY-scales, the XY map area, the Julia seed for the complex series iteration of Z(n+1)=Z(n)^2+a, being Z(0)=(X0,Y0) the seed, and "a in XY" the points to be calculated. The user can enter (among other parameters) the desired convergence-radius R for the series, and/or the number of maximal iterations N for the generator-equation in Z.

...Example: instead of building a class to hold a header and then data, represent all of that as Bits, subranges of them, and ints for sizes of its parts. Expansion ability for other kinds of compression, since Bits is a Java interface. Main functions on bits are substring, concat, number of 0 or 1 bits, and number of bits (size). All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix.

...Basically this is related to the computation of the distribution of k co-occurrences of spatial events (generalising the contiguity distributions - 2 co-occurrences at distance 0) to derive spatial clustering statistics (mainly using the Shannon entropy, then called the k-spatial entropy) and methods linked to this: SOOk, SelSOOk (see caGEO paper) and scankOO (see TGIS). Another method (CAkOO) performing a k-Correspondence Analysis (i.e. on a multiway table with k entries) on the contingencies of co-occurrenceshas been already "published in my JSS paper about another R package: PTAk. ...