hadoop-eclipse-plugin-1.2.1

根据Lennard-Jones 分子相互作用模型，利用计算机数值模拟方法，对一定空间内有 限粒子的运动情况进行模拟，分析粒子的运动位置、速度分布(According to Lennard-Jones molecular interaction model, the use of computer simulation methods, for certain limited space to simulate the movement of particles, particle motion analysis of position, velocity distribution)

ftp线程实现包括在java语言中实现，实现很简洁，效率高。(FTP thread implementation is implemented in Java language, which is very concise and efficient.)

磁法日变改正程序，用于处理野外采集的数据进行日变改正。(Magnetic diurnal variation correction procedures)

orcad library files for something

综合了国内外各种购物程序的特点,取长补短,真正做到了系统的健壮性和稳定性达到 极至。该商城系统界面简介、不花哨、运行速度快，管理功能全面、易操作，深受广 大企业、白领、个人创业者的喜爱，是您开办网上商店的理想系统。-combination of domestic and international procedures of the various shopping features, learn from each other, really robustness of the system to achieve stability and association. The mall system interface descriptions, not garish, fast and comprehensive management capabilities, easy operation, the widespread enterprises, white-collar workers, the individual entrepreneurs alike, is that you run the online store the ideal system.

Ce5.61 源码 visual Basic(Ce5.61 source visual Basic)

采用API实现的文件拖放,可以学习的源码,推荐给大家(API implementation of the file drag-and-drop, can learn the source, recommended to everyone)

DISCRETE ELEMENT METHOD AND ITS PRACTICE ON EDEM4

本文件夹中的Model目录下包含了系统的数据库模型图和系统建模图，分别使用PowerDesigner(the folder directory Model of the system contains a database model maps and map system modeling, using PowerDesigner)

直接运行compile.bat和run.bat即可 使用了3种分词方法： 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理 若单个字不处于当前句子开头，先忽略， 若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)