Elite is a complete administration interface which allows webmasters or webowners to maintain their clients and reseller. Webmaster can determine what are the features for reseller and their clients. It has enhanced features like, built-in administrator management feature, built-in reseller admin management, built-in help section, database creation for end user, subdomain creation, all activities of users are logged and more. It can be easily...
This code outputs the distance between 2 GPS points showing also the vertical and horizontal bearing between them. This code was originally made for an Automatic Tracking Antenna Aimer. If you find it useful please take note of the owner. If you...
3d Surface fitting to N random points. It draws the surface by converting z values to RGB colors.
Implementation of Haversine formula for calculating distance between points on a sphere. Given geographic coordinates, returns distance in kilometers.
Calculates distance in kilometers from points saved in .kmz file. Such files can be created by Google Earth
This module provides 3 ways of detecting which objects have been allocated (methods 1 and 3) or became un-reclaimable (method 2) between 2 points in the code. It can be very useful to detect memory leaks (eg. cycles involving objects with a...
This simple code calculates the convex hull of a set of 2D points and generates EPS files to visualise them. The algorithm was taken from a textbook on Computional Geometry.
The GMM returns the cluster centroid and cluster variances for a family of points if the number of clusters are predefined. The centroid and variance can then be passed to a Gaussian pdf to compute the similarity of a input query point with...
OOK - On Off Keying, This is the Basic ASK Modulation , and remember to transmit at least (100/BER(theoretical)) data points
Add, move and delete points to form a desired spectral curve. The result can be saved to workspace as linear or minimum phase FIR.
This is the fastest (though not most accurate) method of fitting a circlle to data points on a plane (given by their xy-coordinates). It returns the circle center (a,b) and radius R. It was proposed by I. Kasa in article "A curve fitting...
This code takes an input of a set of given (x,y) points in the Cartesian coordinates and returns the center and radius of the minimum circle enclosing the points.
This code is based on that of Yazan Ahed, and contains no changes in the...
Study of heat transfer and temperature of a 1x1 metal plate heat is dissipated through the left right and bottom sides and emp at infinity is t n(n-1) points in consideration, Temperature at top end is 500*sin(((i-1)*pi)/(n-1)
Run the file main.m and everything works fine. The matrix A contains the data points and it can be changed in the file inputfile.m
Creates a 1,2 or 3 dimensional probability distribution supported on user-supplied lattice points subject to linear and moment constraints. A trite financial example is provided.
This functions uses GRIDDATA to interpolate pixel values from scatterred points on a head image. A reference image can be used to interactively select point locations from the 10/20 international system (EEG electrode position). Options for...
Fits an ellipsoid into a 3D set of points, allows some constraints, like orientation constraint and equal radii constraint. E.g., you can use it to fit a rugby ball, or a sphere. 'help ellipsoid_fit' says it all. Returns both the algebraic...
In the one point-system, we suppose a optimum tetrahedral volume and this volume should be contain maximum points in the selected point-system. Extarly, this tetrahedral volume's of boundary conditions should be depend only four-node in...
isParetoSetMember returns the logical Pareto membership of a set of N points in K dimensions. It takes as input a N-by-N matrix and return a N-binary-array, denoting for each of the N points, whether it is Pareto (1) o not (0).
The...
VERT2CON - convert a set of points to the set of inequality constraints which most tightly contain the points; i.e., create constraints to bound the convex hull of the given points
[A,b] = vert2con(V)
V = a set of points,... |