* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.msstate.edu, Mississippi State University) * IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR" * HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
標(biāo)簽： Reese B. R. Copyright
上傳時(shí)間： 2015-09-24
上傳用戶：mpquest
LinCAN is a Linux kernel module that implements a CAN driver capable of working with multiple cards, even with different chips and IO methods. Each communication object can be accessed from multiple applications concurrently. It supports RT-Linux, 2.2, 2.4, and 2.6 with fully implemented select, poll, fasync, O_NONBLOCK, and O_SYNC semantics and multithreaded read/write capabilities. It works with the common Intel i82527, Philips 82c200, and Philips SJA1000 (in standard and PeliCAN mode) CAN controllers. LinCAN project is part of a set of CAN/CANopen related components developed as part of OCERA framework.
標(biāo)簽： implements multiple capable working
上傳時(shí)間： 2015-10-14
上傳用戶：磊子226
Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.
標(biāo)簽： representation Magnitude the magnitude
上傳時(shí)間： 2013-12-24
上傳用戶：金宜
About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl
標(biāo)簽： C. hamsterdb structure database
上傳時(shí)間： 2013-12-11
上傳用戶：LouieWu
ITU-T G.729語(yǔ)音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) with Voice Activity Decision(VAD), Discontinuous Transmission(DTX), and Comfort Noise Generation(CNG).
標(biāo)簽： description commendation Fixed-point 729
上傳時(shí)間： 2014-11-23
上傳用戶：thesk123
B樹(shù)算法實(shí)現(xiàn)，非常難得！btree implementation for random lookups, transaction handling, sequential access methods, and a small embeddable footprint.
上傳時(shí)間： 2014-01-10
上傳用戶：王小奇
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權(quán)可正可負(fù) 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結(jié)束：dis即為所有點(diǎn)對(duì)的最短路徑矩陣 3)算法小結(jié)：此算法簡(jiǎn)單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對(duì)于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時(shí)間復(fù)雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個(gè)判斷I,j是否有通路的矩陣。更簡(jiǎn)單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來(lái)代替算法描述中的藍(lán)色部分，可以更直觀地得到I,j的連通情況。
標(biāo)簽： Floyd-Warshall Shortest Pairs Paths
上傳時(shí)間： 2013-12-01
上傳用戶：dyctj
A* sudo sudo/* B* adduser script adduser C* rmuser script rmuser E* tout tout/* F* dumdum dumdum G* lostfile lostfile H* Mkfl.localsys Makefile.localsys I* spacegripe spacegripe J* sendmail.cf sendmail.cf N* remote remote.c O* distributed conrol distrib/* P* hosts and name server makerevhosts Q* xargs xargs/*
標(biāo)簽： adduser script rmuser sudo
上傳時(shí)間： 2016-03-29
上傳用戶：gxrui1991
⑴ 提供簡(jiǎn)單命令 A、通過(guò)串口加載程序到指定內(nèi)存 B、將程序燒寫(xiě)到 NANDFLASH 指定位置 C、LCD 操作函數(shù) I、畫(huà)點(diǎn) II、畫(huà)線 III、畫(huà)圓 IV、顯示圖像 ⑵ bootloader 具備自我更新能力 ⑶ bootloader 可以啟動(dòng) LINUX ⑷ 能通過(guò)網(wǎng)絡(luò)傳輸文件（FTP/UDP）
標(biāo)簽： NANDFLASH LCD III 命令
上傳時(shí)間： 2016-06-18
上傳用戶：牧羊人8920
sourceforge歷史版本完整下載: http://sourceforge.net/project/showfiles.php?group_id=202044 提供了基于b樹(shù)索引算法的文件數(shù)據(jù)數(shù)據(jù)庫(kù)模塊詳見(jiàn)storage/目錄下面的 btree.c與pager.c container目錄為常用的容器實(shí)現(xiàn)，如果rbtree avltree map heap list vector hashtable deque T樹(shù) B樹(shù), test目錄為測(cè)試程序代碼經(jīng)過(guò)初步測(cè)試，比較穩(wěn)定。 os_api:裝一些操作系統(tǒng)相關(guān)的接口函數(shù)。已完成event mutex sem thread pipe相關(guān)的封裝 advance_container:提供優(yōu)先級(jí)消息隊(duì)列,普通消息隊(duì)列，定時(shí)器容器。 frame:目前提供了listerner（linux下版本，模仿ace的反應(yīng)器）定時(shí)器 algorithm:補(bǔ)充了堆排序 與快速排序 所有代碼均已在windows linux與uclinux + arm44b0平臺(tái)下測(cè)試 歡迎交流 msn:lsccsl@163.net mail:lsccsl@tom.com
標(biāo)簽： sourceforge showfiles group_id project
上傳時(shí)間： 2016-07-16
上傳用戶：lili123
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
