gep4j

双色球随机选号易语言源码，应用程序编程源码，很好的参考资料。(Shuang Seqiu randomly selected, easy language source code, application programming source code, a good reference.)

c#.NET Socket实现的IP包监控和发送-c#.NET Socket IP packet monitor and send

说明：  详细介绍了MeasurementStudio的控件在VC中的使用方法，难得的好文章。(Introduce how to use ActiveX of MeasurementStudio s in VC)

网页特效5，文字的上下移动，动态的变化颜色，艺术字的设置。-netnew 5, the text up and down, and dynamic changes in color, art character set.

职工信息控制系统 c++语言 (Information Control System staff c++ language)

网页信息采集子系统： 网页采集：动态查找及实时分析新增网页，读取网页回帖信息。 网页过滤：，对获取的网页，通过网页清洗模块清除网页中的广告、导航信息、 图片、版权说明等噪声数据，萃取出相关网页的标题、正文、链接地址、采集时 间、回帖、发帖人数等数据。 网页信息预处理子系统： 网页审查脏字：主要功能包括中文分词、词性标注、命名实体识别、新词识别， 建立数据库说明每类词库，建立敏感词词库。 网页舆情监测：监测是否出现了一定影响的舆论，即回帖的回帖或支持、顶等 达到一个预先设定的阈值； 舆情分析子系统： 汇总网站舆情：汇总整个网站的舆情监控信息，自动生成报告。(Web information collection subsystem: the pages collection: dynamic lookup and real-time analysis of the new website, read pages Replies. Web filtering: to clear advertising pages, navigation information, images, copyright noise data access pages via web cleaning module, extract the relevant page title, text, link address, acquisition time, posts, posting number and other data. Web information preprocessing subsystem: Web review dirty: The main features include the Chinese word segmentation, POS tagging, named entity recognition, new word identification, to establish a database description of each type of thesaurus, and the establishment of a sensitive word thesaurus. Page opinion monitoring: monitoring whether there is a certain influence public opinion, that a reply to the post or support other top reaches a preset threshold public opinion analysis subsystems: summary website public opinion, public opinion monitoring information: summary of the entire site, automatically generate re)

说明：  解包贴图文件 Unpackaged Mapping FileUnpackaged Mapping File(Unpackaged Mapping Mapping document)

一个对日期编写的函数。 在VC6.0下实现。(Date of preparation of a function. Achieved in VC6.0.)

java project for students

和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。(and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trails Discriminant to whether the map graph may seek non- graph the various connectivity components, but with the right plan (net), the minimum spanning tree or shortest path depends on the edge of the arc or the right values, the need for a specific algorithm.)