騰龍版0802液晶類顯示器類程序端口說明：0802液晶：1gnd 2vcc 3vol(對比度調整） 4p2.0(RS 數據命令選擇） 5p2.1（R/W讀寫選擇） 6p2.2（E,使能信號） 7----14 p0.0-p0.7（數據總線） 倚天版液晶類顯示器類程序端口說明：1602液晶：1gnd 2vcc 3vol(對比度調整） 4p3.0(RS 數據命令選擇） 5p3.1（R/W讀寫選擇） 6p3.5（E,使能信號） 7----14 p1.0-p1.7（數據總線） 注意： 倚天版和騰龍版的液晶基本相同， 0802較小一些， 顯示2行8個字， 1602的液晶顯示2行16個子， 同時 端口有一些變化。 參照以上的說明即可
上傳時間： 2015-05-09
上傳用戶：zhouli
有脈沖干擾 下的柔性機械臂的模糊控制方法。采用神經網絡訓練出來的T—S模糊控制器，控制效果不錯。只有仿真模塊，沒有文字說明。
上傳時間： 2015-05-09
上傳用戶：我們的船長
zi zhi to ng jian
上傳時間： 2015-05-09
上傳用戶：rishian
Chipcon CC2420 reference design w/PA board rev B CC2420_w_PA_PCB.ZIP FABRICATION.PHO - fabrication drawing COPPER1.PHO - copper layer #1 (top side) COPPER2.PHO - copper layer #2 (inner ground plane) COPPER3.PHO - copper layer #3 (inner power plane) COPPER4.PHO - copper layer #4 (bottom side) TOPMASK.PHO - top side solder mask BOTTOMMASK.PHO - bottom side solder mask NCDRILL.DRL - drill data file NCDRILL.LST - drill list NCDRILL.REP - drill report
標簽： 2420 FABRICATION reference fabricati
上傳時間： 2015-05-12
上傳用戶：xc216
具有圖形化界面的一個路由模擬程序。路由算法為Dijkstra算法。具有求出圖中任意節點間所有最短路徑以及最短路徑子圖的功能。這是一個點對點(S-T)Dijkstra算法的改進。用于求兩點間的所有最短路徑。
上傳時間： 2014-01-25
上傳用戶：dengzb84
T-Kernel的規范，在世界的份額占70％以上，不過在中國沒有推廣開來
標簽： T-Kernel
上傳時間： 2015-05-16
上傳用戶：zmy123
T-Kernel的monitor，在世界的份額占70％以上，不過在中國沒有推廣開來
上傳時間： 2015-05-16
上傳用戶：894898248
一個投影聚類算法及其數據集生成源碼。 參考文獻： Eric K.K. Ng, A. Fu : Efficient algorithm for Projected Clustering,
標簽： A. K.K. Clustering Efficient
上傳時間： 2013-12-11
上傳用戶：亞亞娟娟123
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
標簽： available libraries Although nearly
上傳時間： 2014-01-22
上傳用戶：zhoujunzhen
This book isn t for uber-programmers who already have all the answers. If you think that J2EE does everything that you need it to do and you can make it sing, this book is not for you. Believe me, there are already enough books out there for you.
標簽： uber-programmers already answers think
上傳時間： 2015-05-22
上傳用戶：tb_6877751
<li id="mwgao"></li>