Objective: Shortest Distance Path between 2 Points.
Step: Select 2 Points to get Shortest Distance Path between them.
Intro: Background Image "Andhra Pradesh" is a state in India for which the major district Capitals (only) are defined.
Note 1: "Loop" is to view the possible Route Connection Definitions. Note 2: "Travel" is used to Define 2 Points to view Optimum Path.
SC - Sparse Classifier FSC - Fast Sparse Classifier GSC - Group Sparse Classifier FGSC - Fast Group Sparse Classifier NSC - Nearest Subspace Classifier
Requires SPGL1 - http://www.cs.ubc.ca/labs/scl/spgl1/
Gaussian kernel regression and local linear Gaussian kernel regression with variable window width This is the same as ksr and ksrlin (file File ID: #19195 and #19564), but instead of using the same bandwidth for each point, it uses a variable...
Measures of Analysis of Time Series (MATS) toolkit computes a number of different measures of analysis of scalar time series (linear, nonlinear and other statistical measures). It also contains pre-processing tools (transformations and...
The solution of the nearest correlation matrix applies the hypershpere or spectral decomposition methods as outlined in Monte Carlo methods in Finance by Peter Jackel, Chapter 6.
Use CorrelationExample.m that applies a simple example...
Computes cross- or auto-correlograms between two discrete time series, supplied as a list of timestamps.
[tsOffsets, ts1idx, ts2idx] = crosscorrelogram(ts1, ts2, window)
INPUTS: ts1 - a list of timestamps (in seconds) to...
The fitting of smooth curve through a set of data points and extention to this is the fitting of 'best fit' spline to a large set of data points which show the cerrent trend but which do not all lie above the curve. The method involves cluster...
Using Nearest Neighbor-, Linear-, or Bicubic- Interpolation
Price gun is a bulk price updater utility for Drupal ecommerce. It provides a user interface for easy price updates across an entire product type; for example increase all prices by 1%, rounding fractions up to the nearest currency unit.
This file obtain a Mann-Whitney's U of two random variables with continuous cumulative distribution associated to a p-value. This procedure is highly recommended for sample sizes 7< nx and ny <=40. For nx and ny <=7 it is recommended to...
This method produces different results depending on what city is choosen as the starting point.
This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes.
When drawing financial time series from various markets, one usually needs to make some adjustments before evaluating the series. One of the major concerns is that due to different national holidays or working days across countries, the dates...
I was playing the game Scramble on my iPod touch, and I realized that I wasn't very good. But the algorithmic challenge of writing a program to solve the Scramble (same as Boggle) game was too tasty to pass up. It was indeed quite challenging, but...
Edit a graph or draw a new one with this GUI.
Usage: >> graph_gui; or >> graph_gui(A,xy); Controls: Use the radio buttons to select an action: 1. To DRAW a new VERTEX, select 'Draw' and...
This program implements various interpolation techniques to resize 2D matrices or Image Matrices. Methods of interpolation used are 1) Nearest Neighbour 2) Bilinear 3) Bicubic 2x2 4) Bicubic 4x4 5) Bicubic 6x6 6)...
Note: the D7 version of this module is currently being heavily refactored and is not yet suitable for production use.
Storage API is a framework for enterprise-level file storage and serving / streaming.
It has the following...
The k-means algorithm is widely used in a number applications like speech processing and image compression.
This script implements the algorithm in a simple but general way. It performs four basic steps.
1. Define k arbitrary...
Rounds off a datenum to the nearest second, minute, hour, day, month or year. Zip file includes "units.m" (file 4093) by Henning Ressing.
Example: datenum_round_off(now, 'minute')
http://simulations.narod.ru/ The task is to pack big box with several small boxes. The objective is to maximize total area of all small boxes. I made fitness in follow way: it is area minus penalty in case of overlapping small boxes also...
Implementation of Nicholas J. Higham's algorithm "Computing the Nearest Correlation Matrix - A Problem from Finance", 2002.
http://eprints.ma.man.ac.uk/232/01/covered...S_ep2006_70.pdf |