ngrep strives to provide most of GNU grep s common features, applying them to the network layer. ngrep is a pcap-aware tool that will allow you to specify extended regular or hexadecimal expressions to match against data payloads of packets. It currently recognizes TCP, UDP and ICMP across Ethernet, PPP, SLIP, FDDI, Token Ring and null interfaces, and understands bpf filter logic in the same fashion as more common packet sniffing tools, such as tcpdump and snoop.
標(biāo)簽： applying features network strives
上傳時(shí)間： 2014-01-15
上傳用戶：bcjtao
The same vulnerability to x_hp-ux11i_nls_ct.c,but exploit ping command to get root shell.
標(biāo)簽： vulnerability i_nls_ct exploit command
上傳時(shí)間： 2015-01-20
上傳用戶：aa17807091
An Overview of the C++ Programming Language
標(biāo)簽： Programming Overview Language the
上傳時(shí)間： 2014-01-08
上傳用戶：zhoujunzhen
Building a Device Driver in the IDE
標(biāo)簽： Building Device Driver IDE
上傳時(shí)間： 2014-06-10
上傳用戶：頂?shù)弥?/p>
Unique net-enabled GUI system based state of the art coding solutions with strong XML support.
標(biāo)簽： net-enabled solutions support Unique
上傳時(shí)間： 2013-12-24
上傳用戶：1101055045
The Ext2 Filesystem Utilities (e2fsprogs) contain all of the standard utilities for creating, fixing, configuring , and debugging ext2 filesystems.
標(biāo)簽： Filesystem Utilities e2fsprogs utilities
上傳時(shí)間： 2013-12-02
上傳用戶：fhzm5658
An open source clone of the Microprose game "Transport Tycoon Deluxe".
標(biāo)簽： Microprose Transport Deluxe Tycoon
上傳時(shí)間： 2015-01-21
上傳用戶：1583060504
A client/server application that implements the game of BINGO. This example broadcasts information via a multicast socket, builds its GUI with Swing components, uses multiple synchronous threads, and communicates with RMI.
標(biāo)簽： application information broadcasts implements
上傳時(shí)間： 2015-01-22
上傳用戶：二驅(qū)蚊器
mosquiteo mobile iP 4 the handover program
標(biāo)簽： mosquiteo handover program mobile
上傳時(shí)間： 2014-11-28
上傳用戶：aig85
Tug of War(A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other the number of people on the two teams must not differ by more than 1 the total weight of the people on each team should be as nearly equal as possible. The first line of input contains n the number of people at the picnic. n lines follow. The first line gives the weight of person 1 the second the weight of person 2 and so on. Each weight is an integer between 1 and 450. There are at most 100 people at the picnic. Your output will be a single line containing 2 numbers: the total weight of the people on one team, and the total weight of the people on the other team. If these numbers differ, give the lesser first. )
上傳時(shí)間： 2014-01-07
上傳用戶：離殤
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
