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

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

se-TO-<b>powerPCB</b>

  • how to finding the best way from A to B

    how to finding the best way from A to B

    標簽: finding best from to

    上傳時間: 2013-12-19

    上傳用戶:zhouli

  • To use this function just define a variable say var, var = pnseq(a, b, c) for a, b and c refe

    To use this function just define a variable say var, var = pnseq(a, b, c) for a, b and c refer to the zip file

    標簽: var function variable define

    上傳時間: 2014-01-06

    上傳用戶:zhuoying119

  • 基于單片機的數字化B超鍵盤設計

    針對目前使用的RS232接口數字化B超鍵盤存在PC主機啟動時不能設置BIOS,提出一種PS2鍵盤的設計方法。基于W78E052D單片機,采用8通道串行A/D轉換器設計了8個TGC電位器信息采集電路,電位器位置信息以鍵盤掃描碼序列形式發(fā)送,正交編碼器信號通過XC9536XL轉換為單片機可接收的中斷信號,軟件接收到中斷信息后等效處理成按鍵。結果表明,在滿足開機可設置BIOS同時,又可實現(xiàn)超聲特有功能,不需要專門設計驅動程序,接口簡單,成本低。 Abstract:  Aiming at the problem of the digital ultrasonic diagnostic imaging system keyboard with RS232 interface currently used couldn?蒺t set the BIOS when the PC boot, this paper proposed a design method of PS2 keyboards. Based on W78E052D microcontroller,designed eight TGC potentiometers information acquisition circuit with 8-channel serial A/D converter, potentiometer position information sent out with keyboard scan code sequentially.The control circuit based on XC9536 CPLD is used for converting the mechanical actions of the encoders into the signals that can be identified by the MCU, software received interrupt information and equivalently treatmented as key. The results show that the BIOS can be set to meet the boot, ultrasound specific functionality can be achieved at the same time, it does not require specially designed driver,the interface is simple and low cost.    

    標簽: 單片機 B超 數字化 鍵盤設計

    上傳時間: 2013-10-10

    上傳用戶:asdfasdfd

  • See Appendix B for a description of the programs included on this companion disk. RESOURCE.WRI iden

    See Appendix B for a description of the programs included on this companion disk. RESOURCE.WRI identifies other books and resources for Internet programming. WEBHELP.HLP contains an introduction to the World Wide Web. TCPMAN.HLP provides detailed instructions to help you use the Trumpet Winsock included on this disk. Use the Program Manager s File menu Run option to execute the SETUP.EXE program found on this disk. SETUP.EXE will install the programs on your hard drive and create an Internet Programming group window. Internet編程技術 [配套程序] [涉及平臺] VC [作者] void [文件大小] 1032K

    標簽: description companion Appendix RESOURCE

    上傳時間: 2013-12-04

    上傳用戶:asasasas

  • * "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.

    * "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.

    標簽: Reese B. R. Copyright

    上傳時間: 2015-09-24

    上傳用戶:mpquest

  • This I develops based on the B/S structure student managementsystem management system, hoped brings

    This I develops based on the B/S structure student managementsystem management system, hoped brings a help to the novice

    標簽: managementsystem management structure develops

    上傳時間: 2014-01-07

    上傳用戶:釣鰲牧馬

  • Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A c

    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.

    標簽: representation Magnitude the magnitude

    上傳時間: 2013-12-24

    上傳用戶:金宜

  • design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally

    design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally,so user only need to input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,..., ksection and the freq.

    標簽: Butterworth internally Chebyshev specified

    上傳時間: 2015-11-08

    上傳用戶:253189838

  • About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses

    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

    標簽: C. hamsterdb structure database

    上傳時間: 2013-12-11

    上傳用戶:LouieWu

  • Floyd-Warshall算法描述 1)適用范圍: a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權可正可負 2)算法描述: a)初始化:d

    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)算法小結:此算法簡單有效,由于三重循環(huán)結構緊湊,對于稠密圖,效率要高于執(zhí)行|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的連通情況。

    標簽: Floyd-Warshall Shortest Pairs Paths

    上傳時間: 2013-12-01

    上傳用戶:dyctj

主站蜘蛛池模板: 堆龙德庆县| 沙湾县| 昆明市| 湘乡市| 友谊县| 万盛区| 贵定县| 灵宝市| 德兴市| 布尔津县| 阿巴嘎旗| 石林| 梅河口市| 湄潭县| 凤山市| 新宁县| 南陵县| 上蔡县| 玛纳斯县| 易门县| 昔阳县| 乐山市| 双鸭山市| 佛冈县| 东方市| 鹤庆县| 株洲市| 望奎县| 大埔区| 涡阳县| 桐城市| 石棉县| 商南县| 隆子县| 西藏| 株洲市| 麻栗坡县| 马尔康县| 新疆| 会东县| 灌南县|