Every day, patches are created to cover up security holes in software applications and operating systems. But by the time you download a patch, it could be too late. A hacker may have already taken advantage of the hole and wreaked havoc on your system. This innovative book will help you stay one step ahead. It gives you the tools to discover vulnerabilities in C-language-based software, exploit the vulnerabilities you find, and prevent new security holes from occurring.
标签： applications operating security software
上传时间： 2015-11-01
上传用户：fhzm5658
Suck Wrappers are a set of UNIX script files that sets up inn, an NNTP server, on a local machine so that suck can communicate with a News server supplied by an ISP . It also installs a set of wrapper scripts (based on the sample scripts provided with the suck tar ball) that call suck with the correct settings to communicate with an ISP on a linux machine. (Tested on Redhat 7.2 and 9).
标签： Wrappers machine script server
上传时间： 2015-11-07
上传用户：tedo811
Simple MVC demo,This demo app should be pretty easy to set up. There are no dependencies on databases or any other external features.
标签： demo dependencies databas Simple
上传时间： 2015-11-10
上传用户：tedo811
实现UP、DOWN原语 产生3个进程： 两个进程模拟需要进入临界区的用户进程。 当需要进入临界区时，显示：“进程x请求进入临界区…”，同时向管理进程提出申请； 申请返回，表示进入了临界区。在临界区中等待一段随机时间，并显示：“进程x正在临界区…”； 当时间结束，显示：“进程x退出临界区…”,同时向管理进程提出退出申请； 当申请返回，显示：“进程x已退出临界区。” 一个进程作为原语的管理进程，接受其他进程的临界区进入请求： 如果允许进入，则根据DOWN 原语的操作步骤设置相应变量，然后返回； 如果不允许进入，则进入循环等待，直到允许为止； 退出时模拟UP 操作。 进程间通信可以采用信号、消息传递、管道或网络通信方式。
上传时间： 2013-12-30
上传用户：yangbo69
two counters pick up data from two encoders.
标签： two counters encoders pick
上传时间： 2013-12-16
上传用户：xymbian
C#高级编程(第三版),顶死你们。。 。up
标签： 高级编程
上传时间： 2013-11-28
上传用户：zhouchang199
ISCSI target.It can be used to make up a IPSAN system.
上传时间： 2014-01-16
上传用户：zsjzc
运输问题的解,解决的双层规划的问题,up是上层文件
上传时间： 2015-11-27
上传用户：gxf2016
how to set up c++test_70_gettingstarted.
标签： gettingstarted test how set
上传时间： 2013-12-20
上传用户：jiahao131
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
标签： Traveling Salesman solution Problem
上传时间： 2013-12-04
上传用户：从此走出阴霾
