StrSecII is a collection of security related components and routines for Delphi4, Delphi5, Delphi6 and Delphi7. It will give yoyu some of the fastest set of routines and classes for public and symmetric key cryptography available for Delphi. The integrated ASN.1 support allows you to build your own X.509 certificates in native Delphi code, as well as defining your own cross-platform data format. Some features are:
Native Delphi...
Polynomial division by convolution.
Calculate inverse Z-transform -- (Polynomial division) - Up to K terms,
q(z) = b(z)/a(z), where b(z)=b(0)+...+b(k)/z^k +...+b(n)/z^n. a(z)=a(0)+...+a(k)/z^k...
The integer square root function, or isqrt, is equivalent to floor(sqrt(x)) for non-negative x. For small x, the most convenient way to calculate isqrt is by calling int(x**0.5) or int(math.sqrt(x)), but if x is a large enough integer, the sqrt...
This is a very simple look-up based method for converting integer to binary string. In my tests, using 'timeit', its the fastest around. And with increasing value of input decimal number, it surpases any 'run time computation' based method doing...
This routine implements Hankel transforms of integer order based on a Fourier-Bessel series expansion. The algorithm is based on a recently published research work:
M. Guizar-Sicairos and J. C. Gutierrez-Vega, Computation of...
Solves the mixed integer linear problem:
min c'*x
s.t. A*x <= b s.t. Aeq*x == beq s.t. lb <= x <= ub x(yidx) integer
where yidx is a logical index vector.
This program solves...
This function solves the mixed integer linear programming problems. It uses the linprog.m function that comes with the optimization toolbox of MATLAB. It employs the branch and bound algorithm. It uses depth first search
A very simple random integer generator using rand(). [just for educational purpose ;) !!]
Solves the mixed integer nonlinear problem:
min p(x,y)
s.t. f(x,y)
While programming an IPv4-Range class I stumbled upon the need for an efficient integer set type, which doesn't store individual items like the builtin set type does, but which only stores longs and ints, and does this in a run length encoded way...
An iterative equivalent to the recursive function given in the recipe "Generator for integer partitions" by David Eppstein.
Uses the representation
7 = 17 = 16 + 11 = 15 + 12 = 15 + 2*1 = ...
A quick function to comma separate thousands in an integer or float.
This is a fairly simple code that determines whether the integer you will enter is odd or even.
Based on your choices, by the questions asked by the program, the ouput background and foreground will change.
Simple frequency division multiplexing simulation.
It takes the input in the form of two Polynomials and output in the form of Quotient . The Quotient's are stored in an array. We can also specify, that how many times the synthetic Division is required.
Function to solve the Minimum Perfect Matching on non-biparite graphs problem using Integer linear programming.
Returns vector of matched indices and cost of the match. Requires symmetric adjacent matrix of even rank.
NUM2ABC(X), where X is an integer, returns a string corresponding to the column label commonly employed by spreadsheet programs, such as Microsoft Excel.
Example: x = 45; num2abc(x);
ans = AS
any floating point number is separated into two parts i) integer ii)floating point for ex if x=-12.93 the program gives -12 and .93 as the two outputs format:[p,q]=truncate(x); where x is a floating point number
Within a sigma range separable filters with integer parameters are sought. The filters have a sum which is an integer power of 2 in order to divide the filter result by shifting the bits.
Its a simple rice coder, requires input integer and the bits size of the integer along with the K value! |