The Fuzzy Clustering and Data Analysis Toolbox is a collection of Matlab
functions. Its propose is to divide a given data set into subsets (called
clusters), hard and fuzzy partitioning mean, that these transitions between
the subsets are crisp or gradual.
Summary: Newton-Raphson method for all real roots of the polynomial.
MATLAB Release: R11
Description: This M-file calculates all the real roots of the given polynomial. It calls syn_division, a synthetic division function, and derivate, differentiation function.
k-meansy算法源代碼。This directory contains code implementing the K-means algorithm. Source code
may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS
program accepts input consisting of vectors and calculates the given
number of cluster centers using the K-means algorithm. Output is
directed to the screen.
This function obtains a unitary matrix Q such that: d=diag(Q *diag(lmd)*Q).
In other words, it gives a way to generate a matrix with given eigenvalues and diagonal elements.
By Daniel Perez Palomar (last revision: May 10, 2004).
Feel free to distribute this file as it is (without including any modifications).
北京大學ACM比賽題
The game of Scrabble is played with tiles. A tile either has a single letter written on it, or it is blank. In the latter case, the tile may be used to represent a letter of your choice. On your turn, you arrange the tiles to form a word. Each tile may be used at most once, but not all tiles need to be used. given several Scrabble tiles and a dictionary, determine how many words in the dictionary can be formed using the given Scrabble tiles.
北京大學ACM比賽題目
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries.
/*
* The internal form of a hash table.
*
* The table is an array indexed by the hash of the key collisions
* are resolved by hanging a linked list of hash entries off each
* element of the array. Although this is a really simple design it
* isn t too bad given that pools have a low allocation overhead.
*/
split from apache for general usage
Obtain the CDF plots of PAPR from an OFDM BPSK transmission specified per IEEE 802.11a specification
Per the IEEE 802.11a specifications, we 52 have used subcarriers. given so, the theoretical maximum expected PAPR is 52 (around 17dB). However, thanks to the scrambler, all the subcarriers in an OFDM symbol being equally modulated is unlikely.
Using a small script, the cumulative distribution of PAPR from each OFDM symbol, modulated by a random BPSK signal is obtained
Matrix Transposition and Multiplication
It is a MIPS assembly program that does the following: given two matrices, M1 and M2, first transpose M2 to obtain M2tran. Then multiply M1 and M2tran.
Image Compression
A collection of simple routines for image compression using different techniques.
圖象壓縮的不同方法
BTCODE:
Image compression Using Block Truncation Coding.
PYRAMID:
Image compression based on Gaussian Pyramids.
DCTCOMPR:
Image compression based on Discrete Cosine Transform.
IMCOMPR:
Image compression based on Singular Value Decomposition.
The given codes can be also used in 2D noise suppression.
Notes:
The function "conv2fft" performs a 2D FFT-based convolution.
Type "help conv2fft" on Matlab command window for more informations.
