WHAT MIME64 IS: MIME64 is an encoding described in RFC1341 as MIME base64.Its purpose is to encode binary files into ASCII so that they may be passedthrough e-mail gates. In this regard, MIME64 is similar to UUENCODE.Although most binaries these days are transmitted using UUENCODE, Ihave seen a few using MIME64, and I have had requests from friends thatI decode MIME64 files that have fallen into their hands. As long assome MIME64 continues to exist, a package such as this one is usefulto have.
标签： MIME described 64 encoding
上传时间： 2013-12-17
上传用户：maizezhen
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
标签： project implement developed Database
上传时间： 2013-12-25
上传用户：semi1981
Bing is a point-to-point bandwidth measurement tool (hence the b ), based on ping. Bing determines the real (raw, as opposed to available or average) throughput on a link by measuring ICMP echo requests roundtrip times for different packet sizes for each end of the link
标签： Bing point-to-point measurement determines
上传时间： 2015-09-15
上传用户：lgnf
第7章 Java B/S结构编程 实例76 简单的Servlet程序 实例77 简单的留言簿 实例78 JSP+Java Bean的计数器 实例79 数据库查询 实例80 文件的上传下载 实例81 收发E-mail 实例82 B/S结构的聊天室 实例83 网上选课 实例84 B/S结构的商业应用——购物车 实例85 通过JSP调用Applet程序 实例86 JSP与XML的结合
上传时间： 2013-12-23
上传用户：skfreeman
)一个PB的应用程序, 能实现以下功能: a.新增员工资料 b.修改员工资料 c.删除员工资料 d.按姓名查找员工资料(能模糊查找, 例如输入"林", 则所有姓或名中含有"林"字的 员工全列出来.) e.系统启动时, 针对今天为该员工生日的, 则自动弹出提示进行祝福. 2) 员工资料的数据必须有: 工号(为主键), 姓名, 出生日期, 入职日期, 部门, 职务 3) 数据库类型为ASA8.0
上传时间： 2016-01-03
上传用户：BIBI
n皇后问题求解(8<=n<=1000) a) 皇后个数的设定 在指定文本框内输入皇后个数即可,注意: 皇后个数在8和1000 之间(包括8和1000) b) 求解 点击<Solve>按钮即可进行求解. c) 求解过程显示 在标有Total Collision的静态文本框中将输出当前棋盘上的皇后总冲突数. 当冲突数降到0时,求解完毕. d) 求解结果显示 程序可以图形化显示8<=n<=50的皇后求解结果. e) 退出程序,点击<Exit>即可退出程序.
上传时间： 2016-01-28
上传用户：ztj182002
Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结束：dis即为所有点对的最短路径矩阵 3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。 考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
标签： Floyd-Warshall Shortest Pairs Paths
上传时间： 2013-12-01
上传用户：dyctj
第7章 Java B/S结构编程 253 实例76 简单的Servlet程序 254 实例77 简单的留言簿 256 实例78 JSP+Java Bean的计数器 258 实例79 数据库查询 260 实例80 文件的上传下载 262 实例81 收发E-mail 267 实例82 B/S结构的聊天室 269 实例83 网上选课 276 实例84 B/S结构的商业应用——购物车 282 实例85 通过JSP调用Applet程序 285 实例86 JSP与XML的结合 2
上传时间： 2016-03-07
上传用户：maizezhen
Program main BIOS image | | /B - Program Boot Block | | /N - Program NVRAM | | /C - Destroy CMOS checksum | | /E - Program Embedded Controller Block | | /K - Program all non-critical blocks | | /Kn - Program n th non-critical block only(n=0-7) | | /Q - Silent execution | | /REBOOT - Reboot after programming | | /X - Don t Check ROM ID | | /S - Display current system s ROMID | | /Ln - Load CMOS defaults
标签： Program Destroy Block NVRAM
上传时间： 2016-07-26
上传用户：wfl_yy
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
