UCOS/II for ICCAVR
- The version of UCOS/II is 2.04
- the original port was done by Ole Saether for the IAR compiler. Jens E.
Holtegaard ported one version using ICCAVR. Joerg Meyer did another port
(using Jens port as a start?). This is basically Joerg s port plus a
little bit of changes and documentation by me.
- YOU MUST DOWNLOAD THE MAIN PART OF THE UCOS/II FROM THE UCOS/II WEBSITE
http://www.ucos-ii.com . The supplied project file assumes the portable
source is in the ..\source directory.
- Joerg has written couple document showing the stack frames etc. but it
is in German :-) They are included in this directory.
- The Timer2 overflow interrupt is used for Timer Tick. If you want to
change that, modify os_cpu_c.c and os_cpu_a.s
- I have tested this using ATMega103 with and without external RAM
using AVR Studio simulator. See test1.c test program. Both Code
Compressed (PRO) and STD versions have been tested.
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
結合單片機和M a t l a b 兩者的優點，基于事件驅動的中斷通信機制，提出一種Matlab 環境下PC 機與
單片機實時串行通信及數據處理的方法；完成單片機數據采集系統與PC 機的RS-232/RS-485 串行通
信及其通信數據的分析處理、文件存儲、F I R 濾波及圖形顯示；簡化系統開發流程，提高開發效率。
該方法已成功應用于一個P I C 1 6 F 8 7 6 單片機應用系統實例之中
Floyd-Warshall算法描述
1)適用范圍：
a)APSP(All Pairs Shortest Paths)
b)稠密圖效果最佳
c)邊權可正可負
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)算法結束：dis即為所有點對的最短路徑矩陣
3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
完成在S3C2410處理器上移植μC/OS-II內核，然后實現以下多任務：
a) 控制實驗箱核心板上4盞LED燈輪流亮滅；
b) 將LED1連接到ARM9-2410EP增強型實驗箱擴展口的DA OUT端口，通過實驗箱上的鍵盤（比如“↑”、“↓”鍵）控制LED1亮暗變化，同時在超級終端顯示該控制值；
c) 將LED2連接到擴展口的I/O輸出口，通過超級終端按鍵控制LED2亮滅，即按一下PC的超級終端某個鍵（比如回車鍵）LED2滅，再按LED2亮，反復循環。
給定兩個集合A、B，集合內的任一元素x滿足1 ≤ x ≤ 109，并且每個集合的元素個數不大于105。我們希望求出A、B之間的關系。
任 務 ：給定兩個集合的描述，判斷它們滿足下列關系的哪一種：
A是B的一個真子集，輸出“A is a proper subset of B”
B是A的一個真子集，輸出“B is a proper subset of A”
A和B是同一個集合，輸出“A equals B”
A和B的交集為空，輸出“A and B are disjoint”
上述情況都不是，輸出“I m confused!”
