File: fw.c Contents: Firmware frameworks task dispatcher and device request parser File: FX2.h Contents: EZ-USB FX2 constants, macros, datatypes, globals, and library function prototypes. File: FX2regs.h Contents: EZ-USB FX2 register declarations and bit mask definitions. File: periph.c Contents: Hooks required to implement USB peripheral function. File: dscr.a51 Contents: This file contains descriptor data tables. File: dscr.a51 Contents: This file contains descriptor data tables. File: dscr.a51 Contents: This file contains descriptor data tables.
标签: File frameworks dispatcher Contents
上传时间: 2014-01-18
上传用户:bakdesec
通用报表打印类使用说明 主要功能: 1 – 自动分页 2 – 自动划出纵横表格线 3 – 支持横向 / 纵向打印 4 – 支持打印输出或生成文本文件 使用方法: 1.Copy prt.h, prt.cpp --- > Project Path 2.Menu --- > Project --- > Add to project --- > files ( prt.h, prt.cpp ) 3.Menu --- > open --- > prt_demo.rc --- > Bitmap --- > IDB_PRT ( copy to current project ) 4.Menu --- > open --- > prt_demo.rc --- > Dialog --- > IDD_PRT ( copy to current project ) 5.Add: #include <prt.h> 6.Add member function : int GetRow(PRTROW *pRow) 7.Add code into OnPrt and GetRow
上传时间: 2014-02-11
上传用户:dongqiangqiang
A salient-boundary extraction software package based on the paper: S. Wang, T. Kubota, J. M. Siskind, J. Wang. Salient Closed Boundary Extraction with Ratio Contour, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(4):546-561, 2005
上传时间: 2014-01-23
上传用户:gonuiln
h.248源代码,基于voip(h323)中iad的源代码,陆续会传。
上传时间: 2016-03-10
上传用户:hj_18
#include "at89x51.h" unsigned char code ddisp[]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d,0x07,0x7f,0x6f} //段显0123456789,P0口
标签: unsigned include ddisp char
上传时间: 2013-12-03
上传用户:zm7516678
最优服务次序问题 问题描述: 设有n 个顾客同时等待一项服务。顾客i需要的服务时间为t(i),i=1,…,n 。...个顾客等待服务时间的 总和除以n。 编程任务: 对于给定的n个顾客需要的服务时间,编程计算最优服务次序。
上传时间: 2013-12-19
上传用户:epson850
/* * main MIRACL header - miracl.h. * * Copyright (c) 1988-2001 Shamus Software Ltd. */
标签: Copyright Software MIRACL header
上传时间: 2014-11-05
上传用户:Divine
MIRACL compiler/hardware definitions - mirdef.h This version suitable for use with most 32-bit computers
标签: definitions compiler hardware suitable
上传时间: 2014-11-23
上传用户:sdq_123
给定1 棵有n 个结点的树T。子树分割问题要求从树T 中删除尽可能少的边得到一个恰有k 个结点的连通分支。
上传时间: 2016-03-14
上传用户:wanghui2438
UNICODE编码查询 /* unicode.h file Edited by Computer-lov. Date: 2005.3.28 Last edited date: 2005.5.31 version 1.1 */ #define UNICODE_MAX 7446
标签: 2005 Computer-lov UNICODE unicode
上传时间: 2016-03-17
上传用户:dave520l