点击切换搜索课件文库搜索结果(828)
文档格式:PDF 文档大小:299.08KB 文档页数:35
Automatic Repeat ReQuest(ARQ) When the receiver detects errors in a packet, how does it let the transmitter know to re-send the corresponding packet? Systems which automatically request the retransmission of missing packets or packets with errors are called ARQ systems Three common schemes Stop Wait
文档格式:PPT 文档大小:301KB 文档页数:30
221并行口 1选通(STROBE低电平) 10确认(ACKNLG低电平) 2数据位0(DATAO)11忙(BSY) 3数据位1(DATA1)12却纸(PE) 4数据位2(DAT2)13选择(LCT)
文档格式:PDF 文档大小:78.47KB 文档页数:15
Programming Languages · Control Conditionals Functions function calls Threads Data Scalars: booleans, numbers, strings Records/ structures Classes, types sept.8.2003
文档格式:PDF 文档大小:1.13MB 文档页数:57
Satellite communications Architecture Identify Requirements Specify architectures Determine link data rates Design Size each link Document your rationale
文档格式:PDF 文档大小:266.77KB 文档页数:34
Overview Spacecraft data processing requires microcomputers and interfaces that are functionally similar to desktop systems However, space systems require: - Low power, volume, and mass High reliability and fault tolerance
文档格式:PDF 文档大小:114.53KB 文档页数:10
《OFDM技术开发系列》(英文版) Beyond 3G Wideband wireless data access based on OFDM and dynamic packet assignment
文档格式:PDF 文档大小:1.6MB 文档页数:16
Slide 12.1.1 In the last lecture, we introduced mutation as a component of 6001s|cP our data structures We saw for example that set was a Environment mode way of changing the value associated with a variable in our system, and we saw that set-car! and set-cdr! were ways of changing the values of parts of list structure Now, several important things happened when we introduced
文档格式:PDF 文档大小:2.16MB 文档页数:21
6.001 Structure and Interpretation of Computer Programs. Copyright o 2004 by Massachusetts Institute of Technology 6.001 Notes: Section 10.1 Slide 1o.1.1 Table: a set of bindings Over the past few lectures, we have introduced the concepts of data abstractions, types and aggregate structures. In this lecture
文档格式:PPT 文档大小:237.5KB 文档页数:42
二叉树的建立 建立二叉树的过程是一个“插入”过程,下面我们用 个例子来讲解这一过程。 我们想建立这样一棵二叉树,树中的每一个结点有 个整数数据名为data,有两个指针:左指针L,右指 针R,分别指向这个结点的左子树和右子树,显然可 以用如下名为TREE的结构来描述这种结点:
文档格式:PPT 文档大小:252.5KB 文档页数:46
◼ 13.1 从数据库到数据仓库 ◼ 13.2 数据仓库的结构 ◼ 13.3 数据仓库的设计 ◼ 13.4 OLAP与数据仓库 ◼ 13.5 数据挖掘(data mining,DM) ◼ 13.6 决策支持系统与数据仓库 ◼ 13.7 SQL Server 2000的数据仓库 ◼ 13.8 小结 ◼ 13.9 习题
首页上页7677787980818283下页末页
热门关键字
搜索一下,找到相关课件或文库资源 828 个  
©2008-现在 cucdc.com 高等教育资讯网 版权所有