登录
首页 » Visual C++ » rfidreader

rfidreader

于 2017-05-25 发布 文件大小:47083KB
0 394
下载积分: 1 下载次数: 7

代码说明:

  rfid实例阅读程序,可实现超高频,高频,低频卡的读写( rfid实例阅读程序,可实现超高频,高频,低频卡的读写 RFID instance reading program, you can achieve ultra high frequency, high frequency, low frequency card read and write)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • aPLib-1.01
    this is the library to compress and decompress any file. I found it on Net
    2010-09-10 19:25:46下载
    积分:1
  • NovatelRange
    上传程序用于解析Novatel输出range 信息,解析结果已经验证。(The upload process is used to resolve the Novatel output range information, analytical results have been verified.)
    2013-05-17 16:24:27下载
    积分:1
  • guiji
    惯导系统轨迹生成器,能生成不同位置转动和舰船摇摆条件下的陀螺和加速度计数据,用于研究惯导系统(INS trajectory generator can generate different locations and ships swing conditions rotating gyroscope and accelerometer data, inertial navigation systems for research)
    2013-08-29 09:49:03下载
    积分:1
  • Win32Timer
    基于Visual C++ 的win32控制台的程序,实现使用定时器的功能,(Visual C++ win32 console-based program, using the timer function,)
    2012-03-06 14:20:34下载
    积分:1
  • tvicport
    在WINDOWS 9X/NT下不通过WIN DDK而直接存取硬件的专用开发包,支持VISUAL C++和DELPHI/C++ BUILDER,需要32位编译器。TVicPort includes transparent support for Windows 95/98 and Windows NT (in Windows 9X/NT under WIN DDK is not passed directly access dedicated hardware development kits, support Visual C and Delphi/C BUILDER need 32 compiler. TVicPort includes transparent support for Windows 95/98 and Windows NT)
    2005-05-26 10:40:55下载
    积分:1
  • distance_between_two_lines
    对于给定的两个线段,程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)
    2009-03-25 16:04:31下载
    积分:1
  • tongxinlu
    通信录源程序。调试环境为TC2.0或者3.0。运行这个程序需要tc提供的几个头文件。(Example source address book, or 3.0 debugging environment for TC2.0. Tc run the program needs to provide several header files. )
    2011-12-05 15:03:16下载
    积分:1
  • caobiao
    基本7022芯片的抄表测试程序.代码与抄表终端一致(Basic 7022 chip meter test procedure. Code consistent with the meter reading terminal)
    2008-05-06 13:59:37下载
    积分:1
  • shiper
    Воронежский гос университет, задача по сям
    2009-10-11 01:30:49下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载