This program demonstrates some function approximation capabilities of a Radial Basis Function Network.
The user supplies a set of training points which represent some "sample" points for some arbitrary curve. Next, the user specifies the number of equally spaced gaussian centers and the variance for the network. Using the training samples, the weights multiplying each of the gaussian basis functions arecalculated using the pseudo-inverse (yielding the minimum Least-squares solution). The resulting network is then used to approximate the function between the given "sample" points.
平均因子分解法，適用于正定矩陣First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
(1) U U = X
(2) U is upper triangular (that is, it has all zeros below the diagonal).
It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition.
his project was built and tested with WinAVR-20060125.
Make sure the MCU target define in the Makefiles corresponds to the AVR you are using!!
To build the code, just install WinAVR and run "make" from the console in echomaster and
echoslave subdirs.
"make program" will program the device if you have a AVRISP attached.
Remember to set the AVR device to at least 8MHz. The AVR may use the programmable clock
from MC1319x, just remember to check if the MC1319x and SPI communication is working FIRST!
Otherwise you wont get any clock signal to the AVR and then you can t program it or reset
the fuses!
The MC1319x has default clock output of 32kHz so you will have to set your programmer to
a very low frequency (<=32kHz/4) to be able to program it while it is running on that!
A fast customizable function for locating and measuring the peaks in noisy time-series signals. Adjustable parameters allow discrimination of "real" signal peaks from noise and background. Determines the position, height, and width of each peak by Least-squares curve-fitting.
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
Chessboard Cover,On a chessboard，only one square is different, called specific.Use the Divide-and-Conquer methods to solve the Chessboard Cover Problem.
This unit uses an array of bytes to represent a LARGE number. The number is binairy-stored in the array, with the Least Significant Byte (LSB) first and the Most Significant Byte (MSB) last, like all Intel-integer types.
