资源列表
reportOCX
- 可以实现灵活的报表。一个控件。供大家参考和批评。-can achieve flexible statements. A control. For your reference and criticism.
dhzdydxt
- 以VC++.NET为开发工具,用软件实现的语音自动应答系统,采用基于COM技术的TAPI3实现-to VC.NET development tool, with the software automatically voice response system, COM-based technology to achieve TAPI3
UDP_Fasong
- udp 协议下的服务端 最近做tcp／ip协议簇里基于udp方面的设计 望大家指教-udp agreement server recent tcp / ip protocol suite Lane on the design udp hope you enlighten
RUDP-3952
- 基于rudp 数据可靠传输及测试 做rudp协议人不多 写此抛砖引玉-rudp based on reliable data transmission and testing so few people rudp agreement was made this comment
BasicGeneticAlgorithm
- 遗传算法的基本程序,可应用于所有用遗传算法解决的问题.-genetic algorithm of the basic procedures that can be applied to all genetic algorithm to solve the problem.
BMWErrorCodes
- BMW故障码对照表,用于诊断仪器检出故障码后对照此表做故障排除,是BMW车主必备文件.-BMW fault code comparison table for diagnostic equipment fault detection code after control of this table do troubleshooting, BMW owners are required documents.
BMWScanner123
- BMW诊断软体,可以对DME供由系统晶片作修改,也可以修改哩程数,也可以读取故障码及清除故障码,是一款功能不错的诊断软体.适用于WINDOWS作业系统.软体包含介面.-BMW diagnostic software, DME can be right for the system chip to make modifications can also modify a few miles. Fault can also read codes and removal of fault codes,
bmwscanner407_892
- BMW车用诊断软体,可以读取故障码,及清除故障码,机油保养灯归零,支援LIVE DATA..等多种功能.适用于WINDOWS系统.此转体包含介面.-BMW car with diagnostic software can read Fault Code, and removal of fault codes, oil lamps zero maintenance, LIVE DATA support .. so on. apply to the Windows system. This incl
WTOPCsvr_OPCdemo
- WTOPCsvr服务器范例,学习OPC的好例程(转发)-WTOPCsvr server paradigm, the study OPC good routines (transponders)
qiankxiao
- 设计算法实现在一个具有在n各互不相同元素的数组A[1…n]中找出所有前k个最小元素的问题，这里k不是常量，即它是输入数据的一部分。要求算法的时间复杂性为Θ(n)。-design of the algorithm is in a n incompatible with the elements of the array A [1 ... n] to identify all former k smallest elements of the problem, here k is not const
halferyi
- 元素唯一性问题：给出一个整数集合，假定这些整数存储在数组A[1…n]中，确定它们中是否存在两个相等的元素。-elements only problem : given an integer, assuming that these integer stored in the array A [1 ... n], determine whether the existence of two equal elements.
eryi
- 设B是一个n×n棋盘，n=2k,(k=1,2,3,…)。用分治法设计一个算法，使得：用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中，一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘