资源列表
SmtpClient
- 用java实现的SMTP客户端程序，可以作为期末的大作业或者毕设-SMTP implementation with java client program can serve as a major operation or completion of final design
wince-web-server-webcomp
- 利用GoAhead构建嵌入式web应用。在wince环境下的webcomp程序。-/* * webcomp-- Compile web pages into C source * * Copyright (c) GoAhead Software Inc., 1995-2000. All Rights Reserved. * * See the file "license.txt" for usage and redistribution license requirement
RTPexample1
- 基于JRTPLIB的，用RTP协议在UDP/IP的基础上进行网络流传输的第一个例子。-Based JRTPLIB, using RTP protocol UDP/IP networks on the basis of the first example of stream.
chat_room
- 局域网聊天室，用于简单的局域网聊天功能，适合初学者学习和练习-The LAN chat rooms for simple LAN chat function, suitable for beginners to learn and practice
array
- 数组的运算，本代码是主要是一些数组运算，希望大家喜欢。-Array of computing, this code is mainly some array operation, hope you like them.
aodv18.tcl
- AODV is adhoc on demand routing protocol.It is a basic reactive routing protocol in wireless adhoc networks.This tcl scr ipt file is an executable ns file.It consists of 12 mobile nodes.
broadcast-example.csc.tar
- broadcast-example protocole RPL under Contiki 2.6
talk
- 客户端与服务器端通过网络套接字实现聊天功能-client and server talk with socket
111
- 在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。 每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所耗体力之和。 因为还要花大力气把这些果子搬回家，所以多多在合并果子时要尽可能地节省体力。假定每个果子重量都为1，并且已知果子的种类数和每种果子的数目，你的任务是设计出合并的次序方案，使多多耗
icf
- cortex m0 lpc1114 icf file
Potts
- Potts code for matlab
PROBATIONERLORHO3776SALESMANTVWQT48
- 找了这么久的源码，今天终于找到了这个源码 PROBATIONERLORHO3776SALESMANTVWQT48，同学们可以学习参考-Source for so long, today finally found the source PROBATIONERLORHO3776SALESMANTVWQT48, students can learn the reference