在C8051中用I/O口模擬SPI的C代碼.
上傳時(shí)間： 2013-12-17
上傳用戶：498732662
調(diào)用過(guò)程 CM = Confusion_matrix(train_predicts, train_targets) [combining_predicts, errorrate] = combining_NB(DP, test_targets, CM) DP，三維數(shù)組，(i,j,k)為第k個(gè)樣本的DP矩陣 targets 為 0 1 2
標(biāo)簽： combining_predicts Confusion_matrix train_predicts train_targets
上傳時(shí)間： 2015-04-04
上傳用戶：it男一枚
求解網(wǎng)絡(luò)中的最短路徑。假設(shè)某個(gè)計(jì)算機(jī)網(wǎng)絡(luò)有n個(gè)站點(diǎn)，依次編號(hào)為1,2,…,n；有的站點(diǎn)之間有直接的線路連接（即這兩個(gè)站點(diǎn)之間沒(méi)有其它站點(diǎn)），有的站點(diǎn)之間沒(méi)有直接的線路連接。如果用三元組（i,j,f）來(lái)表示該網(wǎng)絡(luò)中的站點(diǎn)I和站點(diǎn)j之間有直接的線路連接且它們之間的距離為f 當(dāng)已知該網(wǎng)絡(luò)各站點(diǎn)之間的直接連接情況由m個(gè)三元組（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)確定時(shí)，要求計(jì)算出對(duì)于網(wǎng)絡(luò)中任意一個(gè)站點(diǎn)g(1≤g≤n)到其余各站點(diǎn)的最短距離。
標(biāo)簽： 網(wǎng)絡(luò) 最短路徑 站點(diǎn) 計(jì)算機(jī)網(wǎng)絡(luò)
上傳時(shí)間： 2013-12-27
上傳用戶：asdkin
利用MSP430 單片機(jī)的一般 I/O口進(jìn)行的數(shù)字量的采集 利用A/D采集通道實(shí)現(xiàn)模擬量到數(shù)字量的轉(zhuǎn)化
上傳時(shí)間： 2013-12-21
上傳用戶：古谷仁美
頻率計(jì)程序﹐一個(gè)基于PIC單片機(jī)的頻率計(jì)程序和電路圖。
上傳時(shí)間： 2013-12-26
上傳用戶：liansi
Scalable k-means software and test datasets This package (a Unix tar file, gzipped) contains the source code for the software that was used to run the experiments for the article
標(biāo)簽： Scalable datasets contains software
上傳時(shí)間： 2015-04-05
上傳用戶：康郎
K-均值算法的c語(yǔ)言實(shí)現(xiàn)，他是一種基于樣本間相似性度量的間接聚類方法。
上傳時(shí)間： 2015-04-05
上傳用戶：zhuimenghuadie
這次上傳的代碼是關(guān)于K-means clusters的代碼，希望能對(duì)大家有用。
上傳時(shí)間： 2013-12-15
上傳用戶：lindor
The code assumes a two-dimensional computational domain with TMz polarization (i.e., non-zero field Ez, Hx, and Hy). The program is currently written so that the incident field always strikes the lower-left corner of the total-field region first. (If you want a different corner, that should be a fairly simple tweak to the code, but for now you ll have to make that tweak yourself.) I have attempted to provide copious comments in the code and hope that a knowledgeable C programmer can quickly map the approach as described in the paper to what is in the program.
標(biāo)簽： two-dimensional computational polarization non-zero
上傳時(shí)間： 2013-12-13
上傳用戶：cylnpy
Many many developers all over the net respect NASM for what i s - a widespread (thus netwide), portable (thus netwide!), very flexible and mature assembler tool with support for many output formats (thus netwide!!). Now we have good news for you: NASM is licensed under LGPL. This means its development is open to even wider society of programmers wishing to improve their lovely assembler. The NASM project is now situated at SourceForge.net, the most famous Open Source development center on The Net. Visit our development page at http://nasm.2y.net/ and our SF project at http://sf.net/projects/nasm/
標(biāo)簽： developers widespread netwide respect
上傳時(shí)間： 2014-01-20
上傳用戶：2404
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
