sie_gp75

source code of dsdv protocol in tcl for NS2

小区物业管理:管理小区的费用、小区工作人员的编排和工资管理、小区的运作、对住户资料的管理、房产资源管理、小区事务的管理、对住户的需要管理、停车场管理-Area property management: the management of district costs, district staff scheduling and payroll management, district operations, information on household management, property resource management, district management of the affairs of the household needs of management, car park management

HTML5浪漫表白文字动画特效网页，粒子文字动画特效，效果不错，创意很好，本源码显示的文字内容是某某深爱某某直到永远，网页文字动画内容可以自己定义。(HTML5 romantic character animation special effect web page, particle character animation special effect, the effect is good, the creative is very good, the source of the text is the text content is so and so for forever, the content of the page text animation can be defined by themselves.)

说明：  Spi connect to mmc tested is ok

这个是BRISTOL大学 大二的作业. 当时得了90多分所以如果有国外留学生朋友可以看看.-University sophomore operations. Then scored more than 90 hours if there are foreign students friends can see.

toolkit 安装,可以在windows和LINUX系统安装(toolkit install you can install in all systems)

说明：  不用封装好的函数，自己编写函数实现直方图均衡。对图像进行平滑处理。(Do not wrap functions, write their own functions to achieve histogram equalization.The image is processed smoothly.)

停用词表扩展，里面有所有的常用的停用词，在信息检索时需要进行去高频词的操作，就需要停用词表，需要的下载-Disable vocabulary expansion, which have all the common stop words, in the information retrieval to the high-frequency words when the need for the operation, you need to stop word table, need to download

自己整理的英语的有关于阅读的东西，有助于考验哦！-finishing his English reading on the things that contribute to the test!

说明：  在具有至少十五个节点的网络中模拟洪泛路由。每个数据包应包含一个计数器（n = 10），该计数器在每一跳上递减。(Simulate flood routing in a network with at least fifteen nodes. Each packet should contain a counter (n=10) that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, and each link can handle only one packet per time interval (i.e. only one packet in total may traverse the link in either direction). Nodes should include a buffer to queue any additional packets. Present your results in terms of the number of duplicate packets produced, and the congestion at each node, and suggest a possible solution for reducing this problem.)