Untitled3

M7lrvCMS商业版最终版本 破解版功能齐全 如cms识别 c段查询 后台扫描 shell管理 批量注入等功能(M7lrvCMS commercial version of the final version of the cracked version is fully functional, such as CMS recognition C segment query background scanning, shell management, batch injection and other functions.)

采样返回上位机，上位机处理后串口发送至单片机，实现pid调节，需配合simulink使用(Sampling is returned to the upper computer. After processing, the upper computer sends the serial port to the single chip computer to realize PID regulation. It needs to be used with simulink.)

软件简介： 调查投票系统介绍： 可生成网上可见的多数调查系统投票系统， 支持同时产生多套调查投票， 可自定义题目类型（如单选+多选，单选+文字，纯文字等类型） 可自由更换界面，使用时提交和提交成功界面均是纯Html格式。 随时可对使用中投票调查进行更改，随时查看调查结果。 投票还原功能，可以将统计结果还原成各个投票者的投票情况。 -software brief : Investigation voting system introduced : Visibility can be generated on-line survey system of the majority voting system, while generating support multiple investigations to vote, since the definition of topic types (eg danxuan choose, radio text, text and other types) are free to replace the interface, use the submission and the author successful interface is pure html format. Ready to use poll for changes at any time to see results. Voting reduction function can be reduced to statistical results of all voters vote.

最近点对问题，输入数据生成器自动生成2位点对，输出制定电的最近邻-nearest point of the problem, the input data generator automatically generate two points right, electrical output of the nearest neighbor

UR机器人脚本语言,里面是V3.5版本，使用UR机器人做上位机控制的时候方便查询(Script of UR robot)

Hassan K. Khalil的非线性系统第三版英文版、课后系统答案以及到2017年书中错误更正(Nonlinear Systems_Hassan K. Khalil_3rd_2002, Solutions Manual and errata)

这个程序包里有3个部分：直播服务器，接收端插件，接收端例子。详细内容看文档。-this procedure bundle of three parts : a live server, plug-in receiver, the receiver example. Detailed contents of files.

蚁群算法的原理以及实现，提及到蚁群算法的7个特点。（c++）-The principle of ant colony algorithm and the realization of a reference to the seven characteristics of ant colony algorithm. (C++)

8051 assembly language source code for 2x16 LCD dş splay

用于求三组数，每组数的各个位都不相同。第二组数为第一组的2倍，第3组数为第一组的3倍(Is used to find the number of three, the number of the bits in each group are different. The second number of groups for the first group of two times the number of the third group of three times the first group)