虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

AI-and-<b>Robotics</b>-IBA-GEI-April

  • 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

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

    标签: project implement developed Database

    上传时间: 2013-12-25

    上传用户:semi1981

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

  • 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

    上传用户:金宜

  • 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

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

    标签: description commendation Fixed-point 729

    上传时间: 2014-11-23

    上传用户:thesk123

  • The Original USB 2.0 specification released on April 27, 2000 Errata to the USB 2.0 specification

    The Original USB 2.0 specification released on April 27, 2000 Errata to the USB 2.0 specification as of December 7, 2000 Mini-B connector Engineering Change Notice to the USB 2.0 specification. Pull-up/pull-down Resistors Engineering Change Notice to the USB 2.0 specification. Errata to the USB 2.0 specification as of May 28, 2002 Interface Association Descriptor Engineering Change Notice to the USB 2.0 specification. Rounded Chamfer Engineering Change Notice to the USB 2.0 specification as of October 8, 2003 Unicode Engineering Change Notice to the USB 2.0 specification as of February 21, 2005 Inter-Chip USB Supplement Revision 1.0 as of March 13, 2006 Revision 1.3 of the USB On-The-Go Supplement as of December 5, 2006 Revision 1.01 of the Micro-USB Cables and Connectors Specification as of April 4, 2007 USB 2.0 Link Power Management Addendum Engineering Change Notice to the USB 2.0 specification as of July 16, 2007.

    标签: specification 2.0 USB Original

    上传时间: 2013-12-31

    上传用户:familiarsmile

  • B树算法实现

    B树算法实现,非常难得!btree implementation for random lookups, transaction handling, sequential access methods, and a small embeddable footprint.

    标签: 算法

    上传时间: 2014-01-10

    上传用户:王小奇

  • 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)算法小结:此算法简单有效,由于三重循环结构紧凑,对于稠密图,效率要高于执行|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

  • I wrote this code early this year using ColdFire MCF5213 in codewarrior IDE. The LCD is STN B/W 320x

    I wrote this code early this year using ColdFire MCF5213 in codewarrior IDE. The LCD is STN B/W 320x240 dot matrix LCD. The code include 3 different fonts, and basic LCD driver. All original!

    标签: this codewarrior ColdFire wrote

    上传时间: 2013-12-20

    上传用户:皇族传媒