ebookProject

说明：  前端框架基础，demo可供参考，请不要随意转载，(String to JSON, object to JSON)

GPS测试仪，主要完成方位定位，经纬度，海拔，速度，时间(Positioning GPS tester to complete orientation, latitude, longitude, altitude, speed, time)

Tests of basic UI logic in the AccountSetupOptions screen for Andriod.

高等院校计算机应用技术硕士研究生课程,高级计算机网络程序设计实例子代码,GUI部分.(Master of Computer Application Technology tertiary post-graduate courses, advanced computer networks, programming examples of sub-code, GUI part.)

lucene开发demo例子及源码包，包中的文档有demo介绍，多种组合得索引建立(Lucene demo examples and source code development package, the package of documents has demo introduce a variety of combinations may Indexing)

自定义struts框架，使用了工厂设计模式，以及注释(Custom struts framework, using a factory design pattern, and notes)

这是利用.net开发的,其中用到了orm方法(面向对象的方法),是NHibernate,该工具是从java开发的hibernate引申过来的.该程序对初学者非常不错!(use. Net development, which uses the Vector method (object-oriented approach), is NHibernate, the tool is the development of java exploit extended overnight. The program is very good for beginners!)

自1996以来，JavaScript：权威指南已经programmers-a JavaScript程序员指南、核心语言综合参考和API定义的Web浏览器的客户端JavaScript圣经。第六版包括HTML5和ECMAScript 5，在jQuery和服务器端JavaScript的新篇章。这是推荐有经验的程序员谁想学习网络编程语言，和当前的JavaScript程序员要掌握它。(Since 1996, JavaScript: The Definitive Guide has been the bible for JavaScript programmers—a programmer’s guide and comprehensive reference to the core language and to the client-side JavaScript APIs defined by web browsers. The 6th edition covers HTML5 and ECMAScript 5, with new chapters on jQuery and server side JavaScript. It’s recommended for experienced programmers who want to learn the programming language of the Web, and for current JavaScript programmers who want to master it.)

Artificial immune system

直接运行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)