亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

Work

  • LPC2148 USB Audio Device Example This USB example project implements an USB Audio Device that conne

    LPC2148 USB Audio Device Example This USB example project implements an USB Audio Device that connects via the USB interface to the PC. It may be used on the following devices: LPC2141 LPC2142 LPC2144 LPC2146 LPC2148 An USB Audio Device (HID) does not require any special USB driver, since the USB Audio support is already built into Windows 2000 and Windows XP. Therefore USB Audio devices can be directly connected to the computer. This example project is designed to Work with Keil MCB2140 Evaluation Board. Refer to Running USBAudio for information on how to operate this example project.

    標簽: Device USB Audio implements

    上傳時間: 2015-04-16

    上傳用戶:VRMMO

  • CBC下寫的串口編程

    CBC下寫的串口編程,API函數實例 I wish this site had been around when I was trying to figure out how to make serial communications Work in Windows95. I, like many programmers, was hit with the double-whammy of having to learn Windows programming and Win95 serial comm programming at the same time. I found both tasks confusing at best. It was particularly frustrating because I had, over the years, written so much stuff (including lots of serial comm software) for the DOS environment and numerous embedded applications. Interrupt driven serial comm, DMA transfer serial comm, TSR serial comm, C, assembler, various processors... you name it, it had written it. Yet, everything I knew seemed upside-down in the message-driven-callback world of Windows.

    標簽: CBC 串口編程

    上傳時間: 2014-06-20

    上傳用戶:cccole0605

  • .數據結構 假設有M個進程N類資源

    .數據結構 假設有M個進程N類資源,則有如下數據結構: MAX[M*N] M個進程對N類資源的最大需求量 AVAILABLE[N] 系統可用資源數 ALLOCATION[M*N] M個進程已經得到N類資源的資源量 NEED[M*N] M個進程還需要N類資源的資源量 2.銀行家算法 設進程I提出請求Request[N],則銀行家算法按如下規則進行判斷。 (1)如果Request[N]<=NEED[I,N],則轉(2);否則,出錯。 (2)如果Request[N]<=AVAILABLE,則轉(3);否則,出錯。 (3)系統試探分配資源,修改相關數據: AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系統執行安全性檢查,如安全,則分配成立;否則試探險性分配作廢,系統恢復原狀,進程等待。 3.安全性檢查 (1)設置兩個工作向量Work=AVAILABLE;FINISH[M]=FALSE (2)從進程集合中找到一個滿足下述條件的進程, FINISH[i]=FALSE NEED<=Work 如找到,執行(3);否則,執行(4) (3)設進程獲得資源,可順利執行,直至完成,從而釋放資源。 Work=Work+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的進程Finish[M]=true,則表示安全;否則系統不安全。

    標簽: 數據結構 進程 資源

    上傳時間: 2014-01-05

    上傳用戶:moshushi0009

  • 數據結構 假設有M個進程N類資源

    數據結構 假設有M個進程N類資源,則有如下數據結構: MAX[M*N] M個進程對N類資源的最大需求量 AVAILABLE[N] 系統可用資源數 ALLOCATION[M*N] M個進程已經得到N類資源的資源量 NEED[M*N] M個進程還需要N類資源的資源量 2.銀行家算法 設進程I提出請求Request[N],則銀行家算法按如下規則進行判斷。 (1)如果Request[N]<=NEED[I,N],則轉(2);否則,出錯。 (2)如果Request[N]<=AVAILABLE,則轉(3);否則,出錯。 (3)系統試探分配資源,修改相關數據: AVAILABLE=AVAILABLE-REQUEST ALLOCATION=ALLOCATION+REQUEST NEED=NEED-REQUEST (4)系統執行安全性檢查,如安全,則分配成立;否則試探險性分配作廢,系統恢復原狀,進程等待。 3.安全性檢查 (1)設置兩個工作向量Work=AVAILABLE;FINISH[M]=FALSE (2)從進程集合中找到一個滿足下述條件的進程, FINISH[i]=FALSE NEED<=Work 如找到,執行(3);否則,執行(4) (3)設進程獲得資源,可順利執行,直至完成,從而釋放資源。 Work=Work+ALLOCATION FINISH=TRUE GO TO 2 (4)如所有的進程Finish[M]=true,則表示安全;否則系統不安全。

    標簽: 數據結構 進程 資源

    上傳時間: 2013-12-24

    上傳用戶:alan-ee

  • Intel(R) i810/i815 Display Driver with DirectX Release for Microsoft Windows* CE 3.00 and Micros

    Intel(R) i810/i815 Display Driver with DirectX Release for Microsoft Windows* CE 3.00 and Microsoft Windows* CE.Net. This driver requires either the 3.00 or the .NET release of Microsoft Windows* CE in order for it to Work.

    標簽: Microsoft Display DirectX Release

    上傳時間: 2013-12-21

    上傳用戶:nanshan

  • <===== 關于 GANT 鼠標集 (M) =====> 此“GANT 鼠標集 (M)”包含黃色和藍色兩種顏色主題

    <===== 關于 GANT 鼠標集 (M) =====> 此“GANT 鼠標集 (M)”包含黃色和藍色兩種顏色主題,每種顏色主題分別有兩套鼠標。換句話說,這個鼠標集共提供4套鼠標,分別放在4個文件夾內。 這里,我簡單介紹一下每套鼠標,以所在文件夾名來指代: - yellow_normal_24x24:黃色,9個 ani 文件(動態鼠標)和6個 cur 文件(靜態鼠標),與預覽圖中所示一樣; - yellow_colorful_24x24:黃色,除“Work in Background.ani”和“Wait.ani”兩個鼠標為12色變換之外,其他13個鼠標與上面一套完全相同; - blue_normal_24x24:藍色,9個 ani 文件和6個 cur 文件; - blue_colorful_24x24:藍色,除“Work in Background.ani”和“Wait.ani”兩個鼠標為12色變換之外,其他13個鼠標與上面一套完全相同。 所有鼠標的尺寸都是 24像素 x 24像素。 感謝 mattahan 準許我使用他的 GANT 圖標來制作這幾套鼠標! 同時非常感謝 cyberchaos05(http://cyberchaos05.deviantart.com),他為我制作了鼠標的預覽圖。 “GANT 鼠標集 (M)”僅供個人使用,不得用于任何商業目的!

    標簽: GANT 鼠標 lt gt

    上傳時間: 2013-12-20

    上傳用戶:SimonQQ

  • The subject which is to us propos¨¦ is as follows: calculation of the degr¨¦ d¡ &ma

    The subject which is to us propos¨¦ is as follows: calculation of the degr¨¦ d¡ ¯ inconsistance d¡ ¯ un logical program possibilist in C++. We thus Work on a logical program possibilist, it be-¨¤-statement a logical program resulting from non-classique logic. The goal first of this project is of d¨¦ terminer if a logical program is consisting or not of share the calculation of sound degr¨¦ d¡ ¯ inconsistance.

    標簽: brvbar calculation subject follows

    上傳時間: 2013-12-18

    上傳用戶:yulg

  • This book is about using Python to get jobs done on Windows.This intended to be a practical book foc

    This book is about using Python to get jobs done on Windows.This intended to be a practical book focused on tasks. It doesn t aim to teach Python programming, although we do provide a brief tutorial. Instead, it aims to cover:How Python Works on Windows The key integration technologies supported by Python on Windows, such as the Win32 extensions, which let you call the Windows API, and the support for COM Examples in many topic areas showing what Python can do and how to put it to Work.

    標簽: This book practical intended

    上傳時間: 2015-05-10

    上傳用戶:ddddddos

  • Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to w

    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

  • C++ Demystified: A Self-Teaching Guide by Jeff Kent ISBN:0072253703 McGraw-Hill/Osborne © 20

    C++ Demystified: A Self-Teaching Guide by Jeff Kent ISBN:0072253703 McGraw-Hill/Osborne © 2004 This hands-on, step-by-step resource will guide you through each phase of C++ programming, providing you with the foundation to discover how computer programs and programming languages Work.

    標簽: Self-Teaching Demystified McGraw-Hill 0072253703

    上傳時間: 2013-12-13

    上傳用戶:1427796291

主站蜘蛛池模板: 菏泽市| 苍溪县| 嘉善县| 玉龙| 和龙市| 嘉祥县| 南涧| 永定县| 皮山县| 邯郸县| 宾川县| 巫山县| 无极县| 渝中区| 民丰县| 彝良县| 淮安市| 中阳县| 新宾| 兴安县| 临夏县| 阳信县| 霸州市| 桐城市| 西和县| 民和| 行唐县| 伊金霍洛旗| 象山县| 中阳县| 加查县| 石城县| 扬中市| 黑水县| 布尔津县| 喀喇| 兴隆县| 昌图县| 富裕县| 和平县| 灵台县|