JSP and SQL SERVER messages of this: by using sql server and a message of the js...

Corba EventServices Basic

学生成绩管理系统，有源程序及实验总结，适合学生大作业-Student achievement management system, has summed up the source code and experiment is suitable for students operating

Most code samples included on this CD were developed with Microsoft Visual C++ version 5.0 and the Microsoft Windows CE Toolkit for Visual C++ version 5.0. The Sspi and Crypto samples were developed with Microsoft Visual C++ version 6.0 and the Microsoft Windows CE Toolkit for Visual C++ 6.0. The code in sample applications is ported for a Handheld PC, but the programming concepts that are presented apply to all Windows CE-based platforms. -Most code samples included on this CD were d eveloped with Microsoft Visual C version 5.0 an d the Microsoft Windows CE Toolkit for Visual C v ersion 5.0. The Sspi and Crypto samples were dev eloped with Microsoft Visual C version 6.0 and t he Microsoft Windows CE Toolkit for Visual C 6.0 . The sample code in applications is ported for a Handheld PC, but the programming concepts that are presente d apply to all Windows CE-based platforms.

微信公众平台是腾讯公司在微信的基础上新增的功能模块，通过这一平台，个人和企业都可以打造一个微信的公众号，可以群发文字、图片、语音、视频、图文消息五个类别。例子中主要就几个问题举例了几个。

对“程序”菜单的编程，包括增加目录、增加程序、删除目录、删除程序等等。-right "procedures" menu of programming, including increasing the directory, add procedures, delete directory, delete procedures.

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

偏微方程数值解法中显式格式的c语言程序，刚刚开始练习编程，希望各位多多指教。-Partial Differential Equations numerical computation Explicit format c language program has just begun to practice programming, I hope the exhibitions.

windows mobile 下的一个测试程序。-a test under windows mobile

程序完成功能是在Visual C++ 6.0中实现三叉切分窗口与多视图。运行环境为Win 2000；Microsoft Visual C++ 6.0-Procedures are completed function in Visual C++ 6.0 to achieve the trigeminal segmentation and multi-view window. Runtime environment for Win 2000 Microsoft Visual C++ 6.0

一个漂亮的时钟，vb做的 -clock