this class is an implementation of the kd-tree algorithm
標(biāo)簽： implementation algorithm kd-tree class
上傳時(shí)間： 2013-12-17
上傳用戶：笨小孩
Tree Java Development
標(biāo)簽： Development Tree Java
上傳時(shí)間： 2014-06-03
上傳用戶：dengzb84
Tree View in JSP. You can able to edit and expand. Very useful for developers
標(biāo)簽： developers expand useful Tree
上傳時(shí)間： 2014-01-17
上傳用戶：weiwolkt
binary search tree is umplemented using data structures in C++
標(biāo)簽： umplemented structures binary search
上傳時(shí)間： 2014-01-23
上傳用戶：semi1981
近年來(lái)，近距離無(wú)線傳輸技術(shù)是發(fā)展最快、最引入注目的技術(shù)，而ZigBee恰恰是填補(bǔ)了低速率無(wú)線通信技術(shù)的空缺，與其他標(biāo)準(zhǔn)在應(yīng)用上相得益彰。它專注于近距離傳輸，成本低、同時(shí)入門(mén)檻也低，雖然其出現(xiàn)較晚，但目前已經(jīng)得到人們?cè)絹?lái)越多的關(guān)注，成為無(wú)線技術(shù)研究的一個(gè)新熱點(diǎn)。 本文在詳細(xì)分析了傳統(tǒng)的抄表方式和無(wú)線抄表系統(tǒng)的發(fā)展?fàn)顩r以及相關(guān)的無(wú)線數(shù)據(jù)傳輸技術(shù)的基礎(chǔ)上，提出了基于ZigBee技術(shù)的無(wú)線抄表系統(tǒng)的方案。論文在研究ZigBee組網(wǎng)技術(shù)的基礎(chǔ)上，設(shè)計(jì)了基于ZigBee開(kāi)發(fā)平臺(tái)的無(wú)線嵌入式抄表系統(tǒng)，編寫(xiě)了相應(yīng)的軟件，完成了相應(yīng)的調(diào)試和分析，并進(jìn)行了系統(tǒng)的可靠性、實(shí)時(shí)性和安全性等問(wèn)題分析。為了減少系統(tǒng)由于節(jié)點(diǎn)路由而造成的功耗損耗過(guò)大的問(wèn)題，本文在組網(wǎng)應(yīng)用過(guò)程中采用Tree+AODVjr的路由算法，從而保持系統(tǒng)能夠保持較小功耗的情況下進(jìn)行數(shù)據(jù)的多跳路由，同時(shí)以ARM S3C2410為核心實(shí)現(xiàn)了基站設(shè)計(jì)，實(shí)現(xiàn)小區(qū)電表數(shù)據(jù)的集中采集，并通過(guò)GPRS/GSM模塊實(shí)現(xiàn)基站和抄表中心的數(shù)據(jù)傳輸和實(shí)時(shí)控制，在此基礎(chǔ)上，對(duì)抄表系統(tǒng)軟件也進(jìn)行了相應(yīng)的設(shè)計(jì)。 通過(guò)單點(diǎn)對(duì)單點(diǎn)、星形網(wǎng)絡(luò)數(shù)據(jù)傳輸實(shí)驗(yàn)，取得了相應(yīng)的實(shí)驗(yàn)數(shù)據(jù)，對(duì)于協(xié)議的特點(diǎn)、系統(tǒng)可靠性和功耗情況有了整體把握，為今后ZigBee技術(shù)的進(jìn)一步研究和應(yīng)用打下了堅(jiān)實(shí)基礎(chǔ)。 實(shí)驗(yàn)結(jié)果顯示，本文提出的方案切實(shí)可行，并且采用ZigBee技術(shù)具有節(jié)約資源、操作方便、可靠性高而且易于管理等特點(diǎn)，基站和系統(tǒng)利用較為成熟的GPRS/GSM網(wǎng)絡(luò)技術(shù)進(jìn)行通訊，既滿足了實(shí)時(shí)性要求，又降低了成本。
標(biāo)簽： ZIGBEE 嵌入式 自動(dòng)抄表系統(tǒng)
上傳時(shí)間： 2013-06-27
上傳用戶：kjgkadjg
基于FPGA技術(shù)的網(wǎng)絡(luò)入侵檢測(cè)是未來(lái)的發(fā)展方向，而網(wǎng)絡(luò)包頭的分類是入侵檢測(cè)系統(tǒng)的關(guān)鍵。 文章首先介紹了FPGA技術(shù)的基本原理以及其在信息安全方面的應(yīng)用，接著介紹入侵檢測(cè)系統(tǒng)以及FPGA技術(shù)在入侵檢測(cè)系統(tǒng)中的應(yīng)用。 分析了幾種比較出名的網(wǎng)絡(luò)包分類算法，包括軟件分類方法、TCAM分類算法、BV算法、Tree Bitmap算法以及端口范圍分類算法。 在此基礎(chǔ)上，文章設(shè)計(jì)了一個(gè)基于FPGA技術(shù)的入侵檢測(cè)系統(tǒng)包分類的基本框架圖，實(shí)現(xiàn)框架圖中的各個(gè)基本功能模塊。在實(shí)現(xiàn)過(guò)程中，提出了一類結(jié)合三態(tài)內(nèi)容可尋址內(nèi)存(TCAM)和普通存儲(chǔ)器(RAM)的網(wǎng)絡(luò)包包頭分類方案。我們將檢測(cè)規(guī)則編號(hào)并位圖化，使用RAM存儲(chǔ)與包頭結(jié)構(gòu)相關(guān)的規(guī)則位圖，通過(guò)TCAM上的數(shù)據(jù)匹配操作，快速關(guān)聯(lián)待分析的網(wǎng)絡(luò)數(shù)據(jù)包與入侵檢測(cè)規(guī)則。文章還討論了網(wǎng)包頭分類方法的優(yōu)化算法，將優(yōu)化算法與未優(yōu)化算法在速度和空間上進(jìn)行比較。此外，還討論了對(duì)Snort的規(guī)則庫(kù)進(jìn)行整理和規(guī)則化的問(wèn)題。 最后，對(duì)所設(shè)計(jì)的包頭分類匹配模塊在Quartus II進(jìn)行仿真評(píng)估，將實(shí)驗(yàn)結(jié)果與已有的一些分類算法進(jìn)行了比較。結(jié)果說(shuō)明，本設(shè)計(jì)在匹配速度和更新速度上有優(yōu)勢(shì)，但消耗了較多的存儲(chǔ)空間．
標(biāo)簽： 入侵檢測(cè)系統(tǒng) 網(wǎng)絡(luò) 包分類 技術(shù)研究
上傳時(shí)間： 2013-07-17
上傳用戶：gonuiln
The #1 Step-by-Step Guide to labviewNow Completely Updated for labview 8! Master labview 8 with the industry's friendliest, most intuitive tutorial: labview for Everyone, Third Edition. Top labview experts Jeffrey Travis and Jim Kring teach labview the easy way: through carefully explained, step-by-step examples that give you reusable code for your own projects! This brand-new Third Edition has been fully revamped and expanded to reflect new features and techniques introduced in labview 8. You'll find two new chapters, plus dozens of new topics, including Project Explorer, AutoTool, XML, event-driven programming, error handling, regular expressions, polymorphic VIs, timed structures, advanced reporting, and much more. Certified labview Developer (CLD) candidates will find callouts linking to key objectives on NI's newest exam, making this book a more valuable study tool than ever. Not just what to d why to do it! Use labview to build your own virtual workbench Master labview's foundations: wiring, creating, editing, and debugging VIs; using controls and indicators; working with data structures; and much more Learn the "art" and best practices of effective labview development NEW: Streamline development with labview Express VIs NEW: Acquire data with NI-DAQmx and the labview DAQmx VIs NEW: Discover design patterns for error handling, control structures, state machines, queued messaging, and more NEW: Create sophisticated user interfaces with tree and tab controls, drag and drop, subpanels, and more Whatever your application, whatever your role, whether you've used labview or not, labview for Everyone, Third Edition is the fastest, easiest way to get the results you're after!
標(biāo)簽： Everyone LabVIEW for 英文
上傳時(shí)間： 2013-10-14
上傳用戶：shawvi
Complete support for EBNF notation; Object-oriented parser design; C++ output; Deterministic bottom-up "shift-reduce" parsing; SLR(1), LALR(1) and LR(1) table construction methods; Automatic parse tree creation; Possibility to output parse tree in XML format; Verbose conflict diagnostics; Generation of tree traverse procedures
標(biāo)簽： Object-oriented Deterministic Complete notation
上傳時(shí)間： 2014-11-29
上傳用戶：kr770906
此軟件應(yīng)用了桌面表單，自定義菜單，常用工具條，數(shù)據(jù)表加密，TREE等控件技術(shù)。新學(xué)者可以借鑒。人性與個(gè)性化的界面設(shè)計(jì)，嘿嘿，還真值得一看
上傳時(shí)間： 2015-01-18
上傳用戶：遠(yuǎn)遠(yuǎn)ssad
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
標(biāo)簽： initiated described modified slightly
上傳時(shí)間： 2014-01-09
上傳用戶：sk5201314
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
