inversecgls

本软件为易语言编写的一个小游戏,旨在思路的激发,程序本身没什么难度-software for the easy language of a small game, the idea is to inspire, the process itself little more difficult

说明：  4乘4矩阵键盘stm32f103开发板。 消抖。 col列，Pin配置为PP推挽输出模式； row行，Pin配置为Input模式，启用内部上拉电阻(4 times 4 matrix keyboard STM32F103 development board. Shake off. Col column, pin is configured as PP push-pull output mode; Row, pin is configured in input mode, and internal pull-up resistor is enabled)

利用PSO粒子群搜索算法,辨识PID参数:Kp,Ki,Kd.结果表明虽然该方法辨识精度不是很高,但是也有一定可信度.(Use english PSO Particle Swarm algorithm, identification of PID parameters: Kp, Ki, Kd. The results show that although the method is not very high recognition accuracy, but it also has a certain credibility.)

说明：  一个vivado和matalab混合编程的信号发生器，注意要把vivado里面的核文件路径改一下(A signal generator with mixed programming of vivado and matalab, pay attention to changing the path of the core file in vivado)

一个关于网站权限管理的经典例子,适合初学者-On the Web site of the classic examples of rights management, suitable for beginners

本文我将向你展示一些技巧，让你可以在远程地访问网络中其他计算机的操作系统、服务、当前运行着的进程等等信息，当然前提是你必须得拥有这些计算机的管理员权限。同时我也将向你展示如何利用WMI来启动或者停止服务、终止进程、创建进程。-this paper I will show you some skills, so you can remotely access the network to other computer"s operating system, services, the current running process information, etc., of course, the premise is you have to have these computer administrator privileges. I will also show you how to use WMI to start or stop service, termination process, the creation process.

大连理工出版社，数据结构与算法（第三版）ppt-Dalian Science and Technology Press, Data Structures and Algorithms (third edition) ppt

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

资源描述学生信息管理系统，c语言代码编写，简单易懂

The C++ Cookbook will make your path to mastery much shorter. This practical, problem-solving guide is ideal if you re an engineer, programmer, or researcher writing an application for one of the legions of platforms on which C++ runs. The algorithms provided in C++ Cookbook will jump-start your development by giving you some basic building blocks that you don t have to develop on your own.