This Two-Category Classifier Using Discriminant Functions to
separeate two classes. The Classifier is designed on classes which
has two feature VectorS and other case it has one feature vector.
PlotSphereIntensity(azimuth, elevation)
PlotSphereIntensity(azimuth, elevation, intensity)
h = PlotSphereIntensity(...)
Plots the intensity (as color) of a number of points on a unit sphere.
Input:
azimuth (phi), in degrees
elevation (theta), in degrees
intensity (optional, if not provided, a green sphere is produced)
All inputs must be VectorS or matrices of the same size. Data does not have to be evenly spaced. When there aren t enough points to draw a smooth sphere, additional points (with color) are interpolated.
Output:
h - a handle to the patch object
The axes are also plotted:
positive x axis is red
positive y axis is green
positive z axis is blue
％ EM algorithm for k multidimensional Gaussian mixture estimation
％
％ Inputs:
％ X(n,d) - input data, n=number of observations, d=dimension of variable
％ k - maximum number of Gaussian components allowed
％ ltol - percentage of the log likelihood difference between 2 iterations ([] for none)
％ maxiter - maximum number of iteration allowed ([] for none)
％ pflag - 1 for plotting GM for 1D or 2D cases only, 0 otherwise ([] for none)
％ Init - structure of initial W, M, V: Init.W, Init.M, Init.V ([] for none)
％
％ Ouputs:
％ W(1,k) - estimated weights of GM
％ M(d,k) - estimated mean VectorS of GM
％ V(d,d,k) - estimated covariance matrices of GM
％ L - log likelihood of estimates
％
The CoinUtils project is a collection of open-source utilities developed and used by a variety of other projects in the COIN-OR repository. The project includes classes for storing and manipulating sparse matrices and VectorS, performing matrix factorization, parsing input files in standard formats, building representations of mathematical programs, comparing floating point numbers with a tolerance, performing simple presolve operations, and warm starting algorithms for mathematical programs, among others.
CppReference
對于c/c++的詳盡說明
C/C++ Reference
General C/C++
Pre-processor commands
Operator Precedence
Escape Sequences
ASCII Chart
Data Types
Keywords
Standard C Library
Standard C I/O
Standard C String & Character
Standard C Math
Standard C Time & Date
Standard C Memory
Other standard C functions
All C Functions
C++
C++ I/O
C++ Strings
C++ String Streams
Miscellaneous C++
C++ Standard Template Library
C++ Algorithms
C++ VectorS
C++ Double-Ended Queues
C++ Lists
C++ Priority Queues
C++ Queues
C++ Stacks
C++ Sets
C++ Multisets
C++ Maps
C++ Multimaps
C++ Bitsets
Iterators
All C++ Functions
The files in this directory comprise ANSI-C language reference implementations
of the CCITT (International Telegraph and Telephone Consultative Committee)
G.711, G.721 and G.723 voice compressions. They have been tested on Sun
SPARCstations and passed 82 out of 84 test VectorS published by CCITT
(Dec. 20, 1988) for G.721 and G.723. [The two remaining test VectorS,
which the G.721 decoder implementation for u-law samples did not pass,
may be in error because they are identical to two other VectorS for G.723_40.]
Description The MUSIC algorithm, proposed by Schmidt, first estimates a basis for the noise subspace and then determines the peaks the associated angles provide the DOA estimates.
The MATLAB code for the MUSIC algorithm is sampled by creating an array of steering VectorS corresponding to the angles in the vector angles.
密碼學界牛人Victor Shoup用C++編寫數論類庫。
NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for VectorS, matrices, and polynomials over the integers and over finite fields and for arbitrary precision floating point arithmetic.
NTL provides high quality implementations of state-of-the-art algorithms for:
* arbitrary length integer arithmetic and arbitrary precision floating point arithmetic
* polynomial arithmetic over the integers and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, computation of minimal polynomials, traces, norms, and more
* lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev
* basic linear algebra over the integers, finite fields, and arbitrary precision floating point numbers.
