pwcl190226

说明：  基于powerbuilder的报时源代码，适合初学者学习使用(Learning source code)

改程序包括了四种数字水印的隐写分析。四种方法都还不错。(Reform program, including four digital watermarking steganalysis. Four methods are pretty good.)

说明：  LABVIEW 串口通讯又一例，设置简单，使用方便(LABVIEW Series)

利用C#语言与vs开发工具实现了一个，简单的桌面贪吃蛇游戏(A simple desktop snake-eating game is implemented by using C# language and vs development tools.)

搜集了九篇有关粒子群优化算法的论文（已在公开杂志上发表）-Collected 9 Particle Swarm Optimization on the paper (in a public journal)

seacms v6.54 full update

说明：  python gui开发基础，一些简单的pythonGUI代码(the base of python GUI)

平衡二叉树操作的演示 一、 需求分析 （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程序非常使用的，简单的程序！直接复制就可以运行的！对二级考试很有用！(c program is very to use, simple procedure! Replication can be run directly! Examination is useful for two!)

嵌入式开发的u-boot命令介绍 加快你的开发进度-Embedded Development u-boot your order on accelerating the development progress