A book describing a overall process of developing Eclipse RCP proce
标签： describing developing Eclipse overall
上传时间： 2014-01-24
上传用户：66666
to search a character in a string and print the addre
标签： character search string addre
上传时间： 2016-07-29
上传用户：shanml
this a puttyt his is a puttythis is a putty
标签： puttythis puttyt putty this
上传时间： 2014-01-16
上传用户：ggwz258
M a t l a b 中读取视频avi文件的小程序
上传时间： 2016-09-28
上传用户：xwd2010
FCP takes a file, generates a random 2048 bit key and encrypts the file with a RC4 stream cipher. The encrypted file is written to a new file along with the decryption stub and key. When the output file is executed it decrypts and executes the encrypted file. It s written in Delphi 6, enjoy the source code.
标签： file generates encrypts cipher
上传时间： 2013-12-08
上传用户：爺的气质
/* Here s a small IPv4 example: it asks for a portbase and a destination and starts sending packets to that destination. 这个IPv4版的例子：它要求portbase(本地端口)与destination （目的端口）然后发送消息 同时还监听消息。 例子测试一： 启动一个运行实例，本地地址与目标地址用同一个端口8888 例子测试二： 启动两个运行实例，本地地址与目标地址用不同的端口（它要求是偶数端口号） 两个实例互发 例子的中文解释都由hanyuejun添加，有任何疑问请发hanyuejun2006@163.com */
标签： destination and portbase example
上传时间： 2014-01-14
上传用户：tianjinfan
This text shows how to analyze programs without its source code, using a debugger and a disassembler, and covers hacking methods including virtual functions, local and global variables, branching, loops, objects and their hierarchy, and more.
标签： disassembler debugger programs analyze
上传时间： 2013-12-23
上传用户：ljmwh2000
CRC32: Generating a checksum for a file
标签： Generating checksum file CRC
上传时间： 2016-12-15
上传用户：frank1234
计算全息close all clc clear A=zeros(64) A(15:20,20:40)=1 A(15:50,20:25)=1 A(45:50,20:40)=1 A(30:34,20:35)=1 ％ ppp=exp(rand(64)*pi*2*i) A=A.*ppp ％ Author s email: zjliu2001@163.com figure imshow(abs(A),[]) Fa=fft2(fftshift(A)) Fs=fftshift(Fa) Am=abs(Fs) ％ amplitude Ph=angle(Fs) ％ phase s=11 ％ 这表示边长吗？ cgh=zeros(64*s) th=max(max(abs(Fs)))
上传时间： 2014-10-13
上传用户：wweqas
A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as far to the left as possible. The data associated with all descendants of a node are smaller than the datum associated with this node.
标签： tree conditions completely satisfying
上传时间： 2014-01-01
上传用户：gundan
