-
Description: S-ISOMAP is a manifold learning algorithm, which is a supervised variant of ISOMAP.
Reference: X. Geng, D.-C. Zhan, and Z.-H. Zhou. Supervised nonlinear dimensionality reduction for visualization and classification. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 2005, vol.35, no.6, pp.1098-1107.
標簽：
Description
supervised
algorithm
S-ISOMAP
上傳時間：
2015-04-10
上傳用戶：wfeel
-
學生信息查詢系統(tǒng)C語言實現(xiàn)
包含的功能有:
1、 系統(tǒng)功能選擇菜單：提供了5個功能
A、 按“班級＋平均成績”顯示原始數(shù)據(jù)
B、 輸入學號，顯示學生檔案，并可選擇用順序查找或者折半查找去實現(xiàn)
C、 輸入不完全的學生姓名即可模糊查找學生檔案。
D、 輸入班級及課程即可統(tǒng)計平均分，優(yōu)秀率及及格率。
2、 數(shù)據(jù)顯示函數(shù)
3、 學號查找函數(shù)
4、 模糊查找函數(shù)
5、 成績統(tǒng)計函數(shù)
標簽：
信息查詢系統(tǒng)
C語言
數(shù)據(jù)
上傳時間：
2014-08-20
上傳用戶：fanboynet
-
本附錄按錯誤編號列出了所有Wi n s o c k錯誤代碼。但要注意的是，該列表沒有包括標記為
“B S D特有”的Wi n s o c k錯誤，也沒有包括那些尚未正式列入規(guī)范的錯誤。此外，與Wi n 3 2錯
誤有著直接對應關系的Wi n s o c k錯誤列在本附錄末尾。
標簽：
錯誤
錯誤代碼
上傳時間：
2014-01-11
上傳用戶：ghostparker
-
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標簽：
introduction
the
contains
intended
上傳時間：
2013-12-23
上傳用戶：liansi
-
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標簽：
project
implement
developed
Database
上傳時間：
2013-12-25
上傳用戶：semi1981
-
If we have two individually sorted vectors "a" and "b" but they are not sorted with respect to each other and we want to merge them into vector "c" such that "c" is also a sorted vector. Then c=mergesorted(a,b) can be used.
標簽：
sorted
individually
respect
vectors
上傳時間：
2015-09-23
上傳用戶：comua
-
C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random rand) , genRandomBits(int bits, Random rand) , isProbablePrime(int confidence) , isProbablePrime() , Jacobi(BigInteger a, BigInteger b) , LucasSequence(BigInteger P, BigInteger Q, BigInteger k, BigInteger n) ,max(BigInteger bi) , min(BigInteger bi) , modInverse(BigInteger modulus) , RabinMillerTest(int confidence) ,
標簽：
BigInteger
class
BIgInteger
program
上傳時間：
2013-12-23
上傳用戶：ynzfm
-
考察例1 4 - 8中的1 4個點。A中的最近點對為(b,h)，其距離約為0 . 3 1 6。B中最近點對為
(f, j)，其距離為0 . 3，因此= 0 . 3。當考察
是否存在第三類點時，除d, g, i, l, m 以外
的點均被淘汰，因為它們距分割線x= 1的
距離≥ 。RA ={d, i, m}，RB= {g, l}，由
于d 和m 的比較區(qū)中沒有點，只需考察i
即可。i 的比較區(qū)中僅含點l。計算i 和l
的距離，發(fā)現(xiàn)它小于，因此(i, l) 是最近
標簽：
上傳時間：
2013-12-03
上傳用戶：66666
-
設B是一個n×n棋盤，n=2k,(k=1,2,3,…)。用分治法設計一個算法，使得：用若干個L型條塊可以覆蓋住B的除一個特殊方格外的所有方格。其中，一個L型條塊可以覆蓋3個方格。且任意兩個L型條塊不能重疊覆蓋棋盤
標簽：
上傳時間：
2013-12-16
上傳用戶：腳趾頭
-
design LP,HP,B S digital Butterworth and Chebyshev
filter. All array has been specified internally,so user only need to
input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify
the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,...,
ksection and the freq.
標簽：
Butterworth
internally
Chebyshev
specified
上傳時間：
2015-11-08
上傳用戶：253189838
