Freeware Listing: Minimum
- Minimum Perfect Matching Tool
- License: Freeware

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. function [ indices, cost ] = min_perfect_matching( G ) Function _requires_ integer linear programming tool "mixed-integer LP" by Sherif Tawfik, available at: http://www.mathworks.com/matlabcentral/fil...ixed-integer-lp.
- Publisher: Vojtech Knyttl
- Date: 27-05-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Simple three-point minimum estimation
- License: Freeware

Calculate minimum of single variable function using 3-point search Usage: estimated_min=three_point(sfun,a,b,tolerance) sfun: Symbolic/String function a: Inferior Limit b: Superior Limit tolerance: Tolerance Range.
- Publisher: Gabriel Alcantara
- Date: 20-02-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Java Minimum Cost Finder
- License: Freeware

Java Minimum Cost Finder is designed as an accessible, handy and Open Source algorithm that can help you find the lowest cost.
Java Minimum Cost Finder was developed in the Java programming language and can run on multiple platforms.
.
- Publisher: idorluyklelfcew
- Date:
- Platform: WinOther
- Finding Minimum Integer Weights
- License: Shareware

Finding Minimum Integer Weights was developed as a simple, accessible and very easy-to-use minimum Integer weight calculator.
All you have to do is input your parties, select the algorithm you want to use, type the time limit and press the "Solve" button.
.
- Publisher: Aaron Strauss
- Date:
- Platform: WinOther
- Statistical Calculator
- License: Freeware

Statistical Calculator calculates minimum, maximum, mean, median, mode, percentage unique, range, midrange, standard deviation, quartiles and more..
- Publisher: scatterchart.com
- Date: 23-02-2013
- Size: 10 KB
- Platform: CGI and Perl, Scripts
- swffit
- License: Freeware

swffit (formerly know as FitFlash) is a smart script that resizes your flash movie automatically if your browser window size is smaller or greater than your flash minimum desired size keeping it accessible independent of screen resolution. swffit automatically resizes your flash to 100% width and 100% height (full bleed) when your browser window is greater than the minimum desired size and resizes flash to the minimum desired size when the browser window is smaller... It can also resize the flash movie to a maximum size if the browser window size is greater than the maximum size....
- Publisher: Miller Medeiros
- Date: 10-02-2013
- Size: 205 KB
- Platform: Flash, Scripts
- Validation (password)
- License: Freeware

Validation (password) script checks for a minimum length and invalid characters in a password. It also validates the password comparing the strings from two text boxes..
- Publisher: Russ Swift
- Date: 11-04-2013
- Size: 102 KB
- Platform: JavaScript, Scripts
- percolation
- License: Freeware

2D and 3D square matrices for counting straight-line (minimum length) percolation. Collision count is also shown. Useful for lattice structure transport calculations in condensed matter physics. Also network theory, communication, disease transmission, and failure rate. See also en.wikipedia.org/wiki/Percolation and mathworld.wolfram.com/PercolationTheory.html.
- Publisher: ben payne
- Date: 25-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- PERFORMANCE ANALYSIS OF SYMBOL/CHIP BASED MINIMUM
- License: Freeware

Current direct sequence code division multiple access (DS-CDMA) system suffer from Multiple access interference (MAI) and Inter symbol interference (ISI) due to the frequency selective channel. This interference can be avoided by use of Adaptive Beamforming. There are two different minimum variance Beamformer configurations for the base station receiver in direct sequence code division access (DS-CDMA) systems, namely a chip- based and a symbol-based configuration. In this paper chip- based and symbol- based configurations are studied. In symbol-based configuration, spatial diversity is exploited after despreading and interfering components are rejected, based on both their power and code correlation with the Signal of interest (SOI).
- Publisher: Paramasivam Karpagavalli
- Date: 01-06-2013
- Size: 31 KB
- Platform: Matlab, Scripts
- Euclidiance Distance Minimum for QAM
- License: Freeware

This program to detects received signal from system that use QAM as modulator. Euclidiance Distance Minimum gets/decides signal based on minimum distance from the others..
- Publisher: Rustam Efendi
- Date: 05-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- golden section method algorithm
- License: Freeware

Golden section method - searching for minimum of the function on given interval files: golden.m - main algorithm, computing minimum on interval f.m - given function - file to modify by the user!.
- Publisher: Katarzyna Zarnowiec
- Date: 10-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Minimum Enclosing Circle
- License: Freeware

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 algorithm but only in the structure. The previous code was written based on the very nice Java applet found here: http://heyoka.cs.uiuc.edu/~thite/mincircle/ Credit are due mainly to author of the applet..
- Publisher: Frank Staals
- Date: 10-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Minimum Description Length
- License: Freeware

Returns Rissanen's Minimum Description Length. Requires System Identification toolbox. Call it like built-in functions aic(m) and fpe(m). Use MDL like AIC or FPE to compare models of different complexities. Choose model with lowest MDL or AIC or FPE. Pintelon & Schoukens (2001) pp. 329,550 say MDL is better than AIC; AIC tends to select a too-complex model. Example: Compute & print MDL and AIC for an AR model of order 10. Data=iddata(y,[],1/Fs); m_fb=ar(Data,10,'fb'); fprintf('MDL=%.3d; AIC=%.3fn',mdl(m_fb),aic(m_fb)); William C Rose 2007-06-05..
- Publisher: William Rose
- Date: 27-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Simple example of the Simplex Method
- License: Freeware

It's a function that finds the minimum value of a two variables objective function with a deterministic zero order algorithm: simplex method. The input variables are: -fun: inline function of the objective function -init_point: initial point for the simplex method -step_size: initial dimension of the simplex toll: tolerance for the stop criterion on the simplex dimension -numMaxIter: stop criterion on the maximum number of iterations The output variables are: -valFunc: the minumum value of the objective function -var_min: the minimum point -iter: the number of iteration made %%%%%%%% IMPORTANT %%%%%%%%%%% To run correctly the Matlab function, you must run first a contour plot of the objective function.
- Publisher: Andrea Cirillo
- Date: 03-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Minimum Entropy Deconvolution (MED 1D and 2D)
- License: Freeware

This is the iterative 2D Minimum Entropy Deconvolution implemented according to an iterative method in the original paper: R.A. Wiggins, Minimum Entropy Deconvolution, Geoexploration, vol. 16, Elsevier Scientific Publishing, Amsterdam, 1978. pp. 21 35. This also works applying the 1D MED when supplied just a single row/column 'x' input. This technique has wide-ranging applications ranging from fault detection to geophysics. It generates a single 1d finite impulse response filter to minimize the entropy of each column filtered by the filter, and is typically applied to extract impulse-like features from signals.
- Publisher: Geoff McDonald
- Date: 08-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Minimum Volume Enclosing Ellipsoid
- License: Freeware

[A , c] = MinVolEllipse(P, tolerance) Finds the minimum volume enclosing ellipsoid (MVEE) of a set of data points stored in matrix P. The following optimization problem is solved: minimize log(det(A)) s.t. (P_i - c)'*A*(P_i - c)<= 1 in variables A and c, where P_i is the i-th column of the matrix P. The solver is based on Khachiyan Algorithm, and the final solution is different from the optimal value by the pre-specified amount of 'tolerance'. --------------------------- Outputs: c : D-dimensional vector containing the center of the ellipsoid. A : This matrix contains all the information regarding the shape of the ellipsoid.
- Publisher: Nima Moshtagh
- Date: 23-01-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Hungarian Algorithm
- License: Freeware

This algorithm allows you to find the minimum weight matching of a bipartite graph. The graph can be of arbitrary size and connectedness. The edge weights are captured by a MxN weight matrix where an infinite(Inf) weight designates that that pair of vertices given by that position are not connected..
- Publisher: Alexander Melin
- Date: 23-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- superviewshed : Optimized LOS and Minimum Height Observable Tool
- License: Freeware

Superviewshed will calculate LOS of a referenced terrain matrices given observer and target altitudes. In addition, the standard minimum height observable of the terrain will be output. Runs approximately 16 times faster than viewshed..
- Publisher: chris hinkle
- Date: 16-05-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Bidirectional Branch and Bound Minimum Singular Value Solver (V2)
- License: Freeware

B3MSV Bidirectional Branch and Bound(B3) subset selection using the the Minimum Singular Value (MSV) as the criterion. Consider the following subset selection problem: Given a tall (m x n, m>n) matrix, A, to find n rows of A such that the resulted n x n square submatrix has the largest MSV among all possible n x n submatrices. This problem has many applications, where one wishes to square down a non-square matrix to get a well-posted problem (non-singular, hence maximizing the MSV). This problem has been studied in Linear Algebra for many decades. Many intuitive solutions have been proposed either analytically or numerically.
- Publisher: Yi Cao
- Date: 14-05-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Condor Optimizer
- License: Freeware

CONDOR is a new optimizer whose aim is to find the minimum x* of an objective function F(x) (x is a vector whose dimension is between 1 and 150) using the least number of function evaluations of F(x). It is assumed that the dominant computing cost of the optimization process is the time needed to evaluate the objective function F(x) (One evaluation can range from 1 seconds to 2 days)..
- Publisher: Frank Vanden Berghen
- Date: 17-01-2013
- Size: 164 KB
- Platform: Matlab, Scripts
Minimum: Freeware | All








