mainamplitudecomparison

simple base of game hack

用C语言实现的闹钟程序.rar- Alarm clock procedure realizes which with the C language rar

北大青鸟accpPPt3.0test课件(Beida Jade Bird accpPPt3.0test Courseware)

很好的opencv入门文档，后续上传其他相关-good opencv entry documents, the follow-up to other relevant Upload

说明：  Gnuplot是一款命令行科学数据绘图软件，功能强大，本文件为gnuplot 5.2官方使用手册，pdf版(Gnuplot is a powerful command-line scientific data mapping software. This document is gnuplot 5.2 official manual, PDF version.)

说明：  流场计算，圆柱绕流问题，流体流过圆柱，流场会发生改变，绕流问题(Flow field calculation, flow around a cylinder)

说明：  With intelligent databases grouped by tables and ordered according to words, the search engines form a dynamic global encyclopedia with huge storage capacity. In the literature consulted different nomenclatures are used to designate search engines. Authors such as Ledford (2008) and Enge et al. (2010), call it "search engine", but there are some authors, such as Jerkovic (2010), who use the name "search tool" and others still use only the name "search engine" or "search tool". In this work, it will be used as main term "search engine" to facilitate the understanding of the reader. According to Valdes (2007), there are differences between each mechanism

说明：  一款效果非常酷的jQuery和CSS3多种风格的响应式3D幻灯片特效插件(A very cool jQuery and CSS3 multi-style responsive 3D slide effects plug-in)

收集的一组跟噪声产生以及消除、衡量消噪性能指标的MATLAB仿真源代码，每个文件夹下都附有对该代码的注解！-gathered with a group and the elimination of noise, the weighing-noise performance indicators MATLAB simulation source code, Each folder with all of this code notes!

平衡二叉树操作的演示 一、 需求分析 （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