端口扫描

AMR WB+ 基于3GPP标准的宽带Adaptive Multi-Rate - Wideband 实现(3rd Generation Partnership Project Technical Specification Group Services and System Aspects Speech codec speech processing functions Adaptive Multi-Rate- Wideband (AMR-WB) speech codec ANSI-C code )

一些简单基础的计算方法用C语言的方式运行进行处理(Some simple basic calculation methods are processed by running in C language.)

AURIX TC297 HSSL 从模式例程(AURIX TC297 HSSL Slave Mode demo)

数字系统1.1是一个好的应用系统之间转换为四个号码(十进制、二进制、十六进制、八进制)。你可以转换所有8位、16位和32位无符号数W(Digital system 1.1 is a good application to convert between four numbers (decimal, binary, hexadecimal, octal). You can convert all 8-bit, 16-bit and 32-bit unsigned number W)

研究生英语课后习题答案 对研究生英语考试很有帮助 注意收藏-Answers to post-graduate students in English after-school English exam Exercises helpful attention to Favorites

针对水轮机调节系统PID参数辨识问题，作者在VC++6.0环境下，使用c语言，编写PID参数参数辨识程序，结果表明，该程序能够辨识出Kp,Ki,Kd三个参数，满足调节系统的误差要求。(Turbine regulating system for PID parameter identification problem, the authors VC++ 6.0 environment, using c language, the preparation of PID parameters of parameter identification procedures, results show that the program can identify Kp, Ki, Kd three parameters to meet conditioning systems error requirements.)

IEEE802.15.4的opnet仿真模型源代码，主要解决无线传感器网络MAC层的接入问题协议。(The IEEE802.15.4 opnet simulation model of the source code, mainly on the MAC protocol.)

source code for the test of adaptive linear prediction using RLS algorithm

DX0302-淘宝网店交易平台源码+网店转让出售求购源码 仿A5网店中介网站源码。 这是我们团队花钱买来别人的源码，希望对大家有用。

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)