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

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

comm<b>And</b>-line

  • 基于單片機(jī)的數(shù)字化B超鍵盤設(shè)計(jì)

    針對(duì)目前使用的RS232接口數(shù)字化B超鍵盤存在PC主機(jī)啟動(dòng)時(shí)不能設(shè)置BIOS,提出一種PS2鍵盤的設(shè)計(jì)方法。基于W78E052D單片機(jī),采用8通道串行A/D轉(zhuǎn)換器設(shè)計(jì)了8個(gè)TGC電位器信息采集電路,電位器位置信息以鍵盤掃描碼序列形式發(fā)送,正交編碼器信號(hào)通過XC9536XL轉(zhuǎn)換為單片機(jī)可接收的中斷信號(hào),軟件接收到中斷信息后等效處理成按鍵。結(jié)果表明,在滿足開機(jī)可設(shè)置BIOS同時(shí),又可實(shí)現(xiàn)超聲特有功能,不需要專門設(shè)計(jì)驅(qū)動(dòng)程序,接口簡單,成本低。 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.    

    標(biāo)簽: 單片機(jī) B超 數(shù)字化 鍵盤設(shè)計(jì)

    上傳時(shí)間: 2013-10-10

    上傳用戶:asdfasdfd

  • 排序算法、字典和B-樹的C++語言實(shí)現(xiàn) 代碼內(nèi)容 包括以下算法: qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert

    排序算法、字典和B-樹的C++語言實(shí)現(xiàn) 代碼內(nèi)容 包括以下算法: qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert sort shl.c sort: shell sort has.c dictionary: hash tables bin.c dictionary: binary tree rbt.c dictionary: red-black trees skl.c dictionary: skip lists ext.c external sort btr.c btree 語言 C++ 編譯平臺(tái) Visual C++ 作者 Thomas Niemann 備注 來自Sorting and Searching Algorithms:A Cookbook

    標(biāo)簽: sort qsort quicksort insert

    上傳時(shí)間: 2013-12-15

    上傳用戶:silenthink

  • 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編程技術(shù) [配套程序] [涉及平臺(tái)] VC [作者] void [文件大小] 1032K

    標(biāo)簽: description companion Appendix RESOURCE

    上傳時(shí)間: 2013-12-04

    上傳用戶:asasasas

  • This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYS

    This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.

    標(biāo)簽: project implement developed Database

    上傳時(shí)間: 2013-12-25

    上傳用戶:semi1981

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    標(biāo)簽: Implemented following compile command

    上傳時(shí)間: 2014-01-01

    上傳用戶:lhc9102

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

    標(biāo)簽: Reese B. R. Copyright

    上傳時(shí)間: 2015-09-24

    上傳用戶:mpquest

  • 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.

    標(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

    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語音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding

    ITU-T G.729語音壓縮算法。 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í)現(xiàn)

    B樹算法實(shí)現(xiàn),非常難得!btree implementation for random lookups, transaction handling, sequential access methods, and a small embeddable footprint.

    標(biāo)簽: 算法

    上傳時(shí)間: 2014-01-10

    上傳用戶:王小奇

主站蜘蛛池模板: 漯河市| 台中县| 弥勒县| 屯留县| 阿拉尔市| 望谟县| 土默特左旗| 固阳县| 石棉县| 广汉市| 庆城县| 巴林右旗| 西平县| 石景山区| 阿克苏市| 阿拉善左旗| 金湖县| 康马县| 巢湖市| 保亭| 呼图壁县| 岳普湖县| 博爱县| 福贡县| 海阳市| 嫩江县| 浮山县| 双桥区| 会昌县| 平陆县| 宁陵县| 贵港市| 余庆县| 庄河市| 南江县| 桂阳县| 六盘水市| 武清区| 杨浦区| 从江县| 湛江市|