Although it is a small example, but it is basically a C polymorphism meaning! It...

以PDU串的形式发送出去的，中文字符以Unicode码来表示，所以在发送中文短消息之前必须首先将中文字符转换为Unicode码-PDU string in the form of sending out the Chinese characters to Unicode code to express, so before sending Chinese text messages must first Chinese characters will be converted to Unicode code

用java开发终端平台上的Application程序， 比使用C++,Delphi等语言更加容易。 java语言似乎天生就适合团队开发。但是，摆在广大java开发者面前的一个难题是，客户端必须安装JRE。真的必须安装JRE吗？其实你可以不装，只要使用Java Runner,无论在哪里，你的程序都可以Run起来。-spent on the terminal platform Application procedures, the use of C, Delphi and other languages easier. Java language seem naturally fit team development. However, the majority of java placed in front of the development of a problem is, the client must be installed JRE. Really must install the JRE? Actually, you can not, only use Java Runner, regardless of where your program can Run up.

Flex调试原代码，在编写时用于对程序组件的调试-failed to translate

本源代码是模仿2048游戏，实现原理自定义view。里面有详细注释。其中有view两种方式，一种是纯数字，另外一种是图片，图片资源需要自己添加上去。本代码仅供参考，若引用，请注明来源。若有更好的实现，请指教。

-- Simple Robot Control Program -------------------------------------------------------------------------- library IEEE use IEEE.STD_LOGIC_1164.all use IEEE.STD_LOGIC_ARITH.all use IEEE.STD_LOGIC_UNSIGNED.all

很实用的关于vb方面的.ocx控件-Vb on practical aspects of. Ocx control

通过一个别人提供的VCdll获得硬盘ID和CPU序列号-VCdll provided by others to obtain a hard disk ID and the CPU serial number

电子文档，基于互信息的图像配准，配准的文献为局部互信息，还有香农信息论文献-Electronic documents, based on mutual information image registration, registration of documents for the partial mutual information, as well as the Shannon information theory literature

COBOL实验源码，大家可以下载在主机环境上实验，内容比较多-Experimental COBOL source, you can download in the host environment experiments, the content more

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.