写号步骤： 1、将手机连通CDMA Workshop 2.7，在security选项卡里的 spc中点击读取，将000000填入spc里的方框，点击spc钮选择send， 于是显示spc解锁成功。 2、点击“nam”选项卡，将min填入10位码（就是imsi码去掉46003剩下的），将mcc填入460，mnc填入03，填入imsi15位码，banner填入你想填的字符（我填的中国电信），点击写入即可 3、这一步，就应该写入akey码了（如果不知道AKEY，可以通过电信机房关闭鉴权，但是不推荐这样做，有盗号风险），点击“cave”选项卡，在a-key后的方框 填入你的akey，点击写入即可。 4、重启6950，能够打电话了 针对白三角以及1X上网问题，请注意： 1、如果有白色三角漫游标记，通过将PRL由003升级到008解决方法是 ：拨##778#，输入SPC码，即000000，点击VIEW 中PRI后点EDIT，将拷贝到机子中的prl文件浏览选到，点击OK升级 2、CDMA 1X无法上网的解决方法： 拨##778#，输入SPC码，即000000，点击VIEW 中M.IP后将“Mobile IP Only ”改为“simly IP only” SPC在内存中的地址：018E:0190（只要输入018E）
上传时间： 2013-12-29
上传用户：ainimao
Each exploration in this book is a mixture of text and interactive exercises. The exercises are unlike anything you鈥檝e seen in other books. Instead of multiple choice, fill-in-the-blank, or simple Q&A exercises, lessons are interactive explorations of key C++ features.
标签： exercises exploration interactive mixture
上传时间： 2017-05-14
上传用户：whenfly
The 2D CFD Program NaSt2D The program is a 2D solver for the incompressible, transient Navier-Stokes equations including the temperature equation and free boundary problems. It uses finite differences for discretization on a structured equidistant staggered grid, central and upwind (donor-cell) discretization of the convective parts and an explicit time stepping scheme. The free boundary value problems are treated with the MAC technique.
标签： incompressible Navier-Sto The transient
上传时间： 2013-11-30
上传用户：xfbs821
VLSi KL partitioning Algorithm based programme for 100 nodes. It s dynamic progremme so by changing the MAX value we can change the number of nodes in the network.
标签： partitioning Algorithm programme progremme
上传时间： 2013-12-05
上传用户：wweqas
< content="Hello,sik" Dim oFCKeditor Set oFCKeditor = New FCKeditor oFCKeditor.BasePath = "../fckeditor/" oFCKeditor.ToolbarSet = "Default" oFCKeditor.Width = "550" oFCKeditor.Height = "400" oFCKeditor.Value = content oFCKeditor.Create "Content" >
标签： oFCKeditor FCKeditor BasePath content
上传时间： 2017-05-20
上传用户：zhuoying119
* 使用DES加密与解密,可对byte[],String类型进行加密与解密 密文可使用String,byte[]存储. * * 方法: void getKey(String strKey)从strKey的字条生成一个Key * * String getEncString(String strMing)对strMing进行加密,返回String密文 String * getDesString(String strMi)对strMin进行解密,返回String明文 * *byte[] getEncCode(byte[] byteS)byte[]型的加密 byte[] getDesCode(byte[] * byteD)byte[]型的解密
上传时间： 2014-01-13
上传用户：libinxny
Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. if a pair is a repeated letter, insert filler like X’ 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
标签： monoalphabetic Playfair provides security
上传时间： 2017-05-25
上传用户：变形金刚
用维吉尼亚算法加密 /** * 维吉尼亚密码算法(BigDecimal)，加/解密处理后仍为BigDecimal类型，正负号和小数点不进行处理 * * @param str * 源BigDecimal * @param key * 密钥，应为数字字符组成的字符串 * @param mode * 模式（加密or解密） * @return 加/解密后的BigDecimal
标签： BigDecimal 算法 加密 密码算法
上传时间： 2013-12-23
上传用户：yyyyyyyyyy
三星程式范例，八位元的 timer, counter, serial I/O, clock switching, power down, key scan, A to D, software generated LCD control, ...
上传时间： 2013-12-17
上传用户：zhengzg
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
标签： code Compression huffman provide
上传时间： 2017-05-30
上传用户：yuchunhai1990
