This code will be useful to you if you have tried using ADOCE, but never got anything to work. It is not meant to be integrated into any application, but rather it should be used for demonstrative purposes. It clearly shows the basics of how to use the technology.
We intend to develop a wifi enabled p2p file sharing system on a linux platform using jxta and java. The purpose is to build a system that can be ported to an embedded device at a later stage and be used for p2p file sharing using the 802.11b standard. 我們旨在Linux平臺上使用jxta 和java來開發一個支持wifi的p2p文件共享系統。其目的是建造一個以后可以移植到嵌入式設備的系統,使用802.11b標準進行p2p文件共享。 來源: http://sourceforge.net/projects/linux-p2p-wifi/
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.
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. )