<strike id="e4o6w"></strike>
This text introduces the spirit and theory of hacking as well as the science behind it all it also provides some core techniques and tricks of hacking so you can think like a hacker, write your own hacks or thwart potential system attacks. 譯作：《黑客入侵的藝術》，也是從朋友的寶箱中搜來的，以前層大致瀏覽過，是難得一件的好資料。
標簽： introduces the hacking science
上傳時間： 2013-12-28
上傳用戶：離殤
With the information in this book, you will learn how to write not only JavaScript that can stand on its own within a Web page, but also how to write scripts that interact with applications written in other development languages.
標簽： information JavaScript learn stand
上傳時間： 2014-01-04
上傳用戶：silenthink
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
Overview Provides a way to store very large collections of email addresses (100,000+ addresses) and efficiently check whether a specific address is contained in a collection. The collection can be created programmatically, or through a pluggable persistence mechanism. Functionality Maintains large collections of email addresses. Efficiently checks whether an address is in the collection or not.
標簽： addresses collections Overview Provides
上傳時間： 2013-12-17
上傳用戶：xg262122
RTL-lwIP is the porting of the lwIP TCP/IP stack to RTLinux-GPL.The focus of the RTL-lwIP stack is to reduce memory usage and code size, making RTL-lwIP suitable for use in small clients with very limited resources such as embedded systems.
標簽： RTL-lwIP the stack RTLinux-GPL
上傳時間： 2015-09-05
上傳用戶：
The combined demo is dedicated for S1C33L05, so DMT33L05 should be used to load and run the demo. For the detail description of DMT33L05, please refer to S5U1C33L05D1_User_Manual.
標簽： demo dedicated combined should
上傳時間： 2014-07-05
上傳用戶：lili123
Gcomm is a serial communications program similar to seyon, but more modern, and easier to use. Works over serial port, via TCP/IP, or a pipe through another program. Supports xmodem/ymodem/zmodem protocols. Visit the gcomm.sourceforge.net home page for 系統是 Linux ，但是協議部分是可用的
標簽： communications program similar easier
上傳時間： 2013-12-21
上傳用戶：PresidentHuang
The EM Wave MATLAB Library consists of a collection of MATLAB programs related to electromagnetic wave scattering with special emphasis on wave scattering by random rough surfaces and discrete random media.
標簽： MATLAB electromagnetic collection consists
上傳時間： 2015-09-06
上傳用戶：alan-ee
form sqlserve to sybase my msn is machine_jak@hotmail.com
標簽： machine_jak sqlserve hotmail sybase
上傳時間： 2014-01-10
上傳用戶：ukuk
Introduction to the MSN Messenger Activity SDK --- --- --- --- --- --- --- --- --- --- --- --- --- -- The MSN® Messenger Activity software development kit (SDK) contains technical information about how to develop and test single-user and multiuser applications by using the Activity object model. The SDK also provides detailed information about the MSN development and testing requirements that your Activity must meet, and how to increase the usage of your MSN Messenger Activity application.
標簽： Introduction Messenger Activity the
上傳時間： 2015-09-06
上傳用戶：ruan2570406
<strike id="c6c42"></strike>
<center id="c6c42"></center>